{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010254264,0.0000067184887,0.97725415,0.002348899,0.00053732883,0.019332979,0.000006397339,0.00006185678,0.0003491082],"genre_scores_gemma":[0.07125842,3.383749e-7,0.86385703,0.0022429044,0.0023323926,0.060191743,0.000010567126,0.000032006574,0.00007457539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979303,0.00008759979,0.00078646996,0.00030540655,0.0006276271,0.0002626174],"domain_scores_gemma":[0.99696994,0.00023878299,0.00065080303,0.00043565652,0.0014676586,0.00023714917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008338992,0.0001805048,0.00023153535,0.00024970583,0.000078742116,0.00044322983,0.0024625838,0.000071015376,0.000012510064],"category_scores_gemma":[0.000019730694,0.00016489715,0.00019430091,0.00022410996,0.00004990246,0.0004935465,0.00036121882,0.00019934893,0.000028868224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007508612,0.0020790047,0.0017402482,0.00008672628,0.000703852,0.00012614494,0.0012638005,0.36096984,0.00029126366,0.11159653,0.13430963,0.3860821],"study_design_scores_gemma":[0.0029054624,0.0002656389,0.000040090163,0.00009272601,0.0000075831476,0.00041095886,0.0000065525323,0.68672335,0.00037216445,0.013670354,0.2953225,0.00018264727],"about_ca_topic_score_codex":0.0000037366271,"about_ca_topic_score_gemma":0.0000039334695,"teacher_disagreement_score":0.38589945,"about_ca_system_score_codex":0.00022247665,"about_ca_system_score_gemma":0.00030429836,"threshold_uncertainty_score":0.6724311},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032705726,0.0466818,0.8483089,0.003138496,0.00015068901,0.0015012948,0.0000022961287,0.00085655006,0.099032894],"genre_scores_gemma":[0.7320696,0.07967979,0.16300777,0.0026175664,0.00010802315,0.0007899145,0.00016255361,0.00025528588,0.021309502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809647,0.00006495009,0.00061880425,0.00058325287,0.00024819933,0.0003883388],"domain_scores_gemma":[0.99696285,0.0001346917,0.00045967448,0.0022800628,0.0001032151,0.000059480903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009080638,0.0003195908,0.00042822756,0.000748026,0.00018139456,0.00013433081,0.002770122,0.00076479436,0.000028180055],"category_scores_gemma":[0.000005499956,0.00036008286,0.00006756934,0.00037781356,0.00026823842,0.0002257582,0.0018216474,0.0010795746,0.000019942907],"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.0000033102745,0.000023272129,0.00001358959,0.000026133182,0.00002407978,0.00001936501,0.000039649713,0.00007913673,0.0000048925695,0.59979486,0.000053883992,0.39991784],"study_design_scores_gemma":[0.0010428809,0.000219871,0.00007764681,0.0016639422,0.000052472235,0.00002818002,0.000044846747,0.1912789,0.00010614817,0.71055657,0.09391342,0.0010151456],"about_ca_topic_score_codex":0.0000044564526,"about_ca_topic_score_gemma":0.00021351836,"teacher_disagreement_score":0.73174256,"about_ca_system_score_codex":0.000111176516,"about_ca_system_score_gemma":0.000035939396,"threshold_uncertainty_score":0.99988514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.166393,0.001965046,0.82467425,0.004597219,0.0012964159,0.00024132132,7.988975e-7,0.000045489385,0.0007864348],"genre_scores_gemma":[0.9918932,0.00014550122,0.0075747734,0.00013027676,0.00020842589,0.000017255657,0.000002959824,0.00001086678,0.00001679171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676174,0.0008398054,0.0010172637,0.00015916234,0.0009688957,0.00025310484],"domain_scores_gemma":[0.99628425,0.00076705543,0.0005802746,0.0007396348,0.0015351502,0.00009361129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004261497,0.00010395302,0.00021073343,0.0005678387,0.00008529014,0.0005142291,0.003824205,0.00007784013,0.0000064877986],"category_scores_gemma":[0.00032986136,0.00009853869,0.00008674286,0.00069741136,0.000076741664,0.00076053664,0.0004200152,0.00066007243,0.000021200436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056948946,0.00024072269,0.0035624949,0.0000030955212,0.00006799733,0.000077114564,0.0012799038,0.7797158,0.00022607631,0.20232548,0.00026889113,0.012175506],"study_design_scores_gemma":[0.0024036923,0.00013217615,0.0066664754,0.001672276,0.0000042641855,0.00017018786,0.0007199451,0.9794086,0.00040516432,0.0051630195,0.0030630908,0.00019110054],"about_ca_topic_score_codex":0.00028912042,"about_ca_topic_score_gemma":0.000107389584,"teacher_disagreement_score":0.82550013,"about_ca_system_score_codex":0.0006197623,"about_ca_system_score_gemma":0.00021618351,"threshold_uncertainty_score":0.7106388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016811833,0.0002482995,0.9947897,0.00064303743,0.0018337277,0.001241062,0.000024438965,0.00019631242,0.0008552582],"genre_scores_gemma":[0.24116829,0.00005055179,0.74978375,0.0049780416,0.0006868757,0.00016262793,0.000059073955,0.00011084068,0.0029999495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956708,0.000045962573,0.0006074159,0.0021068403,0.00070042926,0.0008685701],"domain_scores_gemma":[0.99695915,0.0006759209,0.00035508114,0.0014268953,0.0003350261,0.00024792724],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006513125,0.0007868301,0.0007173831,0.0006026777,0.00017434411,0.0016629027,0.003313402,0.0005461426,0.000056431025],"category_scores_gemma":[0.00007542215,0.00066248805,0.00015456181,0.00042097812,0.00060834945,0.0011165239,0.0012732265,0.00091645814,0.000030310182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028450751,0.00005401819,0.000023177847,0.00016972356,0.000040646424,0.00008859517,0.0006062964,0.013509648,0.00025154022,0.5095144,0.0007970391,0.4749165],"study_design_scores_gemma":[0.0003902045,0.00028818627,0.000012223911,0.00042608238,0.000011171472,0.000041376126,1.9043574e-7,0.7975513,0.0016600688,0.19687293,0.0021021457,0.00064411614],"about_ca_topic_score_codex":0.000064228865,"about_ca_topic_score_gemma":0.00014236779,"teacher_disagreement_score":0.78404164,"about_ca_system_score_codex":0.0002703417,"about_ca_system_score_gemma":0.0004503704,"threshold_uncertainty_score":0.99958265},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088307593,0.0014881885,0.13475017,0.0019533702,0.0016534653,0.12895118,0.00014835647,0.0009930776,0.72917914],"genre_scores_gemma":[0.01652628,0.00018973682,0.38498768,0.000789185,0.0052122697,0.06501437,0.000095773015,0.0008507074,0.526334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729973,0.000033699867,0.0010212036,0.00055628753,0.0004163657,0.00067273877],"domain_scores_gemma":[0.9976246,0.00040314952,0.00058419484,0.0011930745,0.00007549075,0.000119538316],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0014366113,0.00046513398,0.0007300846,0.00021966224,0.000050935218,0.00018085791,0.0013732903,0.0015078393,0.00009488555],"category_scores_gemma":[0.000089686124,0.00047990834,0.00010378654,0.00010336964,0.000060564074,0.00027333974,0.0006408909,0.0024360674,0.000064687],"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.000008175521,0.00021058285,0.00024019362,0.0016339783,0.00004201517,0.000088766865,0.0059579727,0.00048842,0.0000030621618,0.9457911,0.003047045,0.042488676],"study_design_scores_gemma":[0.00069248775,0.0000838368,0.000025703695,0.0055045816,0.000012433816,0.000028697405,0.00003511074,0.06262389,0.00013597937,0.8475493,0.0823866,0.00092136895],"about_ca_topic_score_codex":0.000010168697,"about_ca_topic_score_gemma":0.00005245637,"teacher_disagreement_score":0.2502375,"about_ca_system_score_codex":0.00022804755,"about_ca_system_score_gemma":0.000118912336,"threshold_uncertainty_score":0.99986535},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028325365,0.16298968,0.5960244,0.002145718,0.0031188417,0.002050794,0.000005655757,0.00045827383,0.23317832],"genre_scores_gemma":[0.0017920958,0.18851523,0.65202004,0.023965677,0.0021122417,0.00019761034,0.000013569955,0.00021881654,0.13116473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99558437,0.000035400903,0.00068029057,0.0020388723,0.0008732333,0.000787859],"domain_scores_gemma":[0.9965987,0.0001321031,0.00032864008,0.0022727628,0.00031075682,0.0003570316],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012372527,0.00062501314,0.0008019258,0.00046554,0.00019854923,0.00143931,0.0039876783,0.0002922345,0.00012680549],"category_scores_gemma":[0.000018213279,0.0005907575,0.00011407218,0.00072693155,0.00074447,0.0018265035,0.0036772026,0.0010761428,0.00026341164],"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":[6.377342e-7,0.000015139767,0.000008896937,0.0008010748,0.000012104523,0.00018306228,0.00012657857,0.000039495008,0.000005900742,0.7149217,0.0038380623,0.28004733],"study_design_scores_gemma":[0.0009805717,0.0005112778,0.0016861864,0.05203391,0.0000985193,0.0016233951,8.8668503e-7,0.18393259,0.00004879435,0.12747335,0.6265546,0.0050559063],"about_ca_topic_score_codex":0.000008889241,"about_ca_topic_score_gemma":0.000008438276,"teacher_disagreement_score":0.62271655,"about_ca_system_score_codex":0.00021033958,"about_ca_system_score_gemma":0.0002843899,"threshold_uncertainty_score":0.9996544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016285747,0.00010581978,0.993372,0.00020215102,0.0003162185,0.0004732051,0.0000053237095,0.00004504816,0.0038516177],"genre_scores_gemma":[0.9690047,0.000015387286,0.029915666,0.0007480803,0.00018920323,0.000012408699,0.0000017941026,0.000031716056,0.00008103167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964144,0.00008949515,0.000555962,0.00127195,0.00092120597,0.0007469671],"domain_scores_gemma":[0.99635935,0.0012210571,0.00036664758,0.0018040455,0.00012754998,0.00012135564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011112811,0.00054368353,0.0006726307,0.0004192856,0.00013907046,0.00024630784,0.0033795037,0.00023998479,0.0000059388262],"category_scores_gemma":[0.00012373095,0.0003644602,0.00022925863,0.00075598276,0.0006000392,0.00028576743,0.00084310374,0.0011729252,0.000009126808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006477661,0.000044017972,0.000025462115,0.000009995999,0.000008446257,0.000034435914,0.0008303373,0.89248943,0.000027262582,0.07079957,0.000050593975,0.035673987],"study_design_scores_gemma":[0.00016971993,0.00015462177,0.000089503796,0.00027686008,0.000003937005,0.000022281965,6.4587304e-8,0.7387649,0.00006103537,0.26017827,0.0000044111775,0.00027439636],"about_ca_topic_score_codex":0.00008730434,"about_ca_topic_score_gemma":0.00006156229,"teacher_disagreement_score":0.9673761,"about_ca_system_score_codex":0.00041276668,"about_ca_system_score_gemma":0.0004715446,"threshold_uncertainty_score":0.99988073},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025845984,0.00024479988,0.96401846,0.0014360772,0.0029124895,0.00085877103,0.0000072608323,0.00043999002,0.004236155],"genre_scores_gemma":[0.99092233,0.0005558656,0.0044402094,0.0021246474,0.0011873203,0.00032742662,0.00004929541,0.000032272255,0.00036060953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997012,0.000103605395,0.00059642695,0.0009983394,0.00056915334,0.00072044495],"domain_scores_gemma":[0.9977998,0.00038744553,0.00037281896,0.0007724514,0.00045240327,0.00021507694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004599295,0.00042640846,0.00036586303,0.00020368023,0.00037562306,0.000549084,0.0017586948,0.00031583183,0.00007636149],"category_scores_gemma":[0.000052757026,0.00042650255,0.00021443101,0.00044226964,0.000064724576,0.0005135001,0.0002079462,0.0007131927,0.00003903751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017569149,0.00018072904,0.00005691392,0.000001970247,0.000043454314,0.000011912854,0.000067918416,0.12511948,0.00026855464,0.19527301,0.0007534872,0.6780469],"study_design_scores_gemma":[0.00073244446,0.00096278277,0.0008712127,0.00020821641,0.000007987695,0.000012979456,0.000021276812,0.9888865,0.00026121223,0.0029012654,0.0046918336,0.0004423322],"about_ca_topic_score_codex":0.000004777774,"about_ca_topic_score_gemma":0.000051581188,"teacher_disagreement_score":0.9650764,"about_ca_system_score_codex":0.00025930975,"about_ca_system_score_gemma":0.00008266783,"threshold_uncertainty_score":0.9998187},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000798216,0.00052260526,0.97451705,0.0001805469,0.0054098633,0.001443497,0.0000036777883,0.00050809217,0.01733486],"genre_scores_gemma":[0.09862645,0.00014347046,0.8688887,0.0014051979,0.004193767,0.0002577923,0.000013365507,0.00022377983,0.026247503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99316794,0.000045412173,0.0010737808,0.0028497837,0.001099729,0.001763373],"domain_scores_gemma":[0.9950968,0.00072908064,0.0007924419,0.002387447,0.00057268306,0.00042152076],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023229036,0.00091744756,0.0009653682,0.0005392483,0.00071605656,0.0024035173,0.007257298,0.0005097668,0.000023666316],"category_scores_gemma":[0.00015379107,0.000947586,0.00030490992,0.0006164116,0.0007579493,0.001496442,0.0041721496,0.0013740736,0.000054268254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048606244,0.000041415766,0.000083884195,0.000074985655,0.000023804105,0.000067674584,0.00046554877,0.027606279,0.000021201276,0.5131836,0.001030371,0.4573964],"study_design_scores_gemma":[0.00048270138,0.00008638767,0.0005700135,0.0009858637,0.000010555336,0.00003499773,0.0000017172455,0.9843435,0.00004522163,0.0055377297,0.006781641,0.001119655],"about_ca_topic_score_codex":0.0001018162,"about_ca_topic_score_gemma":0.00010392039,"teacher_disagreement_score":0.9567372,"about_ca_system_score_codex":0.00057114847,"about_ca_system_score_gemma":0.00045606232,"threshold_uncertainty_score":0.99929744},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0827806,0.000007855762,0.9080817,0.0001371224,0.0000960673,0.00016086017,2.8388592e-7,0.000058665395,0.008676868],"genre_scores_gemma":[0.9940735,6.7692133e-7,0.0054036514,0.00031835143,0.000048757807,0.000003330254,0.0000011532693,0.000004964065,0.0001456186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991975,0.000030023128,0.00018352548,0.0001697388,0.0002393508,0.00017987602],"domain_scores_gemma":[0.9986676,0.0006404971,0.00006861915,0.00053151994,0.00005728794,0.000034483342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005134085,0.00007199099,0.000080673446,0.00003963199,0.000049538576,0.000029689727,0.0005558201,0.000045521443,0.000064014246],"category_scores_gemma":[0.000016159735,0.000045959277,0.000030519524,0.00027411638,0.000023308206,0.00020106713,0.00011997566,0.00008500564,0.000010598805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043508817,0.000016665976,0.00001949222,0.0000013077365,0.000002398223,7.596516e-7,0.000045403027,0.7536232,0.0000064219053,0.23588541,0.0006098936,0.009784688],"study_design_scores_gemma":[0.00009778678,0.0000342333,0.0003335473,0.0000040189634,0.0000011937525,6.8528806e-7,0.000008289557,0.9829289,0.00044141483,0.015862986,0.00022957571,0.000057402947],"about_ca_topic_score_codex":0.000019729068,"about_ca_topic_score_gemma":0.00003872444,"teacher_disagreement_score":0.9112929,"about_ca_system_score_codex":0.000016696144,"about_ca_system_score_gemma":0.000013041267,"threshold_uncertainty_score":0.1874165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035706848,0.00061638164,0.9613498,0.00002865471,0.0010431495,0.0010206266,0.000011925795,0.00010031668,0.00012231657],"genre_scores_gemma":[0.877092,0.0003714046,0.122186124,0.000068303256,0.0000111398695,0.00023178112,0.0000070169617,0.000005407985,0.000026816035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982979,0.000030562915,0.00076608366,0.0002576509,0.00026787815,0.00037988293],"domain_scores_gemma":[0.998389,0.000095104224,0.0005419075,0.00070577837,0.00020260476,0.00006560531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000633247,0.00017125571,0.0002737721,0.0003223195,0.00023942423,0.00031273032,0.0009231387,0.00012728086,9.259598e-7],"category_scores_gemma":[0.000076848504,0.00013389224,0.00007216946,0.0010631601,0.0006058158,0.0025765996,0.0004610102,0.0001500587,0.0000013009218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017831939,0.000050629737,0.00053521176,0.00007579263,0.000019145476,0.0000015077663,0.0016821717,0.20069161,0.000004304777,0.086075835,0.0005895377,0.7102564],"study_design_scores_gemma":[0.00060961716,0.00028068296,0.00071978965,0.00006850985,0.0000036534386,0.000009667024,0.00010161056,0.5817323,0.00010659963,0.00031970246,0.41587326,0.00017466284],"about_ca_topic_score_codex":0.000003997917,"about_ca_topic_score_gemma":0.000024479286,"teacher_disagreement_score":0.8413852,"about_ca_system_score_codex":0.00004731404,"about_ca_system_score_gemma":0.0000753829,"threshold_uncertainty_score":0.5459967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5700207e-7,0.00029022514,0.92479205,0.00039929492,0.0012214558,0.071531795,0.0000059338345,0.0002892858,0.0014693794],"genre_scores_gemma":[0.00022731474,0.000109829445,0.9460994,0.0023698919,0.0022080014,0.047826312,0.000022241777,0.00011243353,0.0010245461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452287,0.00005552598,0.0008028201,0.0024101676,0.0010479703,0.001160652],"domain_scores_gemma":[0.99584144,0.00087783847,0.0005934333,0.0018158458,0.0004782995,0.0003931657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007584806,0.00084556016,0.0007855118,0.0005792192,0.00045257626,0.0006501507,0.004163871,0.00069924456,0.000062699255],"category_scores_gemma":[0.000094783245,0.00079774705,0.00031664368,0.0007829519,0.00047949833,0.00094612344,0.0013227228,0.0011769921,0.00004834421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034829536,0.000025041098,0.0000024979008,0.00004719626,0.000013798675,0.00007854588,0.00040927852,0.034929823,0.0000049895025,0.0008457787,0.0020463895,0.96156186],"study_design_scores_gemma":[0.0015161549,0.00075417385,0.000023268807,0.0011677204,0.000013249735,0.00023297046,1.02114356e-7,0.8420259,0.00020805483,0.09262269,0.06013257,0.0013031501],"about_ca_topic_score_codex":0.000009954127,"about_ca_topic_score_gemma":0.00010223211,"teacher_disagreement_score":0.96025866,"about_ca_system_score_codex":0.00042954355,"about_ca_system_score_gemma":0.0013146605,"threshold_uncertainty_score":0.99944735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017792126,0.000053108102,0.97953916,0.00037743687,0.00032584142,0.00028642584,9.0650053e-7,0.00013085494,0.0014941188],"genre_scores_gemma":[0.6761435,0.0000020796688,0.3233461,0.00008877847,0.00016252068,0.00002389312,0.0000015431998,0.0000068401896,0.00022474557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875665,0.000022337743,0.00028509315,0.00032241488,0.00017240038,0.00044111378],"domain_scores_gemma":[0.99912435,0.0002653111,0.000088885026,0.00035893067,0.00007419702,0.00008831023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003466475,0.00011196415,0.00017780339,0.000023636996,0.00011122095,0.00006145817,0.00040385243,0.00009711466,0.000017436168],"category_scores_gemma":[0.00006578605,0.00010373031,0.00008752984,0.00028678417,0.000049717764,0.0003200364,0.00025946522,0.00014429388,0.0000036154981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001641075,0.000060996255,0.00004119893,0.000006085686,0.000011329184,0.0000017066031,0.00008551908,0.7925099,0.00032093874,0.19692077,0.00046152392,0.009563631],"study_design_scores_gemma":[0.0008373566,0.00017912236,0.00031866156,0.000021692487,0.000004648238,0.000015791937,0.0000066427106,0.9950254,0.0012391768,0.0020944735,0.00012600367,0.00013103483],"about_ca_topic_score_codex":0.000054539574,"about_ca_topic_score_gemma":0.000009890048,"teacher_disagreement_score":0.65835136,"about_ca_system_score_codex":0.00005602947,"about_ca_system_score_gemma":0.00008997703,"threshold_uncertainty_score":0.42299992},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053123098,0.00014944891,0.83507305,0.00017865596,0.00021531012,0.15754247,5.131622e-7,0.0005934022,0.0061940122],"genre_scores_gemma":[0.0061896006,0.000020708243,0.121469036,0.00079981727,0.00034911963,0.8668963,0.0000016674436,0.00003141651,0.0042423736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998327,0.00004322547,0.00031215337,0.0005394874,0.00020363665,0.00057447824],"domain_scores_gemma":[0.9986422,0.00020160351,0.0000977361,0.0008152567,0.00009365435,0.00014956425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024247642,0.00019725475,0.00019781702,0.00006446934,0.0001737867,0.0002484645,0.0009896486,0.00011501651,0.00038862095],"category_scores_gemma":[0.000020156856,0.00017040574,0.00011511707,0.0005099964,0.00002866125,0.00047929384,0.00026420897,0.00014961354,0.000114194714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019570422,0.00025297026,0.00007613322,0.00004065877,0.000027211103,0.000009819253,0.00022885985,0.028175939,0.000043761258,0.011519732,0.17727752,0.78232783],"study_design_scores_gemma":[0.00067132374,0.00022230436,0.00001548166,0.000020025807,0.000002052834,0.0000056491617,0.000004118482,0.66872156,0.00012217167,0.0002268913,0.32982013,0.00016827673],"about_ca_topic_score_codex":7.379571e-7,"about_ca_topic_score_gemma":0.0000071130044,"teacher_disagreement_score":0.78215957,"about_ca_system_score_codex":0.000043170196,"about_ca_system_score_gemma":0.000012299695,"threshold_uncertainty_score":0.69489443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008671303,0.00069064565,0.9952679,0.00011465201,0.0015234125,0.0008374991,0.000004004309,0.00006968104,0.00062505034],"genre_scores_gemma":[0.9612084,0.00027965498,0.037043925,0.0008898928,0.00044740379,0.000017503835,0.000011721252,0.000046876936,0.00005461497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579746,0.00006157909,0.00092534797,0.0015596069,0.000836072,0.0008199314],"domain_scores_gemma":[0.9971663,0.0006037179,0.0005647047,0.0012045413,0.00024948939,0.00021125477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010636556,0.00062145875,0.0008088769,0.00087676785,0.00012894806,0.00026525516,0.0021635164,0.00076995784,0.00001230303],"category_scores_gemma":[0.00003976746,0.00060252886,0.00009772008,0.00084631826,0.0011005256,0.00046752155,0.0010284996,0.001203747,0.0000026903508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018693307,0.000018852508,0.00009783836,0.000041907402,0.000010928806,0.00014826334,0.0006819014,0.44310883,0.00006265835,0.011101123,0.00001640607,0.5446926],"study_design_scores_gemma":[0.00042631605,0.00018181879,0.00034063464,0.00052471005,0.000006765117,0.00015727202,2.8521987e-7,0.979942,0.0008265715,0.016870908,0.0001503962,0.00057228084],"about_ca_topic_score_codex":0.00002438384,"about_ca_topic_score_gemma":0.0002847083,"teacher_disagreement_score":0.9603413,"about_ca_system_score_codex":0.0002649492,"about_ca_system_score_gemma":0.00029265776,"threshold_uncertainty_score":0.9996426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110650584,0.0027377922,0.8826037,0.00006348231,0.00055355695,0.00049558777,3.397203e-7,0.0002896971,0.002605263],"genre_scores_gemma":[0.8553965,0.00031748123,0.14338306,0.00048095407,0.00008024838,0.00006963335,0.0000030802119,0.000020871032,0.00024817395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977954,0.00025539438,0.00045222748,0.0006040987,0.00024797398,0.00064490887],"domain_scores_gemma":[0.9984423,0.00050272094,0.00010551216,0.00074020063,0.00006780195,0.00014148279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068166776,0.0002275337,0.00026195307,0.00010474588,0.0001313768,0.00021446019,0.00067278213,0.000120822864,0.0001371134],"category_scores_gemma":[0.00010261627,0.00021664798,0.00006472268,0.0007502233,0.000037899397,0.0006846765,0.0002595664,0.00033731238,0.000076421085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000131665265,0.00019742348,0.0051020365,0.00002066788,0.00002712917,0.0001509832,0.0007287255,0.316612,0.00041560666,0.030939186,0.0016098351,0.6441832],"study_design_scores_gemma":[0.000730413,0.00012203271,0.0014589756,0.000077063436,0.000005061625,0.000024362802,0.000108923385,0.98481673,0.0002352531,0.0005147648,0.011472131,0.00043426326],"about_ca_topic_score_codex":0.000014498862,"about_ca_topic_score_gemma":0.00017990239,"teacher_disagreement_score":0.7447459,"about_ca_system_score_codex":0.000095430514,"about_ca_system_score_gemma":0.000062320985,"threshold_uncertainty_score":0.8834648},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013729977,0.0010140595,0.9804716,0.00066333154,0.0010422138,0.00063415937,0.000002301244,0.00046487243,0.001977479],"genre_scores_gemma":[0.95591384,0.000086513806,0.040204342,0.0006116603,0.0011319586,0.00034560863,0.000024951387,0.00004658271,0.0016345296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757564,0.000046897727,0.000365278,0.0007832752,0.0004936992,0.0007352275],"domain_scores_gemma":[0.99847025,0.0003663577,0.00016351351,0.0005804049,0.0002752344,0.00014423583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042802704,0.00028127522,0.00029179605,0.00012429249,0.0003269637,0.0005038607,0.0012649946,0.0001276978,0.00003496699],"category_scores_gemma":[0.000009802436,0.00021609968,0.000103218656,0.0008530947,0.000092139555,0.00045474357,0.00036043968,0.0002251939,0.000007795936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015092644,0.00040032153,0.0019074755,0.0000392148,0.000075084856,0.000040421648,0.00008626126,0.8913932,0.00024510865,0.030623801,0.017040692,0.057997536],"study_design_scores_gemma":[0.0008601111,0.00012612827,0.0024630916,0.000058241425,0.000014183678,0.000035710964,0.000011522306,0.982251,0.0009928144,0.000310849,0.01250217,0.00037421702],"about_ca_topic_score_codex":0.000058704325,"about_ca_topic_score_gemma":0.00034358565,"teacher_disagreement_score":0.94218385,"about_ca_system_score_codex":0.00009570152,"about_ca_system_score_gemma":0.00012349336,"threshold_uncertainty_score":0.8812289},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009495542,0.00010697218,0.88826215,0.00014716155,0.0005883529,0.109379776,0.0000042877823,0.00038728275,0.0010290607],"genre_scores_gemma":[0.09016311,0.000003871475,0.060160477,0.0010991493,0.0024449222,0.84500194,0.000010878594,0.000067544555,0.0010481178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975798,0.000086408654,0.00050214207,0.00071979617,0.00037815972,0.0007336632],"domain_scores_gemma":[0.9984322,0.00031986952,0.00022909668,0.0005747919,0.0002998688,0.00014415232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048355808,0.00029804162,0.00034350215,0.000110714165,0.0003095779,0.00050907,0.0011794651,0.00013862584,0.00007074792],"category_scores_gemma":[0.000015157217,0.00025670527,0.00017647976,0.0005262807,0.00007436598,0.0009900063,0.00031009674,0.00019771857,0.0000069255866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030910678,0.00053673325,0.00075968646,0.00006040096,0.00008007266,0.000025336833,0.000045865952,0.94491637,0.00057146366,0.008146399,0.024203908,0.020344635],"study_design_scores_gemma":[0.0033047693,0.00015886944,0.00030554077,0.000045763332,0.000010518526,0.000033221208,0.0000047585454,0.9719394,0.00033261627,0.0029305343,0.020602161,0.00033186845],"about_ca_topic_score_codex":0.00008164714,"about_ca_topic_score_gemma":0.00021348098,"teacher_disagreement_score":0.8281017,"about_ca_system_score_codex":0.00011277027,"about_ca_system_score_gemma":0.00014928302,"threshold_uncertainty_score":0.9999885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044370326,0.000012406349,0.96110696,0.0008132133,0.000016824935,0.017329933,1.3750086e-7,0.00017074903,0.016112763],"genre_scores_gemma":[0.68287104,0.0000016088106,0.2979554,0.00078670005,0.000086562526,0.017902825,5.8911814e-7,0.000008040994,0.00038725446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989219,0.000044738812,0.00023912912,0.00037496502,0.00014586981,0.0002734413],"domain_scores_gemma":[0.99943143,0.000052500993,0.00005826275,0.0003887115,0.000016031023,0.00005305357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339813,0.00010076804,0.00017157232,0.00014090718,0.00004999405,0.00015973797,0.00035592806,0.000044721335,0.000052073312],"category_scores_gemma":[0.000008338984,0.000087389184,0.000041625866,0.0010008704,0.000017113813,0.00046709762,0.0002905652,0.00011004957,0.000016775824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012347571,0.00014733188,0.096985266,0.000025929696,0.00014589552,0.000051372124,0.0021608814,0.04338587,0.000106619445,0.13163984,0.0005455325,0.72479314],"study_design_scores_gemma":[0.00032112445,0.00001609839,0.012195126,0.0000094407915,0.000008755215,0.000005655362,0.000014859772,0.9837357,0.000106322856,0.00035234695,0.0031128863,0.00012168596],"about_ca_topic_score_codex":0.000087780616,"about_ca_topic_score_gemma":0.0004908686,"teacher_disagreement_score":0.9403498,"about_ca_system_score_codex":0.000040555642,"about_ca_system_score_gemma":0.000015258996,"threshold_uncertainty_score":0.35636276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023959326,0.0052438215,0.9888623,0.00011916627,0.001316871,0.00085988035,0.0000012783617,0.00008979644,0.0011109598],"genre_scores_gemma":[0.7716352,0.0008129536,0.22635464,0.00076337,0.00028070106,0.000028640176,0.000009192966,0.00003554751,0.00007980275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947588,0.00010732005,0.00089197705,0.0015906243,0.0018674621,0.000783859],"domain_scores_gemma":[0.9966471,0.00029882803,0.00058806885,0.0017757143,0.000554348,0.00013591506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003232173,0.0005707649,0.0006946735,0.0008804867,0.00012853032,0.00023772795,0.004210384,0.0004889799,0.000019271658],"category_scores_gemma":[0.000034051955,0.0005491893,0.00011998306,0.0011714259,0.0004008835,0.00095380784,0.0010127163,0.0010027918,0.000013773912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039600222,0.000024493826,0.00014435957,0.00001931999,0.0000028299073,0.000006415003,0.00028956364,0.44015208,0.000008414371,0.00021968993,0.0000013752319,0.5591275],"study_design_scores_gemma":[0.0005973527,0.000205716,0.004723722,0.0010139581,0.000012296364,0.00001674066,1.5371127e-7,0.9857796,0.0000999384,0.006788448,0.00024831246,0.00051376515],"about_ca_topic_score_codex":0.000013875201,"about_ca_topic_score_gemma":0.0005204046,"teacher_disagreement_score":0.76923925,"about_ca_system_score_codex":0.00046930226,"about_ca_system_score_gemma":0.0005578314,"threshold_uncertainty_score":0.99969596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004371028,0.0024217505,0.9944375,0.00005818651,0.0015712127,0.00090159726,0.0000040165196,0.00011079329,0.000057841185],"genre_scores_gemma":[0.96769357,0.0031981599,0.008652325,0.00021194408,0.017962972,0.002137613,0.000024419654,0.000030550513,0.00008842475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983167,0.00009589458,0.0004136117,0.0006141715,0.00020163729,0.00035799996],"domain_scores_gemma":[0.9982404,0.00036556745,0.0002189779,0.00080709456,0.0001729641,0.000194999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031978163,0.00022191502,0.00038607547,0.00010845338,0.0002574591,0.00014876395,0.000575542,0.00021923936,0.000013734339],"category_scores_gemma":[0.0000033964563,0.00021711693,0.00007266324,0.0019643467,0.00011497732,0.00021887053,0.00029092288,0.00025164033,0.0000042511288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004062647,0.00016683468,0.0009163995,0.000010702469,0.00013836932,7.607673e-7,0.00005967407,0.94719356,0.000026347729,0.0016340145,0.0069257775,0.042923488],"study_design_scores_gemma":[0.0003325228,0.000048553335,0.0006149186,0.000010524017,0.00014194398,0.0000029333924,0.000012433737,0.9805765,0.000010243421,0.000048268623,0.01798983,0.00021132777],"about_ca_topic_score_codex":0.000058781992,"about_ca_topic_score_gemma":0.000058916354,"teacher_disagreement_score":0.9857852,"about_ca_system_score_codex":0.000016466627,"about_ca_system_score_gemma":0.000009618715,"threshold_uncertainty_score":0.88537717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022436287,0.0011147497,0.98364633,0.004179188,0.0008899606,0.0012365697,0.000018480594,0.0004051297,0.006265943],"genre_scores_gemma":[0.648144,0.00027396355,0.34839994,0.00042429537,0.00009675737,0.0011289322,0.00023297117,0.00007927337,0.0012199049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920328,0.0037418108,0.0009129061,0.0015543548,0.00068641856,0.0010716909],"domain_scores_gemma":[0.9903722,0.0027228482,0.00076232717,0.0047838055,0.0010120603,0.00034679225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0065531773,0.0006187942,0.00066442374,0.00039383018,0.00031306755,0.00061309134,0.004588548,0.0006803233,0.000036844172],"category_scores_gemma":[0.0001952197,0.00069092336,0.0003820423,0.0010087461,0.00018229337,0.00015379293,0.0038497935,0.0009975694,0.000013242137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015185234,0.0006620619,0.00021510932,0.00015940487,0.00007063202,0.0000084488765,0.0012361063,0.023859035,0.000008254967,0.80537593,0.0004162947,0.16797353],"study_design_scores_gemma":[0.00068073644,5.859809e-7,0.0006775764,0.0021689998,0.00004268494,0.0000025615113,0.000018342895,0.97285473,0.0009761386,0.016735107,0.005168338,0.00067419617],"about_ca_topic_score_codex":0.00089165,"about_ca_topic_score_gemma":0.001119904,"teacher_disagreement_score":0.9489957,"about_ca_system_score_codex":0.000360334,"about_ca_system_score_gemma":0.00022193471,"threshold_uncertainty_score":0.9995542},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045247856,0.0012067631,0.98601574,0.00020866522,0.0014124983,0.00020485952,9.472218e-7,0.0004326408,0.005993104],"genre_scores_gemma":[0.875875,0.000052697033,0.11349357,0.001599445,0.0009586912,0.00018175562,0.000010299591,0.00005133069,0.0077771917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797016,0.000055762328,0.00036725824,0.0006193195,0.00029033914,0.0006971716],"domain_scores_gemma":[0.9981394,0.00030642725,0.00013411388,0.0007943083,0.0002827691,0.00034302086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055965345,0.00022097857,0.00025136222,0.00005023285,0.00015906688,0.00045108094,0.0012780569,0.00015693532,0.0000119966],"category_scores_gemma":[0.000046708174,0.00020200327,0.0001057481,0.00040685444,0.0000652588,0.00057926297,0.0004958868,0.0001313802,0.000020314472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005917123,0.00008447893,0.00042450998,0.00001267806,0.000034108627,0.000023744411,0.0003398429,0.073095866,0.000034027365,0.11234667,0.06774764,0.7457973],"study_design_scores_gemma":[0.0007451368,0.00015074373,0.00005181058,0.00001720978,0.0000036349068,0.000018761522,0.000021787242,0.9155689,0.00014466417,0.002018681,0.080992155,0.00026651775],"about_ca_topic_score_codex":0.000021010963,"about_ca_topic_score_gemma":0.00006374792,"teacher_disagreement_score":0.8725222,"about_ca_system_score_codex":0.00007154724,"about_ca_system_score_gemma":0.00011246789,"threshold_uncertainty_score":0.8237454},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026374166,0.00017422385,0.9632338,0.009801419,0.00008645805,0.019992843,0.000016034797,0.005639603,0.0010292266],"genre_scores_gemma":[0.30316812,0.0001791587,0.43947762,0.00012952715,0.000010108955,0.2568362,0.000022188146,0.000042300842,0.00013479462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975783,0.00023013349,0.0006461923,0.00061130885,0.00035246517,0.0005815806],"domain_scores_gemma":[0.98947394,0.00044960866,0.00031068764,0.009036161,0.0006054927,0.00012409753],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007021296,0.00035213638,0.0003324937,0.00038400947,0.0013552017,0.00025313106,0.008319964,0.00029281812,0.000008388918],"category_scores_gemma":[0.00009616453,0.0003657087,0.00015477165,0.0015622241,0.0003530069,0.0010035975,0.00023684654,0.00070703874,0.00002143086],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045577086,0.0010723653,0.000024472274,0.000019467285,0.000079191836,6.8919996e-7,0.00096187985,0.011537616,0.00023655708,0.05460835,0.0018677004,0.9295461],"study_design_scores_gemma":[0.001680739,0.0006471947,0.000019961788,0.000137317,0.000030381394,0.000015774409,0.0022263322,0.73854333,0.0045978003,0.01631271,0.23506236,0.0007260877],"about_ca_topic_score_codex":0.000051466966,"about_ca_topic_score_gemma":0.00042725774,"teacher_disagreement_score":0.9288201,"about_ca_system_score_codex":0.0004353961,"about_ca_system_score_gemma":0.0003704134,"threshold_uncertainty_score":0.9999449},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001191844,0.0045729876,0.98834807,0.00017723131,0.001834207,0.0010712891,0.000006444058,0.00030721247,0.0035633482],"genre_scores_gemma":[0.37399212,0.0009014036,0.6210131,0.0021095749,0.0006998405,0.00013786748,0.000025033334,0.00015766677,0.0009633967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933504,0.000052893993,0.0010938675,0.0026510379,0.001138168,0.0017136605],"domain_scores_gemma":[0.9961112,0.00049590104,0.00054225436,0.0022949146,0.00026772654,0.0002879821],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015596587,0.0009288826,0.0010509187,0.00084087934,0.00028561056,0.0009099517,0.005516,0.0007572987,0.0000197693],"category_scores_gemma":[0.000060949442,0.00095052685,0.00019177698,0.0015843911,0.00066915975,0.0010892274,0.0028501062,0.0021370654,0.000024538582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004787234,0.00002873353,0.00003561361,0.00001493162,0.000004923591,0.00009740669,0.0003202109,0.6824482,0.000003384067,0.017843442,0.000011697032,0.29918665],"study_design_scores_gemma":[0.00047363556,0.00014463668,0.000012199357,0.00082679075,0.0000060892703,0.000044114116,4.812099e-7,0.88011616,0.000025241696,0.11717612,0.00031640803,0.00085810164],"about_ca_topic_score_codex":0.000029123094,"about_ca_topic_score_gemma":0.0023879034,"teacher_disagreement_score":0.37387294,"about_ca_system_score_codex":0.0025458648,"about_ca_system_score_gemma":0.0013269975,"threshold_uncertainty_score":0.99986464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018366053,0.0022751633,0.9636347,0.00040326754,0.001290302,0.00020385913,1.9220374e-7,0.00055920583,0.02979668],"genre_scores_gemma":[0.9090918,0.00016880584,0.072512805,0.0011250173,0.0009778446,0.000066513276,0.000012980646,0.000030946096,0.01601329],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845254,0.00005096645,0.00026634076,0.0004598165,0.0002539282,0.0005164146],"domain_scores_gemma":[0.9988688,0.00007677565,0.00007097034,0.0008238526,0.000050472147,0.00010912634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002178407,0.00017237804,0.00016742312,0.000055328317,0.000112523565,0.00021632572,0.0009400586,0.0000897059,0.00015809239],"category_scores_gemma":[0.0000040235186,0.00014746218,0.00008146169,0.0004545742,0.000031627816,0.00033686915,0.00033369486,0.00016966871,0.0001614136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008396203,0.00021514768,0.0010998371,0.0000075922394,0.000019143921,0.00006443173,0.00006288337,0.09324511,0.00010771454,0.22330017,0.40711117,0.2747584],"study_design_scores_gemma":[0.00036587758,0.000072358926,0.0013296214,0.00001336197,0.000005057789,0.000013455962,0.000004109624,0.74929285,0.00024339774,0.003200068,0.2451496,0.00031024835],"about_ca_topic_score_codex":0.000042250973,"about_ca_topic_score_gemma":0.00014538833,"teacher_disagreement_score":0.9072552,"about_ca_system_score_codex":0.000054273867,"about_ca_system_score_gemma":0.000032768527,"threshold_uncertainty_score":0.6013333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020664718,0.008250908,0.9869489,0.000049964736,0.0020847558,0.0018564265,0.0000033687143,0.000121736346,0.000477261],"genre_scores_gemma":[0.2001086,0.0032579007,0.78957534,0.0042632343,0.0010057201,0.00076427375,0.0000166858,0.00019457596,0.0008136362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952218,0.000057890196,0.00077911915,0.002141198,0.00060143566,0.0011985825],"domain_scores_gemma":[0.9972699,0.0006708163,0.00036007975,0.0013268492,0.00014206939,0.0002302565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014641938,0.0006816317,0.0007597602,0.0005854799,0.0002866972,0.000674023,0.0024348106,0.0005111885,0.000009812342],"category_scores_gemma":[0.000051849926,0.0006928079,0.00013469823,0.0006812352,0.00042572766,0.0006292081,0.0017851127,0.0009834615,0.0000045950555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005682428,0.000016947475,0.000051671715,0.000032844167,0.000005539462,0.000035583023,0.0005654061,0.359598,0.000006157965,0.0009044335,0.000028712402,0.638749],"study_design_scores_gemma":[0.0005405461,0.00037902308,0.000043532495,0.0005588134,0.0000064626,0.00006371462,5.657088e-7,0.97381425,0.000035174493,0.012778587,0.01105392,0.0007254387],"about_ca_topic_score_codex":0.0000045011507,"about_ca_topic_score_gemma":0.0001732236,"teacher_disagreement_score":0.63802356,"about_ca_system_score_codex":0.00039932347,"about_ca_system_score_gemma":0.00019489184,"threshold_uncertainty_score":0.9995523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076567302,0.000019167353,0.9890121,0.0006603638,0.00022332341,0.0010846029,0.0000025798665,0.00019257088,0.0011485291],"genre_scores_gemma":[0.9112961,0.0000013140076,0.08748594,0.00080177747,0.00012327645,0.00015343622,0.000018567576,0.000010972785,0.000108566004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986696,0.00003674457,0.00023954982,0.00039988244,0.00040365447,0.00025057295],"domain_scores_gemma":[0.998892,0.0001554362,0.00012056573,0.0005012829,0.00026331304,0.00006738614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279628,0.00012284164,0.00012857476,0.00006215223,0.00010776038,0.0001335256,0.00041867507,0.00009361772,0.000023024197],"category_scores_gemma":[0.000043891912,0.00011535263,0.000053972155,0.00021323231,0.00001221466,0.0007681111,0.000091163914,0.00007015406,0.000028776241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009439669,0.00002925578,0.0000084779585,0.0000053292047,0.000005383159,4.4501388e-7,0.000087037646,0.931527,0.000024797466,0.050398506,0.00020091319,0.01770342],"study_design_scores_gemma":[0.001060408,0.000048195576,0.00035917055,0.000011731355,0.000009613489,0.0000011568734,0.000009536798,0.93729246,0.00039423633,0.060521193,0.00015008067,0.00014224408],"about_ca_topic_score_codex":0.000019220503,"about_ca_topic_score_gemma":0.00005584609,"teacher_disagreement_score":0.90363944,"about_ca_system_score_codex":0.00013741638,"about_ca_system_score_gemma":0.00008125213,"threshold_uncertainty_score":0.47039437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023910256,0.00014656379,0.96776146,0.00081953785,0.00018343938,0.00026621216,0.000006118141,0.00011071375,0.006795674],"genre_scores_gemma":[0.9557191,0.0000020643645,0.042988095,0.00057764875,0.00009214381,0.000028173743,0.0000031955215,0.0000073513716,0.00058220554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887645,0.000047015867,0.00032384205,0.00031367678,0.0002008867,0.00023810442],"domain_scores_gemma":[0.9987559,0.000393251,0.00015390791,0.00054795126,0.00011199805,0.000037035763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004399368,0.00010166711,0.0001843629,0.000017070442,0.00006365986,0.000045243178,0.0005553013,0.00004492145,0.000009538017],"category_scores_gemma":[0.00002356062,0.00008838526,0.000061386534,0.00025765624,0.00001631088,0.00016403398,0.00009985085,0.000057765094,0.0000101177075],"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.000031188858,0.000105021376,0.0008828246,0.00007370199,0.000008719424,7.5921736e-7,0.00012016855,0.002386803,0.000757085,0.98326135,0.002776691,0.009595677],"study_design_scores_gemma":[0.0026679225,0.00042277807,0.08757059,0.00017641264,0.000012149776,0.0000029095004,0.00006405007,0.8110947,0.012878483,0.056760773,0.027422432,0.0009267751],"about_ca_topic_score_codex":0.00012385524,"about_ca_topic_score_gemma":0.0007351786,"teacher_disagreement_score":0.9318089,"about_ca_system_score_codex":0.000029950274,"about_ca_system_score_gemma":0.000034115776,"threshold_uncertainty_score":0.36042464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010523072,0.015013016,0.98134464,0.00010221579,0.00075546553,0.00069730513,0.0000021372744,0.000105389176,0.0009275347],"genre_scores_gemma":[0.78436327,0.003069273,0.21146086,0.00054868107,0.0003934621,0.000037809896,0.000003448995,0.00005125047,0.000071952985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536353,0.00006235728,0.00090869504,0.0018357874,0.0008696406,0.0009600153],"domain_scores_gemma":[0.9970309,0.0005758935,0.00047789497,0.0015371141,0.00017824315,0.00019996923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014030862,0.000625183,0.00087458605,0.0010418268,0.00014900936,0.00032044746,0.0030409868,0.0005509302,0.0000093885965],"category_scores_gemma":[0.000025094325,0.00061386067,0.00014514837,0.0010396418,0.0008807061,0.0009150258,0.0021383623,0.001331427,0.0000028070688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033310132,0.000016668564,0.00014736595,0.000014195942,0.0000048815346,0.000020084326,0.00031705064,0.47607186,0.000006065161,0.005546596,0.0000018319352,0.51785004],"study_design_scores_gemma":[0.0003210918,0.00016527854,0.00024010187,0.0006483483,0.0000062567433,0.000045346802,2.1404449e-7,0.9400392,0.00003324422,0.05755449,0.00039399954,0.0005524006],"about_ca_topic_score_codex":0.000019489325,"about_ca_topic_score_gemma":0.0003108087,"teacher_disagreement_score":0.78331095,"about_ca_system_score_codex":0.00017628902,"about_ca_system_score_gemma":0.0002556268,"threshold_uncertainty_score":0.9996313},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018775146,0.00093775435,0.9644905,0.0010504317,0.00038255667,0.00028597942,9.968458e-7,0.0005079849,0.013568685],"genre_scores_gemma":[0.9706579,0.0000438422,0.025918992,0.0016523005,0.00031289423,0.00006417359,0.0000042713013,0.000021595795,0.0013240598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808997,0.00011558536,0.0003051991,0.00058772904,0.00024563327,0.0006558747],"domain_scores_gemma":[0.9985924,0.0002552197,0.000117319796,0.00081321463,0.00010644268,0.00011543428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022372467,0.00024553193,0.0003397137,0.000065116474,0.00013879813,0.00018882185,0.0010025445,0.00016937642,0.00009338274],"category_scores_gemma":[0.0000051648926,0.00018839969,0.0000648722,0.00044678833,0.00013822081,0.0003488834,0.0001578249,0.00025441573,0.000042515683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017952625,0.00042393635,0.024539066,0.000018539811,0.00015245315,0.0003406391,0.00018863994,0.24852613,0.00007803922,0.50103253,0.045446757,0.17907374],"study_design_scores_gemma":[0.0025372219,0.00034168165,0.013136533,0.0000219601,0.00002329966,0.00013584962,0.000024347799,0.960607,0.00011755068,0.0024984158,0.01997341,0.00058276515],"about_ca_topic_score_codex":0.00008699186,"about_ca_topic_score_gemma":0.0006813266,"teacher_disagreement_score":0.9518827,"about_ca_system_score_codex":0.00004679925,"about_ca_system_score_gemma":0.00005969014,"threshold_uncertainty_score":0.7682716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079120713,0.00006199719,0.989019,0.007547383,0.00064099085,0.00086731266,0.000035288544,0.0005290322,0.0005078026],"genre_scores_gemma":[0.5639121,0.0000041827097,0.42119655,0.0038716625,0.0017916987,0.0002843663,0.00010319914,0.000049894326,0.008786346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973146,0.00004196956,0.00040801527,0.0007477935,0.0006328473,0.000854777],"domain_scores_gemma":[0.99762285,0.0003116699,0.0000889138,0.0009956604,0.0005725389,0.00040839196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006046981,0.00029025177,0.0003218628,0.00007067368,0.00018363292,0.0003306454,0.0013957772,0.00018184449,0.000079379206],"category_scores_gemma":[0.00006058957,0.0002644211,0.00015239445,0.0006652453,0.000032855645,0.00045303378,0.00041950218,0.0002125706,0.00014355718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009319401,0.00008506078,0.000045920315,0.0000032589342,0.000027679876,0.000004802326,0.000092764036,0.32882676,0.000008912686,0.012089064,0.1430186,0.51578784],"study_design_scores_gemma":[0.00047123636,0.0000797305,0.00012937255,0.0000086593445,0.00000641788,0.000005132648,0.0000059608506,0.7193775,0.00013762608,0.0002235693,0.27928394,0.0002708438],"about_ca_topic_score_codex":0.000019337356,"about_ca_topic_score_gemma":0.00004942815,"teacher_disagreement_score":0.56782246,"about_ca_system_score_codex":0.00012938544,"about_ca_system_score_gemma":0.000062922794,"threshold_uncertainty_score":0.9999808},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013453102,0.000047434576,0.99522084,0.0008409525,0.0001402846,0.00041247252,0.000013585844,0.00027425095,0.0017048393],"genre_scores_gemma":[0.6568808,0.0000023786733,0.3419283,0.00052190194,0.00023057451,0.00012123507,0.000024176656,0.000008555768,0.00028206545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987575,0.00003136819,0.00019563334,0.0004271991,0.00021182142,0.0003764795],"domain_scores_gemma":[0.99898505,0.00007607309,0.000060865532,0.0006453108,0.000066587985,0.00016609543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022090154,0.00013748746,0.00014209814,0.00002879582,0.00010037209,0.00012072605,0.00079647475,0.00006507114,0.00009434927],"category_scores_gemma":[0.000008849659,0.000119561286,0.00005549539,0.00018285184,0.000024689722,0.00058884994,0.00013508738,0.000086376735,0.000084336774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004844612,0.00052689185,0.00018599653,0.0000071150985,0.000059948445,0.000006628574,0.0002146378,0.012746673,0.002331604,0.5931129,0.05926251,0.33149666],"study_design_scores_gemma":[0.00042877445,0.00035604747,0.0003122614,0.0000059247714,0.000003970936,0.0000033236586,0.000018953293,0.93768793,0.00445322,0.0013177136,0.055207066,0.00020481234],"about_ca_topic_score_codex":0.0000082743545,"about_ca_topic_score_gemma":0.000028357217,"teacher_disagreement_score":0.92494124,"about_ca_system_score_codex":0.00011729824,"about_ca_system_score_gemma":0.000047981644,"threshold_uncertainty_score":0.4875568},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3472948e-7,0.001743147,0.5794093,0.00006717505,0.000659106,0.0003213956,6.9677213e-7,0.00033068212,0.41746837],"genre_scores_gemma":[0.0038926755,0.0005032908,0.08100341,0.00020259181,0.0015260477,0.000062672894,0.000019828132,0.000286613,0.9125029],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860024,0.000026294872,0.00026487355,0.00051277387,0.00025943626,0.00033637145],"domain_scores_gemma":[0.99843675,0.000016587053,0.00027981866,0.0011615597,0.000042468135,0.00006279246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017257761,0.00023239164,0.00031994923,0.00013424442,0.000022928381,0.00003637145,0.0010198723,0.00024568246,0.00047392648],"category_scores_gemma":[0.0000075632965,0.00019989093,0.00009679293,0.0003468471,0.00005874809,0.0001205279,0.00027996456,0.00020571543,0.00007114243],"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.0000015538571,0.000058890557,0.000013118569,0.0000713268,0.00004463102,0.0000043485625,0.000041345524,0.0025312542,0.00000356036,0.083283864,0.8551317,0.05881441],"study_design_scores_gemma":[0.0005471081,0.00016602951,0.00006527427,0.000863191,0.00003014948,0.000023073453,0.000003442129,0.16443774,0.00016239187,0.004355074,0.828496,0.00085053046],"about_ca_topic_score_codex":0.0005679579,"about_ca_topic_score_gemma":0.0005958802,"teacher_disagreement_score":0.4984059,"about_ca_system_score_codex":0.00007289273,"about_ca_system_score_gemma":0.00013136717,"threshold_uncertainty_score":0.81513155},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014543897,0.00085088366,0.99547076,0.00020578258,0.00089575036,0.0015219152,0.000008308946,0.000083957355,0.0008172018],"genre_scores_gemma":[0.73798144,0.00006416759,0.2606236,0.0004687915,0.00047352744,0.00015442693,0.000022238211,0.000061753744,0.00015007438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501324,0.00006991972,0.00096979487,0.0017745871,0.0010787171,0.0010937331],"domain_scores_gemma":[0.9957541,0.0015218866,0.0005356602,0.0018076005,0.0002478662,0.00013288553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017986665,0.00071408576,0.0008854653,0.00052557717,0.0002578436,0.0003341542,0.005048739,0.0005586359,0.0000047957665],"category_scores_gemma":[0.000018709443,0.00054627104,0.00025727495,0.0010081939,0.0013959801,0.00035645152,0.0014211524,0.0011791214,0.000001458522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025201192,0.000059183618,0.000050538092,0.00004333546,0.000014898058,0.000015650803,0.00023334795,0.7835629,0.000008217777,0.008579963,0.00007327254,0.20733348],"study_design_scores_gemma":[0.00060700194,0.00017181684,0.0000886699,0.00039763062,0.000016730319,0.000030203973,0.0000010882936,0.9957239,0.0001606301,0.0020064355,0.00021285901,0.0005830031],"about_ca_topic_score_codex":0.00011179163,"about_ca_topic_score_gemma":0.0002496757,"teacher_disagreement_score":0.737836,"about_ca_system_score_codex":0.0004010631,"about_ca_system_score_gemma":0.00041695285,"threshold_uncertainty_score":0.9996989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000118897995,0.00025333423,0.9966352,0.0009001609,0.00039325486,0.00095815945,0.000024610159,0.000062134844,0.0006542365],"genre_scores_gemma":[0.06347168,0.000037427522,0.93571967,0.00034053787,0.00025147232,0.000088228,0.000056829194,0.000018737088,0.000015409734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985245,0.000014730182,0.0007477927,0.00019853978,0.00019449567,0.0003199315],"domain_scores_gemma":[0.99777645,0.0008473391,0.0005678233,0.0005906432,0.00017182724,0.000045902216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060501654,0.00027730933,0.00041444425,0.00017391876,0.00075807126,0.00031901768,0.001999798,0.00025986403,6.2395657e-7],"category_scores_gemma":[0.000047820908,0.0002433897,0.00019113853,0.00024542017,0.00021223284,0.00039194126,0.0005484846,0.00047891066,2.4937884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.896053e-7,0.000005316921,0.000006079822,0.00012508128,0.00001944604,4.853083e-8,0.0002666704,0.88301593,0.0000011073638,0.088367425,0.00002964044,0.028162383],"study_design_scores_gemma":[0.00022165389,0.00003313943,0.00003962701,0.0005298519,0.00001809259,0.0000035775706,0.000001462716,0.9955594,0.000013916841,0.0009806592,0.0023372506,0.000261361],"about_ca_topic_score_codex":0.000048363097,"about_ca_topic_score_gemma":0.00007112559,"teacher_disagreement_score":0.11254349,"about_ca_system_score_codex":0.00010658961,"about_ca_system_score_gemma":0.00016233482,"threshold_uncertainty_score":0.99251443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005638326,0.009409685,0.9842217,0.00018608848,0.0024592704,0.001043458,0.0000028308307,0.00030203554,0.0018111056],"genre_scores_gemma":[0.794242,0.00087263895,0.2010003,0.0016992973,0.0013720611,0.00013513996,0.000023430961,0.00014932531,0.0005057909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935346,0.00008544809,0.0011151163,0.002625645,0.0010748135,0.0015643468],"domain_scores_gemma":[0.99659055,0.0006530509,0.0003965616,0.0019586335,0.00015818185,0.00024303654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014757302,0.0008954091,0.00094106403,0.0009653408,0.00025280518,0.0006921139,0.004692014,0.00069576374,0.000022775239],"category_scores_gemma":[0.000023076385,0.00088784285,0.00025245897,0.0015456734,0.0006590874,0.00068542856,0.001054027,0.0019868196,0.000027971399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000308915,0.00002805099,0.000009145483,0.000009467798,0.0000028603406,0.00011932855,0.00030422624,0.5311646,0.0000036735198,0.00069400645,0.000040670886,0.46762088],"study_design_scores_gemma":[0.00045058524,0.0002336298,0.00015276599,0.0006095025,0.0000069090784,0.00007035819,2.1438154e-7,0.98559713,0.000026405365,0.005936008,0.0059714844,0.00094498147],"about_ca_topic_score_codex":0.000012572937,"about_ca_topic_score_gemma":0.00072817033,"teacher_disagreement_score":0.79367816,"about_ca_system_score_codex":0.00069696014,"about_ca_system_score_gemma":0.00049026014,"threshold_uncertainty_score":0.9993572},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001569953,0.0019463302,0.7169816,0.0002893454,0.0014747857,0.0013930888,0.0000016309415,0.0008388679,0.2769174],"genre_scores_gemma":[0.016632086,0.0008342231,0.167741,0.0043222895,0.00206847,0.0005695424,0.000036476104,0.0007056116,0.8070903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987795,0.000043821266,0.00018550607,0.0005548755,0.00015031757,0.00028597756],"domain_scores_gemma":[0.9988232,0.00006991499,0.00012287192,0.00084339484,0.000040532428,0.00010006028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016217769,0.00023575322,0.00024912757,0.00015092448,0.00002132039,0.000115775896,0.0006065666,0.0005526176,0.00050426874],"category_scores_gemma":[0.0000056086606,0.00021547603,0.000019129915,0.0005116364,0.000025992116,0.00011106511,0.0002843596,0.00045925227,0.000112482994],"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.000008488304,0.00017979676,0.00043529132,0.00033154123,0.00006195648,0.000053374504,0.00062260346,0.0067735272,0.00005151547,0.012591728,0.6571859,0.32170427],"study_design_scores_gemma":[0.00029703465,0.000027988415,0.00026675838,0.00017369953,0.000005826659,0.000015229503,0.000010833032,0.43172723,0.000008171949,0.00007933065,0.56697416,0.00041375513],"about_ca_topic_score_codex":0.0006312754,"about_ca_topic_score_gemma":0.005572253,"teacher_disagreement_score":0.5492406,"about_ca_system_score_codex":0.000022204715,"about_ca_system_score_gemma":0.000051196672,"threshold_uncertainty_score":0.8786857},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10656478,0.00008427551,0.870957,0.0045325407,0.0005529609,0.00044475056,0.0000075236076,0.0003886982,0.01646748],"genre_scores_gemma":[0.8160947,0.000015648475,0.18201233,0.00011560599,0.000053222153,0.000100951525,0.000023845414,0.000025887035,0.0015578049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686456,0.0012175954,0.00034488374,0.0007276112,0.00033346986,0.00051188254],"domain_scores_gemma":[0.9935587,0.0024655357,0.00026115758,0.0022808376,0.0012249091,0.00020884397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005158792,0.00022492644,0.00024217447,0.00010350121,0.0006070067,0.00069036725,0.0019736052,0.00015904004,0.000054710155],"category_scores_gemma":[0.0012726528,0.00023878418,0.00015750938,0.00047094852,0.00017411771,0.0005738291,0.0006753063,0.0004687024,0.00003419819],"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.0000041369517,0.00022301948,0.0009006723,0.000020124557,0.000023299744,0.0000017944076,0.0024031997,0.000060340048,0.00803968,0.86357725,0.00076868926,0.12397778],"study_design_scores_gemma":[0.0014520128,0.0000017289634,0.0037650338,0.0002853222,0.000024577315,0.00003605849,0.00008443483,0.74804735,0.13084361,0.032693796,0.081980586,0.00078551145],"about_ca_topic_score_codex":0.00025735842,"about_ca_topic_score_gemma":0.002924287,"teacher_disagreement_score":0.83088344,"about_ca_system_score_codex":0.000059195452,"about_ca_system_score_gemma":0.00018035424,"threshold_uncertainty_score":0.97373366},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006222135,0.0036614612,0.73308814,0.00015677394,0.0012122681,0.0003716396,0.0000024364856,0.00048409787,0.26040095],"genre_scores_gemma":[0.048593935,0.0017966989,0.2530671,0.0014017316,0.002410975,0.00010714333,0.000013571058,0.0007954991,0.69181335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839187,0.000055765482,0.000231353,0.0007328793,0.00017318348,0.0004149412],"domain_scores_gemma":[0.9989651,0.00015923302,0.00014491277,0.00055802625,0.000016263748,0.0001564734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002014117,0.0003161421,0.00035564264,0.0002072195,0.000043377902,0.0001950439,0.00037534893,0.00046846046,0.0002126371],"category_scores_gemma":[0.000013431138,0.00027301468,0.000029067382,0.00024421222,0.00009270613,0.00005191744,0.00055771973,0.0004028831,0.00000655906],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007844544,0.00010585641,0.000672479,0.00008642261,0.00005348705,0.0001603841,0.000249033,0.0031195355,0.00006863897,0.029228933,0.13886121,0.8273862],"study_design_scores_gemma":[0.0002945197,0.00002286449,0.00018352362,0.00016585762,0.0000057208604,0.00005258376,0.000008994285,0.8079589,0.0000074118934,0.000046414007,0.19084498,0.00040820843],"about_ca_topic_score_codex":0.0004325834,"about_ca_topic_score_gemma":0.0013311437,"teacher_disagreement_score":0.82697797,"about_ca_system_score_codex":0.0000140518605,"about_ca_system_score_gemma":0.000028183491,"threshold_uncertainty_score":0.9999722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013834049,0.00009250896,0.98367596,0.00020479933,0.00021622435,0.000639713,0.00013187937,0.00020648797,0.0009983856],"genre_scores_gemma":[0.8746448,0.000010335499,0.1249805,0.00014417614,0.000044964858,0.0000037551915,0.0000373451,0.000019473422,0.00011463814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979618,0.00031448258,0.00024662432,0.00059162267,0.00030933827,0.0005761079],"domain_scores_gemma":[0.99733466,0.00047856715,0.00032532046,0.0011937051,0.00039387913,0.00027385427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009419728,0.00024610615,0.0005043687,0.00016141182,0.0004914129,0.00016992644,0.0026601837,0.00024151923,0.00014851849],"category_scores_gemma":[0.000048971957,0.0003099498,0.0002949618,0.0007226556,0.00013435936,0.0026822262,0.0006366389,0.0004984404,0.000016825714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014696378,0.0017275659,0.051884737,0.0001639209,0.0013034027,0.00032137806,0.0058077998,0.006937036,0.0025735728,0.7040031,0.052889585,0.17091827],"study_design_scores_gemma":[0.004013626,0.00043127974,0.057871886,0.000036875786,0.0001425949,0.00001364438,0.0002779558,0.911717,0.00007564872,0.009051162,0.015796868,0.0005714836],"about_ca_topic_score_codex":0.0007237691,"about_ca_topic_score_gemma":0.0009969776,"teacher_disagreement_score":0.9047799,"about_ca_system_score_codex":0.00009509444,"about_ca_system_score_gemma":0.00009873321,"threshold_uncertainty_score":0.99993527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032071017,0.0009727133,0.99216205,0.00015385791,0.0015180744,0.000685588,0.0000019120796,0.00020055335,0.0010981775],"genre_scores_gemma":[0.8039815,0.000045643945,0.19053222,0.0046166265,0.00061503774,0.00001988188,0.000007772681,0.000097999226,0.00008333715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351066,0.00005652674,0.00082514196,0.0024596185,0.001709451,0.0014386144],"domain_scores_gemma":[0.9957763,0.0014902849,0.0004575609,0.0017887581,0.00025110086,0.00023602904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016916026,0.00089659775,0.00085342187,0.0010771373,0.0002965444,0.00045537387,0.0037561131,0.00062544254,0.00001820638],"category_scores_gemma":[0.000031634903,0.0007648149,0.00014247015,0.0014291067,0.0008039917,0.00051937875,0.0014672936,0.0023008557,0.00003019239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005672748,0.00003609838,0.00012851189,0.0000092311375,0.000009595964,0.00053444464,0.00013647114,0.5555591,0.0000053097633,0.013666604,0.000009161235,0.42984873],"study_design_scores_gemma":[0.0006645648,0.0004479939,0.00041238655,0.0017372951,0.000006409863,0.00014185635,1.0317618e-7,0.97304595,0.00004694491,0.022484606,0.00010932419,0.00090255146],"about_ca_topic_score_codex":0.00004913355,"about_ca_topic_score_gemma":0.0023255015,"teacher_disagreement_score":0.8016298,"about_ca_system_score_codex":0.0006001427,"about_ca_system_score_gemma":0.00058635155,"threshold_uncertainty_score":0.9996201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011650398,0.00024971148,0.9845073,0.0008438102,0.0007933937,0.0006997503,0.0000014734848,0.00056815246,0.00068597664],"genre_scores_gemma":[0.7714455,0.000022117028,0.2264465,0.0015924299,0.00015457303,0.00021840079,0.000008050966,0.000026389102,0.00008601977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980069,0.00004519178,0.00035699506,0.00065449346,0.00023974456,0.00069669134],"domain_scores_gemma":[0.99836475,0.00031626542,0.00012218596,0.00090786413,0.00009181703,0.00019709939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003337188,0.00025962936,0.0003186189,0.00007442587,0.00018814454,0.00030396387,0.0011441882,0.00015612689,0.00002435777],"category_scores_gemma":[0.000026294,0.00023559785,0.0001884842,0.00049621536,0.000048118294,0.00040477616,0.00017287067,0.00018308514,0.00002603413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010847985,0.00025630425,0.0001222135,0.000038727307,0.000066908426,0.000030404914,0.00015352426,0.506897,0.00077040365,0.22425449,0.00127517,0.26602638],"study_design_scores_gemma":[0.0025174292,0.0002424594,0.00007623586,0.000049307724,0.000011412146,0.0000054079283,0.0000064094525,0.9874953,0.0015227809,0.0060214084,0.0016983357,0.00035353014],"about_ca_topic_score_codex":0.00000858541,"about_ca_topic_score_gemma":0.00002355558,"teacher_disagreement_score":0.7597951,"about_ca_system_score_codex":0.00009855446,"about_ca_system_score_gemma":0.00013468416,"threshold_uncertainty_score":0.96074015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14719418,0.00005032843,0.82128173,0.0011882191,0.00024758463,0.00011880633,7.715715e-7,0.000091872236,0.02982653],"genre_scores_gemma":[0.9897887,0.0000019051175,0.007925984,0.00037727537,0.00009076614,0.0000068759473,8.7756706e-7,0.0000044304807,0.0018031655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924237,0.000035095145,0.00015051125,0.00018277121,0.00022620871,0.00016304723],"domain_scores_gemma":[0.99923384,0.00009936866,0.000056166886,0.0005558475,0.000034294826,0.000020465444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015723756,0.00007467976,0.00008084813,0.000023489474,0.000054163873,0.000051764677,0.0007217834,0.000017286486,0.00013209599],"category_scores_gemma":[0.000007641406,0.000045087545,0.000059767615,0.0001392456,0.000040030744,0.00010781297,0.00016334832,0.00008814968,0.000078883575],"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.0000019799309,0.000050104674,0.00007789686,0.000001332948,0.000006401291,0.0000092310775,0.000005271758,0.008763496,0.00060376135,0.95316756,0.03326377,0.0040491964],"study_design_scores_gemma":[0.0004180629,0.0001488855,0.0024935552,0.000023196963,0.0000083749155,0.000032617565,0.000008077995,0.8446642,0.079790354,0.057513513,0.01463412,0.0002650419],"about_ca_topic_score_codex":0.000073673626,"about_ca_topic_score_gemma":0.0000066285534,"teacher_disagreement_score":0.895654,"about_ca_system_score_codex":0.000010711988,"about_ca_system_score_gemma":0.000020515803,"threshold_uncertainty_score":0.18386167},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08893696,0.00029969297,0.8943918,0.000084890205,0.00007963391,0.015055358,0.0000022324584,0.00019351386,0.0009559152],"genre_scores_gemma":[0.97724336,0.000010219041,0.010886516,0.0003218402,0.00009383497,0.011212643,0.000005420166,0.00002066786,0.00020547575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828756,0.00006011714,0.0003777188,0.00055141974,0.00019005453,0.00053310493],"domain_scores_gemma":[0.999058,0.00023561294,0.00009048613,0.0004907903,0.000058930826,0.00006619481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046259357,0.00019244701,0.00026158552,0.000082423685,0.00010227448,0.00018838819,0.0005590842,0.00011260087,0.000010795073],"category_scores_gemma":[0.0000062515132,0.00017089871,0.00005849033,0.00039366202,0.000051593284,0.00016204259,0.0002647339,0.00013579185,0.0000036180643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036546533,0.0010720366,0.010327851,0.00021741808,0.000037228987,0.00011284762,0.00040418567,0.4274213,0.0011895063,0.23510215,0.022818834,0.3009312],"study_design_scores_gemma":[0.001295226,0.00011899244,0.0029084233,0.000050038707,0.0000024807339,0.000006036025,0.000010339275,0.9870632,0.0003056029,0.0010267753,0.0069798585,0.00023300984],"about_ca_topic_score_codex":0.00005988047,"about_ca_topic_score_gemma":0.00038223004,"teacher_disagreement_score":0.88830644,"about_ca_system_score_codex":0.000049509716,"about_ca_system_score_gemma":0.00003860811,"threshold_uncertainty_score":0.6969047},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3134396,0.0002685413,0.68134946,0.000057385758,0.0011392538,0.00036690183,0.000064794236,0.00011492619,0.0031991322],"genre_scores_gemma":[0.99598426,0.00016771471,0.0022591306,0.000038583377,0.0002007146,0.0000013562393,0.00003902138,0.000027273907,0.0012819205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517316,0.00088250265,0.0007423179,0.0019370449,0.0002491593,0.0010158069],"domain_scores_gemma":[0.9937495,0.0006907799,0.0011450712,0.0033372645,0.000579302,0.0004980634],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015255454,0.0006107535,0.001317239,0.00029201954,0.00022088613,0.00010680188,0.0027844282,0.00063783716,0.00096212514],"category_scores_gemma":[0.000118219694,0.00076037087,0.0012201632,0.004781823,0.00047737933,0.00076771644,0.0036159724,0.001003657,0.00012041882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032921103,0.00036116235,0.0961154,0.0001027564,0.0017809513,0.00007773559,0.0011810923,0.27457523,0.000078274286,0.62434113,0.000038728715,0.0013146326],"study_design_scores_gemma":[0.00028321712,0.000047574016,0.0889947,0.000100637255,0.0030093815,0.0000016836724,0.00013486258,0.9034158,0.00016529525,0.002787039,0.0004278603,0.00063194614],"about_ca_topic_score_codex":0.0018880505,"about_ca_topic_score_gemma":0.00058648986,"teacher_disagreement_score":0.6825447,"about_ca_system_score_codex":0.0006558067,"about_ca_system_score_gemma":0.00035087825,"threshold_uncertainty_score":0.9999511},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.882658e-7,0.00025990754,0.90089494,0.00019049855,0.0021689252,0.093932554,0.000004227885,0.00047307246,0.002074899],"genre_scores_gemma":[0.0011565005,0.000015171465,0.8792904,0.0019034205,0.0034929619,0.11319797,0.000007813092,0.00012427468,0.00081148825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99338424,0.000044010154,0.000980612,0.002670071,0.0011895248,0.0017315372],"domain_scores_gemma":[0.99544823,0.0007820647,0.0006557053,0.0024073182,0.00039245977,0.00031421575],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016264977,0.00092365086,0.0008851223,0.00044461843,0.0006307216,0.0010336223,0.0056382213,0.00062279234,0.000054023312],"category_scores_gemma":[0.00006825598,0.0008647126,0.0003153286,0.0010335529,0.0006317486,0.0008223821,0.0022473712,0.0011949419,0.000054792687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017329168,0.00003066561,0.0000071676372,0.00007974448,0.000010253632,0.00002903142,0.0003028151,0.4386373,0.0000089625855,0.024565578,0.00020609392,0.5361051],"study_design_scores_gemma":[0.0014006505,0.000966322,0.000017929598,0.0018746105,0.000011231504,0.00006693202,1.313095e-7,0.5864432,0.00066306104,0.34463742,0.062483057,0.0014354518],"about_ca_topic_score_codex":0.0000069864495,"about_ca_topic_score_gemma":0.000055249908,"teacher_disagreement_score":0.53466964,"about_ca_system_score_codex":0.0007861309,"about_ca_system_score_gemma":0.0015166147,"threshold_uncertainty_score":0.99974173},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018778913,0.0039353976,0.9652674,0.00007593412,0.000177892,0.00043634063,1.8028506e-7,0.000379098,0.010948852],"genre_scores_gemma":[0.8355933,0.00016294625,0.15962884,0.0003622255,0.0003052081,0.0001356063,0.0000029730306,0.000024219178,0.0037846738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987544,0.000031976288,0.0001780225,0.0004645131,0.00020573729,0.00036538532],"domain_scores_gemma":[0.9992157,0.0000730551,0.00006437843,0.0005070526,0.00004964454,0.000090176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001640351,0.00015734132,0.00015129724,0.000041349864,0.00014195353,0.00027200903,0.00040163548,0.00006898521,0.00002818857],"category_scores_gemma":[0.000002093525,0.00011405179,0.00002302323,0.00032480335,0.000058274403,0.00042320645,0.0002606131,0.0001583794,0.000015135031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003288332,0.000152643,0.006722243,0.000020043095,0.000025676129,0.00010547423,0.00028165328,0.15958126,0.0000869748,0.04739466,0.030374026,0.7552225],"study_design_scores_gemma":[0.00063189655,0.0005883554,0.0030843231,0.000052567033,0.000007249637,0.00007593805,0.000024872332,0.9151635,0.00014025896,0.0007433218,0.079105616,0.00038208178],"about_ca_topic_score_codex":0.000021373897,"about_ca_topic_score_gemma":0.00008680762,"teacher_disagreement_score":0.8168144,"about_ca_system_score_codex":0.000020135683,"about_ca_system_score_gemma":0.000030781834,"threshold_uncertainty_score":0.4650897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008309461,0.0001401128,0.9653858,0.00012694432,0.0031067792,0.030692529,0.000008868755,0.00025844533,0.000272191],"genre_scores_gemma":[0.0400654,0.0000066239027,0.9315608,0.0033876046,0.0026829543,0.021936774,0.000011658155,0.00016963079,0.00017852234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99430615,0.00007730918,0.00079565035,0.0024414177,0.0011373338,0.0012421435],"domain_scores_gemma":[0.99559397,0.0007287409,0.00057999964,0.002048999,0.0006553732,0.00039291798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012998468,0.000836464,0.000755688,0.0006495369,0.00064392516,0.000946783,0.0040096464,0.00079959194,0.00003927685],"category_scores_gemma":[0.000054643864,0.0007546842,0.00027622547,0.00063330174,0.0008695735,0.00055904745,0.0007331151,0.0012267062,0.000004101507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006254845,0.00010364995,0.000009140967,0.000017066985,0.000017000519,0.000033801294,0.00013415514,0.74710906,0.0006061747,0.007882899,0.00001571218,0.24400878],"study_design_scores_gemma":[0.0010404432,0.0004846343,0.000024315334,0.00027975437,0.000009662246,0.00010969702,5.867445e-8,0.9695882,0.00037207073,0.014574024,0.012678519,0.0008386168],"about_ca_topic_score_codex":0.000010990624,"about_ca_topic_score_gemma":0.00011343211,"teacher_disagreement_score":0.24317016,"about_ca_system_score_codex":0.000372485,"about_ca_system_score_gemma":0.00081421,"threshold_uncertainty_score":0.99949044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023702882,0.00049034355,0.99529016,0.00023907392,0.0011719147,0.0021823272,0.000046433663,0.00038235518,0.00017370333],"genre_scores_gemma":[0.03593597,0.00020261793,0.96137816,0.0012657696,0.00053003913,0.00016696993,0.000054370157,0.00012598852,0.0003401265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99250364,0.0000847574,0.0011136904,0.0033137326,0.0013210304,0.0016631592],"domain_scores_gemma":[0.9940907,0.00076605025,0.00074481557,0.0030938105,0.0008559395,0.00044872155],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013766296,0.0012387397,0.0013592452,0.000573855,0.0007382846,0.00070112833,0.0059911353,0.00075464096,0.000004175786],"category_scores_gemma":[0.00006363209,0.0010360095,0.0003029012,0.0008617952,0.001388704,0.0008324416,0.0017118566,0.0016860242,0.00001107819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002850737,0.000097244796,0.000034094355,0.000054260938,0.000022987375,0.00009774111,0.00050289265,0.81861144,0.000009279966,0.0013544443,0.00014742972,0.17903969],"study_design_scores_gemma":[0.0012336829,0.0002913225,0.00005181838,0.00067047786,0.000021773609,0.00018427247,1.225633e-7,0.9931236,0.00002149487,0.0026976566,0.00043547052,0.0012682977],"about_ca_topic_score_codex":0.00004869627,"about_ca_topic_score_gemma":0.00087861693,"teacher_disagreement_score":0.17777139,"about_ca_system_score_codex":0.00050436,"about_ca_system_score_gemma":0.0009920325,"threshold_uncertainty_score":0.9993869},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005905803,0.1086242,0.8791931,0.00009624513,0.0015238107,0.0060919113,0.000073772215,0.0036295694,0.00070832286],"genre_scores_gemma":[0.14084971,0.18217014,0.3332623,0.002774192,0.029138532,0.03657653,0.0018842175,0.017542532,0.25580186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98421997,0.00014719469,0.003139349,0.004504353,0.00232234,0.0056668133],"domain_scores_gemma":[0.98892444,0.0041638757,0.0010669767,0.002930183,0.00081812695,0.0020964015],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0011049813,0.0046234904,0.004416913,0.0019209408,0.0010417264,0.0014101005,0.0038266673,0.0034599067,0.000069758724],"category_scores_gemma":[0.0006620814,0.004421134,0.0016395928,0.0024677021,0.00031028505,0.0013558406,0.0011246753,0.008124376,0.00005161336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013282789,0.00052190485,0.000005129058,0.0009981979,0.005202589,0.00077509444,0.0009756524,0.63771355,0.014960368,0.10312693,0.007717548,0.22667477],"study_design_scores_gemma":[0.0027178254,0.0025349588,0.0000136603185,0.0014090762,0.00068542163,0.00080993766,0.0000020445116,0.87438136,0.0036297604,0.00057818263,0.108798385,0.004439368],"about_ca_topic_score_codex":0.000013260276,"about_ca_topic_score_gemma":0.00000756791,"teacher_disagreement_score":0.5459308,"about_ca_system_score_codex":0.0029513708,"about_ca_system_score_gemma":0.0005835449,"threshold_uncertainty_score":0.9996265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11106914,0.00010614017,0.87709737,0.00087637996,0.00032987425,0.00017395162,6.987582e-8,0.0003580424,0.0099890195],"genre_scores_gemma":[0.9832331,0.000030886076,0.0150275845,0.00092687935,0.00027509307,0.00001862965,7.503588e-7,0.000009328709,0.00047777672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987374,0.00004969193,0.00024734242,0.00036128558,0.0001691732,0.0004351143],"domain_scores_gemma":[0.9992718,0.000090697926,0.000040783507,0.00048724088,0.000019198196,0.0000902445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032555134,0.00012332389,0.00015976165,0.00006714138,0.000041883348,0.00010175444,0.0007570836,0.000084221785,0.00006826624],"category_scores_gemma":[0.0000043084146,0.000114429145,0.000041782267,0.0005149989,0.000017892802,0.00044093633,0.0001679067,0.00021852163,0.000078652614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022347008,0.000058584614,0.00082465383,0.0000024778208,0.000004420484,0.00002109276,0.0002152999,0.29888746,0.000021000382,0.08609837,0.0051287934,0.6087356],"study_design_scores_gemma":[0.00024017358,0.000014736577,0.001451937,0.000016449518,7.9845586e-7,0.000009951683,0.000007135192,0.99619114,0.00005359734,0.00005128039,0.0018146798,0.00014813057],"about_ca_topic_score_codex":0.000014550479,"about_ca_topic_score_gemma":0.00054016075,"teacher_disagreement_score":0.87216395,"about_ca_system_score_codex":0.00007600578,"about_ca_system_score_gemma":0.00003054517,"threshold_uncertainty_score":0.4666285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007336145,0.0001894945,0.9835469,0.000088029265,0.0002302196,0.0001242786,9.9293686e-8,0.00011208947,0.008372721],"genre_scores_gemma":[0.99166393,0.00005600221,0.006763008,0.0012316459,0.000020582476,0.00010381428,0.000002724522,0.000007521479,0.0001507518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987068,0.0002508116,0.00019447866,0.00035363645,0.00017302473,0.0003212418],"domain_scores_gemma":[0.9992246,0.00022006535,0.000058860132,0.00038456713,0.000039992283,0.000071933886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002988049,0.00011586741,0.000114515875,0.00009795304,0.000048773847,0.00006090843,0.00020247989,0.00008657876,0.0001163568],"category_scores_gemma":[0.000035683097,0.00011049025,0.000031384,0.00045656855,0.000020295396,0.00021078611,0.000021718148,0.00012511421,0.000030104618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031783515,0.00025419856,0.0051422194,0.000002578324,0.0000061516303,0.000012641368,0.00007480787,0.56317794,0.000038018723,0.28663713,0.0011671168,0.14345542],"study_design_scores_gemma":[0.00043699166,0.00013510506,0.0097881965,0.00001500998,0.0000017853641,8.851112e-7,0.0000016296192,0.9851408,0.00078302715,0.00113009,0.002429312,0.00013718635],"about_ca_topic_score_codex":0.000009985957,"about_ca_topic_score_gemma":0.0002812478,"teacher_disagreement_score":0.9843278,"about_ca_system_score_codex":0.00011043433,"about_ca_system_score_gemma":0.00004552516,"threshold_uncertainty_score":0.45056614},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015786084,0.0015664569,0.5943823,0.0018596237,0.0027435787,0.0017265611,0.0000035190897,0.00030792676,0.3972522],"genre_scores_gemma":[0.016272435,0.0014698415,0.82919794,0.0035663703,0.0011973027,0.00013518706,0.000003944361,0.00012553869,0.14803146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573547,0.000033856228,0.0006013661,0.0020120104,0.0008441426,0.0007731846],"domain_scores_gemma":[0.9967285,0.00018079192,0.00029169355,0.0021944188,0.0002223722,0.00038224543],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001279121,0.0005177089,0.0006990807,0.00045059915,0.00042953625,0.0026191394,0.009266824,0.00025113724,0.00021000579],"category_scores_gemma":[0.000025671696,0.00051020924,0.000067751964,0.00039998,0.0011081682,0.002218139,0.022213368,0.0007007301,0.00030625873],"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":[9.643733e-7,0.000014750331,0.000025922724,0.000014231991,0.0000067600877,0.00006350579,0.0002751451,0.00025000537,0.00001630971,0.790642,0.0016910925,0.20699927],"study_design_scores_gemma":[0.0006023674,0.00027094773,0.0008944126,0.000930331,0.000009658756,0.00013513384,0.0000019930471,0.49246627,0.000116443196,0.17895913,0.3239956,0.0016177348],"about_ca_topic_score_codex":0.00027435963,"about_ca_topic_score_gemma":0.000047177822,"teacher_disagreement_score":0.6116829,"about_ca_system_score_codex":0.00020822283,"about_ca_system_score_gemma":0.00048164107,"threshold_uncertainty_score":0.99973494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84432656,0.012740932,0.104499504,0.00020270859,0.0013863583,0.004627741,0.00007062483,0.00049026916,0.03165528],"genre_scores_gemma":[0.923276,0.0006066628,0.013770718,0.00009595291,0.00038949342,0.0014078153,0.00023515272,0.00010247551,0.060115695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99469304,0.0006971553,0.00086680235,0.0015444343,0.00096616056,0.0012324178],"domain_scores_gemma":[0.99616426,0.0003176253,0.00089199946,0.0011037588,0.0007789621,0.00074340694],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00051428186,0.0010610773,0.00078272604,0.00037430855,0.0067548943,0.00041057126,0.0026060739,0.0010612273,0.00019746298],"category_scores_gemma":[0.00011302821,0.0012010926,0.0006886027,0.0006314961,0.0007976787,0.0014437183,0.0009683307,0.0010536169,0.00014450744],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001634472,0.0023440733,0.27073905,0.0013498242,0.0017468487,0.013608672,0.27242672,0.048649706,0.025351828,0.2753825,0.0019636536,0.08480266],"study_design_scores_gemma":[0.0034403212,0.00081862387,0.4417686,0.0037670983,0.00093553663,0.0039497265,0.036237262,0.33884615,0.11366034,0.007055794,0.0460636,0.0034569465],"about_ca_topic_score_codex":0.17517278,"about_ca_topic_score_gemma":0.0657911,"teacher_disagreement_score":0.29019645,"about_ca_system_score_codex":0.0069611897,"about_ca_system_score_gemma":0.0046013757,"threshold_uncertainty_score":0.9990439},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006674008,0.0021299915,0.81577164,0.0008503324,0.002041254,0.0025928689,0.00004292965,0.00037010497,0.1761942],"genre_scores_gemma":[0.13284917,0.0075472733,0.26673076,0.01371791,0.009344091,0.012732651,0.015630042,0.000592562,0.5408555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950463,0.000060978728,0.002517475,0.0006845661,0.0011474133,0.0005432576],"domain_scores_gemma":[0.9954279,0.00046059114,0.0020229619,0.00050113496,0.0014347219,0.00015267823],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018966267,0.0006932299,0.00090213714,0.00077480223,0.0005027495,0.0029258726,0.0013879493,0.0007234037,0.00016705482],"category_scores_gemma":[0.00022387071,0.00071141886,0.0004171471,0.00018482016,0.0001248825,0.006771885,0.00028930986,0.0007713441,0.00018225705],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014393522,0.000039996932,0.0000015859282,0.00007698981,0.00009477873,0.00000264708,0.0010395056,0.05733011,0.0000010305043,0.23555496,0.0029808497,0.7014382],"study_design_scores_gemma":[0.016593123,0.000043750402,0.000001907453,0.00034725794,0.00002050646,0.000021890653,0.000022272261,0.6324028,0.00001752806,0.007509653,0.34249893,0.00052037823],"about_ca_topic_score_codex":0.0000037279322,"about_ca_topic_score_gemma":0.0000412035,"teacher_disagreement_score":0.70091784,"about_ca_system_score_codex":0.0006890728,"about_ca_system_score_gemma":0.0004280191,"threshold_uncertainty_score":0.9995337},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06902707,0.0005301372,0.9260328,0.00084384833,0.00029799083,0.00024712403,1.1309419e-7,0.00022525236,0.0027956986],"genre_scores_gemma":[0.86766547,0.00010567471,0.13112901,0.00070375897,0.000110699526,0.000031528427,0.000002969963,0.000010770321,0.00024009746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859107,0.00005298954,0.0003072807,0.00042444078,0.00021612844,0.0004080919],"domain_scores_gemma":[0.99910223,0.00009993954,0.00007551692,0.0005937994,0.000048269238,0.00008026579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058619597,0.00012714042,0.00014180625,0.00008257468,0.000072292074,0.00012807734,0.00067247875,0.00009858796,0.000015739139],"category_scores_gemma":[0.000046598954,0.00011818763,0.00003955117,0.00074887206,0.000019824844,0.00066473114,0.00026907524,0.0002423923,0.00003286294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014259452,0.00012732281,0.011730315,0.0000098017335,0.0000073721817,0.000063838415,0.0008766965,0.62699103,0.00007986092,0.08111644,0.00064339314,0.27833965],"study_design_scores_gemma":[0.0010176639,0.00006624629,0.030229297,0.00007661468,0.0000012844171,0.0000060596203,0.000024261233,0.960041,0.000116035226,0.0057071517,0.0024913205,0.0002230652],"about_ca_topic_score_codex":0.00008739102,"about_ca_topic_score_gemma":0.0005817713,"teacher_disagreement_score":0.7986384,"about_ca_system_score_codex":0.0001234357,"about_ca_system_score_gemma":0.000050982904,"threshold_uncertainty_score":0.48195517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012036856,0.0017563191,0.98207504,0.00094671466,0.0008958082,0.00054976513,0.0000012751711,0.00041708897,0.0013211081],"genre_scores_gemma":[0.9142409,0.00009196912,0.08125109,0.0029772809,0.0002046999,0.00010414345,0.0000028709987,0.000027520084,0.0010995251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973626,0.000087645094,0.00053190574,0.000805204,0.0003340635,0.0008785917],"domain_scores_gemma":[0.99832034,0.0001450719,0.00010674319,0.0010841549,0.00010501681,0.00023867679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000458411,0.0003144405,0.0003836173,0.00012133955,0.0001259094,0.0004083746,0.0014119698,0.00026890554,0.00013995823],"category_scores_gemma":[0.000033272416,0.00027581345,0.00013549268,0.00073638407,0.0000855475,0.00077557197,0.00030199176,0.00048132683,0.00029777267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047450027,0.00033226336,0.002485901,0.000007069559,0.00003299319,0.00020232555,0.00044213535,0.9203019,0.00052689406,0.0072358903,0.0011366939,0.06724847],"study_design_scores_gemma":[0.005860466,0.000099540615,0.007261704,0.00004209628,0.0000045854554,0.000018790211,0.000007129126,0.97992307,0.0006570715,0.00059664476,0.0051065045,0.00042240846],"about_ca_topic_score_codex":0.00006008211,"about_ca_topic_score_gemma":0.00053849886,"teacher_disagreement_score":0.90220404,"about_ca_system_score_codex":0.00017190634,"about_ca_system_score_gemma":0.000104955805,"threshold_uncertainty_score":0.9999694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4102589,0.0003918634,0.58664584,0.00018457528,0.00032334306,0.00010667984,0.0000022893769,0.00003307845,0.0020534315],"genre_scores_gemma":[0.99587584,0.0024955012,0.0011337446,0.00033735536,0.000045425397,0.000033846412,0.00002108808,0.000012551024,0.000044676024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980117,0.000119998615,0.0005287617,0.0005734756,0.00040350927,0.0003625745],"domain_scores_gemma":[0.998856,0.00013702543,0.00018827732,0.00047462742,0.00026381187,0.000080276346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040800156,0.00024956337,0.0004172638,0.000361315,0.00006041725,0.00038024245,0.0009226354,0.00014755741,0.0000293091],"category_scores_gemma":[0.000010269408,0.00024558164,0.0000828678,0.0012606039,0.000057741043,0.001215348,0.00018385406,0.00038683825,0.0000015842263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032105676,0.000043895263,0.0024819102,0.0000057657703,0.00012965806,0.000004745962,0.00012928003,0.7553432,0.000007796118,0.2291817,0.0000041793787,0.012635733],"study_design_scores_gemma":[0.00030568242,0.00006273804,0.0043020933,0.00015344704,0.00003414223,0.000003172695,0.00011402768,0.9936363,0.000009354608,0.0011230356,0.000019934652,0.00023609058],"about_ca_topic_score_codex":0.000059509686,"about_ca_topic_score_gemma":0.000981061,"teacher_disagreement_score":0.58561695,"about_ca_system_score_codex":0.00006875287,"about_ca_system_score_gemma":0.000111412664,"threshold_uncertainty_score":0.99999964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095492566,0.000458768,0.9948003,0.00023205891,0.0020118952,0.0006030376,0.000011928111,0.00017672824,0.00075033616],"genre_scores_gemma":[0.33329937,0.000331853,0.66241986,0.0015745907,0.0019202634,0.000028482153,0.000029178653,0.00007468374,0.00032173583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563885,0.00006267625,0.0008230696,0.0015587839,0.001072661,0.00084395066],"domain_scores_gemma":[0.99645966,0.00044150895,0.0007095204,0.0018639881,0.00032659373,0.00019871535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095846056,0.0005892265,0.0007468818,0.00040274314,0.00020246414,0.00026771287,0.0034719298,0.00046155628,0.0000336349],"category_scores_gemma":[0.00006323536,0.00057055766,0.00017700798,0.0008676422,0.00064287364,0.0007787097,0.0013662119,0.00087778346,0.00003072628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010711006,0.00004508175,0.00017054744,0.00004317801,0.0000144084115,0.000025193769,0.0006366358,0.07836079,0.0009864471,0.008925741,0.000021874263,0.9107594],"study_design_scores_gemma":[0.00034243363,0.00020533323,0.0011333249,0.00064425456,0.00000971146,0.000039596853,3.428303e-8,0.96631813,0.00092947,0.022254413,0.0073745144,0.00074880064],"about_ca_topic_score_codex":0.000008023843,"about_ca_topic_score_gemma":0.000103228966,"teacher_disagreement_score":0.9100106,"about_ca_system_score_codex":0.00028490674,"about_ca_system_score_gemma":0.000390966,"threshold_uncertainty_score":0.99967456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000816218,0.00033599994,0.98436123,0.00014143069,0.0060715913,0.0018421747,0.000002917351,0.0004874811,0.006675555],"genre_scores_gemma":[0.020268219,0.00014338852,0.92477304,0.0018751441,0.0038847872,0.00061607594,0.000016020324,0.00020261422,0.04822073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99264383,0.000079076024,0.0011461584,0.0029581368,0.0011119508,0.002060819],"domain_scores_gemma":[0.9947829,0.0006571853,0.0006966149,0.0028542199,0.00055517536,0.00045385404],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026597057,0.00085431384,0.0009891697,0.0006575012,0.00054201717,0.001753877,0.009155713,0.0005605806,0.000016463417],"category_scores_gemma":[0.00006773374,0.0009004538,0.00029378897,0.0013571252,0.0008313543,0.0017132031,0.0045306846,0.0012488028,0.00008916859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006458834,0.00013650813,0.00014019289,0.00013892322,0.000033846114,0.00007559078,0.00059081713,0.08160227,0.000030559622,0.19872853,0.00876944,0.70974684],"study_design_scores_gemma":[0.00059786584,0.00010434823,0.00029900973,0.00057522627,0.000007501826,0.000023595774,9.4046135e-7,0.9832615,0.00004464056,0.002627733,0.011459561,0.0009980339],"about_ca_topic_score_codex":0.00005085377,"about_ca_topic_score_gemma":0.000055446388,"teacher_disagreement_score":0.90165925,"about_ca_system_score_codex":0.001032491,"about_ca_system_score_gemma":0.0015400203,"threshold_uncertainty_score":0.9993446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022272172,0.00068062666,0.9974186,0.00027440407,0.00050876575,0.00071811484,0.000020284608,0.00007840879,0.00027853792],"genre_scores_gemma":[0.02644655,0.00034347753,0.972862,0.000106861036,0.0001327563,0.000024231585,0.00002314509,0.000018124994,0.000042831707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984296,0.000022431594,0.0007958383,0.00019575436,0.00027467794,0.00028171326],"domain_scores_gemma":[0.9976149,0.0004920753,0.0007332501,0.0008466087,0.00025191903,0.00006121539],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005023927,0.00032983712,0.00051271456,0.00017972171,0.0006060978,0.00016618604,0.002829825,0.00031368542,6.1373464e-7],"category_scores_gemma":[0.000030662377,0.00027735607,0.00020028224,0.000290181,0.00047021545,0.00037942143,0.00067799276,0.0004935981,2.8196456e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012141127,0.000012879931,0.0000011645288,0.000069328285,0.00004807789,8.99249e-8,0.0004498875,0.9200778,0.0000029791474,0.034959737,0.00004496138,0.044331905],"study_design_scores_gemma":[0.00021777595,0.00008479272,0.000034324865,0.00031891404,0.00003686405,0.000010454051,0.0000012659294,0.9961414,0.000041445135,0.0005984511,0.0022351774,0.00027914488],"about_ca_topic_score_codex":0.00001765311,"about_ca_topic_score_gemma":0.00002872131,"teacher_disagreement_score":0.07606362,"about_ca_system_score_codex":0.00006689303,"about_ca_system_score_gemma":0.00021251549,"threshold_uncertainty_score":0.9999679},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137386145,0.00022657795,0.98333275,0.00045511962,0.0002764407,0.0006500786,0.0000052363375,0.00023752208,0.0010776676],"genre_scores_gemma":[0.9519295,0.0001440761,0.046824444,0.00035805604,0.00021617499,0.000019869467,0.00007369781,0.000016114407,0.00041806453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985931,0.000050361887,0.00030271642,0.0003195692,0.0002458639,0.0004883954],"domain_scores_gemma":[0.9984551,0.00032042895,0.000261445,0.00057164277,0.00027059508,0.00012076398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000427549,0.00018790654,0.00014987602,0.00012672156,0.00072234095,0.00029785294,0.0011683959,0.00015551112,0.000006266882],"category_scores_gemma":[0.00006605581,0.00018193957,0.0001005106,0.0010093399,0.00007035641,0.0027148253,0.0003714227,0.00028555133,0.00003151368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010894927,0.00011496766,0.005679784,0.00002704517,0.000072403884,0.0000034287784,0.00016641538,0.2863001,0.00000765893,0.13261165,0.007870821,0.5670368],"study_design_scores_gemma":[0.00057109137,0.00004807275,0.000077769335,0.000023317796,0.000009744937,1.7392672e-8,0.001474555,0.7038241,0.000029186433,0.00003872033,0.29374176,0.00016169925],"about_ca_topic_score_codex":0.000009138891,"about_ca_topic_score_gemma":0.0033850272,"teacher_disagreement_score":0.9381909,"about_ca_system_score_codex":0.00031682738,"about_ca_system_score_gemma":0.00009847901,"threshold_uncertainty_score":0.74192804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007866038,0.0002633694,0.99436164,0.0002072005,0.003295798,0.0009941978,0.000006727651,0.0003859806,0.00040641928],"genre_scores_gemma":[0.86572635,0.00007163542,0.13166946,0.0011167459,0.0007711009,0.000059774262,0.000025605485,0.00010154952,0.00045776475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923891,0.00014328929,0.001434124,0.0031760866,0.0011062257,0.0017511758],"domain_scores_gemma":[0.9956399,0.0007356265,0.0007096524,0.0022055793,0.00040577573,0.00030343106],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015356452,0.0011979355,0.001199136,0.0010968243,0.0003768902,0.0012196777,0.006189401,0.0009807387,0.000015067875],"category_scores_gemma":[0.00006952089,0.0011990621,0.00024484115,0.0014930929,0.00074864534,0.0011606248,0.003204361,0.002634774,0.0000309735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008041732,0.00013654042,0.00039740585,0.000041205356,0.00001658436,0.00032509485,0.0011632721,0.78247875,0.000014295511,0.004732228,0.00010089194,0.21058567],"study_design_scores_gemma":[0.0007901493,0.000114439266,0.0005145255,0.0012139077,0.000008197971,0.000058895333,7.203326e-7,0.9920793,0.00010501365,0.0038312727,0.000054769378,0.0012287801],"about_ca_topic_score_codex":0.0002867549,"about_ca_topic_score_gemma":0.0035322912,"teacher_disagreement_score":0.8656477,"about_ca_system_score_codex":0.0008628903,"about_ca_system_score_gemma":0.0006198096,"threshold_uncertainty_score":0.99981713},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022579763,0.00004550346,0.93800265,0.000049336555,0.00039783726,0.060998984,0.000004554883,0.00006189276,0.00021347293],"genre_scores_gemma":[0.8399061,0.0000058672717,0.11536621,0.00038975343,0.00024344742,0.04401187,0.0000040842788,0.000051380663,0.00002126834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958984,0.000118777185,0.0006143127,0.0014505648,0.0012989737,0.0006189267],"domain_scores_gemma":[0.9966423,0.0007288105,0.00074285216,0.0009834776,0.0007690816,0.00013347805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029411702,0.0005560295,0.00066319096,0.00024845504,0.00029173977,0.00026979763,0.0011504233,0.00025985815,0.000005117271],"category_scores_gemma":[0.00004678039,0.00045854395,0.000070292954,0.0003964568,0.00050598884,0.000503524,0.00019900304,0.00053386204,8.178286e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073980635,0.00002979756,0.000063151565,0.00006925321,0.000013823256,0.0000024876285,0.00010548546,0.68923444,0.000043164684,0.03366412,0.0000035259827,0.27669674],"study_design_scores_gemma":[0.0027972949,0.0012343446,0.00012482166,0.0012960084,0.000030254194,0.00002300183,1.4999692e-7,0.97432053,0.00057991233,0.019022057,0.00007089244,0.00050070434],"about_ca_topic_score_codex":0.0000039802308,"about_ca_topic_score_gemma":0.00003804595,"teacher_disagreement_score":0.8396803,"about_ca_system_score_codex":0.00030791687,"about_ca_system_score_gemma":0.00047556724,"threshold_uncertainty_score":0.9997866},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010461582,0.00003919739,0.9755846,0.0008790322,0.00015645375,0.00014927766,3.3229148e-7,0.00019776853,0.012531748],"genre_scores_gemma":[0.7457103,4.1679033e-7,0.25302988,0.00092606706,0.000071951195,0.00001947939,0.0000013104602,0.0000055318887,0.0002350546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989968,0.000039894156,0.00018643124,0.00030565265,0.00017240907,0.00029881767],"domain_scores_gemma":[0.99913245,0.00021500057,0.000030218778,0.0005575036,0.000018155586,0.000046639703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014131957,0.00009944847,0.000109223125,0.000070203336,0.000026664948,0.00009259934,0.0005689327,0.000087830245,0.00012696943],"category_scores_gemma":[0.000015663518,0.00009020246,0.000031876727,0.00044075324,0.000025518302,0.00013416383,0.00010183089,0.00017402315,0.00019462158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009820013,0.0004267966,0.021195233,0.000014618713,0.000004087902,0.00023919226,0.00009502677,0.09433711,0.00013552753,0.8382637,0.013384716,0.031894155],"study_design_scores_gemma":[0.0003088253,0.00002834123,0.017252557,0.000026381285,8.554247e-7,0.0000030158042,0.000002677808,0.96286774,0.0003175687,0.013573698,0.005453423,0.000164937],"about_ca_topic_score_codex":0.0002677658,"about_ca_topic_score_gemma":0.00028174306,"teacher_disagreement_score":0.86853063,"about_ca_system_score_codex":0.00003383638,"about_ca_system_score_gemma":0.000027960989,"threshold_uncertainty_score":0.367835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010911784,0.000055619243,0.9739942,0.0007547671,0.0010589779,0.020556787,0.0000022323593,0.00030344215,0.0032630763],"genre_scores_gemma":[0.5615032,0.0000067957553,0.42251748,0.001882704,0.0016211764,0.012034687,0.0000043754667,0.00011036338,0.00031924417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474984,0.000068401816,0.0007653327,0.0019322156,0.0014625804,0.0010216091],"domain_scores_gemma":[0.99587166,0.00078900007,0.0006106594,0.0022076727,0.00033840231,0.00018258783],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014137792,0.000695657,0.00050211855,0.000309575,0.00073635887,0.0011911184,0.006233239,0.0003098498,0.000026038802],"category_scores_gemma":[0.00020113387,0.0005303585,0.00015835885,0.0010592086,0.0010022557,0.0008577591,0.0017951985,0.0014611045,0.00004143455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075957073,0.000029274519,0.0000542778,0.000077318175,0.000011072409,0.00017440243,0.001287769,0.24756771,0.00008953554,0.3970677,0.000009997702,0.35362333],"study_design_scores_gemma":[0.00047509975,0.00014797116,0.00017717626,0.0012877289,0.0000065797885,0.00013413835,1.764931e-7,0.661806,0.0012721419,0.33251014,0.0012724779,0.0009103695],"about_ca_topic_score_codex":0.000030952393,"about_ca_topic_score_gemma":0.0001136887,"teacher_disagreement_score":0.56149226,"about_ca_system_score_codex":0.0010330821,"about_ca_system_score_gemma":0.0012169838,"threshold_uncertainty_score":0.99984574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045107307,0.0055797445,0.35005677,0.0000151174045,0.0013839776,0.0010876432,0.0000045129773,0.00057587546,0.64125127],"genre_scores_gemma":[0.29376453,0.0013602433,0.011080306,0.0011923818,0.0011283186,0.0008004832,0.00002527407,0.00041995244,0.6902285],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962854,0.000056924837,0.0010051165,0.0012871778,0.00047033152,0.00089508184],"domain_scores_gemma":[0.996977,0.00018068492,0.0005098664,0.0019693426,0.00015033131,0.00021280852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005799298,0.00076575554,0.0008587625,0.0003413215,0.00011203592,0.00020182595,0.0026788092,0.0010267223,0.000166833],"category_scores_gemma":[0.000012797493,0.00077367295,0.00032657885,0.00006319749,0.00018330067,0.00016467026,0.0013981053,0.0020838445,0.00028299936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023964538,0.000024652201,0.0000056261083,0.000024759996,0.00006353851,0.00047886392,0.0009969393,0.00016353246,0.00006305495,0.08981203,0.0005283667,0.9078147],"study_design_scores_gemma":[0.00089722656,0.0005700149,0.000011403745,0.002826927,0.00004868388,0.00019417927,0.000023671913,0.038047884,0.0011696484,0.07392273,0.8799513,0.0023363372],"about_ca_topic_score_codex":0.00002218484,"about_ca_topic_score_gemma":0.00025670094,"teacher_disagreement_score":0.90547836,"about_ca_system_score_codex":0.00026071857,"about_ca_system_score_gemma":0.00016367511,"threshold_uncertainty_score":0.9994714},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010892856,0.00038361677,0.9954866,0.0002737292,0.0008159497,0.0009000996,0.000024969157,0.00006890418,0.0009568376],"genre_scores_gemma":[0.040387586,0.00018097012,0.9586452,0.00030425997,0.00028821485,0.00010753817,0.000032909506,0.000020765856,0.000032543085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877256,0.000011218926,0.0005164523,0.00019265116,0.00024771978,0.0002594016],"domain_scores_gemma":[0.99851924,0.0002650986,0.00042776324,0.0006349918,0.000095979325,0.00005694969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033353246,0.0002734566,0.00031040038,0.00011277278,0.00091684295,0.00026761158,0.0015406291,0.00021548824,0.0000014812535],"category_scores_gemma":[0.00000862996,0.00022703184,0.00011574415,0.00016387028,0.0003172649,0.000330213,0.000915991,0.00047639402,4.97354e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002390421,0.000016907796,0.000007170292,0.000108998596,0.00008393931,1.1714423e-7,0.002495181,0.70150787,0.000028891283,0.17007102,0.00013679148,0.12554075],"study_design_scores_gemma":[0.00043095843,0.00024030727,0.00005625431,0.0002800772,0.000041555977,0.000013814845,0.0000099114095,0.9429181,0.00041259133,0.0028654058,0.05221368,0.00051730545],"about_ca_topic_score_codex":0.000020089115,"about_ca_topic_score_gemma":0.00008990814,"teacher_disagreement_score":0.2414103,"about_ca_system_score_codex":0.000046357887,"about_ca_system_score_gemma":0.00010370244,"threshold_uncertainty_score":0.9258089},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32094377,0.000024937393,0.6757733,0.0005912642,0.00030438794,0.00032984716,2.2693503e-7,0.000056187444,0.0019760423],"genre_scores_gemma":[0.99771863,0.000007490651,0.001034839,0.0009818382,0.000046114314,0.00006711981,8.899235e-7,0.0000088826555,0.00013417858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986095,0.00009179007,0.00027945513,0.00026663678,0.0004102772,0.00034235575],"domain_scores_gemma":[0.9987362,0.0002666659,0.0001152358,0.00071706687,0.00006542118,0.000099410645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010113926,0.00014424564,0.0001780484,0.0000654244,0.000046481167,0.000040562383,0.000917331,0.00007120043,0.00001332548],"category_scores_gemma":[0.000017127717,0.00009311902,0.000042015647,0.00044129678,0.00005490386,0.000179518,0.00018040184,0.00020700714,0.000015541698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004215327,0.00015281986,0.0009621612,0.000008186491,0.00000852054,0.0000071249883,0.00035098277,0.9257602,0.000015028968,0.060122915,0.0039893184,0.008580594],"study_design_scores_gemma":[0.00040033308,0.00027137395,0.00025147092,0.00006164013,0.0000016643285,0.0000017883142,0.000028447892,0.99654686,0.0018979236,0.0003353507,0.000084269646,0.00011886052],"about_ca_topic_score_codex":0.000032918048,"about_ca_topic_score_gemma":0.000040759413,"teacher_disagreement_score":0.67677486,"about_ca_system_score_codex":0.00009443812,"about_ca_system_score_gemma":0.00009944936,"threshold_uncertainty_score":0.37972835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006905278,0.0004342835,0.99488354,0.0008067665,0.00095027476,0.0013086091,0.000008020279,0.0001905155,0.0013489213],"genre_scores_gemma":[0.2765781,0.000014011992,0.72107434,0.00033769643,0.00086975953,0.00004582136,0.000018729339,0.0000781254,0.0009834113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954297,0.000035830402,0.0008453367,0.0017335507,0.001064511,0.0008910916],"domain_scores_gemma":[0.99518305,0.001878851,0.00082412356,0.0014766036,0.0004282028,0.00020915063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092716224,0.00066078844,0.000735275,0.0007796432,0.00028026133,0.00053246156,0.00277509,0.0004591973,0.0000068792087],"category_scores_gemma":[0.00021169224,0.00062218646,0.00025380313,0.0011551866,0.00081865286,0.0008777282,0.00084515405,0.00081147003,0.0000056969907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002842102,0.0001263237,0.00036152828,0.00015286935,0.00002386901,0.000041148192,0.0006495833,0.19888213,0.0003971872,0.05480445,0.0003106974,0.7442218],"study_design_scores_gemma":[0.0005091257,0.00034013033,0.00022650367,0.00060709997,0.000020928777,0.000049722552,2.6373303e-7,0.8052138,0.0014088037,0.18822756,0.0027426097,0.0006534473],"about_ca_topic_score_codex":0.00022332593,"about_ca_topic_score_gemma":0.00056463905,"teacher_disagreement_score":0.74356836,"about_ca_system_score_codex":0.00025086736,"about_ca_system_score_gemma":0.0009929235,"threshold_uncertainty_score":0.99962294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067397165,0.00037334277,0.99109674,0.000108352106,0.0007584821,0.00057631993,0.00001240465,0.000065250315,0.000269397],"genre_scores_gemma":[0.84567463,0.000050111,0.15372048,0.00025869362,0.00022133821,0.000007700482,0.000032216976,0.000022265613,0.000012557518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959816,0.00011061269,0.001146154,0.0012552924,0.0008739088,0.00063247106],"domain_scores_gemma":[0.9966374,0.00072385126,0.00085170125,0.0012145498,0.00046088325,0.00011160838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011228902,0.00049553526,0.0009258872,0.0006789868,0.00008977555,0.00014087939,0.0022285373,0.00047860743,0.0000041461076],"category_scores_gemma":[0.000101891084,0.00049126614,0.0001307356,0.0013981762,0.0005001128,0.00038496839,0.00068753166,0.0008089681,0.0000012454569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008110547,0.000038061346,0.00007932578,0.000027903176,0.0000071892064,0.000045960685,0.0002473103,0.51182723,0.0016532271,0.0048067444,0.000009777027,0.48124915],"study_design_scores_gemma":[0.00046676825,0.0001863265,0.0008626684,0.000689176,0.0000068097065,0.000021749962,2.4120078e-7,0.98823905,0.0023498968,0.006725781,0.000020313772,0.00043119676],"about_ca_topic_score_codex":0.00004917655,"about_ca_topic_score_gemma":0.00016975126,"teacher_disagreement_score":0.8389349,"about_ca_system_score_codex":0.00026194012,"about_ca_system_score_gemma":0.0003656807,"threshold_uncertainty_score":0.9997539},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25117832,0.0031560978,0.6086125,0.00016645713,0.000095927826,0.13597268,0.000005825054,0.00018324897,0.0006289805],"genre_scores_gemma":[0.8226286,0.00013680987,0.02807345,0.00001923634,0.000050550425,0.14906134,0.000005144347,0.000016930757,0.000007928043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975137,0.0004816287,0.0005588118,0.00048116723,0.00050151197,0.00046318638],"domain_scores_gemma":[0.99553204,0.0011836252,0.0003155929,0.0019435266,0.00092802965,0.000097187214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004341192,0.00018085405,0.00025790438,0.00011712803,0.0009713956,0.00016208473,0.0014527815,0.00008397936,0.0000021154963],"category_scores_gemma":[0.0001427848,0.00017356071,0.00006643805,0.0007415539,0.00030376017,0.00032105736,0.0010715788,0.00037387366,0.0000020361424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077037985,0.00038031008,0.00044844754,0.00009225983,0.000031215037,2.2444623e-7,0.0052509992,0.27675548,0.00017175578,0.016600061,0.000055443943,0.7001368],"study_design_scores_gemma":[0.0016299434,0.0009385885,0.0018909853,0.0007210241,0.000011942966,0.000003409474,0.0002599745,0.9897207,0.00042983293,0.0013308426,0.002881474,0.0001812865],"about_ca_topic_score_codex":0.000007736462,"about_ca_topic_score_gemma":0.000022334336,"teacher_disagreement_score":0.7129652,"about_ca_system_score_codex":0.00020545184,"about_ca_system_score_gemma":0.00025890034,"threshold_uncertainty_score":0.7471288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01344587,0.000040330742,0.97290015,0.000123843,0.0000756972,0.009437477,0.0000013498361,0.00023564727,0.00373965],"genre_scores_gemma":[0.9561493,0.0000021893763,0.033948258,0.00015198455,0.0002059656,0.009095397,0.0000131536535,0.000021329084,0.00041245483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733174,0.00011760078,0.0006407662,0.0008210124,0.00029233092,0.0007965252],"domain_scores_gemma":[0.9982273,0.0004956029,0.00030840724,0.0007681871,0.000121481804,0.0000790213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995633,0.0002567401,0.0004900907,0.00022138697,0.00016188646,0.0003081567,0.0008427974,0.00016666934,0.000010827623],"category_scores_gemma":[0.000033343196,0.00024417692,0.00023966396,0.0022891914,0.000031377167,0.0006157272,0.00028795993,0.00028203393,0.0000044135536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010993113,0.0004407858,0.13278322,0.000031206357,0.0003116824,0.00004105837,0.0005756156,0.48483428,0.00035376506,0.19176038,0.0011580619,0.18760002],"study_design_scores_gemma":[0.0006402159,0.000066938854,0.020391876,0.00006300662,0.00002963195,0.0000019924871,0.00003418373,0.97671264,0.00033427012,0.0009459387,0.00047201465,0.00030731226],"about_ca_topic_score_codex":0.00031931585,"about_ca_topic_score_gemma":0.002053272,"teacher_disagreement_score":0.9427034,"about_ca_system_score_codex":0.00021708671,"about_ca_system_score_gemma":0.00006586664,"threshold_uncertainty_score":0.99572456},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027072723,0.17928788,0.80447185,0.00014121002,0.0027589172,0.004055698,0.000061507366,0.0068024746,0.0023933805],"genre_scores_gemma":[0.07127377,0.2725358,0.09349827,0.0038729655,0.022101846,0.016972343,0.0015056903,0.017042797,0.5011965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97765243,0.00021667515,0.00453656,0.0054601254,0.004125374,0.0080088135],"domain_scores_gemma":[0.9857705,0.0034150383,0.0012208916,0.0053696157,0.00092381774,0.003300129],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.001337552,0.006341275,0.0056686443,0.0029733994,0.0011325838,0.0019158939,0.00783664,0.004815663,0.00054110575],"category_scores_gemma":[0.0004822327,0.0061614094,0.002816048,0.0045203906,0.00037795617,0.0016233624,0.0018451209,0.012708897,0.00064330344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005076049,0.0006543617,0.0000039498645,0.00065886474,0.0029209715,0.002204006,0.00037954724,0.8318608,0.0047495333,0.051446844,0.028575564,0.076037996],"study_design_scores_gemma":[0.0019731312,0.00228928,0.000007739561,0.0017144139,0.00042067768,0.0010351413,9.838634e-7,0.68723434,0.0013065906,0.0002304981,0.2988121,0.0049751145],"about_ca_topic_score_codex":0.000014808355,"about_ca_topic_score_gemma":0.0000070651117,"teacher_disagreement_score":0.71097356,"about_ca_system_score_codex":0.0040526027,"about_ca_system_score_gemma":0.00084740395,"threshold_uncertainty_score":0.99977064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015587274,0.00014591278,0.9809076,0.0006696239,0.00048222672,0.00054615363,0.0000010153645,0.00061692856,0.0010432545],"genre_scores_gemma":[0.9278623,0.000019145295,0.06907182,0.00035937098,0.00043132083,0.0001595174,0.000018096905,0.00003984808,0.0020385853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976266,0.000086567816,0.00041391503,0.00075026567,0.00028694473,0.00083570613],"domain_scores_gemma":[0.9987082,0.00040693436,0.00017441863,0.0004570337,0.00012696734,0.00012648392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032800224,0.00026877937,0.00029964073,0.00009858669,0.00041188454,0.00030756425,0.00073864934,0.00021636656,0.000010709549],"category_scores_gemma":[0.000020555684,0.0002546779,0.00019171978,0.00059360627,0.000054317505,0.00038756614,0.00026605552,0.00037287056,0.000011824122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046376197,0.00011663603,0.0012403197,0.000019727113,0.000049316175,0.0000050294907,0.00013267255,0.40603173,0.000425786,0.071412586,0.007583753,0.51293606],"study_design_scores_gemma":[0.00053543376,0.00010356394,0.0007010598,0.000028504532,0.000013980622,0.00002628693,0.0000139888625,0.98931694,0.00018466602,0.002693263,0.006058578,0.00032373494],"about_ca_topic_score_codex":0.00004158258,"about_ca_topic_score_gemma":0.0002899257,"teacher_disagreement_score":0.912275,"about_ca_system_score_codex":0.00020363649,"about_ca_system_score_gemma":0.00006503366,"threshold_uncertainty_score":0.9999905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012042097,0.004659543,0.9721259,0.00021127242,0.0013701146,0.00090918655,0.0000019638871,0.00031868686,0.008361247],"genre_scores_gemma":[0.9842211,0.00045713762,0.011559166,0.0023646906,0.00010774096,0.0005246646,0.000002410147,0.000023821498,0.0007392722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972231,0.00039977342,0.00048543638,0.00075923227,0.00023656632,0.00089592766],"domain_scores_gemma":[0.99812454,0.00036728734,0.00011024072,0.00111033,0.00008175946,0.00020584969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006732618,0.00029340814,0.00044824416,0.00013879304,0.00010279328,0.00010933334,0.0010224992,0.00028529015,0.00043246578],"category_scores_gemma":[0.00003429196,0.0002688921,0.000109933564,0.0007128515,0.00012283277,0.00042145269,0.00013609654,0.0005383819,0.00012067799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005325935,0.00084848143,0.011243434,0.000031750802,0.000105353676,0.00036138174,0.0011296968,0.265393,0.0001718533,0.41001442,0.026087755,0.28455964],"study_design_scores_gemma":[0.003449097,0.00063176063,0.0011440988,0.000035676858,0.000013222146,0.00016679382,0.00017350487,0.5919807,0.00024849668,0.0063455123,0.3948612,0.00094996515],"about_ca_topic_score_codex":0.000026919377,"about_ca_topic_score_gemma":0.0004861099,"teacher_disagreement_score":0.972179,"about_ca_system_score_codex":0.000120371675,"about_ca_system_score_gemma":0.000086544,"threshold_uncertainty_score":0.99997634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039193933,0.003816466,0.9882968,0.00014888341,0.0027672895,0.0004660373,5.0761304e-7,0.00041168986,0.0001729175],"genre_scores_gemma":[0.50978994,0.000019351402,0.4889311,0.0000880651,0.0008527839,0.00008766365,0.0000017578734,0.000021219861,0.00020814905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981145,0.000069136644,0.00032932506,0.000565952,0.00026966076,0.000651398],"domain_scores_gemma":[0.9986084,0.00028497004,0.0000765885,0.00048181575,0.00013038125,0.0004178321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007524048,0.00021874219,0.0002869522,0.000032923057,0.00018504944,0.0002115986,0.00047994507,0.0001501804,0.000001393582],"category_scores_gemma":[0.000024724104,0.00019462724,0.000058736292,0.00020279392,0.00004519006,0.00034074445,0.00074144325,0.0001833001,0.000009978363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010025307,0.000071278104,0.0020928993,0.00007007109,0.00007025208,0.000041191917,0.000222012,0.87582725,0.000039856084,0.011989225,0.006622034,0.102853656],"study_design_scores_gemma":[0.0009669198,0.00013045775,0.000681529,0.00010892832,0.000009934795,0.00006252493,0.000037995687,0.99499184,0.000019209023,0.00008245005,0.002680913,0.0002272729],"about_ca_topic_score_codex":0.000004711172,"about_ca_topic_score_gemma":0.000015619205,"teacher_disagreement_score":0.5058705,"about_ca_system_score_codex":0.000118971926,"about_ca_system_score_gemma":0.000051020248,"threshold_uncertainty_score":0.79366684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034683417,0.000036079186,0.8567079,0.008949354,0.0008070961,0.012432115,0.0000046223595,0.00042234716,0.11717219],"genre_scores_gemma":[0.9290944,0.0000060566613,0.060965467,0.00064044545,0.00018457291,0.008502313,8.1768064e-7,0.000021569003,0.0005843631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759305,0.0000069700104,0.00047111107,0.0005316556,0.0010771746,0.00032007316],"domain_scores_gemma":[0.9982866,0.000020789488,0.0005929775,0.00020316424,0.0008140899,0.00008237955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030846198,0.00024564407,0.0002113271,0.00013261323,0.00019968748,0.00058675115,0.0033054256,0.00010126698,0.000028811248],"category_scores_gemma":[0.00006727187,0.00018496449,0.000104337785,0.00034312753,0.0001117959,0.0010956106,0.0007578997,0.00031258745,0.0000081796725],"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.000052873715,0.0002571178,0.00026679484,0.00007937535,0.000046466655,0.0000031590378,0.00076410273,0.0024289496,0.00572141,0.84859353,0.000306525,0.14147967],"study_design_scores_gemma":[0.0032756801,0.0003542216,0.0013292053,0.0026588615,0.000018373008,0.0001303889,0.00041857932,0.47910506,0.04051899,0.46536562,0.0058922283,0.00093280076],"about_ca_topic_score_codex":0.000044405326,"about_ca_topic_score_gemma":0.000007281776,"teacher_disagreement_score":0.92562604,"about_ca_system_score_codex":0.00020669581,"about_ca_system_score_gemma":0.0003079895,"threshold_uncertainty_score":0.7542633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008623398,0.0019949118,0.9851175,0.00077833777,0.00023524936,0.0012232385,0.0000010430371,0.00022923222,0.0017970994],"genre_scores_gemma":[0.7963655,0.0001567954,0.20134267,0.0010481005,0.00006889455,0.0007049318,0.000019999514,0.000021240086,0.0002718734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985679,0.000091391514,0.0003334761,0.0004080102,0.00016740931,0.00043183466],"domain_scores_gemma":[0.998285,0.00017854986,0.0000932904,0.0012836545,0.000058485217,0.000101052625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038881143,0.00017731784,0.0002067297,0.00009790946,0.00010981884,0.00011510307,0.0012821341,0.00011337157,0.00002773375],"category_scores_gemma":[0.000013036964,0.00015948073,0.00008949821,0.0005361035,0.000047671663,0.00022925138,0.0003448566,0.00030105453,0.000015658186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001791437,0.00009581473,0.000042132648,0.000005862502,0.000008935129,0.0000028541972,0.00057961995,0.8241203,0.000021606354,0.02563319,0.000680471,0.14879133],"study_design_scores_gemma":[0.0037792872,0.00034581296,0.00086489465,0.00010721984,0.000009426381,0.000018032255,0.00008355046,0.9183665,0.00028507735,0.026150342,0.04947897,0.0005109051],"about_ca_topic_score_codex":0.000056180892,"about_ca_topic_score_gemma":0.0010391419,"teacher_disagreement_score":0.7877421,"about_ca_system_score_codex":0.00014590033,"about_ca_system_score_gemma":0.000059772912,"threshold_uncertainty_score":0.65034354},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0781869e-9,0.000053874384,0.4533623,0.000088356544,0.00019314411,0.0068603726,0.000008312147,0.0005696827,0.53886396],"genre_scores_gemma":[4.9320903e-7,0.000007591183,0.15787642,0.0007844906,0.0013325321,0.0022537194,0.00003688573,0.00019549976,0.8375124],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981831,0.000034082626,0.00021662345,0.000818885,0.00036949327,0.00037781714],"domain_scores_gemma":[0.9953113,0.000042769607,0.00014990958,0.004363439,0.000020393814,0.00011216229],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038850604,0.00024273312,0.00025380505,0.00019275665,0.00002236877,0.00015893899,0.0048653143,0.0003488012,0.005687129],"category_scores_gemma":[0.000010103538,0.0001984914,0.00003799663,0.00033749937,0.000031505362,0.00016160625,0.0016722403,0.0002870079,0.0028953056],"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":[4.990945e-7,0.000015012779,0.000005516974,0.0000184958,0.000014766365,0.000023301294,0.0000028625934,0.0000015401537,6.765237e-7,0.029400397,0.8886067,0.081910186],"study_design_scores_gemma":[0.00013111108,0.000019786065,0.0000037507964,0.00011350638,0.0000026411312,0.0000064052642,2.7359002e-7,0.0091974,0.000011083196,0.00019918112,0.99006,0.00025489114],"about_ca_topic_score_codex":0.000055210912,"about_ca_topic_score_gemma":0.00019765168,"teacher_disagreement_score":0.2986484,"about_ca_system_score_codex":0.000018745392,"about_ca_system_score_gemma":0.00009007028,"threshold_uncertainty_score":0.99788105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031712636,0.0022236346,0.9913646,0.00016523332,0.0028801824,0.0022222397,0.000014807858,0.00032585676,0.00077171525],"genre_scores_gemma":[0.2716825,0.00015715556,0.7240282,0.0015047201,0.0019327179,0.0002628479,0.000040568008,0.00009570541,0.0002955548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944829,0.00004882177,0.00085710204,0.0024337792,0.001011882,0.0011655341],"domain_scores_gemma":[0.994439,0.0018310134,0.00048750744,0.0025130752,0.00046509624,0.0002642882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015790028,0.00072642445,0.00077939907,0.0003559962,0.00044010332,0.00058323075,0.0036941892,0.0005777546,0.000032116488],"category_scores_gemma":[0.00014484487,0.0007107135,0.00026316798,0.00080479693,0.00068669836,0.00065143994,0.0012438871,0.0008383453,0.000028346438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009286384,0.000021417507,0.0000044101403,0.000036093945,0.0000058615383,0.000011765214,0.00013291925,0.61245954,0.0000019511003,0.013774773,0.000020611797,0.37352133],"study_design_scores_gemma":[0.0002811134,0.00029677805,0.000035253375,0.00027955827,0.000010037985,0.000009266435,3.58796e-8,0.645085,0.000023827639,0.3494366,0.0040384936,0.00050405326],"about_ca_topic_score_codex":0.000010692671,"about_ca_topic_score_gemma":0.00012401732,"teacher_disagreement_score":0.37301728,"about_ca_system_score_codex":0.0009156086,"about_ca_system_score_gemma":0.0009093016,"threshold_uncertainty_score":0.99953437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034749155,0.00068516645,0.99314404,0.0006591386,0.0027701862,0.0015907866,0.000008277386,0.00024813044,0.00085955375],"genre_scores_gemma":[0.017894277,0.000036919355,0.97238296,0.008335105,0.0010194287,0.00005493502,0.000020421476,0.000095570285,0.00016040412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99313956,0.00008393184,0.0015556029,0.0024285722,0.0014289111,0.001363404],"domain_scores_gemma":[0.99212426,0.00237976,0.0011234162,0.0026349542,0.0014128627,0.00032474977],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.003963285,0.00087579474,0.0011862093,0.00081210193,0.00039356734,0.00047058766,0.0068000476,0.0008305417,0.000016035045],"category_scores_gemma":[0.00019133842,0.00084044767,0.00028565014,0.0018634483,0.00040661768,0.00079840963,0.0026212672,0.0012867603,0.000018102517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034857796,0.000073773335,0.00006123553,0.00027042406,0.000029695513,0.00002179705,0.00086308917,0.24220757,0.000079152655,0.06512389,0.000030336567,0.6912042],"study_design_scores_gemma":[0.00072586903,0.00016736737,0.00017353838,0.00074514933,0.000012070757,0.000022416274,3.983785e-7,0.9726329,0.000267619,0.023085995,0.0012606748,0.00090599543],"about_ca_topic_score_codex":0.00015985548,"about_ca_topic_score_gemma":0.0017050635,"teacher_disagreement_score":0.73042536,"about_ca_system_score_codex":0.00031544504,"about_ca_system_score_gemma":0.00070827856,"threshold_uncertainty_score":0.9994046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00441941,0.0007709838,0.99147326,0.0006320995,0.0003842358,0.0001780752,3.9496385e-7,0.0005120955,0.0016294556],"genre_scores_gemma":[0.90393543,0.00007676791,0.08982546,0.0014154662,0.00040998915,0.000069263704,0.000005151571,0.000033661774,0.0042287796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980352,0.00005107699,0.00035522145,0.0006076436,0.00021070955,0.00074015645],"domain_scores_gemma":[0.9986074,0.0003191184,0.00013913431,0.00071758847,0.00007018034,0.00014659372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036862557,0.00022446686,0.00023698632,0.000059999384,0.00025369212,0.00025779268,0.0011289436,0.0001411344,0.0000250816],"category_scores_gemma":[0.000011288926,0.00021618286,0.00012946436,0.0003356472,0.00003253509,0.0004873092,0.00043434682,0.00016926433,0.0000146586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004356845,0.000023049264,0.000034757995,0.0000031247823,0.000012717899,0.0000015229296,0.000114572,0.115441754,0.00006839703,0.024490371,0.001318338,0.858487],"study_design_scores_gemma":[0.00030774198,0.000044867455,0.000075886346,0.00003073077,0.0000057451816,0.000012821242,0.00002109116,0.9585655,0.00008603031,0.00026159445,0.040312376,0.00027566872],"about_ca_topic_score_codex":0.000023323013,"about_ca_topic_score_gemma":0.0005908594,"teacher_disagreement_score":0.9016478,"about_ca_system_score_codex":0.00013254554,"about_ca_system_score_gemma":0.000042098003,"threshold_uncertainty_score":0.88156813},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8392904,0.0009948673,0.111299396,0.03685501,0.0027030928,0.0038351207,0.00008219811,0.0031708155,0.0017691331],"genre_scores_gemma":[0.97524714,0.00029922693,0.02365202,0.00024588397,0.00015591555,0.0001942981,0.000001610753,0.000047749054,0.00015615056],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964406,0.00004480974,0.0008712595,0.00081882946,0.00077252736,0.0010520112],"domain_scores_gemma":[0.99706924,0.00043433727,0.0007150941,0.0011704513,0.00048012938,0.00013074988],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009841067,0.00046302655,0.0005194344,0.0001689946,0.00062149373,0.00027240222,0.005699216,0.00027123548,0.0000044703884],"category_scores_gemma":[0.0003090469,0.00032374545,0.00011697376,0.00126706,0.00031373787,0.00069081807,0.0013213706,0.00073501305,0.000010336901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064579496,0.0008517902,0.004403975,0.0006455285,0.00037976165,0.00000747289,0.0045318743,0.14292514,0.3232803,0.17758562,0.0429655,0.30177724],"study_design_scores_gemma":[0.0005771394,0.00063522806,0.00025287142,0.00064368924,0.000042095493,0.000021658489,0.0007541487,0.7217458,0.25793818,0.003875051,0.012838405,0.00067571556],"about_ca_topic_score_codex":0.000036393973,"about_ca_topic_score_gemma":0.00023064278,"teacher_disagreement_score":0.57882065,"about_ca_system_score_codex":0.00022933984,"about_ca_system_score_gemma":0.00014583392,"threshold_uncertainty_score":0.99992144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2201886,0.00019725286,0.77576774,0.0009193678,0.0005021331,0.00080076954,0.000017285234,0.000055826702,0.0015509978],"genre_scores_gemma":[0.9978722,0.000009564918,0.0015980385,0.00005126976,0.00007922921,0.00006374753,0.0000047819185,0.000005234303,0.00031593125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821603,0.00022888606,0.0005081693,0.00035015945,0.0003487503,0.00034801598],"domain_scores_gemma":[0.9977803,0.00029664935,0.00024045061,0.0013646026,0.00026308934,0.00005489462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006901504,0.00014563146,0.00020892745,0.0000089628165,0.00021453283,0.00007997904,0.001620215,0.00006757693,0.000010326765],"category_scores_gemma":[0.0000541732,0.00008143209,0.00011400933,0.0007475881,0.00022440818,0.00014633566,0.0005523034,0.0001568533,0.000004106833],"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.000074521835,0.00021867303,0.017306343,0.000056014786,0.000040158688,9.538657e-7,0.00042227213,0.058541812,0.00094872265,0.80613625,0.025119577,0.09113472],"study_design_scores_gemma":[0.00069473725,0.00057637494,0.16515796,0.00029304918,0.000038996197,0.000011365104,0.00007403098,0.71508336,0.017324226,0.0842919,0.01582314,0.0006308754],"about_ca_topic_score_codex":0.0001856381,"about_ca_topic_score_gemma":0.0014182578,"teacher_disagreement_score":0.7776836,"about_ca_system_score_codex":0.000075318356,"about_ca_system_score_gemma":0.00013876677,"threshold_uncertainty_score":0.3320704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005749295,0.00049606315,0.9810782,0.0006579236,0.001399209,0.0066649937,0.000002377699,0.00030134973,0.009394132],"genre_scores_gemma":[0.015536044,0.00005118644,0.9734795,0.0065578823,0.0010497264,0.0016119345,0.000005993207,0.00014369549,0.0015640381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939299,0.00008306511,0.00080577016,0.0024634432,0.0014232465,0.0012945313],"domain_scores_gemma":[0.9956566,0.000426913,0.00049120304,0.0028107865,0.00028447498,0.00033002777],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014356889,0.0008185095,0.0007848505,0.0006086963,0.00039903235,0.0010966476,0.005512074,0.000539529,0.000041466326],"category_scores_gemma":[0.00010358494,0.0007788713,0.00020912875,0.0009814202,0.0006650029,0.0007949362,0.0016088762,0.0014724048,0.000098655146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000400137,0.000030643478,0.000041066945,0.000045817545,0.000011073193,0.00019308219,0.0005318886,0.017490357,0.000043251028,0.03276947,0.00014544664,0.94869393],"study_design_scores_gemma":[0.00073501095,0.0005664561,0.00008258935,0.0018996908,0.000013157883,0.00032167087,2.0025709e-7,0.7518076,0.0011078838,0.19539963,0.04588503,0.0021811433],"about_ca_topic_score_codex":0.0000055332503,"about_ca_topic_score_gemma":0.00006231038,"teacher_disagreement_score":0.94651276,"about_ca_system_score_codex":0.00051919516,"about_ca_system_score_gemma":0.00075514504,"threshold_uncertainty_score":0.99994034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014918876,0.00024648866,0.9831652,0.00068465533,0.0008427802,0.0007551885,9.792819e-7,0.00055129896,0.012261501],"genre_scores_gemma":[0.16485786,0.000007437522,0.82572824,0.00081471,0.0023741839,0.00028716336,0.000015390637,0.0000324327,0.005882596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853295,0.00004705863,0.00023043697,0.00046532677,0.00018465341,0.00053958455],"domain_scores_gemma":[0.9990037,0.00007558156,0.000063533,0.0006791936,0.00007521802,0.00010273799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030622794,0.00014829736,0.00015175885,0.000026901896,0.00014673569,0.00021188588,0.00083023764,0.00008060331,0.000038096856],"category_scores_gemma":[0.000004489012,0.00012340734,0.000069264446,0.0002900511,0.000032616677,0.00048044694,0.00015234166,0.000086445354,0.000061033552],"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.000019084677,0.00012601445,0.0002093334,0.000009786185,0.0000087450635,0.0000068862537,0.00005633263,0.013764439,0.00014049305,0.6685985,0.24955037,0.067510016],"study_design_scores_gemma":[0.00063091033,0.00059204124,0.00066260726,0.000015158952,0.0000068640206,0.000017072678,0.000006241083,0.71262175,0.00050582865,0.10104948,0.1835033,0.00038875957],"about_ca_topic_score_codex":0.00003114061,"about_ca_topic_score_gemma":0.00053884235,"teacher_disagreement_score":0.6988573,"about_ca_system_score_codex":0.000029007255,"about_ca_system_score_gemma":0.000110872454,"threshold_uncertainty_score":0.5032405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003501995,0.0042611687,0.9878101,0.0007176758,0.0032616586,0.00056072907,0.0000013655495,0.00019628322,0.0031559952],"genre_scores_gemma":[0.18641159,0.0016981578,0.7942132,0.015378442,0.0013774087,0.000058680358,0.000015922826,0.00018841613,0.0006581874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939279,0.00010256816,0.0009344807,0.0024790224,0.0010628164,0.0014932104],"domain_scores_gemma":[0.9962784,0.0005461927,0.0004439204,0.0022949735,0.00017139461,0.00026513654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019026166,0.0008111692,0.00083516806,0.0008687639,0.00024466892,0.0007939818,0.0051063374,0.0006477654,0.00003642271],"category_scores_gemma":[0.00008073211,0.0008049614,0.00017158918,0.0015205526,0.000584995,0.0008327629,0.002023458,0.0020893004,0.00006204936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035633952,0.000019361367,0.000071508104,0.00001020447,0.000005707556,0.00021373578,0.00021595009,0.3157553,0.000003554346,0.01735866,0.000075737174,0.6662667],"study_design_scores_gemma":[0.00034579396,0.0000964668,0.00010161394,0.00052477384,0.0000048141956,0.00009160313,9.089384e-8,0.9171061,0.00004210873,0.0726022,0.008173194,0.0009112552],"about_ca_topic_score_codex":0.0000085934325,"about_ca_topic_score_gemma":0.00026700864,"teacher_disagreement_score":0.66535544,"about_ca_system_score_codex":0.00059322437,"about_ca_system_score_gemma":0.00042384872,"threshold_uncertainty_score":0.99944013},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006537573,0.0029074305,0.9906334,0.00041252383,0.0031164887,0.0013781923,0.0000031511431,0.00018254724,0.001300844],"genre_scores_gemma":[0.10294755,0.00034425844,0.88948214,0.0045041083,0.0014786503,0.00015169886,0.000019846193,0.00017027213,0.0009014737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935423,0.00009797003,0.0011149348,0.0027654865,0.0008835964,0.001595684],"domain_scores_gemma":[0.9955095,0.0012535397,0.0006821216,0.002078461,0.0002533342,0.00022302856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029297946,0.0008215802,0.00090454466,0.000681308,0.00036461843,0.0007669016,0.00412374,0.00075105776,0.000014485898],"category_scores_gemma":[0.00021914787,0.00082974817,0.00026769648,0.0011377784,0.00037946788,0.00077594887,0.0015402955,0.0017413824,0.000008534567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009300036,0.000030220242,0.00013461111,0.00005327578,0.000012726109,0.00008348405,0.0006199321,0.32062912,0.000008911462,0.012257042,0.00015824127,0.6660031],"study_design_scores_gemma":[0.0005023553,0.00017467792,0.000053742217,0.0010883593,0.000009133518,0.00007684907,2.5861186e-7,0.9396424,0.00007312436,0.051001687,0.006470559,0.0009068384],"about_ca_topic_score_codex":0.0000051393686,"about_ca_topic_score_gemma":0.00024438548,"teacher_disagreement_score":0.6650963,"about_ca_system_score_codex":0.0005493155,"about_ca_system_score_gemma":0.00042623145,"threshold_uncertainty_score":0.99941534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076567344,0.00037927146,0.919946,0.00090254075,0.0002905066,0.00013255274,5.0164294e-7,0.00009389661,0.0016873821],"genre_scores_gemma":[0.9930255,0.000005005532,0.0063774525,0.0003319134,0.00010397259,0.000015540027,0.0000061912356,0.000008287621,0.0001261296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985533,0.00010640656,0.00022680823,0.00043834499,0.00031646332,0.0003586959],"domain_scores_gemma":[0.9992321,0.00021109456,0.000054006265,0.00025717984,0.00006911343,0.0001765063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007654839,0.00013819046,0.00015978205,0.00005145293,0.0000848926,0.00021083454,0.0003514814,0.000087645305,0.000012682101],"category_scores_gemma":[0.00006032098,0.00012579034,0.000019830017,0.00034586078,0.000039130064,0.00027400433,0.00039745646,0.00023500148,0.0000058293704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016620284,0.00021543639,0.046812713,0.000012122462,0.000021214613,0.000058754933,0.0027038017,0.77583325,0.00004637718,0.11839148,0.023588551,0.032299664],"study_design_scores_gemma":[0.00043343127,0.000017115002,0.0030211525,0.000022084754,0.000002192401,0.000016999486,0.00008530193,0.9950235,0.00004839783,0.0005234787,0.00064258045,0.00016376794],"about_ca_topic_score_codex":0.000072367504,"about_ca_topic_score_gemma":0.000031636722,"teacher_disagreement_score":0.9164582,"about_ca_system_score_codex":0.00008338937,"about_ca_system_score_gemma":0.00009668151,"threshold_uncertainty_score":0.51295805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15697722,0.00048131138,0.8378859,0.000088316796,0.00039704263,0.000049554972,1.3085472e-7,0.000087308086,0.0040332214],"genre_scores_gemma":[0.7725454,0.00025614235,0.22679201,0.00023448687,0.0000544199,0.0000046347254,4.8484736e-7,0.000007219969,0.000105180494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902755,0.000020188596,0.00022601044,0.00029844433,0.00014206597,0.00028572802],"domain_scores_gemma":[0.9991952,0.000111760026,0.00009093917,0.00042832713,0.000064037995,0.00010969809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024778955,0.00012382187,0.00016246358,0.000049981947,0.000084700645,0.00007625823,0.00044807722,0.000111696536,0.00008758848],"category_scores_gemma":[0.000007077627,0.00011151912,0.00003109575,0.000199419,0.00020666256,0.00036857938,0.00028863185,0.00021204114,0.0000017217623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008812459,0.00003485281,0.0006778359,0.000013450313,0.000026387572,0.0000038657777,0.00014457852,0.1429575,0.0027433098,0.22554262,0.00008550633,0.6277613],"study_design_scores_gemma":[0.00021945414,0.00005324155,0.0003641665,0.00002377805,0.0000031947939,0.000028691551,0.000018363502,0.9967552,0.0015277704,0.00028053563,0.0005851645,0.00014048192],"about_ca_topic_score_codex":0.000004015214,"about_ca_topic_score_gemma":0.0000365068,"teacher_disagreement_score":0.8537977,"about_ca_system_score_codex":0.000006836694,"about_ca_system_score_gemma":0.000043010474,"threshold_uncertainty_score":0.45476177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012818019,0.010620459,0.9818451,0.00043131452,0.003055275,0.0020480142,0.000019533698,0.0004042943,0.0015632161],"genre_scores_gemma":[0.023629513,0.00046483878,0.96562725,0.003985958,0.0037577238,0.00049274554,0.00007886734,0.00022299647,0.0017400872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936005,0.000051020266,0.0008380439,0.00283419,0.0011218776,0.0015543863],"domain_scores_gemma":[0.99514216,0.0010742134,0.00050778565,0.002613025,0.0003571185,0.00030570975],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009798143,0.0010503159,0.0009769369,0.00076089153,0.00043556685,0.000871774,0.005811488,0.0009083445,0.000022487848],"category_scores_gemma":[0.000043387594,0.0009663155,0.00040831615,0.00093861244,0.00080586615,0.0004790964,0.001807302,0.0017489752,0.000021013904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000855391,0.000020724343,0.0000029169057,0.000030076066,0.000009852425,0.000039904953,0.00015614757,0.4667177,0.0000070296146,0.003422374,0.0006692579,0.52891546],"study_design_scores_gemma":[0.00045202725,0.00045608872,0.000013609321,0.00037605752,0.00001579589,0.00010112575,6.9275536e-8,0.76461864,0.00006755282,0.13110813,0.101750515,0.0010403738],"about_ca_topic_score_codex":0.000005758833,"about_ca_topic_score_gemma":0.000239212,"teacher_disagreement_score":0.52787507,"about_ca_system_score_codex":0.00040506895,"about_ca_system_score_gemma":0.00057618564,"threshold_uncertainty_score":0.99956757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014254783,0.0005520137,0.99341136,0.000032174183,0.0014316742,0.0033336596,0.00000460579,0.0003674521,0.0007244838],"genre_scores_gemma":[0.24906027,0.000012955716,0.7489699,0.00041071963,0.00092074694,0.00050356815,0.000018067212,0.000066177534,0.00003758702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428076,0.00006574603,0.0009171762,0.0025377378,0.00094415765,0.0012544208],"domain_scores_gemma":[0.9953778,0.0011310478,0.00066742,0.0020821793,0.00045120125,0.00029039197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002604627,0.00074236625,0.0007950931,0.00056297774,0.00068077137,0.0008533139,0.003609842,0.00051138795,0.000010036678],"category_scores_gemma":[0.000036450365,0.0007375795,0.00020823261,0.0007836879,0.00027009237,0.0006465441,0.0011231775,0.0008586168,0.000011436577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034121929,0.000021702137,0.000005229436,0.000030362273,0.0000047490553,0.0000035002927,0.00042552172,0.54033935,0.00012035073,0.019336443,9.433998e-7,0.4397084],"study_design_scores_gemma":[0.0003756214,0.0003978866,0.000006006735,0.0004042977,0.000013981604,0.000029231698,6.119949e-7,0.8810907,0.0011112257,0.11506487,0.0007914408,0.0007141413],"about_ca_topic_score_codex":0.000064568194,"about_ca_topic_score_gemma":0.00008438035,"teacher_disagreement_score":0.43899426,"about_ca_system_score_codex":0.0009176,"about_ca_system_score_gemma":0.0008677597,"threshold_uncertainty_score":0.99950755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61088216,0.00016581359,0.38757148,0.000048642916,0.0004783297,0.00048242812,0.0000020307107,0.00010998751,0.00025914272],"genre_scores_gemma":[0.9963427,0.000008633297,0.0033432024,0.000063254905,0.00015087795,0.000041162726,0.00001421893,0.000016765334,0.00001917097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719477,0.00037038387,0.00038642975,0.00052014773,0.0011101307,0.00041813427],"domain_scores_gemma":[0.9972246,0.00038588088,0.00034183663,0.0011061134,0.00075500226,0.0001865233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003210106,0.00023941667,0.0002969973,0.00006114612,0.00011831621,0.00010714811,0.00063035276,0.00013705828,0.000016321008],"category_scores_gemma":[0.00025653647,0.00021716348,0.00012403117,0.00058737886,0.00006307089,0.00085509993,0.0001511349,0.0002080949,0.000016167985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012154022,0.00011680497,0.0023237478,0.0000061920273,0.000013376373,3.096305e-7,0.0002780291,0.9846988,0.000013649996,0.00031980706,0.00013958513,0.011968155],"study_design_scores_gemma":[0.0014106657,0.0004065353,0.006736768,0.00005278236,0.000023014325,3.0960268e-7,0.000013541054,0.99033797,0.000259158,0.0005384317,0.000018181152,0.00020266937],"about_ca_topic_score_codex":0.000055999484,"about_ca_topic_score_gemma":0.00004270064,"teacher_disagreement_score":0.38546056,"about_ca_system_score_codex":0.00051247113,"about_ca_system_score_gemma":0.0004434292,"threshold_uncertainty_score":0.88556695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012666674,0.0002895425,0.9962051,0.00096120924,0.00021515915,0.00062278745,0.000035538495,0.000056797842,0.00034718454],"genre_scores_gemma":[0.05254457,0.00017507182,0.9468316,0.00025460508,0.000106310195,0.000025817539,0.000013643315,0.000015959213,0.000032447402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985099,0.0000055622877,0.00062344864,0.00027252213,0.00026303733,0.0003255413],"domain_scores_gemma":[0.998347,0.000476066,0.0003304406,0.00055496424,0.00018486564,0.0001066663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004863025,0.00033430403,0.00047157615,0.00015124393,0.00085501553,0.00038103564,0.0015683818,0.00027702563,1.4624315e-7],"category_scores_gemma":[0.000054789794,0.0002832246,0.00014103769,0.00016942738,0.0004053088,0.0005351018,0.00093089964,0.00045643072,9.231121e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022506265,0.000013134369,0.0000020485297,0.00013765886,0.000057339497,8.23819e-8,0.0004746098,0.45616272,0.000034392913,0.51399827,0.000017310624,0.029100148],"study_design_scores_gemma":[0.00026645215,0.00007415168,0.000025391553,0.00019090895,0.000047539856,0.000027284677,0.0000021726898,0.9948945,0.00002539236,0.002492021,0.0016338947,0.00032027875],"about_ca_topic_score_codex":0.000011701309,"about_ca_topic_score_gemma":0.00003683747,"teacher_disagreement_score":0.53873175,"about_ca_system_score_codex":0.00005302767,"about_ca_system_score_gemma":0.00016602754,"threshold_uncertainty_score":0.999962},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011438136,0.000089652174,0.99352837,0.000403608,0.0018586931,0.0021407169,0.000015989384,0.00020817798,0.0006109553],"genre_scores_gemma":[0.585374,0.0000094071775,0.4127909,0.0009067987,0.00068486284,0.00009327313,0.000021393156,0.00007119418,0.000048172387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99416894,0.000082277984,0.0009782566,0.0023879034,0.000856633,0.0015260029],"domain_scores_gemma":[0.99378216,0.0031438186,0.0007311166,0.0015727637,0.00048750467,0.00028265748],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020108516,0.0008862098,0.001048482,0.000667153,0.00040718066,0.00083528034,0.0032976684,0.0008013331,0.00001322799],"category_scores_gemma":[0.00019507356,0.0007958079,0.00014903217,0.0009769095,0.0013777408,0.00051961764,0.0011083978,0.0023389093,0.0000051058837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056588702,0.00005061619,0.00031199644,0.00007754684,0.000030575895,0.00035898038,0.0013600716,0.2619075,0.00043691136,0.027469005,0.000015291596,0.7079249],"study_design_scores_gemma":[0.0012075687,0.00024670237,0.00007938564,0.0010854315,0.000012476876,0.00022520444,0.0000016230231,0.9879884,0.0006909963,0.0071886624,0.00025627826,0.0010172322],"about_ca_topic_score_codex":0.000036200054,"about_ca_topic_score_gemma":0.0009991305,"teacher_disagreement_score":0.72608095,"about_ca_system_score_codex":0.00038431567,"about_ca_system_score_gemma":0.0007722385,"threshold_uncertainty_score":0.99996275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030346294,0.0026322757,0.9927937,0.00011065761,0.00045672266,0.0005511961,0.0000017789246,0.00003600399,0.00038307326],"genre_scores_gemma":[0.8985502,0.00015267126,0.10091223,0.00018151653,0.00015150623,0.000011193838,0.0000033565407,0.000027385811,0.000009910057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963367,0.00010621556,0.00088516966,0.0011125184,0.0007044424,0.0008549733],"domain_scores_gemma":[0.9948596,0.0033514868,0.0005712308,0.0008956942,0.00020432044,0.000117695956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036157623,0.00047256742,0.0005342155,0.00091300166,0.00019222696,0.00037534538,0.002017711,0.00037093728,0.0000034047218],"category_scores_gemma":[0.00021064271,0.00036586658,0.000110686306,0.0013817025,0.0005855128,0.00049365987,0.0008945904,0.0011651545,8.1725403e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012612294,0.00001005033,0.00048072977,0.000011409516,0.0000024470683,0.000041771757,0.00039399302,0.41612414,0.000010947207,0.00069246476,0.0000017087438,0.58221775],"study_design_scores_gemma":[0.00046938672,0.00021090932,0.0063053397,0.0008763246,0.0000026926589,0.00003219565,5.88219e-7,0.98459756,0.000049207396,0.00708384,0.000026128379,0.0003458502],"about_ca_topic_score_codex":0.00007722456,"about_ca_topic_score_gemma":0.0010557268,"teacher_disagreement_score":0.8955156,"about_ca_system_score_codex":0.0005264722,"about_ca_system_score_gemma":0.00040028532,"threshold_uncertainty_score":0.9998793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26013118,0.00025325216,0.73512733,0.0003183458,0.00029502614,0.00016436577,2.6632188e-7,0.00019908704,0.0035111404],"genre_scores_gemma":[0.7147834,0.000013426847,0.283716,0.0007692299,0.00017288192,0.000008240226,4.167622e-7,0.000009938209,0.000526512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859047,0.00003380618,0.0002546329,0.00042380075,0.00028383464,0.00041347966],"domain_scores_gemma":[0.99897957,0.000034213237,0.00008098106,0.00073484005,0.00004699016,0.00012340235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031717154,0.0001465097,0.00013573159,0.000050244613,0.00015514939,0.00014348835,0.0006647875,0.000071076895,0.00010824618],"category_scores_gemma":[0.0000076591305,0.00013516431,0.000067614295,0.00024591174,0.00002810888,0.00058226904,0.00035964837,0.00017775303,0.00011900527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054315788,0.00017699813,0.0002866867,0.000021748661,0.00004330192,0.0000305825,0.0010948868,0.020892637,0.14953616,0.046075627,0.002598911,0.77923703],"study_design_scores_gemma":[0.0002638635,0.00006431534,0.000059467402,0.000015662434,0.00000593478,0.000009144105,0.00001931928,0.9302762,0.04592785,0.0005536002,0.022545176,0.00025942727],"about_ca_topic_score_codex":0.00003995104,"about_ca_topic_score_gemma":0.000033100503,"teacher_disagreement_score":0.9093836,"about_ca_system_score_codex":0.00016864837,"about_ca_system_score_gemma":0.00003884709,"threshold_uncertainty_score":0.55118406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04778793,0.000032966604,0.94929737,0.00005615977,0.00017956685,0.00020312313,1.3789196e-7,0.000220192,0.0022225457],"genre_scores_gemma":[0.98025197,0.0000031924337,0.01895681,0.00017997717,0.0002540454,0.00006817009,0.000021303593,0.00001530611,0.0002492422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983191,0.0001235753,0.000399701,0.00047925542,0.00019347519,0.00048491868],"domain_scores_gemma":[0.9992403,0.00009747968,0.00010699896,0.0003904953,0.000096855685,0.00006788858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035328907,0.00018230712,0.00019029279,0.00008329828,0.00010875188,0.00029841915,0.0004693215,0.000110915884,0.0000093777135],"category_scores_gemma":[0.0000070375604,0.00016181597,0.00003821056,0.000697393,0.000022601593,0.0011364827,0.0001739068,0.00015775894,0.0000030124359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007533226,0.00014592418,0.004384153,0.0000020417074,0.0000045615516,0.00002125961,0.00032621188,0.13477612,0.00010441265,0.63947165,0.00019559382,0.22056057],"study_design_scores_gemma":[0.0002896491,0.00008521625,0.0013213943,0.000034625773,0.0000015254082,0.0000049899463,0.00005393901,0.9966323,0.00024206674,0.00071490224,0.00040205038,0.00021738818],"about_ca_topic_score_codex":0.0009958779,"about_ca_topic_score_gemma":0.0029546567,"teacher_disagreement_score":0.932464,"about_ca_system_score_codex":0.00009596791,"about_ca_system_score_gemma":0.00004307825,"threshold_uncertainty_score":0.6598664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049594167,0.0003545063,0.9934194,0.00046599188,0.0014411602,0.00023715459,0.0000012022618,0.000035402274,0.003549222],"genre_scores_gemma":[0.9871691,0.00018447165,0.009314731,0.0031025405,0.0001274739,0.0000145382755,0.0000018045,0.000024401623,0.000060923536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968409,0.00011856174,0.0006003899,0.0011973691,0.0006631013,0.000579655],"domain_scores_gemma":[0.9965527,0.0017611169,0.00037438248,0.0010864879,0.000117105184,0.000108220636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001151073,0.00044978107,0.0005086414,0.00051587285,0.00012215757,0.00024557626,0.002024326,0.00031460024,0.000023727012],"category_scores_gemma":[0.00006911154,0.00033864845,0.00008359756,0.0006537542,0.0012715157,0.00027493114,0.00064465404,0.00094797043,0.0000022342522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008115856,0.000041097348,0.000031387663,0.00001127893,0.000008841356,0.000038903687,0.00031234298,0.22032537,0.000021155709,0.21251492,0.000041544274,0.566645],"study_design_scores_gemma":[0.00023125311,0.00018742924,0.000043950764,0.0005437439,0.0000043445084,0.00006496759,3.5386955e-7,0.94456017,0.00027074173,0.05331915,0.00041011986,0.00036377576],"about_ca_topic_score_codex":0.000032124564,"about_ca_topic_score_gemma":0.00012542403,"teacher_disagreement_score":0.9866732,"about_ca_system_score_codex":0.00018843863,"about_ca_system_score_gemma":0.0001796123,"threshold_uncertainty_score":0.99990654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017381755,0.00010682211,0.9638041,0.0027166642,0.001089655,0.028328827,0.00000129797,0.00013054037,0.0038046574],"genre_scores_gemma":[0.20760687,0.00008326852,0.6658497,0.04370062,0.015874438,0.06381796,0.0000307457,0.00034561736,0.0026908051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956671,0.00019800624,0.0007439375,0.0010306978,0.001352416,0.001007847],"domain_scores_gemma":[0.9956522,0.0011354181,0.0005315269,0.002342037,0.00018492881,0.00015387604],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029175533,0.0005495337,0.00038027694,0.00023836693,0.0008107479,0.0011041724,0.0063943896,0.00032251558,0.000019862306],"category_scores_gemma":[0.000089399065,0.0003082243,0.0001981846,0.00062367116,0.0009157335,0.0012612188,0.0032869198,0.0018320283,0.00009154781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005962814,0.000022276257,0.000011272225,0.000048101476,0.000008642804,0.0000070598912,0.0013674804,0.0902928,0.000009135788,0.011011387,0.00028565468,0.8969302],"study_design_scores_gemma":[0.00025609354,0.000066693654,0.000054209442,0.00035505643,0.000007021873,0.00007720273,1.8140288e-7,0.92807394,0.00014659861,0.029681379,0.04084454,0.00043709093],"about_ca_topic_score_codex":0.00000341207,"about_ca_topic_score_gemma":0.00004682222,"teacher_disagreement_score":0.89649314,"about_ca_system_score_codex":0.0002645461,"about_ca_system_score_gemma":0.00030287975,"threshold_uncertainty_score":0.999937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32880747,0.00016654469,0.66964453,0.00012419582,0.00019010481,0.00017125445,1.8394765e-7,0.00013313323,0.00076259056],"genre_scores_gemma":[0.9738443,0.000005513596,0.024271615,0.0016208988,0.00020043377,0.000005519287,0.0000010783367,0.000026122318,0.000024505222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978639,0.00014676886,0.0004358233,0.00066500896,0.0002501615,0.00063832256],"domain_scores_gemma":[0.99881643,0.00036931402,0.00016561769,0.00047842212,0.000055297136,0.00011491599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004687774,0.00026843863,0.00031904838,0.00013751072,0.0001649495,0.00031892516,0.0007367602,0.00010283873,0.000008655714],"category_scores_gemma":[0.000011244796,0.00024777316,0.0000481476,0.00048426638,0.00007980908,0.0003000111,0.0006234138,0.000488687,0.0000063125517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049196653,0.000121399695,0.15432559,0.000044232293,0.00003669766,0.0003434867,0.0019263651,0.59596944,0.000044611443,0.00096465414,0.00042184663,0.24575248],"study_design_scores_gemma":[0.0011328111,0.00006671262,0.005226509,0.00047772485,0.0000059853137,0.000103663144,0.00003191039,0.9925586,0.00002357667,0.000012277712,0.000056397846,0.000303861],"about_ca_topic_score_codex":0.00007063863,"about_ca_topic_score_gemma":0.00008093825,"teacher_disagreement_score":0.64537287,"about_ca_system_score_codex":0.000077895995,"about_ca_system_score_gemma":0.000017660917,"threshold_uncertainty_score":0.99999744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001340729,0.00091227307,0.9960594,0.000500417,0.0004098859,0.0008803093,0.0000042938314,0.000279207,0.0009407938],"genre_scores_gemma":[0.224308,0.00018945844,0.77364796,0.0013369865,0.0003172549,0.000061003826,0.0000096470285,0.000042183303,0.00008751313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955479,0.000035296576,0.0007515544,0.0019214057,0.0010458007,0.0006980402],"domain_scores_gemma":[0.99573,0.0002999091,0.0005242721,0.0027714197,0.00042068967,0.0002537344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009764616,0.00056230364,0.0008795966,0.001612918,0.0001508999,0.00024949963,0.004560226,0.00047341824,0.000014051946],"category_scores_gemma":[0.000033013188,0.0005495111,0.0002863289,0.0037179752,0.00045450692,0.00035138495,0.0016580072,0.00072281493,0.000017348559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033768442,0.000015204191,0.000036074834,0.000010642327,0.000030262841,0.000008525146,0.00016722914,0.4489609,0.000046465062,0.013731103,0.000008431868,0.53698176],"study_design_scores_gemma":[0.0001056231,0.00025465817,0.00025012027,0.0002470784,0.00007031738,0.000011105726,8.350141e-8,0.9236935,0.0016228029,0.0703617,0.0026439936,0.0007390244],"about_ca_topic_score_codex":0.000034627385,"about_ca_topic_score_gemma":0.0003402073,"teacher_disagreement_score":0.5362427,"about_ca_system_score_codex":0.0004931258,"about_ca_system_score_gemma":0.00037520376,"threshold_uncertainty_score":0.99969566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6688018,0.0031072774,0.23433323,0.00010304398,0.00966082,0.0047907904,0.000047838937,0.0010268824,0.07812836],"genre_scores_gemma":[0.975028,0.00046436652,0.00026883482,0.000004921289,0.00038042164,0.000015056243,0.000103369166,0.000073573414,0.023661485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99246144,0.0022634855,0.0007887451,0.001505746,0.0015579419,0.0014226623],"domain_scores_gemma":[0.99481183,0.00062930404,0.000827365,0.0022807766,0.0008265825,0.0006241588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012658627,0.0005629702,0.0010089806,0.001346911,0.0011304773,0.00035172442,0.004046275,0.0007241212,0.0000096358435],"category_scores_gemma":[0.00007501926,0.0006613301,0.00038691467,0.0022535268,0.00033036483,0.0009009258,0.00033038526,0.0020253907,0.000029439614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009734177,0.009038563,0.13906172,0.006054898,0.009350677,0.061729036,0.025310643,0.32145867,0.083874315,0.27577564,0.007787906,0.050823748],"study_design_scores_gemma":[0.0028612646,0.0012160864,0.029317014,0.0007259341,0.00011811208,0.00012437179,0.002165296,0.95144033,0.0018797242,0.00006006244,0.008872702,0.0012191075],"about_ca_topic_score_codex":0.011961738,"about_ca_topic_score_gemma":0.0061573805,"teacher_disagreement_score":0.62998164,"about_ca_system_score_codex":0.0012482592,"about_ca_system_score_gemma":0.0018410004,"threshold_uncertainty_score":0.9995838},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019354598,0.0025858292,0.9933142,0.00023414737,0.0017671618,0.000972389,0.000008057749,0.000119997094,0.0009788438],"genre_scores_gemma":[0.04464448,0.00026647898,0.9519656,0.0020153604,0.00037211666,0.00004795252,0.000008471245,0.00007562814,0.0006039448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552554,0.00002900705,0.00090973265,0.0016756965,0.0008320609,0.001027948],"domain_scores_gemma":[0.9960866,0.00071343523,0.00062936754,0.0018465051,0.00050450483,0.00021959287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001428008,0.00064980466,0.00090945966,0.00054412894,0.0002218392,0.00031788528,0.003935192,0.00057305774,0.0000061258775],"category_scores_gemma":[0.00006555193,0.00061889365,0.00029130458,0.0006595184,0.00070243055,0.0005372675,0.0010410091,0.00083323265,0.0000033124038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008954161,0.000017818798,0.0000038495773,0.000035656034,0.000011123335,0.0000075961216,0.0002705078,0.6352916,0.000014284338,0.01608802,0.00009327033,0.34815738],"study_design_scores_gemma":[0.00037484828,0.00013959408,0.0000029848431,0.00039790224,0.000012348619,0.000022506423,7.495898e-8,0.8584001,0.00018463608,0.13861313,0.0013111207,0.0005407459],"about_ca_topic_score_codex":0.0000022213894,"about_ca_topic_score_gemma":0.00008700958,"teacher_disagreement_score":0.3476166,"about_ca_system_score_codex":0.0002543711,"about_ca_system_score_gemma":0.0005186945,"threshold_uncertainty_score":0.9996262},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002555507,0.004457057,0.9911038,0.0007461998,0.00007256164,0.00060569035,0.0000045268507,0.00023100492,0.00022360803],"genre_scores_gemma":[0.5499694,0.00006990219,0.4493324,0.00020372063,0.000040868603,0.0003274231,0.0000123501995,0.000021663502,0.000022319682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984089,0.0001226574,0.0003181463,0.00042393885,0.0001882637,0.00053806754],"domain_scores_gemma":[0.9972133,0.00038158934,0.0002603124,0.0015241659,0.00041562563,0.00020501627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043146446,0.00023200885,0.00021590466,0.00009592079,0.0009638541,0.0006357059,0.0017611407,0.00007970767,9.16451e-7],"category_scores_gemma":[0.00008430939,0.00021534438,0.000040460032,0.00067142525,0.00015822325,0.0015624992,0.0014241132,0.00020454577,0.00000189186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006432371,0.00047996038,0.0017301298,0.000033911732,0.00003605333,5.9802574e-7,0.0056622243,0.10443227,0.00031973884,0.004649768,0.00014661631,0.8824444],"study_design_scores_gemma":[0.0005620832,0.00005075062,0.0042140367,0.00014839189,0.000021578462,0.000008893931,0.0001128204,0.99290794,0.00013146254,0.000094546485,0.001463651,0.00028385784],"about_ca_topic_score_codex":0.000040144205,"about_ca_topic_score_gemma":0.00017890838,"teacher_disagreement_score":0.88847566,"about_ca_system_score_codex":0.00009570342,"about_ca_system_score_gemma":0.000077267556,"threshold_uncertainty_score":0.87814885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004577505,0.0012014704,0.99535495,0.000373906,0.0008036946,0.0013506566,0.000039233088,0.00011851455,0.0007117921],"genre_scores_gemma":[0.0072224597,0.00022268188,0.99151367,0.00032569168,0.00030564368,0.0001650102,0.00011169348,0.000029891484,0.00010325208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829113,0.0000117231,0.0007868954,0.00025696607,0.00029172408,0.0003615641],"domain_scores_gemma":[0.9970763,0.0008706049,0.0007393838,0.0009528751,0.0002921904,0.00006866633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007405323,0.00035875986,0.0004715301,0.00026200723,0.0012391192,0.00044808738,0.0024401702,0.00043591278,0.000002049703],"category_scores_gemma":[0.0000907217,0.00030899,0.0002821669,0.00043021658,0.00025093855,0.00053540425,0.00071338715,0.00068322534,7.711685e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018011334,0.0000090517005,6.7850993e-7,0.00007202656,0.00003355651,4.310741e-8,0.00027694955,0.92870766,0.000009376014,0.007525043,0.0000731521,0.06329065],"study_design_scores_gemma":[0.00026299205,0.00011379916,0.000003975783,0.00016534582,0.000039349998,0.0000034048771,6.1027754e-7,0.9128726,0.00007841544,0.00069336366,0.08545771,0.00030840986],"about_ca_topic_score_codex":0.000004981529,"about_ca_topic_score_gemma":0.000030670435,"teacher_disagreement_score":0.085384555,"about_ca_system_score_codex":0.000095095354,"about_ca_system_score_gemma":0.00024246109,"threshold_uncertainty_score":0.9999362},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002215315,0.0031897896,0.9914332,0.0003595865,0.00062158704,0.0012069328,0.0000111217805,0.000062349245,0.002893919],"genre_scores_gemma":[0.0253196,0.0011013497,0.9726514,0.00046680804,0.00018295199,0.00013457147,0.000049871454,0.00002269404,0.00007073936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843824,0.000021881897,0.0006652704,0.00021020931,0.00039057917,0.00027379498],"domain_scores_gemma":[0.9981653,0.0003798411,0.0004385953,0.00081745884,0.0001538438,0.00004493081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007975078,0.00029408533,0.00037438356,0.00025514507,0.00048701873,0.00021446745,0.0022182395,0.0002754026,0.0000014363179],"category_scores_gemma":[0.000046177967,0.00024719312,0.00016479641,0.00034306018,0.00021826055,0.00036352302,0.00052559975,0.0005796165,6.3471737e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011082286,0.000010200209,4.6782483e-7,0.000020552137,0.000013194912,4.8879098e-8,0.00039638518,0.7239726,3.133398e-7,0.025732314,0.000040174302,0.24981259],"study_design_scores_gemma":[0.0002534218,0.00013635909,0.0000419951,0.00025226627,0.000021184005,0.000004269872,0.0000012510607,0.9720758,0.0000058741707,0.0034547648,0.023501584,0.0002512073],"about_ca_topic_score_codex":0.0000036535748,"about_ca_topic_score_gemma":0.000083512445,"teacher_disagreement_score":0.24956138,"about_ca_system_score_codex":0.00015430251,"about_ca_system_score_gemma":0.00017417908,"threshold_uncertainty_score":0.99999803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14217146,0.00038933096,0.83212024,0.024098627,0.00020881413,0.000291663,0.0000035449284,0.00026968727,0.00044665058],"genre_scores_gemma":[0.9801157,0.00021336746,0.016536511,0.002826283,0.00009451281,0.00015634763,0.000020782587,0.000025800251,0.000010681012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711645,0.0009769241,0.00044856337,0.0005789044,0.0003838496,0.0004952874],"domain_scores_gemma":[0.99375796,0.0014357921,0.00020177617,0.004112191,0.00016333714,0.0003289136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011220999,0.00029501112,0.0005682605,0.00026962697,0.0003830516,0.00043945276,0.003167267,0.00014983803,0.000006402908],"category_scores_gemma":[0.000047562382,0.00028634808,0.00017818024,0.0015521334,0.0010509808,0.00052297884,0.0010099921,0.0005797925,0.000015926209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010284162,0.00037640112,0.008818643,0.000016466613,0.0014516579,0.000035788064,0.0026568398,0.1417421,0.0017892392,0.79189277,0.0077948365,0.04332242],"study_design_scores_gemma":[0.0011466373,0.000021910335,0.0006621213,0.00002243941,0.00019326195,0.000018392018,0.00006656253,0.9952156,0.00010533681,0.0009246166,0.001257962,0.00036515747],"about_ca_topic_score_codex":0.00021733894,"about_ca_topic_score_gemma":0.00028836878,"teacher_disagreement_score":0.8534735,"about_ca_system_score_codex":0.00009555975,"about_ca_system_score_gemma":0.000059904276,"threshold_uncertainty_score":0.9999589},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010848296,0.000083005005,0.9858017,0.00042567716,0.00021377733,0.00062597665,6.9565334e-7,0.000121784346,0.0018790999],"genre_scores_gemma":[0.9666156,0.000020739162,0.031584155,0.00041411055,0.00017844499,0.00043882613,0.000005237935,0.0000109530365,0.0007319218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991362,0.00003393204,0.00017683026,0.0003407211,0.00008802754,0.00022429142],"domain_scores_gemma":[0.99929047,0.000154359,0.0000463754,0.00033976365,0.00006038313,0.00010867257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028794917,0.00009841598,0.000120262914,0.000060524493,0.0000390957,0.00009732164,0.00025819553,0.00007948257,0.0000064815126],"category_scores_gemma":[0.000008058329,0.00009252265,0.000021738706,0.00022555642,0.000024631903,0.00029184145,0.00014101202,0.00009622305,0.000008839537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004588316,0.00017420689,0.00424101,0.000029537949,0.00002798894,0.0000074535847,0.0008068448,0.03601135,0.00019503298,0.47611398,0.021330396,0.46101633],"study_design_scores_gemma":[0.00055952475,0.00006372493,0.0011052858,0.000010708209,0.000002852415,0.000019588228,0.000061023104,0.96021575,0.000104997,0.0021350472,0.035570655,0.00015083638],"about_ca_topic_score_codex":0.00006566017,"about_ca_topic_score_gemma":0.0003790771,"teacher_disagreement_score":0.95576733,"about_ca_system_score_codex":0.000050509767,"about_ca_system_score_gemma":0.000022050524,"threshold_uncertainty_score":0.37729642},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013083685,0.054166954,0.867617,0.0016332864,0.0007413475,0.0009075806,0.0000037809875,0.00053895894,0.07438979],"genre_scores_gemma":[0.00093499525,0.11269384,0.5766017,0.0149505455,0.0035138563,0.00036244947,0.0005617731,0.00025369343,0.2901272],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959766,0.00033880817,0.0010671038,0.0012992184,0.00038913073,0.0009291376],"domain_scores_gemma":[0.9889651,0.00080099324,0.0004739591,0.0088172415,0.00032771277,0.00061502546],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007007173,0.0008383197,0.0010066645,0.0002942586,0.0007482818,0.0008941241,0.008626204,0.0008482357,0.000012827303],"category_scores_gemma":[0.0000049832997,0.0008945881,0.00026945656,0.0006477244,0.00025833922,0.00036236853,0.007245355,0.0018391643,0.00006257154],"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.000003773803,0.000043793614,0.0000018099223,0.000006669548,0.0000535764,0.000009881184,0.00007725904,0.011699803,7.3073316e-8,0.025975656,0.3561357,0.605992],"study_design_scores_gemma":[0.00017035285,0.00015556224,0.000035282166,0.0003143268,0.000026273954,0.00003249394,8.071242e-7,0.49197808,4.945252e-8,0.0010328019,0.5057514,0.00050260825],"about_ca_topic_score_codex":0.000005901594,"about_ca_topic_score_gemma":0.00011246751,"teacher_disagreement_score":0.6054894,"about_ca_system_score_codex":0.00026870557,"about_ca_system_score_gemma":0.0002548873,"threshold_uncertainty_score":0.9993505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122372825,0.000041055988,0.9761473,0.001004632,0.00042448135,0.0011861091,0.000005143383,0.00010756524,0.008846459],"genre_scores_gemma":[0.98019165,0.000054097836,0.018043889,0.0011897716,0.00008802423,0.00020588121,0.00005822546,0.000012392247,0.00015606883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841356,0.00006206627,0.00025988076,0.0007102835,0.00017912044,0.00037508],"domain_scores_gemma":[0.9985858,0.00008363499,0.00010973133,0.0010645731,0.000080882666,0.000075361946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393264,0.00018993704,0.00016098411,0.0000907468,0.00013628244,0.00024460838,0.0011361103,0.00007604496,0.000034741024],"category_scores_gemma":[0.0000039100073,0.00018644724,0.000020202548,0.00038530192,0.000020947911,0.00041827906,0.00059900875,0.000121565026,0.0000159828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020658431,0.00020667355,0.0012143895,0.00033891562,0.00004124238,0.000026630523,0.00057352684,0.0069023618,0.000016832859,0.06435045,0.0018211544,0.92430127],"study_design_scores_gemma":[0.0006847196,0.00012356437,0.011878478,0.00016502282,0.000014171921,0.0000012218594,0.00004966956,0.9764194,0.000052402513,0.0028976612,0.007483469,0.00023021441],"about_ca_topic_score_codex":0.000035822264,"about_ca_topic_score_gemma":0.0015345971,"teacher_disagreement_score":0.96951705,"about_ca_system_score_codex":0.00003114294,"about_ca_system_score_gemma":0.000015187434,"threshold_uncertainty_score":0.7603098},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003945682,0.0005722591,0.9936464,0.0000069556695,0.00062906195,0.0007112171,0.0000011161658,0.00016880952,0.00031851247],"genre_scores_gemma":[0.9317251,0.000010369614,0.06579276,0.00002337195,0.00041375536,0.00035170096,0.00015797498,0.00005784419,0.0014671452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846625,0.000015322068,0.00035043992,0.0005801305,0.00014640321,0.0004414222],"domain_scores_gemma":[0.9991975,0.0003215828,0.00012507592,0.00023741723,0.000055834393,0.00006263108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022505767,0.00029011685,0.00033486902,0.00016200749,0.000054947912,0.00013958874,0.0003750942,0.00028651537,0.0000015782077],"category_scores_gemma":[0.00002086732,0.00030619669,0.000064389795,0.0003053124,0.000007203378,0.00018819625,0.00004575259,0.00034285552,8.326824e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070549695,0.00001236795,0.0000014662306,0.000013607461,0.000009965621,0.000003799191,0.0001913924,0.91228235,0.0000010289527,0.004492411,0.00014433856,0.082840204],"study_design_scores_gemma":[0.00038813567,0.00007504238,0.0004744336,0.00018872811,0.000010653113,0.0000032717348,0.000050408205,0.9983798,0.0000040390983,0.00008843103,0.000019107221,0.00031795166],"about_ca_topic_score_codex":0.000049239537,"about_ca_topic_score_gemma":0.0005567878,"teacher_disagreement_score":0.92785364,"about_ca_system_score_codex":0.00007204146,"about_ca_system_score_gemma":0.000047953992,"threshold_uncertainty_score":0.999939},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030398311,0.008327723,0.95845,0.00010283101,0.0017312209,0.0005371737,0.000006762864,0.0002605352,0.00018542093],"genre_scores_gemma":[0.997377,0.0016392476,0.00032055727,0.000057432586,0.000257204,0.00021761024,0.000029919056,0.000021034246,0.000080032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983095,0.00005441727,0.0002855058,0.00047575185,0.0003615332,0.0005132954],"domain_scores_gemma":[0.9989209,0.00032851796,0.00010167944,0.00020017716,0.00026935225,0.0001793535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000554665,0.00022588165,0.00021590362,0.0001779282,0.00008135078,0.000289576,0.00048712455,0.00012447545,0.000001270138],"category_scores_gemma":[0.0001970652,0.00021773535,0.00004819734,0.0002915721,0.000011189012,0.00025717585,0.000086445834,0.00047409142,0.000005217467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020671565,0.00011921811,0.00004936701,0.000013482911,0.0000655323,0.000004663554,0.00006225289,0.33763325,0.0005610924,0.27495858,0.00036809413,0.38595775],"study_design_scores_gemma":[0.00045174395,0.0011582992,0.00015517492,0.00005233356,0.0000039474344,0.000010849283,0.000001991217,0.9911736,0.00019225304,0.0012744607,0.005289304,0.00023603627],"about_ca_topic_score_codex":0.000011644735,"about_ca_topic_score_gemma":0.000013936258,"teacher_disagreement_score":0.96697867,"about_ca_system_score_codex":0.00037147422,"about_ca_system_score_gemma":0.00009630901,"threshold_uncertainty_score":0.8878989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023571942,0.0005642259,0.9932692,0.00038252203,0.0014375179,0.00057592744,0.0000011396166,0.000028845569,0.0013834281],"genre_scores_gemma":[0.7809976,0.00005788398,0.21805951,0.00048196083,0.00033121838,0.000013325918,0.000001345763,0.000021418185,0.00003574583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597085,0.00017359048,0.0010448025,0.001210895,0.00080302206,0.0007968174],"domain_scores_gemma":[0.9944352,0.0029206104,0.0006379934,0.0017415422,0.00019409519,0.0000705451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026412646,0.00042785433,0.0007665834,0.0007812041,0.000091643844,0.0001176666,0.0052720737,0.0005466762,0.000010240204],"category_scores_gemma":[0.0003074986,0.00034476767,0.00011378033,0.0014008703,0.0014086043,0.00034931712,0.0016065087,0.0021152843,0.000001720777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009700227,0.0000503512,0.0010643477,0.00006135586,0.00000505179,0.00011532557,0.0026507766,0.6129384,0.00042867797,0.021966252,0.0000035764517,0.36070615],"study_design_scores_gemma":[0.00027829048,0.00014639963,0.001225629,0.00086541125,0.000003914524,0.00009350305,0.0000011556162,0.969225,0.0007104379,0.026786922,0.0002751488,0.00038821573],"about_ca_topic_score_codex":0.00018290685,"about_ca_topic_score_gemma":0.0013802785,"teacher_disagreement_score":0.7786404,"about_ca_system_score_codex":0.0001003878,"about_ca_system_score_gemma":0.00035300173,"threshold_uncertainty_score":0.99990046},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000056464255,0.00038040988,0.54113644,0.00035369518,0.00009393357,0.00022687779,0.000019787445,0.00014763398,0.45763555],"genre_scores_gemma":[0.05730778,0.003924868,0.046529364,0.0024529689,0.00096860586,0.00013675707,0.000664979,0.00011704748,0.8878976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987084,0.000018457169,0.00036173986,0.00040397033,0.0002286189,0.00027877133],"domain_scores_gemma":[0.99926054,0.00004880671,0.00009433447,0.00044130566,0.000046640125,0.000108398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015804885,0.00023254869,0.00020692135,0.00007635963,0.0003992844,0.00030410296,0.0003404386,0.0002517626,0.0005085901],"category_scores_gemma":[0.0000020731657,0.00024724143,0.00007344838,0.00004539987,0.000049979597,0.0005497826,0.00007229609,0.00027645013,0.000113899616],"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":[7.293646e-7,0.000012291792,0.0000011347446,0.0000064928217,0.000031392312,0.000002183117,0.00019725892,0.00090355537,0.000081929866,0.8312635,0.07028315,0.09721641],"study_design_scores_gemma":[0.00020123892,0.00003715405,0.000007129727,0.0000464146,0.000029979892,0.000031918767,0.0000018278079,0.6392397,0.000027434344,0.0063947286,0.35352963,0.00045279],"about_ca_topic_score_codex":0.00004486557,"about_ca_topic_score_gemma":0.00022402263,"teacher_disagreement_score":0.82486874,"about_ca_system_score_codex":0.00006803711,"about_ca_system_score_gemma":0.00007007807,"threshold_uncertainty_score":0.999998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014647525,0.0020411655,0.97573996,0.0011138191,0.00035948813,0.00015772643,7.8489535e-7,0.0006766024,0.00526294],"genre_scores_gemma":[0.92071116,0.0005212663,0.07540923,0.0015229458,0.00038404792,0.00005231755,0.000002553265,0.000018194994,0.001378258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982698,0.000056288103,0.0002898905,0.00048481757,0.00025138687,0.00064780953],"domain_scores_gemma":[0.99881905,0.00010530763,0.00007627516,0.0007581867,0.00007266361,0.00016849338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035773747,0.00018244937,0.00017852905,0.000026427895,0.00025561303,0.00030655152,0.00091387425,0.00010578245,0.00020094389],"category_scores_gemma":[0.00001106043,0.00017032519,0.00008316608,0.0003480917,0.00005059653,0.00093105284,0.0005190047,0.0002055623,0.00030514054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009641957,0.00007614424,0.00031354616,0.00000551235,0.000029905415,0.000024102465,0.00052430417,0.25625205,0.00007321969,0.021017795,0.011552461,0.71012133],"study_design_scores_gemma":[0.00035865334,0.000045843837,0.0019719957,0.00002112244,0.000003857402,0.00001871955,0.000024494582,0.91192204,0.0006243276,0.00042453347,0.084284015,0.00030040237],"about_ca_topic_score_codex":0.000008024473,"about_ca_topic_score_gemma":0.00029416854,"teacher_disagreement_score":0.9060637,"about_ca_system_score_codex":0.00006377488,"about_ca_system_score_gemma":0.00001993342,"threshold_uncertainty_score":0.69456595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2883284,0.000023770719,0.71053094,0.00002092591,0.000109181856,0.0001395138,0.0000011808899,0.00005523861,0.0007908356],"genre_scores_gemma":[0.9824556,0.000008153395,0.017107332,0.00008208305,0.00002950869,0.000021536502,0.0000064245414,0.0000065918657,0.00028273402],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984065,0.00007386017,0.00047094203,0.00043340863,0.00025077537,0.00036446922],"domain_scores_gemma":[0.9989215,0.00007435127,0.00015599774,0.0007258747,0.00006517915,0.00005709555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037870384,0.00014645659,0.00038062944,0.00028877478,0.000032200966,0.00004848942,0.0007822812,0.000097277116,0.000033517892],"category_scores_gemma":[0.000004419287,0.00013557324,0.00014288058,0.0023885972,0.000047994414,0.000269351,0.00019970087,0.00014705333,0.000002977464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009456683,0.00080513477,0.47468674,0.000015919868,0.0005060161,0.000021796945,0.00023074666,0.38790298,0.0011180056,0.09152549,0.00093293615,0.04224479],"study_design_scores_gemma":[0.00032543065,0.000016409336,0.16329552,0.0000052910314,0.000037786616,2.9413374e-7,0.000003869852,0.83570147,0.00038275507,0.00009132414,0.00002018761,0.00011967013],"about_ca_topic_score_codex":0.004020257,"about_ca_topic_score_gemma":0.007112595,"teacher_disagreement_score":0.6941272,"about_ca_system_score_codex":0.00007422734,"about_ca_system_score_gemma":0.000020015746,"threshold_uncertainty_score":0.60774523},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009472297,0.0015308656,0.37089482,0.000085963016,0.0005597053,0.0006507817,0.0000018810217,0.00027002112,0.62591124],"genre_scores_gemma":[0.36931983,0.0016249404,0.010610734,0.0009658035,0.00044937653,0.00009887194,0.000021988131,0.00018532567,0.6167231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972324,0.0000633243,0.00048227503,0.0011336227,0.00050807296,0.00058034057],"domain_scores_gemma":[0.99756145,0.00052895525,0.00031314028,0.0013209184,0.00008831543,0.00018719619],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038684264,0.0005684349,0.00069432287,0.00058663357,0.000069375295,0.00018539425,0.0009695843,0.0006400255,0.0012415887],"category_scores_gemma":[0.000013754613,0.00049592607,0.0001307028,0.00032999212,0.00013430789,0.00038893145,0.0003111065,0.00097403105,0.0003302016],"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.000026934806,0.000078934216,0.0009191276,0.00002464386,0.00009321734,0.0003751998,0.000062042236,0.003688759,3.646659e-7,0.95676076,0.012733216,0.025236778],"study_design_scores_gemma":[0.0034069838,0.0011264648,0.005507454,0.0010037925,0.000094057476,0.00054525706,0.0000041243648,0.85543835,0.000007876065,0.010628375,0.11865987,0.0035773981],"about_ca_topic_score_codex":0.000021592232,"about_ca_topic_score_gemma":0.0001474186,"teacher_disagreement_score":0.9461324,"about_ca_system_score_codex":0.0002711391,"about_ca_system_score_gemma":0.00005181578,"threshold_uncertainty_score":0.99974924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023207972,0.00048523687,0.9931216,0.00031017256,0.002046079,0.0016278306,0.000011992067,0.00017675963,0.0019882019],"genre_scores_gemma":[0.292385,0.000037971273,0.70343965,0.0020461609,0.0014222614,0.00021980115,0.000014964818,0.000091121314,0.00034306743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462396,0.000051150742,0.0007536589,0.002387975,0.0009514749,0.0012317538],"domain_scores_gemma":[0.99612623,0.0010672803,0.0004214326,0.001781709,0.00034789284,0.00025544842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009469022,0.0007646194,0.0008000056,0.0008059924,0.00022735712,0.0006048225,0.004402283,0.0004978986,0.000043143118],"category_scores_gemma":[0.00009190113,0.00074821,0.00018328553,0.00072296825,0.00052982214,0.0010938447,0.0019408193,0.0012507464,0.00006275816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024431276,0.000100473524,0.00015840966,0.0001555471,0.000031956486,0.00024060365,0.0019049933,0.06541979,0.00006803094,0.06947906,0.0005402304,0.8618765],"study_design_scores_gemma":[0.00041040464,0.00021200173,0.00009773845,0.00065309537,0.0000045068755,0.000036991718,4.773849e-7,0.87076616,0.0002597391,0.124683745,0.002114947,0.0007601717],"about_ca_topic_score_codex":0.00010422335,"about_ca_topic_score_gemma":0.00054150156,"teacher_disagreement_score":0.8611163,"about_ca_system_score_codex":0.00058919186,"about_ca_system_score_gemma":0.0005659276,"threshold_uncertainty_score":0.9994969},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07961422,0.023504006,0.7812047,0.0026224528,0.000427329,0.102809116,0.000006972462,0.0017391455,0.008072083],"genre_scores_gemma":[0.93228877,0.0031073852,0.0068711415,0.0020266855,0.00009694277,0.055528685,0.000030033789,0.00003862343,0.000011757698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735343,0.0005582815,0.0005193632,0.00067979615,0.00027672938,0.00061239337],"domain_scores_gemma":[0.99652475,0.0006545066,0.00030671776,0.0020740698,0.00014567406,0.0002942629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007057177,0.0003940524,0.00038404838,0.00013084195,0.00075434864,0.0007891715,0.0012854657,0.00031948046,0.000035238125],"category_scores_gemma":[0.000020616668,0.00038894525,0.00010495728,0.0006541938,0.00029595234,0.00077626074,0.00091722043,0.0010119871,0.000007593628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010864671,0.00057780877,0.002339704,0.00016853047,0.000121124685,0.0000096991425,0.002723676,0.11206754,0.000040360625,0.019233407,0.006994452,0.855615],"study_design_scores_gemma":[0.0009767099,0.00022204842,0.0012923573,0.00037541814,0.000008758307,0.0000049526625,0.000116459414,0.96901196,0.000014232976,0.002202932,0.02530716,0.00046702998],"about_ca_topic_score_codex":0.000015627551,"about_ca_topic_score_gemma":0.000056354536,"teacher_disagreement_score":0.8569444,"about_ca_system_score_codex":0.000043751297,"about_ca_system_score_gemma":0.00003258199,"threshold_uncertainty_score":0.99985623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5862864,0.008801264,0.40239248,0.000061712344,0.00016112256,0.0005545156,0.0000025398729,0.00013728914,0.0016026665],"genre_scores_gemma":[0.921042,0.005607916,0.07300516,0.00015679591,0.000025096535,0.00011688106,0.000006042917,0.0000224492,0.000017660619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768686,0.00033464204,0.00072569516,0.00056071155,0.00020192238,0.0004901673],"domain_scores_gemma":[0.9961528,0.00049463985,0.00041367582,0.0026859466,0.00016807391,0.00008484278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000781287,0.0002686742,0.0005046862,0.00010851107,0.00036268428,0.00008072708,0.002266669,0.00013036688,0.00000534895],"category_scores_gemma":[0.000012139375,0.00028255445,0.000083262996,0.0008760984,0.000293761,0.0005299693,0.0021904917,0.0004448526,0.0000022978259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028329994,0.0011003452,0.010100994,0.00011181494,0.00006554095,0.000009194127,0.011484308,0.030070437,0.001062012,0.09925327,0.000066796594,0.84664696],"study_design_scores_gemma":[0.0005806262,0.00011106321,0.005190396,0.00038419527,0.000008059648,0.000008075686,0.00034005163,0.9897265,0.000760471,0.0015472355,0.0010183436,0.0003250175],"about_ca_topic_score_codex":0.00041548442,"about_ca_topic_score_gemma":0.00031801275,"teacher_disagreement_score":0.959656,"about_ca_system_score_codex":0.00007135979,"about_ca_system_score_gemma":0.000062159605,"threshold_uncertainty_score":0.9999627},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039633395,4.1124687e-7,0.87522995,0.0006919162,0.0000929992,0.12211224,9.98225e-7,0.00037535367,0.0010997731],"genre_scores_gemma":[0.2905321,1.1975337e-8,0.32810277,0.0007979448,0.00011793495,0.38023132,0.0000024043281,0.000011651341,0.00020386543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856377,0.000033801418,0.00028281106,0.0005069145,0.00021222926,0.00040050407],"domain_scores_gemma":[0.99877614,0.00013653589,0.000089966044,0.000818119,0.00008287255,0.00009638773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048655394,0.00014812674,0.00015475991,0.000032217024,0.00012989888,0.0001442284,0.0007836969,0.000079928584,0.000053500644],"category_scores_gemma":[0.000029079556,0.00012503538,0.0000682451,0.00022925119,0.000035954887,0.00026342928,0.0001463629,0.00011073492,0.000043665408],"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.00006993542,0.0005733018,0.0006442319,0.00014123466,0.000014670375,0.000013245665,0.00010597275,0.06055266,0.00024294126,0.8997028,0.0025038114,0.035435185],"study_design_scores_gemma":[0.0155975055,0.0014413,0.0058157584,0.00020096326,0.000011855671,0.000015182965,0.000017725493,0.80813235,0.052321285,0.08312773,0.032054435,0.0012638757],"about_ca_topic_score_codex":0.00014905658,"about_ca_topic_score_gemma":0.00009515727,"teacher_disagreement_score":0.81657505,"about_ca_system_score_codex":0.00011065962,"about_ca_system_score_gemma":0.0001679847,"threshold_uncertainty_score":0.5098795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05394281,0.0004536864,0.9435912,0.000155204,0.00013119527,0.0003446222,6.279482e-7,0.00017599852,0.0012046937],"genre_scores_gemma":[0.85878927,0.00002525618,0.14045554,0.0004808387,0.000044978624,0.000031048894,8.3751877e-7,0.000019887777,0.00015235487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767977,0.00019698209,0.0005665856,0.00063271524,0.00033617378,0.0005877925],"domain_scores_gemma":[0.9982878,0.00031891358,0.0003343978,0.0007898966,0.00015139306,0.0001176014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704136,0.00024613968,0.0003909031,0.00008772645,0.00008540506,0.00008614967,0.0010143352,0.00012920616,0.00002925897],"category_scores_gemma":[0.000019280686,0.00020789838,0.0000532337,0.0011688388,0.000045852157,0.00060567237,0.0004380047,0.00039385573,0.000014111098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112172136,0.00075731514,0.016276803,0.00009666547,0.000078962024,0.00010348382,0.008747033,0.21915163,0.0005133602,0.05386108,0.00014192313,0.70015955],"study_design_scores_gemma":[0.00094549527,0.00012481552,0.0044752504,0.000118471675,0.0000036771726,0.000005724809,0.0002686189,0.99364275,0.000082072926,0.00002123243,0.000015639325,0.0002962425],"about_ca_topic_score_codex":0.0010466734,"about_ca_topic_score_gemma":0.0042704977,"teacher_disagreement_score":0.80484647,"about_ca_system_score_codex":0.000081034865,"about_ca_system_score_gemma":0.000034694553,"threshold_uncertainty_score":0.847785},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010864011,0.00014517302,0.97972864,0.00016993536,0.000056783905,0.00022213226,5.86429e-7,0.00010861449,0.008704139],"genre_scores_gemma":[0.96330786,0.000004746415,0.036301583,0.00025710472,0.000019938707,0.000048395923,8.404028e-7,0.000010305873,0.0000492208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975623,0.00006202193,0.00026844512,0.00088189414,0.000650979,0.00057437574],"domain_scores_gemma":[0.9989303,0.000088846486,0.00009302255,0.0004883926,0.00006131772,0.00033811622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013641021,0.00019475268,0.00020321345,0.00019239436,0.00017597213,0.00022846911,0.0009915928,0.00008554924,0.0000027479134],"category_scores_gemma":[0.000017329021,0.00017645104,0.000021667123,0.000980972,0.00028533195,0.00072901236,0.00023768462,0.00021366186,0.0000055005557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008654731,0.00017691865,0.0008355379,0.000015834363,0.0000038891503,0.00008285288,0.007247238,0.10915649,0.033371706,0.12947027,0.000067719724,0.719485],"study_design_scores_gemma":[0.0009366913,0.000048813105,0.00090399286,0.000024746361,0.0000016801922,0.000005427181,0.000045130917,0.9662777,0.001160399,0.030224012,0.0001571191,0.00021424795],"about_ca_topic_score_codex":0.000121656805,"about_ca_topic_score_gemma":0.000051629995,"teacher_disagreement_score":0.95244384,"about_ca_system_score_codex":0.00013846313,"about_ca_system_score_gemma":0.000332226,"threshold_uncertainty_score":0.7195465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006744324,0.019160122,0.97262496,0.0003374342,0.0033425016,0.0021266257,0.0000029209184,0.00035531644,0.0019826635],"genre_scores_gemma":[0.14001204,0.008139718,0.8416787,0.0042091636,0.003919031,0.00046404175,0.000027782466,0.00024743218,0.0013021376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915491,0.0002618567,0.001651682,0.0031013605,0.0015758098,0.0018602414],"domain_scores_gemma":[0.9935966,0.0024311482,0.00079343753,0.002561185,0.00025285114,0.0003647496],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004471061,0.001183624,0.002063159,0.0011272067,0.00032498335,0.0010362761,0.0062836227,0.00092462037,0.00006033088],"category_scores_gemma":[0.00016042068,0.0010875145,0.00045653278,0.0015570775,0.0012660733,0.0010833048,0.0029125423,0.0026532765,0.00007145688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014568664,0.000026250438,0.0000063134235,0.000008959095,0.000011821762,0.00009888417,0.00041425248,0.42736116,0.0000018494392,0.001819828,0.000023514107,0.5700815],"study_design_scores_gemma":[0.015078699,0.0001269092,0.000015776897,0.00069609005,0.000014839875,0.00008843272,3.9336038e-7,0.96530783,0.000037692134,0.013289038,0.0042238003,0.0011204812],"about_ca_topic_score_codex":0.000019526555,"about_ca_topic_score_gemma":0.00023100624,"teacher_disagreement_score":0.568961,"about_ca_system_score_codex":0.0008152043,"about_ca_system_score_gemma":0.0006222296,"threshold_uncertainty_score":0.9996476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000859575,0.000047992766,0.9965765,0.00003990433,0.00030867272,0.00037952678,0.000002169602,0.00024139184,0.0015442759],"genre_scores_gemma":[0.9088653,0.00003286051,0.09070781,0.00007777792,0.00013900617,0.00009106536,0.000002739528,0.000030681596,0.00005276649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979819,0.000029777602,0.00047323832,0.0005128568,0.0002873725,0.0007148467],"domain_scores_gemma":[0.9988061,0.00018530067,0.00014638747,0.0005369083,0.00014998153,0.00017527671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003332864,0.00027804807,0.00039488962,0.00014233642,0.000065979206,0.000056887413,0.0009441421,0.00015441005,0.000020627214],"category_scores_gemma":[0.000043099473,0.00027733124,0.00012592917,0.00061186036,0.000021725813,0.00016651583,0.00010944686,0.00035227093,0.0000056485837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014789228,0.00010789168,0.000027791775,0.000018517616,0.000045381195,0.0000088977,0.00020743426,0.0034778118,0.00061029126,0.39703134,0.00011132443,0.59833854],"study_design_scores_gemma":[0.00044646292,0.00042155315,0.00026313658,0.00008747018,0.000011628218,0.000006117049,0.0000035393489,0.9956205,0.0023425983,0.00035409583,0.00014501736,0.0002979214],"about_ca_topic_score_codex":0.000022649923,"about_ca_topic_score_gemma":0.0000024020276,"teacher_disagreement_score":0.9921427,"about_ca_system_score_codex":0.000081670434,"about_ca_system_score_gemma":0.00007254034,"threshold_uncertainty_score":0.9999679},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068529025,0.0004895421,0.9853778,0.0011134102,0.00014810998,0.00086440204,0.0000012485231,0.0004201823,0.0047324253],"genre_scores_gemma":[0.69304156,0.000072779316,0.30300295,0.0023670504,0.00041332087,0.0004136034,0.00004117353,0.000031302916,0.00061625947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998091,0.00005854163,0.00028881957,0.0006956093,0.0002948764,0.00057118083],"domain_scores_gemma":[0.99858755,0.00011376266,0.00015325753,0.0008135104,0.00018749136,0.0001444376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024325507,0.00027118664,0.00027034464,0.00006586849,0.00016143468,0.00026593552,0.0010170853,0.00015387987,0.000015193753],"category_scores_gemma":[0.0000027758556,0.00020311913,0.00007243902,0.00062722096,0.000026488868,0.0006748386,0.00022217853,0.0001889821,0.000023524586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012113547,0.00049147813,0.00027609736,0.00008564792,0.00010169593,0.0000026593827,0.00065435213,0.17439516,0.0000418314,0.16447164,0.0044712066,0.6548871],"study_design_scores_gemma":[0.00091096543,0.00015262286,0.0006568435,0.000021049402,0.000018831128,0.00002164882,0.000031515454,0.9935159,0.000040818148,0.0011735326,0.0031287854,0.00032749306],"about_ca_topic_score_codex":0.00000628036,"about_ca_topic_score_gemma":0.00022430491,"teacher_disagreement_score":0.8191207,"about_ca_system_score_codex":0.000075678094,"about_ca_system_score_gemma":0.000044379653,"threshold_uncertainty_score":0.82829577},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007072961,9.4067065e-7,0.88643134,0.00016906224,0.00017479368,0.10678464,0.000002700416,0.00028689703,0.0054423492],"genre_scores_gemma":[0.2479818,1.5722281e-7,0.043939456,0.00042008722,0.00042456016,0.69306624,0.000023682427,0.00002803965,0.014115968],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987946,0.000018283225,0.00028444972,0.0003877321,0.00019632559,0.0003185815],"domain_scores_gemma":[0.99929947,0.000033092994,0.00007715665,0.00043305356,0.00009884659,0.000058368143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016527875,0.00013856453,0.00014215393,0.00003814401,0.000086592605,0.00006173619,0.0005039175,0.000081788516,0.00006855777],"category_scores_gemma":[0.0000012423486,0.00011981209,0.0001021068,0.00013312223,0.000022974247,0.0002517691,0.000019558418,0.00004610772,0.000032453263],"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.00020435655,0.0015552182,0.03304175,0.0006280954,0.0000683496,0.000146075,0.00031027503,0.013967463,0.0035324025,0.40130875,0.45491776,0.09031953],"study_design_scores_gemma":[0.006830158,0.0005864523,0.038877834,0.00016105997,0.000023452978,0.000054782726,0.000018297733,0.5633652,0.013819034,0.010284018,0.36487845,0.0011012807],"about_ca_topic_score_codex":0.00036097143,"about_ca_topic_score_gemma":0.0012839114,"teacher_disagreement_score":0.84249187,"about_ca_system_score_codex":0.000034720404,"about_ca_system_score_gemma":0.000044488024,"threshold_uncertainty_score":0.4885795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010764346,0.0019127625,0.98109895,0.00023738909,0.0005795954,0.0006617113,0.0000010480845,0.00040666957,0.014025415],"genre_scores_gemma":[0.9008555,0.00029248616,0.08988634,0.0015724519,0.0004463242,0.00024671463,0.000002591652,0.000028746661,0.0066688424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983165,0.000046200348,0.00026274932,0.0005489385,0.00023312052,0.0005924369],"domain_scores_gemma":[0.9985783,0.000373755,0.000094216215,0.0006501705,0.00017028894,0.00013325844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034251358,0.00018406719,0.00021014019,0.000032322823,0.0001832182,0.00017798586,0.0006079217,0.00011218655,0.00010766226],"category_scores_gemma":[0.00003309805,0.00016915741,0.0001216613,0.00033957924,0.000038186492,0.00037763597,0.00026653256,0.00016742661,0.00012914155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008549245,0.00009115428,0.000043141292,0.0000064277433,0.00003498486,0.000023349236,0.00091790507,0.03119297,0.00004867407,0.024762683,0.04935513,0.89351505],"study_design_scores_gemma":[0.0003518186,0.00015622812,0.0000432504,0.000015541642,0.000005342536,0.000016006272,0.000038709786,0.94974566,0.00020616449,0.0002807887,0.04891409,0.000226391],"about_ca_topic_score_codex":0.0000035768041,"about_ca_topic_score_gemma":0.00002493014,"teacher_disagreement_score":0.9185527,"about_ca_system_score_codex":0.000098100885,"about_ca_system_score_gemma":0.000019827845,"threshold_uncertainty_score":0.6898039},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06434406,0.00025905768,0.92926717,0.0005063816,0.00018317993,0.00042907897,3.4071817e-7,0.0003409304,0.004669779],"genre_scores_gemma":[0.9894395,0.000002262859,0.008345501,0.0017185636,0.00015678782,0.000097765704,0.0000031165273,0.000021476017,0.00021504979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997654,0.00030067176,0.00035185416,0.000634761,0.00044003883,0.00061867223],"domain_scores_gemma":[0.99847776,0.00022571727,0.00009405851,0.0008321347,0.00007748409,0.0002928193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089680555,0.00022399132,0.00033685123,0.00014057397,0.00004275528,0.00024706323,0.001267408,0.00017207487,0.0000084272615],"category_scores_gemma":[0.000013800972,0.00020199781,0.00007906836,0.00086382224,0.0000999223,0.00029251465,0.00013877991,0.00034267767,0.000022869952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032708645,0.00013883511,0.00050434214,0.0000043555146,0.000009068035,0.00001276555,0.00025877816,0.9720258,0.0000035149928,0.008102412,0.001144793,0.017762609],"study_design_scores_gemma":[0.002367525,0.00008151977,0.0009124823,0.00001892809,0.000004702926,0.000008598812,0.000082921266,0.99535996,0.000007935878,0.00020851305,0.00068956043,0.0002573705],"about_ca_topic_score_codex":0.00007798851,"about_ca_topic_score_gemma":0.00012031172,"teacher_disagreement_score":0.92509544,"about_ca_system_score_codex":0.00011971415,"about_ca_system_score_gemma":0.00013875135,"threshold_uncertainty_score":0.8237232},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051023986,0.000032358257,0.99696493,0.00094342633,0.00017308336,0.00055281055,6.7952675e-7,0.00017408696,0.0006483766],"genre_scores_gemma":[0.06634045,0.000010892303,0.9324733,0.0007824043,0.00006655176,0.000113288894,0.000008288627,0.00001003079,0.00019479656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988997,0.00002411957,0.00024112954,0.000347974,0.00013805734,0.00034900405],"domain_scores_gemma":[0.9994706,0.00007184483,0.00006608055,0.00028730065,0.000041521886,0.00006268226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028428982,0.00011078812,0.00013489684,0.000059061793,0.000053655105,0.00008919676,0.00043549712,0.00007374946,0.000010753484],"category_scores_gemma":[0.0000152105995,0.00010601758,0.000039100603,0.0002561655,0.000013954981,0.00032603645,0.00013333098,0.00007985273,0.000010778728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025094537,0.000059547412,0.00006268587,0.0000030129906,0.0000057836387,0.000014900005,0.00021698019,0.934838,0.0000052511805,0.027374597,0.0003728078,0.037043914],"study_design_scores_gemma":[0.0010248052,0.00009125642,0.00019730705,0.000018544202,0.00000204626,0.000010927769,0.00001170411,0.9960035,0.0000715979,0.0019921667,0.0004369855,0.00013917295],"about_ca_topic_score_codex":0.00013231408,"about_ca_topic_score_gemma":0.000094224924,"teacher_disagreement_score":0.0658302,"about_ca_system_score_codex":0.000117311174,"about_ca_system_score_gemma":0.000060928764,"threshold_uncertainty_score":0.43232712},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036932472,0.0008067967,0.98781806,0.0010313351,0.0002172617,0.0008307868,0.000010955453,0.00038328604,0.0052082893],"genre_scores_gemma":[0.92098016,0.00036201824,0.0768961,0.0005837631,0.00002968587,0.00044016103,0.000023973853,0.000013332471,0.0006708355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899703,0.000043949494,0.0002689861,0.00023969491,0.00017025425,0.00028008077],"domain_scores_gemma":[0.9978217,0.00015406011,0.00011289491,0.0016800835,0.0001443012,0.000086966145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011331725,0.00013962225,0.0001432924,0.000063288266,0.00026213776,0.00016147055,0.001813646,0.00010374691,0.00019885464],"category_scores_gemma":[0.000008359482,0.00012674193,0.00007742272,0.00032766035,0.000050322025,0.0010026816,0.00044726458,0.00015687043,0.00006416579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051919505,0.00015043515,0.00011152144,0.00004215337,0.000027280494,0.0000012557633,0.0037155624,0.0022074536,0.0002285513,0.07535519,0.1665743,0.75158113],"study_design_scores_gemma":[0.00029662316,0.0001190587,0.0001554956,0.000013238178,0.0000031508876,0.000011475817,0.00013612691,0.78888416,0.00016523016,0.0017707449,0.20827536,0.00016934656],"about_ca_topic_score_codex":0.0000011196765,"about_ca_topic_score_gemma":0.000022719703,"teacher_disagreement_score":0.9172869,"about_ca_system_score_codex":0.00006781557,"about_ca_system_score_gemma":0.000015276586,"threshold_uncertainty_score":0.51683855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22480959,0.0004730873,0.77154243,0.00005743078,0.00032424554,0.00026728833,3.8774817e-7,0.00016452477,0.0023609956],"genre_scores_gemma":[0.99459887,0.00022552775,0.004815003,0.00015273693,0.00003217122,0.00007300024,0.0000028760408,0.000005905776,0.00009391796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987959,0.00015165244,0.00023229582,0.00041824282,0.00013426805,0.0002676338],"domain_scores_gemma":[0.99937797,0.00007509364,0.000042858985,0.00039342415,0.000024261759,0.00008637034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005878711,0.00010598276,0.00012220364,0.000041371313,0.000060264647,0.00008285972,0.00016855884,0.00009970865,0.000043937514],"category_scores_gemma":[0.0000124996,0.00010068852,0.000022420383,0.00035781466,0.000042341737,0.0005174476,0.000073205025,0.00016313036,0.000008184545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032566353,0.00055881427,0.08562925,0.000035719855,0.000017864253,0.000025117557,0.0004225248,0.014047126,0.00024845157,0.5547184,0.0030721212,0.34119204],"study_design_scores_gemma":[0.0005132337,0.00012783345,0.055853628,0.00002389294,0.0000027518809,0.000015057213,0.000020787742,0.93313116,0.00010265449,0.0073509985,0.00269423,0.00016375001],"about_ca_topic_score_codex":0.000011348151,"about_ca_topic_score_gemma":0.0002311504,"teacher_disagreement_score":0.9190841,"about_ca_system_score_codex":0.000053156742,"about_ca_system_score_gemma":0.000013988326,"threshold_uncertainty_score":0.4105959},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004907563,0.000037452926,0.89497155,0.00010034699,0.00014702058,0.09938423,7.198632e-7,0.00031323673,0.00013789476],"genre_scores_gemma":[0.6042089,0.000010553673,0.14393716,0.00044486127,0.00020687099,0.25093058,0.0000020578907,0.00005325341,0.00020580477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972072,0.00012342741,0.0006700038,0.0008521647,0.00030288083,0.000844278],"domain_scores_gemma":[0.9984701,0.00031981838,0.00015606091,0.0007205553,0.00009891669,0.00023449933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035894493,0.00033012335,0.00038266758,0.00009982051,0.00025879205,0.00009736489,0.000987922,0.00018994126,0.00003127644],"category_scores_gemma":[0.000022233817,0.00028789855,0.00016733675,0.0004394767,0.000060896244,0.00039446846,0.00019420694,0.0002896245,0.000011540674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042499974,0.00066794944,0.001314524,0.00010060638,0.000031910087,0.000316821,0.001586951,0.24426045,0.0009915117,0.00047750323,0.0013572786,0.7484695],"study_design_scores_gemma":[0.0032231947,0.00020246934,0.00034006062,0.00013344962,0.0000025399038,0.00009706883,0.000008393496,0.9839092,0.002228138,0.000027791082,0.009464821,0.00036287858],"about_ca_topic_score_codex":0.000024984414,"about_ca_topic_score_gemma":0.00008563908,"teacher_disagreement_score":0.7510344,"about_ca_system_score_codex":0.00009831906,"about_ca_system_score_gemma":0.00008470581,"threshold_uncertainty_score":0.9999573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010713754,0.00019761332,0.9870407,0.00037267798,0.0002515724,0.0007341763,4.048762e-7,0.00023786133,0.0004512322],"genre_scores_gemma":[0.7756758,0.00005520706,0.22230041,0.0005925372,0.0003163361,0.0003487436,0.0000014886135,0.000021823447,0.0006876757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998143,0.000078575235,0.00035303467,0.0005810811,0.00018816293,0.0006561482],"domain_scores_gemma":[0.99900377,0.00035437767,0.000113049115,0.00030149834,0.0001244203,0.0001028597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005266896,0.0002010834,0.0002353621,0.000112504094,0.00017119007,0.00031554638,0.00060733047,0.00017696917,0.00003144503],"category_scores_gemma":[0.000024420739,0.00019126642,0.00009701046,0.00063053885,0.000027765345,0.0009015842,0.00014597681,0.00022697521,0.000020562407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004329124,0.00005314761,0.00087581103,0.0000058187748,0.000015621765,0.0000029470086,0.00015044239,0.66113645,0.0002718034,0.0058499044,0.003450242,0.3281445],"study_design_scores_gemma":[0.00078055996,0.00009453818,0.0010682715,0.00002530641,0.0000042975435,0.0000108260165,0.000006708413,0.99086183,0.0021846155,0.0004516588,0.004264333,0.00024707182],"about_ca_topic_score_codex":0.000011027776,"about_ca_topic_score_gemma":0.00021692527,"teacher_disagreement_score":0.764962,"about_ca_system_score_codex":0.00023050171,"about_ca_system_score_gemma":0.00007299745,"threshold_uncertainty_score":0.7799618},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013187271,0.008666297,0.97079885,0.00029157873,0.00034537987,0.00038471038,6.1680396e-8,0.00031363434,0.0060121887],"genre_scores_gemma":[0.9836158,0.00046216277,0.013951348,0.00034113796,0.00009813353,0.000089832356,7.683238e-7,0.000011579542,0.0014292256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985845,0.0000773597,0.00031271126,0.0004239852,0.00018893187,0.00041249293],"domain_scores_gemma":[0.9990606,0.0001349188,0.000078999285,0.00059587136,0.00004832394,0.00008133386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003380214,0.00013555957,0.00015243815,0.00007027381,0.00006781515,0.0001311403,0.00065670477,0.00010334807,0.00015659482],"category_scores_gemma":[0.000019473495,0.00013258582,0.000037287635,0.00094766513,0.000022046102,0.0005587616,0.00015429166,0.00023440715,0.00018001416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020032774,0.000098255994,0.0006330258,0.000005648291,0.0000041646595,0.000015230172,0.000756687,0.2205035,0.000017849474,0.007790053,0.0037344128,0.7664392],"study_design_scores_gemma":[0.0002714336,0.00004689424,0.001059019,0.000032377367,0.0000013190696,0.000008177751,0.000037119335,0.99335814,0.00004763138,0.00016852641,0.0048049875,0.00016439125],"about_ca_topic_score_codex":0.00000986606,"about_ca_topic_score_gemma":0.00013726935,"teacher_disagreement_score":0.9704285,"about_ca_system_score_codex":0.00008137062,"about_ca_system_score_gemma":0.0000122366155,"threshold_uncertainty_score":0.54066926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006272417,0.0019140342,0.9829442,0.0001592571,0.00032897323,0.008346437,0.000004786728,0.000026140295,0.0000037627333],"genre_scores_gemma":[0.87795734,0.00004711774,0.11239315,0.0003529942,0.0006797848,0.008503352,0.000001969349,0.000049294245,0.000014996989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983964,0.000022113973,0.0004944099,0.00030092767,0.00019277667,0.00059337425],"domain_scores_gemma":[0.998458,0.00028810525,0.00021498126,0.00026583363,0.00016467102,0.0006083922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020949963,0.00024891237,0.00040833082,0.00021499363,0.000101860365,0.000119169716,0.00061768777,0.00010569352,0.0000022600025],"category_scores_gemma":[0.00003429225,0.00022471501,0.00015449757,0.0004538546,0.000037085032,0.0002000605,0.000025499317,0.00039137143,4.3998347e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114455885,0.0000603083,0.00021350998,0.00009730724,0.000046118985,0.00009141812,0.00008478825,0.91844755,0.00005158594,0.0019215972,0.00044659228,0.07842477],"study_design_scores_gemma":[0.0024327529,0.0021388615,0.0015556222,0.00040971572,0.000009347526,0.00006435092,7.104647e-7,0.95081806,0.00029787727,0.00008698377,0.041914284,0.00027141467],"about_ca_topic_score_codex":0.000010049946,"about_ca_topic_score_gemma":0.00015940332,"teacher_disagreement_score":0.8716849,"about_ca_system_score_codex":0.00022656817,"about_ca_system_score_gemma":0.0005466121,"threshold_uncertainty_score":0.9163612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12276694,0.0063039633,0.86922777,0.00035741838,0.00006643692,0.00061983423,9.71625e-7,0.00021877741,0.00043788072],"genre_scores_gemma":[0.87106365,0.0011894901,0.12736537,0.00017946454,0.000019166926,0.000115518895,0.00002099387,0.000033253044,0.000013117582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974416,0.00060444535,0.00053250126,0.00061095937,0.00024692935,0.00056356494],"domain_scores_gemma":[0.9969322,0.00057453767,0.00024252865,0.0019424373,0.00013562253,0.00017267944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008941613,0.00031731752,0.0004032118,0.0001767085,0.0007797714,0.00027662618,0.0014349878,0.00015662001,0.0000048757],"category_scores_gemma":[0.0000066586317,0.0003021856,0.00006985544,0.0010250079,0.0002104821,0.0003311778,0.0003821502,0.00058710756,0.0000015897036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021207337,0.0003797046,0.002206151,0.0000480795,0.00002941366,0.000017986058,0.0014081958,0.25242272,0.0003982317,0.025354927,0.00002988615,0.7176835],"study_design_scores_gemma":[0.0011340203,0.00013253099,0.00090374734,0.0005960471,0.000013921034,0.000043886557,0.00019923675,0.99424756,0.00019659594,0.000063559084,0.0020791981,0.0003897077],"about_ca_topic_score_codex":0.000022386477,"about_ca_topic_score_gemma":0.00006914877,"teacher_disagreement_score":0.7482967,"about_ca_system_score_codex":0.000095788055,"about_ca_system_score_gemma":0.000116921234,"threshold_uncertainty_score":0.999943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89184725,0.0005724349,0.09540579,0.006205473,0.0009596064,0.0030707875,0.00008100114,0.0003882062,0.0014694675],"genre_scores_gemma":[0.77704257,0.000039423863,0.21925913,0.00049008284,0.002117409,0.0006721209,0.000019016847,0.00008648326,0.0002737796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966396,5.0058087e-8,0.0010761927,0.00065552257,0.00085518236,0.00077344856],"domain_scores_gemma":[0.9957924,0.0004646866,0.0006968614,0.00013522564,0.0026992285,0.00021162197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010496487,0.00044471378,0.0006087353,0.00012534954,0.00016426503,0.00045711474,0.0021527808,0.000304351,0.0000047035987],"category_scores_gemma":[0.00040062988,0.00039091,0.0006772785,0.00072252646,0.00015165597,0.0009277945,0.00015081046,0.0003503448,0.0000032088096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001234671,0.00018755454,0.00021069666,0.00043866326,0.00037524354,1.1390516e-7,0.00007309178,0.19413368,0.010432949,0.7812067,0.0114781875,0.0013396168],"study_design_scores_gemma":[0.0025081993,0.00038578687,0.00017668893,0.0002623599,0.00011061488,0.000008983923,0.000090520276,0.9843883,0.0031237064,0.00090321957,0.0076473486,0.00039427308],"about_ca_topic_score_codex":0.0000072939592,"about_ca_topic_score_gemma":2.4427578e-7,"teacher_disagreement_score":0.7902546,"about_ca_system_score_codex":0.00026805047,"about_ca_system_score_gemma":0.00011755298,"threshold_uncertainty_score":0.99985427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14825608,0.000027919605,0.8490381,0.000012395003,0.00018806447,0.002428611,9.004701e-8,0.00003319268,0.000015508434],"genre_scores_gemma":[0.71950155,0.0000044548988,0.27939087,0.000040774743,0.0003213855,0.0007226158,8.864914e-8,0.000013219512,0.0000050118706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985822,0.000019358062,0.00055162713,0.00022130767,0.00018605318,0.00043947902],"domain_scores_gemma":[0.9993041,0.00013906031,0.00019096321,0.00014415488,0.00008696762,0.00013474975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040713802,0.00017931104,0.00030583199,0.0002024453,0.000045604236,0.000079397934,0.00048637792,0.00007736832,0.0000015507181],"category_scores_gemma":[0.000016788492,0.00015474885,0.00007942177,0.00031102056,0.000007968725,0.00047307453,0.00009922932,0.00035434574,6.386548e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030976886,0.0005773775,0.017309584,0.00041759625,0.00014836156,0.0004054932,0.0029874467,0.60270876,0.005375346,0.0028904036,0.00031259784,0.36655727],"study_design_scores_gemma":[0.00087591674,0.0004769867,0.0068932115,0.00019569827,0.0000049937976,0.00023291944,0.0000012405233,0.9876831,0.0032383108,0.0000199236,0.00019346875,0.00018420955],"about_ca_topic_score_codex":0.0000029806004,"about_ca_topic_score_gemma":0.0000018655442,"teacher_disagreement_score":0.5712455,"about_ca_system_score_codex":0.000067296874,"about_ca_system_score_gemma":0.000041809006,"threshold_uncertainty_score":0.6310475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025482327,0.00058791414,0.99644667,0.0005189503,0.000021342048,0.0018870063,0.000005028522,0.00015465877,0.00012359588],"genre_scores_gemma":[0.9286584,0.000121885794,0.06708647,0.0011667347,0.00014507816,0.0027537826,0.000011575313,0.000013499241,0.000042529744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880624,0.000032588527,0.00019767783,0.0005188612,0.000105597195,0.00033901198],"domain_scores_gemma":[0.9989816,0.00023914772,0.00006367811,0.00048750042,0.000054176955,0.00017387395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025323176,0.0001758409,0.00018091875,0.000035731053,0.0002111261,0.00016270281,0.00034440059,0.00013926256,0.0000048755705],"category_scores_gemma":[0.0000031633256,0.0001615785,0.000044620894,0.00018826594,0.00009772291,0.00009954164,0.00006615065,0.00014244374,0.0000015132863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005187598,0.000041025014,0.0000010896125,0.0000033183826,0.0000028144927,3.2966946e-7,0.00001651836,0.3770874,0.000025677951,0.5857139,0.00027951493,0.036823202],"study_design_scores_gemma":[0.00027078862,0.00013169748,0.000011689272,0.00000907206,0.000012460323,0.0000054025795,0.0000029175633,0.77762514,0.000036330355,0.22045557,0.001293533,0.00014540013],"about_ca_topic_score_codex":5.0782467e-7,"about_ca_topic_score_gemma":9.3608617e-7,"teacher_disagreement_score":0.9293602,"about_ca_system_score_codex":0.000013837248,"about_ca_system_score_gemma":0.000031427157,"threshold_uncertainty_score":0.658898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11644786,0.00089129526,0.8773334,0.0009145219,0.00036139146,0.0001740209,0.0000023373216,0.00019032256,0.0036848455],"genre_scores_gemma":[0.9241367,0.000009002263,0.074104965,0.0014302193,0.00013469625,0.000006454561,0.000013362418,0.0000066202606,0.0001579525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985504,0.000048327278,0.0002853873,0.00041074638,0.00038014282,0.000325003],"domain_scores_gemma":[0.99920756,0.00019783097,0.000071084585,0.0003351572,0.00008429796,0.000104044295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021413498,0.00014167384,0.00016688762,0.00034225103,0.00006938842,0.00012151055,0.0007352513,0.00007084192,0.000044303473],"category_scores_gemma":[0.000034975565,0.00015372648,0.000059789894,0.0015293972,0.000027661848,0.0002789993,0.00013053828,0.00018764472,0.00021378318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055679525,0.00016307572,0.0011422699,0.0000041515436,0.000007376898,0.00013638342,0.00014652922,0.49958983,0.000029712346,0.06420671,0.0023248144,0.4322436],"study_design_scores_gemma":[0.0006170741,0.00014631847,0.101449795,0.000028220842,0.0000023937157,0.00014969023,0.000009135936,0.8060518,0.00004884314,0.08671861,0.004438432,0.00033969863],"about_ca_topic_score_codex":0.000005565996,"about_ca_topic_score_gemma":0.000002051175,"teacher_disagreement_score":0.8076889,"about_ca_system_score_codex":0.00007731103,"about_ca_system_score_gemma":0.00008049542,"threshold_uncertainty_score":0.6268784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09743673,0.000013240928,0.8957303,0.00017013354,0.00032638857,0.0015537002,9.4085624e-7,0.00010157141,0.004666962],"genre_scores_gemma":[0.828378,4.1130878e-7,0.17045046,0.00024574867,0.000117962336,0.00036255407,0.0000027997924,0.000009226893,0.00043278062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998851,0.000029432666,0.00021758585,0.00032814374,0.00032589523,0.0002479188],"domain_scores_gemma":[0.99901557,0.0000948514,0.00009701851,0.00043058806,0.0002946572,0.00006728669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010287148,0.00011028159,0.00018378677,0.000050407114,0.00010325844,0.00013262003,0.0005125057,0.00008368434,0.00006995931],"category_scores_gemma":[0.00008336485,0.00009046243,0.000061955754,0.00014113991,0.000018649584,0.00040150108,0.000060562,0.00011094628,0.000005050106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025291738,0.00016407839,0.00016325373,0.00004440302,0.000053961863,0.0000013972439,0.00044799157,0.80672586,0.007951876,0.07751291,0.0017434616,0.10493786],"study_design_scores_gemma":[0.0030686154,0.000023694352,0.000019201718,0.000004062069,0.000022213666,0.00000555116,0.000005367047,0.9779503,0.00035714902,0.018360123,0.00006251823,0.00012120852],"about_ca_topic_score_codex":0.0000062492995,"about_ca_topic_score_gemma":0.000041878448,"teacher_disagreement_score":0.7309413,"about_ca_system_score_codex":0.0000241144,"about_ca_system_score_gemma":0.00019821555,"threshold_uncertainty_score":0.36889508},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021019021,0.000054340526,0.95377964,0.00016378694,0.00049372547,0.0003855588,0.0000018558711,0.00038909094,0.023712955],"genre_scores_gemma":[0.8885287,0.0000021889769,0.10965501,0.00077229674,0.000083913175,0.00004550676,0.0000014436952,0.000008761299,0.00090218714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992345,0.000018187235,0.0001311802,0.00026971407,0.00009274279,0.000253658],"domain_scores_gemma":[0.9992941,0.00006736502,0.000042419197,0.00041391558,0.000098886354,0.0000833302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087998305,0.00009268051,0.00010056965,0.000029328607,0.00006291516,0.00004441859,0.00069766765,0.00007050646,0.00033563163],"category_scores_gemma":[0.000028289036,0.00007690739,0.000042224503,0.00019822689,0.000015519849,0.0002940312,0.00015724792,0.00007441011,0.000072382565],"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.000016942102,0.000043093693,0.00075962173,0.0000147246255,0.0000266615,0.000006665045,0.0009776861,0.00012930756,0.0020262932,0.89870876,0.039729632,0.057560638],"study_design_scores_gemma":[0.0014006998,0.00037866898,0.024909992,0.000016262122,0.00001151703,0.000022232225,0.00003901743,0.82288885,0.05287624,0.052217826,0.044684816,0.0005538606],"about_ca_topic_score_codex":0.0000062513823,"about_ca_topic_score_gemma":0.000010700436,"teacher_disagreement_score":0.86750966,"about_ca_system_score_codex":0.000013857347,"about_ca_system_score_gemma":0.000031689997,"threshold_uncertainty_score":0.3674931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08704901,0.000019634119,0.90877223,0.00013371093,0.0015540534,0.0012372546,0.0000021828946,0.0005198495,0.000712076],"genre_scores_gemma":[0.8408288,0.0000042181478,0.15779579,0.00016463651,0.00033214787,0.00038337128,0.000010306886,0.000031109816,0.00044964868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977906,0.00009027613,0.00034069913,0.0008516344,0.0002911472,0.0006356675],"domain_scores_gemma":[0.9979062,0.00011384716,0.00019022553,0.0012190432,0.00027708837,0.00029360797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513308,0.00028356738,0.00031651524,0.000058839374,0.00024945708,0.0002816466,0.0012109849,0.00018391758,0.000010940671],"category_scores_gemma":[0.000008075964,0.00021143326,0.000068909685,0.0003760513,0.00007529701,0.0006484684,0.00024204628,0.00035859516,0.000013554065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003669376,0.0011297222,0.0023142076,0.00016591811,0.000268909,0.00008479198,0.0022029344,0.01769617,0.0082376925,0.50208646,0.0057301377,0.45971614],"study_design_scores_gemma":[0.0011103533,0.00030550518,0.00102049,0.000069072696,0.000012349179,0.000022652568,0.0001383384,0.993766,0.002159094,0.000020977695,0.0010158733,0.0003592611],"about_ca_topic_score_codex":0.000095583106,"about_ca_topic_score_gemma":0.0007916079,"teacher_disagreement_score":0.97606987,"about_ca_system_score_codex":0.00009383699,"about_ca_system_score_gemma":0.000094373274,"threshold_uncertainty_score":0.86219984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009781795,0.000093622104,0.99702376,0.00015158531,0.0001097073,0.001411179,0.00001078146,0.00012251391,0.00009867126],"genre_scores_gemma":[0.90239996,0.00018538292,0.09491717,0.00017476152,0.0001795977,0.0019485144,0.00008551812,0.00002723954,0.00008187449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889314,0.000025045449,0.00027025695,0.00043866617,0.000091785,0.00028111084],"domain_scores_gemma":[0.99912757,0.00014043259,0.00010143424,0.00041909283,0.000088469744,0.0001230157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018417684,0.0001441869,0.00016663731,0.000055619887,0.00015175095,0.0000963044,0.00044737858,0.00019034048,0.0000112793505],"category_scores_gemma":[0.000017589431,0.00014356509,0.000027336659,0.0004285313,0.00004625408,0.00027291497,0.00013749975,0.00018435124,0.000011492656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012205855,0.0009244411,0.0066814353,0.00004531727,0.00004556078,0.000003515491,0.0037743978,0.003628655,0.00050428236,0.09208859,0.0010997666,0.89119184],"study_design_scores_gemma":[0.0007045459,0.00002834173,0.014553381,0.000015845899,0.000008232938,0.0000027848982,0.00003544752,0.98229057,0.0004836802,0.00054460956,0.00112876,0.00020378109],"about_ca_topic_score_codex":0.000022894617,"about_ca_topic_score_gemma":0.000029209792,"teacher_disagreement_score":0.97866195,"about_ca_system_score_codex":0.000041119376,"about_ca_system_score_gemma":0.000025705749,"threshold_uncertainty_score":0.58544147},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028590806,0.000053748132,0.95542145,0.0003184149,0.00068727136,0.04091895,0.0000063522275,0.00072600244,0.0015818825],"genre_scores_gemma":[0.686438,0.00001269464,0.018575609,0.0009952573,0.0035852918,0.28926802,0.000181743,0.00014061357,0.0008027512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955337,0.00023965444,0.0010318342,0.0012467823,0.0005541923,0.0013938359],"domain_scores_gemma":[0.9967906,0.00046477924,0.00064560026,0.001454206,0.00040146898,0.0002433647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058137265,0.00064214884,0.00066091033,0.00015543643,0.00050224585,0.0005398778,0.0018368042,0.00072667387,0.00003342798],"category_scores_gemma":[0.000017751772,0.00062318984,0.00026384444,0.0012489876,0.00022347063,0.00073409174,0.00044462152,0.00060003594,0.0000027047213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018444791,0.00010740845,0.00040217073,0.000040999774,0.00003985439,0.000026716925,0.000027628872,0.54176617,0.000054997436,0.22769634,0.05736155,0.1722917],"study_design_scores_gemma":[0.002453584,0.0002112165,0.00049738743,0.00014954532,0.0000142454155,0.000038994658,0.0000071181867,0.95368123,0.000117917494,0.0074015474,0.03476121,0.0006660344],"about_ca_topic_score_codex":0.00019142128,"about_ca_topic_score_gemma":0.0003288824,"teacher_disagreement_score":0.93684584,"about_ca_system_score_codex":0.00021746678,"about_ca_system_score_gemma":0.00022333795,"threshold_uncertainty_score":0.9996219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27174655,0.000073317045,0.69271106,0.0006259617,0.0019294664,0.00035028654,2.654456e-7,0.0002091827,0.032353915],"genre_scores_gemma":[0.99120295,0.000033785276,0.006354644,0.000289828,0.00019841596,0.00003609737,7.166627e-7,0.0000125468205,0.0018710262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983623,0.00010553812,0.00026752157,0.0004151857,0.00024810145,0.00060136005],"domain_scores_gemma":[0.9981859,0.00031142248,0.00007676499,0.0012559841,0.000046459765,0.00012351056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009495006,0.00016445266,0.00015540097,0.0000345221,0.00024926022,0.00030777024,0.001867124,0.00015774352,0.000047938353],"category_scores_gemma":[0.000011604433,0.000113006165,0.00006171094,0.00047761438,0.00010496903,0.00031738676,0.0004143384,0.0008476103,0.00007237791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011204722,0.00022216678,0.004684785,0.000010651556,0.000012484485,0.000042433934,0.00043445657,0.0061472678,0.012919378,0.9090896,0.0141103435,0.05231519],"study_design_scores_gemma":[0.00023589683,0.000023819657,0.00067315385,0.0000043146606,0.0000017718778,0.000004215027,0.000012778473,0.9784455,0.0071526384,0.0024064346,0.010838253,0.00020124679],"about_ca_topic_score_codex":0.00022228349,"about_ca_topic_score_gemma":0.0018763045,"teacher_disagreement_score":0.9722982,"about_ca_system_score_codex":0.000023826533,"about_ca_system_score_gemma":0.000044226217,"threshold_uncertainty_score":0.46082574},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012860459,0.3953441,0.6032255,0.000024732184,0.000544735,0.00044101244,0.0000046647947,0.00022344723,0.00019051839],"genre_scores_gemma":[0.0051317886,0.9685564,0.025277091,0.00006554213,0.0005469806,0.000059329323,0.00019002092,0.00010508697,0.000067758214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919986,0.0035564092,0.0015504688,0.0015563137,0.00037844706,0.0009597285],"domain_scores_gemma":[0.9914793,0.0044808807,0.0009749182,0.0026652606,0.00012531507,0.0002743437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007920243,0.0007298769,0.0021847486,0.0003226846,0.00031668216,0.0005255141,0.0035792075,0.0005304839,0.0000019052244],"category_scores_gemma":[0.00034480388,0.00072223984,0.00023790618,0.0013702302,0.00012285242,0.00028592357,0.0026885946,0.0012363838,0.000017346982],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.1576583e-7,0.000030517142,0.00003893531,0.0007920741,0.000034555636,0.000023335639,0.00004172123,0.0019396618,5.93234e-9,0.027582461,0.00018746009,0.9693292],"study_design_scores_gemma":[0.000136629,0.000020778993,0.000107010455,0.0059478083,0.00005881174,0.00006642478,0.000003296796,0.962039,5.3913993e-9,0.0008442942,0.03009003,0.0006859274],"about_ca_topic_score_codex":0.00015247794,"about_ca_topic_score_gemma":0.00007069858,"teacher_disagreement_score":0.96864325,"about_ca_system_score_codex":0.00019600011,"about_ca_system_score_gemma":0.00036370815,"threshold_uncertainty_score":0.99952286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009748956,0.0002741752,0.98106855,0.00023669486,0.002050668,0.00049448095,9.0790905e-7,0.0002062568,0.0059192893],"genre_scores_gemma":[0.85274583,0.0000048180937,0.14484377,0.00067323574,0.0012884869,0.00009122579,0.000003490789,0.000012694804,0.00033643364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985134,0.000051811283,0.0002422123,0.00027489112,0.00013383686,0.0007838561],"domain_scores_gemma":[0.9990937,0.00024884247,0.00006609179,0.00043668415,0.000030874675,0.00012381535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079120224,0.00013135641,0.00016151895,0.000032999167,0.00008449534,0.000070170136,0.0005479382,0.000084976506,0.00001940551],"category_scores_gemma":[0.000033548804,0.00011639218,0.00006103645,0.00034619262,0.000013570077,0.000538331,0.0002683041,0.00015021066,0.000038874783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019534227,0.00024356504,0.27803394,0.000033338358,0.000027329215,0.000007824331,0.0032218448,0.024110034,0.00005237476,0.51797694,0.05605365,0.1202196],"study_design_scores_gemma":[0.0005757848,0.000045655903,0.022074949,0.000038467773,0.0000034395675,0.0000075959424,0.000027366483,0.93099856,0.00010467583,0.0011788018,0.044651218,0.00029347217],"about_ca_topic_score_codex":0.000052107876,"about_ca_topic_score_gemma":0.00017761404,"teacher_disagreement_score":0.90688854,"about_ca_system_score_codex":0.0000475669,"about_ca_system_score_gemma":0.000021635406,"threshold_uncertainty_score":0.47463354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09149217,0.000072652576,0.90716714,0.000023577952,0.00030704893,0.00047224862,0.00002038067,0.000069487316,0.00037532626],"genre_scores_gemma":[0.9483598,0.000010353037,0.051263776,0.000047207308,0.00021557997,0.000024305877,0.000028690862,0.000016318081,0.000033986755],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816966,0.00007073484,0.00042888118,0.0004114509,0.00017840466,0.00074089237],"domain_scores_gemma":[0.99752384,0.00055900175,0.00015993188,0.001541089,0.000056109802,0.0001600106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011237394,0.00017711984,0.00030666823,0.000064756765,0.000044887773,0.000053854805,0.001608555,0.00010722326,0.000017851884],"category_scores_gemma":[0.00009102934,0.00014477376,0.00009032126,0.0003624644,0.000035477664,0.0012057584,0.0010023238,0.0001676024,0.0000043658497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011020531,0.0012867446,0.4765535,0.00007011795,0.0001659509,0.000007943628,0.0019431261,0.034932397,0.0009086851,0.1287519,0.007889105,0.3473803],"study_design_scores_gemma":[0.0006381076,0.000053537,0.035611197,0.000039327806,0.000005131872,0.00000429494,0.00001934269,0.96330607,0.00007993692,0.000028043056,0.00005005024,0.00016495369],"about_ca_topic_score_codex":0.0003693338,"about_ca_topic_score_gemma":0.00017274446,"teacher_disagreement_score":0.9283737,"about_ca_system_score_codex":0.00007811448,"about_ca_system_score_gemma":0.00005513997,"threshold_uncertainty_score":0.59037024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25534368,0.00018812968,0.7396375,0.00007741362,0.00005964584,0.00008166314,4.805953e-7,0.000046679554,0.00456481],"genre_scores_gemma":[0.9915775,0.00006851226,0.008004695,0.000116695366,0.00003560087,0.000008516569,0.0000037702519,0.0000053531608,0.00017935535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988216,0.00005602819,0.000333768,0.0003609341,0.0001698061,0.00025785228],"domain_scores_gemma":[0.99919915,0.00013335058,0.00009129729,0.00049618905,0.000039283263,0.000040746316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002702697,0.000114335155,0.0003254376,0.00019070998,0.000026844742,0.00005216411,0.00041903372,0.000084690924,0.000026248877],"category_scores_gemma":[0.0000027051897,0.000101474776,0.00007364863,0.0018943854,0.00005272839,0.00024322259,0.0002176014,0.0000985591,0.0000013926194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068332765,0.00013629653,0.2849316,0.000008370249,0.00020743672,0.000031433647,0.00013062994,0.20093283,0.000063893945,0.4748787,0.001642733,0.037029218],"study_design_scores_gemma":[0.00015793726,0.000017781658,0.09350167,0.0000067629626,0.000042473486,0.0000018541754,0.0000045038246,0.9054126,0.00006831637,0.0006073261,0.00007237699,0.00010636217],"about_ca_topic_score_codex":0.0011470856,"about_ca_topic_score_gemma":0.00330657,"teacher_disagreement_score":0.73623383,"about_ca_system_score_codex":0.000021733276,"about_ca_system_score_gemma":0.000016117283,"threshold_uncertainty_score":0.41380215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006376434,0.011079866,0.9752572,0.0010002283,0.005400847,0.00044380725,7.874253e-7,0.00012027312,0.00032053865],"genre_scores_gemma":[0.9469012,0.0027672271,0.04258611,0.0014866772,0.0056436565,0.00009026982,0.0000032293729,0.000053413594,0.0004682183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724424,0.0001570751,0.0011753481,0.00041892027,0.0003441853,0.00066025904],"domain_scores_gemma":[0.99690473,0.00060148403,0.0010010379,0.00056970573,0.0006118032,0.00031125883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014244937,0.00032453446,0.00054746756,0.0002722053,0.00020339034,0.00030871967,0.0012671067,0.00030149755,0.00008153217],"category_scores_gemma":[0.00009080137,0.00029000916,0.0005456531,0.000563642,0.00006300392,0.001488759,0.00017607778,0.0008337761,0.000014125792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012083321,0.00016231602,0.000031994907,0.0000052209216,0.00009034976,0.000009595562,0.00017818432,0.55673605,0.000016561542,0.0011771658,0.03366244,0.40780932],"study_design_scores_gemma":[0.0009991459,0.0016560555,0.000043709755,0.00013138368,0.000033858694,0.00041126818,0.000099048266,0.77064323,0.00008759501,0.00033271327,0.22529273,0.0002692646],"about_ca_topic_score_codex":0.0000011305922,"about_ca_topic_score_gemma":0.00005128015,"teacher_disagreement_score":0.94052476,"about_ca_system_score_codex":0.00031473016,"about_ca_system_score_gemma":0.00008254889,"threshold_uncertainty_score":0.9999552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055877507,0.000042210988,0.9247477,0.00020617044,0.000769563,0.00036269618,1.5891621e-7,0.00020037364,0.017793637],"genre_scores_gemma":[0.9866634,0.00000969937,0.0110022435,0.0010878191,0.0001726945,0.000027047772,0.0000017674272,0.00001447945,0.0010208463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764276,0.000061244915,0.00047012808,0.0005858785,0.0004246624,0.0008153504],"domain_scores_gemma":[0.99871063,0.00018521331,0.00008373581,0.0007916335,0.00004852473,0.00018023995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013813607,0.00021187536,0.00022777064,0.00014001525,0.000067334455,0.00012574035,0.00096784113,0.00012697362,0.00012322371],"category_scores_gemma":[0.000005950347,0.00018665484,0.00006897211,0.0007418917,0.00003732595,0.000115341274,0.00050971605,0.00027981066,0.00007761613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054806344,0.0004892436,0.005532829,0.000012254011,0.000033177865,0.00026918302,0.0009111535,0.32246485,0.000099504585,0.54824424,0.013378652,0.1085101],"study_design_scores_gemma":[0.00055628334,0.000055236276,0.003802533,0.000027295764,0.0000022571874,0.000009462621,0.000032733147,0.9938263,0.0002979602,0.00008883294,0.0010475001,0.00025358095],"about_ca_topic_score_codex":0.000056238656,"about_ca_topic_score_gemma":0.00030048084,"teacher_disagreement_score":0.9307859,"about_ca_system_score_codex":0.00017960931,"about_ca_system_score_gemma":0.00003626928,"threshold_uncertainty_score":0.7611564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03055021,0.00035835218,0.9642512,0.000006999657,0.002948598,0.00045145204,0.0000012191996,0.00053388026,0.00089805876],"genre_scores_gemma":[0.79250157,0.00016685216,0.20608753,0.00021256311,0.00088536076,0.000043400672,0.0000044351923,0.00006416805,0.00003412304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961977,0.00023090767,0.0007563392,0.0011126884,0.0006199007,0.0010824696],"domain_scores_gemma":[0.9978002,0.0002245112,0.00039399866,0.0010289601,0.00029681865,0.0002555626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007627373,0.0004921388,0.00050956453,0.00020758541,0.00045099977,0.000295222,0.001549913,0.00041112248,0.000082090344],"category_scores_gemma":[0.000015529607,0.0004913997,0.00020671588,0.001437663,0.0000974076,0.00080987136,0.00075889024,0.0007354181,0.0000473491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032564007,0.00012973207,0.0010954918,0.000009185487,0.000047666454,0.00006471699,0.0005541775,0.019771978,0.00003268909,0.012383506,0.0007734937,0.9651048],"study_design_scores_gemma":[0.00027230108,0.00010814394,0.00085268705,0.0003646334,0.000026057292,0.000102577884,0.000038901562,0.99361247,0.00032342787,0.00346129,0.00027197102,0.00056552596],"about_ca_topic_score_codex":0.00010364433,"about_ca_topic_score_gemma":0.00005874197,"teacher_disagreement_score":0.9738405,"about_ca_system_score_codex":0.00029747174,"about_ca_system_score_gemma":0.000108572014,"threshold_uncertainty_score":0.9997538},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2816601,0.00013714583,0.7168308,0.00006378821,0.00017266441,0.00021749438,0.0000020871191,0.00007385468,0.0008420839],"genre_scores_gemma":[0.9714058,0.000022880635,0.028200477,0.00014000882,0.000068842535,0.000025954643,0.00003135334,0.000013408937,0.0000912403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983391,0.00008352349,0.0004709017,0.00042687455,0.00028572988,0.00039384622],"domain_scores_gemma":[0.9991951,0.00006745127,0.0001539683,0.0004715761,0.000045022356,0.00006686991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017141341,0.00019638248,0.00024737883,0.000080729704,0.000049296577,0.000067056324,0.0006128069,0.00015886214,0.000062550804],"category_scores_gemma":[0.0000012553679,0.0001881242,0.00006469878,0.00035363354,0.000041660285,0.00023904302,0.0002453021,0.00020783533,0.0000031525326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016641252,0.00008304594,0.0014650363,0.0000057601123,0.000011517414,0.000015963504,0.000043445594,0.9756639,0.0006132817,0.008286223,0.009286858,0.004508313],"study_design_scores_gemma":[0.00055023684,0.00011762557,0.0013160306,0.000024733123,0.0000043928876,0.00003037132,0.000007643952,0.99211234,0.005126378,0.00026459983,0.00023833566,0.00020732723],"about_ca_topic_score_codex":0.00013461857,"about_ca_topic_score_gemma":0.00012175715,"teacher_disagreement_score":0.6897457,"about_ca_system_score_codex":0.00011228528,"about_ca_system_score_gemma":0.000028530221,"threshold_uncertainty_score":0.76714826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147472415,0.0002666168,0.9821087,0.00004686828,0.00093510805,0.000111699395,7.865472e-7,0.0004490019,0.001333974],"genre_scores_gemma":[0.6683665,0.0000053513645,0.33049712,0.0005441863,0.00022528038,0.000026038279,0.0000028063157,0.000014237992,0.0003184958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979972,0.00009252034,0.00027999718,0.00046443092,0.00033018063,0.0008356325],"domain_scores_gemma":[0.9984159,0.00011261804,0.00008822268,0.00096287625,0.00006164187,0.00035875666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056900276,0.00020986513,0.00018013733,0.0001277445,0.0001626898,0.00018680842,0.00090942625,0.00010722006,0.000067739966],"category_scores_gemma":[0.00001323714,0.00017848604,0.00010652334,0.0005024503,0.00005152073,0.0006602129,0.00041354878,0.00016509563,0.00008544128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016376567,0.00077918964,0.0060846317,0.0000032698947,0.000034962843,0.0000094266825,0.0007628513,0.004390037,0.00015739858,0.100175925,0.00044589015,0.88715476],"study_design_scores_gemma":[0.00020929833,0.000045099994,0.0033985216,0.000006344443,0.000005497681,0.000020326695,0.000020679354,0.99229753,0.00075839815,0.00010437609,0.0028610846,0.00027282286],"about_ca_topic_score_codex":0.00017956315,"about_ca_topic_score_gemma":0.000015849386,"teacher_disagreement_score":0.9879075,"about_ca_system_score_codex":0.00003289908,"about_ca_system_score_gemma":0.000019992589,"threshold_uncertainty_score":0.7278449},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15827256,0.000024790057,0.838253,0.00032222498,0.000121709694,0.00026197836,1.020872e-7,0.00003659182,0.0027070455],"genre_scores_gemma":[0.9971635,0.0000026627808,0.0025607306,0.00019807971,0.000038465812,0.000025516525,8.149054e-7,0.0000025633537,0.000007663702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989199,0.0000985119,0.00037911197,0.000121651385,0.00014926294,0.00033153573],"domain_scores_gemma":[0.99858457,0.00072818913,0.00013211207,0.00040869138,0.000087110304,0.000059324757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035831786,0.000097773605,0.0001377018,0.000063534826,0.000045674704,0.00009676619,0.00059361156,0.00007355663,0.00016091266],"category_scores_gemma":[0.00011917869,0.000056692854,0.00006294477,0.00046798718,0.00009651693,0.0005514443,0.0003070219,0.0002208408,0.000077188946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031714067,0.000028040065,0.0010158014,0.0000018996558,0.0000051248066,6.302146e-7,0.0002659861,0.8387464,0.0000063779935,0.015033469,0.00087151513,0.14402153],"study_design_scores_gemma":[0.00016622762,0.00007153557,0.025692042,0.000008495294,9.27712e-7,0.00001642017,0.000097581054,0.9734983,0.000027321415,0.00032521057,0.000032919877,0.00006300514],"about_ca_topic_score_codex":0.0015605444,"about_ca_topic_score_gemma":0.000019336874,"teacher_disagreement_score":0.8388909,"about_ca_system_score_codex":0.000075808,"about_ca_system_score_gemma":0.00006223272,"threshold_uncertainty_score":0.23590867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38551453,0.00059034856,0.5769549,0.0001277797,0.0003016899,0.035538748,0.0000033005817,0.00061883254,0.0003498787],"genre_scores_gemma":[0.87672246,0.00004577731,0.09264363,0.00013723243,0.00006741101,0.030327203,0.0000146184875,0.000037333426,0.0000043654127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695194,0.00043838943,0.000812525,0.00080507924,0.0002793178,0.00071274943],"domain_scores_gemma":[0.9944029,0.0007582886,0.0003521766,0.0040259426,0.00019186785,0.00026884102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014980476,0.000359063,0.00042038027,0.00020385817,0.0008064391,0.0004971348,0.0032215577,0.0002216176,0.0000075458643],"category_scores_gemma":[0.000025407182,0.00036588966,0.00008676811,0.00087210245,0.00032304486,0.00029381653,0.0017367073,0.0012740741,0.000006051477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012531791,0.00096033735,0.0027902953,0.000033404955,0.000010217972,0.000007377204,0.0017477699,0.1726059,0.0016295768,0.007657661,0.000011596873,0.8125333],"study_design_scores_gemma":[0.0010400318,0.00017997094,0.001505793,0.00014991847,0.0000054139236,0.00001685505,0.00017017506,0.99000704,0.0001324202,0.000026061974,0.006360289,0.00040601325],"about_ca_topic_score_codex":0.000035917572,"about_ca_topic_score_gemma":0.00025535654,"teacher_disagreement_score":0.8174012,"about_ca_system_score_codex":0.00006724951,"about_ca_system_score_gemma":0.00012586043,"threshold_uncertainty_score":0.9998793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1458928,0.00010701823,0.85123295,0.0003759409,0.00035736855,0.00028588052,2.9266442e-8,0.00016615406,0.0015818961],"genre_scores_gemma":[0.9737326,0.00004490661,0.025249349,0.00057109405,0.0001898729,0.00008234518,5.971552e-7,0.000012865764,0.00011639139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839985,0.00008082168,0.0003080874,0.0004853132,0.00018187072,0.0005440355],"domain_scores_gemma":[0.9991772,0.0001752074,0.00007894415,0.00037314842,0.000048415804,0.00014709092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043836495,0.00016906478,0.00022703479,0.00008554666,0.00009708526,0.0005141999,0.00049246836,0.0001150679,0.000048127684],"category_scores_gemma":[0.000017859587,0.00015892707,0.000030838983,0.0004240332,0.000035997375,0.0010480871,0.00044366153,0.00027115733,0.000027728796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005767919,0.00009547836,0.023945332,0.00003659147,0.000047831265,0.0000637038,0.0012989003,0.26683837,0.0022429568,0.33140767,0.0012452531,0.37277216],"study_design_scores_gemma":[0.00024634562,0.000023356744,0.0032823994,0.000082444276,0.0000014445874,0.0000073550736,0.000035610567,0.994687,0.00015759352,0.0012279691,0.000040151597,0.00020832123],"about_ca_topic_score_codex":0.00016231315,"about_ca_topic_score_gemma":0.00004868562,"teacher_disagreement_score":0.8278398,"about_ca_system_score_codex":0.000032556236,"about_ca_system_score_gemma":0.000030574625,"threshold_uncertainty_score":0.6480858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27871713,0.00027738183,0.6982615,0.00021407082,0.0020345398,0.00053847174,3.863655e-7,0.0004909878,0.019465538],"genre_scores_gemma":[0.98012054,0.000007076021,0.018654676,0.0006078664,0.0003486413,0.000050806215,0.0000020212588,0.000014183892,0.00019420494],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978259,0.00020300083,0.00033861626,0.0004172492,0.00036088866,0.0008543218],"domain_scores_gemma":[0.99858445,0.00008259273,0.00008476434,0.0008984904,0.000073939664,0.00027576677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010187573,0.00020109443,0.0002258302,0.000066207904,0.00006703208,0.0001522697,0.0014242164,0.00009678127,0.0001071104],"category_scores_gemma":[0.00001868872,0.00017967548,0.00003856112,0.0006419817,0.000035328518,0.0015076601,0.00043938923,0.00023485206,0.00014395909],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023749048,0.0006423475,0.68964,0.000016076525,0.00002963584,0.000008923945,0.0015516345,0.0017222137,0.0011005042,0.105236165,0.009270718,0.19075802],"study_design_scores_gemma":[0.0017007317,0.00048092144,0.22047572,0.00029068126,0.00001739906,0.000034609693,0.00010136713,0.7644051,0.0037843406,0.0041665835,0.0029440157,0.0015985456],"about_ca_topic_score_codex":0.000057247882,"about_ca_topic_score_gemma":0.00042534943,"teacher_disagreement_score":0.76268286,"about_ca_system_score_codex":0.0000939515,"about_ca_system_score_gemma":0.000046352245,"threshold_uncertainty_score":0.73269534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003381316,0.000018450877,0.9720722,0.000056293415,0.000029888626,0.024337793,3.163967e-7,0.00005798298,0.000045765715],"genre_scores_gemma":[0.890139,0.0000057449747,0.09491953,0.00013252045,0.00004844796,0.014701219,0.0000043616897,0.00001421595,0.000034977766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984455,0.0004690162,0.0003122419,0.0003972587,0.00017137617,0.0002046095],"domain_scores_gemma":[0.9965025,0.0024634341,0.00031119247,0.000319334,0.00032613488,0.00007739979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017314568,0.00013676511,0.00021843119,0.00017496856,0.0001782025,0.00018339398,0.00014469773,0.000107737134,0.000007474056],"category_scores_gemma":[0.000058119214,0.00012432176,0.000050161205,0.00050290616,0.000050084862,0.0011340512,0.00004011159,0.0001291876,8.094835e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015205423,0.00007781354,0.000008608037,0.000016348831,0.000111910274,1.9011011e-7,0.0005215093,0.9129521,0.00002083158,0.057932794,0.0000033236186,0.028202504],"study_design_scores_gemma":[0.0004406709,0.00016053485,0.00002074245,0.000015149029,0.00019522909,0.0000013576155,0.00007333581,0.9913099,0.000088908266,0.0074758567,0.00008020947,0.00013812602],"about_ca_topic_score_codex":0.000018040273,"about_ca_topic_score_gemma":8.94884e-7,"teacher_disagreement_score":0.8867577,"about_ca_system_score_codex":0.000016788408,"about_ca_system_score_gemma":0.000026165699,"threshold_uncertainty_score":0.50696945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14722154,0.00001461566,0.8505063,0.00006891217,0.0013339524,0.00036442108,4.622743e-7,0.0002454465,0.00024433772],"genre_scores_gemma":[0.916685,0.000001960921,0.082935244,0.00012071826,0.00021947295,0.000027493592,6.2920213e-7,0.000006506487,0.0000029625764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997301,0.00009371717,0.00048451457,0.0008367452,0.00081438624,0.0004696832],"domain_scores_gemma":[0.99809873,0.00011918991,0.00030460092,0.00087220944,0.00043413715,0.00017110826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019332087,0.00018707095,0.00023492139,0.00024338045,0.00028150567,0.0002544361,0.001679065,0.00006586568,0.000004696029],"category_scores_gemma":[0.000023140305,0.00017340212,0.000058172256,0.0017163418,0.00024703794,0.0011721009,0.00086891383,0.00015289194,0.000022420008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007816532,0.00010369987,0.0027863162,0.0001848594,0.0000100023535,0.000001618601,0.0014947985,0.008814645,0.014559428,0.08971943,0.000052219788,0.88226515],"study_design_scores_gemma":[0.00031957868,0.00028865522,0.023308856,0.00003905827,0.0000061508263,0.000042047304,0.00004610791,0.9257332,0.047638353,0.0022661567,0.000100759906,0.00021103828],"about_ca_topic_score_codex":0.00011702275,"about_ca_topic_score_gemma":0.000060959315,"teacher_disagreement_score":0.9169186,"about_ca_system_score_codex":0.0002404947,"about_ca_system_score_gemma":0.00023426051,"threshold_uncertainty_score":0.7071133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056292117,0.00034992755,0.9414923,0.00018441405,0.00066556927,0.0005827958,0.0000023565733,0.00022867978,0.00020183779],"genre_scores_gemma":[0.9958189,0.000023061444,0.0026612822,0.0005723429,0.00070697657,0.000089706744,0.000009081989,0.00003700576,0.00008163452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769485,0.00014076334,0.0003931452,0.00075884274,0.0002746893,0.0007377331],"domain_scores_gemma":[0.99787027,0.0008901474,0.00021850131,0.00065200723,0.000081606035,0.0002874804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007412366,0.00029816182,0.0003929372,0.000060391703,0.0003644969,0.00028075866,0.0005842885,0.00021430975,0.000010192236],"category_scores_gemma":[0.000047285328,0.0002710198,0.00009843744,0.00021789747,0.000052979114,0.00018474723,0.00027239183,0.0002700267,0.0000033659526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066014865,0.00007000808,0.0032267103,0.00004974162,0.000039197694,0.0000095955,0.0002206006,0.41084805,0.00011191751,0.024268607,0.0020835174,0.55900604],"study_design_scores_gemma":[0.0017100963,0.00011286803,0.0033357306,0.00020321843,0.000019725125,0.000011388092,0.000009587842,0.9916156,0.000046159937,0.00022669892,0.0023858806,0.0003230612],"about_ca_topic_score_codex":0.000019712857,"about_ca_topic_score_gemma":0.000017949074,"teacher_disagreement_score":0.9395268,"about_ca_system_score_codex":0.000052675103,"about_ca_system_score_gemma":0.000030071698,"threshold_uncertainty_score":0.9999742},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8599572,0.000036585647,0.13859178,0.00014623355,0.00005879128,0.00018252124,0.0000011853169,0.000018490162,0.0010072198],"genre_scores_gemma":[0.9982301,0.000021775348,0.0015497226,0.000026654625,0.00003858164,0.0000117454665,4.5305015e-7,0.0000030615797,0.00011788017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992521,0.000008651503,0.00022293675,0.0002012706,0.00024270007,0.000072353265],"domain_scores_gemma":[0.9994063,0.00006068804,0.00013526689,0.00020952207,0.00016226534,0.000025970798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017824456,0.000066989014,0.00013841911,0.00007176191,0.000028854305,0.00005731263,0.00044488392,0.000037844504,0.000002724506],"category_scores_gemma":[0.000009637071,0.0000457588,0.000036206344,0.00030853326,0.000028359358,0.0002424853,0.00025500025,0.00004749464,2.4365784e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003878699,0.0000241235,0.004628744,0.000012067526,0.000056464178,2.3766244e-8,0.00035428023,0.98670685,0.000429539,0.005228736,0.000013586853,0.0025416808],"study_design_scores_gemma":[0.000114129776,0.000031432744,0.0005996854,0.000023978448,0.00002846123,7.6415176e-7,0.000033686232,0.998336,0.0006635655,0.0000808765,0.000041295283,0.00004609771],"about_ca_topic_score_codex":0.000046432582,"about_ca_topic_score_gemma":0.000010048545,"teacher_disagreement_score":0.13827293,"about_ca_system_score_codex":0.000018302959,"about_ca_system_score_gemma":0.0000066971597,"threshold_uncertainty_score":0.18659897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09983448,0.005762279,0.8918433,0.0001319523,0.00027216584,0.0016700579,0.000014358687,0.0003311847,0.00014022035],"genre_scores_gemma":[0.9238305,0.0012735537,0.07186652,0.00015433319,0.00017337133,0.002513087,0.00008502389,0.00006263434,0.000040990322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651605,0.00034390864,0.0009650048,0.00101331,0.00025566632,0.0009060613],"domain_scores_gemma":[0.99421895,0.0018277307,0.00045543892,0.0030731235,0.00026200464,0.00016278328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007004532,0.00046705344,0.00065688975,0.00021605028,0.0008432994,0.00038772824,0.0026486167,0.00034968928,0.0000040550863],"category_scores_gemma":[0.000017859442,0.00051444955,0.00016284926,0.0010395498,0.00029347424,0.0004644544,0.002740738,0.0007236397,0.0000016710821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032811404,0.0006388681,0.0006231037,0.000106301944,0.000033801665,0.0000053369354,0.0011510768,0.1409053,0.000074782445,0.0459368,0.00009235843,0.8103995],"study_design_scores_gemma":[0.00070136006,0.00019006895,0.0007546543,0.00054683106,0.0000123324035,0.000018780776,0.00037756565,0.9888602,0.000090700545,0.0028783737,0.0050246604,0.00054446794],"about_ca_topic_score_codex":0.00030064923,"about_ca_topic_score_gemma":0.0009786243,"teacher_disagreement_score":0.84795487,"about_ca_system_score_codex":0.00023518672,"about_ca_system_score_gemma":0.000118639626,"threshold_uncertainty_score":0.9997307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040038354,0.0009330665,0.99035555,0.0018956698,0.0012811009,0.0008556245,2.9151664e-7,0.00025744212,0.00041740207],"genre_scores_gemma":[0.97156143,0.0009527146,0.024099221,0.0017360904,0.0014488286,0.00007712302,0.0000074028535,0.000029339704,0.000087849985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964936,0.00032237568,0.0007607551,0.00093518273,0.00038200538,0.0011061108],"domain_scores_gemma":[0.9973372,0.00032463044,0.00025101993,0.0017439188,0.000084062776,0.00025911778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011299553,0.00043264363,0.00045484988,0.00009182099,0.00039770274,0.0007860791,0.0020449401,0.00023922833,0.000004616117],"category_scores_gemma":[0.000007979839,0.00033698863,0.000100052326,0.00061287096,0.00013203258,0.00034841357,0.001427144,0.0008066111,0.0000071768695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035689918,0.00009797823,0.0004181761,0.000005497036,0.000025445475,0.000075859556,0.0003535804,0.36386725,0.0000035065686,0.022774693,0.018227244,0.5941151],"study_design_scores_gemma":[0.000817737,0.0003072933,0.00637115,0.00014982474,0.0000069116372,0.00004031049,0.0000050130425,0.98757714,0.0000078884395,0.0021357448,0.0021813214,0.000399666],"about_ca_topic_score_codex":0.000040720075,"about_ca_topic_score_gemma":0.00013538271,"teacher_disagreement_score":0.9675576,"about_ca_system_score_codex":0.00012052282,"about_ca_system_score_gemma":0.00005271107,"threshold_uncertainty_score":0.9999082},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6053859,0.000008348168,0.39239392,0.00024531575,0.00033252593,0.00011711975,0.000001566001,0.000054143682,0.0014611688],"genre_scores_gemma":[0.95398283,0.0000052306077,0.045355327,0.000058171103,0.000047209465,0.000005785182,0.000004485378,0.000006130356,0.00053482386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914,0.00003764675,0.00027427773,0.00021042753,0.00017717891,0.00016042158],"domain_scores_gemma":[0.9988578,0.0001477826,0.00017128166,0.000675859,0.00008875806,0.000058522804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032996185,0.000087056564,0.00016878096,0.00004064479,0.000030431644,0.000018899831,0.0005662929,0.000082540595,0.00011994373],"category_scores_gemma":[0.000024206349,0.00007497225,0.000043546326,0.00022734764,0.00007902475,0.00023416712,0.00025601804,0.000116981384,0.000036435897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032367803,0.00018549424,0.0062423702,0.00014215118,0.000043578115,0.000014052978,0.0009252724,0.02329487,0.098129205,0.34422168,0.006719052,0.5200499],"study_design_scores_gemma":[0.00021182277,0.000050597886,0.0041878805,0.000012741394,0.0000035840922,0.0000064204924,0.0000021270769,0.8765655,0.11561142,0.0028124626,0.00044190363,0.00009351916],"about_ca_topic_score_codex":0.00004477432,"about_ca_topic_score_gemma":0.00012093785,"teacher_disagreement_score":0.85327065,"about_ca_system_score_codex":0.000010034146,"about_ca_system_score_gemma":0.000036003345,"threshold_uncertainty_score":0.30572796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038783792,0.0026913662,0.9563576,0.0013946891,0.0006180691,0.0003316317,2.694852e-7,0.00032809694,0.034399897],"genre_scores_gemma":[0.8988173,0.0002545031,0.09901104,0.00093995134,0.00019641795,0.00006394438,0.0000050076646,0.000014648464,0.0006971637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828905,0.00020516466,0.0003792126,0.0002775369,0.00018766685,0.00066139875],"domain_scores_gemma":[0.9968434,0.00044514218,0.00009710729,0.0023815723,0.000051056373,0.00018170418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096039445,0.00015367185,0.00018982851,0.00011429803,0.0001524486,0.00012645542,0.0016715933,0.00013508697,0.00006607828],"category_scores_gemma":[0.00004576877,0.0001463239,0.000060969156,0.0008623715,0.00006304442,0.0010068949,0.0012445861,0.00047506866,0.00011667713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068545805,0.0004339285,0.018042462,0.000009109528,0.000031206127,0.000011304896,0.0021978917,0.026010718,0.00006950764,0.7536377,0.011505386,0.18804398],"study_design_scores_gemma":[0.00029623802,0.00001915222,0.006243637,0.00003396734,0.00000446768,0.000019189805,0.00006243103,0.96520436,0.00005775625,0.0010500761,0.026753906,0.00025481687],"about_ca_topic_score_codex":0.000121483,"about_ca_topic_score_gemma":0.00021838084,"teacher_disagreement_score":0.93919367,"about_ca_system_score_codex":0.00009141782,"about_ca_system_score_gemma":0.000035268713,"threshold_uncertainty_score":0.59669155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07944234,0.004837599,0.9072176,0.00050546916,0.0016016477,0.0007671004,0.0000010661587,0.00061866693,0.0050085117],"genre_scores_gemma":[0.9916074,0.0007358443,0.0050670435,0.0007705844,0.0013263702,0.00012838317,0.00003320535,0.00007534257,0.00025579115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953171,0.00017594422,0.00096800935,0.0012440591,0.00047164797,0.0018232166],"domain_scores_gemma":[0.99744093,0.00030985795,0.00034735995,0.0015387308,0.00010067545,0.00026245232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010449814,0.00056489964,0.0006301751,0.00030094353,0.00031286824,0.00046829353,0.0020512044,0.0005230593,0.000024830842],"category_scores_gemma":[0.000008374765,0.0006054668,0.0002571721,0.002424102,0.0001417809,0.0008729638,0.0006994257,0.001207977,0.000057282963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021150257,0.00017836325,0.041746747,0.000009860481,0.000028437742,0.00020047705,0.00010292619,0.7498703,0.000011533552,0.020997226,0.005761003,0.18107195],"study_design_scores_gemma":[0.0008269929,0.00007114203,0.02760139,0.00015596037,0.00001196468,0.000026739577,0.0000111493355,0.9664136,0.00001412785,0.0008832788,0.0033147507,0.0006688607],"about_ca_topic_score_codex":0.00028782804,"about_ca_topic_score_gemma":0.0027988055,"teacher_disagreement_score":0.9121651,"about_ca_system_score_codex":0.00016282749,"about_ca_system_score_gemma":0.00007125792,"threshold_uncertainty_score":0.9996397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026873916,0.000037691858,0.8944185,0.00014666475,0.00021938334,0.0936914,9.698629e-7,0.00035577995,0.008442267],"genre_scores_gemma":[0.20337223,0.000009889903,0.47278494,0.000605592,0.0006008328,0.32141688,0.0000026588243,0.00006274554,0.001144222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979966,0.00008214858,0.0003654507,0.0006761163,0.00020654588,0.00067313615],"domain_scores_gemma":[0.9984497,0.0001881375,0.0002003772,0.0008679346,0.00012718193,0.00016670156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046960716,0.00023582127,0.00025793613,0.000040596216,0.0002960423,0.0002089715,0.0015104247,0.000070993156,0.00006032864],"category_scores_gemma":[0.000034327593,0.00019731975,0.000069411224,0.00025879007,0.00005301805,0.0008117753,0.0019780307,0.0001686572,0.0000113807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004486625,0.000520034,0.019803055,0.00042741973,0.00023467129,0.000098828095,0.007136045,0.00019673117,0.00022791339,0.35857245,0.07370143,0.53863275],"study_design_scores_gemma":[0.0023733797,0.0004883739,0.0037853306,0.00042277455,0.00001589455,0.000021681582,0.000042219384,0.8925787,0.007351383,0.03516661,0.056905553,0.00084807473],"about_ca_topic_score_codex":0.000016593307,"about_ca_topic_score_gemma":0.000023295168,"teacher_disagreement_score":0.89238197,"about_ca_system_score_codex":0.00003967341,"about_ca_system_score_gemma":0.00005450986,"threshold_uncertainty_score":0.8046466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1853365,0.02895784,0.76716286,0.0027474167,0.004946829,0.0012724214,0.000011355864,0.00053267676,0.009032119],"genre_scores_gemma":[0.6682424,0.013418568,0.27627096,0.0023689999,0.0011481266,0.00037904704,0.00004007606,0.00008114026,0.03805065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628013,0.00041948483,0.000642435,0.0010253051,0.0007683874,0.000864266],"domain_scores_gemma":[0.9974816,0.00024825404,0.00023324549,0.0013341557,0.0003633339,0.00033940337],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007428246,0.0004356629,0.00038793293,0.00009828865,0.0006030028,0.00025131504,0.0015609234,0.00031617875,0.001361163],"category_scores_gemma":[0.00002021716,0.00044126416,0.00020294842,0.00090948597,0.00028557007,0.0014996597,0.00067299575,0.00036026727,0.0019971672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024115663,0.0013779922,0.010096273,0.00014570839,0.00012812737,0.00039825894,0.03393287,0.052959766,0.0006128104,0.012540225,0.008760045,0.8790238],"study_design_scores_gemma":[0.0010362541,0.00030604197,0.024399811,0.00008580796,0.00003729873,0.0002510631,0.00026545962,0.8767592,0.0014259714,0.00048572564,0.094435014,0.0005123734],"about_ca_topic_score_codex":0.0009468805,"about_ca_topic_score_gemma":0.0020632707,"teacher_disagreement_score":0.8785114,"about_ca_system_score_codex":0.00020249544,"about_ca_system_score_gemma":0.00028771602,"threshold_uncertainty_score":0.9998039},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14968792,0.00008336551,0.8493928,0.00020558303,0.00017337354,0.00016280971,6.749964e-7,0.00025294913,0.00004058362],"genre_scores_gemma":[0.96529967,0.00011482287,0.034367263,0.00008300894,0.00001456522,0.000059455313,5.2800453e-7,0.000013334216,0.000047358386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847895,0.0001137624,0.00033249622,0.0005161587,0.00020158348,0.00035704777],"domain_scores_gemma":[0.99852,0.00022852083,0.00010969444,0.00096291804,0.0000984045,0.00008044678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004424069,0.00018996243,0.0004123591,0.0007374104,0.00017785755,0.000051144998,0.00063011836,0.000395994,0.000028287426],"category_scores_gemma":[0.000009080506,0.00018160038,0.00013311292,0.0023696427,0.00031592263,0.00022887139,0.000009030563,0.00049970666,0.000008553106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002202445,0.00008960388,0.0006487307,0.000006481676,0.00034160513,0.0000046659197,0.000022648472,0.88388735,0.00048064342,0.0032501523,0.000012040206,0.111234084],"study_design_scores_gemma":[0.00029463982,0.00035206214,0.0016794215,0.000011533215,0.00023116518,0.000029690988,0.0000021735061,0.98001844,0.016762873,0.00016647195,0.00028041255,0.00017114915],"about_ca_topic_score_codex":0.000006328892,"about_ca_topic_score_gemma":0.000006004964,"teacher_disagreement_score":0.8156117,"about_ca_system_score_codex":0.00004009484,"about_ca_system_score_gemma":0.000023985787,"threshold_uncertainty_score":0.7405448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38529772,0.00015414348,0.6080845,0.00060810294,0.00017957547,0.000167232,1.5829123e-7,0.0000730371,0.005435498],"genre_scores_gemma":[0.9681569,0.000021487014,0.031245777,0.00023577893,0.00013553943,9.356572e-7,4.2966738e-7,0.000005291323,0.000197902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990952,0.000038469672,0.00024033872,0.00023157267,0.00010319799,0.00029122774],"domain_scores_gemma":[0.9993334,0.00019664581,0.00006233776,0.0003090871,0.00003383483,0.00006471752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081109,0.00008783233,0.00016143615,0.00005004605,0.000023219907,0.00003713015,0.00035036402,0.00007256394,0.000014276529],"category_scores_gemma":[0.0000075906723,0.00007656967,0.000020368592,0.00047030166,0.00004523226,0.00018228064,0.00020100376,0.00012242295,0.0000056913805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048677313,0.000094390256,0.124869674,0.00005972419,0.000031472424,0.00013702644,0.00083983416,0.014538833,0.004131804,0.479704,0.004619785,0.3709248],"study_design_scores_gemma":[0.0013206729,0.00013135969,0.21331026,0.00016274313,0.0000058577084,0.00002283462,0.00006490105,0.7618982,0.008041685,0.011331779,0.0032130664,0.0004966283],"about_ca_topic_score_codex":0.000054715074,"about_ca_topic_score_gemma":0.0005396367,"teacher_disagreement_score":0.7473594,"about_ca_system_score_codex":0.00001128386,"about_ca_system_score_gemma":0.000017701432,"threshold_uncertainty_score":0.31224203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018787999,0.00060873496,0.9778499,0.00021520142,0.000959197,0.0010514298,0.0000044704784,0.00017229197,0.00035078684],"genre_scores_gemma":[0.9970962,0.0006538053,0.0009770489,0.00054442155,0.00024056187,0.00027477782,0.000011182724,0.000078572935,0.00012346578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508077,0.0007875889,0.0009363507,0.0012365622,0.0005790424,0.0013796937],"domain_scores_gemma":[0.99522686,0.0015057732,0.00055720797,0.0022368894,0.00014333188,0.0003299559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017025359,0.00076460495,0.00087698037,0.00022560796,0.00021566806,0.00019867577,0.002856814,0.00045623057,0.000021008307],"category_scores_gemma":[0.00006592002,0.00054341095,0.0004019493,0.0009824203,0.0002062135,0.0004654849,0.00069550384,0.0014476936,0.000025395686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001265399,0.00054152816,0.000057790632,0.00000672633,0.00007825984,0.000013009735,0.0006773788,0.95958966,0.000007372422,0.014464455,0.0016129456,0.022824336],"study_design_scores_gemma":[0.0015488552,0.0010437411,0.0013681593,0.000548139,0.000012094532,0.0000069316015,0.00003356564,0.99234366,0.000038696675,0.0024881712,0.000010952954,0.0005570201],"about_ca_topic_score_codex":0.00012783344,"about_ca_topic_score_gemma":0.00021034907,"teacher_disagreement_score":0.97830814,"about_ca_system_score_codex":0.00038220972,"about_ca_system_score_gemma":0.000081497055,"threshold_uncertainty_score":0.99970174},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6472164,0.00009037676,0.34515682,0.0004893155,0.00022267025,0.0009880216,0.0000064205306,0.00018263588,0.005647368],"genre_scores_gemma":[0.9917034,0.0000029056735,0.0077082897,0.00036341083,0.00015329826,0.000047048805,0.0000011761963,0.00001301591,0.0000074735844],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984509,0.0000043164887,0.0002868041,0.00045883656,0.00037876997,0.00042042547],"domain_scores_gemma":[0.9990083,0.00010296546,0.0001610385,0.00016092861,0.00033316226,0.00023362004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911434,0.00017680519,0.0002544685,0.00019384427,0.00007634757,0.00026671705,0.0008280885,0.00008770004,0.0000011182669],"category_scores_gemma":[0.000070024835,0.0001696968,0.00003646856,0.0011342438,0.000019587349,0.00052467175,0.0001923372,0.0001577942,0.0000024010592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021749975,0.0023977652,0.6077334,0.0025523629,0.00024314354,0.000046202927,0.0040036025,0.014780741,0.029825168,0.067157336,0.004509609,0.26457563],"study_design_scores_gemma":[0.004281844,0.0005108304,0.16084,0.00034041234,0.000050160535,0.000025623185,0.00022180252,0.7913594,0.039767515,0.00035059333,0.0015393592,0.0007124348],"about_ca_topic_score_codex":0.00002942262,"about_ca_topic_score_gemma":0.0000010113852,"teacher_disagreement_score":0.77657866,"about_ca_system_score_codex":0.00007396492,"about_ca_system_score_gemma":0.000025719759,"threshold_uncertainty_score":0.6920035},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023801449,0.0000071864642,0.86081743,0.00017296689,0.00032754938,0.13727033,0.0000012526534,0.00026268366,0.0011167689],"genre_scores_gemma":[0.2961136,7.105752e-7,0.08089364,0.0011036636,0.00097646203,0.61985177,0.000002480245,0.000032779357,0.0010248694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805313,0.00017526413,0.00032914805,0.00041607954,0.00020436314,0.00082203804],"domain_scores_gemma":[0.99805796,0.00057775807,0.0001696602,0.0005946232,0.00014907196,0.00045095102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086512236,0.00024429275,0.00028569906,0.000045812154,0.00014973963,0.00010096028,0.00073988596,0.00016212102,0.00010238159],"category_scores_gemma":[0.00004505789,0.00018486986,0.00011860423,0.00024086024,0.000039777526,0.0007965575,0.00018575996,0.00019214125,0.0000454828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011970316,0.0010175061,0.0021472878,0.00007650936,0.00017621861,0.000011229347,0.0009997577,0.005505856,0.0007824616,0.2712389,0.12545499,0.5913923],"study_design_scores_gemma":[0.0030186053,0.00019861136,0.00048552026,0.000040917457,0.0000074874993,0.0000039679717,0.000009323487,0.9802131,0.00060927164,0.00026469125,0.014886191,0.0002622832],"about_ca_topic_score_codex":0.000010199221,"about_ca_topic_score_gemma":0.0000067560613,"teacher_disagreement_score":0.97470725,"about_ca_system_score_codex":0.000055299686,"about_ca_system_score_gemma":0.00007802384,"threshold_uncertainty_score":0.7538774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3465065,0.00027849057,0.64974815,0.00019129796,0.00030490628,0.0001199519,4.7953085e-7,0.00011330097,0.0027369105],"genre_scores_gemma":[0.98422486,0.000029061775,0.015167892,0.0003764948,0.00016338713,0.00001406669,0.000001093168,0.0000073867623,0.000015774951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839044,0.000121072444,0.00025503596,0.00037789115,0.00018899202,0.00066656596],"domain_scores_gemma":[0.99925923,0.00008673106,0.000078673824,0.00034313518,0.000028933613,0.00020329503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010117064,0.00017003885,0.0002446894,0.000023483912,0.00008736663,0.000158935,0.00033200212,0.00012343287,0.0000103839375],"category_scores_gemma":[0.000036783018,0.00015879956,0.000036164256,0.00041151262,0.00004261526,0.0007926297,0.00057346944,0.00023575297,0.000005521862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067262004,0.00014784127,0.21702263,0.000012099542,0.000021588061,0.000007974113,0.00031998832,0.0029889029,0.00014830011,0.54926467,0.0008397667,0.2292195],"study_design_scores_gemma":[0.00030857645,0.000020581007,0.03473523,0.00003031513,0.0000027635867,0.000021556758,0.00003637477,0.9637438,0.00025706826,0.0005610491,0.000059344482,0.0002233421],"about_ca_topic_score_codex":0.00035674297,"about_ca_topic_score_gemma":0.0001367133,"teacher_disagreement_score":0.9607549,"about_ca_system_score_codex":0.00012932684,"about_ca_system_score_gemma":0.0000327023,"threshold_uncertainty_score":0.64756584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08149952,0.0000073041533,0.89611334,0.0006145007,0.00007895029,0.0023121275,3.691473e-7,0.0002185594,0.01915536],"genre_scores_gemma":[0.94926697,0.000015680438,0.047352128,0.0011143375,0.00008170792,0.0016892257,0.0000018809044,0.000004960005,0.00047310328],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928874,0.00005201616,0.00013036927,0.00016857797,0.00015175217,0.00020852638],"domain_scores_gemma":[0.99962485,0.000022808304,0.000043884378,0.00023145143,0.00002670753,0.000050287403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030360924,0.00006769514,0.000061172745,0.000028233215,0.00012325072,0.00006049475,0.0003684768,0.000022194023,0.00019694604],"category_scores_gemma":[0.0000025502543,0.000057140966,0.00002473415,0.00015039905,0.000017958313,0.0006694728,0.00012299845,0.00006256921,0.000070777234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018522762,0.00022691756,0.44922417,0.00003956681,0.00003249308,0.000096996104,0.01087756,0.0054948335,0.0007135953,0.30539492,0.068096325,0.1597841],"study_design_scores_gemma":[0.0013364474,0.00041329322,0.20774817,0.000015177346,0.0000033784643,0.00021562699,0.00016555488,0.68445295,0.011065071,0.001648365,0.09250517,0.0004307798],"about_ca_topic_score_codex":0.00010171865,"about_ca_topic_score_gemma":0.00008740365,"teacher_disagreement_score":0.86776745,"about_ca_system_score_codex":0.000033566008,"about_ca_system_score_gemma":0.00008607606,"threshold_uncertainty_score":0.23301409},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5745819,0.000090020076,0.42077765,0.00051320874,0.00016858723,0.00010741119,6.141772e-8,0.00012675021,0.0036343918],"genre_scores_gemma":[0.9311568,0.00007221951,0.068053484,0.00030705953,0.00015725238,0.000007501775,3.3719868e-7,0.0000069639123,0.00023839207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897504,0.0000383454,0.00021057179,0.00033878983,0.00014725597,0.00028999688],"domain_scores_gemma":[0.9994311,0.00010164954,0.00004295081,0.00031934358,0.000025820505,0.000079149606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002585303,0.00010092231,0.0001505305,0.0000580637,0.00009279683,0.000059107933,0.00034562618,0.00006719145,0.000013977891],"category_scores_gemma":[0.000016935908,0.00009515467,0.000020830594,0.0003395696,0.000040304843,0.0003443431,0.00030798226,0.0001924867,0.000024913608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001278318,0.00014581557,0.12226121,0.000040870626,0.000030228794,0.0005827243,0.004666875,0.0072147655,0.0029037297,0.5126564,0.0008959653,0.34858865],"study_design_scores_gemma":[0.0003553421,0.000025857533,0.01006394,0.000037359074,8.50062e-7,0.00006675229,0.000022229355,0.9881644,0.0006367424,0.00032864918,0.00013281794,0.00016503227],"about_ca_topic_score_codex":0.000069734175,"about_ca_topic_score_gemma":0.000042730382,"teacher_disagreement_score":0.98094964,"about_ca_system_score_codex":0.000023403956,"about_ca_system_score_gemma":0.000037208363,"threshold_uncertainty_score":0.38802946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004530193,0.00070936437,0.99634254,0.00097212783,0.00021529362,0.00042305878,2.7575098e-7,0.00015060448,0.001141418],"genre_scores_gemma":[0.063464455,0.000114828435,0.93328136,0.0019681356,0.00023071913,0.000034336023,0.000009754413,0.000008164706,0.0008882709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889505,0.000023516859,0.00027573944,0.00027241363,0.00014830103,0.00038496245],"domain_scores_gemma":[0.9993534,0.00006775014,0.00005789833,0.0003641086,0.00003855579,0.00011828563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021270441,0.00012238497,0.00015441437,0.00007174283,0.000042138952,0.00010609063,0.00048251663,0.000100952995,0.00002207126],"category_scores_gemma":[0.0000045239804,0.00011336804,0.000056209148,0.00043740385,0.000009480603,0.0008028621,0.000066758344,0.00012368782,0.0000241628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004190176,0.0000206171,0.0000010496832,0.0000010860689,0.0000013749865,0.000003717076,0.000075547854,0.010785726,0.0000033824883,0.007895039,0.0146627175,0.9665455],"study_design_scores_gemma":[0.0007185548,0.00019888509,0.0002053911,0.00001725543,0.0000015922851,0.000015355912,0.000010566834,0.9813435,0.000102423335,0.0062958603,0.010947107,0.00014349344],"about_ca_topic_score_codex":0.000009494403,"about_ca_topic_score_gemma":0.0000991194,"teacher_disagreement_score":0.9705578,"about_ca_system_score_codex":0.00007614431,"about_ca_system_score_gemma":0.000035632587,"threshold_uncertainty_score":0.46230146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18097271,0.000036693473,0.8176785,0.00023058604,0.00025724838,0.00035518612,8.5436164e-7,0.00011908916,0.00034914046],"genre_scores_gemma":[0.86310554,0.0000022159888,0.13579573,0.00037546622,0.0001437767,0.00013944837,0.0000042712927,0.000012730552,0.00042084546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987649,0.00004241164,0.00028875645,0.0004207463,0.00012216816,0.0003610262],"domain_scores_gemma":[0.9989964,0.00029149526,0.000065367494,0.0005167756,0.000081843405,0.00004815508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027393093,0.00012968041,0.00013866508,0.00005445397,0.000068885995,0.000239986,0.00054359675,0.0001275707,0.000026175887],"category_scores_gemma":[0.000024427036,0.00012246944,0.000053852145,0.000272155,0.000034248827,0.00026767852,0.00011260942,0.000112401896,0.000047009653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003510126,0.0002976505,0.008244614,0.000029126253,0.000012561472,0.000029396511,0.00017675036,0.19004874,0.0020206193,0.7194315,0.0005494643,0.07912447],"study_design_scores_gemma":[0.0004180246,0.000050425064,0.006564798,0.000020155167,0.0000016091268,0.000006141151,0.0000020592015,0.9592866,0.0091704,0.023284152,0.0009968394,0.0001988137],"about_ca_topic_score_codex":0.00013160051,"about_ca_topic_score_gemma":0.00028445685,"teacher_disagreement_score":0.7692378,"about_ca_system_score_codex":0.000055054,"about_ca_system_score_gemma":0.00002690208,"threshold_uncertainty_score":0.49941587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014159574,0.0000029181854,0.96848786,0.00009882462,0.00013620008,0.004029399,7.143388e-8,0.00024300456,0.012842161],"genre_scores_gemma":[0.98680973,0.0000020313996,0.009389463,0.00031802704,0.00013464058,0.00311318,0.0000018863188,0.000012424363,0.0002186168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821854,0.00012547296,0.0004660252,0.00043145704,0.00024056941,0.00051795633],"domain_scores_gemma":[0.99880385,0.00016398734,0.00014778177,0.000717369,0.000042440926,0.0001245693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009045269,0.00016928374,0.00029217685,0.00006502734,0.00009635477,0.00018592532,0.0010596757,0.00008359049,0.000021492706],"category_scores_gemma":[0.000024105162,0.0001537597,0.00003503556,0.00047693137,0.000037029327,0.000397188,0.00033536807,0.00028612497,0.00004223637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133781505,0.00014964784,0.099356666,0.000042334712,0.0000057060797,0.00000837321,0.00022173517,0.038227003,0.000030842966,0.27788246,0.0012332684,0.5828286],"study_design_scores_gemma":[0.00036685914,0.00010932216,0.006401593,0.000133558,0.0000010431912,0.000005539588,0.000007229577,0.99090576,0.00005449503,0.00015170361,0.0016594988,0.0002033669],"about_ca_topic_score_codex":0.00002598468,"about_ca_topic_score_gemma":0.000056122608,"teacher_disagreement_score":0.9726502,"about_ca_system_score_codex":0.000055355107,"about_ca_system_score_gemma":0.000048683953,"threshold_uncertainty_score":0.6270138},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19022958,0.000037148802,0.7572408,0.000095975716,0.00025760115,0.00013451712,4.5384287e-8,0.0001443972,0.051859945],"genre_scores_gemma":[0.9824017,0.000007103989,0.017184295,0.00015800013,0.000020504955,0.000008295553,6.342728e-8,0.0000029080813,0.0002171243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.000030648614,0.00010144036,0.00023317455,0.000071067254,0.00014458483],"domain_scores_gemma":[0.9996079,0.000037585294,0.000018143166,0.00027310447,0.00001021717,0.000053057072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015723136,0.00005280661,0.000060333554,0.00004045781,0.00002171149,0.000030367435,0.00016206881,0.00004981783,0.00006617666],"category_scores_gemma":[0.000012210955,0.000046220957,0.000009522853,0.0001343373,0.00001896772,0.00026921052,0.00012088394,0.00009954064,0.000038739217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040694937,0.0001724015,0.024937255,0.000014582501,0.0000131329525,0.00021647876,0.0017971395,0.000033319688,0.00093922636,0.13318944,0.0012261253,0.8374202],"study_design_scores_gemma":[0.00091111765,0.0004521042,0.36452153,0.000024776502,0.0000057328216,0.00038207922,0.000044484124,0.5878308,0.023225958,0.01595659,0.0061352956,0.00050957286],"about_ca_topic_score_codex":0.000102661004,"about_ca_topic_score_gemma":0.00028426762,"teacher_disagreement_score":0.83691067,"about_ca_system_score_codex":0.000013666352,"about_ca_system_score_gemma":0.000006230071,"threshold_uncertainty_score":0.1884836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008073495,0.00056444877,0.99567336,0.000079357764,0.00066612894,0.0005548637,8.006475e-7,0.00040988516,0.0012437914],"genre_scores_gemma":[0.088325374,0.000037535527,0.9095964,0.0008046175,0.00014814927,0.00018856386,0.0000024294309,0.000030952386,0.0008659926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835014,0.000019658006,0.00029957958,0.0005815728,0.00016202494,0.0005870446],"domain_scores_gemma":[0.9986672,0.0000801091,0.00009427965,0.0008776051,0.000112547226,0.00016826924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034761915,0.00021412253,0.00021973091,0.000055127217,0.00013325113,0.00010828167,0.0011457361,0.0001492298,0.000052514708],"category_scores_gemma":[0.000022521563,0.0001946975,0.00013632339,0.00026897687,0.000037107253,0.00044915074,0.0006027268,0.00017737506,0.000039273735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025706575,0.0019360854,0.0013543799,0.00020777722,0.0004907142,0.00010885207,0.0051095644,0.08009062,0.00979783,0.124872565,0.01565594,0.7601186],"study_design_scores_gemma":[0.0008944459,0.00009565246,0.00042916046,0.0000260999,0.000005849508,0.00001668135,0.00001552288,0.98777604,0.00031263498,0.00010359557,0.010050289,0.0002740484],"about_ca_topic_score_codex":0.00001853258,"about_ca_topic_score_gemma":0.00011146595,"teacher_disagreement_score":0.9076854,"about_ca_system_score_codex":0.00003925908,"about_ca_system_score_gemma":0.000032312906,"threshold_uncertainty_score":0.79395336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056745917,0.0031648541,0.93696266,0.000709119,0.00030905483,0.0018737497,0.0000016052535,0.00017422253,0.00005882565],"genre_scores_gemma":[0.943603,0.00032167367,0.054159954,0.0006738081,0.0002660581,0.0008611578,0.000038597867,0.00004705063,0.00002869461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997099,0.00021256624,0.00062153937,0.0009188055,0.00031654563,0.0008315428],"domain_scores_gemma":[0.99828595,0.00047560417,0.00020966498,0.000568566,0.00017451553,0.00028569976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006228882,0.0003978549,0.0004803718,0.00012304528,0.0002789088,0.00040510547,0.00059174123,0.00038404687,0.000028981285],"category_scores_gemma":[0.000015758542,0.0003834569,0.000102412436,0.00062883896,0.00009187126,0.00073199143,0.00013983126,0.00042334408,0.0000052528903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003970867,0.000075108925,0.0009704355,0.000020260037,0.000018730087,0.0000047283133,0.0001685159,0.78321004,0.0002411895,0.0013602453,0.0002682644,0.21362275],"study_design_scores_gemma":[0.0019280154,0.00014125521,0.002902989,0.00033840502,0.0000111801255,0.00000384292,0.00003206731,0.9929545,0.000109844885,0.00036301315,0.0007599581,0.00045492893],"about_ca_topic_score_codex":0.000024131503,"about_ca_topic_score_gemma":0.000059867365,"teacher_disagreement_score":0.8868571,"about_ca_system_score_codex":0.00017251603,"about_ca_system_score_gemma":0.00010414666,"threshold_uncertainty_score":0.9998617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011414062,0.0016655533,0.9914793,0.0005044887,0.00067126413,0.000373406,8.6401263e-7,0.0003245489,0.003839215],"genre_scores_gemma":[0.4451304,0.000078163,0.53962094,0.0029109342,0.0018272797,0.0003049785,0.000018262896,0.000039686343,0.010069377],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878824,0.000023143664,0.0002141167,0.00040386058,0.00014227895,0.00042836907],"domain_scores_gemma":[0.99909884,0.00009215462,0.00005571746,0.0005979982,0.00007584859,0.00007946486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001850403,0.00013747944,0.00014005974,0.000034725694,0.00012724809,0.00019679258,0.00071270496,0.00009334484,0.00005206944],"category_scores_gemma":[0.0000057540424,0.00011985779,0.00008546904,0.0002538726,0.000022124535,0.00025329503,0.00015882154,0.00008736501,0.000039729428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097622205,0.00009365926,0.00028061477,0.0000074437157,0.000015239764,0.000010260379,0.000025551093,0.11110415,0.00018515122,0.29970115,0.4013306,0.18723643],"study_design_scores_gemma":[0.00029527742,0.00005505985,0.00018616316,0.000004182295,0.00000298486,0.000004859418,0.0000011411134,0.8196061,0.00025171845,0.002410167,0.17701629,0.00016602626],"about_ca_topic_score_codex":0.000011880289,"about_ca_topic_score_gemma":0.000119962795,"teacher_disagreement_score":0.708502,"about_ca_system_score_codex":0.000034250937,"about_ca_system_score_gemma":0.000039589813,"threshold_uncertainty_score":0.4887659},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1637193,0.0012657241,0.74515414,0.00006647255,0.00010420856,0.08919686,0.000006765493,0.00017503796,0.00031149405],"genre_scores_gemma":[0.8267573,0.00014412403,0.024281468,0.000033900276,0.000050300412,0.14869152,0.000011633388,0.000022582477,0.0000071893114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777186,0.0002567274,0.0006557208,0.00052838435,0.00038060854,0.0004066774],"domain_scores_gemma":[0.9962724,0.00059862627,0.00057329214,0.0019165025,0.00054300093,0.00009618496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016916526,0.00025936848,0.00036160386,0.00008262018,0.00072670024,0.00013153425,0.0014614997,0.00011116135,0.0000018211855],"category_scores_gemma":[0.000037132515,0.00025425458,0.00009426733,0.00048453175,0.00020549151,0.00032965734,0.00082486455,0.00031051936,0.0000011732317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049265167,0.00031492385,0.00027098786,0.00007722754,0.000031608244,1.713239e-7,0.002381692,0.38076442,0.0000802083,0.010801146,0.00001495463,0.6052134],"study_design_scores_gemma":[0.0020923389,0.00069801084,0.0016007045,0.0008058561,0.00002240448,0.000005098543,0.00012410132,0.991562,0.00026108042,0.00024299757,0.0023206524,0.00026472096],"about_ca_topic_score_codex":0.000007684133,"about_ca_topic_score_gemma":0.000022357484,"teacher_disagreement_score":0.72087264,"about_ca_system_score_codex":0.00018829799,"about_ca_system_score_gemma":0.00022796732,"threshold_uncertainty_score":0.99999094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18975595,0.000031230455,0.7750701,0.00019363042,0.00029170926,0.00010548542,5.4224095e-8,0.00014211907,0.034409735],"genre_scores_gemma":[0.97295684,6.4387183e-7,0.026213743,0.00040984032,0.000074273,0.000010751383,3.5129895e-7,0.0000058368632,0.00032773244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989267,0.00006255793,0.0001880792,0.00032970007,0.00017696431,0.00031600168],"domain_scores_gemma":[0.99925494,0.00015417892,0.000041132844,0.0004581307,0.000021138741,0.00007046279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045300613,0.00009248851,0.00011714251,0.00006736978,0.000039789862,0.000078494966,0.00061777746,0.000043638538,0.000021758231],"category_scores_gemma":[0.00002766377,0.00008341417,0.00002483845,0.0002960328,0.000018154968,0.000060649447,0.00028507513,0.00012094694,0.00010955748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019692468,0.000085390966,0.0029751705,0.0000118641965,0.0000030372362,0.000020648626,0.00037704522,0.23667617,0.00017810235,0.17402527,0.00085802074,0.5847873],"study_design_scores_gemma":[0.000204076,0.000021798816,0.0053929226,0.000020043832,5.301248e-7,0.000008669094,0.000009423366,0.99216396,0.0001781261,0.0004304195,0.0014575028,0.000112541275],"about_ca_topic_score_codex":0.000073592186,"about_ca_topic_score_gemma":0.000057290104,"teacher_disagreement_score":0.78320086,"about_ca_system_score_codex":0.000028755027,"about_ca_system_score_gemma":0.000014069336,"threshold_uncertainty_score":0.3401531},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015753499,0.000006953582,0.95975167,0.0005068277,0.000121388744,0.025050215,3.5784308e-7,0.00038555803,0.0140194865],"genre_scores_gemma":[0.66297966,0.000011726443,0.2716492,0.0039457325,0.00037757316,0.056819998,0.0000058770115,0.000021357639,0.0041888715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984236,0.000039111514,0.00028632797,0.0005692216,0.00021242339,0.00046934988],"domain_scores_gemma":[0.9985922,0.00006523293,0.000071955525,0.0010894854,0.000067996225,0.00011313945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119366,0.00016501751,0.0001916888,0.00003531385,0.00011188828,0.00018785057,0.0011720086,0.0000765303,0.000025391475],"category_scores_gemma":[0.0000035943208,0.00014235277,0.000100165875,0.0003116805,0.000022039616,0.0003149634,0.00018624194,0.00010002282,0.000014218774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014100257,0.00015730003,0.000042259693,0.000016201853,0.000010910004,0.000004315842,0.0000193988,0.0018063717,0.0000058905093,0.6026519,0.013209002,0.38206235],"study_design_scores_gemma":[0.00063199893,0.000270788,0.0019954594,0.00003244382,0.0000048922952,0.000002709965,0.0000052542114,0.96203995,0.00018920068,0.018829776,0.015752664,0.00024486138],"about_ca_topic_score_codex":0.0000022051647,"about_ca_topic_score_gemma":0.000004584872,"teacher_disagreement_score":0.96023357,"about_ca_system_score_codex":0.000052613286,"about_ca_system_score_gemma":0.000015650618,"threshold_uncertainty_score":0.58049774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16016479,0.000022857099,0.8339195,0.0002607888,0.0029636545,0.0003648514,7.988656e-7,0.0003775732,0.0019251885],"genre_scores_gemma":[0.82236135,0.0000044914636,0.17489702,0.00055600377,0.00070253725,0.00010520242,0.000003780301,0.000024405112,0.0013452143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981127,0.000033222896,0.00034674263,0.0006259085,0.00023302533,0.00064843154],"domain_scores_gemma":[0.9979852,0.00043786055,0.00011876985,0.001055199,0.00020180535,0.00020120041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078732014,0.00021595461,0.00023425343,0.000056999528,0.0002536577,0.00063002604,0.0014402096,0.00024380963,0.0001193997],"category_scores_gemma":[0.00006926342,0.00018871657,0.00014611747,0.0003600183,0.000082708204,0.0005809623,0.00039075388,0.0004351602,0.000054739292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020249847,0.00009837097,0.005061141,0.00001911998,0.000036597612,0.000009659169,0.00010848834,0.017900607,0.0028154044,0.8035614,0.0056364313,0.16473252],"study_design_scores_gemma":[0.0004756871,0.000039947085,0.0012447657,0.000007809975,0.0000048180327,0.000011073465,0.0000043740033,0.98670495,0.0036524537,0.0015333223,0.0060448786,0.00027591118],"about_ca_topic_score_codex":0.000024206722,"about_ca_topic_score_gemma":0.00017444254,"teacher_disagreement_score":0.96880436,"about_ca_system_score_codex":0.000016998476,"about_ca_system_score_gemma":0.00006795755,"threshold_uncertainty_score":0.76956385},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008727297,0.0018812824,0.86882305,0.00024682828,0.0027942236,0.12458711,0.0000056016856,0.0008143755,0.00076023804],"genre_scores_gemma":[0.41020393,0.00009212702,0.01222256,0.0023637903,0.0054194992,0.569173,0.000026507747,0.00016249673,0.00033612197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934283,0.0003812941,0.001159343,0.0013153144,0.0007300231,0.0029857093],"domain_scores_gemma":[0.9944143,0.0014848843,0.00071833964,0.00210991,0.0003465486,0.0009259756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002129331,0.0008544591,0.0009882323,0.00017282327,0.00067364634,0.00092094066,0.0038026406,0.000782812,0.00016275751],"category_scores_gemma":[0.00010150842,0.00079347804,0.00046144397,0.0011600064,0.0001448219,0.002968118,0.0010910997,0.0011664873,0.000050353185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075560604,0.0011571392,0.0045823916,0.00019121109,0.0004771211,0.000041295218,0.0006013859,0.4994977,0.000056312456,0.027253062,0.119093224,0.34629354],"study_design_scores_gemma":[0.0036298034,0.00040377455,0.0014986482,0.00015778842,0.000057482615,0.000035918503,0.00001878068,0.8070201,0.00007515537,0.00094047736,0.18525091,0.0009111471],"about_ca_topic_score_codex":0.000007420777,"about_ca_topic_score_gemma":0.000019500485,"teacher_disagreement_score":0.8566005,"about_ca_system_score_codex":0.00023744401,"about_ca_system_score_gemma":0.00015888299,"threshold_uncertainty_score":0.99945164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20207717,0.0010116568,0.7514107,0.0030314096,0.0005194434,0.00045436065,5.229504e-7,0.00048172934,0.04101301],"genre_scores_gemma":[0.96356887,0.0000078994735,0.03489219,0.0010858175,0.00017590872,0.0000083357645,6.099966e-7,0.000006923451,0.00025346645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990365,0.000029823459,0.00014536377,0.00020387389,0.00012048846,0.00046397717],"domain_scores_gemma":[0.9994479,0.00008180077,0.000037328064,0.00030557634,0.000014418238,0.000112985304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043883163,0.0000897753,0.000099866294,0.000104674524,0.000053534943,0.00008795588,0.00026674278,0.00006022657,0.00001773321],"category_scores_gemma":[0.000027139175,0.000081321115,0.000015023883,0.00042023172,0.0000139804115,0.00045928717,0.00018512191,0.0001315496,0.00002098441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075689213,0.00013879506,0.14452553,0.000050300438,0.000008692418,0.000022731265,0.0021429819,0.009025304,0.0005479537,0.78976315,0.0027108702,0.051056102],"study_design_scores_gemma":[0.000573846,0.00003256967,0.010910642,0.00006583311,0.0000020702278,0.000017901082,0.000050661627,0.9746476,0.0016616791,0.0015836719,0.010161547,0.00029199987],"about_ca_topic_score_codex":0.0003465873,"about_ca_topic_score_gemma":0.00004886774,"teacher_disagreement_score":0.96562225,"about_ca_system_score_codex":0.000042340624,"about_ca_system_score_gemma":0.000047373185,"threshold_uncertainty_score":0.3316179},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006892099,0.000015545354,0.9860212,0.0007475054,0.0008914358,0.0005287037,7.5209005e-7,0.000313713,0.00458901],"genre_scores_gemma":[0.9145336,0.0000030973745,0.082709596,0.000634765,0.00045799246,0.00016560819,0.000009120433,0.000018750086,0.0014674262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986104,0.00006014835,0.00024441045,0.0004894491,0.0002019542,0.00039365535],"domain_scores_gemma":[0.9983206,0.00045031,0.00011622063,0.0008303697,0.00014797297,0.00013451753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060331926,0.00016000921,0.00016585799,0.00005155522,0.0001517862,0.00015716568,0.0009998408,0.00016890968,0.000025227502],"category_scores_gemma":[0.000039655726,0.0001430054,0.00008334125,0.00033280678,0.00005463568,0.00032167786,0.0002170481,0.000278272,0.000024701467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019007732,0.00004791769,0.00007410078,0.000003611698,0.000016359429,0.0000016648021,0.00014334617,0.003067933,0.0003515788,0.7727905,0.036881838,0.18660215],"study_design_scores_gemma":[0.00029910568,0.00008513148,0.0003785441,0.0000065688037,0.0000058391133,0.0000058313067,0.000024496294,0.97592163,0.0010947816,0.0017539934,0.020226974,0.00019710668],"about_ca_topic_score_codex":0.00002793857,"about_ca_topic_score_gemma":0.00032784033,"teacher_disagreement_score":0.9728537,"about_ca_system_score_codex":0.000021820684,"about_ca_system_score_gemma":0.000049937407,"threshold_uncertainty_score":0.5831591},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28205058,0.00030854114,0.7168103,0.00013382988,0.0005102057,0.000093337396,5.985318e-8,0.000018153436,0.00007501575],"genre_scores_gemma":[0.6005292,0.00007047501,0.39894512,0.0002836524,0.00016224077,0.0000016789436,2.3380062e-8,0.0000050203807,0.0000025880688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997611,0.000041510986,0.00058718864,0.0004735565,0.0007529564,0.00053380383],"domain_scores_gemma":[0.99864686,0.00008002247,0.00021889128,0.00040775354,0.00027725974,0.0003692188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017204325,0.00017035664,0.0003403931,0.0005069663,0.00024193448,0.00030791244,0.0021648319,0.00005582807,2.8612664e-7],"category_scores_gemma":[0.000020579131,0.00014872495,0.000059130154,0.0019382832,0.00016084673,0.0016902079,0.0008567282,0.0004168454,0.000001125797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008367244,0.00008938348,0.0002420465,0.0000040006257,0.0000036645872,0.000041796768,0.001514844,0.9459704,0.0003345435,0.0016664747,0.000057446483,0.050066993],"study_design_scores_gemma":[0.00042839823,0.00014531774,0.0015704369,0.00009923322,0.0000017072091,0.0016051249,0.000011328507,0.9957556,0.000033326123,0.0001313764,0.000046972586,0.00017115995],"about_ca_topic_score_codex":0.0000046787723,"about_ca_topic_score_gemma":0.000002189318,"teacher_disagreement_score":0.3184786,"about_ca_system_score_codex":0.00010699087,"about_ca_system_score_gemma":0.0002665943,"threshold_uncertainty_score":0.6064828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018647423,0.0008631931,0.9776327,0.00013792056,0.0013305343,0.00063588296,0.000002451805,0.00036923142,0.00038064766],"genre_scores_gemma":[0.7100526,0.00008758749,0.28834486,0.0007674842,0.00027209587,0.000089751375,0.0000037804664,0.000030446115,0.0003513654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796027,0.000092231014,0.00033041887,0.00045560184,0.00020484034,0.0009566603],"domain_scores_gemma":[0.9982006,0.00023587485,0.0001509483,0.00091999234,0.00014626181,0.00034634204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005348888,0.00025392513,0.00028995427,0.000085787986,0.00033321488,0.00014119301,0.0008721155,0.0001946207,0.000018630219],"category_scores_gemma":[0.000020872214,0.0002315445,0.00018881066,0.00049568963,0.000115319956,0.00087142666,0.00026694202,0.000244725,0.000013990203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025193243,0.0004288152,0.0031106453,0.000035808698,0.00011828702,0.000004387949,0.0017002462,0.010750497,0.00061419356,0.92416775,0.012041071,0.047003124],"study_design_scores_gemma":[0.00054526347,0.000038892293,0.0005956311,0.000025286743,0.000017155358,0.000025434401,0.00002793833,0.98122025,0.00022554833,0.0005229419,0.016418317,0.00033732504],"about_ca_topic_score_codex":0.000060493952,"about_ca_topic_score_gemma":0.0000856217,"teacher_disagreement_score":0.9704698,"about_ca_system_score_codex":0.00006950644,"about_ca_system_score_gemma":0.000036592217,"threshold_uncertainty_score":0.94421107},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8876149,0.0000139635995,0.06984503,0.00007221504,0.00010724151,0.00034839724,9.083458e-7,0.000047638092,0.041949693],"genre_scores_gemma":[0.9973432,7.8095013e-7,0.0024742198,0.000097302756,0.000015408796,0.000027052432,3.4396535e-7,0.000006920148,0.00003480147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904525,0.00012275437,0.00020908532,0.0001764985,0.00025490517,0.00019152905],"domain_scores_gemma":[0.9984483,0.00045435605,0.00017576836,0.00083710055,0.000055349406,0.00002912842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198094,0.00011984053,0.00013228106,0.000042867934,0.00008069455,0.0000957797,0.0009531533,0.00004235964,0.00016262465],"category_scores_gemma":[0.000016024875,0.000053731143,0.000109291934,0.00020568467,0.00009836616,0.00021931775,0.00007973283,0.0001529009,0.000007522514],"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.00006220824,0.0012931414,0.0077637164,0.00003156524,0.00010709162,0.000035455356,0.003900111,0.042290743,0.0077155996,0.7919131,0.0025328312,0.14235443],"study_design_scores_gemma":[0.00087096135,0.0035224585,0.40185073,0.0004025583,0.00006598512,0.00001560415,0.001796491,0.47162485,0.105815224,0.013391953,0.00003917173,0.00060399977],"about_ca_topic_score_codex":0.00045661817,"about_ca_topic_score_gemma":0.000018166827,"teacher_disagreement_score":0.7785211,"about_ca_system_score_codex":0.000023536646,"about_ca_system_score_gemma":0.00012021938,"threshold_uncertainty_score":0.21910925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061862707,0.00006463907,0.91229945,0.000031933745,0.0001987326,0.00042290767,0.000013799663,0.00017517028,0.02493068],"genre_scores_gemma":[0.78361005,0.000004695737,0.2162,0.000024899156,0.000036534868,0.000056560242,0.00001915284,0.00001358733,0.00003450891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880755,0.000013420553,0.00036437204,0.00017042815,0.00029136727,0.00035284852],"domain_scores_gemma":[0.99870265,0.00022076238,0.00022579475,0.0006804598,0.000044610944,0.00012573654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021510941,0.00014948306,0.00024089974,0.000069529735,0.00006462667,0.00003418005,0.0005554669,0.00006308747,0.00004954703],"category_scores_gemma":[0.000019676023,0.00013226867,0.00005643627,0.0004060849,0.000066703135,0.00021280244,0.0001645505,0.00010711525,0.000058021295],"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.0000019276335,0.00010405465,0.00010703948,0.00004821868,0.000027587057,3.9977823e-7,0.0023733058,0.000115584,0.0016640126,0.99440426,0.00043198286,0.0007216586],"study_design_scores_gemma":[0.0059739077,0.00052246096,0.009945738,0.0003876435,0.0005274351,0.00013055257,0.009297232,0.2210238,0.10121313,0.64034104,0.0069977175,0.003639337],"about_ca_topic_score_codex":0.0000026913567,"about_ca_topic_score_gemma":0.0000018516363,"teacher_disagreement_score":0.72174734,"about_ca_system_score_codex":0.000015201268,"about_ca_system_score_gemma":0.000021930982,"threshold_uncertainty_score":0.53937596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3810498,0.000117916934,0.5808836,0.00019058693,0.00014908926,0.00015028533,2.1108941e-7,0.00039939166,0.0370591],"genre_scores_gemma":[0.96520257,0.000022751567,0.03191947,0.0014542585,0.00003748005,0.0000077270015,3.7228756e-7,0.00000818748,0.0013471758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903166,0.000026646074,0.000118357835,0.0003129099,0.0002443209,0.0002661292],"domain_scores_gemma":[0.9992527,0.00010373046,0.000042495834,0.0005025536,0.00003899811,0.000059528655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008957924,0.000109701185,0.00010888836,0.000038745573,0.00014190782,0.000041457006,0.00052040734,0.00003590862,0.000040485145],"category_scores_gemma":[0.000007072331,0.000079313104,0.00003121486,0.0002678261,0.000037112153,0.0002066072,0.00011267681,0.00012325194,0.00019199854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023442104,0.00046342326,0.006264367,0.000015922073,0.00011876706,0.0016344495,0.003953493,0.022979539,0.0007060357,0.66999006,0.041838083,0.2518014],"study_design_scores_gemma":[0.0022863676,0.0015729856,0.013996315,0.00015260796,0.0000098176415,0.00073827984,0.00006743762,0.96794647,0.0024710945,0.0019882142,0.0077974973,0.00097290514],"about_ca_topic_score_codex":0.000015101681,"about_ca_topic_score_gemma":0.000013546858,"teacher_disagreement_score":0.9449669,"about_ca_system_score_codex":0.000026106887,"about_ca_system_score_gemma":0.000045260003,"threshold_uncertainty_score":0.32342944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001671271,0.003255004,0.9762005,0.005296531,0.0001795745,0.013463988,0.000008660707,0.0004103522,0.0010182557],"genre_scores_gemma":[0.08828723,0.0021840855,0.8571507,0.00093175896,0.0008195676,0.049221754,0.000053794665,0.00007396786,0.0012771916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982415,0.00015874213,0.0005187108,0.00044433036,0.00017391406,0.00046279407],"domain_scores_gemma":[0.9956671,0.0004583703,0.00025714733,0.0032432142,0.0002349065,0.00013928287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074700324,0.00022714789,0.00027551278,0.000080357415,0.0005108415,0.00030464085,0.0028371408,0.00011396189,0.000004746526],"category_scores_gemma":[0.000033569067,0.0002316913,0.00006642626,0.00047539046,0.00016086882,0.00065374054,0.00086994085,0.00033796477,0.000036679063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009772935,0.0002920522,0.00012912786,0.000044285185,0.000037790353,7.008913e-7,0.00047227903,0.0066603245,0.00028189385,0.017026225,0.018850142,0.9561954],"study_design_scores_gemma":[0.00053497555,0.00007398782,0.00017521236,0.00010358961,0.000007906474,0.000013592427,0.000005315017,0.66112447,0.000040622992,0.000352271,0.33737198,0.00019605395],"about_ca_topic_score_codex":0.0000029081596,"about_ca_topic_score_gemma":0.00017149671,"teacher_disagreement_score":0.9559994,"about_ca_system_score_codex":0.000081730854,"about_ca_system_score_gemma":0.00007343807,"threshold_uncertainty_score":0.9448097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07531135,0.00007106273,0.9146276,0.000033313794,0.00012567727,0.00006193531,3.6875434e-7,0.000058674974,0.009710019],"genre_scores_gemma":[0.98131853,0.000004235389,0.018015679,0.00012637695,0.000034449306,0.000007932235,9.571139e-7,0.0000033074193,0.00048849976],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991963,0.000032093252,0.00016955432,0.00014313252,0.00020453527,0.00025436422],"domain_scores_gemma":[0.9992763,0.0000439113,0.00007686979,0.00048153807,0.00003095818,0.000090414396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031255255,0.000066742694,0.00019743564,0.0001480412,0.000017905775,0.000024105653,0.00040660158,0.000028429393,0.000098121236],"category_scores_gemma":[0.000008872161,0.00005314497,0.000114987015,0.0010357861,0.000013804224,0.00041209033,0.00019840019,0.000040480103,0.000023509405],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026661387,0.0001121178,0.8832132,0.0000061363908,0.00093886076,7.334787e-7,0.00103291,0.0027553681,0.00033387743,0.053878065,0.000555479,0.057170574],"study_design_scores_gemma":[0.00024233607,0.0000346259,0.14604862,0.0000094846655,0.0003734857,0.0000020607417,0.000025330519,0.84723884,0.002004902,0.00034514157,0.003458324,0.00021685705],"about_ca_topic_score_codex":0.000027892753,"about_ca_topic_score_gemma":0.000007727414,"teacher_disagreement_score":0.90600723,"about_ca_system_score_codex":0.000018706942,"about_ca_system_score_gemma":0.000008224464,"threshold_uncertainty_score":0.2167189},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031659154,0.0002142849,0.8243857,0.00014907378,0.000069166184,0.16635048,5.007348e-7,0.00013520753,0.005529684],"genre_scores_gemma":[0.124050565,0.000016477044,0.4408029,0.00031322535,0.00007308748,0.43432653,0.0000035843605,0.000017845574,0.00039578474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896246,0.00005228861,0.0003773007,0.00019293088,0.00013061352,0.00028440612],"domain_scores_gemma":[0.99855566,0.0003790949,0.00012725391,0.0008027954,0.000091282825,0.000043932632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012621583,0.0000839691,0.00014518683,0.000037610534,0.00004821914,0.000027209726,0.00085952383,0.000070221286,0.000014512575],"category_scores_gemma":[0.000014468031,0.00007645445,0.000044541786,0.00040784496,0.000040278013,0.00021408183,0.000236547,0.00009664867,0.000005109598],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015066583,0.00036105543,0.008184055,0.000091742484,0.000012541425,0.0000018388965,0.000586269,0.008736966,0.00025516617,0.07851685,0.014146573,0.88895625],"study_design_scores_gemma":[0.0040367427,0.001009196,0.027672766,0.00035200833,0.000004698302,0.000005552805,0.0001012111,0.28683737,0.0069714696,0.030357739,0.64211845,0.0005327763],"about_ca_topic_score_codex":0.000012096756,"about_ca_topic_score_gemma":0.00047585578,"teacher_disagreement_score":0.8884235,"about_ca_system_score_codex":0.000038380535,"about_ca_system_score_gemma":0.000039111743,"threshold_uncertainty_score":0.31177223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5913818,0.0048603625,0.4000034,0.0004677055,0.00037705223,0.00027827083,0.000006108315,0.00021668643,0.0024086032],"genre_scores_gemma":[0.9963286,0.0002131136,0.002669904,0.00029220807,0.00012506668,0.000024804416,0.000015175293,0.000012041419,0.0003191069],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981203,0.000101448306,0.00036734898,0.0006048219,0.0002918435,0.0005142084],"domain_scores_gemma":[0.9988806,0.00008422497,0.00012424603,0.00075205904,0.000057415906,0.0001014503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039831008,0.00021885251,0.0003814648,0.0001915051,0.00009488409,0.00028747122,0.00072138145,0.00013504182,0.000023886127],"category_scores_gemma":[0.000004953717,0.00021838995,0.000106908694,0.0018612357,0.00007108702,0.00039367692,0.00028834853,0.00023783842,0.00002522627],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037162456,0.00029207557,0.65012425,0.000026792462,0.00024180557,0.0002264725,0.00028075094,0.12023966,0.000045153105,0.0054502846,0.02075564,0.20227994],"study_design_scores_gemma":[0.00047906357,0.00003242201,0.35023963,0.00003107919,0.000047684167,0.000010456367,0.000009711444,0.64014834,0.000012949198,0.00042982804,0.008259449,0.00029935982],"about_ca_topic_score_codex":0.00021203843,"about_ca_topic_score_gemma":0.0065451115,"teacher_disagreement_score":0.5199087,"about_ca_system_score_codex":0.00009818244,"about_ca_system_score_gemma":0.000033490956,"threshold_uncertainty_score":0.8905684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067761004,0.000041058945,0.9081665,0.00014182323,0.00033434707,0.00015036798,7.8229414e-7,0.00020081503,0.023203272],"genre_scores_gemma":[0.9767986,0.000006956465,0.021537624,0.0001635129,0.00018538853,0.000013756798,0.0000021547987,0.000009736766,0.0012822853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986208,0.00006116814,0.00032846894,0.00035905768,0.0002656182,0.00036487833],"domain_scores_gemma":[0.9988719,0.00010043599,0.00011974072,0.0007565511,0.00008143856,0.00006991733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026309816,0.00014763455,0.00023060886,0.000047667374,0.000055193443,0.000059185008,0.0009224647,0.00011113762,0.00007268796],"category_scores_gemma":[0.0000037904983,0.00013118077,0.00008623479,0.0004434002,0.00008360579,0.00028430144,0.0002562995,0.00015830796,0.000023799152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038171606,0.00011873274,0.0029600577,0.000012248464,0.0000140725415,0.00001180748,0.00006091181,0.011597314,0.0005553945,0.9354317,0.023560058,0.025673874],"study_design_scores_gemma":[0.00027003672,0.00005063267,0.006492126,0.000019544443,0.0000050772433,0.000012336547,0.0000069815133,0.9814328,0.004028211,0.0057913377,0.0016508071,0.0002400891],"about_ca_topic_score_codex":0.0005612347,"about_ca_topic_score_gemma":0.00031114672,"teacher_disagreement_score":0.9698355,"about_ca_system_score_codex":0.00003124396,"about_ca_system_score_gemma":0.000027076532,"threshold_uncertainty_score":0.5349397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012614696,0.0005677195,0.9905606,0.0016110385,0.00058679987,0.00020175231,0.0000027375654,0.0003441921,0.0059990194],"genre_scores_gemma":[0.92317545,0.00014649151,0.07407368,0.0010181359,0.0003578038,0.0003761609,0.000055201428,0.00003040401,0.0007666716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986414,0.00018269218,0.0003324388,0.00033157473,0.00014116913,0.0003707822],"domain_scores_gemma":[0.9945403,0.0008653443,0.00016675309,0.0041266694,0.00018521814,0.00011573964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045843702,0.00017640869,0.00022272128,0.00008505901,0.00041553593,0.00016258324,0.0040208898,0.000106460204,0.0000047208396],"category_scores_gemma":[0.000021622356,0.00018422325,0.000090442794,0.0004421668,0.00010355759,0.0003119808,0.00064948935,0.00022333188,0.00003253949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001256687,0.0002073504,0.00033028275,0.000019503497,0.00005355937,0.0000013529906,0.0002503248,0.044846263,0.00026571593,0.45126483,0.10972537,0.39302287],"study_design_scores_gemma":[0.00026385512,0.000044882938,0.00013769676,0.00003695156,0.000007453798,0.000005686254,0.0000030943334,0.78077143,0.00004802162,0.0026223653,0.21588807,0.00017050472],"about_ca_topic_score_codex":0.000009379988,"about_ca_topic_score_gemma":0.00005482145,"teacher_disagreement_score":0.92304933,"about_ca_system_score_codex":0.00004371353,"about_ca_system_score_gemma":0.000035605957,"threshold_uncertainty_score":0.7512406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06472781,0.00015472308,0.92861044,0.0004832237,0.000048825535,0.00032115067,8.1360616e-7,0.0000577479,0.0055952426],"genre_scores_gemma":[0.8166505,0.000013962997,0.18272154,0.00023764168,0.000016555532,0.00007676931,0.0000033865633,0.00000416844,0.00027546825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917895,0.00003965455,0.0002522902,0.00021232585,0.00017178703,0.00014499904],"domain_scores_gemma":[0.99926573,0.00024198972,0.00007012559,0.00037091156,0.000012739508,0.000038526417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014711687,0.00006939131,0.00009189601,0.000088871966,0.000022986065,0.000018950013,0.00032239626,0.000037251364,0.000048327893],"category_scores_gemma":[0.000031297775,0.000068823465,0.00003224429,0.0002789132,0.000029466451,0.00029898662,0.00005462837,0.000059953065,0.000045923698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040496548,0.00037337965,0.003870157,0.0000053464773,0.000007975759,0.0000029145594,0.00051118655,0.5834667,0.0013147194,0.034231555,0.00039639007,0.3758156],"study_design_scores_gemma":[0.0004646568,0.00006829134,0.0060136467,0.000012028139,0.0000019271752,6.286812e-7,0.000039714752,0.95494795,0.011204754,0.00077449507,0.026350135,0.00012175042],"about_ca_topic_score_codex":0.000008418163,"about_ca_topic_score_gemma":0.000051689694,"teacher_disagreement_score":0.75192267,"about_ca_system_score_codex":0.00004763645,"about_ca_system_score_gemma":0.00003815861,"threshold_uncertainty_score":0.28065395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562094,0.0011282181,0.309448,0.00432152,0.0011151877,0.112249434,0.000007593031,0.0011215108,0.0085145645],"genre_scores_gemma":[0.97860724,0.00033615853,0.0040284493,0.00066364964,0.00012760914,0.016189855,0.0000205908,0.00002274702,0.0000037273178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726427,0.0007047201,0.0007893542,0.00050387066,0.00027259055,0.00046521114],"domain_scores_gemma":[0.9961215,0.00072192185,0.00045814159,0.0022561774,0.00027637175,0.00016586548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014952322,0.00028709043,0.00051151705,0.000105092724,0.00024122572,0.00031399305,0.0032704503,0.0004146915,0.000017341657],"category_scores_gemma":[0.000030161185,0.0002897977,0.00008612679,0.0012028709,0.00016850908,0.0009626647,0.001879205,0.0014321401,0.000001793069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003853072,0.0062231766,0.052763842,0.001675545,0.00045865058,0.000044442557,0.027203098,0.30533838,0.00042883266,0.26482478,0.0037222237,0.33346397],"study_design_scores_gemma":[0.0039149784,0.000035465702,0.0014357128,0.00013096967,0.000009174056,0.0000073681026,0.00002907807,0.9890274,0.000037105983,0.001721136,0.0033540397,0.0002975834],"about_ca_topic_score_codex":0.00014559322,"about_ca_topic_score_gemma":0.005820233,"teacher_disagreement_score":0.683689,"about_ca_system_score_codex":0.000032141186,"about_ca_system_score_gemma":0.00010287949,"threshold_uncertainty_score":0.9999554},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09809158,0.0000075471307,0.8986507,0.00022101011,0.0005091016,0.001044117,0.0000032393853,0.00023864557,0.0012340429],"genre_scores_gemma":[0.70607615,7.3998393e-7,0.2933603,0.00033656927,0.00014376578,0.000058202902,0.000004046461,0.000015956512,0.0000042644015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961696,0.00025292253,0.0007069892,0.0011579149,0.0004965237,0.0012160434],"domain_scores_gemma":[0.9971009,0.0011954061,0.00025564543,0.00083355256,0.00029869287,0.00031583107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033524993,0.0003378418,0.0004489046,0.00023378716,0.0004204757,0.00043129196,0.0021372736,0.00016835285,0.00003947671],"category_scores_gemma":[0.00017601707,0.00031815973,0.00009849753,0.0014211823,0.0023073961,0.0007727787,0.0009391825,0.000380023,0.000023652403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004840364,0.000105018895,0.00013105536,0.000013648663,0.000009385875,0.000013854618,0.0012729812,0.003081198,0.0020908404,0.9585129,0.00007399239,0.034646712],"study_design_scores_gemma":[0.00092311733,0.00015972643,0.00049129146,0.000108465756,0.0000056286417,0.00004546867,0.00005234132,0.98698324,0.0029479961,0.007867488,0.0000050735953,0.00041015292],"about_ca_topic_score_codex":0.000009230687,"about_ca_topic_score_gemma":0.0000024375054,"teacher_disagreement_score":0.98390204,"about_ca_system_score_codex":0.00018722248,"about_ca_system_score_gemma":0.0001934058,"threshold_uncertainty_score":0.99992704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119429575,0.000021372647,0.98292524,0.0009131802,0.00036450443,0.00022968146,0.0000010657616,0.00038039513,0.0032215873],"genre_scores_gemma":[0.9917037,0.000005766718,0.006111575,0.0018656385,0.00016076336,0.000014115272,0.000014086988,0.0000093309945,0.000115014416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800265,0.000115192925,0.00039415428,0.00054564007,0.0002711406,0.00067120296],"domain_scores_gemma":[0.9987459,0.00018234648,0.0001011919,0.0007702602,0.00005387383,0.00014640747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013606,0.00021136405,0.00026446226,0.000075839154,0.00009046768,0.00019624057,0.0010620131,0.0001442495,0.00004090251],"category_scores_gemma":[0.000017916103,0.00019698759,0.00007769961,0.0010599351,0.000025777596,0.00037182268,0.00009332986,0.00033147895,0.000021866666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037250444,0.00047926712,0.010102976,0.000009768192,0.000019404275,0.00022729467,0.00016616614,0.23443492,0.00022459298,0.3226876,0.02604257,0.4055682],"study_design_scores_gemma":[0.0005109115,0.000060010017,0.0060351063,0.000043521348,0.000002241541,0.000004157949,0.00000626422,0.99181557,0.00034418915,0.000700559,0.00022616012,0.00025131903],"about_ca_topic_score_codex":0.000066933746,"about_ca_topic_score_gemma":0.00013665862,"teacher_disagreement_score":0.97976077,"about_ca_system_score_codex":0.00015953658,"about_ca_system_score_gemma":0.00006522482,"threshold_uncertainty_score":0.8032921},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02617551,0.0018814576,0.96973765,0.00027582486,0.00054369407,0.00077354984,0.0000016134694,0.00029864372,0.00031208317],"genre_scores_gemma":[0.8715068,0.00035357286,0.1276188,0.00015320208,0.00011477585,0.0001953724,0.000017515638,0.000018299286,0.000021649983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856615,0.00013798734,0.00044491424,0.0003807135,0.00011961906,0.00035060322],"domain_scores_gemma":[0.99710447,0.0004843105,0.00016901968,0.002001416,0.00012826278,0.00011253697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008314166,0.00016924755,0.00020488695,0.00019718333,0.00032563414,0.00015663408,0.0012668279,0.00015139458,2.1667708e-7],"category_scores_gemma":[0.00000834832,0.00018749996,0.000066429224,0.00053654,0.00006650419,0.00038022496,0.00069846626,0.00033176574,0.0000051194993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018281342,0.00013559165,0.00044249694,0.00002439295,0.00001510232,0.000004278099,0.00047401097,0.00097573386,0.0015200736,0.0049126614,0.00017908789,0.9912983],"study_design_scores_gemma":[0.0006575265,0.00008579379,0.015633339,0.00011726839,0.000013400229,0.000041995405,0.00005487336,0.9670551,0.00018255935,0.00010460098,0.015817394,0.00023613939],"about_ca_topic_score_codex":0.00002139807,"about_ca_topic_score_gemma":0.00068752933,"teacher_disagreement_score":0.99106216,"about_ca_system_score_codex":0.00021841927,"about_ca_system_score_gemma":0.000025761094,"threshold_uncertainty_score":0.76460266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011334153,0.027188316,0.96570194,0.00014122896,0.0025439556,0.0020969757,0.0000145471895,0.00078877085,0.00039086735],"genre_scores_gemma":[0.0819372,0.016638482,0.8915144,0.0020698498,0.0038081072,0.0019059102,0.0002706194,0.00022525899,0.0016301265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499923,0.00022938853,0.0009429745,0.0014195817,0.0005679792,0.001840852],"domain_scores_gemma":[0.9964656,0.00071891764,0.0005665388,0.0014895977,0.00034154687,0.00041779602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092802057,0.0006407422,0.0007647125,0.00011489882,0.0011157384,0.00029801825,0.0016884202,0.00034661827,0.00005233729],"category_scores_gemma":[0.000043371885,0.00067612145,0.00034852017,0.0012321465,0.00018969348,0.0008784137,0.00066621316,0.0006409998,0.000038098435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027051474,0.00007256824,0.000051095914,0.0000056271574,0.000050297785,0.0000726151,0.0001637029,0.6389969,0.0000011970267,0.00022339627,0.02751503,0.33282053],"study_design_scores_gemma":[0.001204503,0.0006208036,0.00010207291,0.00009870759,0.000036658912,0.0002188142,0.00001628594,0.9096516,0.000014359583,0.00027188956,0.08705397,0.00071037264],"about_ca_topic_score_codex":0.0000055153737,"about_ca_topic_score_gemma":0.00002053847,"teacher_disagreement_score":0.33211014,"about_ca_system_score_codex":0.00024118667,"about_ca_system_score_gemma":0.00021400607,"threshold_uncertainty_score":0.999569},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36080036,0.00004771646,0.6363673,0.00057647465,0.00087287946,0.00036519291,0.00040245336,0.00012314237,0.0004444832],"genre_scores_gemma":[0.9566343,0.0012514798,0.040580638,0.00021056976,0.00023154185,0.000025685062,0.0009476668,0.000015046134,0.00010308271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977419,0.000056865723,0.0006062491,0.000705152,0.00046967645,0.00042018318],"domain_scores_gemma":[0.9976296,0.00028826328,0.00027625184,0.001268832,0.00042081578,0.00011623117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043113128,0.0002875573,0.0003329667,0.0002435361,0.00044974228,0.00018254398,0.0030168025,0.00010748724,0.000015291938],"category_scores_gemma":[0.00004466991,0.000289313,0.00004726305,0.00035608243,0.00029216325,0.00069849915,0.00076381123,0.000414579,0.00002118835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003496186,0.0028207363,0.2012612,0.00021408068,0.00068074226,0.000121294375,0.002663775,0.08618891,0.00023151712,0.027235324,0.0072757713,0.670957],"study_design_scores_gemma":[0.0010930846,0.00015553854,0.037970796,0.00018701829,0.000011513733,0.000082892875,0.000020270329,0.9588652,0.00010165933,0.00007600365,0.0011242004,0.00031182414],"about_ca_topic_score_codex":0.00006474158,"about_ca_topic_score_gemma":0.000051122162,"teacher_disagreement_score":0.8726763,"about_ca_system_score_codex":0.00011717109,"about_ca_system_score_gemma":0.00017164073,"threshold_uncertainty_score":0.9999559},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074450495,0.000015641606,0.98169965,0.0014905822,0.00032784516,0.0013081001,0.0000010445184,0.00024929972,0.0074627823],"genre_scores_gemma":[0.8031722,0.0000066040493,0.18579808,0.002329536,0.0002571676,0.00079926895,0.00002301422,0.000032766126,0.0075813835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974724,0.0000458452,0.0004328072,0.00090988993,0.00043291217,0.00070615695],"domain_scores_gemma":[0.9974025,0.000111814945,0.00014304237,0.0016324058,0.00049763644,0.00021261722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013241324,0.00023341419,0.0003040672,0.00006989578,0.00009182107,0.00010877873,0.0011267549,0.00013042495,0.000073917014],"category_scores_gemma":[0.000041787567,0.00018995725,0.00006579154,0.0006172518,0.00004310647,0.00032533248,0.0002607076,0.00018931348,0.000025563173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002666659,0.0002559301,0.029216547,0.000018570125,0.00007280093,0.000025165697,0.0009799639,0.0046925745,0.000032638938,0.6497994,0.18816905,0.12647067],"study_design_scores_gemma":[0.0019729524,0.0011766509,0.019521534,0.00012182617,0.000026166674,0.000039355473,0.00010202936,0.8808267,0.0016113243,0.0018912528,0.09170533,0.0010048671],"about_ca_topic_score_codex":0.00013544527,"about_ca_topic_score_gemma":0.00043472208,"teacher_disagreement_score":0.87613416,"about_ca_system_score_codex":0.000069759364,"about_ca_system_score_gemma":0.00007824129,"threshold_uncertainty_score":0.77462316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3694645,0.0042716437,0.62101823,0.000351867,0.0012529187,0.0019625851,0.00000174376,0.00012884896,0.0015476577],"genre_scores_gemma":[0.9761053,0.00005309283,0.023609046,0.00002085512,0.000042896278,0.000057622845,0.0000017518519,0.000005905261,0.00010352855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810475,0.00015937063,0.0005978997,0.00039981015,0.0003853457,0.00035283607],"domain_scores_gemma":[0.9990873,0.00017857876,0.00013031636,0.00048281075,0.00003506372,0.0000859854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783093,0.000148197,0.0003074237,0.00017333125,0.000018859277,0.00004070185,0.0007064882,0.00009720029,0.000009058398],"category_scores_gemma":[0.000026711672,0.00013812023,0.000037151658,0.00043272114,0.000023015724,0.0002940894,0.000051819014,0.00015934986,0.000011674663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034627148,0.00060287793,0.019277949,0.00020439697,0.0000064905857,0.00015633945,0.009580053,0.019418139,0.08034274,0.0003544643,0.0003419119,0.86968],"study_design_scores_gemma":[0.00062604656,0.00007479965,0.028803654,0.0007811067,0.000001438324,0.000005026847,0.000043062548,0.9630534,0.0060594482,0.000037787522,0.00036258227,0.00015164338],"about_ca_topic_score_codex":0.00062893884,"about_ca_topic_score_gemma":0.00006347664,"teacher_disagreement_score":0.9436353,"about_ca_system_score_codex":0.0000847917,"about_ca_system_score_gemma":0.000038419632,"threshold_uncertainty_score":0.56323797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026579373,0.00013420687,0.96791714,0.00034244102,0.000978045,0.0009557246,1.1398564e-7,0.00061997905,0.002472965],"genre_scores_gemma":[0.9951664,0.00012116675,0.001977861,0.0010942208,0.0006359075,0.00045743585,0.000028257726,0.00007933886,0.00043938053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949446,0.00043224316,0.0010609867,0.0011326531,0.00062673265,0.0018028249],"domain_scores_gemma":[0.9971667,0.0005563803,0.00045558307,0.001269939,0.00017589137,0.00037553036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011034176,0.0005896149,0.00068627903,0.00022054359,0.00036976035,0.00066455087,0.0019105953,0.00046730365,0.00018872654],"category_scores_gemma":[0.000030412337,0.0006044991,0.00019838552,0.0015964155,0.00011276528,0.0010474381,0.00075549,0.001640924,0.00010966551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010607674,0.00005155468,0.00680558,0.00001162692,0.000019859004,0.000037669015,0.00012738684,0.88133913,0.000017726572,0.019540511,0.0013567287,0.0906816],"study_design_scores_gemma":[0.0010371937,0.00009925434,0.0033339325,0.00029307025,0.000008187534,0.000008170834,0.000041565443,0.9940622,0.00003939568,0.00010798967,0.00029008364,0.0006789501],"about_ca_topic_score_codex":0.000452089,"about_ca_topic_score_gemma":0.00012147169,"teacher_disagreement_score":0.96858704,"about_ca_system_score_codex":0.00028767053,"about_ca_system_score_gemma":0.0001124217,"threshold_uncertainty_score":0.99964064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116814645,0.0001651154,0.984566,0.0014745665,0.0004425295,0.0008388615,0.0000036634983,0.00020468225,0.00062312215],"genre_scores_gemma":[0.5098172,0.000016136608,0.486293,0.0026804486,0.00026404668,0.00015134145,0.000028118824,0.00002684414,0.00072289206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822146,0.000058923295,0.00043220285,0.00049303786,0.00020856973,0.0005858252],"domain_scores_gemma":[0.9983089,0.0005424475,0.00010254014,0.00075172464,0.00013984824,0.0001545147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002731147,0.00020531891,0.00025788744,0.000095372816,0.0000832353,0.00015724836,0.0007402154,0.00015069271,0.00008970276],"category_scores_gemma":[0.0000657557,0.00018580769,0.00008171108,0.00041284732,0.0000411503,0.00029734633,0.00014194488,0.00026989885,0.00004744329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015494137,0.00037308145,0.007198711,0.00002957308,0.000021490174,0.000028957393,0.00008138614,0.8933572,0.000042917945,0.014617793,0.044347834,0.039885562],"study_design_scores_gemma":[0.0006692849,0.000079887905,0.004393497,0.000026192483,0.000004654325,0.000002587032,0.000012164501,0.9891792,0.000023317012,0.001130159,0.004258573,0.00022047017],"about_ca_topic_score_codex":0.00018447741,"about_ca_topic_score_gemma":0.0001400785,"teacher_disagreement_score":0.49827302,"about_ca_system_score_codex":0.00005546233,"about_ca_system_score_gemma":0.000059198916,"threshold_uncertainty_score":0.75770175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7170056,0.05165875,0.22358157,0.0018697764,0.000748956,0.0013024826,0.00003353315,0.0006164018,0.0031829162],"genre_scores_gemma":[0.9948334,0.000960386,0.002702781,0.00004282993,0.00008205809,0.0005061323,0.00015540501,0.000028106735,0.0006888711],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778944,0.00052867574,0.0005192785,0.00046604214,0.000281339,0.00041523395],"domain_scores_gemma":[0.9974283,0.00022061916,0.00023226709,0.0019267575,0.00011058499,0.000081493345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007185687,0.00021239014,0.00026758914,0.00015416353,0.0005240849,0.00027389452,0.00206761,0.000093997536,0.000005604796],"category_scores_gemma":[0.000009343487,0.00024320644,0.00008595567,0.0006678601,0.00015263287,0.0005824138,0.00055350066,0.00056696124,0.000033478555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009364,0.0035073624,0.004121111,0.00043015162,0.00027445654,0.00018421016,0.013775517,0.050560713,0.5369778,0.20061094,0.05446441,0.13499969],"study_design_scores_gemma":[0.0004137499,0.000046132664,0.00018535914,0.00020399458,0.000010604815,0.000073624135,0.0005845504,0.97335654,0.0007362599,0.0002292259,0.023763174,0.00039677264],"about_ca_topic_score_codex":0.0004818021,"about_ca_topic_score_gemma":0.00008606704,"teacher_disagreement_score":0.92279583,"about_ca_system_score_codex":0.00030083375,"about_ca_system_score_gemma":0.00009088825,"threshold_uncertainty_score":0.99176705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073760943,0.019634558,0.9613393,0.00045436042,0.0016411176,0.0013398604,0.000020099951,0.00077292684,0.007421667],"genre_scores_gemma":[0.94540703,0.0011985566,0.048461925,0.0019074666,0.0018815325,0.00019821739,0.0005851188,0.00011829083,0.0002418684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99321985,0.0005080871,0.001017724,0.002572672,0.00075135875,0.0019302837],"domain_scores_gemma":[0.9925421,0.000302817,0.00028866658,0.006166501,0.000119575554,0.00058035937],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018313695,0.00071314984,0.00078342186,0.00023419397,0.00028491588,0.00071953016,0.006861921,0.0006027074,0.000046064193],"category_scores_gemma":[0.00002478882,0.00074658386,0.0001338018,0.0022114187,0.00012938095,0.00205444,0.0025464597,0.0013667506,0.00007966906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071604656,0.0006518064,0.0011874846,0.0000134179445,0.00002808824,0.00008572343,0.00029337712,0.7578318,0.0000047260273,0.008200088,0.086377785,0.14525406],"study_design_scores_gemma":[0.0007325989,0.00019077807,0.005888653,0.00006200989,0.000017034694,0.00003266356,0.000026765398,0.9149607,0.0000023336297,0.0018812508,0.07538285,0.0008223702],"about_ca_topic_score_codex":0.00011486413,"about_ca_topic_score_gemma":0.0018595713,"teacher_disagreement_score":0.93803096,"about_ca_system_score_codex":0.00022328382,"about_ca_system_score_gemma":0.0001236064,"threshold_uncertainty_score":0.99949855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049849596,0.00012734393,0.93969685,0.00013616192,0.0070083006,0.0014587778,0.000004901143,0.00122497,0.00049312616],"genre_scores_gemma":[0.9784107,0.000043689535,0.017348288,0.00020976168,0.0028644449,0.00080091594,0.000043481126,0.00011152625,0.00016719158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570024,0.00020996183,0.0009325432,0.0013907369,0.00050670543,0.0012598375],"domain_scores_gemma":[0.9961391,0.00065720204,0.00061984966,0.0017700145,0.0004086835,0.00040512788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009730169,0.0005809766,0.0007034735,0.0001815368,0.0007356737,0.0006476392,0.0018283983,0.0007576692,0.000011403553],"category_scores_gemma":[0.000028267277,0.00059830304,0.00035242413,0.0011301115,0.00015215289,0.0008977976,0.00038563236,0.0011422839,0.000020810901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020520549,0.00019635787,0.0012621994,0.00016717096,0.00024532058,0.00008868956,0.0003793238,0.21649483,0.003125702,0.15214227,0.0035221048,0.6221708],"study_design_scores_gemma":[0.0011021453,0.00015312852,0.00062929734,0.00011882688,0.000047964186,0.00013319444,0.000042585765,0.99442554,0.0007143606,0.00019125536,0.0017756226,0.00066606264],"about_ca_topic_score_codex":0.0000813547,"about_ca_topic_score_gemma":0.0007198809,"teacher_disagreement_score":0.9285611,"about_ca_system_score_codex":0.0001880444,"about_ca_system_score_gemma":0.00012563083,"threshold_uncertainty_score":0.99964684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032338776,0.0011881316,0.96095234,0.0027782843,0.00055865466,0.0006514575,0.0000028710535,0.00037077305,0.0011587311],"genre_scores_gemma":[0.98047334,0.00003772928,0.016201995,0.0010602917,0.0009057992,0.00074234634,0.000031040767,0.00004849144,0.0004989699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966333,0.00011555524,0.00057507935,0.0010643516,0.0006660916,0.00094562856],"domain_scores_gemma":[0.99752694,0.0002454726,0.00017135436,0.0009413425,0.00043097505,0.00068392704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014742276,0.000355387,0.00039111904,0.00023711375,0.0003507127,0.0004604759,0.0010331084,0.000190174,0.0000029082044],"category_scores_gemma":[0.00003834504,0.0003835613,0.00006573253,0.0026644364,0.000054671716,0.00015025577,0.00080049,0.0004498987,0.00002815319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009965362,0.00007412285,0.0012925,0.0000030024328,0.000013059146,0.0000050792382,0.0004379211,0.7284087,0.000021099613,0.016441718,0.0020201996,0.25127262],"study_design_scores_gemma":[0.00042956843,0.000041172272,0.0006998732,0.000089987574,0.000011309584,0.000010392431,0.000067431334,0.8910797,0.000016911732,0.00056312344,0.10657536,0.00041512048],"about_ca_topic_score_codex":0.00008629761,"about_ca_topic_score_gemma":0.000117314215,"teacher_disagreement_score":0.94813454,"about_ca_system_score_codex":0.00019325948,"about_ca_system_score_gemma":0.00007581755,"threshold_uncertainty_score":0.99986166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015844855,0.00012778777,0.9807239,0.00010332212,0.0008353787,0.00048583274,3.1807187e-7,0.00029075742,0.0015878517],"genre_scores_gemma":[0.7386899,0.000012705596,0.25904873,0.0012609113,0.00050565327,0.000061249295,0.0000033360755,0.00001727474,0.00040023896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984833,0.000029278102,0.00032515248,0.0004078844,0.00018109362,0.0005732812],"domain_scores_gemma":[0.998549,0.00059680134,0.000093062445,0.00051699067,0.00009043548,0.0001537212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011362268,0.00015786072,0.00020222864,0.00006143268,0.00020627018,0.00017511882,0.00070926314,0.000107317115,0.000019070174],"category_scores_gemma":[0.000023716177,0.0001340357,0.00012653133,0.00035984113,0.000028312019,0.00029107596,0.00014421057,0.00012861313,0.000007694596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071349634,0.00006030017,0.00030345388,0.000011026803,0.000048084574,0.000015508433,0.00020732215,0.021773135,0.0011705365,0.31499678,0.013958026,0.64738446],"study_design_scores_gemma":[0.0012599785,0.000048773894,0.00007201355,0.000008496949,0.000004826044,0.0000075246253,0.000010471107,0.99254113,0.0012372065,0.0014997431,0.0031109976,0.0001988187],"about_ca_topic_score_codex":0.000011446318,"about_ca_topic_score_gemma":0.00007669026,"teacher_disagreement_score":0.97076803,"about_ca_system_score_codex":0.000025774503,"about_ca_system_score_gemma":0.000028311779,"threshold_uncertainty_score":0.5465817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023074921,0.005852812,0.9605031,0.00004604031,0.0023590198,0.00036787707,0.0000014215096,0.0005340693,0.0072607524],"genre_scores_gemma":[0.7621468,0.00046520564,0.23603788,0.00055803696,0.0005846085,0.000020990741,0.0000063305247,0.00006805697,0.000112094494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970012,0.000094872885,0.00056593615,0.0008687405,0.0003856726,0.0010836169],"domain_scores_gemma":[0.9978717,0.0001447254,0.00029128464,0.0012357123,0.00010739982,0.0003491764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052201684,0.00041225794,0.00038927147,0.00012722466,0.0003452252,0.0002779328,0.0015972157,0.0002731777,0.00017989006],"category_scores_gemma":[0.000009979017,0.0004249948,0.00019321377,0.00071283226,0.000118644486,0.00092736096,0.0005630803,0.00062840973,0.000106656975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035301888,0.0001656117,0.0008393821,0.000013239574,0.00010686579,0.00033578594,0.0012023557,0.059049346,0.00018161362,0.0025489097,0.0020429133,0.93347865],"study_design_scores_gemma":[0.0004557401,0.00009872265,0.002742966,0.00010778963,0.000027683122,0.00015279977,0.00004186548,0.9863907,0.0002290332,0.00090046134,0.008235063,0.0006171519],"about_ca_topic_score_codex":0.0000753743,"about_ca_topic_score_gemma":0.000023662305,"teacher_disagreement_score":0.9328615,"about_ca_system_score_codex":0.00013846249,"about_ca_system_score_gemma":0.000082887855,"threshold_uncertainty_score":0.9998202},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001418443,3.0169855e-7,0.91864353,0.00021108256,0.00020619702,0.07343806,4.95297e-7,0.0003995166,0.0070866235],"genre_scores_gemma":[0.36721063,2.668284e-7,0.051165186,0.0016001784,0.000973582,0.57607836,0.000008325294,0.00004956691,0.0029139097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982698,0.000076949065,0.00035650158,0.0005342673,0.0001990355,0.0005634211],"domain_scores_gemma":[0.9984085,0.0003231941,0.000157118,0.0008121432,0.00011135995,0.00018768616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872169,0.00019942435,0.00023460928,0.000036909118,0.00021718578,0.00023804253,0.0010782825,0.00012160016,0.000052941166],"category_scores_gemma":[0.00004203033,0.0001704247,0.00009398815,0.0002226385,0.00003681717,0.0002759595,0.00029331818,0.00015787243,0.000019219393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015489504,0.00005756094,0.00058546383,0.00004599104,0.0000126890845,0.0000039604074,0.000044511362,0.004369025,0.000008670421,0.6919206,0.0122595355,0.2906765],"study_design_scores_gemma":[0.00068924506,0.00013226848,0.00010315733,0.000041533338,0.000003438038,0.0000067073147,0.0000053654794,0.967458,0.00003784001,0.0018801768,0.029410735,0.0002315004],"about_ca_topic_score_codex":0.000010476843,"about_ca_topic_score_gemma":0.000012409747,"teacher_disagreement_score":0.963089,"about_ca_system_score_codex":0.000036826765,"about_ca_system_score_gemma":0.000065841574,"threshold_uncertainty_score":0.69497174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038215604,0.000006977062,0.9892703,0.00012827056,0.0020244163,0.00018151639,1.679386e-7,0.0002675285,0.0042992462],"genre_scores_gemma":[0.9740429,0.000006348887,0.02416892,0.00042002677,0.00086483883,0.00002825337,0.0000025804193,0.00001468736,0.00045142506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824613,0.0001572094,0.00036586105,0.0004897021,0.00021596016,0.0005251046],"domain_scores_gemma":[0.9987314,0.00029972068,0.000097491815,0.0006723114,0.0000458375,0.00015325639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000858583,0.00016905551,0.00023829358,0.000065858556,0.000078829245,0.00018466251,0.00093848445,0.000114256276,0.000025763607],"category_scores_gemma":[0.00008655366,0.00015787467,0.00005175014,0.00042164195,0.000034722187,0.00030585923,0.00039236253,0.0002511619,0.000044157983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007699644,0.00011437998,0.0035879316,0.0000071484255,0.00000846483,0.000042876796,0.00022299723,0.008838186,0.00009129845,0.8165999,0.0013339418,0.16914514],"study_design_scores_gemma":[0.0006268532,0.00003525224,0.0009794735,0.000029996187,0.0000020013003,0.000005987045,0.000008128268,0.9963942,0.00001458665,0.00040163833,0.0012966113,0.00020523672],"about_ca_topic_score_codex":0.00013838212,"about_ca_topic_score_gemma":0.00023700745,"teacher_disagreement_score":0.98755604,"about_ca_system_score_codex":0.000061945495,"about_ca_system_score_gemma":0.000055131357,"threshold_uncertainty_score":0.64379424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012590872,0.0016040431,0.98229635,0.000066454224,0.0009531588,0.0010598819,0.0000024082653,0.00045996974,0.00096688856],"genre_scores_gemma":[0.9779951,0.0009018258,0.019509304,0.00064870843,0.00024704926,0.0003237391,0.0000137364905,0.00009624992,0.00026431555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955428,0.0003443251,0.0007546073,0.0013792627,0.00041271254,0.0015662677],"domain_scores_gemma":[0.99720913,0.0002758331,0.00029770524,0.0015118413,0.0002589068,0.00044659793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006747287,0.00069661206,0.00076503755,0.00017894099,0.0002756993,0.0002233955,0.0018696199,0.00044348676,0.00006677216],"category_scores_gemma":[0.000019154859,0.0005992425,0.00012637548,0.0016088082,0.00031186576,0.0009856123,0.00067803427,0.0011782567,0.00006557433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777212,0.0015017756,0.007651367,0.000031129963,0.00025962063,0.001593842,0.00901641,0.8485303,0.000010180409,0.021394933,0.0022790616,0.107153654],"study_design_scores_gemma":[0.0021892905,0.0004285163,0.0055317017,0.00021910458,0.000020690111,0.00006334972,0.00015691033,0.99016565,0.00006127574,0.0001039253,0.00025005746,0.0008095351],"about_ca_topic_score_codex":0.00011072285,"about_ca_topic_score_gemma":0.0026153014,"teacher_disagreement_score":0.9654042,"about_ca_system_score_codex":0.00014531543,"about_ca_system_score_gemma":0.00011386931,"threshold_uncertainty_score":0.9996459},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031022485,0.0002953804,0.9648057,0.00038243545,0.0004522827,0.0026684697,0.0000015276662,0.000057980153,0.00031369345],"genre_scores_gemma":[0.54935366,0.000009278992,0.4485662,0.00024738754,0.0016027098,0.00010572555,0.0000023587088,0.000027644512,0.000085057814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973156,0.00012174945,0.0008084622,0.0004992991,0.0007421018,0.00051280536],"domain_scores_gemma":[0.99729884,0.00063000433,0.0007572372,0.0002308488,0.0008184225,0.00026466753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010638424,0.0002899769,0.00042375294,0.00019797114,0.00023295514,0.0008953908,0.0013604959,0.00012596938,0.0000015347324],"category_scores_gemma":[0.000049636623,0.00023937142,0.00013527401,0.00026753577,0.0000630068,0.00056363444,0.00037624224,0.0005368972,9.896166e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013262968,0.00024258268,0.0010446605,0.000018087156,0.00021295037,0.00010645133,0.0010981559,0.50010544,0.00041609522,0.010565902,0.0018636367,0.48299974],"study_design_scores_gemma":[0.0031315323,0.0013657482,0.0042453445,0.0006456704,0.000023726127,0.0011764488,0.000059118513,0.9817536,0.0007782827,0.0023012834,0.0040479144,0.00047132384],"about_ca_topic_score_codex":0.000009486277,"about_ca_topic_score_gemma":0.0000058969345,"teacher_disagreement_score":0.51833117,"about_ca_system_score_codex":0.00017656037,"about_ca_system_score_gemma":0.00029499206,"threshold_uncertainty_score":0.97612834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014255993,0.004830273,0.91645265,0.03432091,0.00044786677,0.0007565302,0.0000124834405,0.0003206213,0.028602682],"genre_scores_gemma":[0.870282,0.00055054604,0.11440566,0.0008091582,0.0010681868,0.0002858395,0.00015977898,0.00004038697,0.012398418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970634,0.00037173126,0.00059652823,0.0008387746,0.00041376607,0.0007157988],"domain_scores_gemma":[0.9979522,0.00028756398,0.00025317862,0.0010513806,0.00028284162,0.00017279881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009938708,0.00032688634,0.00024520268,0.000116106705,0.0004359253,0.00023965425,0.00071077136,0.00034683754,0.00017386179],"category_scores_gemma":[0.00003935788,0.00036608725,0.00013792086,0.00067918905,0.0002514557,0.00087709446,0.00014613567,0.00034319106,0.00063267956],"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.000016863863,0.0003968165,0.0012833442,0.00006461933,0.000012871874,0.0000087880935,0.0003554275,0.013881063,0.0025715039,0.7056147,0.023379873,0.2524141],"study_design_scores_gemma":[0.00070562266,0.00013362046,0.04753273,0.00012260285,0.000041503226,0.000086167325,0.0001433879,0.6741585,0.001923453,0.17617236,0.098458946,0.00052107906],"about_ca_topic_score_codex":0.0057266667,"about_ca_topic_score_gemma":0.0043356344,"teacher_disagreement_score":0.85602605,"about_ca_system_score_codex":0.0007497626,"about_ca_system_score_gemma":0.00066029304,"threshold_uncertainty_score":0.9998791},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07371391,0.0016509213,0.92019653,0.000010932623,0.00031539946,0.00067448715,7.0415405e-7,0.00037499724,0.0030620822],"genre_scores_gemma":[0.72375625,0.000021486947,0.27569464,0.00028872816,0.000102876824,0.000035362635,0.0000043023074,0.00002614687,0.00007016245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967949,0.00017828163,0.00065514375,0.00089426467,0.00039756915,0.0010798874],"domain_scores_gemma":[0.99826664,0.00025343196,0.00019424544,0.0009915311,0.00007018673,0.00022399182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024988109,0.0003306526,0.000384829,0.0001779998,0.00017417144,0.00020208265,0.0011565316,0.00024955548,0.000035239227],"category_scores_gemma":[0.000031089585,0.00031907563,0.00012780352,0.001238826,0.00007056727,0.0004438368,0.0004282728,0.00057760946,0.000009629184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004369625,0.0009028828,0.013213906,0.000039634422,0.000020122077,0.00017751966,0.0016748678,0.88107497,0.00015702807,0.004967796,0.00021008676,0.09751749],"study_design_scores_gemma":[0.0010031217,0.000051599756,0.0011454963,0.000048628506,0.000005399733,0.00001158499,0.00019324438,0.9960869,0.00020938438,0.00007371451,0.0007840153,0.00038691098],"about_ca_topic_score_codex":0.00006657163,"about_ca_topic_score_gemma":0.00023108808,"teacher_disagreement_score":0.65004236,"about_ca_system_score_codex":0.00025701386,"about_ca_system_score_gemma":0.00010168647,"threshold_uncertainty_score":0.99992615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041656986,0.00058881374,0.9547604,0.0006367661,0.00089014426,0.00082508463,0.000016228172,0.00031865318,0.00030696078],"genre_scores_gemma":[0.94567555,0.0005496976,0.051784936,0.00024419418,0.00009667251,0.001348633,0.000013243446,0.000053270767,0.00023382036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975106,0.000257947,0.00066830794,0.00047692104,0.0002468424,0.000839383],"domain_scores_gemma":[0.9946115,0.0011693806,0.00018990604,0.0036041122,0.00018804574,0.00023706803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075562735,0.00031823295,0.00034961654,0.00027355345,0.0008750941,0.00021832087,0.002813526,0.00026676295,0.000021736105],"category_scores_gemma":[0.0000097844295,0.00034987848,0.00021121149,0.001040695,0.000231023,0.0012993678,0.00004291276,0.0008626765,0.00003596167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000720468,0.002708931,0.0014636794,0.000048095553,0.00014888759,0.0000019345523,0.0027877588,0.3642986,0.0016982865,0.03721502,0.00039234586,0.5891644],"study_design_scores_gemma":[0.00088523515,0.00004967994,0.0005843394,0.00012455693,0.000022056649,0.000014463738,0.000048687263,0.988464,0.0041338895,0.0000836949,0.005155103,0.0004343061],"about_ca_topic_score_codex":0.00015470292,"about_ca_topic_score_gemma":0.00039438542,"teacher_disagreement_score":0.9040185,"about_ca_system_score_codex":0.00023139243,"about_ca_system_score_gemma":0.000092727,"threshold_uncertainty_score":0.99989533},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015104904,0.00068023015,0.9810697,0.000061573126,0.00048243545,0.000131657,0.0000011206278,0.00023593655,0.0022324568],"genre_scores_gemma":[0.9038456,0.00019503635,0.09520643,0.00036859754,0.00006089646,0.000029770183,0.000008561924,0.000023379638,0.0002617414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976858,0.00013448269,0.00037204233,0.0009036475,0.00025746776,0.0006465776],"domain_scores_gemma":[0.99733347,0.00012369323,0.000072264666,0.0022474674,0.0000304782,0.00019265233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005162236,0.00021600783,0.00024374195,0.00009924419,0.000071611656,0.00008995265,0.0033118885,0.00013607583,0.00007419854],"category_scores_gemma":[0.00001192263,0.00019106704,0.00004368469,0.0005691685,0.000080104146,0.00030250076,0.0025870653,0.00033249348,0.000025834715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033534863,0.0006503977,0.0009326412,0.000008352446,0.000025658475,0.00020593064,0.0012618712,0.048647918,0.000088511224,0.062391367,0.00078068895,0.8849731],"study_design_scores_gemma":[0.0004261365,0.000039481514,0.001653304,0.000032663345,0.0000021700891,0.000011820427,0.000016048798,0.99470896,0.00008377202,0.00012908534,0.0026485594,0.00024798478],"about_ca_topic_score_codex":0.00019275818,"about_ca_topic_score_gemma":0.0010440256,"teacher_disagreement_score":0.9460611,"about_ca_system_score_codex":0.00004701513,"about_ca_system_score_gemma":0.0000505026,"threshold_uncertainty_score":0.77914876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10809681,0.0000044854623,0.42408416,0.0026321202,0.00054531184,0.047624074,0.0000031233792,0.0005985111,0.4164114],"genre_scores_gemma":[0.9953,1.058932e-7,0.0006482462,0.0004994189,0.000069756046,0.0023258964,7.1756125e-7,0.000010934907,0.0011449107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985692,0.0002645917,0.00021927827,0.00028560896,0.00041538983,0.00024592146],"domain_scores_gemma":[0.99779975,0.00092444906,0.00012702639,0.0009778686,0.000052420295,0.00011848173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013702743,0.00014080163,0.00018581601,0.00002983176,0.000051721985,0.00008240549,0.0009638493,0.0000493586,0.0000376701],"category_scores_gemma":[0.00027862613,0.000077322955,0.000057781355,0.00022090899,0.00006525423,0.00009239493,0.00022371749,0.00017030985,0.00027828713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012145915,0.00013387894,0.0007452425,0.000045624918,0.000030108997,0.000034613196,0.00044318655,0.025944903,0.000120207966,0.8432829,0.09552195,0.03357595],"study_design_scores_gemma":[0.0009219797,0.0042169504,0.00019339134,0.0002284322,0.0000060956763,0.0000027281783,0.000016342496,0.98201597,0.0065312106,0.0014977596,0.004149366,0.00021980102],"about_ca_topic_score_codex":0.000008321006,"about_ca_topic_score_gemma":0.000002124858,"teacher_disagreement_score":0.956071,"about_ca_system_score_codex":0.00004106547,"about_ca_system_score_gemma":0.000058702586,"threshold_uncertainty_score":0.3576911},"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":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017333375,0.0000573638,0.5122496,0.008538746,0.00027999966,0.367592,0.000053392872,0.0007360634,0.09315945],"genre_scores_gemma":[0.64264905,0.0000045581446,0.010856708,0.001109233,0.00007557477,0.34094444,0.0000034809455,0.000017893979,0.004339086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983515,0.00029281873,0.0003344181,0.00036412996,0.0003643647,0.00029275398],"domain_scores_gemma":[0.99662685,0.0007656488,0.00025010575,0.001921216,0.00026116363,0.00017500452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036587642,0.00014834577,0.0002028007,0.00006302669,0.0002632438,0.00015707478,0.0022316142,0.00004598314,0.00068453443],"category_scores_gemma":[0.00022371815,0.00006822449,0.00025503387,0.0017340146,0.00019968228,0.0002769151,0.0006955707,0.00014199362,0.00009944917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006187608,0.0007501395,0.013665539,0.000024242687,0.0021689965,0.000004996033,0.0007157434,0.0026157307,0.0013274438,0.224412,0.10906657,0.6451867],"study_design_scores_gemma":[0.00040888513,0.000033845175,0.13375153,0.000012600067,0.00010514882,0.0000015947114,0.00003944246,0.82504284,0.0028448284,0.0017812395,0.035792086,0.00018592663],"about_ca_topic_score_codex":0.00092686526,"about_ca_topic_score_gemma":0.00023885081,"teacher_disagreement_score":0.82242715,"about_ca_system_score_codex":0.000031305462,"about_ca_system_score_gemma":0.00009105038,"threshold_uncertainty_score":0.7495172},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13571966,0.0000057095294,0.8610105,0.00009538552,0.0010443248,0.00069678825,6.578616e-7,0.00012957872,0.0012974164],"genre_scores_gemma":[0.978207,0.0000058867317,0.020177651,0.00018071798,0.00015442919,0.00050209893,0.000007810508,0.000011695169,0.0007526942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988173,0.000024621873,0.00025396098,0.00040260836,0.00014383649,0.00035764405],"domain_scores_gemma":[0.9989724,0.00013084641,0.0000720204,0.00067069766,0.00006664411,0.00008736938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038420057,0.00011373624,0.00013372648,0.00006512557,0.00006413788,0.00011909553,0.0008336329,0.00012265072,0.000043317767],"category_scores_gemma":[0.0000122131005,0.00010534527,0.00005138808,0.0003263188,0.000033681375,0.00033141766,0.0001761627,0.00021503973,0.00003092624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010703469,0.00024824665,0.0058380715,0.000011222997,0.0000095283995,0.0000022166967,0.00043031876,0.0027942578,0.0015372959,0.6602464,0.0028637962,0.326008],"study_design_scores_gemma":[0.0003545525,0.000043903972,0.003705227,0.0000075045227,0.0000020811078,0.000002245058,0.000011012531,0.9920564,0.00038205134,0.0016063221,0.0016905495,0.00013811763],"about_ca_topic_score_codex":0.000017641007,"about_ca_topic_score_gemma":0.00024872937,"teacher_disagreement_score":0.98926216,"about_ca_system_score_codex":0.000021341786,"about_ca_system_score_gemma":0.000027942904,"threshold_uncertainty_score":0.42958558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010640224,0.0018116566,0.99139094,0.0011048635,0.00382738,0.00057320617,0.00011847657,0.00009684251,0.000012621706],"genre_scores_gemma":[0.7809549,0.00009246111,0.2166487,0.0006214853,0.0013165418,0.00004827357,0.00024671276,0.000048962538,0.000021971397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582267,0.00028915436,0.0011150242,0.0005228818,0.0016454852,0.0006048117],"domain_scores_gemma":[0.993656,0.00078518374,0.0011007756,0.00040820078,0.0033231417,0.00072672346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021073972,0.0004291502,0.00061433244,0.00022994114,0.00016065718,0.0005175764,0.0011664594,0.00032238124,0.00002784832],"category_scores_gemma":[0.00036286516,0.0003892464,0.00026962653,0.0003471087,0.000106692234,0.0006933834,0.00007135107,0.00059516064,0.0000062757904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043691212,0.00018455858,0.00022815348,0.0000070284473,0.000183601,0.000079963684,0.00002702716,0.7743183,0.00005795284,0.000015447215,0.015960636,0.20850043],"study_design_scores_gemma":[0.009994234,0.0004974531,0.00016322364,0.0003692485,0.00009967953,0.00009412781,0.000013560808,0.9844816,0.00036152045,0.00010065281,0.003444656,0.00038006],"about_ca_topic_score_codex":0.0000063628163,"about_ca_topic_score_gemma":0.000011611346,"teacher_disagreement_score":0.77989084,"about_ca_system_score_codex":0.00054491847,"about_ca_system_score_gemma":0.0005707017,"threshold_uncertainty_score":0.99985594},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14529492,0.00070066407,0.8496479,0.00040537308,0.001990401,0.0015257867,0.00003061677,0.0001672445,0.000237117],"genre_scores_gemma":[0.96526855,0.000562419,0.03278624,0.00012352665,0.00029287365,0.0008354591,0.000056983816,0.000031383108,0.000042543168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929176,0.0049127946,0.00081754324,0.00055802095,0.00022091849,0.00057310564],"domain_scores_gemma":[0.98698026,0.008633863,0.00029526398,0.00342716,0.000508131,0.00015529465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010982201,0.0002724029,0.0005408913,0.000109914545,0.00042307877,0.00048123384,0.0029393157,0.0002501956,0.000006887278],"category_scores_gemma":[0.0005752092,0.0002805204,0.00007878085,0.0008126713,0.00030247046,0.0009458962,0.0007532734,0.0003997254,0.000020298472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007220565,0.0022885448,0.23223916,0.00018863822,0.0005367751,0.000007241881,0.0073468983,0.03097495,0.0042849225,0.23798056,0.04003208,0.44404802],"study_design_scores_gemma":[0.0012468862,0.00007191334,0.15781608,0.00011319169,0.000015004679,0.0000096300155,0.000026441227,0.82822806,0.00018490288,0.0069338907,0.0046204594,0.0007335349],"about_ca_topic_score_codex":0.01040143,"about_ca_topic_score_gemma":0.014923065,"teacher_disagreement_score":0.81997365,"about_ca_system_score_codex":0.000121436424,"about_ca_system_score_gemma":0.000107812295,"threshold_uncertainty_score":0.9999647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009663032,0.004291804,0.99014646,0.0009139974,0.0014650507,0.0014995484,0.0000034174434,0.00045286267,0.0002605856],"genre_scores_gemma":[0.88128793,0.0014467323,0.11373166,0.0013154164,0.0013436502,0.00059407763,0.00003677466,0.000115550974,0.00012822625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950042,0.00021699489,0.0011811905,0.0012123178,0.00053375424,0.0018515526],"domain_scores_gemma":[0.9940148,0.0033455777,0.0005039256,0.0015500693,0.00024499604,0.00034065885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021206816,0.0006278012,0.00066076836,0.00020157616,0.0004974907,0.00045451053,0.0023078064,0.00082699215,0.000024481178],"category_scores_gemma":[0.000059766055,0.00052873616,0.00026593189,0.002051584,0.00030141865,0.0005024176,0.0005206385,0.0010875607,0.0000060842262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012303262,0.00011661353,0.00034980642,0.00001274985,0.000045829023,0.000029083496,0.00024775535,0.43168777,0.0000050364965,0.121748775,0.0005356093,0.44509792],"study_design_scores_gemma":[0.0012331869,0.00012695488,0.00082679285,0.0003155678,0.000029166296,0.00002915902,0.0000720088,0.9879397,0.00002324378,0.0045879968,0.004190893,0.0006253272],"about_ca_topic_score_codex":0.00003353097,"about_ca_topic_score_gemma":0.0004968567,"teacher_disagreement_score":0.8803216,"about_ca_system_score_codex":0.00020528072,"about_ca_system_score_gemma":0.00012508177,"threshold_uncertainty_score":0.9997164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089282535,0.00018023033,0.903316,0.001068502,0.0005970457,0.001370016,0.0000011675005,0.00034060597,0.0038438633],"genre_scores_gemma":[0.9701153,0.000028733693,0.027373828,0.0014585836,0.00028379858,0.00038477438,0.0000057309753,0.000021290567,0.00032797296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976263,0.00008438821,0.00037744213,0.00087236427,0.00022023002,0.00081924826],"domain_scores_gemma":[0.9977863,0.00069090264,0.00011855799,0.0009872245,0.00019813757,0.00021886657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139148,0.00027743788,0.0003026921,0.00006711529,0.00036526055,0.00046459923,0.000687075,0.00016280281,0.00007836019],"category_scores_gemma":[0.00007167514,0.00022550304,0.00012142983,0.00045296803,0.000113109505,0.00080256676,0.00043068017,0.00025028316,0.00002074375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057438396,0.00052493514,0.31033403,0.00010566235,0.00016522528,0.000015820393,0.0003856508,0.059544124,0.000038763374,0.33419916,0.047838353,0.24679084],"study_design_scores_gemma":[0.00042118938,0.0002435864,0.04110809,0.000028116832,0.0000075286302,0.000009413653,0.000020224556,0.94748545,0.000027856777,0.008011776,0.002339902,0.00029683934],"about_ca_topic_score_codex":0.00059059256,"about_ca_topic_score_gemma":0.0001230617,"teacher_disagreement_score":0.88794136,"about_ca_system_score_codex":0.00005072615,"about_ca_system_score_gemma":0.000033044515,"threshold_uncertainty_score":0.9195747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05212669,0.0004558395,0.9411032,0.00011883823,0.005296968,0.00031242872,1.611776e-7,0.000066930945,0.00051892194],"genre_scores_gemma":[0.9863667,0.00015683338,0.010741135,0.00041220328,0.0022198623,0.0000127029325,9.1742993e-7,0.000032907625,0.000056733752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996551,0.00014773771,0.0015986089,0.00041338187,0.00045103623,0.00083827926],"domain_scores_gemma":[0.99588174,0.0015737243,0.0012224374,0.00038552654,0.00071752194,0.00021904433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005900964,0.00028784235,0.00060831045,0.0005852602,0.00014425824,0.00021826875,0.0009803073,0.00030700478,0.000012975982],"category_scores_gemma":[0.00036083025,0.0002713295,0.00033874254,0.0019096595,0.000034571192,0.0010115741,0.00016619966,0.0010360174,0.0000019112001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049760664,0.00021738817,0.0020135078,0.000027278888,0.00016965062,0.000097218304,0.0008898323,0.5434613,0.0011572102,0.018782254,0.0021903722,0.43049634],"study_design_scores_gemma":[0.0015078373,0.00045601526,0.0013981595,0.0004493982,0.000021881013,0.0002413526,0.00019449198,0.99291396,0.0016861286,0.00043894624,0.00037742654,0.00031442643],"about_ca_topic_score_codex":0.000025250854,"about_ca_topic_score_gemma":0.00034640703,"teacher_disagreement_score":0.93424004,"about_ca_system_score_codex":0.00083318725,"about_ca_system_score_gemma":0.000118006195,"threshold_uncertainty_score":0.9999739},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012458651,0.000003860572,0.79173124,0.000689939,0.00029971477,0.12239502,4.9452503e-8,0.0005724592,0.07184909],"genre_scores_gemma":[0.54286236,2.0231246e-7,0.10218502,0.00084444333,0.00022474925,0.35224956,1.4131253e-7,0.000016936796,0.0016166006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989629,0.00004695104,0.00021479966,0.00030071076,0.00015001408,0.00032466988],"domain_scores_gemma":[0.99926746,0.00007754915,0.000046920435,0.00049844757,0.000039196744,0.00007042604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002137539,0.00009581276,0.00010073495,0.000057166413,0.000041045216,0.0001859991,0.0006784869,0.000056656085,0.0003436282],"category_scores_gemma":[0.000024886638,0.00007965477,0.000027213327,0.00037831205,0.0000135282835,0.0005987751,0.00030263825,0.00016900379,0.00064644107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043242662,0.00014885022,0.018517273,0.00004731305,0.0000088672505,0.000031030253,0.00075860816,0.0023789078,0.0015971496,0.024162186,0.018865582,0.9334799],"study_design_scores_gemma":[0.0009196472,0.00013348713,0.017106777,0.000057076486,6.476663e-7,0.000019149526,0.000040562885,0.9516276,0.005332313,0.0053053806,0.019049972,0.00040738386],"about_ca_topic_score_codex":0.00021360499,"about_ca_topic_score_gemma":0.00012030246,"teacher_disagreement_score":0.9492487,"about_ca_system_score_codex":0.000038640806,"about_ca_system_score_gemma":0.00002664917,"threshold_uncertainty_score":0.8308908},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44275093,0.0015228887,0.5531526,0.0022089055,0.00024814345,0.00008300744,5.624832e-8,0.000028680668,0.000004789996],"genre_scores_gemma":[0.884295,0.00044477943,0.1149747,0.00021046767,0.00006724941,0.0000022208962,7.014546e-8,0.0000040090226,0.000001525591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844015,0.00002650673,0.00044386438,0.0003472767,0.00036839236,0.00037378859],"domain_scores_gemma":[0.998954,0.0000657791,0.0003294092,0.00027274352,0.00031006805,0.00006799685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015702891,0.00011963626,0.00023520403,0.00059701235,0.00019884507,0.00024130274,0.0010350565,0.000121821155,1.9297966e-7],"category_scores_gemma":[0.00009541468,0.00009989119,0.000018005958,0.0018973845,0.00037303552,0.0013691159,0.0006300841,0.0004650105,3.5491433e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010610363,0.0000712377,0.005642401,0.0000060191114,0.000006210393,0.00010586871,0.0007152447,0.009981776,0.0016808271,0.015642326,0.00015149104,0.965986],"study_design_scores_gemma":[0.001407815,0.00079770235,0.0048277117,0.00029843798,0.0000033829103,0.00071481726,0.000060619586,0.97932357,0.00083822524,0.010795781,0.0007351273,0.00019683296],"about_ca_topic_score_codex":0.000004628438,"about_ca_topic_score_gemma":0.000009801537,"teacher_disagreement_score":0.96934175,"about_ca_system_score_codex":0.000095248484,"about_ca_system_score_gemma":0.00019683944,"threshold_uncertainty_score":0.40734446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017326633,0.000014173867,0.96229726,0.000110205656,0.00035700694,0.0002906341,2.876026e-7,0.00047743585,0.01912639],"genre_scores_gemma":[0.9925666,0.0000024683332,0.0067890184,0.00021704643,0.00020095616,0.00009540659,0.0000037682262,0.00001661529,0.00010813161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982882,0.00017070262,0.00034160845,0.000529595,0.0002501471,0.00041972572],"domain_scores_gemma":[0.99903816,0.00022142386,0.00014050031,0.0004011131,0.00011681291,0.00008198234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008298858,0.00015526067,0.00022243106,0.00015961596,0.00012982929,0.00015820551,0.00046419044,0.00008603871,0.0000016652943],"category_scores_gemma":[0.00006603412,0.00015202639,0.000056935798,0.0006753851,0.000012210552,0.00072646816,0.00020500513,0.0001839368,0.000040810417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016394675,0.00010592717,0.0038180992,0.00028889085,0.00006372573,0.000079348494,0.009439271,0.63008904,0.00043837578,0.12965888,0.0024926206,0.2235094],"study_design_scores_gemma":[0.00026787206,0.000042795276,0.0005144912,0.00016522962,0.0000019633683,0.000010301899,0.0005762944,0.9967731,0.00095436076,0.00037954724,0.00012682099,0.00018722194],"about_ca_topic_score_codex":0.000042817566,"about_ca_topic_score_gemma":0.0000555178,"teacher_disagreement_score":0.97523993,"about_ca_system_score_codex":0.0002616362,"about_ca_system_score_gemma":0.00003292536,"threshold_uncertainty_score":0.61994565},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022293701,5.137558e-7,0.8862037,0.0003231122,0.00054145034,0.11107568,0.000003861246,0.00044524609,0.0011835033],"genre_scores_gemma":[0.10893165,2.2096258e-7,0.24964575,0.0017698349,0.0012060107,0.6376108,0.000011718092,0.00005242817,0.0007715666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976222,0.000058035785,0.00042969495,0.0007645597,0.00032089162,0.0008046192],"domain_scores_gemma":[0.9976572,0.0002841655,0.00022275446,0.0010173569,0.00059365877,0.00022486459],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007720693,0.00029517373,0.0002888239,0.000030593106,0.0002887454,0.00033796282,0.0016677572,0.00025106705,0.00006498102],"category_scores_gemma":[0.000073758056,0.0002553493,0.00012125923,0.0005746753,0.0000470123,0.00052456086,0.0006262528,0.0005425104,0.000041421103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019466558,0.0009234428,0.0029060019,0.00018825466,0.00013340484,0.000032116543,0.0012974133,0.002945964,0.0027309768,0.787774,0.03038356,0.1704902],"study_design_scores_gemma":[0.0018404151,0.00007066811,0.00046114792,0.000037278704,0.0000051764227,0.000010861908,0.000019475598,0.9827645,0.0015747631,0.00023340556,0.012637115,0.00034518796],"about_ca_topic_score_codex":0.00012754982,"about_ca_topic_score_gemma":0.00095524616,"teacher_disagreement_score":0.9798185,"about_ca_system_score_codex":0.00008303312,"about_ca_system_score_gemma":0.00022404194,"threshold_uncertainty_score":0.99998987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11387871,0.0005095951,0.8803548,0.004549238,0.00008743618,0.00028347547,8.192861e-7,0.00007581131,0.00026006135],"genre_scores_gemma":[0.8490221,0.00006308632,0.15049598,0.00036622057,0.00001376163,0.000023766383,4.4426392e-7,0.0000050522945,0.000009632917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915624,0.00016606823,0.00021254405,0.00019768362,0.0001304998,0.0001369614],"domain_scores_gemma":[0.996575,0.00012036087,0.00010823117,0.0030240894,0.00012659788,0.000045751236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026155682,0.00010244038,0.00017382568,0.000028338487,0.00033908326,0.00006958034,0.00225055,0.000042226875,2.6634262e-7],"category_scores_gemma":[0.0000229617,0.00007318081,0.00006700633,0.00020328021,0.00031479346,0.00023361214,0.0031764614,0.00020752294,0.0000030106305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021134918,0.00058919576,0.0011259682,0.00005389299,0.00009137903,8.652257e-7,0.007991267,0.28999293,0.004546132,0.67550486,0.00041894274,0.019663444],"study_design_scores_gemma":[0.00068531,0.000013329635,0.0023957256,0.00007365768,0.000008342535,0.00001516588,0.0000066095035,0.9796081,0.0023758817,0.014627968,0.00009117752,0.00009873426],"about_ca_topic_score_codex":0.00007986068,"about_ca_topic_score_gemma":0.00010745962,"teacher_disagreement_score":0.73514336,"about_ca_system_score_codex":0.00003882232,"about_ca_system_score_gemma":0.00009797042,"threshold_uncertainty_score":0.41821194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018194582,0.010992361,0.9684344,0.00005197442,0.0009983899,0.0004555786,0.0000034287882,0.00012669561,0.00074260536],"genre_scores_gemma":[0.9197886,0.0023120719,0.0770087,0.00033149298,0.00016948271,0.0001837739,0.00005880089,0.000022559716,0.00012449872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980354,0.00008184148,0.0005362352,0.0004996652,0.00029670203,0.0005501874],"domain_scores_gemma":[0.9974756,0.0010771286,0.00026837434,0.00089689007,0.00017037983,0.00011159081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009578574,0.00021238578,0.00023045154,0.00010094798,0.00016766715,0.00012042067,0.0009842725,0.00016808107,0.00001765126],"category_scores_gemma":[0.000065768385,0.0002117401,0.00007032293,0.00046013697,0.00014508476,0.0008325583,0.00018271121,0.0002308967,0.000007137277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006095146,0.000119052536,0.0014529057,0.000010445594,0.000004977836,0.000005060331,0.0004561365,0.18129183,0.00016513217,0.011605291,0.00014208438,0.8046861],"study_design_scores_gemma":[0.0010353336,0.000056706936,0.006678273,0.000058514983,0.0000031157704,0.000001948742,0.000023364524,0.9561708,0.00084029324,0.00065599877,0.034223128,0.00025250332],"about_ca_topic_score_codex":0.000014319748,"about_ca_topic_score_gemma":0.00037217565,"teacher_disagreement_score":0.90159404,"about_ca_system_score_codex":0.00014161202,"about_ca_system_score_gemma":0.000037129485,"threshold_uncertainty_score":0.86345106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006122878,0.0000721602,0.9826189,0.0004945086,0.00056572235,0.0005695716,4.7114005e-7,0.0024754717,0.0070802774],"genre_scores_gemma":[0.65795577,0.000002614062,0.338292,0.002102722,0.00029110824,0.0001812141,0.0000028131174,0.00003114794,0.0011405885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982688,0.000053244625,0.0002812703,0.0005893144,0.00019088379,0.0006164776],"domain_scores_gemma":[0.9979623,0.0007382004,0.00007807557,0.0008187871,0.00017469036,0.00022797045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128044,0.00019983217,0.00023827088,0.000057206846,0.00017269042,0.00023344175,0.0009871685,0.00010951856,0.0000133128415],"category_scores_gemma":[0.00008468925,0.00017381118,0.000060946353,0.0006451493,0.00002069696,0.00025840863,0.0003667845,0.000112106354,0.00009083727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008386105,0.00003947023,0.00055798586,0.0000103656685,0.00001587614,0.000002911338,0.000107760476,0.062214393,0.00018620297,0.03884055,0.026577134,0.871439],"study_design_scores_gemma":[0.0002799575,0.00020442727,0.0014921351,0.0000393017,0.000004566439,0.000007425574,0.00000273147,0.99057764,0.00013249682,0.0012295481,0.005779003,0.00025077548],"about_ca_topic_score_codex":0.000011952271,"about_ca_topic_score_gemma":0.000053586657,"teacher_disagreement_score":0.92836326,"about_ca_system_score_codex":0.00004176584,"about_ca_system_score_gemma":0.00003201527,"threshold_uncertainty_score":0.7087814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026429063,0.028654752,0.9229832,0.00041863177,0.00017659082,0.020640044,0.000010275791,0.00037872622,0.00030870386],"genre_scores_gemma":[0.9251094,0.003143296,0.042397883,0.00020119392,0.000097687,0.028931798,0.000019487823,0.00004750779,0.000051746403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972076,0.00048137532,0.00067014334,0.000777976,0.00021905829,0.00064388046],"domain_scores_gemma":[0.9954565,0.001270122,0.0003871708,0.0024343876,0.0002184006,0.00023338111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013084537,0.00038281258,0.0006043845,0.00011282068,0.0011115354,0.0008880463,0.0026023353,0.000193027,0.0000030873298],"category_scores_gemma":[0.00003331883,0.0003743016,0.000097592565,0.00046844507,0.00039643564,0.0006356213,0.0014874381,0.0004124412,0.0000013424595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021499773,0.00037516054,0.001964672,0.00017481542,0.00009740133,0.0000016968145,0.0015500762,0.008995199,0.000094079754,0.048158675,0.00041369136,0.938153],"study_design_scores_gemma":[0.0014403048,0.00026948488,0.00035866542,0.00021865802,0.000024778175,0.000028855753,0.0002863583,0.913205,0.00013045594,0.00062275724,0.08295044,0.0004641973],"about_ca_topic_score_codex":0.000011025293,"about_ca_topic_score_gemma":0.0000326918,"teacher_disagreement_score":0.9376888,"about_ca_system_score_codex":0.00004703158,"about_ca_system_score_gemma":0.00010254985,"threshold_uncertainty_score":0.9998709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17663285,0.006155696,0.81476533,0.00021901938,0.00030052662,0.000981129,0.0000015424316,0.00018268522,0.00076118927],"genre_scores_gemma":[0.92812765,0.0007008272,0.069788724,0.0005992323,0.000048126178,0.0003013168,0.0000020040954,0.000018667612,0.00041347655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984888,0.00012964905,0.00028773546,0.00049927214,0.00012415263,0.00047040643],"domain_scores_gemma":[0.9988413,0.00034552882,0.00009086893,0.00045526103,0.00012433343,0.0001427131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002256644,0.00019653371,0.00026284592,0.000100281126,0.00015640722,0.0002656198,0.00035300525,0.00011899202,0.00015912445],"category_scores_gemma":[0.000025704696,0.00017963348,0.00003504206,0.00060172746,0.0000897577,0.0010359872,0.0003138087,0.0002449395,0.000023104989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042612894,0.0012493224,0.12683703,0.000079255406,0.00021447297,0.000092062866,0.008062381,0.21982029,0.0031369345,0.038444225,0.0052519417,0.59676945],"study_design_scores_gemma":[0.00080014986,0.00008343825,0.008295493,0.00003486834,0.0000046171003,0.000015593816,0.00034807948,0.9882244,0.00011063254,0.0007177571,0.0011244051,0.00024060564],"about_ca_topic_score_codex":0.00039552536,"about_ca_topic_score_gemma":0.0008255281,"teacher_disagreement_score":0.76840407,"about_ca_system_score_codex":0.000065415166,"about_ca_system_score_gemma":0.00005972822,"threshold_uncertainty_score":0.7325241},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788681,0.0011874335,0.018251674,0.0003164754,0.00042213209,0.00068837847,0.000026618454,0.00011158482,0.0001275922],"genre_scores_gemma":[0.7080123,0.00044961646,0.29062513,0.000048853493,0.00051193254,0.00026556387,0.000018268243,0.000040730323,0.000027629367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972221,6.5961665e-8,0.0008293001,0.00048508146,0.0007270824,0.00073633256],"domain_scores_gemma":[0.9979154,0.00024781638,0.00050713326,0.00010154044,0.0010332477,0.00019489265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009148382,0.00037631093,0.0004849296,0.0001236626,0.000102748614,0.00018194832,0.0016577649,0.00027340796,0.000010579002],"category_scores_gemma":[0.00017069606,0.00032751958,0.00039502291,0.0007733541,0.00019216706,0.0014426883,0.0003843991,0.0004799343,9.713353e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025241755,0.0020196817,0.017034607,0.0008604401,0.001438189,8.014573e-7,0.002695698,0.029523993,0.19591434,0.6461288,0.003407929,0.10072312],"study_design_scores_gemma":[0.000782234,0.00023944127,0.0046830806,0.00028470924,0.000061523424,0.000014212014,0.00057850394,0.9830099,0.008235139,0.00064750604,0.0010524492,0.00041134813],"about_ca_topic_score_codex":0.000008179234,"about_ca_topic_score_gemma":3.2900846e-7,"teacher_disagreement_score":0.95348585,"about_ca_system_score_codex":0.00030467476,"about_ca_system_score_gemma":0.000043502936,"threshold_uncertainty_score":0.9999177},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503849,0.0005709813,0.91974163,0.00039201757,0.0017880278,0.0011541276,0.000005353681,0.0009106167,0.00039872815],"genre_scores_gemma":[0.9676257,0.0004796224,0.027689632,0.0009217355,0.0024621699,0.0003954482,0.00004544972,0.00012632292,0.00025393962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425864,0.00031882248,0.001019031,0.0016052014,0.0006299605,0.0021683315],"domain_scores_gemma":[0.9955525,0.0013815053,0.00039421316,0.0017432438,0.00029353655,0.0006350097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008489008,0.0007231778,0.0009036665,0.00021044427,0.0012132635,0.00029528214,0.0021875878,0.0006664305,0.00001739168],"category_scores_gemma":[0.00004908011,0.0007218437,0.0005313749,0.0013498106,0.0004923401,0.0005708839,0.0007576662,0.0013067262,0.000022307591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022968305,0.00052931166,0.020926123,0.00005640366,0.00028908538,0.00048993947,0.000726636,0.63809943,0.000080113736,0.07379312,0.006539241,0.25824088],"study_design_scores_gemma":[0.0014984186,0.00015810499,0.0047627804,0.00012196171,0.000029041397,0.00025361066,0.000019518902,0.990005,0.00002764209,0.00021623276,0.0020605759,0.0008471075],"about_ca_topic_score_codex":0.00006008715,"about_ca_topic_score_gemma":0.00004795813,"teacher_disagreement_score":0.8925872,"about_ca_system_score_codex":0.000101101636,"about_ca_system_score_gemma":0.00011572848,"threshold_uncertainty_score":0.9995233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06980253,0.00004199911,0.928132,0.00031506454,0.0001703465,0.00013004671,8.196074e-7,0.00011737811,0.0012898188],"genre_scores_gemma":[0.78332615,0.0000046603154,0.2163704,0.00021104183,0.00007200597,0.0000044361586,6.501167e-7,0.000007349188,0.0000033164988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737173,0.00016042743,0.0002467513,0.0011391873,0.00047567033,0.00060623896],"domain_scores_gemma":[0.99773175,0.0004538757,0.00006525739,0.0014438565,0.000066791355,0.00023849757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025095926,0.00019771917,0.00025056928,0.00013256485,0.00020374206,0.0005747569,0.003985455,0.000039432412,0.000012165033],"category_scores_gemma":[0.00011917507,0.00015084991,0.000013992109,0.0009640509,0.0026538332,0.0010920556,0.0032291731,0.00029497713,0.000008941717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011333629,0.000020697395,0.0006690989,0.000008726959,0.0000019692675,0.000012633377,0.0005541583,0.0003367991,0.00014325083,0.8779737,0.000007292397,0.12026034],"study_design_scores_gemma":[0.00037884203,0.00021221298,0.0018285973,0.00013967862,0.0000023734945,0.00012194475,0.000007605236,0.9812674,0.000110127025,0.015589179,0.00011689789,0.00022514835],"about_ca_topic_score_codex":0.000009294455,"about_ca_topic_score_gemma":0.000008436805,"teacher_disagreement_score":0.98093057,"about_ca_system_score_codex":0.000040242667,"about_ca_system_score_gemma":0.00007780794,"threshold_uncertainty_score":0.9778159},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14454983,0.004365303,0.8479771,0.0006609926,0.0017592972,0.00021535678,6.652397e-8,0.00003646715,0.00043559112],"genre_scores_gemma":[0.9746005,0.00013824948,0.024507906,0.00015036142,0.0005472232,0.0000052554683,4.721648e-8,0.0000044315357,0.000046031022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980785,0.00022461858,0.0005973274,0.0002757274,0.00047176267,0.00035206391],"domain_scores_gemma":[0.99901193,0.00015529721,0.00035801835,0.00017849206,0.00014535873,0.0001509071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015241763,0.00013885726,0.00034185976,0.0002829401,0.00015998674,0.00068105344,0.00089153915,0.00006833949,0.000004843452],"category_scores_gemma":[0.0000054500465,0.000098799224,0.00007558428,0.0007996618,0.00010630742,0.0015297905,0.00013386228,0.00023563507,0.000009618203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036344347,0.0002268769,0.026387818,0.00019507957,0.00011226799,0.00024951954,0.005674975,0.16241047,0.00025369428,0.018544579,0.029842656,0.7560657],"study_design_scores_gemma":[0.0003954768,0.00054339523,0.020857064,0.00029984777,0.0000039990223,0.0010442854,0.00018579025,0.9753702,0.000015887785,0.00029336778,0.0008376378,0.0001530417],"about_ca_topic_score_codex":0.00002332337,"about_ca_topic_score_gemma":0.00001099383,"teacher_disagreement_score":0.83005065,"about_ca_system_score_codex":0.00006698726,"about_ca_system_score_gemma":0.0000879053,"threshold_uncertainty_score":0.6567414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012354452,0.0020699163,0.9929257,0.0015179578,0.0012740282,0.0010385251,0.0000044335015,0.00052172516,0.00052415754],"genre_scores_gemma":[0.4355133,0.00016178214,0.5621902,0.001214625,0.0003917985,0.0004151193,0.000035058005,0.00002666577,0.000051490624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977988,0.00041177904,0.0004421558,0.00040271156,0.00020350721,0.00074103056],"domain_scores_gemma":[0.9929769,0.0014004724,0.00020801972,0.004911515,0.00022977567,0.00027330391],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087836385,0.0002805153,0.00032937803,0.000107982676,0.0005981911,0.00028467,0.005777653,0.00018894827,0.0000066674593],"category_scores_gemma":[0.000021933383,0.0002865205,0.00018730886,0.00040058547,0.00013648388,0.000855365,0.0022556437,0.00062360225,0.000036429068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019268677,0.0006305811,0.00024128231,0.000016459919,0.00016456365,0.00000187877,0.00064531167,0.030343281,0.000022493601,0.6852755,0.09109913,0.19154027],"study_design_scores_gemma":[0.0004705436,0.000055663673,0.00032217256,0.000034715704,0.000022105494,0.000029197065,0.0000027014241,0.96939147,0.00008266751,0.0013739375,0.027885767,0.00032906502],"about_ca_topic_score_codex":0.0000048911143,"about_ca_topic_score_gemma":0.0000021361311,"teacher_disagreement_score":0.9390482,"about_ca_system_score_codex":0.000094483294,"about_ca_system_score_gemma":0.00007602044,"threshold_uncertainty_score":0.9999587},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023376625,0.000011472157,0.86379623,0.00015959049,0.00024059316,0.13206273,5.0552376e-7,0.0005507834,0.00084045343],"genre_scores_gemma":[0.19161354,0.0000012561195,0.21486484,0.00018191573,0.00046536193,0.5917945,0.000002537233,0.00004508711,0.0010310038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998005,0.00004481592,0.00031376453,0.00070962246,0.0002736092,0.0006531898],"domain_scores_gemma":[0.9983859,0.00007961345,0.00020569345,0.000950085,0.00021743194,0.00016125404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055846287,0.00025969537,0.00022698038,0.00005916853,0.00033018028,0.0003847724,0.0008922035,0.00019692842,0.000059788046],"category_scores_gemma":[0.000028871893,0.00019431954,0.00007667936,0.0005764639,0.000053146643,0.00077801716,0.00029855545,0.000608955,0.000017244984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040498783,0.0005804856,0.0006936903,0.00020479436,0.000080406586,0.000015076808,0.0009915439,0.042250544,0.0026920373,0.02111606,0.0075051393,0.92346525],"study_design_scores_gemma":[0.0013384473,0.00075812056,0.00010771303,0.00005149035,0.0000064368546,0.00004672904,0.000016101012,0.86010134,0.0017526088,0.0005759218,0.13492782,0.00031725367],"about_ca_topic_score_codex":0.000008733211,"about_ca_topic_score_gemma":0.00011370027,"teacher_disagreement_score":0.923148,"about_ca_system_score_codex":0.000042743046,"about_ca_system_score_gemma":0.00012406331,"threshold_uncertainty_score":0.7924121},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011880957,0.00007592706,0.97811824,0.00025430732,0.00042651827,0.00042976483,3.018346e-7,0.00029319618,0.0085207755],"genre_scores_gemma":[0.9882254,0.000013022579,0.010104936,0.0011703523,0.000050820272,0.00009890659,0.0000036281133,0.000025400403,0.0003075056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977193,0.0003772521,0.0003349942,0.0006745107,0.0002950614,0.00059890846],"domain_scores_gemma":[0.9975747,0.0010571005,0.00009679507,0.0010993222,0.000042987824,0.00012908813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014322125,0.00024245464,0.0002968094,0.00014195891,0.00006622386,0.00015171124,0.0010764735,0.00013919955,0.000035390745],"category_scores_gemma":[0.00008915084,0.00020816177,0.000091435875,0.00057509856,0.00006656517,0.00022766672,0.00021420083,0.00035770197,0.00005248565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029404855,0.00008320369,0.00022799983,0.00001718294,0.000004981261,0.00000947506,0.000063221625,0.4923814,0.000011199728,0.1996589,0.0001419297,0.3073711],"study_design_scores_gemma":[0.00050440594,0.00016124804,0.0013904328,0.00010797728,0.0000039141446,0.0000024892818,0.000005742678,0.980849,0.000011123815,0.016239379,0.00046229042,0.00026195226],"about_ca_topic_score_codex":0.0000043066866,"about_ca_topic_score_gemma":0.00012732515,"teacher_disagreement_score":0.97634447,"about_ca_system_score_codex":0.00016229592,"about_ca_system_score_gemma":0.000051591756,"threshold_uncertainty_score":0.8488591},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006524549,0.0000041777703,0.9917807,0.000040782623,0.0005779837,0.00050534913,0.0000017254686,0.000271808,0.0002929551],"genre_scores_gemma":[0.9082682,0.000002840123,0.09097999,0.00021476834,0.00027773294,0.000105592655,0.000024992409,0.000022103077,0.00010377241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979537,0.00015935556,0.0003993613,0.0006552983,0.00020014268,0.00063211244],"domain_scores_gemma":[0.9987319,0.00032866027,0.00013527487,0.0004973182,0.000104209896,0.00020261695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010342824,0.00020512711,0.00025481987,0.00010885699,0.00019148902,0.00020533933,0.000622791,0.00011315037,0.0000085126485],"category_scores_gemma":[0.000042121097,0.00019813038,0.00005049693,0.00047540865,0.00003126107,0.0001834589,0.000110633795,0.00020412261,0.00000605992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075767725,0.0001558142,0.00065632083,0.00001022417,0.000007857579,0.0000063930615,0.000119589786,0.22806944,0.00005601989,0.07077519,0.00020266873,0.69993293],"study_design_scores_gemma":[0.0005805155,0.0001693509,0.0007528878,0.000027844566,0.000006244398,0.000011254752,0.000009885662,0.9977957,0.00005235575,0.0001995824,0.0001375559,0.00025681977],"about_ca_topic_score_codex":0.00030094277,"about_ca_topic_score_gemma":0.00034059034,"teacher_disagreement_score":0.90174365,"about_ca_system_score_codex":0.000120184166,"about_ca_system_score_gemma":0.000064172345,"threshold_uncertainty_score":0.8079522},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021821834,0.0000035148996,0.87710184,0.000042184063,0.00014865985,0.11969535,1.9110942e-7,0.00041226286,0.0023777618],"genre_scores_gemma":[0.15094964,7.292115e-8,0.046034165,0.00025173483,0.00075697317,0.8007917,0.000005290424,0.000022180147,0.0011882408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986403,0.000044334924,0.00024054106,0.00047042206,0.00017461598,0.00042976346],"domain_scores_gemma":[0.9991253,0.000056997556,0.0000744173,0.00057442486,0.00009865849,0.000070206486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027150937,0.00014266065,0.000119977405,0.000049849546,0.00015876771,0.00020039607,0.0005190267,0.00009691359,0.00004189792],"category_scores_gemma":[0.0000023830987,0.00012057111,0.00006549015,0.0003489499,0.00002475667,0.00024051778,0.000054054854,0.00010365039,0.000017935428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014156987,0.0002415554,0.00007458658,0.000007977145,0.0000025501913,8.089312e-7,0.000015446842,0.931686,0.0001417325,0.032136433,0.014382411,0.021296376],"study_design_scores_gemma":[0.0005384782,0.0003591438,0.00023218188,0.000006288313,0.0000016167128,0.000005355036,0.0000039056595,0.9606795,0.0013603779,0.00057151896,0.036077525,0.00016411551],"about_ca_topic_score_codex":0.000048678277,"about_ca_topic_score_gemma":0.000051285766,"teacher_disagreement_score":0.8310677,"about_ca_system_score_codex":0.000056835,"about_ca_system_score_gemma":0.000034613375,"threshold_uncertainty_score":0.49167472},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029081694,0.000075667005,0.88823074,0.00004814612,0.00074270787,0.105168305,0.0000026231553,0.0012786739,0.004162319],"genre_scores_gemma":[0.63066936,0.0000064250926,0.110926114,0.00006257481,0.00042720567,0.25781173,0.0000144859905,0.000060310707,0.000021816115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995858,0.0013699234,0.0010849086,0.00067153695,0.00040291165,0.00061268423],"domain_scores_gemma":[0.99466234,0.0007469661,0.00058994803,0.0031825085,0.00051670935,0.00030152113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001963832,0.00035887535,0.0006527593,0.00014875099,0.0006011069,0.00084479887,0.005139691,0.00029339685,0.000006933794],"category_scores_gemma":[0.00004453746,0.00031509082,0.00013734418,0.0005327699,0.000073913274,0.0015237483,0.0008041609,0.00035861746,0.000010009057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005101355,0.0033319897,0.004141932,0.01288562,0.00079456146,0.000037385373,0.024426088,0.04065545,0.0007303118,0.6943649,0.018211426,0.195319],"study_design_scores_gemma":[0.003917392,0.00016070162,0.0001313919,0.000577075,0.00002281459,0.00006915749,0.00024260957,0.9815577,0.00017977906,0.00032294533,0.012399611,0.00041881937],"about_ca_topic_score_codex":0.00012825071,"about_ca_topic_score_gemma":0.000010288889,"teacher_disagreement_score":0.94090223,"about_ca_system_score_codex":0.00023595792,"about_ca_system_score_gemma":0.00016997219,"threshold_uncertainty_score":0.99993014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59740126,0.011780551,0.3835986,0.0009407278,0.0008829265,0.0045827837,0.0000024430135,0.00007009255,0.0007406557],"genre_scores_gemma":[0.89330703,0.003193265,0.10311188,0.000091589696,0.00009213182,0.00018446043,0.0000036681154,0.000006140396,0.000009844365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980202,0.0001550561,0.001035209,0.00017815268,0.0003955533,0.0002158699],"domain_scores_gemma":[0.9972649,0.0005193673,0.0008845918,0.00068039075,0.0005623807,0.00008835904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010856108,0.00014300206,0.0003048979,0.00022008474,0.000091689304,0.00008461395,0.0025901664,0.00006855804,0.0000045485303],"category_scores_gemma":[0.000074859054,0.00013736532,0.00008401599,0.0002728512,0.000099576944,0.00038312722,0.00058885943,0.00046138788,0.0000013894489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024469336,0.00049440155,0.0025524828,0.000005755776,0.00003372876,0.000004753726,0.0019003442,0.022872996,0.00046871093,0.00024101307,0.00005217618,0.9713492],"study_design_scores_gemma":[0.00124319,0.0005291395,0.008054732,0.0007374884,0.0000062295717,0.000064432206,0.00009907208,0.9845639,0.0005176698,0.000089261106,0.0039531775,0.00014172138],"about_ca_topic_score_codex":0.0000031531622,"about_ca_topic_score_gemma":0.0000043736213,"teacher_disagreement_score":0.97120744,"about_ca_system_score_codex":0.00009884712,"about_ca_system_score_gemma":0.00010365391,"threshold_uncertainty_score":0.56015956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029191557,0.000016930511,0.9400854,0.0032304195,0.000041302686,0.025996106,0.000014143242,0.00018856229,0.0012355407],"genre_scores_gemma":[0.8683252,0.0000014159939,0.05479447,0.00044853837,0.00001644267,0.07634599,0.000019475634,0.000017279748,0.000031237658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981302,0.0004261577,0.0005202844,0.00034942495,0.000319587,0.0002543249],"domain_scores_gemma":[0.99694794,0.00057632796,0.00026713367,0.0015827297,0.0005411802,0.00008468779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805988,0.00018879773,0.00024302627,0.00018992444,0.00027162387,0.00013402669,0.0016488044,0.000118379176,0.000020457444],"category_scores_gemma":[0.00005545447,0.00019436242,0.00008675237,0.0007889721,0.00021864312,0.0005950744,0.00026678754,0.0003869084,0.000019419407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009799309,0.0020575474,0.0029758397,0.00020818521,0.000054295797,0.0000013634491,0.0068806102,0.895922,0.014127777,0.018069565,0.0007102349,0.05889456],"study_design_scores_gemma":[0.00095868274,0.00007721741,0.0010606705,0.00009837205,0.0000044134745,9.5344683e-7,0.00011276791,0.9941116,0.0027961293,0.0004785527,0.000107107095,0.0001935335],"about_ca_topic_score_codex":0.00036623116,"about_ca_topic_score_gemma":0.0006515649,"teacher_disagreement_score":0.885291,"about_ca_system_score_codex":0.00016701089,"about_ca_system_score_gemma":0.00040906394,"threshold_uncertainty_score":0.792587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028369077,0.00013611764,0.96646726,0.00021846325,0.00095614255,0.0002951015,9.42914e-8,0.0003470866,0.028742801],"genre_scores_gemma":[0.6852531,0.000032111886,0.31182763,0.0012334537,0.0004611253,0.0000095770465,9.3778016e-7,0.000016053675,0.0011660025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980522,0.00004160322,0.00036700553,0.00051876757,0.00031406654,0.0007063492],"domain_scores_gemma":[0.9987533,0.000077539546,0.00009190154,0.0008624446,0.00004195749,0.00017284423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008091534,0.0001919747,0.00016867479,0.00007770358,0.00013061051,0.00018242757,0.0011841421,0.00006848602,0.00008867653],"category_scores_gemma":[0.0000030241904,0.00017314339,0.00006488886,0.0005420559,0.000031941436,0.00027009408,0.000980453,0.00017495532,0.00010136406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019699708,0.00009238906,0.0029237887,0.000026960808,0.00010880144,0.00028464478,0.00026494605,0.012292145,0.00012562134,0.5105262,0.0076918337,0.465643],"study_design_scores_gemma":[0.00045122288,0.00013334869,0.004080584,0.00014758775,0.000023370638,0.000041285362,0.000044907254,0.96669316,0.0005345004,0.007506229,0.019788494,0.00055529753],"about_ca_topic_score_codex":0.000035865276,"about_ca_topic_score_gemma":0.00007924176,"teacher_disagreement_score":0.954401,"about_ca_system_score_codex":0.0001258479,"about_ca_system_score_gemma":0.000018256922,"threshold_uncertainty_score":0.70605826},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020049065,0.00014466925,0.99199843,0.002189324,0.0012485125,0.0008375906,0.000025558618,0.00083109544,0.0007199241],"genre_scores_gemma":[0.9170847,0.0002208378,0.07914156,0.0017198434,0.00030292736,0.00030293487,0.00005172641,0.00006084495,0.0011146114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693525,0.0002503591,0.0005734755,0.00086625584,0.0004645569,0.0009101182],"domain_scores_gemma":[0.9960261,0.00073638087,0.00017555615,0.0024714668,0.00018882634,0.0004016767],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023262354,0.0004422035,0.00047341708,0.00013470532,0.00032523062,0.00044569623,0.0017180456,0.00032596712,0.0012280786],"category_scores_gemma":[0.000044378052,0.0004249622,0.0002919145,0.0009956968,0.00010035621,0.000790209,0.00005308206,0.0008689139,0.0009973889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040696974,0.0002446053,0.000052995427,0.0000057766847,0.000115647934,0.000032839635,0.000086175256,0.9073759,0.0000667394,0.00037528033,0.008294846,0.08330855],"study_design_scores_gemma":[0.0015250049,0.00018043592,0.0010372261,0.000045570483,0.00003426068,0.000056450255,0.000019731566,0.9737624,0.00035478888,0.0032198366,0.01909509,0.0006691848],"about_ca_topic_score_codex":0.00007516471,"about_ca_topic_score_gemma":0.000006920068,"teacher_disagreement_score":0.91507983,"about_ca_system_score_codex":0.0001184361,"about_ca_system_score_gemma":0.000048433474,"threshold_uncertainty_score":0.99982023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022077581,0.00004449105,0.9877269,0.0004909941,0.0003580157,0.00027656025,8.06755e-8,0.00020977564,0.010672358],"genre_scores_gemma":[0.78221995,0.0000031207728,0.21439481,0.00274903,0.000175099,0.00010791682,0.0000015772019,0.0000091186275,0.00033940666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920285,0.000023167258,0.00014452313,0.00027647192,0.00009431774,0.00025866876],"domain_scores_gemma":[0.9990956,0.000103083,0.000041037532,0.00049918686,0.00017129452,0.00008979835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019928633,0.00008426867,0.00008530425,0.000022517517,0.00006144915,0.000055637942,0.0005888876,0.00007549274,0.000063958934],"category_scores_gemma":[0.000015465772,0.00007410619,0.000029813358,0.00037084005,0.000011672225,0.0003751177,0.00013555442,0.000077860655,0.00007983089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021957128,0.00011429004,0.00023531323,0.000023502076,0.000018792736,0.0000028583336,0.00048551362,0.002908316,0.000011451226,0.9292543,0.009545733,0.05737798],"study_design_scores_gemma":[0.0001760095,0.00006115101,0.0009826424,0.000008041225,0.000004734391,0.000006801828,0.000008891145,0.9895404,0.00014430471,0.005446835,0.003509001,0.00011116195],"about_ca_topic_score_codex":0.00005942716,"about_ca_topic_score_gemma":0.00008336489,"teacher_disagreement_score":0.9866321,"about_ca_system_score_codex":0.000019178973,"about_ca_system_score_gemma":0.00003454274,"threshold_uncertainty_score":0.30219626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073064625,0.0004093743,0.9237252,0.00030654948,0.0021736384,0.00012012132,5.740182e-8,0.000037207396,0.00016324263],"genre_scores_gemma":[0.82169247,0.00004043962,0.17736432,0.00043009542,0.0004576413,6.151471e-7,4.3099384e-8,0.000006049423,0.000008313065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967826,0.000074996264,0.0008823815,0.00041831753,0.0010311182,0.00081055885],"domain_scores_gemma":[0.99775106,0.0002568919,0.00063040847,0.0005750269,0.00045963313,0.00032700878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072862483,0.00017665768,0.0003195285,0.00048659468,0.0001915097,0.0004342188,0.0034538538,0.00007761897,0.0000028743093],"category_scores_gemma":[0.00005897905,0.00014984688,0.00010833228,0.0026348853,0.00023158394,0.0027777094,0.0007988296,0.000660337,0.000004583083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023509217,0.00014823933,0.007949659,0.0000069594826,0.000007779866,0.0005479926,0.0009889354,0.060556255,0.00014680918,0.0068469406,0.00037541921,0.9224015],"study_design_scores_gemma":[0.00045837992,0.00026910342,0.055154473,0.00015576453,0.000002332171,0.0004980718,0.000013691045,0.9413801,0.00027931525,0.0008987612,0.0006853458,0.00020465927],"about_ca_topic_score_codex":0.0000022355782,"about_ca_topic_score_gemma":0.000019505142,"teacher_disagreement_score":0.92219687,"about_ca_system_score_codex":0.0002497716,"about_ca_system_score_gemma":0.00039787884,"threshold_uncertainty_score":0.6418177},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010726196,0.002596731,0.9908138,0.00008059351,0.000119313765,0.005256702,0.0000029287114,0.00003118055,0.000026123053],"genre_scores_gemma":[0.5748383,0.0004901735,0.41985503,0.00045709327,0.0015488846,0.002759277,0.000009319322,0.00002068879,0.000021282902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982333,0.000117952535,0.000833037,0.00027277533,0.00020529295,0.000337606],"domain_scores_gemma":[0.99744946,0.00052670354,0.0008613612,0.00046923922,0.0005335666,0.00015966805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012450251,0.00017222688,0.00043471035,0.00006338922,0.00017656399,0.00012758424,0.000864664,0.00009851839,0.0000011720261],"category_scores_gemma":[0.000007890726,0.00015242165,0.00013222493,0.00055586605,0.000041841486,0.00025456198,0.00013209613,0.00024187236,5.211565e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037698937,0.00017813727,0.0014578778,0.000012267255,0.000036361827,0.0000013362793,0.000108973465,0.1317276,0.000008525326,0.0044548823,0.004072043,0.8579043],"study_design_scores_gemma":[0.0008301824,0.0010228829,0.04070712,0.00013248093,0.000017105602,0.000045619243,0.0000037142238,0.93024087,0.000008480046,0.0022086687,0.024594188,0.00018866466],"about_ca_topic_score_codex":0.0000011643638,"about_ca_topic_score_gemma":0.0000052864384,"teacher_disagreement_score":0.8577156,"about_ca_system_score_codex":0.000024575324,"about_ca_system_score_gemma":0.00007806011,"threshold_uncertainty_score":0.6215574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000867325,0.000048727637,0.992909,0.00026960653,0.00040245184,0.00060234166,2.3033418e-7,0.0002843591,0.0053965393],"genre_scores_gemma":[0.6290083,0.0000012132405,0.36989072,0.0003337741,0.00037838047,0.00022241031,6.750648e-7,0.000009287102,0.00015528701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987546,0.000040269893,0.00019431431,0.00024329797,0.00011761176,0.00064990035],"domain_scores_gemma":[0.998829,0.00040723677,0.000049073744,0.00047699298,0.00004909033,0.00018862856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065671833,0.000118771626,0.0001315804,0.000028996446,0.000106820335,0.00008986106,0.0004954954,0.00011399651,0.000027223447],"category_scores_gemma":[0.000082590945,0.00010086332,0.00007187563,0.000203505,0.000025520185,0.0005417083,0.00026704234,0.0001663857,0.00002644574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008166763,0.00016342803,0.002226788,0.000008462687,0.000017885897,0.0000023075272,0.00017161637,0.00073444843,0.0005748587,0.9395958,0.005500693,0.050995536],"study_design_scores_gemma":[0.00019374333,0.000046633613,0.0005162904,0.000011931082,0.0000057602483,0.000038728656,0.000009188839,0.9880407,0.0019591555,0.000571574,0.0084077045,0.00019862708],"about_ca_topic_score_codex":0.000008084087,"about_ca_topic_score_gemma":0.000002222773,"teacher_disagreement_score":0.98730624,"about_ca_system_score_codex":0.000043219297,"about_ca_system_score_gemma":0.000016217973,"threshold_uncertainty_score":0.41130868},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001103432,0.000034385845,0.7457666,0.00034196253,0.00012267056,0.000026917733,2.7508818e-8,0.00018352958,0.2524205],"genre_scores_gemma":[0.90732193,9.893041e-7,0.08165306,0.00048601764,0.00015221814,0.000005582467,4.0069156e-7,0.000002689558,0.010377089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961704,0.0000075824246,0.000059675167,0.00012106261,0.00007863998,0.00011599389],"domain_scores_gemma":[0.99965566,0.000017236578,0.000010882042,0.0002854851,0.000011733336,0.000018982522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049112972,0.00003394309,0.000033523836,0.000013223128,0.000023425637,0.0000537598,0.00034706783,0.000016575501,0.000077009],"category_scores_gemma":[0.0000010972896,0.000028047805,0.000016532393,0.00012822071,0.0000074722357,0.00014002765,0.00008702293,0.000029030096,0.0003185202],"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":[1.0409981e-7,0.000011130298,0.00037252845,3.653252e-7,5.676103e-7,0.00000459829,0.000004217271,0.00036512673,0.00007597283,0.91609794,0.063758925,0.019308537],"study_design_scores_gemma":[0.00029139817,0.00004017747,0.017193085,0.0000043791974,0.0000015089439,0.0000248681,0.0000021743158,0.45126468,0.004002178,0.10335597,0.4235328,0.00028679174],"about_ca_topic_score_codex":0.00006234671,"about_ca_topic_score_gemma":0.0000266388,"teacher_disagreement_score":0.9062185,"about_ca_system_score_codex":0.000006950857,"about_ca_system_score_gemma":0.0000078592475,"threshold_uncertainty_score":0.40940392},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00346632,0.008269808,0.9805027,0.0033367486,0.0029859242,0.00028141163,0.0000066412076,0.00004746203,0.0011029631],"genre_scores_gemma":[0.9907623,0.00045032756,0.007508319,0.0003023844,0.00066111865,0.00004789796,0.000016003123,0.000014823168,0.00023683111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976369,0.0003962632,0.0010828443,0.00015931886,0.0005118805,0.00021278772],"domain_scores_gemma":[0.99541855,0.00084270444,0.0013421228,0.00071846024,0.0016063378,0.00007181388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011722997,0.00014515962,0.00034184862,0.00019614836,0.000112749636,0.00034719598,0.0035264958,0.00012701025,0.0000061753944],"category_scores_gemma":[0.000040322244,0.00013431451,0.00019276098,0.00016957504,0.00007604927,0.00052082544,0.00018839534,0.00028270337,0.0000064572723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003022938,0.00037943252,0.0023206805,0.000007556859,0.0005678286,0.000042007177,0.00022768817,0.27276012,0.00060638844,0.6312625,0.025489379,0.06603414],"study_design_scores_gemma":[0.003145372,0.00015103909,0.0031520405,0.00018969786,0.000029561796,0.00064398773,0.00005719987,0.8358051,0.00005799586,0.0039610476,0.15257078,0.00023612178],"about_ca_topic_score_codex":0.000051105624,"about_ca_topic_score_gemma":0.000039723156,"teacher_disagreement_score":0.987296,"about_ca_system_score_codex":0.00019290284,"about_ca_system_score_gemma":0.00009623867,"threshold_uncertainty_score":0.65531653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004234285,0.00007065547,0.9845251,0.00023973748,0.00074856385,0.0010120098,0.0000033686295,0.00048454173,0.008681775],"genre_scores_gemma":[0.94169855,0.000005932507,0.05305754,0.0015599455,0.0006649384,0.0005350175,0.000037538302,0.000040172556,0.0024003377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976625,0.00005740464,0.000434904,0.0007358979,0.0003330395,0.0007762964],"domain_scores_gemma":[0.9982107,0.00043163853,0.00015248891,0.0009691323,0.000105424784,0.00013061549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055356853,0.00027342734,0.0003024155,0.00008091884,0.00019379384,0.00022703176,0.0008898757,0.00015419365,0.00012532822],"category_scores_gemma":[0.000009155965,0.00025016646,0.0001724035,0.0004531051,0.000041094023,0.0002680111,0.00016473123,0.00020546772,0.000058686142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071037415,0.00044224085,0.0006813421,0.000027395663,0.000018257033,0.000040004,0.000059063037,0.63912916,0.00013937036,0.048886493,0.09440814,0.21609749],"study_design_scores_gemma":[0.0008605588,0.00042216977,0.00034238177,0.000030179874,0.0000056503736,0.0000046819414,0.000007877289,0.9761712,0.00036793677,0.00024793792,0.02121875,0.00032069985],"about_ca_topic_score_codex":0.000027506869,"about_ca_topic_score_gemma":0.000089747715,"teacher_disagreement_score":0.9374643,"about_ca_system_score_codex":0.00008790691,"about_ca_system_score_gemma":0.00009527172,"threshold_uncertainty_score":0.99999505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034212604,0.001739543,0.9605046,0.00034928042,0.0011979501,0.00041465234,9.874617e-7,0.0002059645,0.0013744152],"genre_scores_gemma":[0.8898808,0.0002602125,0.10735417,0.0007858168,0.0005733681,0.000103477774,0.000006676506,0.00003274414,0.0010027626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979439,0.00008938534,0.00036993893,0.0006346869,0.0003125753,0.0006495287],"domain_scores_gemma":[0.99890536,0.00014452726,0.00010101736,0.00062140723,0.000083971136,0.00014370476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021558124,0.00024749368,0.00026557958,0.00012779744,0.00012463241,0.00058423966,0.00076959317,0.00015735962,0.0002119522],"category_scores_gemma":[0.00001483719,0.0002151937,0.00009497946,0.00076772145,0.00006589138,0.0023370455,0.00042873062,0.00035068917,0.000077091034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017936156,0.0004763277,0.010383076,0.000022013508,0.00008644873,0.00020510466,0.0004061273,0.20763397,0.00076686713,0.014831282,0.0063589723,0.7588119],"study_design_scores_gemma":[0.00030646165,0.00005390035,0.011758372,0.00004331785,0.0000029789526,0.00006996082,0.00002548058,0.985536,0.000050779552,0.0012518781,0.0006002759,0.0003006078],"about_ca_topic_score_codex":0.0002504056,"about_ca_topic_score_gemma":0.00020255387,"teacher_disagreement_score":0.8556682,"about_ca_system_score_codex":0.00019251545,"about_ca_system_score_gemma":0.00010392711,"threshold_uncertainty_score":0.87753445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09664283,0.00041859434,0.8938738,0.00055448455,0.0006737002,0.00011999141,1.9408688e-7,0.0001765021,0.007539918],"genre_scores_gemma":[0.9866453,0.00018144687,0.0118369665,0.0005203364,0.0001468317,0.000039621813,0.0000012141879,0.000016502878,0.0006118231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983885,0.000043721273,0.00021105382,0.0006063625,0.00021787288,0.0005324877],"domain_scores_gemma":[0.9989648,0.00009164077,0.00006845666,0.00067995244,0.00003529576,0.00015983886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023355022,0.0002081704,0.00022277382,0.000085865344,0.00009555254,0.00020574073,0.0007312005,0.00014610094,0.000028707194],"category_scores_gemma":[0.0000039391343,0.00015436066,0.000023772836,0.0006555522,0.0001296954,0.00041858514,0.000305669,0.0003506473,0.0000051323786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027543616,0.00020794109,0.0019307804,0.000010906238,0.000016146156,0.00014458361,0.000766632,0.012476683,0.00030353188,0.45652467,0.00083148904,0.5267591],"study_design_scores_gemma":[0.0005932932,0.00020314344,0.0019231131,0.0000348361,0.0000027089322,0.000076034485,0.000022467644,0.9912161,0.00029839537,0.0007349419,0.0045418204,0.00035314888],"about_ca_topic_score_codex":0.0000836322,"about_ca_topic_score_gemma":0.0021566642,"teacher_disagreement_score":0.97873944,"about_ca_system_score_codex":0.000014630315,"about_ca_system_score_gemma":0.000049830272,"threshold_uncertainty_score":0.6294645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015735926,0.007664678,0.96960497,0.003417207,0.0020679021,0.0012666523,0.00008489307,0.00005988463,0.00009788147],"genre_scores_gemma":[0.9376379,0.0069077583,0.05362563,0.00046131838,0.00046815904,0.0006651241,0.00010055978,0.00003343978,0.000100108715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970658,0.00048115378,0.0012416554,0.00023489453,0.0007258422,0.0002506907],"domain_scores_gemma":[0.9898596,0.002681192,0.0015455458,0.0024882238,0.0032819977,0.00014344507],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0017574925,0.00022985184,0.00033140503,0.00027224777,0.0005181351,0.0008113077,0.009762011,0.00013487188,0.0000080809],"category_scores_gemma":[0.00019628607,0.00017888189,0.00022286855,0.0003539588,0.00018776064,0.0016364129,0.00055468135,0.0004583124,0.0000027259368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029386766,0.00027956377,0.0006032841,0.000011584994,0.0005953932,0.0000034950247,0.004556204,0.25239518,0.00044400146,0.22963732,0.008982283,0.5021978],"study_design_scores_gemma":[0.0016515951,0.0003287642,0.001036611,0.00015644943,0.00004932245,0.0002887943,0.0030583576,0.59605765,0.00004832874,0.006546484,0.39053297,0.0002446594],"about_ca_topic_score_codex":0.000017243989,"about_ca_topic_score_gemma":0.00006070766,"teacher_disagreement_score":0.921902,"about_ca_system_score_codex":0.00026830068,"about_ca_system_score_gemma":0.00033288705,"threshold_uncertainty_score":0.99559563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03956134,0.0024898986,0.9435528,0.00012329033,0.001375726,0.00048468885,5.337653e-7,0.00075656123,0.011655168],"genre_scores_gemma":[0.97077674,0.000039101764,0.025797738,0.0019089932,0.000522203,0.00015036091,0.0000026075168,0.000033011926,0.0007692602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976863,0.0001329933,0.00031280506,0.00051677,0.00036373915,0.0009873951],"domain_scores_gemma":[0.9978427,0.00042768408,0.00012734203,0.0012136837,0.00006119732,0.0003273921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070664834,0.00027425133,0.00024110965,0.000090597496,0.00021092784,0.00017852343,0.0009838542,0.00017148592,0.00021312211],"category_scores_gemma":[0.000027695702,0.00024119401,0.00013407967,0.00056177616,0.000046191162,0.00055825844,0.00028538023,0.00042352537,0.0005310338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026625337,0.0003301517,0.00198954,0.000013006661,0.000029898247,0.000012618465,0.00029330936,0.21124613,0.00018972142,0.0042509953,0.011573909,0.7700441],"study_design_scores_gemma":[0.0005638979,0.00038665478,0.000987445,0.000042866923,0.000010414432,0.000009847037,0.000031085758,0.9021088,0.0041652354,0.00008546972,0.09109448,0.0005138423],"about_ca_topic_score_codex":0.0000044296694,"about_ca_topic_score_gemma":0.000015841291,"teacher_disagreement_score":0.9312154,"about_ca_system_score_codex":0.00010002488,"about_ca_system_score_gemma":0.000039434955,"threshold_uncertainty_score":0.9835606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03421174,0.00009904112,0.9602513,0.00025276173,0.0002479089,0.00020834198,1.3934454e-7,0.0001967277,0.004532062],"genre_scores_gemma":[0.9706429,0.000018467286,0.02807617,0.0006627287,0.00011418238,0.00002338106,0.0000013671387,0.000009307888,0.00045144866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874353,0.00014453784,0.00021624572,0.00036865444,0.0001373996,0.00038960375],"domain_scores_gemma":[0.99887383,0.00043535305,0.00004507713,0.0004136449,0.000053383737,0.00017873419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052361435,0.00012357403,0.00015404302,0.000029843284,0.00010777839,0.00039059992,0.00048218478,0.000069382084,0.00009058149],"category_scores_gemma":[0.00004708885,0.00010504116,0.000024250548,0.00022236232,0.00005506064,0.0005012855,0.0007526151,0.00019546905,0.00006153551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009712422,0.00006117898,0.08485175,0.000017475399,0.000044694938,0.00002951265,0.00058111973,0.0231658,0.00010252911,0.06591292,0.014066967,0.81115633],"study_design_scores_gemma":[0.00015116655,0.000024001976,0.07093382,0.000010209022,8.444148e-7,0.0000123231175,0.0000047981375,0.92804694,0.00000715975,0.00050417957,0.00017152967,0.00013301075],"about_ca_topic_score_codex":0.00041548672,"about_ca_topic_score_gemma":0.00015051063,"teacher_disagreement_score":0.9364312,"about_ca_system_score_codex":0.0000164682,"about_ca_system_score_gemma":0.000015842541,"threshold_uncertainty_score":0.4283454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06911419,0.000002490201,0.8923833,0.0004364822,0.00031095455,0.021072647,0.0000029766868,0.00062282226,0.016054127],"genre_scores_gemma":[0.8460408,7.661548e-8,0.14286868,0.00044063642,0.0000908872,0.009422875,0.0000071022127,0.000020216588,0.0011087323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981932,0.00006577994,0.00042456333,0.00046735755,0.00035602486,0.00049306056],"domain_scores_gemma":[0.99864215,0.0001170028,0.00011414157,0.00084287225,0.00006639633,0.00021743169],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030102016,0.00018792394,0.00022885318,0.000040605046,0.000068383444,0.00048233563,0.0010861112,0.00009302171,0.00054303516],"category_scores_gemma":[0.000013777248,0.00015901761,0.000035854053,0.00022364444,0.000067702575,0.00070194376,0.00056783,0.00026882946,0.0008207822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000256679,0.0009271268,0.1101927,0.00013622982,0.00005673959,0.00030935978,0.0023572056,0.004152366,0.0073666093,0.5930571,0.158691,0.12272787],"study_design_scores_gemma":[0.00043609244,0.00026446002,0.026873566,0.00005319436,0.0000055950254,0.000035995672,0.000031479227,0.96543777,0.0019270041,0.003934935,0.0005922809,0.0004076311],"about_ca_topic_score_codex":0.0004523601,"about_ca_topic_score_gemma":0.00004061739,"teacher_disagreement_score":0.9612854,"about_ca_system_score_codex":0.000042279138,"about_ca_system_score_gemma":0.00005443048,"threshold_uncertainty_score":0.9999572},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028952321,0.0022769314,0.9641836,0.0006070214,0.0002987263,0.0025719847,0.000006098364,0.000362333,0.0007409578],"genre_scores_gemma":[0.7640191,0.00014411,0.23355281,0.00024194995,0.000083090476,0.0017141505,0.000041128424,0.000020488458,0.00018321288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980586,0.000107469554,0.0005358431,0.0004983494,0.00016009629,0.0006396308],"domain_scores_gemma":[0.9964879,0.0012761218,0.00016168764,0.0017350736,0.00015058646,0.00018860326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041687296,0.00022568513,0.00032333253,0.00011802705,0.00018942027,0.00027549235,0.0021961776,0.00016906818,0.000052064403],"category_scores_gemma":[0.000050385108,0.00020869101,0.00009243383,0.0003680252,0.00008711854,0.0008587809,0.0008450731,0.00034044037,0.000073077426],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021130409,0.0000595463,0.0066716885,0.000015655936,0.00001672081,6.3138646e-7,0.0008333206,0.0022615397,0.00020159413,0.0010077363,0.0015175168,0.9874119],"study_design_scores_gemma":[0.0006807353,0.00008439208,0.006975265,0.000030022187,0.0000067811825,8.485848e-7,0.00008974932,0.9853107,0.00013134029,0.0003928785,0.0060200333,0.00027728034],"about_ca_topic_score_codex":0.00017533582,"about_ca_topic_score_gemma":0.00051099254,"teacher_disagreement_score":0.98713464,"about_ca_system_score_codex":0.00010689709,"about_ca_system_score_gemma":0.00007211223,"threshold_uncertainty_score":0.85101724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018799456,0.000011311124,0.9787831,0.00009555659,0.00096961134,0.000635794,0.0000011912099,0.0003405003,0.0003635189],"genre_scores_gemma":[0.5440922,0.0000059582926,0.4544151,0.00029821086,0.00020940976,0.00012563658,0.000008591951,0.000026385325,0.00081851333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838465,0.000014636933,0.0002880163,0.0005549848,0.00021343677,0.0005442768],"domain_scores_gemma":[0.99851733,0.00014002374,0.00014188138,0.0007578579,0.0002897563,0.00015314974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037083737,0.00022150349,0.00021141798,0.000059028094,0.00027467776,0.0004507276,0.0008917274,0.00017786291,0.00007940302],"category_scores_gemma":[0.000019646406,0.00017047532,0.00007167695,0.00035295894,0.00008246227,0.0009752965,0.00020683935,0.00029656038,0.0000075074786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006389351,0.00018674525,0.008569811,0.000026618944,0.00006056822,0.000012592454,0.00028626187,0.88494205,0.001304106,0.045835968,0.0007716816,0.057939716],"study_design_scores_gemma":[0.0008693233,0.000082921375,0.0005038504,0.000016614122,0.0000075500166,0.000017333468,0.0000076106458,0.99699706,0.0007840375,0.000027185823,0.00040817735,0.00027833],"about_ca_topic_score_codex":0.000031272888,"about_ca_topic_score_gemma":0.0002098458,"teacher_disagreement_score":0.52529275,"about_ca_system_score_codex":0.000021719527,"about_ca_system_score_gemma":0.00005800293,"threshold_uncertainty_score":0.6951782},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088102854,0.007058165,0.98571116,0.00032412878,0.00042042023,0.0004046234,2.8507705e-7,0.0003621975,0.004838008],"genre_scores_gemma":[0.91065186,0.002206525,0.08122514,0.0018010011,0.0006467384,0.00054879807,0.0000074524737,0.000034058146,0.002878453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974833,0.00030309026,0.0006135423,0.00062754913,0.0002925877,0.0006799301],"domain_scores_gemma":[0.998348,0.00055405154,0.00014174641,0.00074829947,0.000059406037,0.00014851853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001121387,0.00025295897,0.00058123184,0.00011841988,0.00009116314,0.00018487532,0.0010340171,0.00016444338,0.00014155188],"category_scores_gemma":[0.00002154113,0.00021516041,0.00017712168,0.0006626359,0.000062523744,0.0005807994,0.0004546462,0.00027061458,0.00003972369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036066942,0.00005904003,0.000023090986,0.0000013672777,0.000015542842,0.000017919307,0.00019833578,0.14374326,0.0000019618506,0.00993464,0.0012359124,0.8444083],"study_design_scores_gemma":[0.035858728,0.00002679139,0.000011365329,0.000025806474,0.0000042481706,0.000011762735,0.000020381976,0.9389664,0.000061075974,0.00035754542,0.024397071,0.0002588512],"about_ca_topic_score_codex":0.000051153416,"about_ca_topic_score_gemma":0.00040134636,"teacher_disagreement_score":0.9097708,"about_ca_system_score_codex":0.00011169817,"about_ca_system_score_gemma":0.00005392579,"threshold_uncertainty_score":0.8773987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011678883,0.000115670344,0.97765493,0.0011945706,0.00039633428,0.00057486014,0.0000016814647,0.00039254644,0.007990532],"genre_scores_gemma":[0.9020326,0.000011026575,0.08796508,0.009596357,0.00013706768,0.000106240666,0.000006388717,0.000022096883,0.00012315632],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980739,0.00016717186,0.00036649485,0.00051050034,0.00036948023,0.00051250076],"domain_scores_gemma":[0.9970717,0.00020505741,0.00015373077,0.00209616,0.00017886075,0.0002945021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004426414,0.00024785323,0.0002832786,0.00010173831,0.00016543777,0.0002649625,0.0036076698,0.00020010349,0.00077441434],"category_scores_gemma":[0.00003435265,0.00021742546,0.00008263113,0.00070918776,0.00007462686,0.00085812376,0.00079892395,0.0004072391,0.00004828128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005938276,0.00084514264,0.15690377,0.00007025533,0.0003949558,0.00007794356,0.0022182546,0.1367157,0.0024351468,0.24811201,0.3168473,0.1347857],"study_design_scores_gemma":[0.0010272161,0.000063836545,0.10833775,0.000028491737,0.000009674148,0.0000019781114,0.000009002846,0.8867593,0.0004077118,0.0013455172,0.0017281799,0.00028136407],"about_ca_topic_score_codex":0.00023568235,"about_ca_topic_score_gemma":0.000121517136,"teacher_disagreement_score":0.8903537,"about_ca_system_score_codex":0.00008324504,"about_ca_system_score_gemma":0.00009487609,"threshold_uncertainty_score":0.8866353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05155682,0.00002367509,0.9447087,0.00063704234,0.0004712934,0.00060035946,5.3476754e-7,0.00022447968,0.0017770642],"genre_scores_gemma":[0.97147846,0.000005535714,0.024634866,0.0019107516,0.00016225167,0.00018136992,0.0000021819733,0.000013040408,0.0016115312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898475,0.000031702424,0.0001644602,0.00038937182,0.00014366717,0.00028603507],"domain_scores_gemma":[0.9992411,0.00016479014,0.0000675395,0.00037213718,0.00006605877,0.00008836989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020717084,0.00012874088,0.00012151841,0.00004456397,0.00012225306,0.00022424398,0.00025312667,0.00007925687,0.000074751544],"category_scores_gemma":[0.000021048172,0.00010990836,0.000037326594,0.000094682684,0.0000107300075,0.00046443465,0.00013743165,0.000093215276,0.000112962705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021580845,0.00004836148,0.000026143449,0.000021314298,0.000022194114,0.000003204964,0.00024052653,0.00032078143,0.0019173848,0.8936708,0.013302828,0.09040487],"study_design_scores_gemma":[0.0003937659,0.00064547366,0.00042740893,0.000027432941,0.0000062109334,0.000009391374,0.000034994257,0.9549912,0.00062288786,0.04127816,0.0013491957,0.00021384396],"about_ca_topic_score_codex":0.0001135099,"about_ca_topic_score_gemma":0.000035887017,"teacher_disagreement_score":0.9546704,"about_ca_system_score_codex":0.00003547276,"about_ca_system_score_gemma":0.0000141772825,"threshold_uncertainty_score":0.44819328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063665595,0.005636687,0.9877769,0.00034157874,0.00014626131,0.00357057,0.000004734023,0.00029077288,0.0015958773],"genre_scores_gemma":[0.9483836,0.0029555948,0.02075545,0.0010092491,0.0008803674,0.024737528,0.000049807546,0.00005572007,0.0011726314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980417,0.000031346797,0.0003912952,0.00078757753,0.0001608787,0.0005871839],"domain_scores_gemma":[0.9983719,0.00019622184,0.00013766598,0.0009982126,0.000090801754,0.00020517585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029498577,0.0002616927,0.00025142156,0.000054784752,0.00040687688,0.0002457524,0.0007829623,0.0001435859,0.000019294986],"category_scores_gemma":[0.0000015643328,0.0002544364,0.00009740609,0.00049301033,0.000100170466,0.00024005458,0.00033879405,0.00019834298,0.00001627392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052160703,0.00010058126,0.000012372679,0.000012964713,0.00002140509,5.605423e-7,0.000015173245,0.41253057,9.881705e-7,0.10914118,0.0046189316,0.47354007],"study_design_scores_gemma":[0.00029188563,0.000060812265,0.00015603354,0.000016954033,0.000018907273,0.000005256239,0.0000133702015,0.589495,0.0000015167388,0.0011929733,0.4085379,0.0002094127],"about_ca_topic_score_codex":6.3689345e-7,"about_ca_topic_score_gemma":0.000014844601,"teacher_disagreement_score":0.9670214,"about_ca_system_score_codex":0.00006349014,"about_ca_system_score_gemma":0.000016052622,"threshold_uncertainty_score":0.99999076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013186472,0.0000139586045,0.9848271,0.00038358808,0.00024992693,0.00041778415,6.407707e-7,0.00013076964,0.00078973034],"genre_scores_gemma":[0.5826791,0.0000021189164,0.4166228,0.00018336528,0.00008890177,0.000089395464,0.000008394842,0.000007894655,0.00031805033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998997,0.000038659862,0.00026086,0.00034051223,0.000107500666,0.00025547395],"domain_scores_gemma":[0.99916875,0.00024352895,0.000070372094,0.00037335698,0.00011069288,0.000033321634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030271077,0.00010237791,0.000106819614,0.00006037839,0.00006641238,0.0002379197,0.00038158093,0.00011717516,0.000033659235],"category_scores_gemma":[0.000036988138,0.00009907299,0.000032376625,0.00037324737,0.000025121919,0.0004748832,0.000073113755,0.000091020906,0.000017282535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005746288,0.00005042557,0.0013335482,0.0000050211843,0.0000014259664,9.4897104e-7,0.00003060017,0.6732311,0.00009600006,0.31863433,0.00013747971,0.006473339],"study_design_scores_gemma":[0.000340087,0.000023326684,0.0046127145,0.000016738646,0.0000011855502,8.162589e-7,0.0000025158704,0.98484343,0.0013246065,0.008530948,0.00017820096,0.00012540331],"about_ca_topic_score_codex":0.000086890024,"about_ca_topic_score_gemma":0.000083108855,"teacher_disagreement_score":0.56949264,"about_ca_system_score_codex":0.000052849722,"about_ca_system_score_gemma":0.000028213628,"threshold_uncertainty_score":0.40400794},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024875425,0.19056347,0.23573725,0.00005345159,0.001874627,0.0043811845,0.00003619655,0.0011375516,0.5659675],"genre_scores_gemma":[0.008737892,0.007755675,0.014229314,0.00025361674,0.0016260791,0.0023712108,0.00008036814,0.0003321455,0.9646137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99663216,0.00012985969,0.0006394737,0.0013373606,0.00044687366,0.00081426697],"domain_scores_gemma":[0.9978489,0.00018425783,0.00032955437,0.0013877802,0.000044118646,0.00020536488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039595645,0.0006850091,0.0008585682,0.0001711989,0.00011660813,0.0004579784,0.0017266494,0.00068385486,0.000005155327],"category_scores_gemma":[0.0000057975412,0.00072220096,0.00012574325,0.000042540847,0.00021998685,0.00026881986,0.0019040011,0.0010546116,0.0000054810935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045898294,0.000078878205,0.000010039211,0.0007751654,0.00013451972,0.00027811606,0.0058833053,0.05504477,0.000004198397,0.022317603,0.00369098,0.91173655],"study_design_scores_gemma":[0.001032146,0.00020102084,0.000025263922,0.0018604761,0.00004332197,0.000068748144,0.000019154873,0.39219168,0.000053710177,0.004311479,0.598791,0.0014019825],"about_ca_topic_score_codex":0.000053406155,"about_ca_topic_score_gemma":0.000323399,"teacher_disagreement_score":0.9103345,"about_ca_system_score_codex":0.0003758334,"about_ca_system_score_gemma":0.00033874362,"threshold_uncertainty_score":0.9995229},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020968994,0.00001535331,0.960458,0.000842515,0.0004959856,0.000116280266,1.074384e-7,0.00008170977,0.017021075],"genre_scores_gemma":[0.99614495,0.000006285515,0.00198179,0.001186158,0.0001858808,0.0000097539205,4.124979e-7,0.0000068228196,0.00047795367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901336,0.0001167715,0.0001731861,0.00023358816,0.00023380868,0.0002292973],"domain_scores_gemma":[0.99866635,0.0003110771,0.00007946256,0.00084866513,0.000044753746,0.0000497076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041949464,0.000096368065,0.00012419147,0.000022386235,0.0000739434,0.00006129301,0.0011200369,0.00006016423,0.00009833692],"category_scores_gemma":[0.000015377103,0.000058336114,0.00006595897,0.0002127857,0.000055943907,0.00009295237,0.00024396532,0.00015438623,0.000046685116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003809792,0.000029408704,0.000031519896,0.0000017125343,0.000008456496,0.0000011727168,0.00002389748,0.04248225,0.000088412555,0.88461465,0.0103782,0.06233649],"study_design_scores_gemma":[0.00011400067,0.00008103993,0.0005683633,0.000011671761,0.0000025401139,0.0000027806593,0.0000034063557,0.9899712,0.000404405,0.007840312,0.0009210189,0.00007924907],"about_ca_topic_score_codex":0.000020487658,"about_ca_topic_score_gemma":0.000009134175,"teacher_disagreement_score":0.975176,"about_ca_system_score_codex":0.000008306831,"about_ca_system_score_gemma":0.000012258114,"threshold_uncertainty_score":0.23788777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021537489,0.003916052,0.98740405,0.0028576462,0.0002321818,0.001488856,0.000014328926,0.000636707,0.0012964339],"genre_scores_gemma":[0.7650087,0.009386961,0.22315626,0.0003938036,0.000021645918,0.0016739564,0.000016653099,0.000032422347,0.00030958865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998354,0.00017023219,0.00036021613,0.00047147676,0.0002305587,0.00041351953],"domain_scores_gemma":[0.99595046,0.0005379283,0.000114704795,0.0030239678,0.00018236433,0.00019056514],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030569188,0.00022951931,0.0002207217,0.00019140556,0.0016064028,0.0001521194,0.0019735403,0.00012176919,0.000025232976],"category_scores_gemma":[0.0000048575375,0.0002436173,0.00011897424,0.000939617,0.00015746863,0.00021628573,0.000108084685,0.00040483673,0.000029251583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008459903,0.006362992,0.000046517398,0.00013200309,0.0009438417,0.000016359634,0.011790216,0.31952655,0.00006671592,0.10873939,0.005378981,0.54691184],"study_design_scores_gemma":[0.0012335143,0.0001908962,0.00024293493,0.000031140567,0.00006822989,0.000056499113,0.00020250268,0.81832516,0.000026120535,0.00023630627,0.17903398,0.0003527152],"about_ca_topic_score_codex":0.0000032900957,"about_ca_topic_score_gemma":0.0000665381,"teacher_disagreement_score":0.7642478,"about_ca_system_score_codex":0.00011965756,"about_ca_system_score_gemma":0.00006211303,"threshold_uncertainty_score":0.9996934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08944661,0.0001539358,0.9067672,0.00031824713,0.0013912575,0.00065963087,0.0000011142007,0.00022340307,0.0010386235],"genre_scores_gemma":[0.716382,0.0000049123055,0.2828841,0.0002947023,0.00012377415,0.00014823518,0.0000040687496,0.000014966081,0.00014324009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983857,0.00004365669,0.00032168304,0.0005168007,0.00018143657,0.0005507007],"domain_scores_gemma":[0.9984627,0.0006231767,0.00009491013,0.0005945082,0.000107512074,0.00011724347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396938,0.00016579313,0.00020713174,0.00009302665,0.00010295544,0.00013989054,0.00080255314,0.0001525203,0.000038964874],"category_scores_gemma":[0.000108739805,0.0001491571,0.00006673868,0.00052609266,0.000039978382,0.00010183376,0.00026644845,0.00036738798,0.000013627814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015439688,0.00015476375,0.00020350685,0.000011144476,0.00001104999,0.000019696361,0.00045667024,0.10436529,0.0006348707,0.03334369,0.0015866535,0.8591972],"study_design_scores_gemma":[0.0008647544,0.00006471843,0.0010331677,0.00001591905,0.0000020785028,0.000010902676,0.000016886263,0.9951025,0.00024320872,0.0005066383,0.0019349194,0.00020426139],"about_ca_topic_score_codex":0.000010244813,"about_ca_topic_score_gemma":0.00028775592,"teacher_disagreement_score":0.89073724,"about_ca_system_score_codex":0.00003238725,"about_ca_system_score_gemma":0.000043889715,"threshold_uncertainty_score":0.608245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038042225,0.0009191949,0.95772916,0.0001962443,0.0011484744,0.0010212635,0.000005993349,0.00045451062,0.00048295545],"genre_scores_gemma":[0.98104763,0.00016393437,0.016445344,0.00035650033,0.0011194563,0.0004866425,0.0001245584,0.000100343095,0.00015561206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494785,0.00021972184,0.001330695,0.0013208446,0.0004407839,0.0017400905],"domain_scores_gemma":[0.99679077,0.0011122883,0.0005449794,0.0010706288,0.00023649968,0.00024482366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008687206,0.0006469596,0.0007884384,0.00023114652,0.00036764654,0.00041035216,0.0012614299,0.00064037036,0.000010277659],"category_scores_gemma":[0.000027290815,0.00068720663,0.0002940523,0.0011344656,0.00013242314,0.0007437594,0.0004124179,0.0006123348,0.0000050340714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010370841,0.00023114227,0.001731178,0.000021279613,0.000030841566,0.000050295166,0.00015045892,0.4754481,0.00010192306,0.16717377,0.00091514847,0.35404214],"study_design_scores_gemma":[0.0027749324,0.00011399957,0.002145276,0.0002518005,0.000018581837,0.000027538252,0.00004579119,0.9915033,0.0000670628,0.0009627396,0.0013198624,0.0007691292],"about_ca_topic_score_codex":0.00022204765,"about_ca_topic_score_gemma":0.0020307314,"teacher_disagreement_score":0.9430054,"about_ca_system_score_codex":0.00030789556,"about_ca_system_score_gemma":0.00010817198,"threshold_uncertainty_score":0.9995579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010926733,0.00008972064,0.77243155,0.00041692262,0.00034132853,0.00015409366,4.3672347e-7,0.00039271318,0.2152465],"genre_scores_gemma":[0.91722476,0.000002262699,0.07115694,0.0006447428,0.00018055385,0.000013507598,0.0000015877839,0.000008733583,0.010766907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989876,0.000021885257,0.00015660444,0.00031633733,0.0002044122,0.00031313006],"domain_scores_gemma":[0.99923253,0.0000647441,0.000030733878,0.00057997945,0.000028792594,0.000063191685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111316775,0.0000988835,0.00009582775,0.000034940316,0.000059216043,0.00015403987,0.0005512913,0.000050533676,0.00041612738],"category_scores_gemma":[0.0000047788485,0.000084981155,0.000038161084,0.0002323826,0.000026311007,0.00035438774,0.00022849979,0.000079155005,0.0006796698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004651506,0.00023902305,0.0072328467,0.00001158239,0.00001313471,0.00010295677,0.000048399004,0.008541705,0.0010991603,0.60920256,0.2963205,0.07718345],"study_design_scores_gemma":[0.00043718092,0.000031575102,0.036735546,0.0000099671,0.000002924909,0.00002222665,0.0000016805093,0.8787759,0.0018329138,0.0063995575,0.0754951,0.00025544604],"about_ca_topic_score_codex":0.00033588978,"about_ca_topic_score_gemma":0.00011089496,"teacher_disagreement_score":0.90629804,"about_ca_system_score_codex":0.000025936153,"about_ca_system_score_gemma":0.000015397805,"threshold_uncertainty_score":0.87360066},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11071591,0.00020967005,0.8617494,0.00044251635,0.000081054335,0.00027641148,6.9028255e-7,0.00024550062,0.026278848],"genre_scores_gemma":[0.97801673,0.0001013795,0.02134398,0.0002051794,0.00009296741,0.000025249288,0.0000022973138,0.000009065556,0.00020314059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987555,0.00007952376,0.00025150288,0.00030769428,0.00020852784,0.00039723786],"domain_scores_gemma":[0.999034,0.0001832402,0.000056848967,0.0005306519,0.00007984905,0.00011544747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004961116,0.00015576114,0.00016448091,0.000039269176,0.00022595887,0.00028628128,0.0004344841,0.00006359128,0.00009043727],"category_scores_gemma":[0.000013978723,0.00012084375,0.000027323418,0.00039505874,0.0001253191,0.0014103287,0.00013634203,0.00019444748,0.0000034232064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014633451,0.0003664762,0.17973264,0.00025628356,0.00022648735,0.00008650422,0.042845305,0.08001004,0.00010271522,0.38640255,0.006068278,0.30375642],"study_design_scores_gemma":[0.00032984288,0.000085931286,0.004429772,0.00004724309,0.000007243471,0.000069035115,0.0008069055,0.9913426,0.00012057318,0.0013115692,0.0012126005,0.00023670481],"about_ca_topic_score_codex":0.00010847061,"about_ca_topic_score_gemma":0.0004936803,"teacher_disagreement_score":0.91133255,"about_ca_system_score_codex":0.00003512206,"about_ca_system_score_gemma":0.000032394706,"threshold_uncertainty_score":0.49278653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005367893,0.00016857541,0.9914504,0.0006148569,0.00013383135,0.0014707404,0.000119669836,0.00022478373,0.00044922333],"genre_scores_gemma":[0.5756896,0.000019942838,0.4226955,0.0001107862,0.000056679182,0.0007073065,0.00055095076,0.000017478862,0.00015175118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984698,0.00008458354,0.00044829072,0.00039622563,0.00013357894,0.00046747155],"domain_scores_gemma":[0.99494827,0.0011515018,0.00018540162,0.0030556738,0.00052820396,0.00013097517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012074859,0.00017588506,0.00019235241,0.00006497315,0.0007061006,0.0002711894,0.0030585858,0.00013500347,0.0000022771928],"category_scores_gemma":[0.00012096632,0.000187088,0.00013247452,0.00041512516,0.00018480631,0.0003313347,0.00057760027,0.00017997081,0.0000081524895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023189055,0.0024698474,0.0011582667,0.00013842701,0.000284238,0.0000025026955,0.0022764378,0.13268739,0.009241479,0.6161347,0.004640361,0.23073445],"study_design_scores_gemma":[0.00073888403,0.000080364516,0.001437886,0.000008910276,0.000019624935,0.0000095646865,0.00004329892,0.98088574,0.0017875627,0.0004856114,0.014265989,0.0002365331],"about_ca_topic_score_codex":0.000018771265,"about_ca_topic_score_gemma":0.000049126716,"teacher_disagreement_score":0.84819835,"about_ca_system_score_codex":0.00009517336,"about_ca_system_score_gemma":0.00008029058,"threshold_uncertainty_score":0.7629227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03495544,0.000025714757,0.95940524,0.00034746708,0.00038220175,0.0012001515,0.0000015588779,0.0004944691,0.0031877365],"genre_scores_gemma":[0.7055628,0.000010805634,0.29259813,0.0010714557,0.00014096039,0.00032430637,0.0000058120577,0.000019606006,0.00026612854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740094,0.00009589235,0.0004757302,0.0008823607,0.00035331043,0.0007917869],"domain_scores_gemma":[0.9980284,0.00028346636,0.00013503614,0.0012624036,0.000099910154,0.0001907837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009348531,0.00027794464,0.00031484762,0.00007224124,0.00036437725,0.00011325233,0.001251527,0.00007836367,0.00004786268],"category_scores_gemma":[0.000014692101,0.00026552755,0.0001793803,0.00039595965,0.00010062137,0.00032973164,0.00042506057,0.00020411181,0.000017934486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012634287,0.0009638925,0.0033732778,0.00019297631,0.0002275627,0.00037996666,0.00028657113,0.03144262,0.00016770976,0.7916002,0.050861526,0.120377354],"study_design_scores_gemma":[0.0009486126,0.00007093208,0.0007087786,0.000030001074,0.0000066668695,0.000015655083,0.000014196199,0.99401045,0.00045670784,0.0016489887,0.0017607681,0.00032824895],"about_ca_topic_score_codex":0.000017579285,"about_ca_topic_score_gemma":0.00000939958,"teacher_disagreement_score":0.9625678,"about_ca_system_score_codex":0.00013033907,"about_ca_system_score_gemma":0.0000601888,"threshold_uncertainty_score":0.9999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1162524,0.005043962,0.8770631,0.00030154455,0.000930341,0.0002587296,0.0000029869034,0.000019556735,0.0001273805],"genre_scores_gemma":[0.9895196,0.0011084467,0.009084272,0.000022650911,0.00019561124,0.000026697004,0.000009046531,0.0000080271475,0.000025675381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820113,0.00022724475,0.00093445485,0.00013170813,0.00040964264,0.00009580219],"domain_scores_gemma":[0.99625605,0.00045542303,0.0012614387,0.00044836072,0.0015392109,0.000039499057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013590246,0.00010465251,0.00023385916,0.0001855722,0.00007410463,0.0001643881,0.0011186718,0.00009346463,0.0000012558252],"category_scores_gemma":[0.00006305844,0.00009374323,0.000095090276,0.0001646411,0.000067120716,0.00068166613,0.00017418848,0.00018798995,4.7426016e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051966653,0.0005896257,0.0014474405,0.000036040714,0.00024509343,0.000003631773,0.0010159224,0.10989098,0.041878924,0.12591538,0.0011712586,0.71728605],"study_design_scores_gemma":[0.0010953562,0.00023052235,0.0054977397,0.00037304158,0.00001914062,0.00012717373,0.00013169061,0.9740044,0.0042973775,0.0049173585,0.009157631,0.00014855839],"about_ca_topic_score_codex":0.000058692593,"about_ca_topic_score_gemma":0.00007152739,"teacher_disagreement_score":0.8732672,"about_ca_system_score_codex":0.00012853407,"about_ca_system_score_gemma":0.00004181974,"threshold_uncertainty_score":0.3822738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4784115,0.00053066877,0.51815766,0.00037194096,0.00050331897,0.0010796313,8.070695e-7,0.00022261293,0.0007218918],"genre_scores_gemma":[0.9728789,0.00001133206,0.025772693,0.0007225094,0.00052786083,0.000026628955,0.000007281462,0.00002224698,0.000030562616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973005,0.00031879699,0.0006253243,0.0005893897,0.00046736104,0.000698621],"domain_scores_gemma":[0.99756736,0.0012324428,0.00023315244,0.000771954,0.00012741236,0.00006769619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003497607,0.00023298034,0.00026846168,0.00023571239,0.00028917115,0.00048363206,0.0013895606,0.0001409499,0.000002000831],"category_scores_gemma":[0.000070946546,0.00019029548,0.00006824698,0.002062195,0.000052119332,0.0005250222,0.0005123244,0.0004743624,0.00002366523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005126963,0.0002744468,0.021298328,0.00017545754,0.00007051873,0.00024817997,0.08684423,0.05488075,0.00064717693,0.004428931,0.004959954,0.82612073],"study_design_scores_gemma":[0.0017205663,0.0003664666,0.01896892,0.00033033284,0.00002358876,0.00006382597,0.0057539437,0.92415166,0.0006843163,0.0005524778,0.04646862,0.0009153004],"about_ca_topic_score_codex":0.000018571473,"about_ca_topic_score_gemma":0.0001028608,"teacher_disagreement_score":0.8692709,"about_ca_system_score_codex":0.00015227727,"about_ca_system_score_gemma":0.000120128825,"threshold_uncertainty_score":0.77600247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019513966,0.000029761879,0.9840253,0.0039805183,0.0016108758,0.0018439782,0.0000032877613,0.00037461738,0.0061802897],"genre_scores_gemma":[0.9225072,0.000027996062,0.06680485,0.0052011935,0.0005928154,0.0014362017,0.000010688181,0.00004668731,0.0033723244],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734527,0.00006090502,0.0004693669,0.00086448935,0.00032206852,0.0009379251],"domain_scores_gemma":[0.99731964,0.00016191388,0.00012393382,0.0018167987,0.0002489804,0.00032873938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034464666,0.0003304633,0.00035003055,0.000090320274,0.00017378244,0.00045908926,0.0034094357,0.00015952381,0.00016346114],"category_scores_gemma":[0.000034339566,0.00028428188,0.00012750017,0.00047914023,0.000045932557,0.0010627666,0.0018509846,0.00019994452,0.0002963695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060432838,0.00021920893,0.00010935332,0.000035619334,0.00011893217,0.0000062665185,0.0010212942,0.0043472885,0.00019776214,0.17846145,0.5346933,0.28072912],"study_design_scores_gemma":[0.00077355554,0.0006964809,0.00023986562,0.000076873075,0.000008589036,0.000006034652,0.000059985254,0.93579215,0.00040558356,0.059362277,0.0020571724,0.0005214036],"about_ca_topic_score_codex":0.00019051283,"about_ca_topic_score_gemma":0.00014918623,"teacher_disagreement_score":0.9314449,"about_ca_system_score_codex":0.00009392533,"about_ca_system_score_gemma":0.00004300837,"threshold_uncertainty_score":0.99996096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03637121,0.0013439538,0.9603828,0.0008768239,0.00027201785,0.00038998274,0.0000017798006,0.0001865957,0.0001748079],"genre_scores_gemma":[0.99811935,0.00009369905,0.0012388165,0.00015961063,0.00006517949,0.000047428555,0.000076615375,0.00001025374,0.00018906393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.0001027146,0.00029934238,0.00045032217,0.00015793717,0.000326836],"domain_scores_gemma":[0.99930084,0.000103300976,0.00009955216,0.00034400672,0.000059487484,0.000092811264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032117125,0.0001612452,0.0001840055,0.00008505062,0.00009332859,0.00011760857,0.00024972163,0.00014526906,0.000010323632],"category_scores_gemma":[0.000017213632,0.00015105642,0.000032072585,0.00043972218,0.000029095827,0.00036264415,0.000084909116,0.0001685317,0.0000065970344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017714943,0.0006275645,0.0034287847,0.00004925215,0.000042498872,0.00009236454,0.00018377801,0.78415537,0.008635586,0.04992071,0.0060995677,0.1465874],"study_design_scores_gemma":[0.0011144192,0.00007227812,0.009564544,0.000028252634,0.000004976862,0.000009021324,0.000010889365,0.986363,0.00013047969,0.0018439594,0.0006811115,0.00017710304],"about_ca_topic_score_codex":0.00011891407,"about_ca_topic_score_gemma":0.00050764706,"teacher_disagreement_score":0.9617481,"about_ca_system_score_codex":0.00010313653,"about_ca_system_score_gemma":0.000025358248,"threshold_uncertainty_score":0.6159902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09771304,0.005905932,0.81271815,0.0026211056,0.010625226,0.008603713,0.000067295885,0.002033167,0.059712373],"genre_scores_gemma":[0.95576537,0.00013479043,0.007684426,0.00013553472,0.0023290538,0.00007691519,0.0011377202,0.00019138122,0.03254482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939987,0.0005639483,0.0005339586,0.001788401,0.0014355492,0.001679461],"domain_scores_gemma":[0.99543136,0.0011353829,0.0004503105,0.0015062223,0.0009116587,0.00056504435],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011157758,0.0006039509,0.00068069395,0.0012037428,0.0018943178,0.00061317073,0.0028437725,0.00083067536,0.00001856411],"category_scores_gemma":[0.000069055684,0.00072079815,0.00056846376,0.0021158,0.00018644039,0.0006773768,0.0002841508,0.0019604084,0.000023263266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009457147,0.0028669909,0.0060813744,0.0011231349,0.0024406211,0.0160953,0.0010267589,0.13989793,0.0042371647,0.13490671,0.05644294,0.6254239],"study_design_scores_gemma":[0.002172272,0.001794326,0.018035617,0.0006664722,0.00011905181,0.000044946504,0.00012416289,0.9523412,0.0028608344,0.002687738,0.017759219,0.0013941796],"about_ca_topic_score_codex":0.0011069393,"about_ca_topic_score_gemma":0.014560908,"teacher_disagreement_score":0.8580523,"about_ca_system_score_codex":0.0013945355,"about_ca_system_score_gemma":0.0023602287,"threshold_uncertainty_score":0.9995243},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15577368,0.00001980789,0.83158696,0.0014363043,0.0010307673,0.00024817264,5.030813e-7,0.000367971,0.009535843],"genre_scores_gemma":[0.7762036,0.0000039003694,0.22161736,0.0017689728,0.00034570304,0.000012164941,2.3377882e-7,0.000010328027,0.000037757847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627584,0.00011227049,0.0003521762,0.0011782174,0.0010832633,0.0009982487],"domain_scores_gemma":[0.99702597,0.00027666456,0.000060038816,0.0017045111,0.00020085732,0.0007319564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976322,0.00025246944,0.00028615881,0.0002357442,0.00050187396,0.0003748018,0.005104078,0.00007018948,0.00009491444],"category_scores_gemma":[0.00010471766,0.00021727211,0.000078249555,0.0025356603,0.002462322,0.0008936515,0.0028587298,0.00028462382,0.00076165807],"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.000008176789,0.000045228928,0.000045765435,0.00000159356,0.0000022713914,0.000061865634,0.0006945868,0.0003254588,0.0012113036,0.96841246,0.0011260534,0.028065212],"study_design_scores_gemma":[0.00044214475,0.00062623527,0.008762885,0.000051058367,0.0000037739662,0.00049733615,0.0000061213127,0.8489415,0.01390648,0.122213624,0.003700728,0.0008480865],"about_ca_topic_score_codex":0.0000025165853,"about_ca_topic_score_gemma":3.4043282e-7,"teacher_disagreement_score":0.84861606,"about_ca_system_score_codex":0.0000891568,"about_ca_system_score_gemma":0.00022284128,"threshold_uncertainty_score":0.97898275},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013518981,0.00005225814,0.9415428,0.00046864836,0.053871237,0.0009483147,0.0000030995532,0.0004975013,0.0012642507],"genre_scores_gemma":[0.17009717,0.000081015896,0.27981284,0.007045617,0.5418984,0.00028182723,0.000064936066,0.00017778685,0.00054037553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653405,0.000098431316,0.00057952007,0.001249871,0.00037927637,0.0011588691],"domain_scores_gemma":[0.9969549,0.00055754196,0.00031277924,0.0016257849,0.00019936044,0.00034962702],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045253176,0.0005621911,0.00055136083,0.00015212876,0.00046116984,0.0012007618,0.0038592669,0.0005307811,0.000093613016],"category_scores_gemma":[0.000013154149,0.0005386097,0.0002608824,0.0006981174,0.000119560646,0.0007157167,0.0013929341,0.0013828818,0.00005205645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023123217,0.000060975057,0.00051775353,0.00000986116,0.000030456134,0.000017332146,0.00008911588,0.1151488,0.0000058121673,0.006245954,0.28574884,0.592102],"study_design_scores_gemma":[0.00066605915,0.000096918244,0.001371398,0.000044312623,0.000007689185,0.000016455002,7.2894e-7,0.6129978,0.00001841663,0.0005597302,0.3838384,0.00038215867],"about_ca_topic_score_codex":0.0000041329536,"about_ca_topic_score_gemma":0.000069438676,"teacher_disagreement_score":0.66172993,"about_ca_system_score_codex":0.00006287455,"about_ca_system_score_gemma":0.000075729615,"threshold_uncertainty_score":0.9998361},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24321754,0.0043271957,0.74162835,0.00019503693,0.00007630043,0.009886379,0.0000064895826,0.00029589035,0.00036681278],"genre_scores_gemma":[0.860514,0.00085350004,0.13441545,0.00014673015,0.000047283283,0.003967568,0.0000063015955,0.00002612823,0.000023084443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983481,0.00019052802,0.00040104604,0.000538775,0.00010767334,0.0004138732],"domain_scores_gemma":[0.997231,0.000663816,0.00022167765,0.001585305,0.000119877994,0.00017833993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005301939,0.000256844,0.00035127933,0.00008702814,0.0007873489,0.00024342386,0.0011069415,0.00012695508,0.0000014587757],"category_scores_gemma":[0.000012775185,0.0002453287,0.000050096827,0.00021681143,0.00037745852,0.00013891885,0.0019206415,0.00033456014,4.6671926e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019902594,0.0001080516,0.0012909849,0.00008429798,0.000039249247,0.0000016093921,0.004137458,0.0002533371,0.00015275877,0.02245354,0.00005819175,0.9714006],"study_design_scores_gemma":[0.0006730414,0.00025855424,0.0022973851,0.00021157817,0.000016051208,0.00006364113,0.00020369883,0.98988307,0.00010315189,0.0008655859,0.0050777514,0.00034649915],"about_ca_topic_score_codex":0.000027602286,"about_ca_topic_score_gemma":0.000042906577,"teacher_disagreement_score":0.98962975,"about_ca_system_score_codex":0.000016563594,"about_ca_system_score_gemma":0.000033431712,"threshold_uncertainty_score":0.9999999},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010201095,0.00013820786,0.9754464,0.0013315277,0.00027711815,0.020037964,0.000004501152,0.00023730042,0.001506857],"genre_scores_gemma":[0.13200441,0.00008906463,0.8235595,0.0023257628,0.00096158544,0.035118144,0.00001512136,0.00011576135,0.005810594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977311,0.000042630203,0.00056406076,0.00062877854,0.00043138504,0.00060206954],"domain_scores_gemma":[0.99727565,0.00024434074,0.00025052155,0.0017607894,0.00019951239,0.00026919853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038881548,0.00026077862,0.0004227729,0.00007895757,0.000109502726,0.00015758949,0.0025480133,0.00021211359,0.000030767565],"category_scores_gemma":[0.0000468943,0.00022377077,0.00018448374,0.0007222156,0.00007239825,0.00042442518,0.00068721967,0.00019833942,0.000014741536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024864098,0.00044245346,0.00016498183,0.00013092761,0.000080894824,0.000021950193,0.00041323254,0.15084644,0.00028383627,0.4675515,0.11846031,0.26135483],"study_design_scores_gemma":[0.009307128,0.0018437165,0.00041070592,0.00059908093,0.000024301571,0.00003209421,0.000031361094,0.8121631,0.007686966,0.0646781,0.102327384,0.00089603395],"about_ca_topic_score_codex":0.00005457843,"about_ca_topic_score_gemma":0.00025658283,"teacher_disagreement_score":0.6613167,"about_ca_system_score_codex":0.000104879466,"about_ca_system_score_gemma":0.00043351887,"threshold_uncertainty_score":0.9125107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33069888,0.0000807838,0.668487,0.000037996047,0.000052597414,0.0004886811,8.823068e-7,0.000044441644,0.00010873894],"genre_scores_gemma":[0.9916614,0.0000541078,0.007861809,0.00017257773,0.000061355226,0.00005098432,0.000003683265,0.000011388975,0.0001226697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902683,0.000053900363,0.0002173582,0.0003141535,0.0001729378,0.00021483256],"domain_scores_gemma":[0.9986728,0.0005604315,0.0001730416,0.0002899942,0.00024621177,0.00005751306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023017242,0.00014121798,0.0002072044,0.000051566985,0.00013816613,0.000023753115,0.00017429485,0.00007173527,0.0000028616569],"category_scores_gemma":[0.000011312461,0.000110234556,0.00002605185,0.00024578813,0.000069078415,0.0004495734,0.000029768895,0.000088655084,0.0000015357742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043963094,0.000024885416,0.0019600883,0.000007335391,0.000016468006,9.581261e-7,0.00013076751,0.95049214,0.000014055079,0.0026157065,0.000039606122,0.044258367],"study_design_scores_gemma":[0.00152447,0.0011933846,0.03144512,0.00004247682,0.000008928427,0.0000028306279,0.0000049243713,0.96536154,0.000134084,0.00006769799,0.00007702437,0.0001375183],"about_ca_topic_score_codex":0.000003248408,"about_ca_topic_score_gemma":0.000015284193,"teacher_disagreement_score":0.6609626,"about_ca_system_score_codex":0.000031057607,"about_ca_system_score_gemma":0.000038126116,"threshold_uncertainty_score":0.44952348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046638217,0.000029609622,0.94791645,0.00003927253,0.0039100274,0.0008862971,0.000018274459,0.0005381945,0.000023682278],"genre_scores_gemma":[0.83028376,0.0000070538485,0.1693987,0.00007728001,0.00011869705,0.0000506998,0.000007271564,0.00003563034,0.000020918496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975489,0.00015910313,0.00057343015,0.0008011212,0.00032942713,0.000588035],"domain_scores_gemma":[0.997943,0.00045696116,0.0002498608,0.00088615244,0.0002455076,0.00021852959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044085842,0.00036073246,0.00038994616,0.00019760663,0.00065207435,0.0005457558,0.001349679,0.00021737505,0.00009858137],"category_scores_gemma":[0.000018864415,0.0003770166,0.00018395722,0.0008085765,0.00010463978,0.0008436962,0.000032565775,0.0008873245,0.000024679406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024691046,0.00024226525,0.000015830637,0.000013383885,0.000034035053,0.0000068688787,0.00026661262,0.9786478,0.0035153658,0.000019104718,0.000022665132,0.017191345],"study_design_scores_gemma":[0.0021012921,0.00006131702,0.000018237011,0.00006396425,0.000026103278,0.000040676518,0.000035535562,0.96947986,0.027697915,0.000009632554,0.00009036057,0.00037509066],"about_ca_topic_score_codex":0.00007464526,"about_ca_topic_score_gemma":0.00003744498,"teacher_disagreement_score":0.7836455,"about_ca_system_score_codex":0.00010021262,"about_ca_system_score_gemma":0.00008479296,"threshold_uncertainty_score":0.99986815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3285787,0.002563727,0.66441756,0.0000136361305,0.00093021244,0.0028766245,0.0000034621582,0.00024092536,0.0003751259],"genre_scores_gemma":[0.98875844,0.00035658505,0.007569536,0.00005285086,0.000832631,0.0020118102,0.00002916035,0.00006438687,0.00032458684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966273,0.00015829995,0.0008031886,0.00096808065,0.00046493366,0.0009782161],"domain_scores_gemma":[0.99742275,0.00037379842,0.0004560123,0.0013000856,0.00030744995,0.00013988065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060848496,0.0004592892,0.00070300733,0.0001176647,0.0003397299,0.00015309996,0.0013497103,0.00028044474,0.000009995873],"category_scores_gemma":[0.000005938314,0.00043514627,0.00018743883,0.00093158253,0.000115405266,0.0006054488,0.00041641513,0.00046238597,0.000004531117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013547341,0.00068066287,0.0014368695,0.000018556451,0.000078506455,0.000005615443,0.00031869736,0.73661983,0.0000073356086,0.00028944985,0.0020769564,0.25833207],"study_design_scores_gemma":[0.002422179,0.0014971445,0.004418592,0.00006629751,0.000050376424,0.000008169067,0.00010426539,0.9889174,0.00009614859,0.00007346525,0.0018822242,0.0004637453],"about_ca_topic_score_codex":0.000022575683,"about_ca_topic_score_gemma":0.0001408595,"teacher_disagreement_score":0.66017973,"about_ca_system_score_codex":0.00010119503,"about_ca_system_score_gemma":0.00007183119,"threshold_uncertainty_score":0.99981004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15029109,0.0017956168,0.8275427,0.016467504,0.00016439697,0.00083853345,0.0000030087872,0.00028123296,0.0026158912],"genre_scores_gemma":[0.82332873,0.00047778315,0.175111,0.0008799146,0.000033165146,0.00010824158,0.000010568426,0.0000132091245,0.000037402475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747866,0.0005978623,0.0009413605,0.00030870325,0.00022179094,0.000451647],"domain_scores_gemma":[0.9950445,0.0014784513,0.00053793105,0.002337019,0.0004599471,0.0001421018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017324642,0.0001642627,0.00033028555,0.00022066891,0.00020964518,0.00014192327,0.0028955247,0.00014385869,0.000014154067],"category_scores_gemma":[0.0007853466,0.00017602269,0.000102179765,0.0021766054,0.00013077924,0.00076329935,0.0011371266,0.0006076924,0.000025287689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013130015,0.0006666143,0.12768008,0.00004977151,0.00008870125,9.649796e-7,0.0027621666,0.051493146,0.0008614939,0.1607144,0.0028566641,0.6528247],"study_design_scores_gemma":[0.00017654133,0.0000194872,0.10046471,0.00007998015,0.000002238571,0.0000010352261,0.00007739984,0.8964285,0.0003959475,0.0019338923,0.00022064346,0.00019958479],"about_ca_topic_score_codex":0.001834897,"about_ca_topic_score_gemma":0.00047673777,"teacher_disagreement_score":0.8449354,"about_ca_system_score_codex":0.000028757338,"about_ca_system_score_gemma":0.000079785255,"threshold_uncertainty_score":0.7177997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04290628,0.00009580338,0.9514469,0.00012423085,0.0043939003,0.00017508022,1.1837886e-7,0.000110948844,0.0007467274],"genre_scores_gemma":[0.9965556,0.0000074820246,0.0008943118,0.00021645585,0.002147151,0.000016712313,3.5153542e-7,0.000026509875,0.000135403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969988,0.00070321764,0.000738985,0.00035592553,0.0005032818,0.00069982343],"domain_scores_gemma":[0.99829584,0.00030736905,0.00045176354,0.0005712141,0.00011850027,0.0002553025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029673132,0.00021947721,0.0003928539,0.00018269575,0.00022852005,0.00066925207,0.0012302392,0.00016501243,0.000005243271],"category_scores_gemma":[0.000035336627,0.00019728403,0.00011883164,0.0005035555,0.00003290546,0.00037815952,0.00007399496,0.00081350445,0.000030437286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073011474,0.000037928578,0.008497604,0.00001804643,0.000015832882,0.000053654363,0.0001926117,0.95299304,0.00011592358,0.008281119,0.0021149013,0.027672034],"study_design_scores_gemma":[0.00068712694,0.000059805003,0.0005461564,0.00031433112,0.000003783781,0.00033981976,0.000013468093,0.9963274,0.000043649357,0.00008825188,0.0013489326,0.00022725727],"about_ca_topic_score_codex":0.000074599324,"about_ca_topic_score_gemma":0.000029599885,"teacher_disagreement_score":0.95364934,"about_ca_system_score_codex":0.00017462498,"about_ca_system_score_gemma":0.000106906766,"threshold_uncertainty_score":0.80450094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048088538,0.02382026,0.97167027,0.0024088132,0.0012452569,0.00015107589,0.000019843523,0.000033417076,0.00017018229],"genre_scores_gemma":[0.8959282,0.0062304717,0.095345795,0.00021771569,0.0018658197,0.0000093085,0.0003548127,0.000019874744,0.000028010767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840105,0.00009584606,0.0007369894,0.00023981601,0.00030474208,0.0002215882],"domain_scores_gemma":[0.9953479,0.0012769658,0.0007876665,0.0015829788,0.0009449394,0.000059553542],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009896045,0.00014575802,0.00023383675,0.00014365249,0.00028408834,0.00053251354,0.005397623,0.000069679736,0.0000020442828],"category_scores_gemma":[0.0000956433,0.00013954708,0.00005372986,0.0003327779,0.00010398026,0.0011072946,0.0020890618,0.00026257554,3.3901694e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052454954,0.00017993653,0.002943521,0.000011128381,0.00016937726,0.0000208184,0.000089951376,0.1627023,0.000024508248,0.021871446,0.007970648,0.8039639],"study_design_scores_gemma":[0.0004599764,0.000019715064,0.0018713584,0.0002823744,0.000026389587,0.00008813609,0.000007509749,0.84115803,3.5207128e-7,0.0018435916,0.15411781,0.00012475309],"about_ca_topic_score_codex":0.000020072952,"about_ca_topic_score_gemma":0.00010549321,"teacher_disagreement_score":0.8954473,"about_ca_system_score_codex":0.00006098832,"about_ca_system_score_gemma":0.00008550705,"threshold_uncertainty_score":0.99998367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022698168,0.00013813813,0.9672777,0.0022239569,0.0011126063,0.00036274106,9.055692e-7,0.00025626825,0.02635789],"genre_scores_gemma":[0.91643214,0.000008123187,0.07761344,0.0024199253,0.0010756259,0.00009638875,0.0000024802973,0.000015453545,0.0023364304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987291,0.000031988217,0.0001757342,0.0002822049,0.00019145687,0.0005895325],"domain_scores_gemma":[0.99882317,0.00026501698,0.000046073525,0.0005872878,0.000057179663,0.00022126049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002972366,0.00012701533,0.00014174268,0.000039021677,0.00008502497,0.00023551006,0.0010611402,0.00010513459,0.00019515342],"category_scores_gemma":[0.00003309131,0.000103895436,0.0000648183,0.00018478608,0.000022853443,0.0013000342,0.0004576258,0.00012558905,0.00022728597],"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.000020852227,0.00027059508,0.005693676,0.000034121345,0.00004430384,0.000011188004,0.00027264998,0.00023342694,0.00023537804,0.6253566,0.1757143,0.19211291],"study_design_scores_gemma":[0.0010474187,0.00020079233,0.011453413,0.000015816451,0.000027484612,0.00009969529,0.000009571226,0.28100827,0.0072281263,0.007880653,0.69028085,0.00074786576],"about_ca_topic_score_codex":0.000012488449,"about_ca_topic_score_gemma":0.000009313231,"teacher_disagreement_score":0.91416234,"about_ca_system_score_codex":0.000032423,"about_ca_system_score_gemma":0.000029568453,"threshold_uncertainty_score":0.42367327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028558758,0.00044978494,0.9881223,0.0007093606,0.0031758458,0.0033666824,0.0000029362295,0.0009754227,0.00034180423],"genre_scores_gemma":[0.96248084,0.0002965197,0.028634561,0.0016655615,0.0029567385,0.003120782,0.00003734439,0.00015619962,0.00065142306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944525,0.00038119408,0.0010298477,0.0015268541,0.0005663257,0.002043318],"domain_scores_gemma":[0.99543667,0.0008896017,0.0004893294,0.0020782999,0.00048246907,0.00062364514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010091275,0.0007797984,0.0009529007,0.00016094424,0.00057838554,0.0009353567,0.0025765165,0.0006771795,0.00012628279],"category_scores_gemma":[0.000026592437,0.00074315764,0.000419887,0.0010586922,0.00018392406,0.0011824942,0.0007703442,0.0008551988,0.00013466351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046309164,0.00019873907,0.00014576917,0.000050150313,0.00016378726,0.00003537142,0.00023368328,0.48246866,0.00009699819,0.041124195,0.20604537,0.26939097],"study_design_scores_gemma":[0.0010914713,0.0002290891,0.0004982937,0.00017925036,0.000031845895,0.00003598953,0.0000340876,0.99375755,0.000115779796,0.0014578396,0.0016613976,0.00090738054],"about_ca_topic_score_codex":0.00009589171,"about_ca_topic_score_gemma":0.00003082682,"teacher_disagreement_score":0.959625,"about_ca_system_score_codex":0.00019262245,"about_ca_system_score_gemma":0.0001501785,"threshold_uncertainty_score":0.99950194},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057806194,0.021091316,0.9122736,0.002192008,0.00043915823,0.0012277134,0.0000047557637,0.000974963,0.003990316],"genre_scores_gemma":[0.9358599,0.0060975556,0.056635145,0.00043692152,0.000032003874,0.00035445992,0.00002483134,0.000033511646,0.0005256636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791557,0.00036183232,0.0005357834,0.00043824673,0.00020369716,0.0005448757],"domain_scores_gemma":[0.99428874,0.0005930524,0.00019398385,0.0046923263,0.000100919264,0.00013095172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047029497,0.00022386952,0.0002758079,0.00012165395,0.00062034524,0.00009939835,0.0043796496,0.00016149576,0.00001298458],"category_scores_gemma":[0.000044012584,0.00024855457,0.000112469155,0.0010408562,0.00020761583,0.00045440914,0.0018384422,0.0007989179,0.00009301684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023815668,0.0014103885,0.0080247605,0.000015687274,0.00009018396,0.00004262475,0.017080361,0.38552317,0.0008517178,0.007080255,0.0081023285,0.5717547],"study_design_scores_gemma":[0.00043136725,0.000032622356,0.003145653,0.00004349525,0.000004577256,0.00004068319,0.00009019478,0.9347789,0.000016898039,0.00014195246,0.061008517,0.00026513854],"about_ca_topic_score_codex":0.00003927026,"about_ca_topic_score_gemma":0.0007590416,"teacher_disagreement_score":0.8780537,"about_ca_system_score_codex":0.0001562479,"about_ca_system_score_gemma":0.000090993955,"threshold_uncertainty_score":0.99999666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027834265,0.010967559,0.982229,0.0027941717,0.00035138847,0.0005323773,0.0000095049345,0.00010918973,0.00022339102],"genre_scores_gemma":[0.8119151,0.02189375,0.16534846,0.0003622871,0.00022903536,0.00008424224,0.00011727669,0.00003894058,0.00001088575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732834,0.00048346177,0.00088941236,0.00042125877,0.00027820384,0.0005993279],"domain_scores_gemma":[0.9941963,0.0030660226,0.0005260889,0.0016725239,0.00027529278,0.00026374756],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0021896786,0.0003171885,0.00040349818,0.00029664,0.0014937442,0.0005031214,0.0018321853,0.00019830624,0.0000023600378],"category_scores_gemma":[0.000030635318,0.00032355817,0.00010631972,0.0009421569,0.00033210684,0.00043998234,0.0006464316,0.0010205996,6.6413963e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010491203,0.00042021758,0.004227884,0.000009710853,0.000056440014,0.000008659491,0.00020625463,0.046056896,0.000026453266,0.0050539155,0.00012557107,0.9437031],"study_design_scores_gemma":[0.0014383076,0.00019436779,0.0030350308,0.00036277034,0.000023518964,0.000067172135,0.000065178494,0.98524374,0.000007648096,0.00015349154,0.009076124,0.00033267078],"about_ca_topic_score_codex":0.000009020216,"about_ca_topic_score_gemma":0.00029162763,"teacher_disagreement_score":0.9433704,"about_ca_system_score_codex":0.00020680821,"about_ca_system_score_gemma":0.000082327555,"threshold_uncertainty_score":0.9999216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004750813,0.000088490255,0.78974724,0.0039981445,0.000316712,0.14426774,0.0000012384909,0.0011077962,0.055721816],"genre_scores_gemma":[0.29378945,0.000021095075,0.5221342,0.0016479185,0.0005315073,0.17904866,0.000022124803,0.00008145077,0.0027236394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966185,0.0002319808,0.0008519679,0.00090577366,0.0005403574,0.000851394],"domain_scores_gemma":[0.99779826,0.00032565548,0.00027431286,0.0011827664,0.00019636421,0.00022265273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009962887,0.00032520542,0.00038262544,0.00074464676,0.00015238451,0.0007022329,0.0017077393,0.00021871958,0.00016692201],"category_scores_gemma":[0.0001222731,0.0002933609,0.000088614994,0.003787564,0.000030498897,0.0017712207,0.0005738302,0.00060416694,0.00033036812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002709051,0.00046117944,0.046894632,0.00033197444,0.00009182114,0.0001461021,0.000833945,0.028957896,0.0015217272,0.1112878,0.036558717,0.7728871],"study_design_scores_gemma":[0.001066941,0.00013236958,0.023085924,0.00014862225,0.0000035335374,0.00000988002,0.000021647416,0.95531017,0.0005002588,0.008114887,0.01106462,0.0005411664],"about_ca_topic_score_codex":0.00041575846,"about_ca_topic_score_gemma":0.000084241365,"teacher_disagreement_score":0.92635226,"about_ca_system_score_codex":0.00021811915,"about_ca_system_score_gemma":0.00011549531,"threshold_uncertainty_score":0.99995184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15908782,0.00052071316,0.83609396,0.00015795484,0.00018599628,0.0003179722,0.0000011827585,0.0004328462,0.0032015382],"genre_scores_gemma":[0.9776266,0.000097180644,0.021373162,0.00055817503,0.00012217718,0.000025005464,0.0000043583673,0.000009526571,0.00018376578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979405,0.00008525176,0.0004197769,0.00072811457,0.00028138803,0.0005450038],"domain_scores_gemma":[0.9968536,0.0016488533,0.000114157476,0.0010501245,0.00008403236,0.00024924963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016397563,0.00020302225,0.00030950503,0.0001773843,0.00035201563,0.00018936062,0.00058419484,0.000120683544,0.0000787122],"category_scores_gemma":[0.00015398317,0.00017052065,0.00012088527,0.0020155,0.00007941155,0.00025765054,0.00049600063,0.0003259957,0.000017831399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020913423,0.00041202724,0.08584986,0.0000063489074,0.00019545232,0.000035756373,0.00069794705,0.07632944,0.000084963496,0.008405173,0.0012634895,0.82669866],"study_design_scores_gemma":[0.00023145844,0.00022893994,0.052314993,0.000011169549,0.00006355658,0.000004559629,0.000069233116,0.94488895,0.00012856936,0.0003146694,0.0014707096,0.00027320703],"about_ca_topic_score_codex":0.000026930556,"about_ca_topic_score_gemma":0.00059711334,"teacher_disagreement_score":0.8685595,"about_ca_system_score_codex":0.000075630145,"about_ca_system_score_gemma":0.000021874434,"threshold_uncertainty_score":0.69536304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009334185,0.00001590391,0.97914475,0.00020553048,0.00040420736,0.019539073,0.0000010271566,0.00029736123,0.00029878545],"genre_scores_gemma":[0.034497697,0.0000027426333,0.93029505,0.00052938005,0.00009871477,0.03325233,0.000009198818,0.000027453465,0.0012874521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814326,0.000121339974,0.00038611723,0.00058475573,0.00023113229,0.0005334059],"domain_scores_gemma":[0.99871683,0.00007786532,0.00012050876,0.00069504674,0.00017569744,0.00021406099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770385,0.0002039708,0.00024595635,0.0000974428,0.00005599305,0.00016848555,0.0008799526,0.000196332,0.000019727167],"category_scores_gemma":[0.00009020846,0.00018323118,0.00007125268,0.00045744685,0.000023626522,0.00059483893,0.00027480838,0.00019564883,0.00005988889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029574637,0.0021558723,0.0016358462,0.000097742406,0.000052460284,0.000041098567,0.002699816,0.17822737,0.0017642779,0.3442487,0.05799604,0.41078502],"study_design_scores_gemma":[0.002679339,0.00018823409,0.00025039926,0.000044696415,0.0000016531785,0.000004248162,0.000041010517,0.9893597,0.0004313665,0.0028086845,0.00394181,0.0002489088],"about_ca_topic_score_codex":0.000043722826,"about_ca_topic_score_gemma":0.0004836323,"teacher_disagreement_score":0.8111323,"about_ca_system_score_codex":0.00013989132,"about_ca_system_score_gemma":0.00008437836,"threshold_uncertainty_score":0.74719507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005457212,0.00052068476,0.98454225,0.000030883788,0.00046246845,0.008953385,8.2967466e-7,0.000030054696,0.000002256617],"genre_scores_gemma":[0.8923995,0.000006657564,0.10264935,0.0004361521,0.0019166054,0.0025438992,7.6817264e-7,0.0000446346,0.0000024420099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982766,0.000027136417,0.0004872752,0.00026002276,0.0001768222,0.0007721392],"domain_scores_gemma":[0.99807036,0.00023633355,0.00017147994,0.00021290085,0.00022389335,0.0010850525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006563032,0.00020567568,0.00032653596,0.0003484214,0.00013822198,0.00036983506,0.0008518168,0.00011021083,0.0000025085237],"category_scores_gemma":[0.000020054595,0.00018398871,0.00009857486,0.0005148511,0.000025675117,0.0003513493,0.00003127738,0.00036754739,1.5372828e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034010165,0.00003152792,0.0002855994,0.000019813124,0.0000347573,0.00014422253,0.000077991936,0.9290206,0.00018443412,0.0004687608,0.000119920966,0.06957837],"study_design_scores_gemma":[0.0010323222,0.00068358425,0.0012492228,0.00007550858,0.000010588507,0.00030488652,0.0000012556432,0.9918077,0.00006520715,0.000029228679,0.0045263665,0.00021415134],"about_ca_topic_score_codex":0.000022846489,"about_ca_topic_score_gemma":0.00009909143,"teacher_disagreement_score":0.88694227,"about_ca_system_score_codex":0.00016318572,"about_ca_system_score_gemma":0.0003367995,"threshold_uncertainty_score":0.7502842},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12127901,0.00089186616,0.8597552,0.00003414306,0.00020818895,0.016932612,0.0000033424767,0.00021785391,0.00067773956],"genre_scores_gemma":[0.9504622,0.0000071424975,0.03773014,0.00011115222,0.00017107015,0.011437841,0.00000562148,0.000027511673,0.00004728503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775535,0.00015031899,0.0005713204,0.00049953785,0.0002934453,0.0007300062],"domain_scores_gemma":[0.9981066,0.0005236763,0.00036064678,0.00071700953,0.00008988132,0.0002021776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011838067,0.00027307722,0.00049644156,0.00007612256,0.00019625785,0.00014256702,0.00057690556,0.00012278164,0.000026282796],"category_scores_gemma":[0.000033039858,0.00025211112,0.00012264567,0.00028045024,0.00006712753,0.0005374274,0.00033040685,0.00027576464,0.0000024090218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000334233,0.003034602,0.18031676,0.0018537451,0.00021392298,0.0000051386573,0.006724994,0.17947763,0.003536383,0.028745947,0.0062692463,0.58948743],"study_design_scores_gemma":[0.0012932827,0.0004761759,0.00090129493,0.00040313345,0.000014251116,0.0000021124954,0.00006863851,0.9790065,0.009732843,0.00023453806,0.0075100674,0.00035714763],"about_ca_topic_score_codex":0.00000391904,"about_ca_topic_score_gemma":0.000017247885,"teacher_disagreement_score":0.8291832,"about_ca_system_score_codex":0.000052631654,"about_ca_system_score_gemma":0.00003613554,"threshold_uncertainty_score":0.9999931},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18662961,0.0090400465,0.8019206,0.00037780893,0.00007379187,0.0005998881,0.0000017836691,0.00025108032,0.0011053827],"genre_scores_gemma":[0.97406703,0.0010446882,0.024351433,0.00027028474,0.0000540452,0.00015552051,0.000013921823,0.000021715327,0.000021385029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828917,0.0002277911,0.0004377919,0.00044365705,0.00016220326,0.00043939042],"domain_scores_gemma":[0.99711627,0.0005900973,0.00021270599,0.0018828446,0.0001182023,0.00007990393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547808,0.00021890042,0.00032261267,0.000121838806,0.00043871495,0.0005077561,0.002468118,0.000095083844,0.0000020721507],"category_scores_gemma":[0.000003611778,0.00020478245,0.000039549064,0.00074249756,0.00019189483,0.00049022376,0.0013665556,0.0004142359,0.0000018270761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018734483,0.00042612493,0.061437726,0.000028099706,0.000035551264,0.00001671849,0.0005600848,0.26252812,0.000058890684,0.025016874,0.00031059896,0.6495625],"study_design_scores_gemma":[0.00091936614,0.00005929237,0.018053656,0.00013606259,0.0000076316,0.00002411916,0.000043416723,0.9754592,0.0000066978523,0.00020430914,0.0048247008,0.0002615268],"about_ca_topic_score_codex":0.00015797262,"about_ca_topic_score_gemma":0.0006704573,"teacher_disagreement_score":0.7874374,"about_ca_system_score_codex":0.00005592396,"about_ca_system_score_gemma":0.000053865024,"threshold_uncertainty_score":0.8350786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013408474,0.0011557353,0.98278064,0.00022569258,0.00019371742,0.001415425,0.0000016078632,0.00026440856,0.00055430643],"genre_scores_gemma":[0.7968632,0.000081423816,0.20261657,0.000061350576,0.000058432244,0.00025724698,0.000007355428,0.000019714671,0.000034693687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495745,0.003129404,0.0009206171,0.0003441212,0.0003172542,0.0003311641],"domain_scores_gemma":[0.9899333,0.001373308,0.0010096079,0.007231066,0.00038774838,0.000064938926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077446317,0.0001992587,0.00036642485,0.00006455975,0.00051501166,0.0001604128,0.0044920826,0.00016505472,0.0000034057923],"category_scores_gemma":[0.00033431494,0.00015879376,0.000100771445,0.0007681621,0.00019449991,0.00045765628,0.001244595,0.00047376196,0.000008949281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115575,0.0012267976,0.027466757,0.0009310686,0.00020337437,0.000001286196,0.0076622358,0.36450097,0.03619635,0.4202289,0.0032751695,0.13819152],"study_design_scores_gemma":[0.00020721837,0.00003840815,0.0018339711,0.00017717697,0.000013033242,0.000018862487,0.00007635351,0.9921829,0.0005008209,0.0004738706,0.0042892834,0.00018807568],"about_ca_topic_score_codex":0.001260827,"about_ca_topic_score_gemma":0.00004288812,"teacher_disagreement_score":0.7834547,"about_ca_system_score_codex":0.00015554643,"about_ca_system_score_gemma":0.00009159771,"threshold_uncertainty_score":0.8347482},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26657724,0.0000030309475,0.72855884,0.0002907555,0.00035314236,0.0001443802,3.2624996e-7,0.00015415778,0.003918124],"genre_scores_gemma":[0.9531442,6.083096e-7,0.04634146,0.00024010817,0.00015950059,0.0000115262765,4.4142826e-7,0.0000069753637,0.00009521627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989434,0.000030732837,0.0001579422,0.00043484275,0.0001472346,0.00028583192],"domain_scores_gemma":[0.99912244,0.00019390402,0.000059840506,0.00040625612,0.00004450868,0.00017307485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019686508,0.00013410662,0.00014251319,0.00002856423,0.00011340472,0.00025112534,0.00043576077,0.00005186418,0.000035064866],"category_scores_gemma":[0.00008938017,0.000104146944,0.000032811524,0.00011199814,0.00018379939,0.00037124762,0.00058033754,0.00038688816,0.000028261216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002561498,0.00008768559,0.0017557428,0.000006904454,0.000010147064,0.000010563113,0.0014252311,0.000114294075,0.017842602,0.56969374,0.0001579301,0.40889257],"study_design_scores_gemma":[0.00029902277,0.00006584429,0.0042736433,0.000040805804,0.0000031339823,0.00004176323,0.00013455341,0.98603666,0.0026538565,0.006163911,0.000059276706,0.00022755656],"about_ca_topic_score_codex":0.000020536992,"about_ca_topic_score_gemma":0.00003311099,"teacher_disagreement_score":0.98592234,"about_ca_system_score_codex":0.000010734393,"about_ca_system_score_gemma":0.000053415395,"threshold_uncertainty_score":0.42469892},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011403027,0.042826947,0.93481195,0.0032492294,0.0006623223,0.0016401762,0.0000051925686,0.0004286198,0.004972545],"genre_scores_gemma":[0.8366286,0.02993233,0.13083483,0.001727276,0.00025489202,0.00035877977,0.00008258897,0.00004047931,0.00014022988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811876,0.00011234398,0.0004005367,0.0006277061,0.00020178124,0.0005388861],"domain_scores_gemma":[0.99709153,0.00030017135,0.00020845125,0.0020402467,0.00012745574,0.00023214734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009719743,0.0003072924,0.00030323767,0.000066551285,0.0007188074,0.0005097907,0.0015953695,0.0003628256,0.000012165285],"category_scores_gemma":[0.000008888246,0.00031852766,0.00008317829,0.00037355948,0.00025218198,0.0005778987,0.0015467933,0.0010712136,0.0000021550234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006975962,0.00020377027,0.0006220825,0.000089631816,0.00012950385,0.000004893663,0.0014881563,0.0154626295,0.000011294084,0.76951337,0.015310493,0.1970944],"study_design_scores_gemma":[0.0007403366,0.0000611173,0.00035046146,0.00006653672,0.000026232681,0.000018657109,0.000067182715,0.8812161,0.0000041184944,0.018099133,0.09899817,0.00035193728],"about_ca_topic_score_codex":0.0000053887034,"about_ca_topic_score_gemma":0.00025244497,"teacher_disagreement_score":0.8657535,"about_ca_system_score_codex":0.00001868489,"about_ca_system_score_gemma":0.000016920105,"threshold_uncertainty_score":0.9999267},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006272019,0.000010396412,0.9483242,0.00014652513,0.0016626572,0.04861679,0.0000012998362,0.000529849,0.00008108515],"genre_scores_gemma":[0.42224374,7.4726086e-7,0.48727894,0.0005718103,0.0013760118,0.08844957,0.0000012725368,0.000029051638,0.00004885376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956616,0.000068945905,0.0005833582,0.0012083645,0.00062846596,0.0018492285],"domain_scores_gemma":[0.9971088,0.0003001792,0.00033970256,0.0010532665,0.000605022,0.00059300126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018508702,0.00041903515,0.0003700323,0.00020569788,0.00067408197,0.0008630486,0.003730112,0.00013768129,0.0000066634584],"category_scores_gemma":[0.000083192834,0.00036822588,0.00012379863,0.0016456916,0.0003761998,0.002927106,0.0019154077,0.00037516674,0.000038627084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009071497,0.0013094214,0.030008709,0.00046820522,0.000051637835,0.000015701553,0.008464293,0.024375075,0.0017452652,0.031850927,0.0051509878,0.89646906],"study_design_scores_gemma":[0.0007949975,0.0001546421,0.0017492766,0.00014653186,0.000003893286,0.000048751066,0.000015583972,0.99399173,0.001242316,0.00007673789,0.0012816112,0.000493906],"about_ca_topic_score_codex":0.0000067162327,"about_ca_topic_score_gemma":0.000004360843,"teacher_disagreement_score":0.96961665,"about_ca_system_score_codex":0.00017251156,"about_ca_system_score_gemma":0.00034446132,"threshold_uncertainty_score":0.999877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018338796,0.000125988,0.97642386,0.00008416105,0.0035784785,0.00094087765,0.000005771665,0.00026355797,0.00023853434],"genre_scores_gemma":[0.78033894,0.0000022670527,0.21817231,0.0003397663,0.00037376038,0.0007122243,0.000004179319,0.000011424805,0.000045124398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719113,0.00004167013,0.00037496752,0.0010784696,0.000589302,0.00072444865],"domain_scores_gemma":[0.9979876,0.00028264784,0.00019061966,0.0008416624,0.00048917026,0.00020829546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092389307,0.00023273923,0.00026252388,0.0002357316,0.00043155442,0.0005411768,0.0030409945,0.00008305063,0.000005789064],"category_scores_gemma":[0.000047801987,0.00021077626,0.000083896244,0.0010554558,0.0004651825,0.0020650928,0.00057421584,0.00012167366,0.000027746186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006212071,0.00077974045,0.009936749,0.00031857417,0.000036325055,0.000041735806,0.004027166,0.07184993,0.0013467363,0.8430644,0.0024615764,0.06607491],"study_design_scores_gemma":[0.00037257458,0.0003323786,0.0020756633,0.00003425941,0.0000049723094,0.000038334423,0.0000108580625,0.98984075,0.0027729757,0.0035550066,0.00064424047,0.0003180003],"about_ca_topic_score_codex":0.000033389184,"about_ca_topic_score_gemma":0.0000060112848,"teacher_disagreement_score":0.9179908,"about_ca_system_score_codex":0.00010883827,"about_ca_system_score_gemma":0.0011466583,"threshold_uncertainty_score":0.8595207},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4249974,0.00006113694,0.5580764,0.000053381773,0.0000956859,0.0010744217,0.0000019879137,0.00006437771,0.0155752655],"genre_scores_gemma":[0.8365049,0.000034025416,0.16314575,0.000032589527,0.000009387106,0.00022807645,0.0000052399887,0.000004349295,0.000035715937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921393,0.00008724204,0.00018873363,0.00016544941,0.00022766089,0.0001169595],"domain_scores_gemma":[0.998321,0.00005037548,0.000096525364,0.0013938183,0.00009678908,0.000041487554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083568046,0.00006210999,0.000080479476,0.000030765,0.00007494063,0.000009877268,0.0010971583,0.000035785277,0.000038567592],"category_scores_gemma":[0.00000604218,0.000056765923,0.000025603704,0.00007126228,0.000056792418,0.000375888,0.0002259775,0.000044692562,0.000013263865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011218813,0.0004771368,0.0044350782,0.00001118199,0.00001955912,2.886084e-8,0.0029324146,0.0008753779,0.0010782973,0.06244015,0.000099092606,0.9276205],"study_design_scores_gemma":[0.00035857403,0.00014778103,0.009966419,0.000005800659,0.000011159689,5.152213e-7,0.000037535152,0.98397225,0.0047558974,0.000467438,0.00020527835,0.000071360635],"about_ca_topic_score_codex":0.000025089275,"about_ca_topic_score_gemma":0.000026045087,"teacher_disagreement_score":0.98309684,"about_ca_system_score_codex":0.000034872257,"about_ca_system_score_gemma":0.000036421894,"threshold_uncertainty_score":0.23148471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024551975,0.000044508695,0.933253,0.00023241418,0.00071681815,0.00037030803,0.000006651396,0.00013865482,0.040685654],"genre_scores_gemma":[0.88870406,0.0000020870948,0.109495066,0.0006570365,0.00004454818,0.000017989378,0.0000013619396,0.000008198757,0.001069634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989122,0.00009641225,0.00020820944,0.00025064498,0.0002743403,0.0002581701],"domain_scores_gemma":[0.99878806,0.00032849264,0.00008389087,0.00068871654,0.0000393657,0.00007150309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035208388,0.00011676404,0.00012922079,0.000020532198,0.00006738108,0.00003158203,0.0009337652,0.000062302504,0.00043784955],"category_scores_gemma":[0.000025721618,0.000068662164,0.00003414018,0.000176314,0.000099556266,0.00008185279,0.00020911268,0.00020578457,0.000050323135],"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.000008681342,0.000051252926,0.00036536425,0.0000015126122,0.000007797651,0.000013760838,0.00040250455,0.00041102667,0.000007973096,0.958415,0.034892604,0.0054225214],"study_design_scores_gemma":[0.0009380243,0.001745073,0.44069663,0.0001545558,0.00007332367,0.00011199279,0.00016149854,0.11636323,0.0067118974,0.43107376,0.0008550758,0.0011149343],"about_ca_topic_score_codex":0.00015704607,"about_ca_topic_score_gemma":0.00014279444,"teacher_disagreement_score":0.86415213,"about_ca_system_score_codex":0.0000102254635,"about_ca_system_score_gemma":0.00002945757,"threshold_uncertainty_score":0.47941455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8912348,0.0000035107935,0.09553646,0.00037731984,0.00018778755,0.0012906442,0.0000010015402,0.00006356068,0.0113049215],"genre_scores_gemma":[0.99203527,0.0000073747415,0.0074443617,0.00008649766,0.00004549741,0.00022937798,0.0000034088855,0.000007891941,0.00014030983],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985598,0.00009937775,0.00023789765,0.00034908392,0.0004351815,0.00031866523],"domain_scores_gemma":[0.9987877,0.00016418492,0.00010034906,0.0004585397,0.00041558265,0.000073668125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005856118,0.00008802332,0.00012700788,0.00015411331,0.00014218256,0.0007361422,0.001931127,0.000049234033,0.00039813426],"category_scores_gemma":[0.000009609987,0.00007511236,0.000021270576,0.00094714185,0.000047667392,0.003410207,0.0010658813,0.00018353746,0.00008733338],"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.00001876859,0.0001014755,0.011538894,0.000015122265,0.000027960665,0.0000011023131,0.00058568985,0.00016411548,0.0021519263,0.3885166,0.036400378,0.560478],"study_design_scores_gemma":[0.0022320757,0.0017415476,0.26455465,0.00007640181,0.0000059431127,0.000016730177,0.0014295958,0.0827925,0.47113144,0.17471913,0.00074628805,0.00055369193],"about_ca_topic_score_codex":0.005861378,"about_ca_topic_score_gemma":0.0008908391,"teacher_disagreement_score":0.5599243,"about_ca_system_score_codex":0.00012833293,"about_ca_system_score_gemma":0.000121098456,"threshold_uncertainty_score":0.88606894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03250214,0.005280019,0.9603698,0.00050690945,0.00021765043,0.0005124169,0.0000031689704,0.00037463475,0.00023324603],"genre_scores_gemma":[0.8858461,0.0020030078,0.111471914,0.00018348724,0.000104925166,0.00023541843,0.00010843632,0.000016829421,0.000029887959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828523,0.00026414669,0.00040380325,0.00041505913,0.00020071132,0.00043104764],"domain_scores_gemma":[0.9960128,0.00034663305,0.00015346319,0.003259212,0.00011366531,0.00011423723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027374152,0.00020421286,0.00024730674,0.00007795846,0.000506852,0.000116486124,0.003137714,0.00009838228,0.0000039882634],"category_scores_gemma":[0.000006316489,0.00019876895,0.00006591033,0.0011000892,0.00021050253,0.00048469208,0.0012395656,0.0005376139,0.000027310127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010515521,0.0005251794,0.0024181162,0.000006089134,0.00003145661,0.000036844172,0.0022142008,0.51903236,0.000002802573,0.009874913,0.0041061146,0.46174142],"study_design_scores_gemma":[0.00046020324,0.00012691996,0.009859287,0.00006934643,0.0000043604095,0.0001025841,0.00001617588,0.9583679,0.000002453101,0.00003535327,0.030711899,0.00024351056],"about_ca_topic_score_codex":0.0000054802995,"about_ca_topic_score_gemma":0.0001339506,"teacher_disagreement_score":0.85334396,"about_ca_system_score_codex":0.00014610529,"about_ca_system_score_gemma":0.000097478514,"threshold_uncertainty_score":0.81055623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007182783,0.000051934498,0.98591375,0.0000874468,0.0021436869,0.0007981816,0.0000014620662,0.000577806,0.0032429404],"genre_scores_gemma":[0.8420539,0.000015947628,0.15585493,0.0005936222,0.0004973642,0.00020018803,0.0000025085344,0.000042711883,0.00073885615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750966,0.000069879425,0.0004584734,0.00081808143,0.0002571051,0.00088681484],"domain_scores_gemma":[0.99811053,0.00022822878,0.00016948822,0.0010712324,0.00014455627,0.00027596197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000519971,0.00033733732,0.00036481794,0.00009391856,0.00026351586,0.0001689799,0.001710702,0.00020326428,0.000040920113],"category_scores_gemma":[0.00002011346,0.00030132654,0.00019139118,0.00034039535,0.0000436411,0.00071147614,0.00029800803,0.0002995609,0.000053794447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010067773,0.00054731406,0.001001642,0.000069848946,0.00021263654,0.00006441967,0.0089146,0.017854113,0.0011083169,0.2553351,0.015117037,0.6996743],"study_design_scores_gemma":[0.00078289496,0.000116311916,0.00023365278,0.00003459716,0.000013594142,0.00001537815,0.00008807284,0.99560636,0.0015173169,0.0008941893,0.00027749868,0.00042015305],"about_ca_topic_score_codex":0.00018737336,"about_ca_topic_score_gemma":0.00021561478,"teacher_disagreement_score":0.9777522,"about_ca_system_score_codex":0.00006301063,"about_ca_system_score_gemma":0.00004666761,"threshold_uncertainty_score":0.9999439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081963604,0.00010670599,0.9803184,0.00051594846,0.00073314516,0.00018499697,3.3320447e-7,0.00027136484,0.01704946],"genre_scores_gemma":[0.7457657,0.0000016955572,0.25016072,0.0029895783,0.00017964402,0.000009976566,5.0440775e-7,0.0000074491068,0.00088475365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987504,0.00004517859,0.00022941771,0.00031765053,0.00019715245,0.00046018278],"domain_scores_gemma":[0.99902284,0.0002283072,0.000046331545,0.000508452,0.00005779174,0.00013624779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000680546,0.00010451087,0.00015883213,0.00006114491,0.00006530193,0.00004023248,0.00061196595,0.000081828635,0.0001580291],"category_scores_gemma":[0.000015171528,0.00008623627,0.000055633755,0.00027358608,0.00006490161,0.00003761581,0.00013434916,0.000113847724,0.00023292778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011924964,0.00011714504,0.00013643916,0.0000018727637,0.000021883146,0.00012070735,0.00011024976,0.008080891,0.0001388982,0.34284317,0.0030510752,0.6453657],"study_design_scores_gemma":[0.00089388527,0.00006679458,0.000362715,0.0000019483589,0.0000027746776,0.000034759043,0.000009704356,0.97989166,0.0005424595,0.0010314113,0.017037515,0.00012438075],"about_ca_topic_score_codex":0.00004131064,"about_ca_topic_score_gemma":0.000018058452,"teacher_disagreement_score":0.97181076,"about_ca_system_score_codex":0.000040552633,"about_ca_system_score_gemma":0.000028024066,"threshold_uncertainty_score":0.3516613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002712931,0.12485192,0.8678018,0.0017119356,0.00014989437,0.0022082007,0.0000042201796,0.000291724,0.000267375],"genre_scores_gemma":[0.50480896,0.0697121,0.4188104,0.00463464,0.0002454333,0.0016234914,0.00004908953,0.00006637531,0.000049517643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969565,0.00042184352,0.0008967342,0.00084551005,0.0002548819,0.00062452257],"domain_scores_gemma":[0.99258524,0.0022527052,0.00037564815,0.004160133,0.00031114594,0.0003151168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017475764,0.0003720255,0.00074569584,0.00012408964,0.00082015723,0.00035183012,0.003698309,0.000118147735,0.0000080123355],"category_scores_gemma":[0.00031683198,0.00039713318,0.00014971249,0.00089716265,0.00017263957,0.0002637569,0.0037345197,0.00048807362,0.000010671939],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048134025,0.00017115977,0.00051410944,0.00040882698,0.00004411368,0.0000018259199,0.00011631984,0.0037669174,0.000045940207,0.0012209481,0.0005942038,0.99311084],"study_design_scores_gemma":[0.0005681239,0.0002184141,0.00029862858,0.005909753,0.000078121484,0.00007601822,0.000019315223,0.94146204,0.0000198121,0.00032515867,0.050534856,0.00048976747],"about_ca_topic_score_codex":0.00006164232,"about_ca_topic_score_gemma":0.000018474639,"teacher_disagreement_score":0.99262106,"about_ca_system_score_codex":0.00007113173,"about_ca_system_score_gemma":0.00007073689,"threshold_uncertainty_score":0.99984807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003605682,0.00019809039,0.9941319,0.0001832771,0.00022883549,0.0010565944,0.000006403207,0.00020222456,0.00038699637],"genre_scores_gemma":[0.960564,0.0000036559086,0.038513187,0.00025966618,0.00015892422,0.0003689296,0.00007490264,0.000008912122,0.000047833346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858075,0.000027702949,0.00032144313,0.00043980015,0.00011792761,0.0005123778],"domain_scores_gemma":[0.9991809,0.00024942702,0.00007877889,0.0003393685,0.00007405766,0.00007748407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003152558,0.0001685191,0.00021488199,0.000064131644,0.000089691894,0.00022652728,0.0005162972,0.0001377853,0.00000587233],"category_scores_gemma":[0.00001220766,0.0001588916,0.00008323529,0.00033633833,0.000026885155,0.0006044494,0.000051847477,0.00011578191,0.0000017737292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034673165,0.000071097485,0.00007739591,0.000008155973,0.0000045533725,0.000003313473,0.00010249036,0.82401574,0.000019750809,0.05492333,0.0045956275,0.11614388],"study_design_scores_gemma":[0.0007246461,0.00044571926,0.0012535473,0.000028457733,0.000003637834,0.0000035712533,0.00021634721,0.9837438,0.0000853066,0.011754151,0.0015502184,0.00019060994],"about_ca_topic_score_codex":0.0000075646335,"about_ca_topic_score_gemma":0.00002409708,"teacher_disagreement_score":0.9569583,"about_ca_system_score_codex":0.00006733077,"about_ca_system_score_gemma":0.00005092947,"threshold_uncertainty_score":0.6479411},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10197042,0.00082125276,0.8905504,0.00009575895,0.0022605807,0.00017912485,0.000004708551,0.0001406578,0.0039770976],"genre_scores_gemma":[0.9877437,0.00048878934,0.009549659,0.0005683366,0.00027716407,0.00006032217,0.00002108366,0.000030155252,0.0012607948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969707,0.00008643625,0.000814307,0.0008221669,0.000620379,0.00068599975],"domain_scores_gemma":[0.9979527,0.00050708733,0.00033526923,0.00063483464,0.00038695105,0.00018315595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061489287,0.00034914317,0.00033495753,0.00034627094,0.000046530775,0.00041070618,0.0030841876,0.00022004358,0.00029271282],"category_scores_gemma":[0.000054967444,0.00036988626,0.00011891293,0.00046252282,0.000117404314,0.0009782718,0.0009796036,0.00048726416,0.000039876104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007942303,0.00018333564,0.002334102,0.00000595572,0.000061757426,0.00025617602,0.00057072105,0.0071355226,0.00077340176,0.16131943,0.00045932544,0.82682085],"study_design_scores_gemma":[0.00056950445,0.00007031417,0.0021983199,0.00023241586,0.0000036920326,0.00008357997,0.000047609847,0.9618732,0.0020186817,0.0014388959,0.031033998,0.00042978767],"about_ca_topic_score_codex":0.00028877403,"about_ca_topic_score_gemma":0.0017420428,"teacher_disagreement_score":0.95473766,"about_ca_system_score_codex":0.00040170675,"about_ca_system_score_gemma":0.00015365354,"threshold_uncertainty_score":0.9998753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012859725,0.00071468117,0.99039584,0.0009479412,0.005198924,0.001619901,0.0000052422124,0.0009171254,0.000071726805],"genre_scores_gemma":[0.9375846,0.00024279043,0.051731054,0.00495701,0.004676613,0.00034925854,0.0000976846,0.00008052472,0.00028047478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953831,0.00020658612,0.0008374245,0.0015267009,0.0004640913,0.0015821044],"domain_scores_gemma":[0.9967443,0.00041516364,0.00039756077,0.0015643291,0.00033508896,0.0005436079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007432349,0.00073685974,0.00078559667,0.00015507436,0.0005308488,0.0006045075,0.002346067,0.0005429758,0.000009315291],"category_scores_gemma":[0.000009337495,0.0007428008,0.00037103504,0.0006993025,0.000099817385,0.0006619045,0.00059381017,0.00069537666,0.000021743295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029937768,0.00025982974,0.000022284223,0.000011551955,0.000067471316,0.00003718046,0.00015860576,0.79174733,0.0000011703031,0.012021144,0.034714762,0.16092874],"study_design_scores_gemma":[0.001767534,0.0005471312,0.0010600385,0.00019106994,0.000031015574,0.000042201067,0.0000070498486,0.99278474,0.0000130853905,0.0011920981,0.0015146664,0.0008493442],"about_ca_topic_score_codex":0.0000069997236,"about_ca_topic_score_gemma":0.000011642081,"teacher_disagreement_score":0.9386648,"about_ca_system_score_codex":0.00019246573,"about_ca_system_score_gemma":0.000075799515,"threshold_uncertainty_score":0.9995023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015500156,0.0008379987,0.9920747,0.0005821599,0.00048822336,0.0004896628,3.016986e-7,0.00024805535,0.0037288256],"genre_scores_gemma":[0.68207765,0.00023682707,0.3125371,0.000954554,0.00012825835,0.0003847115,0.00000782653,0.000026592832,0.0036464995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987014,0.00005865669,0.00024987644,0.00046636342,0.0001421585,0.0003815766],"domain_scores_gemma":[0.99877036,0.00012792155,0.0000892601,0.00079085986,0.000118050775,0.00010356862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044623978,0.00013467674,0.00014406402,0.0000386961,0.00012534476,0.00014045209,0.0005924576,0.00009772399,0.000033480763],"category_scores_gemma":[0.00003424403,0.00012391915,0.000070997725,0.00039868391,0.00002654398,0.0003264737,0.00006389888,0.00010764901,0.00005008665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012454081,0.00008867936,0.00014045982,0.00001915674,0.000022954886,0.0000020947443,0.00012242637,0.0027447941,0.0005779517,0.6794776,0.027466824,0.28932467],"study_design_scores_gemma":[0.0003287233,0.00005789843,0.00013355032,0.000015482956,0.000004258728,0.0000069650073,0.000009771264,0.88287455,0.0013738584,0.003837351,0.111135475,0.00022214314],"about_ca_topic_score_codex":0.0000016021537,"about_ca_topic_score_gemma":0.000012328875,"teacher_disagreement_score":0.88012975,"about_ca_system_score_codex":0.000043430715,"about_ca_system_score_gemma":0.000049240884,"threshold_uncertainty_score":0.50532764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016499138,0.00013531432,0.9662586,0.00003580247,0.00064174295,0.0005344476,3.9704562e-7,0.00022296858,0.015671615],"genre_scores_gemma":[0.72110033,0.0000133768035,0.27807048,0.00046723796,0.00011107205,0.00012035201,0.0000025600418,0.000015952437,0.00009866898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978172,0.00009603729,0.00035189313,0.00077497435,0.00040220993,0.0005576373],"domain_scores_gemma":[0.99793327,0.0006126466,0.00010119592,0.0011402416,0.000057108133,0.00015553161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087779894,0.00023543257,0.00024820163,0.00015040695,0.000108456,0.00016483905,0.0011970697,0.00022311849,0.0000696178],"category_scores_gemma":[0.000047526017,0.00019964237,0.00008629214,0.00080793933,0.000045951147,0.0003492847,0.00033168728,0.0008531237,0.000054182114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053948603,0.00020024387,0.0006613659,0.0000014713341,0.0000029517066,0.000014449657,0.00011447823,0.40838927,0.00002208079,0.011290156,0.0007160282,0.5785336],"study_design_scores_gemma":[0.0008005252,0.00021119097,0.0011194499,0.000031708074,0.0000015862814,0.0000042185443,0.000027808599,0.994535,0.000058669033,0.00043595966,0.0025318984,0.0002419665],"about_ca_topic_score_codex":0.000010254498,"about_ca_topic_score_gemma":0.00015177256,"teacher_disagreement_score":0.70460117,"about_ca_system_score_codex":0.000060384806,"about_ca_system_score_gemma":0.00006798392,"threshold_uncertainty_score":0.8141179},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063922934,0.00003536404,0.9330274,0.0003264199,0.0002294986,0.00065757893,9.745245e-7,0.0004538422,0.0013459703],"genre_scores_gemma":[0.7209574,0.0000024475746,0.27814218,0.0006415507,0.0001545904,0.0000402123,0.000005373048,0.000013510999,0.00004271426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784184,0.00005061424,0.0003081294,0.0007646561,0.00031898895,0.000715763],"domain_scores_gemma":[0.99836594,0.000122059886,0.00012120107,0.0009079898,0.00020577354,0.0002770387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047085364,0.00027436521,0.00029831022,0.00006950102,0.0002217518,0.00033288158,0.0011447691,0.00013808002,0.000024546267],"category_scores_gemma":[0.000008624055,0.00022119285,0.00007477805,0.00048222108,0.00013313962,0.0003615712,0.00007409904,0.00021510899,0.000008087523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045947407,0.00027662053,0.00022856386,0.000010093131,0.00002686984,0.000021479054,0.00017370432,0.33689594,0.00031576995,0.52321833,0.0002386529,0.138548],"study_design_scores_gemma":[0.0008594307,0.00039531576,0.00035104583,0.000057164623,0.000007767514,0.000029296103,0.000058297035,0.99680763,0.0006497723,0.0003470319,0.00007973717,0.00035752376],"about_ca_topic_score_codex":0.0000049078467,"about_ca_topic_score_gemma":0.000012210333,"teacher_disagreement_score":0.6599117,"about_ca_system_score_codex":0.00004819979,"about_ca_system_score_gemma":0.00010915069,"threshold_uncertainty_score":0.9019983},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016212437,0.0000048395727,0.9154346,0.00012356132,0.00008510242,0.0680831,1.628884e-7,0.000030930205,0.000025243617],"genre_scores_gemma":[0.7983661,5.583763e-7,0.066879444,0.00020660242,0.00008057734,0.134441,0.0000035820954,0.000008737648,0.000013359393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906707,0.00008171485,0.00018244982,0.00027734853,0.00024899654,0.00014241123],"domain_scores_gemma":[0.9987442,0.00015580986,0.00011159875,0.0003598463,0.0005843161,0.000044264292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013645816,0.000100563906,0.00010467938,0.000035053105,0.00008355332,0.00010907057,0.00020847685,0.000083255305,0.0000055785713],"category_scores_gemma":[0.000025536216,0.000083868756,0.0000109431285,0.0002696003,0.000028197524,0.00074973237,0.00006832218,0.0000907548,4.175066e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009931645,0.00007587853,0.002112928,0.00029939556,0.0000123509935,1.5460019e-7,0.00010883511,0.8700962,0.0009531181,0.0017068095,0.00037657339,0.12415844],"study_design_scores_gemma":[0.0010790847,0.0001405417,0.0063933134,0.000051829145,0.000012171416,0.0000018490248,0.000003485944,0.98969007,0.002292643,0.000119641954,0.00011274712,0.00010260118],"about_ca_topic_score_codex":0.000010420961,"about_ca_topic_score_gemma":0.000029513334,"teacher_disagreement_score":0.8485552,"about_ca_system_score_codex":0.000012742419,"about_ca_system_score_gemma":0.00014720247,"threshold_uncertainty_score":0.34200686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009865701,0.00014487715,0.99202687,0.0001546176,0.00283118,0.002596731,0.0000054984994,0.0005769535,0.0006767072],"genre_scores_gemma":[0.94448304,0.00007974569,0.04959729,0.00060257094,0.00029910318,0.0020618665,0.000011072075,0.000053266664,0.0028120184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960749,0.00021234457,0.00087108114,0.0012974875,0.00026980523,0.0012743914],"domain_scores_gemma":[0.9973771,0.0003089463,0.00038754818,0.0012634766,0.0002861205,0.00037680223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000707464,0.0006028592,0.0010067009,0.00016678868,0.00029412427,0.00014842619,0.0021895755,0.00042090498,0.0001399849],"category_scores_gemma":[0.000049040184,0.0005015327,0.00039184256,0.00032353975,0.00015649846,0.00053685403,0.0006462056,0.00041208736,0.000051366325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009097588,0.016866878,0.0006336254,0.0005442536,0.00577897,0.00040282577,0.060005493,0.06692277,0.004204486,0.45202133,0.034312036,0.34920976],"study_design_scores_gemma":[0.00937232,0.00049903535,0.0001929066,0.00006553772,0.00003721524,0.0000099487315,0.0002432191,0.9847595,0.0035585,0.0006134233,0.000028995722,0.00061939884],"about_ca_topic_score_codex":0.000120092016,"about_ca_topic_score_gemma":0.00036804014,"teacher_disagreement_score":0.9434965,"about_ca_system_score_codex":0.00015793812,"about_ca_system_score_gemma":0.00009528381,"threshold_uncertainty_score":0.99974364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006195896,0.0007651858,0.9743175,0.00011520011,0.0017918955,0.020838644,0.000001493732,0.00067054614,0.0008799521],"genre_scores_gemma":[0.61856943,0.000112511705,0.34176406,0.0021066142,0.0105074365,0.026144143,0.000039330873,0.0002324243,0.0005240442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933915,0.0003911553,0.0009968779,0.001668267,0.00089060096,0.002661565],"domain_scores_gemma":[0.99274063,0.0035720994,0.0002796572,0.0022228379,0.0006184608,0.00056632026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0065709464,0.00054485485,0.0006038358,0.00033322818,0.00086858595,0.0008291778,0.0031114998,0.0005308949,0.000017175169],"category_scores_gemma":[0.000038960483,0.0005259447,0.0002936982,0.0017187817,0.00021288787,0.00046711494,0.0014800015,0.0016468777,0.00007171117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012285437,0.00020451141,0.00010390364,0.000017613747,0.000030668973,0.000049037244,0.0001550008,0.4006806,0.000002568075,0.011325097,0.016037757,0.5712704],"study_design_scores_gemma":[0.0011934221,0.001384047,0.0007043254,0.00032881217,0.000005300513,0.000022505637,0.000020494508,0.89850795,0.000033792447,0.00040057127,0.09688662,0.0005121813],"about_ca_topic_score_codex":0.000003085414,"about_ca_topic_score_gemma":0.000022931696,"teacher_disagreement_score":0.6325534,"about_ca_system_score_codex":0.00028895395,"about_ca_system_score_gemma":0.00009367018,"threshold_uncertainty_score":0.9997192},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034053534,0.0013735025,0.9508324,0.011706332,0.000455058,0.0010553509,0.0000055784994,0.00041356406,0.00010465017],"genre_scores_gemma":[0.933423,0.0009417343,0.058921505,0.0041500623,0.00012858756,0.0022584607,0.00006156735,0.00006127398,0.000053801523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969971,0.0004995267,0.0006256914,0.00070696237,0.0004204476,0.00075025763],"domain_scores_gemma":[0.9936839,0.00053379027,0.00026834413,0.0049843993,0.00018135746,0.00034822963],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004823712,0.00038061326,0.00038281197,0.000159599,0.000774804,0.00044344767,0.0055578714,0.00018764596,0.000020673337],"category_scores_gemma":[0.0000032436462,0.00037393035,0.00020605639,0.0005711308,0.0002498122,0.0006667225,0.00030496283,0.00039461922,0.000027293876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018602206,0.00067118165,0.000048883976,0.000020247271,0.00006364203,0.0000025206766,0.00092450966,0.13786799,0.024854353,0.011957423,0.013133119,0.8104375],"study_design_scores_gemma":[0.00070567074,0.000093266215,0.00023002972,0.000081294405,0.000019992523,0.000006224303,0.000039119514,0.9777956,0.00092396303,0.00013151167,0.019509315,0.000464026],"about_ca_topic_score_codex":0.000075811164,"about_ca_topic_score_gemma":0.000036047342,"teacher_disagreement_score":0.8993695,"about_ca_system_score_codex":0.000203637,"about_ca_system_score_gemma":0.000061273095,"threshold_uncertainty_score":0.99987125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031209739,0.0013196289,0.9621268,0.0022431638,0.0018484119,0.00015792252,7.766427e-7,0.000042851065,0.0010507286],"genre_scores_gemma":[0.9899119,0.000134071,0.009437274,0.00026769246,0.00020553109,0.000011143936,0.0000051759193,0.000010748544,0.000016444352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775827,0.00032425486,0.0010389121,0.00014106635,0.00056267634,0.00017484472],"domain_scores_gemma":[0.99726695,0.00032087724,0.0009256503,0.00066550856,0.00074256054,0.000078466466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013685942,0.00012252756,0.00023696477,0.00033616627,0.00004772738,0.0003572257,0.0035703634,0.000082269,0.0000063966872],"category_scores_gemma":[0.00012492448,0.00011787879,0.000109361856,0.00036958145,0.00003615155,0.00075583445,0.00030155148,0.00044214856,0.000012352428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027262633,0.00012331322,0.0020589188,0.0000014472427,0.000058789097,0.00004970615,0.00051546044,0.87286955,0.000057626934,0.11882977,0.0001264535,0.0052817035],"study_design_scores_gemma":[0.0023864051,0.00007798276,0.005843429,0.0012212351,0.0000064407427,0.00023251826,0.0001832636,0.98413205,0.00011172956,0.0017088222,0.0038935156,0.00020258204],"about_ca_topic_score_codex":0.0001474218,"about_ca_topic_score_gemma":0.00005117305,"teacher_disagreement_score":0.9587022,"about_ca_system_score_codex":0.00048363718,"about_ca_system_score_gemma":0.00015553126,"threshold_uncertainty_score":0.66346824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64446825,0.003216619,0.23946941,0.0019880948,0.00035512057,0.0035174654,0.0000047237113,0.0003654661,0.10661482],"genre_scores_gemma":[0.97466874,0.00009805954,0.02478895,0.0003339478,0.000010855617,0.000090593596,5.9209333e-7,0.000004022272,0.0000042679408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985864,0.000078448495,0.00031996035,0.00050937163,0.0002367598,0.00026906322],"domain_scores_gemma":[0.99836993,0.00046795374,0.00012495687,0.00095708383,0.000031702857,0.00004837704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053093047,0.00015609014,0.000222277,0.000044364326,0.00006441848,0.000028116268,0.00071604736,0.000061550425,0.000010183845],"category_scores_gemma":[0.00006827137,0.00011061026,0.000035838708,0.0005726695,0.00020949016,0.00019123568,0.00012943696,0.0002242697,0.0000026441915],"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.000036451092,0.00010923428,0.0005583075,0.000012369931,0.000002020154,9.502599e-7,0.00020969471,0.00079124,0.0001398048,0.7588607,0.000033320404,0.23924588],"study_design_scores_gemma":[0.00026843837,0.000113891554,0.009904809,0.000019646493,0.0000016789407,0.0000015052545,0.00001601647,0.002328184,0.0012626494,0.9854635,0.00049315556,0.00012653106],"about_ca_topic_score_codex":0.000004780169,"about_ca_topic_score_gemma":0.000038704562,"teacher_disagreement_score":0.33020043,"about_ca_system_score_codex":0.000032641536,"about_ca_system_score_gemma":0.000023015951,"threshold_uncertainty_score":0.45105553},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025718057,0.00002789318,0.8459736,0.00001465178,0.00017846642,0.15019082,0.0000012223035,0.00021910314,0.0031370893],"genre_scores_gemma":[0.1605248,0.0000013414364,0.36935842,0.00030528958,0.00013506389,0.4693784,0.0000040905397,0.000028533026,0.0002640662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731237,0.00006968293,0.0008029991,0.0006287525,0.00044264784,0.00074354844],"domain_scores_gemma":[0.99763423,0.0005655268,0.00037212265,0.0010112426,0.00022669828,0.00019016206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021106908,0.00025546458,0.00036126174,0.000103627746,0.00013632544,0.000103727136,0.0010087976,0.00014440193,0.00013327374],"category_scores_gemma":[0.000016084918,0.00022210107,0.00020800583,0.0005470841,0.000049953396,0.00025423215,0.00030252812,0.00020323058,0.0000040927425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009436505,0.0010622138,0.0022292293,0.00020920334,0.000059155376,0.000019349334,0.00018658255,0.35598353,0.0005191376,0.023448851,0.0046378314,0.61155057],"study_design_scores_gemma":[0.0015597655,0.0010245092,0.0012029697,0.00008066371,0.0000065840823,0.0000024278343,0.000037702514,0.94032013,0.0013429327,0.00013730626,0.0540198,0.00026522434],"about_ca_topic_score_codex":0.0000060419825,"about_ca_topic_score_gemma":0.000032121832,"teacher_disagreement_score":0.6112853,"about_ca_system_score_codex":0.00015700758,"about_ca_system_score_gemma":0.00020140162,"threshold_uncertainty_score":0.9057019},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.167162,0.000007273528,0.8318796,0.00004001495,0.0004892637,0.00019867429,0.000012628959,0.00006223561,0.00014828215],"genre_scores_gemma":[0.98268473,0.000020466641,0.017184583,0.000010528084,0.000015002477,0.0000020692635,0.0000023513135,0.0000073666206,0.00007292947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906385,0.000081468665,0.00018127717,0.00028491797,0.00019433905,0.00019415474],"domain_scores_gemma":[0.99906033,0.00010641898,0.00011814729,0.00054249825,0.000094328985,0.00007826527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018729373,0.0001197243,0.00019354347,0.00027359978,0.000093361574,0.00001077508,0.0005720695,0.000179354,0.00005122572],"category_scores_gemma":[0.000002280212,0.00014746482,0.00011841152,0.0007698564,0.000094321986,0.00031397396,0.00001658773,0.00045968578,0.0000023321293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015595423,0.0010920912,0.00088587106,0.000022560733,0.000027476204,0.00004276842,0.0002237837,0.043846257,0.0073748003,0.00028441154,0.000025692842,0.94601834],"study_design_scores_gemma":[0.0011608545,0.00029207073,0.019527404,0.000028805467,0.00004400487,0.00000472752,0.000055020664,0.968992,0.00917381,0.000015301546,0.0005131583,0.00019284284],"about_ca_topic_score_codex":0.0001413506,"about_ca_topic_score_gemma":0.0014459371,"teacher_disagreement_score":0.9458255,"about_ca_system_score_codex":0.00006881936,"about_ca_system_score_gemma":0.000067020665,"threshold_uncertainty_score":0.60134405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48887262,0.0003138208,0.5100237,0.0003353508,0.00024453105,0.00016500699,2.5265928e-7,0.000019812149,0.00002489798],"genre_scores_gemma":[0.7420973,0.000023526018,0.2573865,0.0002056934,0.0002663599,0.0000020107796,1.6407851e-7,0.000011793932,0.000006614474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987925,0.000084692336,0.00043909322,0.00015134466,0.0002036799,0.00032866737],"domain_scores_gemma":[0.99859613,0.00053572777,0.00027858076,0.00025007225,0.00023592732,0.00010354781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090730586,0.00015582578,0.0002510105,0.000062660634,0.0002483108,0.00019308648,0.00084393576,0.000058264817,0.000006602213],"category_scores_gemma":[0.000103675986,0.00010016493,0.00007852683,0.00016531268,0.00004378787,0.00089071796,0.00035310208,0.00036479952,0.0000013467685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032022712,0.000028779044,0.0014919661,0.000085597865,0.00010609088,0.000010313207,0.013787364,0.496981,0.023799118,0.0017150425,0.002063365,0.45989934],"study_design_scores_gemma":[0.00093931437,0.00022294522,0.0048672627,0.00019619685,0.000026011221,0.0006546566,0.0007799237,0.987564,0.0009589607,0.0031905868,0.00038741887,0.00021271134],"about_ca_topic_score_codex":0.000013755545,"about_ca_topic_score_gemma":0.0000015217704,"teacher_disagreement_score":0.490583,"about_ca_system_score_codex":0.000036572532,"about_ca_system_score_gemma":0.00002997385,"threshold_uncertainty_score":0.40846074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016858218,0.00066461746,0.9921384,0.00074738666,0.0005911082,0.0011295867,0.0000015587754,0.00050449715,0.0040542884],"genre_scores_gemma":[0.32499906,0.000013032085,0.67089164,0.0017295271,0.00065844465,0.00049024035,0.000045034052,0.000031240674,0.0011417953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980759,0.00015092484,0.00048800613,0.0005084756,0.00023653751,0.00054017873],"domain_scores_gemma":[0.99766886,0.001386247,0.00016937373,0.00054987916,0.00014070922,0.000084927575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077306,0.00021370867,0.00043331485,0.00006608169,0.00022551371,0.00027554735,0.00063589495,0.00012391448,0.000043785814],"category_scores_gemma":[0.000036133715,0.00018101618,0.00026559492,0.00033168413,0.00006181921,0.00026600398,0.00009628192,0.00013573901,0.000017735027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043889764,0.00021248232,0.000045332883,0.000018477927,0.000068520996,0.000019918825,0.00005616661,0.60845166,0.000038919403,0.1628289,0.016721522,0.20714912],"study_design_scores_gemma":[0.05904287,0.00004273087,0.000018391422,0.000021892736,0.00001753981,0.000003893436,0.0000018271409,0.9360369,0.00012364815,0.0026340582,0.0018269871,0.00022924872],"about_ca_topic_score_codex":0.000046376983,"about_ca_topic_score_gemma":0.000032353968,"teacher_disagreement_score":0.32758525,"about_ca_system_score_codex":0.00006227598,"about_ca_system_score_gemma":0.00006418904,"threshold_uncertainty_score":0.7381625},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89148307,0.004132917,0.015619631,0.0020341694,0.0014526828,0.08310759,0.0000133823205,0.0004284504,0.0017281232],"genre_scores_gemma":[0.92789626,0.00048209517,0.004858332,0.00012902131,0.0001937991,0.06604623,0.0000019717875,0.00003147951,0.0003608374],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964845,0.0008256645,0.0005683657,0.0005349368,0.0007872079,0.0007993183],"domain_scores_gemma":[0.9961236,0.0014726098,0.00022586863,0.0013701157,0.0007178906,0.00008988892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009995,0.00020168372,0.00040064473,0.00009027091,0.00033887732,0.000289072,0.0017522009,0.00009668156,0.00017016425],"category_scores_gemma":[0.00046161894,0.00012762626,0.000049915107,0.000684639,0.00027510745,0.0004946782,0.0011987522,0.00038611924,0.00015899837],"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.00026876418,0.00043779993,0.000052521926,0.0004688203,0.0002137012,0.000035152534,0.0052855364,0.055167276,0.52202916,0.14420077,0.015246916,0.25659359],"study_design_scores_gemma":[0.0012577175,0.0027871658,0.00031464463,0.0016805799,0.0000058375736,0.000011050674,0.0019801029,0.022578446,0.9176202,0.032212757,0.018856905,0.00069462345],"about_ca_topic_score_codex":0.0000061802266,"about_ca_topic_score_gemma":0.000005237961,"teacher_disagreement_score":0.39559102,"about_ca_system_score_codex":0.00008302958,"about_ca_system_score_gemma":0.00006865449,"threshold_uncertainty_score":0.5204448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1810111,0.0009844132,0.80752295,0.0005682506,0.0047809966,0.00019774897,5.905049e-7,0.00005572313,0.0048782593],"genre_scores_gemma":[0.9982535,0.000020025715,0.00072599424,0.00014424445,0.00063293986,0.000005469946,4.861895e-8,0.000009810888,0.00020796988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825543,0.0003438973,0.00043881088,0.00016733221,0.0005109993,0.00028351886],"domain_scores_gemma":[0.9983317,0.0004502618,0.00044576018,0.0005548071,0.0001242527,0.0000932096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020543227,0.00011810382,0.00021202269,0.000056889283,0.0002033591,0.0002314896,0.0010208036,0.00006024573,0.000009257467],"category_scores_gemma":[0.000106766565,0.00007288501,0.00010318118,0.00019668367,0.000034968027,0.00020285982,0.00006308557,0.00038871495,0.000039896055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003718161,0.00016522592,0.0016510871,0.0001064077,0.00023017584,0.00005082976,0.0020809826,0.13781941,0.00725647,0.68584627,0.074962534,0.08979342],"study_design_scores_gemma":[0.00084353436,0.0005374609,0.0006920559,0.0012232257,0.000015055469,0.0008954816,0.00007371565,0.9477617,0.0028644083,0.0046852576,0.040036943,0.00037117358],"about_ca_topic_score_codex":0.0000051274337,"about_ca_topic_score_gemma":0.0000013063403,"teacher_disagreement_score":0.8172424,"about_ca_system_score_codex":0.00004800817,"about_ca_system_score_gemma":0.000053869986,"threshold_uncertainty_score":0.29721645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009946432,0.00011227255,0.9820988,0.0002886073,0.00037622428,0.00042200362,0.0000019386018,0.0002967989,0.0064569167],"genre_scores_gemma":[0.8180101,0.000001956334,0.17944105,0.00035321494,0.00021089327,0.000075149765,0.0000025544675,0.000017503875,0.0018876154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986036,0.000043827935,0.00019447508,0.00037078268,0.00019361453,0.0005937076],"domain_scores_gemma":[0.99876034,0.00027127293,0.00009067253,0.0005991421,0.00008392498,0.0001946659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031233233,0.00017833053,0.00017769875,0.00005232294,0.00011720129,0.000105883315,0.00062172016,0.00007306091,0.000046221765],"category_scores_gemma":[0.000013868912,0.00013113135,0.000051178362,0.00023135355,0.000045331533,0.0010315295,0.0002454813,0.00015308223,0.00007497173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025567182,0.00067466166,0.016453495,0.000049817514,0.00026400972,0.000025600957,0.0057804715,0.0055896095,0.0009128933,0.55232936,0.06217277,0.35549164],"study_design_scores_gemma":[0.0019751173,0.0014989038,0.004534042,0.00016016113,0.000042177417,0.00006595183,0.00032744958,0.9060369,0.007935381,0.0010494578,0.075395316,0.0009791364],"about_ca_topic_score_codex":0.00008586569,"about_ca_topic_score_gemma":0.00016545173,"teacher_disagreement_score":0.9004473,"about_ca_system_score_codex":0.00007860978,"about_ca_system_score_gemma":0.000044248296,"threshold_uncertainty_score":0.5347381},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038142443,0.0029701872,0.9083154,0.002517228,0.0019113997,0.0069425893,0.000030636023,0.0008045319,0.03836557],"genre_scores_gemma":[0.9137992,0.00061085296,0.07161063,0.0077159647,0.0006730849,0.0021279382,0.00006900138,0.00004629076,0.0033470236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964937,0.0003921051,0.0010411697,0.00033545366,0.00049270305,0.0012448562],"domain_scores_gemma":[0.99770814,0.00011644765,0.00059703656,0.0008147267,0.00041059186,0.0003530765],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001638897,0.00044809902,0.00041559845,0.00018614017,0.00044325812,0.0017693067,0.0014256227,0.00045078917,0.00010231378],"category_scores_gemma":[0.00009143596,0.0004943053,0.00016302062,0.00087673625,0.00016437676,0.011697762,0.0003023901,0.00052941695,0.0005509638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010452012,0.00015096144,0.001009368,0.0015470738,0.000065077504,0.000026637279,0.04940575,0.010461127,0.00024236646,0.031716753,0.009248191,0.8960222],"study_design_scores_gemma":[0.00091332133,0.0007912359,0.009296084,0.0021196818,0.000040563904,0.0003649014,0.0008091688,0.7025937,0.0016165866,0.029708238,0.25106382,0.000682731],"about_ca_topic_score_codex":0.00035835893,"about_ca_topic_score_gemma":0.000121743,"teacher_disagreement_score":0.8953394,"about_ca_system_score_codex":0.0016589584,"about_ca_system_score_gemma":0.0006626632,"threshold_uncertainty_score":0.99975085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8036725,0.00004797428,0.16377035,0.000039637074,0.0002715618,0.00016223226,0.0000010394004,0.0000965657,0.031938154],"genre_scores_gemma":[0.9964389,0.0000030964225,0.0031030367,0.000076213466,0.0000713477,0.00000799295,4.3174703e-7,0.0000043872997,0.0002945611],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99915516,0.000078589,0.0001621622,0.00017298179,0.00012950973,0.00030159045],"domain_scores_gemma":[0.9988581,0.00014399693,0.000058917034,0.00076322607,0.000037784244,0.00013797414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053381483,0.000093960916,0.0001324692,0.000032648968,0.000025299641,0.000021685728,0.00047495082,0.00004379719,0.0002771098],"category_scores_gemma":[0.000017241131,0.00006456679,0.000103148675,0.0002302181,0.000029549945,0.0003603304,0.00013109644,0.000081170074,0.0001243346],"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.0000784506,0.0021155304,0.4209865,0.000026612684,0.00012502991,0.000004225545,0.0010580426,0.008772781,0.0037990187,0.38818944,0.018093588,0.15675078],"study_design_scores_gemma":[0.00036743956,0.0004384469,0.9241426,0.000010987248,0.000004803949,0.0000051758166,0.0000054176408,0.059332903,0.01377242,0.00090623816,0.00078741624,0.00022614778],"about_ca_topic_score_codex":0.00006979286,"about_ca_topic_score_gemma":0.0000037696504,"teacher_disagreement_score":0.5031561,"about_ca_system_score_codex":0.000052966156,"about_ca_system_score_gemma":0.000035863904,"threshold_uncertainty_score":0.30341578},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034853548,0.00008402384,0.99387825,0.00073247676,0.00033616682,0.0005823787,0.000006129949,0.00040170667,0.000493538],"genre_scores_gemma":[0.96514267,0.00003166527,0.032830413,0.0008870318,0.00024916162,0.00016338707,0.000023784845,0.000015261632,0.000656614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851173,0.0000449406,0.00027485008,0.0004549888,0.0002132802,0.00050021376],"domain_scores_gemma":[0.99863195,0.00025121897,0.0000922897,0.0006391601,0.00013629666,0.00024905155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021170311,0.00017732842,0.00025403727,0.000031766893,0.00025367472,0.00006631294,0.00081336935,0.00013250798,0.000043642383],"category_scores_gemma":[0.000036850124,0.00014744994,0.00012157075,0.00033293295,0.00004608378,0.00030715694,0.00014802942,0.00014709466,0.000017133108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002281687,0.00046123334,0.005271173,0.00003422236,0.00015886156,0.00012870673,0.00019432988,0.011249935,0.00096601626,0.4741399,0.43301088,0.07415656],"study_design_scores_gemma":[0.0013300595,0.00009311682,0.00066169293,0.000014494977,0.0000045467914,0.000032678607,0.0000025550542,0.9856838,0.000246442,0.0003464864,0.011379141,0.00020499626],"about_ca_topic_score_codex":0.000008020828,"about_ca_topic_score_gemma":0.0000049759897,"teacher_disagreement_score":0.97443384,"about_ca_system_score_codex":0.000043753404,"about_ca_system_score_gemma":0.000085225394,"threshold_uncertainty_score":0.60128343},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000842235,0.000011770169,0.6194676,0.0000863395,0.00016974243,0.3652896,0.000001424108,0.0005760789,0.0135552175],"genre_scores_gemma":[0.01820204,0.0000011488329,0.19342066,0.00013418644,0.000067656794,0.7869689,6.536242e-7,0.000009816688,0.0011949604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882174,0.00003953371,0.00022726909,0.00038022964,0.0001987979,0.00033241496],"domain_scores_gemma":[0.9993031,0.00013062757,0.000058530684,0.00038483253,0.000057312267,0.00006559921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016771266,0.00013799759,0.00015852619,0.000057338642,0.00008737692,0.000036242247,0.00047201608,0.00005166217,0.00003834326],"category_scores_gemma":[0.0000061130427,0.00011711139,0.000041679523,0.00026661006,0.00002477044,0.00028302718,0.00017855104,0.00007792398,0.000024640354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013257653,0.0063148914,0.019232837,0.0006787381,0.00027830928,0.0005459224,0.024538476,0.032015692,0.00026352867,0.64501,0.17286661,0.09692921],"study_design_scores_gemma":[0.0033899269,0.0013275385,0.001337375,0.000043742537,0.0000024450503,0.000036057067,0.000057545607,0.64175093,0.0028969282,0.0013211498,0.34734127,0.0004950651],"about_ca_topic_score_codex":0.00001870498,"about_ca_topic_score_gemma":0.00007321208,"teacher_disagreement_score":0.64368886,"about_ca_system_score_codex":0.00010535437,"about_ca_system_score_gemma":0.000095320305,"threshold_uncertainty_score":0.4775664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19934404,0.00037093536,0.7979466,0.0006764576,0.0014601828,0.000113000235,0.0000016414349,0.000025533327,0.00006161187],"genre_scores_gemma":[0.9923616,0.00065182673,0.005300604,0.0007900522,0.00085992785,0.000007687254,0.0000057085426,0.00001371886,0.0000088820725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789596,0.000101192156,0.00073996326,0.0003027253,0.00063845684,0.00032168222],"domain_scores_gemma":[0.9983026,0.0002824739,0.0005123114,0.00025548507,0.0004632337,0.00018393702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000764543,0.00020125457,0.00031420062,0.00024939247,0.00008873744,0.00014507152,0.0011792082,0.00020040548,0.000018081051],"category_scores_gemma":[0.000033121607,0.00019551125,0.0001302531,0.0003870389,0.00014511938,0.0007586112,0.0001456784,0.00063438166,0.0000015406108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015247907,0.0042749047,0.086196154,0.00006211469,0.00085090427,0.0031640579,0.008837082,0.7086229,0.0016782338,0.10545297,0.010673088,0.06866281],"study_design_scores_gemma":[0.0017226,0.00007287925,0.005249659,0.00022096727,0.000008243804,0.00048370112,0.000018833589,0.9910978,0.00009927635,0.00047917414,0.00035310135,0.00019374475],"about_ca_topic_score_codex":0.000041933745,"about_ca_topic_score_gemma":0.00008220335,"teacher_disagreement_score":0.79301757,"about_ca_system_score_codex":0.00011988616,"about_ca_system_score_gemma":0.00013054731,"threshold_uncertainty_score":0.7972717},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022293298,0.0015833088,0.97349524,0.0001905774,0.00037088818,0.0015160005,0.000001781812,0.00030928024,0.00023963553],"genre_scores_gemma":[0.9847213,0.0009582606,0.0109502,0.00021206448,0.0007371943,0.0023027027,0.000025434672,0.00004056805,0.000052274972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764574,0.00009384568,0.00050691894,0.00090097747,0.00018124848,0.0006712505],"domain_scores_gemma":[0.99823624,0.0003171974,0.00018325438,0.000980676,0.000046510777,0.00023610721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054833194,0.0003235692,0.00034328984,0.000098404555,0.00038198754,0.0002979864,0.00083590223,0.00036953719,0.000012782912],"category_scores_gemma":[0.0000062263434,0.00032983063,0.00007670149,0.0009390447,0.00018119514,0.00046539132,0.00023648421,0.0010069797,0.000009545279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043858986,0.00017553018,0.0026349537,0.0000075840885,0.000011865007,0.0000059455137,0.000084948944,0.59124875,0.0003374531,0.026026966,0.0004450795,0.37901655],"study_design_scores_gemma":[0.0005484892,0.000043411113,0.010361014,0.00003393761,0.000012074302,0.000033671608,0.000032381908,0.9759391,0.00005030115,0.00037122046,0.012199273,0.00037512288],"about_ca_topic_score_codex":0.000032980006,"about_ca_topic_score_gemma":0.00032874226,"teacher_disagreement_score":0.96254504,"about_ca_system_score_codex":0.000044861772,"about_ca_system_score_gemma":0.000049409096,"threshold_uncertainty_score":0.99991536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21123904,0.00050746277,0.7745171,0.00059823913,0.0012435224,0.00048152122,9.757148e-7,0.0005205771,0.010891517],"genre_scores_gemma":[0.9614613,0.00004043562,0.035089057,0.000443951,0.00012770244,0.000034319964,0.000009201288,0.000028120776,0.002765929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977884,0.0000764271,0.00037695334,0.00066090893,0.0002811065,0.00081616215],"domain_scores_gemma":[0.9983937,0.00015778736,0.00010487164,0.0011218106,0.000060472095,0.00016135874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007985928,0.00023717093,0.00027197038,0.000102351456,0.00013051284,0.00027081915,0.0012621398,0.000226951,0.00032073515],"category_scores_gemma":[0.00003416186,0.00022384967,0.00008055475,0.0007426183,0.000052268988,0.0006018499,0.0006264142,0.000817474,0.00035257664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025212395,0.00037609323,0.0068566557,0.000024108705,0.00005901889,0.00043645786,0.0007114886,0.38362494,0.0052018436,0.04921926,0.006527742,0.54693717],"study_design_scores_gemma":[0.00030545096,0.00003415608,0.0022406408,0.000024038864,0.0000031791465,0.000027490883,0.000009139266,0.9913548,0.00006651735,0.00047758475,0.005175298,0.00028165436],"about_ca_topic_score_codex":0.000091622,"about_ca_topic_score_gemma":0.0015559652,"teacher_disagreement_score":0.75022227,"about_ca_system_score_codex":0.00006547034,"about_ca_system_score_gemma":0.00006862218,"threshold_uncertainty_score":0.91283244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33404502,0.0052237627,0.6595318,0.00019977066,0.00004771504,0.0006382744,0.000002072669,0.00017010715,0.0001414855],"genre_scores_gemma":[0.96658486,0.0011271025,0.03173326,0.00039277057,0.000012738197,0.00010102511,0.000017388804,0.000027442142,0.00000338962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980879,0.00024393639,0.00047440903,0.00052315235,0.00018008918,0.00049055286],"domain_scores_gemma":[0.9972984,0.0005323877,0.00022383626,0.0016633376,0.00013909413,0.00014289757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057313306,0.00028064862,0.000372209,0.00018353353,0.00064478465,0.0002779348,0.001263963,0.00012520728,0.0000020948848],"category_scores_gemma":[0.000008277951,0.00026966498,0.00004724712,0.0009806942,0.00033337958,0.00026808688,0.0011405156,0.0005535324,0.0000011576154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071771676,0.00048250784,0.021646732,0.0000514771,0.00006724515,0.00004655608,0.0035404311,0.53001887,0.000073298106,0.023014601,0.000018589786,0.4209679],"study_design_scores_gemma":[0.0023089258,0.00016615848,0.002858473,0.00062658585,0.000010339273,0.000041231444,0.00047940426,0.9914858,0.000014135613,0.00012635604,0.0015222034,0.00036040638],"about_ca_topic_score_codex":0.00013998357,"about_ca_topic_score_gemma":0.00043848253,"teacher_disagreement_score":0.63253987,"about_ca_system_score_codex":0.00006689609,"about_ca_system_score_gemma":0.000119381206,"threshold_uncertainty_score":0.99997556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4295548,0.0040485216,0.565199,0.000057887642,0.00023848718,0.00042888644,9.3405447e-7,0.00018210696,0.00028936216],"genre_scores_gemma":[0.993119,0.005482359,0.0009938362,0.00013107818,0.00010406991,0.000055191176,0.000045088218,0.00003655677,0.000032791955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755216,0.00039197286,0.00067946845,0.00049644656,0.00031384162,0.0005661047],"domain_scores_gemma":[0.9975649,0.0004200394,0.0003486705,0.001400434,0.00013213175,0.00013379945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046739873,0.00030632096,0.0004646026,0.00018259324,0.00018657744,0.000059128677,0.0013046378,0.00030260917,0.000020468366],"category_scores_gemma":[0.00001677403,0.00028851355,0.00017270276,0.0015356061,0.00017859705,0.0004219203,0.00022487012,0.0005592392,0.000009859128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058772424,0.00019627737,0.0052300747,0.000004375696,0.000021055543,0.000013021871,0.00033510342,0.91080326,0.00000222749,0.0010558655,0.0017880017,0.08049196],"study_design_scores_gemma":[0.00071774545,0.00026953852,0.026805695,0.00017403896,0.000004470901,0.000016171416,0.000008576672,0.9715254,0.000008844692,0.00006143855,0.00014633402,0.00026179102],"about_ca_topic_score_codex":0.00003450097,"about_ca_topic_score_gemma":0.0001404619,"teacher_disagreement_score":0.56420517,"about_ca_system_score_codex":0.00019735175,"about_ca_system_score_gemma":0.00009750581,"threshold_uncertainty_score":0.9999567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.838545,0.0014064249,0.14732969,0.007869007,0.0012862753,0.00038402746,8.852716e-7,0.000071705166,0.0031069424],"genre_scores_gemma":[0.9910042,0.0026323912,0.005569046,0.00048613935,0.00026343158,0.000016269863,0.0000016578117,0.00001955255,0.0000072547355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997886,0.0005594743,0.0006164336,0.00025244808,0.00029490297,0.00039076118],"domain_scores_gemma":[0.9955328,0.0018731344,0.0004917834,0.0018632241,0.00011177044,0.0001272849],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019452599,0.00020890031,0.00031478424,0.0001415029,0.0007919812,0.00027992146,0.0027992104,0.00011895518,0.000008288282],"category_scores_gemma":[0.000027540456,0.00015599377,0.000092387345,0.00069258467,0.00055352924,0.00022245804,0.00067906844,0.0025228627,0.0000022813465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020801712,0.00017067777,0.004044406,0.0000038952016,0.00002502096,0.000007673389,0.00031787122,0.009545199,0.00024316124,0.8142272,0.00006908845,0.17132497],"study_design_scores_gemma":[0.00034105466,0.00009434001,0.0045804884,0.00038078142,0.0000055878418,0.00006994793,0.00003565166,0.98151314,0.00004313949,0.011590535,0.001161204,0.00018412928],"about_ca_topic_score_codex":0.000013235139,"about_ca_topic_score_gemma":0.00020414281,"teacher_disagreement_score":0.97196794,"about_ca_system_score_codex":0.000033799828,"about_ca_system_score_gemma":0.00005005781,"threshold_uncertainty_score":0.99977833},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10209527,0.000033048374,0.88281554,0.0035388283,0.0007259677,0.000764443,0.0000104110895,0.00029469887,0.009721799],"genre_scores_gemma":[0.96181893,0.00000247306,0.03730599,0.00052188325,0.00013369715,0.00009206064,0.000008848308,0.000009680852,0.000106410866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987567,0.000046294103,0.00020470019,0.00040887544,0.00018971869,0.00039372747],"domain_scores_gemma":[0.9990529,0.00018405738,0.0000687185,0.0005564033,0.000051564377,0.00008637745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045613,0.00012861901,0.00016089168,0.000103940285,0.00010139589,0.00013162043,0.0007596747,0.00012608897,0.00002481673],"category_scores_gemma":[0.00006132937,0.00012615325,0.00007465514,0.00033535127,0.00002203027,0.00024159561,0.00023344276,0.0004811226,0.000011282519],"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.0000033493075,0.0001789034,0.0031829758,0.000031247484,0.000023311408,0.000018424302,0.0029322316,0.0033867965,0.00062709034,0.9548219,0.0026186411,0.032175116],"study_design_scores_gemma":[0.00031721467,0.000018680703,0.0046795527,0.0000057933557,0.0000027840347,0.0000057755565,0.000008665575,0.6084506,0.00018920065,0.38055548,0.0055990787,0.00016720996],"about_ca_topic_score_codex":0.00011979698,"about_ca_topic_score_gemma":0.0049296604,"teacher_disagreement_score":0.8597237,"about_ca_system_score_codex":0.000037400223,"about_ca_system_score_gemma":0.000034556262,"threshold_uncertainty_score":0.51443803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007014508,0.000001249417,0.9435111,0.0005298833,0.00017958868,0.042467292,9.362461e-7,0.0002589686,0.0060364353],"genre_scores_gemma":[0.7974987,6.590037e-8,0.12723283,0.00045544282,0.00017763655,0.07342479,0.0000029899986,0.000024495148,0.0011830629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822164,0.00010822141,0.00041203806,0.00045816612,0.000328684,0.00047124736],"domain_scores_gemma":[0.9985478,0.00020987232,0.00013669125,0.00087639975,0.00007931531,0.00014991498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513189,0.00018513743,0.00017222251,0.000039825274,0.0001546772,0.0006400764,0.0012884268,0.00006945967,0.00042685002],"category_scores_gemma":[0.00003370319,0.00011650938,0.000046019482,0.00036047338,0.00008643223,0.0006179115,0.00059725717,0.00031389162,0.00042338483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027170661,0.00054688076,0.0637955,0.00012366613,0.00012685418,0.00019669956,0.0034663873,0.015418052,0.0061508496,0.6551195,0.10346572,0.15156277],"study_design_scores_gemma":[0.00027765278,0.00009481732,0.013672498,0.000023145501,0.000008238742,0.000021696475,0.00005212163,0.9826329,0.0006224098,0.0019472502,0.0003953433,0.0002519601],"about_ca_topic_score_codex":0.00040695447,"about_ca_topic_score_gemma":0.00003466562,"teacher_disagreement_score":0.9672148,"about_ca_system_score_codex":0.000039496823,"about_ca_system_score_gemma":0.000068953676,"threshold_uncertainty_score":0.61722714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029182055,0.005552291,0.987365,0.00006764651,0.00012617846,0.00089684123,9.846137e-7,0.00019635473,0.002876476],"genre_scores_gemma":[0.9742516,0.020896062,0.00093836844,0.0002685903,0.0004342996,0.0030593346,0.000012586483,0.000019158419,0.000119981996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983456,0.000052827745,0.00035229497,0.0006139445,0.00015528427,0.0004800383],"domain_scores_gemma":[0.998784,0.00018255343,0.000110648565,0.00071315083,0.000048259193,0.00016137779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001855166,0.00020719053,0.00026110336,0.00006960714,0.00032702822,0.00007331242,0.00065981894,0.00014033535,0.00001154747],"category_scores_gemma":[0.0000017537188,0.0002045794,0.000052660464,0.0009415341,0.00015696173,0.00049252267,0.00025505427,0.00032547375,0.000010380966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003952807,0.0001205722,0.0045369756,0.0000068003733,0.0000050961726,0.000012014931,0.00003813699,0.48586723,0.0000036535998,0.13362509,0.001081433,0.37469906],"study_design_scores_gemma":[0.00029734295,0.00004223208,0.0026692655,0.000022301603,0.000003598058,0.00004765628,0.000014383007,0.9278135,0.0000053582285,0.0009449232,0.06786521,0.00027428946],"about_ca_topic_score_codex":0.000012429283,"about_ca_topic_score_gemma":0.00005339296,"teacher_disagreement_score":0.98642665,"about_ca_system_score_codex":0.000033637745,"about_ca_system_score_gemma":0.000028595054,"threshold_uncertainty_score":0.83425057},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03326894,0.0000922977,0.9603682,0.0011635406,0.0010613657,0.00074501615,0.0000029269324,0.00058283773,0.0027148698],"genre_scores_gemma":[0.70041174,0.000001388633,0.29558665,0.003082672,0.0006468801,0.0000062409713,0.000018927425,0.000039815863,0.00020569505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961539,0.00034826694,0.0008743874,0.0010021076,0.00052162533,0.0010997173],"domain_scores_gemma":[0.9962591,0.0019290603,0.0003015826,0.0010261926,0.00025398575,0.0002300584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005182775,0.00041624246,0.0004484184,0.00012035179,0.00062233035,0.00096050755,0.0013155312,0.0001900919,0.00018026162],"category_scores_gemma":[0.00013440938,0.00036635713,0.0001088645,0.0006651451,0.00011431144,0.0010520953,0.0019118952,0.000623148,0.0006491401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063830944,0.00017604155,0.0027801734,0.00010380936,0.000097514654,0.000036397018,0.006406898,0.8051887,0.00014135404,0.019142443,0.022849768,0.14307052],"study_design_scores_gemma":[0.000713121,0.000047523044,0.0024174806,0.00009538051,0.000014463337,0.00004664148,0.0000867403,0.98797584,0.000032919714,0.004555234,0.0035319729,0.00048268735],"about_ca_topic_score_codex":0.00012783858,"about_ca_topic_score_gemma":0.000011118016,"teacher_disagreement_score":0.6671428,"about_ca_system_score_codex":0.00013569673,"about_ca_system_score_gemma":0.00006440505,"threshold_uncertainty_score":0.9998788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000734677,0.00037332045,0.995395,0.00021227235,0.0018474915,0.0009104616,0.000013366487,0.00027364283,0.00023978733],"genre_scores_gemma":[0.92966795,0.00006853222,0.06876923,0.00022960537,0.0008892303,0.0002419345,0.00000952627,0.00004639399,0.00007758751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674827,0.00032574075,0.00062928343,0.0007500111,0.0005351417,0.0010115528],"domain_scores_gemma":[0.99646527,0.0016390438,0.0002118575,0.0012619189,0.00024247204,0.00017942632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014249432,0.000375055,0.00046478462,0.000090194524,0.0007627706,0.000293831,0.0018910853,0.00017413429,0.000008163787],"category_scores_gemma":[0.000004089428,0.00031693265,0.0002481481,0.0010745807,0.00017877953,0.00032079755,0.00004616719,0.0006266606,0.0000049506316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023973358,0.000050812363,0.000055193126,0.000011918112,0.000063449166,0.0000030006042,0.000058913767,0.53528076,0.000003658074,0.0004385862,0.00012807976,0.46388164],"study_design_scores_gemma":[0.0007384668,0.0002586291,0.000059627415,0.00028434882,0.000039087892,0.000039623686,0.00002617052,0.99249715,0.00034081368,0.0012585385,0.0041361093,0.00032145248],"about_ca_topic_score_codex":0.000121431716,"about_ca_topic_score_gemma":0.000048979968,"teacher_disagreement_score":0.92893326,"about_ca_system_score_codex":0.00017220216,"about_ca_system_score_gemma":0.00010514927,"threshold_uncertainty_score":0.9999283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013630171,0.0035784936,0.99248236,0.00032561977,0.0004924052,0.0009871869,0.0000022925788,0.0004934388,0.00027520707],"genre_scores_gemma":[0.58698636,0.0007747016,0.41123015,0.0004752795,0.0001295364,0.00029796406,0.000023157732,0.000023514865,0.00005931241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998233,0.000124409,0.0004983645,0.00045883527,0.00018256568,0.0005028063],"domain_scores_gemma":[0.99475724,0.00074862037,0.00019806618,0.0038775115,0.0002503082,0.00016824005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092634175,0.00022139603,0.00022727656,0.00016048174,0.0004955904,0.00019794039,0.0035111192,0.0001674161,0.0000029977052],"category_scores_gemma":[0.000013845773,0.00023387208,0.00015519618,0.0005974956,0.00017282412,0.00038774998,0.0018848932,0.00039175295,0.000020731173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015046425,0.0001405272,0.00001054032,0.0000102986805,0.000017895547,7.129523e-7,0.00091686816,0.117610425,0.000056632132,0.043050893,0.0005644963,0.83760566],"study_design_scores_gemma":[0.0003754798,0.00015255729,0.00009736601,0.00003855672,0.000013419008,0.000015507185,0.000010509558,0.96191096,0.00006892489,0.012084334,0.024986899,0.00024546523],"about_ca_topic_score_codex":0.0000019673646,"about_ca_topic_score_gemma":0.000087198896,"teacher_disagreement_score":0.84430057,"about_ca_system_score_codex":0.00013550105,"about_ca_system_score_gemma":0.000050401664,"threshold_uncertainty_score":0.9537026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004090848,0.00034521634,0.9657433,0.0003819282,0.00060067786,0.0004512983,2.2539224e-7,0.0002603006,0.028126217],"genre_scores_gemma":[0.62787,0.0000035172413,0.3708588,0.0006072465,0.00040926278,0.00009937755,0.0000010297557,0.00000719773,0.0001435367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975296,0.00010660205,0.00034069736,0.0004936843,0.00055908156,0.0009702848],"domain_scores_gemma":[0.9975898,0.00055829115,0.000034359335,0.0010030083,0.00024141149,0.0005731325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015887893,0.00017624913,0.00022252693,0.00019356406,0.00016530548,0.00014919185,0.0010831306,0.000113448914,0.000029639057],"category_scores_gemma":[0.0007055814,0.00014945983,0.000054596614,0.007500327,0.00006136313,0.00092113635,0.0006196811,0.0002546515,0.00035077642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008728336,0.0009329639,0.055574752,0.000079893915,0.00001594598,3.9478354e-7,0.00024598674,0.04224608,0.0000015073565,0.7877543,0.021683825,0.09145559],"study_design_scores_gemma":[0.00013896989,0.00012987616,0.05349344,0.000010649585,0.000009498416,0.000025288266,0.0000068322315,0.92862844,0.0000493768,0.0015161473,0.01559493,0.000396559],"about_ca_topic_score_codex":0.000008508276,"about_ca_topic_score_gemma":6.273908e-7,"teacher_disagreement_score":0.88638234,"about_ca_system_score_codex":0.00014367893,"about_ca_system_score_gemma":0.000066772336,"threshold_uncertainty_score":0.6094795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028760245,0.0000117699865,0.79314995,0.0000276767,0.00066499173,0.010624559,0.0000014850852,0.0005323815,0.1946996],"genre_scores_gemma":[0.30106938,0.000028997903,0.5109871,0.0020764652,0.0030508863,0.11607375,0.016498482,0.00024535862,0.049969595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981932,0.000043672026,0.00065021595,0.00032187696,0.00047902766,0.00031198843],"domain_scores_gemma":[0.998471,0.000039506856,0.00060246553,0.00058372575,0.00026778833,0.000035490204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002151923,0.0002751304,0.00023865784,0.00009807589,0.0001836463,0.0007939142,0.00074836874,0.0003181401,0.000028464612],"category_scores_gemma":[0.000027098458,0.00027257795,0.00007962934,0.0004589078,0.000006947466,0.0042383964,0.00007432195,0.00033530215,0.0001749027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039994113,0.0001114851,0.00016938569,0.00074967905,0.000042357497,0.000009258739,0.009461075,0.01939355,0.00020845806,0.7534716,0.04469031,0.17165282],"study_design_scores_gemma":[0.0012939943,0.00024135593,0.0025175898,0.0015250464,0.000035210538,0.000016198588,0.000657724,0.8623535,0.01950417,0.013363769,0.09640787,0.0020835462],"about_ca_topic_score_codex":0.00017522667,"about_ca_topic_score_gemma":0.00028941807,"teacher_disagreement_score":0.84296,"about_ca_system_score_codex":0.00011938648,"about_ca_system_score_gemma":0.00017809436,"threshold_uncertainty_score":0.99997264},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24381721,0.00069830747,0.7398566,0.00025033168,0.00046759518,0.0001902513,2.8387848e-7,0.00027169747,0.014447723],"genre_scores_gemma":[0.96527344,0.000119946286,0.033695616,0.00032901551,0.00008557519,0.0000041275716,0.000002530511,0.0000036891558,0.00048607812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985333,0.00004543971,0.00037122486,0.00034526788,0.00028844553,0.00041630023],"domain_scores_gemma":[0.9988345,0.0000747197,0.00016703048,0.00075794116,0.00007987072,0.00008595739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043989424,0.0001338504,0.00032860148,0.00014577202,0.00009032888,0.000059931303,0.00080289535,0.000054420594,0.00007305498],"category_scores_gemma":[0.000009399245,0.00011360564,0.00015467775,0.0028523027,0.000017714274,0.00031128255,0.00014912919,0.00011260123,0.000014978903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010165981,0.00008253615,0.015243561,0.0000056032077,0.00022566639,0.000004056359,0.00030882476,0.54078966,0.00011912328,0.015985992,0.0026714217,0.4245534],"study_design_scores_gemma":[0.000117366464,0.000112710295,0.036577955,0.000017374368,0.0000871369,9.1696756e-7,0.0000051939933,0.9614713,0.0002234475,0.00010348534,0.0011469584,0.00013610559],"about_ca_topic_score_codex":0.0000054292923,"about_ca_topic_score_gemma":0.00001718787,"teacher_disagreement_score":0.7214562,"about_ca_system_score_codex":0.000036784,"about_ca_system_score_gemma":0.00003315228,"threshold_uncertainty_score":0.46327034},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.3054937e-7,0.002423445,0.61478937,0.00016655892,0.0009102079,0.00090830855,0.000014008205,0.00039642802,0.38039082],"genre_scores_gemma":[0.0012984726,0.0008374748,0.062153902,0.0014790538,0.0014282779,0.000247223,0.00012182604,0.00018688892,0.93224686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620175,0.000018500572,0.00076375046,0.0014786797,0.0005859556,0.00095138396],"domain_scores_gemma":[0.99680597,0.0002812786,0.00043007298,0.0019508568,0.0002635608,0.00026827626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031436002,0.00082133187,0.0008505024,0.0002141532,0.00019938071,0.00034510548,0.0023590587,0.0009911483,0.000047750385],"category_scores_gemma":[0.0000047382614,0.00079339405,0.0005226554,0.0001125635,0.0000989296,0.00035275708,0.0007467172,0.000641726,0.00007558635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013398633,0.000019633453,4.0717447e-7,0.000022050115,0.000043545504,0.0000192194,0.000019720332,0.15565358,4.7972077e-7,0.4530641,0.2954257,0.095718145],"study_design_scores_gemma":[0.00039459314,0.00008675809,7.614676e-7,0.00010284177,0.00003086913,0.000013907515,3.6711853e-7,0.7395043,0.0000011525269,0.04254481,0.21662675,0.000692909],"about_ca_topic_score_codex":0.000007981787,"about_ca_topic_score_gemma":0.00022126861,"teacher_disagreement_score":0.5838507,"about_ca_system_score_codex":0.00017472313,"about_ca_system_score_gemma":0.0002277192,"threshold_uncertainty_score":0.9994517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013111414,0.0002821346,0.6024953,0.00013480637,0.00084565155,0.22049019,6.78624e-7,0.0014082865,0.16123155],"genre_scores_gemma":[0.56349206,0.0000106238695,0.18532716,0.0010719402,0.00043434865,0.24820416,0.0000014718473,0.00005874615,0.0013994894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793184,0.00012482419,0.00040173126,0.00062489556,0.0002785313,0.000638157],"domain_scores_gemma":[0.9988214,0.000109986475,0.00013832976,0.0007655657,0.000044741206,0.00012000673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073387084,0.00021512702,0.00022665499,0.00007042466,0.00013592844,0.00012545251,0.00095704925,0.00012236042,0.000167385],"category_scores_gemma":[0.000020497393,0.00017479874,0.000059035334,0.00063039945,0.00002919266,0.00044691082,0.00048752065,0.00036811735,0.00011351139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019288385,0.0007837579,0.017893614,0.00009830742,0.000037677048,0.00028014285,0.010513323,0.04197847,0.000047145288,0.17108685,0.0142887505,0.7427991],"study_design_scores_gemma":[0.0033921439,0.0025663488,0.01088422,0.0010442289,0.0000069504713,0.000041322626,0.00022217844,0.8812918,0.0012012478,0.018743273,0.079149604,0.0014566439],"about_ca_topic_score_codex":0.000011314591,"about_ca_topic_score_gemma":0.00006758045,"teacher_disagreement_score":0.8393134,"about_ca_system_score_codex":0.00005634742,"about_ca_system_score_gemma":0.00007254154,"threshold_uncertainty_score":0.71280855},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18810378,0.00026512909,0.8094865,0.0004389973,0.00085808814,0.00018862674,0.0000017210313,0.00057491264,0.00008220993],"genre_scores_gemma":[0.9888976,0.00002023954,0.010493985,0.00029023847,0.0000808918,0.00015314811,0.000001898275,0.00003011167,0.00003187699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742085,0.00013601391,0.0004576201,0.000628071,0.0003682104,0.0009892264],"domain_scores_gemma":[0.99852926,0.00013052615,0.00012402887,0.000978405,0.00007909186,0.00015868297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000399347,0.00030223565,0.0003611219,0.0006194076,0.00027178513,0.000041078467,0.0008866821,0.0005039906,0.000035408517],"category_scores_gemma":[0.0000051671686,0.00032537067,0.00012954099,0.0018233777,0.00024472232,0.00023622472,0.000026077952,0.0009357727,0.000050243692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015410493,0.0011106957,0.000085491476,0.000009097574,0.000031221924,0.000033859673,0.0000621427,0.806811,0.0026982215,0.044551816,0.000028705777,0.14456238],"study_design_scores_gemma":[0.0005163287,0.000087447545,0.00018137836,0.00009665925,0.000013232507,0.00010082895,0.000015113272,0.95915765,0.0385125,0.0007088469,0.0002421412,0.000367853],"about_ca_topic_score_codex":0.000059649763,"about_ca_topic_score_gemma":0.00009736466,"teacher_disagreement_score":0.8007938,"about_ca_system_score_codex":0.00023639256,"about_ca_system_score_gemma":0.000055434568,"threshold_uncertainty_score":0.99991983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011790263,0.00006436587,0.88853616,0.0010053264,0.00051159045,0.094728395,0.0000089319365,0.00034511986,0.0030098304],"genre_scores_gemma":[0.39030233,0.00004554451,0.33360347,0.0009343427,0.0010241772,0.27213228,0.000028071749,0.00007869348,0.0018510974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796903,0.00008316308,0.00044767262,0.000866812,0.00018084241,0.00045248892],"domain_scores_gemma":[0.99852246,0.00017491633,0.00021356919,0.00089012523,0.00008925309,0.00010968755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068490405,0.00026195685,0.00036091486,0.0000810869,0.000047745318,0.00053975725,0.001031674,0.00024525807,0.000017896735],"category_scores_gemma":[0.000033018918,0.0002401278,0.000057095807,0.00009583011,0.000029745635,0.00023496908,0.002732872,0.0005974216,0.000013690129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049140635,0.00027374647,0.0080445465,0.00290739,0.00010060437,0.000063720276,0.00806016,0.018543087,0.000048690115,0.1370742,0.015949408,0.80888534],"study_design_scores_gemma":[0.00044739546,0.00005710153,0.0012439924,0.0003285883,0.0000019040787,0.000003722855,0.000004717857,0.8979619,0.00014403817,0.09483882,0.0046261386,0.00034165173],"about_ca_topic_score_codex":0.00028958355,"about_ca_topic_score_gemma":0.00021214818,"teacher_disagreement_score":0.87941885,"about_ca_system_score_codex":0.000060683247,"about_ca_system_score_gemma":0.00010891376,"threshold_uncertainty_score":0.97921276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047195167,0.00022231757,0.9902206,0.0018386719,0.0015023957,0.0003271627,0.0000024099274,0.0001354572,0.0010314488],"genre_scores_gemma":[0.9024716,0.000044451546,0.09264495,0.002308807,0.0018153214,0.00026276577,0.000004967318,0.00004705883,0.00040006635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998509,0.000056412024,0.00021460348,0.00052401185,0.00020938418,0.0004865758],"domain_scores_gemma":[0.9981793,0.00069871667,0.00009170201,0.0008262109,0.00006758411,0.0001364886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049879774,0.00019646714,0.00017550385,0.000050735594,0.0003855688,0.000239698,0.0009051743,0.00012607333,0.000014897404],"category_scores_gemma":[0.000044978064,0.00014364514,0.000080534104,0.00026717514,0.00011348432,0.00009920576,0.00027390828,0.0003781534,0.000006988782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009232739,0.000057413752,0.000020272519,0.0000037264406,0.000032144228,0.000007758599,0.00015076615,0.08538629,0.0001537518,0.32661268,0.009653824,0.57791215],"study_design_scores_gemma":[0.00025128436,0.000075258875,0.00022446016,0.000015245776,0.00000758974,0.000030592248,0.0000060241327,0.9707367,0.00027087596,0.0008224339,0.027372928,0.000186635],"about_ca_topic_score_codex":0.000022623703,"about_ca_topic_score_gemma":0.000015110179,"teacher_disagreement_score":0.8977521,"about_ca_system_score_codex":0.000021877582,"about_ca_system_score_gemma":0.000029059293,"threshold_uncertainty_score":0.58576787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3429818,0.000014785137,0.6551221,0.000008082242,0.00006255386,0.00013972579,0.000001378022,0.000033216933,0.0016363666],"genre_scores_gemma":[0.99555135,0.0000041089747,0.0044044093,0.0000025651352,0.000010248156,0.000009735578,0.0000029859445,0.000004433853,0.000010167419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889725,0.000010955239,0.00030665586,0.00027341992,0.00037581593,0.00013589994],"domain_scores_gemma":[0.998669,0.000067780915,0.0002594033,0.00076865486,0.00017938313,0.00005576389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004819702,0.000074953656,0.00012587917,0.000093236544,0.00011217516,0.000054443848,0.0008684697,0.000044096032,0.0000014208679],"category_scores_gemma":[0.00002661905,0.000072551884,0.000014503538,0.0006419624,0.0002779071,0.00058642344,0.00031320026,0.00007450925,0.0000010623187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000734006,0.00005803561,0.0021624316,0.00007139485,0.000003059494,1.3610399e-7,0.0015663177,0.061545815,0.3887924,0.48748562,0.0000059750528,0.058301482],"study_design_scores_gemma":[0.00009482078,0.000011935896,0.0019567406,0.000012593914,0.0000022337192,9.507987e-7,0.000023703342,0.9881169,0.005751351,0.0039555286,0.0000062103118,0.00006698767],"about_ca_topic_score_codex":0.000013060603,"about_ca_topic_score_gemma":0.000011923258,"teacher_disagreement_score":0.92657113,"about_ca_system_score_codex":0.00001599118,"about_ca_system_score_gemma":0.000045731886,"threshold_uncertainty_score":0.295858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022054046,0.00006137287,0.9680177,0.0004389974,0.000082946244,0.009283548,9.4000717e-7,0.00003202451,0.000028450904],"genre_scores_gemma":[0.7259834,0.000017147611,0.26529306,0.0002385293,0.001321513,0.007102726,0.0000021689116,0.000016982629,0.000024510839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820894,0.00008133377,0.0007865516,0.0003177311,0.00018547225,0.00041998905],"domain_scores_gemma":[0.99860823,0.00021833282,0.0004689763,0.00029949564,0.00020698886,0.00019797708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007272137,0.00016873177,0.00028868308,0.00009512884,0.00018079285,0.00041185025,0.00056317286,0.000061820174,0.0000019163822],"category_scores_gemma":[0.000005541705,0.00015364689,0.00007928453,0.00040618208,0.000014734206,0.00047869034,0.0002339161,0.00026335064,0.000005327091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009155466,0.00011263754,0.0014785451,0.00002635199,0.000021756916,0.0000027248595,0.0005458775,0.3086679,0.000059406026,0.004718734,0.0007538871,0.68360305],"study_design_scores_gemma":[0.0005283255,0.00035629148,0.0112791285,0.00030413785,0.0000070935034,0.00004617777,0.000016861926,0.9787062,0.000018343608,0.006035156,0.0025155128,0.00018681414],"about_ca_topic_score_codex":0.000010501835,"about_ca_topic_score_gemma":0.000013973973,"teacher_disagreement_score":0.7039293,"about_ca_system_score_codex":0.00006873509,"about_ca_system_score_gemma":0.00005680006,"threshold_uncertainty_score":0.62655383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005788082,0.00036754206,0.9949598,0.0003630343,0.00013291807,0.003343249,0.000033411998,0.00014097294,0.00008027418],"genre_scores_gemma":[0.7399706,0.00008414319,0.24023664,0.00024890286,0.00045204413,0.018526977,0.00012258026,0.000027038293,0.00033103605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893445,0.000025880732,0.00023715882,0.0004262444,0.0001273386,0.00024892797],"domain_scores_gemma":[0.9988081,0.0002130592,0.00011530592,0.00048048262,0.00023550968,0.00014756634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109695444,0.00015557309,0.00016521761,0.000042301384,0.00020817999,0.00028703405,0.00041083232,0.0001162885,0.0000058262767],"category_scores_gemma":[0.000022740014,0.00013931934,0.000043918073,0.00019246864,0.000054564563,0.0004866442,0.000110224806,0.000109955756,0.000053434196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007394788,0.00026955607,0.0002443254,0.00013016701,0.00013477783,9.0437527e-7,0.0016149866,0.053108905,0.0034561248,0.13099016,0.017176008,0.7928667],"study_design_scores_gemma":[0.00041056462,0.000027158669,0.0030044864,0.000012139003,0.000009974524,0.0000038386243,0.00009673777,0.98169285,0.00013076483,0.001554752,0.012886149,0.0001706007],"about_ca_topic_score_codex":0.00005680055,"about_ca_topic_score_gemma":0.0000051272987,"teacher_disagreement_score":0.9285839,"about_ca_system_score_codex":0.00003140642,"about_ca_system_score_gemma":0.000032385142,"threshold_uncertainty_score":0.56812775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017446539,0.0014395447,0.9101521,0.00012009926,0.00052964553,0.083552696,0.0000018063113,0.00054667715,0.0019127801],"genre_scores_gemma":[0.639031,0.0005458611,0.03847521,0.0009508452,0.0012346652,0.31907022,0.00004301834,0.00018815871,0.00046103526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99397,0.0004351537,0.0011855143,0.0016892994,0.00059412856,0.0021259105],"domain_scores_gemma":[0.99621063,0.00076866976,0.0005387489,0.0019067858,0.00019203807,0.0003830964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015480533,0.00076464756,0.0009136129,0.00019110611,0.00046541245,0.00029375136,0.002638718,0.00065390195,0.000022865199],"category_scores_gemma":[0.000040067483,0.00073180196,0.00034446648,0.0016680058,0.00036685952,0.000760861,0.00081596186,0.001295181,0.00001923451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039232685,0.00053670525,0.0019555253,0.00012430664,0.00007300485,0.00013891193,0.0015246508,0.6344496,0.0000040113473,0.035019692,0.005705395,0.32007584],"study_design_scores_gemma":[0.0029413204,0.0003533044,0.0010884401,0.00029487556,0.000013822275,0.00012287866,0.000038963026,0.9796487,0.0000088224215,0.001885334,0.012751387,0.000852139],"about_ca_topic_score_codex":0.000004854902,"about_ca_topic_score_gemma":0.000036346624,"teacher_disagreement_score":0.87167686,"about_ca_system_score_codex":0.0002489104,"about_ca_system_score_gemma":0.00019682613,"threshold_uncertainty_score":0.9995133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31136012,0.0003586397,0.6860757,0.00016730299,0.0002077804,0.0014434068,0.0000037131874,0.00011417068,0.00026918115],"genre_scores_gemma":[0.9882918,0.00047882373,0.0064940993,0.00037310194,0.00068548234,0.0035671885,0.000018716091,0.000030822168,0.000059961792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981214,0.000027467184,0.00033517284,0.0007772947,0.00016825163,0.0005704249],"domain_scores_gemma":[0.9980176,0.000788081,0.00014045904,0.00065408455,0.00008959348,0.00031019447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052175357,0.00028944152,0.00033631065,0.000052577314,0.000764947,0.000363069,0.00042385588,0.00022010224,0.0000048667916],"category_scores_gemma":[0.000009764564,0.000265935,0.0000507312,0.00034757433,0.00014976601,0.00028090464,0.0002730259,0.0005279526,0.0000025130807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047545815,0.00015843382,0.0051697376,0.000057078967,0.00007011002,0.000002575504,0.000063586114,0.051140424,0.00032397057,0.4075871,0.0029545974,0.5324248],"study_design_scores_gemma":[0.0005525169,0.00020851748,0.0028904788,0.00003956325,0.0000356294,0.00002612635,0.000016827107,0.9753278,0.0000440033,0.0017183196,0.018794332,0.0003458884],"about_ca_topic_score_codex":0.0000070124743,"about_ca_topic_score_gemma":0.000047508915,"teacher_disagreement_score":0.92418736,"about_ca_system_score_codex":0.000017456045,"about_ca_system_score_gemma":0.000025315721,"threshold_uncertainty_score":0.99997926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01230733,0.00026076572,0.9836889,0.0006356136,0.00129164,0.00078107323,0.000004672704,0.00049888616,0.000531146],"genre_scores_gemma":[0.748001,0.000027928209,0.24899466,0.0012228735,0.00033075124,0.00067989045,0.000029227243,0.000026746724,0.00068695465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985228,0.0000317026,0.00024005094,0.0005406024,0.00019824896,0.0004665496],"domain_scores_gemma":[0.9982914,0.00033152348,0.00009446795,0.00091442454,0.0001965479,0.00017164259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003603587,0.0001975225,0.0001926154,0.000057603283,0.00016539023,0.0002080405,0.0008813089,0.00021045316,0.00015777622],"category_scores_gemma":[0.000037193782,0.00017859244,0.00010574583,0.00028004093,0.00006544375,0.0003203808,0.00015334511,0.00031829928,0.000029027988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006633633,0.00031027908,0.0021921133,0.000059647708,0.000047273945,0.000013255943,0.00012200902,0.06491143,0.0034825273,0.062620506,0.033282924,0.8328917],"study_design_scores_gemma":[0.00055904215,0.00013148539,0.00051144836,0.000014505025,0.0000053388394,0.000004237334,0.000006761797,0.9501864,0.00090143445,0.0004843701,0.046948317,0.00024671358],"about_ca_topic_score_codex":0.0000059101017,"about_ca_topic_score_gemma":0.00024808262,"teacher_disagreement_score":0.8852749,"about_ca_system_score_codex":0.00002678068,"about_ca_system_score_gemma":0.00009677867,"threshold_uncertainty_score":0.7282788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0406001,0.0009896178,0.95512253,0.00012146942,0.000929313,0.00023809052,0.0000041584044,0.0009136105,0.0010811373],"genre_scores_gemma":[0.9526423,0.000013536529,0.04644236,0.00026422102,0.00052031013,0.0000034285245,0.000066072345,0.000027920452,0.000019807603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690217,0.00010109402,0.00061959604,0.000746901,0.00041018758,0.0012200286],"domain_scores_gemma":[0.9975677,0.00070705113,0.00034315392,0.0009480837,0.00015496838,0.00027902858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013224808,0.00032431757,0.00034213846,0.000100564896,0.0004922289,0.00035132322,0.0015382397,0.00019156632,0.000013186233],"category_scores_gemma":[0.00009759024,0.00034591032,0.00013937266,0.001466398,0.000059223043,0.00036308233,0.00056021643,0.0006278079,0.000024664088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019358118,0.0001006666,0.0023030897,0.0000135452,0.0000567152,0.00021758823,0.00035326014,0.13468723,0.0003952855,0.009692151,0.00338346,0.84877765],"study_design_scores_gemma":[0.0004944142,0.00007486858,0.010184434,0.00007655543,0.0000063184666,0.00008570416,0.00006152574,0.9788202,0.00074033235,0.00024492198,0.008751506,0.00045921418],"about_ca_topic_score_codex":0.000008739841,"about_ca_topic_score_gemma":0.000005538795,"teacher_disagreement_score":0.91204226,"about_ca_system_score_codex":0.00022078205,"about_ca_system_score_gemma":0.000060409842,"threshold_uncertainty_score":0.99989927},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026864028,0.0000042566353,0.96644944,0.00074142776,0.00021550727,0.0006841987,0.0000020204375,0.00025307568,0.004786021],"genre_scores_gemma":[0.9138286,0.0000011007312,0.08284246,0.0011192485,0.00013306597,0.00016247421,0.000007885517,0.000023244174,0.0018818822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983793,0.000069972084,0.00025947616,0.00062935817,0.00028001063,0.00038190224],"domain_scores_gemma":[0.9984632,0.0002654875,0.00012258397,0.00071714213,0.00019618015,0.0002353659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034233645,0.00019190583,0.00021233063,0.000089297486,0.00009435481,0.00028718534,0.0012113673,0.0000778074,0.000037376583],"category_scores_gemma":[0.000043445736,0.0001554428,0.000048838432,0.00033920078,0.000042297474,0.00078863284,0.00041193524,0.00012199509,0.00006512766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017774098,0.00013582277,0.0028943843,0.00002115525,0.00006454635,0.000009370263,0.00065632095,0.079428084,0.0005082522,0.6600815,0.012206595,0.24381621],"study_design_scores_gemma":[0.0005340364,0.00065042777,0.0054724505,0.000038620554,0.000009101571,0.0000039881666,0.00000871662,0.9845096,0.00059113017,0.0032822462,0.004648445,0.0002512272],"about_ca_topic_score_codex":0.0000734673,"about_ca_topic_score_gemma":0.00014115869,"teacher_disagreement_score":0.9050815,"about_ca_system_score_codex":0.00006710118,"about_ca_system_score_gemma":0.000051472984,"threshold_uncertainty_score":0.63387734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16266109,0.000054258333,0.8351276,0.00029649166,0.00042315348,0.00077092956,0.0000046530668,0.00022448419,0.0004373265],"genre_scores_gemma":[0.71158916,0.0000020491457,0.2861675,0.00019368457,0.00009560721,0.00016838714,0.000020425174,0.000012868527,0.0017503313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987419,0.000028013883,0.00022915256,0.00053809327,0.00016140322,0.0003013972],"domain_scores_gemma":[0.99901974,0.00009486895,0.00009236706,0.0005524236,0.0001130184,0.00012760055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026790038,0.00019008864,0.00015677878,0.000064256725,0.00007261505,0.00022947854,0.00054044655,0.00015845822,0.000052087733],"category_scores_gemma":[0.00004062891,0.00014878553,0.00005303315,0.00018475695,0.00008753524,0.00011109672,0.00015615502,0.00037850795,0.000012964231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016954457,0.00093217485,0.0008021275,0.00023635331,0.00014110166,0.00004664591,0.0053189383,0.020187479,0.12418293,0.35035762,0.045018706,0.45260638],"study_design_scores_gemma":[0.00058230426,0.00015464002,0.0002500513,0.000017007096,0.0000044738063,0.000037264905,0.00003329782,0.9581252,0.0059696366,0.00040860308,0.03420791,0.00020961932],"about_ca_topic_score_codex":0.000055608143,"about_ca_topic_score_gemma":0.0007187875,"teacher_disagreement_score":0.93793774,"about_ca_system_score_codex":0.000016568622,"about_ca_system_score_gemma":0.000042178526,"threshold_uncertainty_score":0.6067298},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09339882,0.00042675823,0.90356594,0.00024510358,0.0006256079,0.0009021192,0.0000047748335,0.00036299747,0.00046789309],"genre_scores_gemma":[0.81314147,0.0004115647,0.18559696,0.0001907235,0.00020323071,0.00030443168,0.000051048515,0.00003698826,0.00006356835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795514,0.00013466604,0.0005831968,0.0006086654,0.00017852645,0.00053983147],"domain_scores_gemma":[0.9953129,0.0009107813,0.00032590938,0.002885263,0.00037689184,0.00018823896],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00085145293,0.0002832508,0.00034036994,0.000106103784,0.0013482992,0.0006946388,0.0026658615,0.00024103695,0.000014023768],"category_scores_gemma":[0.00002768785,0.00029782514,0.0001133528,0.0004937178,0.00030206316,0.0005030169,0.0019019266,0.00066214945,0.0000034678437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008901131,0.00020254825,0.0016123466,0.000035996876,0.00004523807,0.0000010866128,0.00076083234,0.16932784,0.0006774192,0.17447172,0.00028738703,0.6525687],"study_design_scores_gemma":[0.0005392402,0.000063936044,0.00032715892,0.000050398598,0.000013214178,0.000020978418,0.0000361513,0.9917993,0.00011881337,0.00020708615,0.006483932,0.00033982142],"about_ca_topic_score_codex":0.000035926714,"about_ca_topic_score_gemma":0.00005305036,"teacher_disagreement_score":0.82247144,"about_ca_system_score_codex":0.000032881562,"about_ca_system_score_gemma":0.000076381846,"threshold_uncertainty_score":0.99995184},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17790803,0.0037993302,0.8140125,0.000028329952,0.00040517614,0.0005712346,0.0000013273612,0.00023238806,0.0030416462],"genre_scores_gemma":[0.99312127,0.00003477458,0.0064278627,0.000040230287,0.00012491443,0.00002782585,0.000004996548,0.000019429706,0.00019869504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979827,0.0005488781,0.0005549241,0.00032087753,0.00022598678,0.00036662442],"domain_scores_gemma":[0.99727035,0.0010598322,0.00031016849,0.0011531591,0.00014188486,0.00006461698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021954698,0.00018079537,0.00036394826,0.000055750865,0.00024068738,0.00019843952,0.001491798,0.000099496865,0.000007482318],"category_scores_gemma":[0.000008058631,0.00017293982,0.00010211679,0.00028331406,0.00012786922,0.000102133316,0.00015196386,0.00015399019,0.0000103009315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019171726,0.000032090044,0.00000249798,0.000041518615,0.000017130309,6.040476e-7,0.0010352858,0.58521223,0.000015499652,0.32885036,0.000114797105,0.084658824],"study_design_scores_gemma":[0.00034795696,0.00009158481,0.00008187633,0.00032112197,0.000009102512,0.000020790714,0.00030854493,0.9928686,0.0000143668,0.0048131524,0.00094636256,0.00017650999],"about_ca_topic_score_codex":0.00001030281,"about_ca_topic_score_gemma":0.0000016348936,"teacher_disagreement_score":0.81521326,"about_ca_system_score_codex":0.0000438431,"about_ca_system_score_gemma":0.000060769133,"threshold_uncertainty_score":0.7052281},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01698368,0.0014320529,0.97844714,0.0008154367,0.000311353,0.0012302618,0.000031491832,0.00041465068,0.00033394172],"genre_scores_gemma":[0.98598456,0.00034627732,0.012339131,0.00025125413,0.0002727817,0.00054575707,0.00019861838,0.000033916705,0.000027671167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976782,0.00022592724,0.0006748189,0.0005851048,0.00020485115,0.00063105853],"domain_scores_gemma":[0.9953361,0.0014664534,0.00037509762,0.0023618094,0.00031149527,0.0001490504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070763123,0.00030462677,0.0004657072,0.00009363985,0.0010494998,0.00068023975,0.0036960137,0.00016779997,0.000002469805],"category_scores_gemma":[0.00001454793,0.00031052498,0.00012672524,0.00057876843,0.00025593737,0.000486407,0.0019505252,0.00036506748,0.0000019123217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022322532,0.00046258653,0.005110325,0.00007113712,0.000102879356,0.0000043650407,0.00024845524,0.036038816,0.00027761265,0.6198135,0.004454644,0.33339334],"study_design_scores_gemma":[0.0010842774,0.00006603876,0.0019056497,0.00008206299,0.000025875072,0.000014665001,0.00003771933,0.98367965,0.00006100992,0.0010490444,0.011643957,0.00035005982],"about_ca_topic_score_codex":0.00014061233,"about_ca_topic_score_gemma":0.00012124964,"teacher_disagreement_score":0.96900094,"about_ca_system_score_codex":0.000071643604,"about_ca_system_score_gemma":0.000080676764,"threshold_uncertainty_score":0.9999347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008019692,0.0013907873,0.9864516,0.00012867103,0.0020092092,0.00022626485,7.8012056e-7,0.00029033393,0.0014826548],"genre_scores_gemma":[0.9844094,0.0017884764,0.012783558,0.00034249507,0.00030018974,0.00014773318,0.0000014940193,0.000055932596,0.00017070146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706346,0.00017330574,0.00045550163,0.0009934361,0.00035269122,0.0009616287],"domain_scores_gemma":[0.99815005,0.00021716463,0.0001646033,0.0011884251,0.000048987822,0.0002307942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034544253,0.00043682347,0.00042166025,0.0002533996,0.00038372917,0.00018090972,0.0011229337,0.00024188554,0.000020081901],"category_scores_gemma":[0.0000014997523,0.00039772686,0.00008886946,0.0014824307,0.00016876266,0.00054096215,0.000035235204,0.00062669447,0.000005349943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012202614,0.00033211973,0.0002800684,0.00001421598,0.000060025675,0.00016013146,0.0019608233,0.22921786,0.000015962016,0.0030658178,0.000049320708,0.76472163],"study_design_scores_gemma":[0.0013893946,0.00077902485,0.0007318092,0.0006089603,0.000039190272,0.0001573668,0.0000921675,0.99041396,0.00044678594,0.001433517,0.002951848,0.00095599424],"about_ca_topic_score_codex":0.000090751055,"about_ca_topic_score_gemma":0.0008723263,"teacher_disagreement_score":0.9763897,"about_ca_system_score_codex":0.00009874131,"about_ca_system_score_gemma":0.000063919004,"threshold_uncertainty_score":0.9998475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075895636,0.0023816866,0.9925058,0.0014353505,0.0016467889,0.00082121557,0.000010402463,0.00038343237,0.00005636681],"genre_scores_gemma":[0.7949047,0.0024694914,0.19839537,0.0019967295,0.00031013685,0.00061538257,0.000017840484,0.00009500535,0.0011953209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704736,0.00013327612,0.00054758624,0.0010390518,0.00024948618,0.0009832517],"domain_scores_gemma":[0.9962248,0.0013248124,0.00018462536,0.0016410808,0.00023863744,0.0003860514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024543068,0.00048311646,0.00046077263,0.00020549512,0.0004824018,0.000519853,0.0010698144,0.00038828334,0.00005019611],"category_scores_gemma":[0.000033077267,0.00046920826,0.00021400735,0.0010316265,0.00015184909,0.0007064406,0.00005376842,0.00043256528,0.000006762859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007056022,0.00013240057,0.000009220529,0.000013074384,0.00012015301,0.000003817067,0.00007697617,0.4749782,0.00012106141,0.001568065,0.0018887755,0.5210177],"study_design_scores_gemma":[0.0010232817,0.0002634458,0.00012657004,0.000037127993,0.00004947193,0.000018473951,0.00007494102,0.98336816,0.00010685582,0.0009393814,0.013452107,0.0005401784],"about_ca_topic_score_codex":0.000059362046,"about_ca_topic_score_gemma":0.00016394304,"teacher_disagreement_score":0.79414576,"about_ca_system_score_codex":0.00011833751,"about_ca_system_score_gemma":0.0000299914,"threshold_uncertainty_score":0.99977595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67609113,0.000053582313,0.3214548,0.00007476653,0.000016226164,0.0013280284,7.3588967e-7,0.00006572295,0.000914987],"genre_scores_gemma":[0.9964112,0.000004287905,0.003486236,0.000016097118,0.000012305768,0.000045351735,0.0000027246974,0.0000067399806,0.000015039622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983051,0.00069424737,0.00033794311,0.00028695306,0.0002240261,0.00015174533],"domain_scores_gemma":[0.99807334,0.00033973157,0.00032496394,0.0010611725,0.00016173751,0.00003904769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011902598,0.00012447122,0.0002643437,0.000109406894,0.000069131645,0.00005930363,0.0003289696,0.000054785472,1.14016686e-7],"category_scores_gemma":[0.000031092473,0.00011296498,0.000013720904,0.0003842657,0.00002880224,0.0004990981,0.00011708227,0.00016753716,6.695517e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006939626,0.00069212704,0.009251773,0.000010880419,0.000033663568,0.00000462608,0.013912569,0.95528984,0.000751928,0.0051480564,0.000004855742,0.014830267],"study_design_scores_gemma":[0.00047292517,0.00022345826,0.06554267,0.00005210328,0.000006289492,0.00000916325,0.0006480381,0.9327199,0.000112768554,0.00009869142,0.0000042906736,0.00010971254],"about_ca_topic_score_codex":0.0003546558,"about_ca_topic_score_gemma":0.00022654116,"teacher_disagreement_score":0.32032007,"about_ca_system_score_codex":0.000096359254,"about_ca_system_score_gemma":0.00004935809,"threshold_uncertainty_score":0.46065784},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6473456,0.00013846373,0.34998238,0.0001272946,0.0008966564,0.0002133502,9.334037e-7,0.0001307509,0.0011645933],"genre_scores_gemma":[0.911062,0.000020235051,0.08860102,0.00007867437,0.00008013213,0.000009206078,0.0000019627357,0.000005825247,0.0001409151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833053,0.0000795852,0.00041370798,0.00054167205,0.0002571804,0.0003773028],"domain_scores_gemma":[0.99803025,0.00043692373,0.0001559621,0.0010982589,0.00012682841,0.00015176526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092530483,0.00014980038,0.00037918246,0.00009561851,0.00009596777,0.00010505467,0.00052394316,0.00010194313,0.00009834303],"category_scores_gemma":[0.0001278973,0.00012357999,0.00012984335,0.0013639726,0.00009425679,0.00025547386,0.0004864983,0.0002681238,0.0000047940957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007178706,0.00066905154,0.295444,0.000078330195,0.0010814209,0.000018560228,0.002166315,0.23712632,0.006590104,0.12130058,0.0040560383,0.33139747],"study_design_scores_gemma":[0.00019861927,0.000038625767,0.04688337,0.000008434189,0.00010633551,0.0000013921583,0.000010026258,0.95060897,0.00017030156,0.00033040365,0.0014987508,0.00014475468],"about_ca_topic_score_codex":0.0000811644,"about_ca_topic_score_gemma":0.00042571075,"teacher_disagreement_score":0.7134827,"about_ca_system_score_codex":0.000019406856,"about_ca_system_score_gemma":0.000034833683,"threshold_uncertainty_score":0.5039446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114980556,0.0003640114,0.8699473,0.00024565987,0.00018071002,0.00016720299,4.2097923e-8,0.00024808044,0.013866435],"genre_scores_gemma":[0.983345,0.00013039327,0.015225234,0.0005690213,0.00010670084,0.000019575104,6.612065e-7,0.000014321044,0.00058913336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834555,0.00005354884,0.00024489753,0.00047034296,0.00029635962,0.0005892919],"domain_scores_gemma":[0.9990723,0.000110676796,0.00007565967,0.00058202486,0.000056080986,0.00010327032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043646718,0.00016609544,0.00020026344,0.00005042521,0.00007529347,0.00015780813,0.0007022408,0.00008080501,0.000031532127],"category_scores_gemma":[0.000007786946,0.00013479493,0.00002920656,0.0008883384,0.000027035712,0.00045815844,0.00023934405,0.0002819637,0.000026709047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000476791,0.00011065489,0.10939394,0.000008517234,0.000021935764,0.00065045233,0.00083303644,0.12350913,0.000059880153,0.027108159,0.0011571845,0.7370994],"study_design_scores_gemma":[0.0005037441,0.000065768625,0.0089561995,0.00009295055,0.0000018127042,0.00007140234,0.00003896637,0.9883947,0.000027768714,0.00010830959,0.0015013753,0.00023703603],"about_ca_topic_score_codex":0.00007775106,"about_ca_topic_score_gemma":0.0016042895,"teacher_disagreement_score":0.8683644,"about_ca_system_score_codex":0.00014282139,"about_ca_system_score_gemma":0.00008283396,"threshold_uncertainty_score":0.5496777},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025675658,0.00033934598,0.9698043,0.00013204986,0.00043631726,0.00019272423,3.9414147e-7,0.00008347588,0.0033357504],"genre_scores_gemma":[0.7833564,0.000018378114,0.21577996,0.00043315813,0.00007628017,0.000017070002,0.0000011205057,0.000007955242,0.00030964043],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988854,0.00005446347,0.00018653533,0.00025504737,0.0001804339,0.0004381127],"domain_scores_gemma":[0.99930185,0.00004492516,0.00004119075,0.00048226825,0.000005194887,0.00012458937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024712353,0.00013522974,0.00012487815,0.000056500994,0.000034613,0.000045623627,0.00048303616,0.00009330489,0.00026117166],"category_scores_gemma":[0.00000454117,0.00011195759,0.00004060345,0.00014100679,0.000019872856,0.00047486645,0.00029933377,0.0002172453,0.00020522073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001670566,0.0007982973,0.542126,0.000055349363,0.00009791525,0.000057741257,0.01297498,0.075703524,0.0033799277,0.16696686,0.00914343,0.1886793],"study_design_scores_gemma":[0.0009845572,0.000051330007,0.101288304,0.000026128027,0.00000840806,0.000031600986,0.000094736046,0.8154194,0.0037526174,0.0016141566,0.07604764,0.00068117445],"about_ca_topic_score_codex":0.000012974058,"about_ca_topic_score_gemma":0.000012068203,"teacher_disagreement_score":0.7576808,"about_ca_system_score_codex":0.0000662081,"about_ca_system_score_gemma":0.0000086357895,"threshold_uncertainty_score":0.45654982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27877262,0.000106924,0.7167775,0.00040569858,0.0005123721,0.0032795458,0.0000039074494,0.000037146652,0.00010428076],"genre_scores_gemma":[0.9500535,0.000037193055,0.04846473,0.0005467946,0.00063805573,0.00020730252,0.0000030241617,0.000022976856,0.000026432384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972749,0.00011431107,0.00115406,0.00032833108,0.00076996174,0.00035847872],"domain_scores_gemma":[0.9957667,0.0005161831,0.0016860714,0.0002455486,0.0016321247,0.00015337791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012081927,0.00022892926,0.0004899634,0.00013871829,0.00018837542,0.00012788286,0.0012583871,0.000070769696,0.000005165085],"category_scores_gemma":[0.000048312606,0.00019342828,0.0001467705,0.00018465624,0.00008511277,0.000506126,0.00038119548,0.00035483562,6.564412e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038989375,0.0010425344,0.016646322,0.00045709955,0.0013536362,0.0009992019,0.0064769858,0.16950461,0.0014894217,0.010243133,0.0023715943,0.7855165],"study_design_scores_gemma":[0.006044975,0.0017805151,0.012000336,0.0009248379,0.00003220593,0.0034774137,0.00015654929,0.9689727,0.0016614252,0.00060901075,0.0037729254,0.00056713587],"about_ca_topic_score_codex":0.0000106429,"about_ca_topic_score_gemma":0.00001547597,"teacher_disagreement_score":0.79946804,"about_ca_system_score_codex":0.00008571726,"about_ca_system_score_gemma":0.00028477135,"threshold_uncertainty_score":0.78877765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0118184835,0.00027665106,0.95643824,0.00027383087,0.000121222816,0.001901827,0.00000522028,0.000108360415,0.029056164],"genre_scores_gemma":[0.9914454,0.00006985527,0.0064734155,0.0003236445,0.00021209879,0.0007971556,0.00008940845,0.000008918458,0.0005800763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736243,0.00014334075,0.0005929544,0.00021941855,0.0012201645,0.00046170963],"domain_scores_gemma":[0.9974882,0.00023434477,0.00012547863,0.00043820488,0.0014996858,0.00021409833],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019617775,0.00015619739,0.00020268794,0.00027359187,0.0005401663,0.0034022452,0.0005538563,0.00012751101,0.000018887456],"category_scores_gemma":[0.000048764552,0.000114133065,0.00002496554,0.0007711035,0.00009388293,0.006613181,0.0002733505,0.0004219356,0.0001708296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024774254,0.000029257666,0.0015021675,0.00023816297,0.00005226304,0.000001790782,0.0023056418,0.21073529,0.000010639027,0.7273149,0.015787018,0.041998107],"study_design_scores_gemma":[0.00037705206,0.00008005691,0.0010615162,0.000093702365,0.0000010926551,0.000057297733,0.0006231465,0.9786203,0.000004111134,0.000034640463,0.018889528,0.00015759212],"about_ca_topic_score_codex":0.00044147475,"about_ca_topic_score_gemma":0.0000034071127,"teacher_disagreement_score":0.97962695,"about_ca_system_score_codex":0.000086454136,"about_ca_system_score_gemma":0.00020230532,"threshold_uncertainty_score":0.9976323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029075504,0.00008112359,0.9943122,0.000049295355,0.00017345705,0.0007408202,8.313684e-7,0.00014957562,0.001585141],"genre_scores_gemma":[0.85964304,0.000023963137,0.13797173,0.00057481864,0.00003381699,0.00034817788,0.000004411351,0.000016780961,0.0013832665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986087,0.00010682217,0.00029469893,0.00048946653,0.00011068726,0.00038962043],"domain_scores_gemma":[0.99900234,0.00015858863,0.00007477133,0.00051940506,0.0001526838,0.000092213355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006118214,0.00017502432,0.0002049062,0.0000750627,0.000059966882,0.00006244055,0.00070541067,0.00012569551,0.000021607591],"category_scores_gemma":[0.00002368617,0.00015501646,0.000053642194,0.0003206317,0.000051351773,0.00052647246,0.00016126958,0.00015826464,0.000012048139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006969202,0.0002502914,0.0001990523,0.0000082288725,0.000019075727,0.0000036445833,0.005118243,0.43320948,0.000054785058,0.47820795,0.0005952757,0.082264274],"study_design_scores_gemma":[0.0008036632,0.00006309701,0.00031730335,0.000020905683,0.0000037507125,0.0000017120024,0.00004053792,0.9939951,0.00031902432,0.0041968008,0.000029541541,0.00020858979],"about_ca_topic_score_codex":0.000040122468,"about_ca_topic_score_gemma":0.0004752136,"teacher_disagreement_score":0.85673547,"about_ca_system_score_codex":0.00005871713,"about_ca_system_score_gemma":0.000080803824,"threshold_uncertainty_score":0.6321387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004658361,0.00006184929,0.99090177,0.000925683,0.00040183976,0.00021255792,0.0000041905078,0.00015433646,0.0026794393],"genre_scores_gemma":[0.9672194,0.000001954385,0.03082606,0.00093069975,0.00027337213,0.000076607954,0.000030987787,0.0000047443787,0.0006361583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938774,0.000012624473,0.00008825023,0.00013077844,0.00008582695,0.00029478272],"domain_scores_gemma":[0.9994726,0.000052160365,0.000026964679,0.00031144355,0.00004607969,0.000090727546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017799991,0.00006162778,0.00005985708,0.000008485078,0.00005748327,0.000047402576,0.0003513418,0.000039404345,0.000039251303],"category_scores_gemma":[0.000007445252,0.000052988973,0.000026638181,0.00017068477,0.0000049108435,0.0004426086,0.00010766467,0.000035645335,0.0001319942],"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.0000063748093,0.00009951186,0.0018898209,0.000024742285,0.000011080387,5.2030833e-7,0.00022369475,0.00014078732,0.000104318075,0.8784731,0.057040915,0.061985146],"study_design_scores_gemma":[0.00045924087,0.00005236268,0.015601808,0.0000083672285,0.000008122561,0.000020497504,0.000015897524,0.5668157,0.0015352678,0.0029840954,0.41224182,0.00025684803],"about_ca_topic_score_codex":0.000015170737,"about_ca_topic_score_gemma":0.000011220045,"teacher_disagreement_score":0.9625611,"about_ca_system_score_codex":0.000026949092,"about_ca_system_score_gemma":0.000010232963,"threshold_uncertainty_score":0.21608277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978744,0.0013564401,0.018680142,0.0003441638,0.0001390883,0.00060834823,0.000001237887,0.00001510723,0.00011150956],"genre_scores_gemma":[0.9944547,0.0051385234,0.00022833132,0.00004083728,0.00008377268,0.000034774654,0.0000013548672,0.000015187556,0.0000025244012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975318,0.00093848945,0.0007152699,0.00023683088,0.00029801976,0.0002795889],"domain_scores_gemma":[0.9927151,0.004593268,0.00066000177,0.001776615,0.0001722844,0.000082704115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031771408,0.00021198082,0.00038601217,0.00010305299,0.0006461153,0.00016961277,0.0015840455,0.000087978595,0.0000018169948],"category_scores_gemma":[0.0000358407,0.00012346273,0.000095942254,0.00058256346,0.00031559743,0.00030324073,0.00046162607,0.0013990917,1.4449303e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018769778,0.0003534657,0.015399264,0.0000050372155,0.000058804788,0.0000012928917,0.0015281253,0.83851385,0.00003835522,0.0031624092,0.000007902313,0.14074378],"study_design_scores_gemma":[0.0008841969,0.00043743328,0.04250406,0.00019629467,0.00001668068,0.000013994213,0.00008501002,0.9551176,0.0000032046041,0.0006053404,0.00002254807,0.00011366667],"about_ca_topic_score_codex":0.000048705802,"about_ca_topic_score_gemma":0.00020208886,"teacher_disagreement_score":0.14063011,"about_ca_system_score_codex":0.000043216467,"about_ca_system_score_gemma":0.000060205784,"threshold_uncertainty_score":0.6078435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13520291,0.001158999,0.8468973,0.0014180487,0.00071050914,0.0011650897,2.3527289e-7,0.00035994704,0.013086931],"genre_scores_gemma":[0.89875937,0.00019590864,0.091093406,0.002768244,0.00013892267,0.0007890318,0.0000012808711,0.00001996467,0.006233897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984944,0.00008135067,0.0002749178,0.0004539149,0.00018258502,0.0005128487],"domain_scores_gemma":[0.9986799,0.00020681172,0.000036543825,0.00080350443,0.000049592083,0.0002236657],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032455192,0.0001369365,0.00016459289,0.00039663998,0.000078300865,0.00022211148,0.0010385946,0.00008944125,0.00061561994],"category_scores_gemma":[0.000032753018,0.00012090576,0.000039727307,0.0021803274,0.000017360488,0.0005561911,0.000830728,0.0002240111,0.00089855446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000661806,0.00006380694,0.0008536511,0.0000022225652,0.000005054623,0.000020239757,0.00073138665,0.05772267,0.0003736745,0.033728156,0.040094815,0.8663977],"study_design_scores_gemma":[0.0003424777,0.0002308414,0.0074474686,0.00006591009,0.0000015295823,0.0000113040805,0.00011029809,0.8217115,0.00013945464,0.0024644341,0.16704349,0.00043133207],"about_ca_topic_score_codex":0.000021740383,"about_ca_topic_score_gemma":0.0001258884,"teacher_disagreement_score":0.8659664,"about_ca_system_score_codex":0.000079173966,"about_ca_system_score_gemma":0.000029855802,"threshold_uncertainty_score":0.99987936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32521775,0.000057276393,0.670995,0.00045777464,0.00033812606,0.00020213629,0.0000014701003,0.000073931726,0.0026565643],"genre_scores_gemma":[0.98916686,0.0000049833443,0.010478685,0.00025797405,0.00004117093,0.0000052019072,7.3345694e-7,0.000006920574,0.000037495305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986608,0.00006509304,0.00025733688,0.0003017192,0.00042030384,0.0002947279],"domain_scores_gemma":[0.9980404,0.00078471506,0.000105105624,0.0009217813,0.000087422006,0.00006060496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012088382,0.000109819906,0.00013640028,0.000030145502,0.00009227158,0.00002611165,0.00081683183,0.000058388378,0.000043866687],"category_scores_gemma":[0.000097395096,0.00007431406,0.00006380565,0.000336909,0.000072909716,0.000094554525,0.00026010585,0.00019963484,0.000031186955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003542154,0.00035339603,0.00072391867,0.000023866882,0.000031013355,0.000028376744,0.0014419201,0.00009480352,0.013120794,0.097899266,0.0010238249,0.8852234],"study_design_scores_gemma":[0.00052710826,0.00029765346,0.03114075,0.000086382664,0.000009400574,0.000015129397,0.00009953216,0.9199953,0.024508303,0.021667482,0.0013066399,0.00034630112],"about_ca_topic_score_codex":0.000047083853,"about_ca_topic_score_gemma":0.000044306373,"teacher_disagreement_score":0.91990054,"about_ca_system_score_codex":0.0001328566,"about_ca_system_score_gemma":0.000053276563,"threshold_uncertainty_score":0.30304396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122701876,0.0014666347,0.8376616,0.0017032239,0.008714865,0.0018315184,0.0000022348468,0.0013570928,0.02456096],"genre_scores_gemma":[0.9876826,0.00014377617,0.0064171935,0.0015822394,0.0031441126,0.00011824321,0.000015724114,0.000063766616,0.00083236507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959939,0.00044189912,0.0008408192,0.00096834375,0.000557149,0.0011978628],"domain_scores_gemma":[0.99744636,0.00026044316,0.0003120221,0.001607918,0.00010582322,0.00026742698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097156275,0.00041230753,0.0005566133,0.00013851494,0.00030765007,0.00012585439,0.0015707192,0.00034944844,0.00003233824],"category_scores_gemma":[0.000021472752,0.00043668496,0.00015644488,0.0016631467,0.00015272452,0.0005450752,0.00030772274,0.0006829531,0.00021887831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071333816,0.00020560621,0.0021461337,0.000013862535,0.00005976142,0.00047423638,0.0012027919,0.6806394,0.00029497224,0.009219877,0.2958969,0.00977513],"study_design_scores_gemma":[0.0010580152,0.00019982153,0.008429822,0.00024554448,0.000010078863,0.00021406212,0.000009882692,0.9792906,0.000108485874,0.0026447552,0.0069546085,0.0008343188],"about_ca_topic_score_codex":0.000061722,"about_ca_topic_score_gemma":0.00008556704,"teacher_disagreement_score":0.8649807,"about_ca_system_score_codex":0.00023912587,"about_ca_system_score_gemma":0.00014274273,"threshold_uncertainty_score":0.9998085},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73835826,0.00024907044,0.25715566,0.0001465706,0.0001240202,0.00010028074,1.3427106e-7,0.000061024908,0.0038049656],"genre_scores_gemma":[0.950833,0.0000052417568,0.04892368,0.0001349544,0.00007494242,0.000008969423,6.490302e-7,0.0000036176853,0.000014911433],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990992,0.0000740401,0.00016962342,0.00020119193,0.0001404859,0.00031544318],"domain_scores_gemma":[0.999472,0.00014372305,0.000029632856,0.00022981697,0.000022960738,0.00010184163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058137125,0.000090634865,0.00009709994,0.0000442411,0.000073273004,0.0005144314,0.00019606543,0.000049219347,0.000039015315],"category_scores_gemma":[0.000027891369,0.00007749518,0.000012652705,0.00016986924,0.000033051503,0.0033950286,0.00016429745,0.000119450626,0.0000069780494],"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.0000069817293,0.00025388657,0.4864918,0.00007600095,0.000018557004,0.000018157225,0.0051335148,0.003291031,0.00690327,0.28104383,0.00026015207,0.21650283],"study_design_scores_gemma":[0.00034534087,0.00004587462,0.7527783,0.0000342105,0.0000024491972,0.00005566595,0.00066035637,0.24043168,0.0016096242,0.0034110374,0.0003226107,0.00030283656],"about_ca_topic_score_codex":0.00010537294,"about_ca_topic_score_gemma":0.0001794642,"teacher_disagreement_score":0.27763277,"about_ca_system_score_codex":0.000050133964,"about_ca_system_score_gemma":0.00007449975,"threshold_uncertainty_score":0.49606737},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013366904,0.00009978304,0.9793797,0.000086408276,0.0005038829,0.0003939947,1.2702138e-7,0.00020227287,0.0059669185],"genre_scores_gemma":[0.9489353,0.000008292014,0.049998004,0.00050393183,0.00024168123,0.000028922123,9.587134e-7,0.000014392857,0.00026856977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980371,0.00003136247,0.0004172593,0.00046532796,0.0002734725,0.0007754636],"domain_scores_gemma":[0.9984484,0.00077424577,0.000105543055,0.00046454836,0.000094530296,0.00011277256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025123328,0.0001533366,0.00023133623,0.00018555256,0.000084405605,0.00012315004,0.0007693767,0.000118678654,0.000008115938],"category_scores_gemma":[0.000084747495,0.00014447543,0.0000760393,0.0018070439,0.000015896707,0.00032346096,0.00023925643,0.0002090188,0.0000076272827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025624628,0.000093875344,0.01735544,0.0000199491,0.000021823025,0.000057095178,0.00045460922,0.013993974,0.00013754133,0.4339449,0.0021416268,0.53175354],"study_design_scores_gemma":[0.0005060289,0.000041221338,0.0038326313,0.000031365187,0.0000026324094,0.000008098317,0.000029995106,0.9939689,0.00043592742,0.0005418487,0.00040124008,0.00020009637],"about_ca_topic_score_codex":0.00012899752,"about_ca_topic_score_gemma":0.0006657595,"teacher_disagreement_score":0.9799749,"about_ca_system_score_codex":0.00024062576,"about_ca_system_score_gemma":0.00007003181,"threshold_uncertainty_score":0.5891537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03824415,0.0015034492,0.9542816,0.0006633834,0.0034959654,0.00030324818,0.000001231715,0.00004355094,0.0014633756],"genre_scores_gemma":[0.9071377,0.0007735845,0.08491844,0.0030975607,0.0034704816,0.0000109387865,0.000007354046,0.00004638402,0.0005375893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965392,0.0001082273,0.0011695434,0.0004883242,0.0010195124,0.00067520095],"domain_scores_gemma":[0.9974194,0.00041966935,0.0005999148,0.00049944175,0.0006090972,0.00045244663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001459409,0.000310406,0.0004566723,0.00048335613,0.00005145989,0.00049444387,0.0028945038,0.00022610772,0.000021817059],"category_scores_gemma":[0.00003176446,0.00029217068,0.00020137368,0.0011695236,0.0000276356,0.0012733153,0.0005173215,0.0009278643,0.00002157133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029425637,0.00018160585,0.00080643874,0.0000034317382,0.000102496335,0.0003647649,0.0004561657,0.7763782,0.000060036342,0.0019217982,0.0041481666,0.21528265],"study_design_scores_gemma":[0.0024761364,0.0002805863,0.008276729,0.00045919622,0.00002431605,0.0013742717,0.00026435935,0.9574186,0.00010824,0.00044468272,0.028172767,0.00070007954],"about_ca_topic_score_codex":0.00003524564,"about_ca_topic_score_gemma":0.00017072349,"teacher_disagreement_score":0.8693632,"about_ca_system_score_codex":0.0003634818,"about_ca_system_score_gemma":0.00015187396,"threshold_uncertainty_score":0.99995303},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030688561,0.0005039956,0.9435521,0.000051287763,0.000073562,0.01960507,4.6641685e-7,0.00033153256,0.0051934407],"genre_scores_gemma":[0.88743496,0.000018876994,0.074241325,0.00022168114,0.00017571104,0.037601687,0.0000036729484,0.000028551229,0.0002735144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754983,0.000127563,0.00056187,0.0007996541,0.00028200203,0.0006790891],"domain_scores_gemma":[0.9986895,0.0002445796,0.0002126992,0.00072372606,0.00005571187,0.00007379761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062110915,0.00027186426,0.00040803445,0.00021532208,0.00020127205,0.0004207703,0.00057553814,0.00015927492,0.00005120287],"category_scores_gemma":[0.000012232917,0.0002510803,0.00011970563,0.0025265536,0.000054763055,0.0008775918,0.00051011005,0.00035960198,0.0000069070693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023568726,0.00013463204,0.041295297,0.000033963082,0.00009916101,0.0000741041,0.0007099476,0.4567648,0.00007064264,0.0012735293,0.00050498504,0.4990154],"study_design_scores_gemma":[0.00067456125,0.000085880405,0.009492558,0.00006468455,0.00003686872,0.0000176628,0.00007207102,0.9807268,0.00024351524,0.000770127,0.007397809,0.00041751197],"about_ca_topic_score_codex":0.00018904856,"about_ca_topic_score_gemma":0.0025574593,"teacher_disagreement_score":0.86931074,"about_ca_system_score_codex":0.000093641705,"about_ca_system_score_gemma":0.000027042428,"threshold_uncertainty_score":0.99999416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6904161,0.00008635565,0.30247438,0.00013975424,0.00048120215,0.00017822286,2.8623816e-7,0.000075263604,0.0061484026],"genre_scores_gemma":[0.99433964,0.000043065567,0.0051422575,0.00023314141,0.000052099804,0.0000072322937,4.6681657e-7,0.000008963205,0.00017314011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988032,0.00003977683,0.0002559585,0.00036824364,0.00021927612,0.00031356758],"domain_scores_gemma":[0.999033,0.0001994771,0.00009059266,0.0005507726,0.000043368807,0.00008281281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047517658,0.00013211423,0.00019489566,0.00005729553,0.000041071467,0.00006643949,0.00052895304,0.0001229889,0.0000349885],"category_scores_gemma":[0.000021652335,0.00011763642,0.000030636194,0.00030063782,0.000055532713,0.00021337514,0.00032004318,0.00042702112,0.000007809441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032176744,0.0001438452,0.009098979,0.00001759966,0.00001271185,0.00006063059,0.0006624355,0.006850923,0.0011718308,0.21986416,0.00057952263,0.7615052],"study_design_scores_gemma":[0.0005372286,0.000104980536,0.010291809,0.000047979378,0.000001496968,0.000012413279,0.00000877033,0.9849017,0.00037110163,0.003339137,0.00019950363,0.0001838372],"about_ca_topic_score_codex":0.000058242666,"about_ca_topic_score_gemma":0.00084834296,"teacher_disagreement_score":0.9780508,"about_ca_system_score_codex":0.00002136997,"about_ca_system_score_gemma":0.00003551923,"threshold_uncertainty_score":0.4797074},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046400802,0.00062009675,0.98698443,0.0009520709,0.000018406845,0.0100136725,0.0000035575024,0.0001327796,0.00081098324],"genre_scores_gemma":[0.8345359,0.0004116801,0.11704979,0.0001244095,0.00026474823,0.04755056,0.00001078099,0.000015847629,0.00003628671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988672,0.00007504308,0.00028350507,0.00042169096,0.00009822589,0.00025432179],"domain_scores_gemma":[0.9987539,0.000698368,0.00008566311,0.00034277732,0.000044484095,0.000074797776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030590827,0.00013516482,0.00017195815,0.00004772791,0.00018638857,0.00023830014,0.0001713167,0.00008534393,0.0000034537625],"category_scores_gemma":[0.000017770788,0.00013360582,0.0000165078,0.00016358243,0.0000808529,0.00032146723,0.00012029419,0.00014352068,0.000004148014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019814695,0.00011478982,0.00069091056,0.000014969596,0.0000056693116,0.0000040368327,0.00033487647,0.00235937,0.00020751616,0.54998666,0.00032294786,0.44595626],"study_design_scores_gemma":[0.0005292796,0.000023933815,0.016386617,0.000048463844,0.000004362149,0.000014841361,0.000036974212,0.96650183,0.00014582856,0.014584747,0.0015007171,0.00022237975],"about_ca_topic_score_codex":0.00002777774,"about_ca_topic_score_gemma":0.0001183558,"teacher_disagreement_score":0.9641425,"about_ca_system_score_codex":0.000017813527,"about_ca_system_score_gemma":0.000034053064,"threshold_uncertainty_score":0.5448287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094873846,0.00027706294,0.9039483,0.00019358774,0.00019061263,0.00040375383,0.0000069170574,0.000088268185,0.000017639157],"genre_scores_gemma":[0.8550008,0.000026958605,0.14461307,0.00024876723,0.000037106525,0.000050905855,0.000016914428,0.0000050111225,4.829926e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804753,0.000045724533,0.00036210835,0.0006163954,0.00039940546,0.00052883336],"domain_scores_gemma":[0.99824756,0.00019158413,0.00013994162,0.0006702001,0.00054686744,0.00020386757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011931099,0.00016314109,0.00030239293,0.00024129877,0.00028594615,0.00026044497,0.0012231885,0.00007540508,0.000003820883],"category_scores_gemma":[0.00003221034,0.00014418398,0.000079235295,0.0047688033,0.0009197202,0.0010980797,0.0006335908,0.00011328194,0.000001633327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021122356,0.00006748572,0.00004502508,0.00001425049,0.00003025943,7.028461e-7,0.00035216642,0.2813957,0.00010519684,0.6627537,0.0000036322895,0.055210773],"study_design_scores_gemma":[0.00038646726,0.00038104723,0.0033380864,0.00002925904,0.000085165615,0.0000066963407,0.000008949628,0.9671926,0.00033208056,0.028041504,0.000036820573,0.00016133611],"about_ca_topic_score_codex":0.0000035099677,"about_ca_topic_score_gemma":0.000010647972,"teacher_disagreement_score":0.76012695,"about_ca_system_score_codex":0.00008924553,"about_ca_system_score_gemma":0.000102182086,"threshold_uncertainty_score":0.58796525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103913195,0.00035059362,0.89360297,0.00010029588,0.0006577318,0.00018742912,0.000004814622,0.000355981,0.0008269847],"genre_scores_gemma":[0.9701331,0.0000024391147,0.029081186,0.00008153415,0.0005731522,0.0000102021595,0.00008130982,0.000019563324,0.000017508099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715495,0.00018969149,0.0006933087,0.00072322396,0.00021140593,0.0010273925],"domain_scores_gemma":[0.9983964,0.0005409358,0.00024249859,0.00063713704,0.00007370741,0.00010932849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005045452,0.00029107716,0.0003941824,0.00012261701,0.00024040048,0.0002538971,0.0011849557,0.00018316931,0.000012688703],"category_scores_gemma":[0.00006626553,0.00032562512,0.0000968609,0.0010336819,0.000092216535,0.00019579919,0.0004991091,0.00049953506,0.0000179728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053596345,0.0000713549,0.008630696,0.000007831039,0.000007190398,0.00027007292,0.00005287826,0.9397498,0.000034680386,0.014679495,0.00088618137,0.035604462],"study_design_scores_gemma":[0.0005027802,0.000056359666,0.018729532,0.00006218703,0.0000055045625,0.00013423724,0.0000140824695,0.9787828,0.000044769935,0.00040187,0.00094134966,0.000324527],"about_ca_topic_score_codex":0.00014946076,"about_ca_topic_score_gemma":0.000032069613,"teacher_disagreement_score":0.86621994,"about_ca_system_score_codex":0.00017859142,"about_ca_system_score_gemma":0.00006764897,"threshold_uncertainty_score":0.9999196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029629156,0.0026850281,0.96586454,0.00023154792,0.0009390265,0.00035854228,0.0000011787926,0.0000897035,0.00020129362],"genre_scores_gemma":[0.69912744,0.00006556872,0.2995648,0.0002394453,0.0009573347,0.0000037235804,0.0000011311381,0.00003519684,0.0000053399085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687237,0.0004559225,0.0011336325,0.00032651084,0.0004667582,0.0007448069],"domain_scores_gemma":[0.99502885,0.0026730613,0.0009706972,0.0005322959,0.0005841108,0.0002109603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041993293,0.00032714749,0.00053440937,0.00018053588,0.00057980826,0.00013178706,0.001859704,0.00014301372,0.000009656246],"category_scores_gemma":[0.00024195529,0.00023810928,0.00034406077,0.0007230357,0.0001246378,0.00093961036,0.00031754092,0.00095493696,0.0000033115994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010367117,0.00008925369,0.001437545,0.000042823292,0.00017050636,0.00006079204,0.00796574,0.049244177,0.0002522485,0.0017011536,0.00015036055,0.93878174],"study_design_scores_gemma":[0.0010658895,0.0003034563,0.0010944935,0.00064722105,0.00007988575,0.00020694708,0.00036147633,0.99432355,0.0002879951,0.0012786111,0.000067857305,0.00028261132],"about_ca_topic_score_codex":0.000012066876,"about_ca_topic_score_gemma":0.0000017405644,"teacher_disagreement_score":0.9450794,"about_ca_system_score_codex":0.00008704177,"about_ca_system_score_gemma":0.00012897329,"threshold_uncertainty_score":0.9709814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009617302,0.00063991616,0.983542,0.000039242037,0.004919622,0.00049505074,0.000003412426,0.00071695284,0.000026502803],"genre_scores_gemma":[0.757794,0.00007554789,0.23925169,0.00012115125,0.0026368748,0.00002604888,0.00002382886,0.00006269083,0.0000081342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957957,0.00040671183,0.0009670945,0.001107365,0.00048229843,0.0012407883],"domain_scores_gemma":[0.9963385,0.00059219776,0.00057745504,0.0017661559,0.0003375441,0.00038813558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083556765,0.00059952226,0.0008557519,0.00014987009,0.0003266827,0.0003128332,0.00226318,0.0004382768,0.0000046120203],"category_scores_gemma":[0.000014677268,0.00061778777,0.00029001563,0.001149977,0.000116910334,0.000587649,0.0014931016,0.00069809414,0.000006914539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119484375,0.00017057022,0.0027286455,0.0000348514,0.00010463898,0.000012433404,0.00016586886,0.9550075,0.000012306064,0.0014869181,0.00053276995,0.039731577],"study_design_scores_gemma":[0.0010592378,0.00012268095,0.003638632,0.00023278383,0.000038855836,0.000029154326,0.0000053261406,0.9931032,0.000087929664,0.00018203308,0.0008867645,0.00061338674],"about_ca_topic_score_codex":0.000040136852,"about_ca_topic_score_gemma":0.000005431594,"teacher_disagreement_score":0.74817675,"about_ca_system_score_codex":0.00015041337,"about_ca_system_score_gemma":0.00006132947,"threshold_uncertainty_score":0.99962735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022710343,0.025334101,0.96776175,0.00047681827,0.00019113017,0.003465389,0.000017859284,0.00031566413,0.0001662618],"genre_scores_gemma":[0.90559185,0.01097572,0.03026178,0.004604455,0.0033947392,0.043965664,0.0003045931,0.00010550009,0.00079568103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977246,0.000054532822,0.00046647817,0.000884255,0.00018221502,0.00068790704],"domain_scores_gemma":[0.997935,0.000388261,0.00020772615,0.0010292572,0.00021952947,0.00022025428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019761977,0.00033267558,0.00034675503,0.00006350448,0.00062476157,0.00040757144,0.00078951864,0.00022691832,0.00001022997],"category_scores_gemma":[0.0000018602275,0.00033323545,0.00013059938,0.0007514931,0.00009749908,0.00080289564,0.00041557624,0.00029753966,0.00002051319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010770438,0.000101020385,0.000018130388,0.000016423519,0.000020878348,2.8118174e-7,0.00003421478,0.5843014,0.000039467828,0.0055284775,0.0036475298,0.4062814],"study_design_scores_gemma":[0.00032698043,0.00008130464,0.00016334774,0.00001591982,0.000016744356,0.000009030253,0.000023768558,0.5543668,0.0000069321986,0.00027369888,0.44449365,0.000221826],"about_ca_topic_score_codex":0.000006317343,"about_ca_topic_score_gemma":0.00010157287,"teacher_disagreement_score":0.93749994,"about_ca_system_score_codex":0.00008052173,"about_ca_system_score_gemma":0.000044293716,"threshold_uncertainty_score":0.99991196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011233766,0.00012415522,0.9565102,0.0017395609,0.00049382827,0.0004236784,1.01300415e-7,0.00028791284,0.029186785],"genre_scores_gemma":[0.96882236,0.000074849355,0.027442437,0.0027115955,0.00015854015,0.000113457165,0.000001435771,0.000015054404,0.00066024205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982502,0.0000995077,0.00033384902,0.00049634103,0.0002429403,0.0005771588],"domain_scores_gemma":[0.99878395,0.00018779177,0.000057432262,0.0007806332,0.00005843407,0.00013176161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026605936,0.00018148129,0.00021867765,0.00006119541,0.00005376814,0.00022620085,0.0012071753,0.00014186493,0.00022845979],"category_scores_gemma":[0.000008581099,0.00015502499,0.00006149103,0.00064115925,0.00004671692,0.0011191482,0.00031132388,0.00028501195,0.00030444868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027920496,0.0001414474,0.0016134824,0.000004717214,0.000019163364,0.00006292532,0.000461821,0.007481232,0.00003902824,0.68572414,0.047850642,0.2565986],"study_design_scores_gemma":[0.00029545475,0.000040918272,0.0026717896,0.000016414358,0.0000016482458,0.000026239497,0.000025470712,0.9914067,0.000058697813,0.002890894,0.00233121,0.00023457367],"about_ca_topic_score_codex":0.00044211867,"about_ca_topic_score_gemma":0.000146022,"teacher_disagreement_score":0.98392546,"about_ca_system_score_codex":0.000056919143,"about_ca_system_score_gemma":0.00003437726,"threshold_uncertainty_score":0.63217354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005919978,0.00007837146,0.9964057,0.0005175158,0.00056487427,0.00069679355,7.0611685e-7,0.0002758577,0.0008681364],"genre_scores_gemma":[0.7252815,0.00002028952,0.27064773,0.0024398721,0.00021818961,0.000056019748,0.0000121586445,0.000009436323,0.0013148242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987436,0.000047215788,0.00023596484,0.0004520348,0.00014522528,0.0003759795],"domain_scores_gemma":[0.9990717,0.000055561875,0.000072638926,0.00047658916,0.0002235953,0.000099902776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023605126,0.00015985304,0.00016018035,0.000042110943,0.00017728964,0.00019918685,0.0005960049,0.00011903539,0.000023403569],"category_scores_gemma":[0.000020581952,0.00014488638,0.00007351897,0.000274032,0.000013782439,0.0004885054,0.00009179651,0.00012006513,0.000030377922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000684845,0.00009596344,0.0000046564446,0.0000018508501,0.000009303547,0.0000046862256,0.00013370258,0.009882526,0.0020528454,0.94829947,0.0028470168,0.036661103],"study_design_scores_gemma":[0.0005546042,0.00016939008,0.00003135534,0.000008614027,0.000005196209,0.0000015208925,0.000007785675,0.9831446,0.009508748,0.0053975875,0.0009800704,0.0001905289],"about_ca_topic_score_codex":0.000007835503,"about_ca_topic_score_gemma":0.000020692423,"teacher_disagreement_score":0.9732621,"about_ca_system_score_codex":0.000049064492,"about_ca_system_score_gemma":0.00003093831,"threshold_uncertainty_score":0.5908295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16691363,0.010540321,0.82177734,0.0000757839,0.0005798532,0.000065139066,1.9730254e-7,0.000025455327,0.000022272085],"genre_scores_gemma":[0.9812287,0.0004817054,0.017555779,0.000258466,0.00044791528,0.0000034525049,2.892695e-7,0.000012786645,0.000010901498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892056,0.000011050834,0.00028063756,0.0001704572,0.00013643081,0.00048085168],"domain_scores_gemma":[0.9989503,0.000056110144,0.00007576513,0.00017019805,0.00006879135,0.00067885336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013950167,0.00015146413,0.00021622024,0.00021811237,0.00008231857,0.00016871559,0.0005059001,0.00007894907,0.000005555781],"category_scores_gemma":[0.0000072641724,0.00014014589,0.00006896799,0.0004855462,0.000019028746,0.00036654904,0.00004099655,0.00043778602,0.000002123236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027246651,0.000009573567,0.00040712615,0.0000075913326,0.000026750515,0.00018608864,0.00010581575,0.76390827,0.000012889689,0.0028054665,0.00043483535,0.23209286],"study_design_scores_gemma":[0.00045612035,0.00051377196,0.00807322,0.00007716733,0.000006659887,0.00065107195,5.5680954e-7,0.96949005,0.0000426062,0.000109444794,0.02036682,0.00021249073],"about_ca_topic_score_codex":0.000024453493,"about_ca_topic_score_gemma":0.000061120896,"teacher_disagreement_score":0.8143151,"about_ca_system_score_codex":0.00015084168,"about_ca_system_score_gemma":0.00026461776,"threshold_uncertainty_score":0.57149833},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22704327,0.000009978486,0.77198714,0.000070237315,0.00035053532,0.00026961073,3.983992e-7,0.000097212054,0.00017163766],"genre_scores_gemma":[0.6169989,0.0000037150367,0.38259473,0.00016789706,0.00018466607,0.000030903975,0.0000024645642,0.00000853103,0.000008170943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987317,0.000034639426,0.00026471342,0.00044585994,0.00012666546,0.00039647816],"domain_scores_gemma":[0.9993003,0.000086961474,0.00006764735,0.00037769458,0.000038706105,0.00012866594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008310026,0.00013487978,0.00017185575,0.00005994932,0.000118905045,0.00024168889,0.00041916248,0.000110270346,0.000009872537],"category_scores_gemma":[0.000010493434,0.00012845575,0.000030208173,0.000188117,0.00003696846,0.0005690784,0.00025079073,0.00031653073,0.000001240302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027655547,0.00006855961,0.0032131122,0.0000049171085,0.000008053443,0.0000072499197,0.00022924694,0.0014904583,0.004153317,0.12616394,0.000040821753,0.8646175],"study_design_scores_gemma":[0.00046179385,0.000060286853,0.0014431329,0.000015694073,0.0000019245483,0.000012973383,0.000051143532,0.9958755,0.0012664791,0.00061858294,0.000020895937,0.00017158786],"about_ca_topic_score_codex":0.00010664666,"about_ca_topic_score_gemma":0.000408713,"teacher_disagreement_score":0.99438506,"about_ca_system_score_codex":0.000022125332,"about_ca_system_score_gemma":0.000027514245,"threshold_uncertainty_score":0.5238273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05050218,0.00014157631,0.9460879,0.0000344673,0.0005377739,0.0007151776,5.3832014e-7,0.00013419021,0.0018462236],"genre_scores_gemma":[0.9888489,0.000015448491,0.010080524,0.00014729607,0.0001701608,0.00018599523,0.0000056501563,0.000014340817,0.00053164246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986573,0.00017932567,0.00032142198,0.0003546111,0.00016875926,0.00031861223],"domain_scores_gemma":[0.9981755,0.0009940576,0.00016248444,0.0005393968,0.00006640025,0.00006213407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013692891,0.00014883286,0.00025287268,0.000043752152,0.00008108713,0.000088578774,0.0005027642,0.000084204585,0.000019429539],"category_scores_gemma":[0.000076769364,0.00011837125,0.000105492974,0.00019012738,0.000020977006,0.0002681762,0.00015502151,0.00011266922,0.000014098752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012942075,0.0000629671,0.00026608247,0.0000687468,0.000024120041,5.926341e-7,0.0001675624,0.09492714,0.0007379913,0.020310944,0.0030954278,0.880209],"study_design_scores_gemma":[0.0005372881,0.0028332544,0.000039314444,0.000060112616,0.000007211445,0.0000012817397,0.0000053907343,0.9793492,0.012882406,0.0001664452,0.003993748,0.00012432956],"about_ca_topic_score_codex":0.0000047956983,"about_ca_topic_score_gemma":0.000013848673,"teacher_disagreement_score":0.93834674,"about_ca_system_score_codex":0.00003696652,"about_ca_system_score_gemma":0.00001181812,"threshold_uncertainty_score":0.48270395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34515968,0.00046939088,0.65215945,0.00014826345,0.0017813885,0.000231389,2.2587659e-7,0.000024142102,0.00002605549],"genre_scores_gemma":[0.89412785,0.00019392547,0.10449206,0.0007450384,0.00039444456,0.000013787568,1.2875563e-7,0.00000714357,0.000025601092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703044,0.0001211896,0.00082575716,0.000555217,0.00090163155,0.00056576484],"domain_scores_gemma":[0.9976779,0.00016349946,0.00033607188,0.0007526608,0.00066522456,0.00040463224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363381,0.00019502439,0.00036822393,0.00041648504,0.00024917288,0.00029538927,0.0027907297,0.00007423567,0.000006645987],"category_scores_gemma":[0.000062768464,0.00016774792,0.00009864635,0.0024503807,0.00028516335,0.0023934937,0.00073444145,0.0004639808,0.000016888385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028953506,0.0002268081,0.0006599612,0.0000023258897,0.0000047854805,0.0001350668,0.0013723857,0.5998825,0.001255641,0.0008125667,0.0009503984,0.3946686],"study_design_scores_gemma":[0.00065092416,0.002144539,0.014469019,0.00005913915,0.000002222608,0.00049028953,0.000010774584,0.9773873,0.001033853,0.00014008844,0.0033377842,0.0002740312],"about_ca_topic_score_codex":0.0000022264935,"about_ca_topic_score_gemma":0.000009871475,"teacher_disagreement_score":0.5489682,"about_ca_system_score_codex":0.00027092313,"about_ca_system_score_gemma":0.000650064,"threshold_uncertainty_score":0.68405616},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005487141,0.00015535594,0.8795009,0.00013919464,0.00040962812,0.112065524,0.0000022426004,0.00074229296,0.0014977128],"genre_scores_gemma":[0.28724274,0.000019536945,0.040302504,0.0016129597,0.0005132201,0.66920936,0.0000130634835,0.00008216851,0.0010044742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615985,0.0001747977,0.0007071642,0.0012674679,0.0005098125,0.0011809136],"domain_scores_gemma":[0.9969397,0.0003228385,0.00031147915,0.0017130629,0.00026766997,0.00044524387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006462631,0.00048607084,0.00044831942,0.00013259592,0.00044055164,0.0006962396,0.0018031788,0.00026593413,0.00013873266],"category_scores_gemma":[0.000025397736,0.00039857725,0.00018723859,0.0005917261,0.00008622985,0.000651707,0.00043877872,0.00028685216,0.00007489422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007456206,0.0007381287,0.00005407439,0.000030241185,0.00003094601,0.000007884371,0.00041775402,0.40996355,0.00017230319,0.0099968165,0.009457311,0.56905645],"study_design_scores_gemma":[0.001582061,0.0017168331,0.00018564724,0.00009083335,0.0000057341103,0.0000068835775,0.000048588303,0.9438853,0.0008374362,0.00042682694,0.050681256,0.0005325749],"about_ca_topic_score_codex":0.000022288837,"about_ca_topic_score_gemma":0.000042586886,"teacher_disagreement_score":0.8391984,"about_ca_system_score_codex":0.00013937932,"about_ca_system_score_gemma":0.00011951744,"threshold_uncertainty_score":0.99984664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031640977,0.00029227708,0.9918237,0.00015023093,0.0028155579,0.0008939262,0.0000025708985,0.0006298127,0.00022784524],"genre_scores_gemma":[0.9679943,0.00055406586,0.029235339,0.00076907675,0.00084622,0.0001960994,0.00006821939,0.00010097177,0.00023571482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478227,0.00063107914,0.00093902095,0.0015306829,0.00055703346,0.0015599265],"domain_scores_gemma":[0.99680686,0.000434325,0.00047399005,0.0016342265,0.00021379224,0.0004368132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012022029,0.0007058836,0.00083942077,0.00026124198,0.00039304662,0.00039627572,0.0023223383,0.00073399435,0.00002719171],"category_scores_gemma":[0.00004213385,0.0007405404,0.00022581131,0.0015597038,0.00017161545,0.0009477143,0.0010532074,0.0011047056,0.000034038418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003430276,0.00029260785,0.0014542325,0.000019998606,0.000032141663,0.000044015946,0.00037053396,0.9644155,0.0000046705486,0.0045673335,0.001157993,0.027606685],"study_design_scores_gemma":[0.0030497871,0.00009023496,0.0019939998,0.00023902878,0.00001901429,0.000012204979,0.000046170702,0.99348813,0.000013502834,0.000039246304,0.00016865459,0.0008400009],"about_ca_topic_score_codex":0.000181794,"about_ca_topic_score_gemma":0.0003541679,"teacher_disagreement_score":0.9648302,"about_ca_system_score_codex":0.00022470485,"about_ca_system_score_gemma":0.0000661152,"threshold_uncertainty_score":0.99950457},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015800286,0.0000015882689,0.9559565,0.000097205135,0.00014340381,0.024569405,1.4429231e-7,0.0005647886,0.0170869],"genre_scores_gemma":[0.80559826,1.561605e-8,0.1508531,0.00077164866,0.0002527807,0.04235292,0.0000010020119,0.000010831873,0.00015945904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877447,0.00009437498,0.0001868411,0.00024666445,0.00021725865,0.00048040005],"domain_scores_gemma":[0.9988554,0.000053003514,0.000065766115,0.0007675295,0.0000411908,0.00021711546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864514,0.000116862626,0.00010102754,0.000041277024,0.000095302225,0.00012867089,0.0007719392,0.00006218032,0.0002558889],"category_scores_gemma":[0.000016332315,0.00009592767,0.00003736105,0.00030620032,0.000019158722,0.00091569294,0.00009568989,0.00011438279,0.00014846452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031703137,0.0010856736,0.088247545,0.000041763356,0.000019597112,0.000012404827,0.0010571781,0.0037590475,0.0035574017,0.5544375,0.0056680082,0.34208214],"study_design_scores_gemma":[0.00053169555,0.00011121316,0.0065448787,0.000010409975,0.0000018054934,0.0000042529773,0.000011532716,0.97074574,0.007231695,0.00023347113,0.01434309,0.0002301876],"about_ca_topic_score_codex":0.000022196904,"about_ca_topic_score_gemma":0.000003968594,"teacher_disagreement_score":0.9669867,"about_ca_system_score_codex":0.000033702938,"about_ca_system_score_gemma":0.000052254563,"threshold_uncertainty_score":0.3911817},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001022262,0.000005021616,0.9214539,0.00040677044,0.00024462203,0.07671781,0.0000013056842,0.00007040973,0.000077897035],"genre_scores_gemma":[0.7579209,6.401284e-8,0.0099587785,0.00096716837,0.0001192019,0.2308543,0.0000069080124,0.000017019316,0.00015560898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890167,0.0000370571,0.0002812013,0.0003787788,0.00016704951,0.0002342773],"domain_scores_gemma":[0.9982693,0.00030956505,0.00016450271,0.00062534946,0.0005526758,0.000078560115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003029044,0.00015195449,0.00020520594,0.000037188413,0.000083042556,0.00013686322,0.0005728307,0.000113846625,0.000011409065],"category_scores_gemma":[0.000038458013,0.0001234845,0.00003633313,0.00045673182,0.0000630171,0.00048201403,0.00012554793,0.00015200456,9.273682e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056115753,0.0013730521,0.016909102,0.0030925062,0.00013547955,0.000010330883,0.0006756431,0.5049958,0.0012454549,0.1511085,0.0149460165,0.30494693],"study_design_scores_gemma":[0.0010990871,0.00010906646,0.0005795381,0.00008830762,0.00000522626,0.0000030417355,0.000014416223,0.9899039,0.00460185,0.00032351306,0.00310812,0.00016389333],"about_ca_topic_score_codex":0.00007705664,"about_ca_topic_score_gemma":0.00084144773,"teacher_disagreement_score":0.91149515,"about_ca_system_score_codex":0.000010669538,"about_ca_system_score_gemma":0.00020997899,"threshold_uncertainty_score":0.5035552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6055109,0.021577612,0.36842528,0.0009742239,0.00069727085,0.0004160412,0.000001185603,0.00030508597,0.0020924227],"genre_scores_gemma":[0.9593735,0.013932523,0.025442813,0.00033764128,0.0006475929,0.00003917482,0.0000121516405,0.000058976115,0.00015564609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970783,0.0003566401,0.0007569441,0.00051127985,0.0005134555,0.000783373],"domain_scores_gemma":[0.9962314,0.0004900633,0.00079672935,0.002008695,0.00022694323,0.0002461799],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009443476,0.0004260081,0.00046524452,0.00018701405,0.0017991291,0.0009504371,0.002275605,0.00017416567,0.00000630902],"category_scores_gemma":[0.0000039160095,0.00036357087,0.00010889136,0.0010007824,0.00025487543,0.00089391397,0.0008118592,0.0015874271,0.0000040120744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007201352,0.00021614622,0.0153150745,0.000018588484,0.00007020416,0.00003757806,0.00012089269,0.0074952305,0.0002566766,0.005355403,0.00036002972,0.97068214],"study_design_scores_gemma":[0.0010740737,0.00031112466,0.02316187,0.000701882,0.000027932903,0.00049948035,0.000029533223,0.95717055,0.00003080105,0.00006050662,0.016386898,0.00054535887],"about_ca_topic_score_codex":0.000018497109,"about_ca_topic_score_gemma":0.00013499972,"teacher_disagreement_score":0.9701368,"about_ca_system_score_codex":0.00015870424,"about_ca_system_score_gemma":0.00010322792,"threshold_uncertainty_score":0.9998816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.868239,0.0015485736,0.11906763,0.007988178,0.0002388031,0.0010858198,0.000019291163,0.00034595732,0.0014667389],"genre_scores_gemma":[0.9957032,0.00080502103,0.001993434,0.00068624615,0.000060548507,0.00050803117,0.00011283504,0.0000321809,0.00009845476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797666,0.00029249102,0.00043611144,0.0004920936,0.0002330143,0.0005696555],"domain_scores_gemma":[0.99729776,0.0006119188,0.00016378085,0.001525304,0.00018356199,0.00021766931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003074685,0.0002868504,0.00033205983,0.00020428067,0.0006595257,0.00036979959,0.0019214511,0.0002132715,0.00003506672],"category_scores_gemma":[0.000009934826,0.00030040977,0.00007956484,0.0010372686,0.00037999538,0.00090342073,0.0007787938,0.000831423,0.000055013796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005675126,0.0032381255,0.0063747102,0.00019560078,0.000783339,0.00009666939,0.049487676,0.2652621,0.0050756414,0.44684106,0.03289775,0.18969058],"study_design_scores_gemma":[0.00047663273,0.00003191993,0.0125637865,0.00012149415,0.000010557774,0.000047293186,0.000670426,0.9847477,0.000010007591,0.00084642664,0.00012998751,0.00034376653],"about_ca_topic_score_codex":0.0002987156,"about_ca_topic_score_gemma":0.0010922147,"teacher_disagreement_score":0.7194856,"about_ca_system_score_codex":0.00012918292,"about_ca_system_score_gemma":0.000095887524,"threshold_uncertainty_score":0.9999448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036683507,0.00019214491,0.9619708,0.00028600986,0.00014602803,0.0005400385,8.6705575e-7,0.0000678836,0.0001127115],"genre_scores_gemma":[0.5437605,0.000119327815,0.45573938,0.000056591605,0.00006909567,0.0000652034,0.000007811607,0.000013345717,0.00016872773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893713,0.0000269203,0.00028977665,0.00026182315,0.00020156524,0.00028280614],"domain_scores_gemma":[0.9992265,0.00013023052,0.00010814708,0.00035846376,0.00006264781,0.000113976836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016021068,0.00015870138,0.0002545947,0.000081272345,0.00003942695,0.00005168155,0.00044850577,0.000116653035,0.000024723371],"category_scores_gemma":[0.0000018499846,0.00010868166,0.000054410113,0.00025910855,0.00002528464,0.00045821635,0.00005076986,0.0001909526,7.3850856e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035776935,0.000057739424,0.000046209418,0.00002092395,0.0000058422065,0.0000012339702,0.00033344998,0.00085405813,0.0015782341,0.0016657653,0.00020939005,0.9951914],"study_design_scores_gemma":[0.0015882838,0.00019626784,0.0013801627,0.000087749875,0.000006228135,0.000009196207,0.00001922382,0.9865527,0.008984888,0.00045811955,0.0005583536,0.00015880249],"about_ca_topic_score_codex":0.000026930267,"about_ca_topic_score_gemma":0.00048161933,"teacher_disagreement_score":0.99503255,"about_ca_system_score_codex":0.000016424714,"about_ca_system_score_gemma":0.000030328769,"threshold_uncertainty_score":0.44319096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85565907,0.000024848885,0.08119986,0.000079992315,0.0001149409,0.0004646337,1.6790453e-7,0.00016551604,0.06229094],"genre_scores_gemma":[0.997228,1.8129002e-7,0.002415221,0.000060221762,0.000048238984,0.000022873845,6.1618124e-7,0.0000026102036,0.00022199468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897337,0.00010556651,0.00021048916,0.0003058971,0.00016931367,0.00023537212],"domain_scores_gemma":[0.9994918,0.00007771837,0.000043520726,0.0003375947,0.000021536303,0.000027797634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027822703,0.00009197225,0.00014917234,0.00004810041,0.00004434559,0.000093601375,0.0004655781,0.000025009671,0.00002376778],"category_scores_gemma":[0.0000023834953,0.000082725506,0.000018704619,0.00038537572,0.000013650352,0.00024509532,0.00023388326,0.00013094096,0.00005584521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012031674,0.002513622,0.3506674,0.0000062388435,0.000021499067,0.0003184061,0.0143369725,0.016750658,0.000048121914,0.60235095,0.009062226,0.003911906],"study_design_scores_gemma":[0.0007452639,0.00012708853,0.17070033,0.000009233485,0.0000017426887,0.000006659253,0.000536971,0.81886953,0.00012834082,0.008351617,0.00030816605,0.00021508755],"about_ca_topic_score_codex":0.0011411053,"about_ca_topic_score_gemma":0.004573162,"teacher_disagreement_score":0.80211884,"about_ca_system_score_codex":0.000038735936,"about_ca_system_score_gemma":0.000015694348,"threshold_uncertainty_score":0.33734483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061058454,0.003582664,0.93043834,0.0003415693,0.001251992,0.00036341464,0.000001705433,0.00031468595,0.0026471731],"genre_scores_gemma":[0.9472721,0.00027247448,0.051620625,0.00018707952,0.00039676044,0.00008487366,0.000003440977,0.000027717464,0.00013490595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799234,0.00014430935,0.00028107187,0.00046223347,0.00027726137,0.0008427651],"domain_scores_gemma":[0.99870306,0.00014155335,0.00010980713,0.00075974537,0.00006469765,0.0002211304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005232778,0.000234714,0.00026479684,0.000084680796,0.00009961961,0.000054456457,0.0007671125,0.00012651851,0.00008089421],"category_scores_gemma":[0.000019979343,0.00020728329,0.000056469264,0.0008616088,0.000047770292,0.00094747735,0.00028364477,0.00035995408,0.00006181878],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005471886,0.00097209326,0.096758194,0.000029222123,0.000120895675,0.00009355454,0.0020615878,0.007881222,0.000057027133,0.019492246,0.011266218,0.861213],"study_design_scores_gemma":[0.0013048766,0.00028460263,0.1329798,0.00007437114,0.000024316703,0.00011974193,0.00006792622,0.83611715,0.00029109576,0.0015857902,0.026027763,0.0011225695],"about_ca_topic_score_codex":0.000032451273,"about_ca_topic_score_gemma":0.000121254016,"teacher_disagreement_score":0.88621366,"about_ca_system_score_codex":0.00007991711,"about_ca_system_score_gemma":0.00004434858,"threshold_uncertainty_score":0.8452767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115076145,0.022315742,0.96351886,0.0013078122,0.0010651526,0.00020593726,0.000014682586,0.00002208329,0.000042119882],"genre_scores_gemma":[0.9408351,0.0319149,0.02649928,0.00017146747,0.00048273074,0.000009647252,0.000056061243,0.000017009834,0.000013807273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824214,0.0001862417,0.00074007746,0.00025042667,0.00037985458,0.00020127965],"domain_scores_gemma":[0.9954651,0.0008230453,0.0008690776,0.0015775391,0.0011648181,0.000100408004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008140985,0.00016925106,0.00029755055,0.00015146703,0.00018201626,0.00060152286,0.0049140085,0.00010146435,0.000021070216],"category_scores_gemma":[0.00003972449,0.00015326322,0.000037605296,0.00036004727,0.00024787956,0.0021012942,0.0032914681,0.00037159567,7.694117e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006677361,0.00021499813,0.013200225,0.000024547804,0.00042363544,0.000021706323,0.00035098434,0.025256487,0.00018761955,0.0027826766,0.0035927522,0.95387757],"study_design_scores_gemma":[0.0005964023,0.00003390449,0.026817214,0.00048544866,0.000020575573,0.00016827088,0.000023289636,0.9593846,0.0000036719318,0.00062938547,0.0116759585,0.00016125847],"about_ca_topic_score_codex":0.000029016777,"about_ca_topic_score_gemma":0.000024404762,"teacher_disagreement_score":0.95371634,"about_ca_system_score_codex":0.000034932782,"about_ca_system_score_gemma":0.00009071365,"threshold_uncertainty_score":0.91315323},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51879126,0.0000043210466,0.47587332,0.00050155737,0.00021397817,0.00013786943,1.5268076e-7,0.000051576044,0.0044260053],"genre_scores_gemma":[0.9800271,0.0000011066218,0.019748144,0.00015529101,0.000018851177,0.000009630132,0.0000016407349,0.0000013702551,0.00003691237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996236,0.0000129142845,0.00012896486,0.00007712011,0.00008225661,0.00007516307],"domain_scores_gemma":[0.99968565,0.00002122406,0.000046307323,0.00020079175,0.000022341625,0.000023685636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015676125,0.000031987187,0.00004550249,0.00006027101,0.000008520034,0.0000150775695,0.0002235572,0.000035339635,0.00001257454],"category_scores_gemma":[0.000008427255,0.000028975419,0.000008722742,0.0002096399,0.000014151351,0.00049172394,0.000054148677,0.00007654121,0.000013603466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005302508,0.00004026629,0.00495998,0.00006210069,0.0000041491994,0.0000067969704,0.0057850885,0.002242223,0.08670176,0.83524543,0.005394832,0.059552096],"study_design_scores_gemma":[0.00015520444,0.000022139282,0.012059426,0.000008393789,3.843477e-7,0.0000073434826,0.000009980269,0.92647654,0.039209295,0.021822281,0.00017215982,0.000056846042],"about_ca_topic_score_codex":0.000040413208,"about_ca_topic_score_gemma":0.00033232116,"teacher_disagreement_score":0.92423433,"about_ca_system_score_codex":0.000005074984,"about_ca_system_score_gemma":0.000009207495,"threshold_uncertainty_score":0.118158326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001191621,0.0000036043198,0.93566275,0.0003768016,0.00061088044,0.0013346592,0.0000021808173,0.0001931955,0.060624335],"genre_scores_gemma":[0.51995754,0.000003474239,0.4713914,0.0018817,0.00048705275,0.00069964177,0.000027531487,0.00003617905,0.005515491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974951,0.000029672432,0.00041563643,0.00090359565,0.00036447457,0.0007914798],"domain_scores_gemma":[0.9982088,0.00014335409,0.000085352025,0.0012755594,0.000047385765,0.00023951658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010444912,0.00025385077,0.00028203995,0.00017925198,0.00010040574,0.00021040005,0.0018536999,0.00016232576,0.0000876788],"category_scores_gemma":[0.000008596075,0.00023827747,0.000094842246,0.00069789647,0.00004704886,0.00025991598,0.000854135,0.00040000296,0.000020101657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031712687,0.0003870837,0.00038370208,0.000040977422,0.00004078298,0.000020448611,0.00028975724,0.015662549,0.00033515136,0.6989827,0.049670894,0.23415425],"study_design_scores_gemma":[0.0008764186,0.00008213843,0.0012601338,0.0000103400625,0.000007279735,0.000018705705,0.000055790686,0.93020314,0.00018102305,0.00017459814,0.066743486,0.00038692562],"about_ca_topic_score_codex":0.000041166983,"about_ca_topic_score_gemma":0.0002104388,"teacher_disagreement_score":0.9145406,"about_ca_system_score_codex":0.000046336107,"about_ca_system_score_gemma":0.000032340165,"threshold_uncertainty_score":0.9716673},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013251215,0.0019240454,0.9752901,0.00026586733,0.0025438657,0.00027752045,0.0000014290722,0.00035469903,0.0060912087],"genre_scores_gemma":[0.9859461,0.0004081381,0.01161629,0.0008766003,0.00062753825,0.00015093024,0.000014369945,0.000051709325,0.0003083289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963047,0.00019952617,0.0006420725,0.0010924443,0.00056762435,0.0011936126],"domain_scores_gemma":[0.9968357,0.00093872024,0.00034891974,0.0014406358,0.00014601549,0.00028999022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008265007,0.00043139773,0.0004361848,0.00035964596,0.00022354431,0.00033427164,0.0019395138,0.0004103593,0.00004156173],"category_scores_gemma":[0.00012800594,0.0004255479,0.00014737397,0.0028003159,0.0000982433,0.00051922776,0.0009075932,0.0010841809,0.000018088705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020670603,0.00021480763,0.00038482438,0.0000030555543,0.00003586512,0.000104461054,0.00028990512,0.12339086,0.00008282007,0.15687859,0.0013468204,0.7172473],"study_design_scores_gemma":[0.00049676734,0.00007400348,0.0011448386,0.000029032048,0.000010432052,0.000035555855,0.000021590602,0.9659533,0.0002797821,0.0011939481,0.030273587,0.00048719748],"about_ca_topic_score_codex":0.00014795021,"about_ca_topic_score_gemma":0.00085469155,"teacher_disagreement_score":0.9726949,"about_ca_system_score_codex":0.0001487174,"about_ca_system_score_gemma":0.00013359835,"threshold_uncertainty_score":0.99981964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044342567,0.0005747414,0.98098326,0.0010213484,0.00015177751,0.00092898356,0.0000010537798,0.00023958068,0.015655842],"genre_scores_gemma":[0.5669756,0.00016335858,0.4296224,0.0017788187,0.00039957013,0.00033041096,0.000010194498,0.00002351766,0.0006961046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859667,0.000023452989,0.00027967623,0.00046427836,0.00016838034,0.00046753002],"domain_scores_gemma":[0.9980186,0.00096429384,0.00008789027,0.00059036474,0.000112973416,0.00022584655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065775146,0.00014587025,0.00015442392,0.000052395288,0.00017395007,0.00018067317,0.00036734293,0.00010013037,0.000013228124],"category_scores_gemma":[0.000034701417,0.00013321196,0.0000479269,0.000337398,0.00007420989,0.00039016336,0.00028224092,0.00019079135,0.000031707033],"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.000019893556,0.00008584691,0.00046249328,0.000008660253,0.000016788888,0.000006263113,0.000057246816,0.00058295764,0.000029907173,0.7368875,0.0052658333,0.2565766],"study_design_scores_gemma":[0.0017387717,0.00034722558,0.0037368068,0.000017294251,0.000034899065,0.00015576035,0.000058389916,0.5506571,0.00011788689,0.05586732,0.3866082,0.0006603459],"about_ca_topic_score_codex":0.000004875998,"about_ca_topic_score_gemma":0.0001247467,"teacher_disagreement_score":0.6810202,"about_ca_system_score_codex":0.00003327399,"about_ca_system_score_gemma":0.00004980746,"threshold_uncertainty_score":0.5432226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39313853,0.0016806993,0.60295504,0.00040588155,0.00013873058,0.00048685473,9.245398e-7,0.0002895033,0.0009038299],"genre_scores_gemma":[0.95233107,0.0008553454,0.046281017,0.0003296351,0.00009469522,0.00005427971,0.00001409482,0.000020000287,0.000019851524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974595,0.00029940807,0.00072582363,0.00062139094,0.0002214482,0.000672429],"domain_scores_gemma":[0.99667186,0.0005421781,0.00026587592,0.0022282046,0.00012067651,0.00017120628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080401794,0.00030893442,0.00045031225,0.00017211461,0.0006405209,0.00037307694,0.0025275634,0.00015758818,0.000002735609],"category_scores_gemma":[0.000013126402,0.00033082903,0.00008296056,0.0009116235,0.00015247756,0.00043065698,0.0015679585,0.00075424055,0.000004363203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049192518,0.00020547654,0.0009821055,0.00000972101,0.000011511487,0.000012867677,0.001464194,0.076436065,0.00020656137,0.044611607,0.00006191981,0.8759931],"study_design_scores_gemma":[0.0005062452,0.00011089386,0.0024837973,0.00024604608,0.000005833814,0.00005369296,0.00016034077,0.9950872,0.000032297463,0.00012428066,0.0008316104,0.00035772924],"about_ca_topic_score_codex":0.000074461386,"about_ca_topic_score_gemma":0.000036348658,"teacher_disagreement_score":0.91865116,"about_ca_system_score_codex":0.00008191092,"about_ca_system_score_gemma":0.00006061118,"threshold_uncertainty_score":0.99991435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01064691,0.004330402,0.97553116,0.006286905,0.00025685475,0.0011189685,0.000010374428,0.0004922768,0.0013261477],"genre_scores_gemma":[0.9273454,0.00026322866,0.06949406,0.00076840457,0.000088384615,0.0015538041,0.00007037518,0.000032092932,0.0003842333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826837,0.00020790531,0.00034517146,0.0004143261,0.00024888295,0.00051533844],"domain_scores_gemma":[0.99614143,0.0009808223,0.00018466971,0.0021672498,0.0003646609,0.00016116486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044526407,0.00021298022,0.0002439888,0.000080035126,0.0010520184,0.00038233536,0.0024638355,0.0001326026,0.000044145156],"category_scores_gemma":[0.000045585457,0.00022247295,0.00017943254,0.00057418284,0.00014368289,0.0005379063,0.00050781603,0.00041017262,0.00005574445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041116375,0.0012797425,0.0034363032,0.00010400518,0.00034304484,0.0000037209493,0.004125219,0.06559547,0.0020182289,0.15018521,0.028606664,0.74426126],"study_design_scores_gemma":[0.00036799174,0.000048355287,0.0012217491,0.000058902962,0.000014351922,0.0000034666418,0.000104301726,0.9723212,0.00003953114,0.0003640841,0.02520096,0.00025512188],"about_ca_topic_score_codex":0.00015280441,"about_ca_topic_score_gemma":0.00020767945,"teacher_disagreement_score":0.9166985,"about_ca_system_score_codex":0.00014832999,"about_ca_system_score_gemma":0.00015755689,"threshold_uncertainty_score":0.9072184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17820995,0.000053407643,0.818554,0.00018033426,0.0004602672,0.00014639388,1.86204e-7,0.00014815877,0.002247306],"genre_scores_gemma":[0.75586516,0.0000026938342,0.2437659,0.00017592881,0.00016330127,0.000013643307,1.46449e-7,0.0000084869125,0.000004733536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972528,0.00010877827,0.0002695128,0.00065039913,0.0005828975,0.0011356056],"domain_scores_gemma":[0.9983146,0.00020379186,0.000058602684,0.0009353599,0.00007682919,0.0004107877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017534774,0.00022537143,0.00023720785,0.00018516429,0.00016775304,0.00034416004,0.0029197785,0.000052617565,0.000041155767],"category_scores_gemma":[0.000028769964,0.00016927476,0.00003590192,0.0015961603,0.0019229066,0.0016440048,0.0013010228,0.0003572848,0.000071701616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012070622,0.000079375655,0.0019288755,0.0000041830963,0.0000022536196,0.000015895406,0.0011812139,0.0031792186,0.00017073075,0.96761113,0.0000115836865,0.025803456],"study_design_scores_gemma":[0.00035002883,0.0003525657,0.007744151,0.00010206302,0.0000027697865,0.0001870162,0.00001314762,0.9819349,0.0028346973,0.0059747337,0.00009506647,0.00040884616],"about_ca_topic_score_codex":0.000004488654,"about_ca_topic_score_gemma":0.0000013454248,"teacher_disagreement_score":0.9787557,"about_ca_system_score_codex":0.000118736214,"about_ca_system_score_gemma":0.00009938118,"threshold_uncertainty_score":0.70850295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22791094,0.0020146621,0.73350585,0.023076639,0.002837087,0.0027236412,0.00012146842,0.0012962716,0.006513444],"genre_scores_gemma":[0.91895974,0.00043867336,0.07850318,0.000827128,0.000249988,0.0006750833,0.00005988096,0.00003629204,0.0002500255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779344,0.00019182121,0.00041467804,0.00057010946,0.0003811023,0.0006488382],"domain_scores_gemma":[0.99463105,0.00076271326,0.00022306172,0.0037259557,0.00041128616,0.00024594163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007405094,0.0002745318,0.00031151393,0.00007175445,0.0011606844,0.00024171927,0.004928094,0.0002319328,0.000028341068],"category_scores_gemma":[0.000045861605,0.0002911542,0.00021164455,0.0005434921,0.00026797169,0.00039596093,0.0014378005,0.00096830964,0.000052150346],"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.000013470664,0.00017604927,0.0000629749,0.000015085134,0.000033600823,0.000001296282,0.001581146,0.000022907861,0.0013577185,0.9680446,0.0044517075,0.024239482],"study_design_scores_gemma":[0.0006291907,0.00011473922,0.00032471228,0.000057903006,0.000027852773,0.00003044984,0.00017021474,0.8649553,0.00041156384,0.07819595,0.05454604,0.0005360526],"about_ca_topic_score_codex":0.00003268257,"about_ca_topic_score_gemma":0.0017703173,"teacher_disagreement_score":0.8898486,"about_ca_system_score_codex":0.00006930159,"about_ca_system_score_gemma":0.00020080348,"threshold_uncertainty_score":0.99995404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071641825,0.000025534478,0.9270801,0.00035920707,0.00028983178,0.00046908812,0.00000240528,0.00006851439,0.00006351439],"genre_scores_gemma":[0.97424734,0.000026226568,0.023847735,0.001776103,0.00006627218,0.000029490318,0.000002241876,0.0000023920572,0.0000022322222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988765,0.000099465746,0.00026264024,0.00029687866,0.00019545874,0.00026904585],"domain_scores_gemma":[0.99846345,0.00062479265,0.00015896026,0.00023323792,0.0003456884,0.00017387077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019876119,0.00013312005,0.00017805288,0.00015561911,0.00041334602,0.0006872785,0.00031598262,0.000059706996,4.1121362e-7],"category_scores_gemma":[0.000072088544,0.00011773033,0.000017983277,0.00035864243,0.00039706274,0.0048273,0.00015190057,0.000101583355,0.0000011060285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009551665,0.000010484767,0.00018999314,0.000026406246,0.000005318036,3.148644e-7,0.0009791763,0.027978225,0.00003243995,0.19166426,0.00021402113,0.7788038],"study_design_scores_gemma":[0.0011280774,0.00028530165,0.021388678,0.000028449605,0.0000045509837,0.0000092467235,0.000011809026,0.97579175,0.000027448294,0.00023914204,0.0009387033,0.0001468644],"about_ca_topic_score_codex":0.0000019291467,"about_ca_topic_score_gemma":0.0000015351267,"teacher_disagreement_score":0.9478135,"about_ca_system_score_codex":0.000025416412,"about_ca_system_score_gemma":0.00009115521,"threshold_uncertainty_score":0.6627442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046361424,0.00002733527,0.9496086,0.00018033176,0.0009800212,0.0005476258,8.306887e-7,0.00012266429,0.0021711686],"genre_scores_gemma":[0.883288,0.000007922145,0.11570224,0.0002219612,0.00053893146,0.00005727737,0.0000020298485,0.000026313646,0.00015531114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979251,0.00012619837,0.0005557163,0.0005028791,0.00028572793,0.00060436816],"domain_scores_gemma":[0.9977484,0.0006141734,0.00033355085,0.0010200558,0.00018460867,0.00009922402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013860569,0.00021818021,0.00034092134,0.000044218483,0.00030318406,0.00014640074,0.001348975,0.0001296484,0.000022207318],"category_scores_gemma":[0.00006150846,0.00015814835,0.00015190375,0.00049775466,0.0001063182,0.0005589831,0.00026386554,0.00017177725,0.0000039726206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017511798,0.00007226936,0.00043154927,0.00006879063,0.00008434109,0.0000017578276,0.0013706848,0.097682275,0.009112613,0.79640186,0.0010187723,0.09373758],"study_design_scores_gemma":[0.00024049629,0.000044273787,0.000019476538,0.000091262984,0.000017016813,0.00001861959,0.00005470844,0.9874622,0.0036520509,0.008051525,0.00013138812,0.00021697932],"about_ca_topic_score_codex":0.00020237574,"about_ca_topic_score_gemma":0.000011033773,"teacher_disagreement_score":0.8897799,"about_ca_system_score_codex":0.00005194347,"about_ca_system_score_gemma":0.00007027613,"threshold_uncertainty_score":0.6449102},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009379618,0.00006373854,0.9820499,0.0002244547,0.0005418851,0.00014289387,8.13364e-7,0.00014907612,0.0074476507],"genre_scores_gemma":[0.87589186,0.0000027355393,0.123509996,0.0001429623,0.0003878106,0.000010123806,0.000001351591,0.000009671322,0.000043478845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844044,0.00017634103,0.00033698734,0.00039555505,0.0002591399,0.00039150778],"domain_scores_gemma":[0.9982456,0.00034499416,0.00016483302,0.0010494771,0.00010234199,0.00009274455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000989715,0.00012514646,0.0002496686,0.00002186373,0.00008415155,0.000044842287,0.00096433563,0.00007515492,0.000022749844],"category_scores_gemma":[0.00008206323,0.00011934171,0.000079468955,0.00038442374,0.00007118064,0.00019286702,0.0003998848,0.00016493078,0.000023649618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007456545,0.00009697519,0.0032987793,0.000030020728,0.000036009194,0.0000039225383,0.00043094464,0.003485907,0.00020598093,0.28380036,0.0029084636,0.70569515],"study_design_scores_gemma":[0.00029937536,0.00010300335,0.0032086791,0.00004396939,0.000007937497,0.0000073987244,0.000010344503,0.96727675,0.0033530765,0.017808385,0.0076410975,0.0002400067],"about_ca_topic_score_codex":0.00003368101,"about_ca_topic_score_gemma":0.00000881983,"teacher_disagreement_score":0.96379083,"about_ca_system_score_codex":0.000028679564,"about_ca_system_score_gemma":0.000036999274,"threshold_uncertainty_score":0.48666137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010834688,0.000018532402,0.9851729,0.0010141028,0.00085418514,0.0010142543,0.0000026824819,0.00047266888,0.0006159612],"genre_scores_gemma":[0.9057603,0.00006039368,0.09025746,0.002298995,0.00023127485,0.0003001283,0.00005007694,0.000035115358,0.0010062604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977375,0.00015016148,0.0004209743,0.0006925761,0.00028489713,0.0007138397],"domain_scores_gemma":[0.9981542,0.00026659368,0.00018121212,0.0008855193,0.00029021257,0.00022221653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003391294,0.00028361697,0.00032718416,0.00007690888,0.0003278166,0.00012926792,0.0010919062,0.00018830875,0.00008109165],"category_scores_gemma":[0.00002067057,0.0002671549,0.0001735258,0.00046307224,0.00006310575,0.00042757863,0.00013284647,0.00016524564,0.00005914737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006290089,0.00014893468,0.000101053694,0.000020064723,0.00004792364,0.000020924177,0.00015436446,0.038517423,0.001136301,0.9325577,0.017019818,0.010212594],"study_design_scores_gemma":[0.0015205848,0.00012675853,0.00019532142,0.000022597937,0.000012207297,0.000010294135,0.0000067352285,0.9885976,0.005342386,0.0029211445,0.00090402766,0.00034038856],"about_ca_topic_score_codex":0.000046954312,"about_ca_topic_score_gemma":0.00005183127,"teacher_disagreement_score":0.95008016,"about_ca_system_score_codex":0.000097082346,"about_ca_system_score_gemma":0.0001627746,"threshold_uncertainty_score":0.99997807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010129479,0.00437534,0.98248,0.0002574778,0.001012435,0.00010185077,6.548786e-7,0.00003152141,0.0016112783],"genre_scores_gemma":[0.87811613,0.00017152759,0.119662784,0.000095159885,0.0017349414,0.0000035379853,0.0000014132768,0.000022212238,0.00019227953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976907,0.00011620982,0.00089687796,0.00024597184,0.00054041576,0.000509824],"domain_scores_gemma":[0.9985089,0.0002540277,0.0006108132,0.00034796572,0.00014329412,0.00013500627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849832,0.00018685308,0.00039175947,0.00059265754,0.00006783191,0.00021154305,0.0011067356,0.00010728115,0.000017040942],"category_scores_gemma":[0.00006335106,0.00015911144,0.00018013577,0.0021867503,0.000039196573,0.0008985016,0.00018750627,0.0006035831,0.0000063622406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024063864,0.00019786236,0.0131213525,0.000015259944,0.000056145476,0.0012950867,0.00014249988,0.5395294,0.00008158384,0.0032448056,0.011203961,0.43108803],"study_design_scores_gemma":[0.0012204433,0.00025454597,0.037489638,0.00012926463,0.0000147563005,0.0007039457,0.000018926443,0.9540963,0.000102763835,0.0019246946,0.0037422555,0.00030246886],"about_ca_topic_score_codex":0.00008214338,"about_ca_topic_score_gemma":0.000014969821,"teacher_disagreement_score":0.8679867,"about_ca_system_score_codex":0.00014231857,"about_ca_system_score_gemma":0.0000762003,"threshold_uncertainty_score":0.6488376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07045274,0.000006975065,0.9257237,0.00042385014,0.00019196933,0.0006403874,9.681472e-7,0.00005026336,0.0025091795],"genre_scores_gemma":[0.9872158,0.0000055332157,0.011315828,0.00057421334,0.00004066478,0.00018197308,0.000002409918,0.0000104488845,0.0006531033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989552,0.00005822878,0.00028552697,0.00025414495,0.00012095198,0.00032595184],"domain_scores_gemma":[0.9984069,0.00085988815,0.00011136587,0.0004916743,0.00007230343,0.00005787532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038321834,0.00011586994,0.0001669201,0.000023199425,0.00006422657,0.00008295458,0.00070946524,0.00006176269,0.00013692788],"category_scores_gemma":[0.00005757588,0.000074647345,0.000047257403,0.00021836779,0.000043267337,0.00015842807,0.00016761158,0.00013195485,0.00003131675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006623787,0.00011637775,0.01083083,0.000012179408,0.000017256612,0.0000031557367,0.0002779462,0.0048243958,0.000053878015,0.92426527,0.0076358076,0.051956307],"study_design_scores_gemma":[0.0002473374,0.000020239038,0.0017816068,0.00004001885,0.0000017620987,0.0000017929217,0.000033935754,0.9958832,0.0000725266,0.0017746022,0.00004557309,0.00009738093],"about_ca_topic_score_codex":0.00059685996,"about_ca_topic_score_gemma":0.00018186364,"teacher_disagreement_score":0.9910588,"about_ca_system_score_codex":0.000026417276,"about_ca_system_score_gemma":0.000033623397,"threshold_uncertainty_score":0.30440307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053111576,0.001036287,0.9887167,0.00003547379,0.00008621237,0.00080450095,0.0000016351074,0.0001452996,0.0038627258],"genre_scores_gemma":[0.9927355,0.0006349922,0.0014052583,0.0005862487,0.00018665564,0.0039651655,0.000016798125,0.000028308314,0.00044104678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801314,0.000092935115,0.0005001143,0.0006315798,0.00015167876,0.00061054423],"domain_scores_gemma":[0.99865586,0.00018756896,0.00014202068,0.0007924037,0.00005036202,0.00017177669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043449507,0.00025095217,0.00035730866,0.0001265417,0.0001297893,0.0001334732,0.0009615815,0.00023841913,0.00006976402],"category_scores_gemma":[0.0000022388886,0.0002618318,0.00004741081,0.0013076882,0.000104928076,0.00031826246,0.000434066,0.00035074784,0.00001273614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021838392,0.00051280536,0.009912616,0.000010727763,0.000020934958,0.000013645047,0.0002771184,0.06332787,0.00003524588,0.58799237,0.0027896494,0.33508515],"study_design_scores_gemma":[0.00050040626,0.00005557803,0.0018806256,0.00006446082,0.000006194436,0.000011890725,0.0000387722,0.9757967,0.000017163848,0.0031762968,0.018115982,0.00033594004],"about_ca_topic_score_codex":0.0006732606,"about_ca_topic_score_gemma":0.00045019452,"teacher_disagreement_score":0.9874244,"about_ca_system_score_codex":0.0000643257,"about_ca_system_score_gemma":0.00004210267,"threshold_uncertainty_score":0.9999834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066566944,0.000014057563,0.9308474,0.00067523745,0.0010463907,0.00041676892,0.00000497182,0.0002506866,0.00017751321],"genre_scores_gemma":[0.742024,0.0000010331099,0.25655317,0.00054273993,0.0006309813,0.0001064578,0.000029086808,0.0000137052975,0.00009883017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983327,0.00010373641,0.00028725166,0.0005930934,0.00036645937,0.00031680914],"domain_scores_gemma":[0.9986641,0.0004169214,0.00013057867,0.00047130647,0.00015340728,0.00016371113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020904,0.00020008779,0.0001705604,0.00005506765,0.00037011591,0.00036353496,0.0005072045,0.00019804342,0.00022596413],"category_scores_gemma":[0.00006602169,0.00018424427,0.000046745456,0.00021129228,0.00006674486,0.00050048076,0.00021220234,0.00063072075,0.000018807368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006233004,0.00051016564,0.0036937026,0.000022646602,0.00011319124,0.000058995378,0.00074239104,0.022460423,0.10125582,0.73366046,0.0046217702,0.13279809],"study_design_scores_gemma":[0.00065003,0.00003443949,0.002569194,0.000012012497,0.0000038014398,0.0000068914605,0.000011476003,0.9888414,0.0031672555,0.004256863,0.00021639084,0.00023022827],"about_ca_topic_score_codex":0.0001094161,"about_ca_topic_score_gemma":0.0005685725,"teacher_disagreement_score":0.966381,"about_ca_system_score_codex":0.000020371519,"about_ca_system_score_gemma":0.00013390355,"threshold_uncertainty_score":0.7513263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05743766,0.011084202,0.9210956,0.0027843467,0.0044128275,0.00020438062,0.000002079141,0.00006505236,0.0029138357],"genre_scores_gemma":[0.9852858,0.0049661584,0.0089341095,0.0003037535,0.0004258017,0.000017422662,0.000004934259,0.000017821181,0.000044203105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970422,0.00034608867,0.0012942505,0.0002018775,0.0008631664,0.00025244028],"domain_scores_gemma":[0.9966611,0.00027927104,0.0013513961,0.00085524505,0.00077033666,0.00008263226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447602,0.00017625665,0.0003332812,0.00021191887,0.00008022911,0.0004508565,0.0045427466,0.00010856559,0.000003920276],"category_scores_gemma":[0.000059175716,0.00016739967,0.00013767222,0.00035271194,0.000056324872,0.0015394416,0.00052896986,0.00062003295,0.000018607452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006325275,0.00028357873,0.0025831596,0.0000042947477,0.00019065481,0.0001882101,0.0034189408,0.69583,0.00024132896,0.26223782,0.0003667969,0.034591995],"study_design_scores_gemma":[0.010686201,0.00042805178,0.005897217,0.0060450668,0.000037171732,0.0032583294,0.0012403101,0.8745635,0.0007013368,0.021929644,0.0739698,0.0012433502],"about_ca_topic_score_codex":0.00012785778,"about_ca_topic_score_gemma":0.000056484725,"teacher_disagreement_score":0.92784816,"about_ca_system_score_codex":0.0004912276,"about_ca_system_score_gemma":0.00015701186,"threshold_uncertainty_score":0.8441629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039273244,0.00038606836,0.9870613,0.002644673,0.003148619,0.0018795362,0.0000050920066,0.00038504665,0.0005623377],"genre_scores_gemma":[0.8318048,0.00014254072,0.15767227,0.0026320817,0.0055055926,0.0015922778,0.000027263464,0.00013526044,0.00048789912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593997,0.000093191076,0.00078714715,0.0010931398,0.00046454743,0.001621976],"domain_scores_gemma":[0.9959131,0.0016413624,0.0003721639,0.0016474078,0.00018245912,0.0002435374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021071034,0.00050075405,0.0005515671,0.000064244006,0.00053109555,0.00049193995,0.0031698726,0.00049949426,0.000019279254],"category_scores_gemma":[0.000030108478,0.00039641385,0.00022300851,0.0013557982,0.00021903415,0.00050147093,0.0007618985,0.00162388,0.000019187257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005534381,0.00024756143,0.0017247002,0.0000416749,0.00009076574,0.000020489328,0.00045293602,0.29931688,0.00047392873,0.13648656,0.02923094,0.5318582],"study_design_scores_gemma":[0.0010494537,0.000063530024,0.0015261937,0.00011365857,0.000017350405,0.00004334784,0.00001407071,0.97292656,0.00004396199,0.0014018479,0.022287788,0.0005122679],"about_ca_topic_score_codex":0.00010722807,"about_ca_topic_score_gemma":0.00058397785,"teacher_disagreement_score":0.82938904,"about_ca_system_score_codex":0.0000616033,"about_ca_system_score_gemma":0.00014582583,"threshold_uncertainty_score":0.9998488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026962727,0.000027746455,0.9416679,0.000024112098,0.00025283085,0.00012048565,1.831816e-7,0.00008813392,0.030855887],"genre_scores_gemma":[0.8731726,0.0000018768231,0.12642962,0.00014383455,0.000018371833,0.000022335238,3.54207e-7,0.0000037938999,0.0002072443],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992401,0.000027745195,0.00019211545,0.0002125214,0.00016147223,0.00016603588],"domain_scores_gemma":[0.99926645,0.000021396234,0.00008116997,0.00052171265,0.000061071456,0.00004822014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016122691,0.00007576075,0.000090808026,0.000046752157,0.000029364843,0.00001250753,0.00044933107,0.00004054387,0.00037599215],"category_scores_gemma":[0.0000054557004,0.0000664762,0.00004298725,0.00025049053,0.000027412463,0.00019162378,0.00006784355,0.00005914612,0.000097141376],"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.00006373528,0.001283529,0.004677089,0.00010922827,0.00010110916,0.000029923922,0.0023018147,0.0010400478,0.14662968,0.13283518,0.0036114287,0.70731723],"study_design_scores_gemma":[0.0002643077,0.00028628888,0.0015266923,0.000017395036,0.0000039715446,0.0000013216328,0.000006651673,0.08820834,0.90680593,0.0020966826,0.0006377684,0.00014467145],"about_ca_topic_score_codex":0.000083018225,"about_ca_topic_score_gemma":0.000079467725,"teacher_disagreement_score":0.8462098,"about_ca_system_score_codex":0.000027403052,"about_ca_system_score_gemma":0.00003650935,"threshold_uncertainty_score":0.41168505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038094357,0.00037971168,0.95905524,0.00014159296,0.0004282143,0.0011776413,0.0000030768767,0.00062059757,0.00009955434],"genre_scores_gemma":[0.8646685,0.00019839156,0.13370915,0.00016603322,0.000034422614,0.0010887536,0.0000028826103,0.0000385181,0.00009339148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787015,0.00007201739,0.00031118834,0.00082079077,0.0002642849,0.0006615497],"domain_scores_gemma":[0.99843484,0.00006624299,0.00014923247,0.0011571351,0.00010344187,0.000089086956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033571987,0.00031063517,0.00032921636,0.00034502606,0.00043213327,0.00007961472,0.00089112605,0.00031920054,0.000012472758],"category_scores_gemma":[0.0000024754938,0.00029646605,0.00011322617,0.0010351016,0.00014134128,0.00022054937,0.000014873429,0.00045783425,0.000009733201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053307926,0.00020766271,0.000012298611,0.000034040182,0.0001520744,0.000019503337,0.000059329486,0.70554817,0.00023161399,0.0045941183,0.000037392943,0.28905052],"study_design_scores_gemma":[0.00114776,0.00084462285,0.000004668632,0.00014664594,0.000080537415,0.00004602964,0.00007213667,0.9767572,0.007468232,0.0011789587,0.011875936,0.00037723832],"about_ca_topic_score_codex":0.0000042650468,"about_ca_topic_score_gemma":0.000035612567,"teacher_disagreement_score":0.8265741,"about_ca_system_score_codex":0.00019387974,"about_ca_system_score_gemma":0.000030033478,"threshold_uncertainty_score":0.99994874},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98332375,0.0010827037,0.011066222,0.0006744705,0.00021100913,0.00037160554,0.0000047527183,0.00009565444,0.0031698097],"genre_scores_gemma":[0.9829963,0.00023611644,0.01606765,0.00008321901,0.00009925965,0.000001182521,0.000012205681,0.000015392978,0.0004887066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968645,0.0004308879,0.0003237097,0.0005924521,0.001297883,0.0004905427],"domain_scores_gemma":[0.9976714,0.00014682674,0.00037479933,0.0010776166,0.00050393573,0.00022538587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024983934,0.0002251234,0.00037982,0.0002631638,0.0003379711,0.000033797798,0.001900469,0.00026720934,0.00036865738],"category_scores_gemma":[0.00006639215,0.00028343167,0.00020551501,0.00089421036,0.00026418286,0.001922064,0.00077435945,0.0005532186,0.00010306883],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003569082,0.00043208397,0.073110014,0.00006516136,0.00017403545,0.00001337691,0.003102618,0.08289256,0.0017647995,0.0027539346,0.0009952312,0.83433926],"study_design_scores_gemma":[0.0021774073,0.00026126276,0.41957042,0.000121490004,0.00010461382,0.000018981144,0.00008343461,0.57068586,0.0009482122,0.00032098332,0.005317791,0.00038955477],"about_ca_topic_score_codex":0.0000052645964,"about_ca_topic_score_gemma":0.00010392124,"teacher_disagreement_score":0.83394974,"about_ca_system_score_codex":0.00025598658,"about_ca_system_score_gemma":0.00021104116,"threshold_uncertainty_score":0.9999618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054517202,0.00003316127,0.94360065,0.00007083671,0.00037418242,0.00066653936,0.0000070253254,0.00018683265,0.00054359395],"genre_scores_gemma":[0.84443265,0.000006809248,0.15495346,0.00016651215,0.00017562202,0.00007641867,0.000018876535,0.000014637185,0.00015498073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998215,0.00011572629,0.00045917966,0.0005860311,0.00020814025,0.0004159245],"domain_scores_gemma":[0.9976091,0.00045214506,0.00016519456,0.0013749573,0.00023870032,0.00015992518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058557204,0.00018622345,0.00031087393,0.00005075349,0.00012860616,0.00007534966,0.00095739635,0.00015213995,0.000033446977],"category_scores_gemma":[0.00007120668,0.00017339597,0.000116224524,0.00027478058,0.00007032657,0.00055551826,0.00016107492,0.00010646803,0.0000026135597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054015287,0.00013783664,0.000011346457,0.000008883189,0.000009524871,4.2435577e-8,0.00013936003,0.9400708,0.0009796661,0.01625935,0.00026306167,0.042066123],"study_design_scores_gemma":[0.0007330573,0.00025891233,0.00012988056,0.000008674101,0.000009090131,2.2291614e-7,0.000003966211,0.98761654,0.0011604986,0.009679382,0.00020262411,0.00019713487],"about_ca_topic_score_codex":0.0000068970376,"about_ca_topic_score_gemma":0.00014928641,"teacher_disagreement_score":0.7899155,"about_ca_system_score_codex":0.00003365443,"about_ca_system_score_gemma":0.00006319046,"threshold_uncertainty_score":0.70708823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038364463,0.00009723396,0.9509847,0.00010228061,0.00023061055,0.00015866909,5.586512e-8,0.0001526012,0.009909361],"genre_scores_gemma":[0.9697637,0.00015984791,0.028684393,0.0003084704,0.00008219784,0.000030416726,0.0000010700471,0.000009090772,0.00096083304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987249,0.000044191816,0.00024871895,0.0003685142,0.00021062673,0.0004030465],"domain_scores_gemma":[0.99928683,0.000066048604,0.000041894495,0.0004923556,0.000025689427,0.00008716883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021020712,0.00012474356,0.00014971121,0.00006354496,0.00008169118,0.00004015631,0.0006311896,0.00006969075,0.00004644475],"category_scores_gemma":[0.0000012250573,0.00011525745,0.000036111785,0.000412315,0.00002801092,0.00028816823,0.00022341736,0.0001855591,0.00004360293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029261403,0.000035454847,0.0005302839,0.0000012510036,0.0000027166463,0.000047612182,0.00016286362,0.9726226,0.0000038321923,0.023033455,0.0013780991,0.0021789533],"study_design_scores_gemma":[0.00025833835,0.000023308643,0.00007093011,0.000013695009,5.34218e-7,0.000018257486,0.000006491387,0.99851006,0.00008604836,0.00028251373,0.0005827231,0.0001470913],"about_ca_topic_score_codex":0.00010122127,"about_ca_topic_score_gemma":0.00003287572,"teacher_disagreement_score":0.9313992,"about_ca_system_score_codex":0.00006070841,"about_ca_system_score_gemma":0.000037011763,"threshold_uncertainty_score":0.47000623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7522543,0.00015798175,0.24255477,0.0009464047,0.0007709391,0.0008942066,0.000009303039,0.0007309649,0.0016811119],"genre_scores_gemma":[0.9778219,0.0011882513,0.020122046,0.00025903917,0.00015247984,0.00021135906,0.000044058677,0.00008140048,0.0001194747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961219,0.00050977804,0.0010723213,0.0008290086,0.00048228158,0.0009847038],"domain_scores_gemma":[0.9923362,0.00049721694,0.00045878865,0.0062036463,0.00021015618,0.00029398236],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00085222896,0.00046391413,0.0006367879,0.00035432065,0.0005167286,0.0005127331,0.009315504,0.0003767527,0.000019447813],"category_scores_gemma":[0.000014536994,0.00053008733,0.0001918983,0.0023737096,0.00038357952,0.0016628087,0.001214953,0.00095269165,0.000093637726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012337147,0.00068061636,0.0009148019,0.000015913549,0.000047184356,0.000052575047,0.0012129509,0.967919,0.0023847762,0.010287146,0.0007790132,0.015693678],"study_design_scores_gemma":[0.0011146627,0.000054102427,0.0011381513,0.00024333547,0.000027491018,0.00006867663,0.00003709809,0.99536854,0.0005264627,0.00043961566,0.00031720247,0.0006646674],"about_ca_topic_score_codex":0.0010311446,"about_ca_topic_score_gemma":0.002366385,"teacher_disagreement_score":0.22556756,"about_ca_system_score_codex":0.00058135664,"about_ca_system_score_gemma":0.00056364393,"threshold_uncertainty_score":0.9997151},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001482074,0.000033890803,0.993437,0.00046605757,0.0028393308,0.0008612089,0.0000027390445,0.00039860094,0.0004791286],"genre_scores_gemma":[0.9202594,0.000018930716,0.07528255,0.00063670136,0.0007365628,0.00048558242,0.000010227874,0.00003487949,0.0025351336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980153,0.000039564122,0.00031304877,0.00067945296,0.0002651006,0.0006875355],"domain_scores_gemma":[0.9983044,0.00018923907,0.00011608536,0.001008658,0.000119595315,0.00026197403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047928633,0.00025992544,0.00028491626,0.00005735481,0.00023098243,0.00025910407,0.0012093568,0.0002200872,0.00006005111],"category_scores_gemma":[0.000015855969,0.00022216345,0.00014443736,0.00024102668,0.00005827166,0.00037542998,0.00033984642,0.00036999115,0.000032896143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007578972,0.000971035,0.0008951121,0.00007531932,0.0002306978,0.00005690786,0.0010084548,0.017171258,0.002496229,0.50769454,0.12123409,0.34809056],"study_design_scores_gemma":[0.0010826301,0.00008220266,0.000311847,0.000014155883,0.000007696748,0.00001281438,0.000012647698,0.9924832,0.0013013604,0.00035712216,0.004021576,0.00031274106],"about_ca_topic_score_codex":0.000027017224,"about_ca_topic_score_gemma":0.00024209575,"teacher_disagreement_score":0.97531193,"about_ca_system_score_codex":0.000040470084,"about_ca_system_score_gemma":0.000060382274,"threshold_uncertainty_score":0.90595627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027994923,0.0015133191,0.96751314,0.0001461194,0.00032985586,0.00091802364,7.425669e-7,0.00014484007,0.0014390073],"genre_scores_gemma":[0.86178076,0.00022450232,0.13622406,0.00051620585,0.00016201408,0.00066610053,0.0000031639033,0.00001248509,0.0004106978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984342,0.00004293838,0.0003533802,0.0005099993,0.0001552658,0.0005042416],"domain_scores_gemma":[0.99898237,0.00014739386,0.000062913496,0.0006744883,0.000045357356,0.0000874872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054828817,0.00014485292,0.00018441715,0.000045335346,0.00006132541,0.00009328646,0.000714469,0.00007961489,0.0001263547],"category_scores_gemma":[0.000011914173,0.00013964614,0.00005990506,0.00027735825,0.00002276906,0.00054367026,0.0003646957,0.00013052,0.000022558215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020372938,0.00013645036,0.000455311,0.000012997655,0.000006310048,0.0000010943991,0.0003051088,0.09677523,0.00012292113,0.0006552042,0.00081786205,0.90069115],"study_design_scores_gemma":[0.0005448731,0.00011593766,0.00041153986,0.000015454072,0.0000013299832,0.0000010593907,0.000018637358,0.95048445,0.00076473196,0.0001806797,0.047288187,0.00017310257],"about_ca_topic_score_codex":0.0000033885553,"about_ca_topic_score_gemma":0.00084069755,"teacher_disagreement_score":0.90051806,"about_ca_system_score_codex":0.00015339073,"about_ca_system_score_gemma":0.00002953086,"threshold_uncertainty_score":0.56946045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1268245,0.000011437878,0.85427505,0.00006793601,0.00006890189,0.000105004685,0.0000011450647,0.00011948345,0.018526532],"genre_scores_gemma":[0.9715052,0.0000025084778,0.02790774,0.000207004,0.000106123036,0.0000058920114,0.000004708507,0.000009359131,0.00025146728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998484,0.000041718893,0.00027365555,0.0004323854,0.0003720153,0.000396209],"domain_scores_gemma":[0.9984887,0.00020140276,0.00016828973,0.0009422623,0.000075914024,0.00012341703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031484492,0.00018031009,0.0003628864,0.00012398962,0.00007220281,0.00013105576,0.0006794763,0.00005811982,0.000029917248],"category_scores_gemma":[0.000016882514,0.00012925334,0.00012239654,0.0013249833,0.00006990353,0.0005023767,0.00015239943,0.00013755314,0.000021554846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007792292,0.00031382806,0.06838174,0.000033160828,0.0010860221,0.000022487957,0.0003765683,0.59874994,0.00005218922,0.19804938,0.0017039495,0.13115282],"study_design_scores_gemma":[0.0003575135,0.0006076126,0.039684094,0.000054547807,0.0000946624,0.000011580924,0.000010479462,0.95498633,0.00038573804,0.0011590156,0.002291649,0.0003567586],"about_ca_topic_score_codex":0.00006365373,"about_ca_topic_score_gemma":0.0001272193,"teacher_disagreement_score":0.8446807,"about_ca_system_score_codex":0.000024964944,"about_ca_system_score_gemma":0.000020206953,"threshold_uncertainty_score":0.5270799},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12194382,0.0109102465,0.86497605,0.0005421969,0.00022253947,0.00040405308,2.5652747e-7,0.000029800765,0.0009710319],"genre_scores_gemma":[0.9883854,0.005657089,0.0050724526,0.0007675188,0.0000206778,0.00006301818,0.0000015910151,0.0000038169173,0.000028483975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985852,0.00016244611,0.00033249604,0.0004899408,0.00018583152,0.00024408256],"domain_scores_gemma":[0.9986987,0.000809012,0.00014965571,0.00022688205,0.000026212943,0.00008951504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012324755,0.0001457164,0.00015171318,0.00004441266,0.0001348953,0.00022617905,0.00023599785,0.000035965215,0.0000048197494],"category_scores_gemma":[0.000046025852,0.00011576091,0.000016730688,0.00015182163,0.0003484926,0.0009675087,0.00040241942,0.00021041982,0.0000026440252],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012222723,0.00009085096,0.0005291881,0.000017013379,0.000015672753,0.00004878427,0.010773006,0.0010210003,0.0000017768308,0.0401068,0.00007833568,0.94719535],"study_design_scores_gemma":[0.0026238873,0.0001706836,0.012444854,0.00006233679,0.000026897444,0.00020445275,0.0045406446,0.94363636,0.00003330397,0.0054150806,0.030454569,0.00038692137],"about_ca_topic_score_codex":0.000017087603,"about_ca_topic_score_gemma":0.000005068292,"teacher_disagreement_score":0.9468084,"about_ca_system_score_codex":0.00002342816,"about_ca_system_score_gemma":0.000007671518,"threshold_uncertainty_score":0.47205928},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070782844,0.003189957,0.9850664,0.0017171031,0.00023074001,0.001804203,0.000011547634,0.0004376605,0.00046409032],"genre_scores_gemma":[0.62896764,0.0008619308,0.36895895,0.00048777723,0.000047824193,0.0005568721,0.00002137412,0.000030973148,0.00006667345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721944,0.0007293947,0.00068930874,0.0005994856,0.00021268113,0.0005496695],"domain_scores_gemma":[0.98862684,0.004111321,0.00036919175,0.006355181,0.00034042154,0.00019702253],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010866615,0.00032225804,0.00040160256,0.00017217259,0.001695771,0.0003680316,0.0052394215,0.00016820185,0.000008521929],"category_scores_gemma":[0.000059836562,0.00034747043,0.00014260525,0.0006352895,0.0004154787,0.00041413648,0.0019117721,0.00041923762,0.000021917687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001501433,0.001139856,0.00089601753,0.000092886745,0.00009720309,0.0000014751491,0.0050284457,0.054363813,0.0008202089,0.02112867,0.008593492,0.9078229],"study_design_scores_gemma":[0.0009894546,0.00011736029,0.00008868921,0.00015392445,0.000023941177,0.000011993085,0.00008287716,0.96011794,0.0001669255,0.00019877763,0.0376687,0.00037941893],"about_ca_topic_score_codex":0.000064938475,"about_ca_topic_score_gemma":0.000075680146,"teacher_disagreement_score":0.9074435,"about_ca_system_score_codex":0.00009740307,"about_ca_system_score_gemma":0.000057669742,"threshold_uncertainty_score":0.9998977},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046655387,0.00927677,0.97982234,0.00050436356,0.00022395024,0.0032699455,0.0000022586232,0.00033002734,0.0019048087],"genre_scores_gemma":[0.98825186,0.002262752,0.001948642,0.0014443211,0.0010957213,0.004891069,0.000019680652,0.000026219112,0.000059702685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967984,0.00021520228,0.0006951188,0.0010049862,0.0002741516,0.0010121737],"domain_scores_gemma":[0.99713576,0.0005294818,0.00022428579,0.0017908135,0.00009017294,0.0002295107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001193915,0.00038176714,0.00043224913,0.000043871147,0.00067997375,0.00040297062,0.0014318206,0.00024133261,0.000031634365],"category_scores_gemma":[0.0000071251466,0.0003085614,0.00012788206,0.0017443392,0.00019813744,0.00039807596,0.00041529367,0.00079068064,0.000010079788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000686998,0.00011812325,0.0012397323,0.0000033578192,0.000008812087,0.0000025653096,0.000054440086,0.71818405,0.00000404664,0.04176141,0.0018921944,0.2367244],"study_design_scores_gemma":[0.00037443137,0.00014694089,0.00810512,0.000036495778,0.000016790076,0.000019266587,0.00007356396,0.9143393,0.000005656593,0.007197029,0.06926699,0.00041838788],"about_ca_topic_score_codex":0.00002175458,"about_ca_topic_score_gemma":0.00009193692,"teacher_disagreement_score":0.9835864,"about_ca_system_score_codex":0.00009302856,"about_ca_system_score_gemma":0.000049971037,"threshold_uncertainty_score":0.99993664},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080757437,0.00016544064,0.9937008,0.00020642391,0.0006707945,0.00094840396,0.0000021719848,0.0006174839,0.002880885],"genre_scores_gemma":[0.85394776,0.000014490809,0.14228648,0.002004976,0.00028908477,0.0006955305,0.000022537837,0.00003439001,0.0007047384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769807,0.00012249147,0.00045572923,0.000771378,0.00024971113,0.0007026063],"domain_scores_gemma":[0.9969815,0.0010740438,0.00015866861,0.0013719202,0.00015019886,0.00026363987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001365756,0.00025140634,0.00031457096,0.00005838266,0.0002425633,0.00022706033,0.0012029968,0.00014552416,0.0000756015],"category_scores_gemma":[0.0001146303,0.00023009776,0.00016936637,0.00032490402,0.00006864498,0.00025335388,0.00024197549,0.00019403992,0.000035278084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026871554,0.00021278478,0.00028355588,0.000047992537,0.000021251904,0.000004428696,0.00007224672,0.12301491,0.000054884043,0.1957972,0.0066785216,0.6737853],"study_design_scores_gemma":[0.00049763557,0.0003322924,0.00008422429,0.000021073598,0.000009186041,0.0000025585668,0.000008513907,0.92752737,0.00006126108,0.0019251257,0.06925619,0.00027458475],"about_ca_topic_score_codex":0.0000039464094,"about_ca_topic_score_gemma":0.00002058607,"teacher_disagreement_score":0.8531402,"about_ca_system_score_codex":0.00006644859,"about_ca_system_score_gemma":0.00010490708,"threshold_uncertainty_score":0.93831146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008647756,0.000008228883,0.89645535,0.00012763326,0.0005135853,0.100776084,0.0000020106545,0.0002546228,0.0009976914],"genre_scores_gemma":[0.51464695,0.0000010767465,0.018465826,0.0016011178,0.00091584405,0.46251816,0.000008793233,0.00004316198,0.0017990913],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782676,0.0000865014,0.0003941712,0.0005277936,0.0002577585,0.0009069976],"domain_scores_gemma":[0.99853915,0.00014335477,0.00017980146,0.0007581424,0.000087406814,0.00029215188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004797874,0.00029580246,0.00027654212,0.000054889224,0.00008916273,0.00042781868,0.0017662026,0.00016028063,0.0002591354],"category_scores_gemma":[0.000008493863,0.00022929769,0.00013612524,0.00026328617,0.00004243802,0.0012450784,0.001027933,0.00022736624,0.00003074702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027514077,0.0013832422,0.03796027,0.00026209283,0.00019869376,0.000011271886,0.0018139997,0.0008476124,0.00046869653,0.32728025,0.5537568,0.075741954],"study_design_scores_gemma":[0.0015828322,0.00010510733,0.0018651632,0.00006382428,0.0000074080795,0.000011047755,0.000006767696,0.88769853,0.0018064878,0.00017662797,0.1062768,0.0003993773],"about_ca_topic_score_codex":0.00006312996,"about_ca_topic_score_gemma":0.00007457153,"teacher_disagreement_score":0.88685095,"about_ca_system_score_codex":0.000096164906,"about_ca_system_score_gemma":0.00003967084,"threshold_uncertainty_score":0.9350488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043718144,0.0025166932,0.9881007,0.00022392378,0.0012407156,0.00037324245,9.285261e-7,0.00031689444,0.0028550886],"genre_scores_gemma":[0.9014252,0.00017473497,0.095607474,0.0013052026,0.00037933665,0.0001828041,0.0000061502055,0.000021321548,0.00089778117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985385,0.000036533434,0.00021032915,0.00030419475,0.0001659288,0.0007444941],"domain_scores_gemma":[0.99873495,0.0002073572,0.00006765486,0.00069065054,0.00006775184,0.00023162582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042339502,0.00015855474,0.00017399897,0.000048812926,0.00012907259,0.000105310784,0.00085592695,0.000112480426,0.000043178727],"category_scores_gemma":[0.000008388513,0.00013519278,0.000118285854,0.0003602077,0.0000339577,0.0006574356,0.0002378642,0.0001230195,0.000042481322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009607063,0.00008803717,0.001331111,0.000008040319,0.000027487666,0.0000011250573,0.00016720596,0.0010126084,0.000021608706,0.4177631,0.045726147,0.53384393],"study_design_scores_gemma":[0.0005024903,0.00010993456,0.0015761259,0.000014390835,0.000012664125,0.00001479118,0.000017558747,0.8430614,0.00023880934,0.0037431596,0.15030493,0.00040375293],"about_ca_topic_score_codex":0.000003933529,"about_ca_topic_score_gemma":0.000024106002,"teacher_disagreement_score":0.89705336,"about_ca_system_score_codex":0.000024955292,"about_ca_system_score_gemma":0.000020567897,"threshold_uncertainty_score":0.55130017},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021062644,0.0010405395,0.94637436,0.000025455369,0.00030101553,0.0005764607,1.3913996e-7,0.00036475726,0.030254606],"genre_scores_gemma":[0.9576259,0.000084445055,0.040391814,0.00030894036,0.00008982116,0.00019949728,8.9262096e-7,0.00001997376,0.0012786977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982747,0.00010124361,0.00029776976,0.000566035,0.0001870025,0.0005732839],"domain_scores_gemma":[0.99892753,0.00009630163,0.00009985091,0.00071425055,0.000045819837,0.00011623957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043697338,0.00018378595,0.00020460761,0.00007950237,0.00007716096,0.00008051896,0.0009882273,0.00012301002,0.00011623707],"category_scores_gemma":[0.0000133878375,0.00016573876,0.00006270953,0.0005962423,0.000043967244,0.00055596436,0.00048169508,0.0003469237,0.000077884084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002192209,0.00021938686,0.0049430155,0.0000042355123,0.000026379634,0.000038737075,0.006536249,0.008919249,0.000014891896,0.016141815,0.0010588905,0.96207523],"study_design_scores_gemma":[0.00048685892,0.00022490614,0.0071815234,0.00003514855,0.0000050425356,0.000020214533,0.00032731402,0.9833278,0.00044519635,0.001044584,0.0064768908,0.00042451083],"about_ca_topic_score_codex":0.000042184736,"about_ca_topic_score_gemma":0.00013674417,"teacher_disagreement_score":0.97440857,"about_ca_system_score_codex":0.0000749152,"about_ca_system_score_gemma":0.00004170708,"threshold_uncertainty_score":0.6758631},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029697511,0.00009183159,0.9633237,0.0010068011,0.0005901517,0.0007289493,0.0000070831165,0.00039128924,0.0041626818],"genre_scores_gemma":[0.16671802,0.00007037793,0.82514983,0.00095855404,0.0003012605,0.00025168044,0.000008180811,0.000026902875,0.0065151695],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983666,0.00002881886,0.00028185116,0.0005132217,0.00035417383,0.00045536653],"domain_scores_gemma":[0.9979454,0.00036000446,0.000076720156,0.0012687802,0.00015616186,0.00019290052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022720506,0.00017742554,0.00024169273,0.00006284651,0.0001939338,0.00006106938,0.0016400826,0.00011155827,0.00009204881],"category_scores_gemma":[0.000075850796,0.00015528328,0.000108741646,0.00040859444,0.000080637816,0.00037198976,0.00057180255,0.00012205796,0.00015074565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055563305,0.0003804925,0.0015351431,0.000039268398,0.000073567055,0.00011441583,0.0008991932,0.00029086132,0.0018299294,0.15818642,0.78703856,0.049556587],"study_design_scores_gemma":[0.0014937598,0.00009700407,0.0006552523,0.00001653515,0.000003356354,0.000043575077,0.00000867937,0.9738242,0.0039563905,0.0013013096,0.018316222,0.0002837338],"about_ca_topic_score_codex":0.0000322284,"about_ca_topic_score_gemma":0.000037637576,"teacher_disagreement_score":0.97353333,"about_ca_system_score_codex":0.00004266824,"about_ca_system_score_gemma":0.00010781689,"threshold_uncertainty_score":0.6332269},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10960185,0.16517119,0.71677095,0.0022580177,0.0022973742,0.0021221216,0.000005540209,0.0006532313,0.0011197241],"genre_scores_gemma":[0.97021514,0.010156612,0.016650626,0.0019341267,0.00038555823,0.0004945289,0.000017572102,0.000042876385,0.000102971266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617237,0.00029897288,0.00081328873,0.0012733274,0.00027659308,0.0011654551],"domain_scores_gemma":[0.9971109,0.0007221261,0.00021723984,0.0014756254,0.00012509784,0.00034901194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084083783,0.00046800254,0.0006370681,0.00015254725,0.0003629592,0.0002910597,0.0007418067,0.0005317671,0.00009374507],"category_scores_gemma":[0.00005426324,0.00048811123,0.0001281059,0.0008608535,0.0004368413,0.00071658194,0.00070230855,0.0010271756,0.000028628845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030302717,0.00030778704,0.0013038202,0.000011720342,0.0000405938,0.00018784813,0.00073723594,0.81235605,0.000009426999,0.02581343,0.0021658172,0.15703598],"study_design_scores_gemma":[0.005106772,0.0013228606,0.021608427,0.00023077319,0.000057579706,0.0005329511,0.00023429915,0.842061,0.000044687487,0.07801129,0.048946425,0.0018429392],"about_ca_topic_score_codex":0.000026549213,"about_ca_topic_score_gemma":0.0018546385,"teacher_disagreement_score":0.8606133,"about_ca_system_score_codex":0.00023195392,"about_ca_system_score_gemma":0.00018797585,"threshold_uncertainty_score":0.99975705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071285684,0.000062340776,0.9840825,0.00089412706,0.00055004284,0.00035431454,5.91775e-7,0.00035608537,0.006571386],"genre_scores_gemma":[0.94782835,0.000011194716,0.048719127,0.0018722347,0.00038043797,0.000033490192,0.0000036998288,0.0000093169965,0.0011421659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855185,0.00003739349,0.0002341677,0.00045883964,0.00019570012,0.0005220263],"domain_scores_gemma":[0.99881923,0.00010243434,0.00006928142,0.00077528623,0.00008527012,0.00014850961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035375587,0.00017010242,0.00020519264,0.000037930447,0.00016950254,0.00024051912,0.0010024738,0.00012759154,0.000026555357],"category_scores_gemma":[0.0000081921435,0.00015400858,0.0001167563,0.00030723965,0.00003649269,0.00037714659,0.00009005465,0.00015654466,0.000017180231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060328894,0.00007132489,0.00006551419,0.0000041652784,0.00001155093,0.0000058235537,0.000089023466,0.0017675542,0.00046206047,0.85725343,0.024606265,0.11565723],"study_design_scores_gemma":[0.0002979331,0.00015049861,0.00025039134,0.000008371632,0.0000051466,0.0000052460273,0.0000027121432,0.973124,0.0018871095,0.014936845,0.009096595,0.00023510396],"about_ca_topic_score_codex":0.000013373393,"about_ca_topic_score_gemma":0.00001562286,"teacher_disagreement_score":0.9713565,"about_ca_system_score_codex":0.000045308567,"about_ca_system_score_gemma":0.000031671374,"threshold_uncertainty_score":0.62802875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029370604,0.001958009,0.9664992,0.00013308703,0.00063765846,0.00022488782,0.0000048548513,0.00046343007,0.00070824975],"genre_scores_gemma":[0.98625296,0.000040167513,0.01323026,0.00017328441,0.00022344018,0.000010177322,0.000025607138,0.000022613207,0.00002146812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721444,0.00016851845,0.00062786293,0.00072894385,0.0002897019,0.0009705151],"domain_scores_gemma":[0.998195,0.00051570876,0.00023331023,0.0008024945,0.000066731256,0.00018676794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004501525,0.00029668288,0.00036692747,0.000118996715,0.00024454753,0.0003384709,0.0013697149,0.00014761533,0.000033954788],"category_scores_gemma":[0.00012407015,0.00033150933,0.000101466736,0.0014059689,0.000055644883,0.00026638107,0.000456397,0.0005549071,0.000056361543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004272357,0.00012176626,0.0041271187,0.000017858707,0.000017396249,0.0004395492,0.0004357012,0.3723145,0.000025077352,0.0021026125,0.002227434,0.6181667],"study_design_scores_gemma":[0.00051841163,0.00005767775,0.005192597,0.00013130684,0.0000051235115,0.00009340924,0.000017868166,0.9914877,0.000012222772,0.0001378047,0.0019971966,0.0003487045],"about_ca_topic_score_codex":0.000006697932,"about_ca_topic_score_gemma":0.0000066866182,"teacher_disagreement_score":0.95688236,"about_ca_system_score_codex":0.00017392283,"about_ca_system_score_gemma":0.000020601834,"threshold_uncertainty_score":0.9999137},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022145767,0.00072213396,0.99143326,0.0001865203,0.00341719,0.003606047,0.000011083833,0.0005766577,0.000024984396],"genre_scores_gemma":[0.2508502,0.00012282634,0.7416449,0.0008107833,0.0038800219,0.0020923226,0.00017416543,0.00012229064,0.00030249316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586743,0.00013135721,0.00078487286,0.0010666614,0.0003428995,0.0018067568],"domain_scores_gemma":[0.99722075,0.00038860293,0.0004301811,0.0011095965,0.00032830966,0.000522574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010458909,0.0006277512,0.00068105635,0.00012342403,0.0005406786,0.00044746988,0.0014534041,0.00047791563,0.000004159986],"category_scores_gemma":[0.0000065098884,0.0006209954,0.00035478946,0.0004456462,0.00007045257,0.0011459225,0.00066476036,0.00037751382,0.000003620079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042537795,0.00024677778,0.000061976425,0.000045468038,0.00008673938,0.0000010005353,0.00035415613,0.9309659,5.892778e-7,0.00984285,0.02081673,0.037535246],"study_design_scores_gemma":[0.0023505508,0.00018223621,0.000027432003,0.00013711475,0.000052483745,0.000013454223,0.0000044796943,0.99563813,0.00000748011,0.00024729787,0.0005972701,0.00074205134],"about_ca_topic_score_codex":0.0000032933367,"about_ca_topic_score_gemma":0.000006091682,"teacher_disagreement_score":0.25082806,"about_ca_system_score_codex":0.00022592666,"about_ca_system_score_gemma":0.00007781278,"threshold_uncertainty_score":0.99962413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19115789,0.00061317225,0.8041581,0.0003810674,0.0030542961,0.00009568199,9.4129874e-8,0.00009503475,0.00044468528],"genre_scores_gemma":[0.97224724,0.00008671314,0.02445512,0.0006845687,0.0024727397,6.845862e-7,2.3316029e-7,0.000016363061,0.000036334353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755037,0.00020259249,0.0009974411,0.00031010326,0.00047525112,0.00046422597],"domain_scores_gemma":[0.9977251,0.00022040437,0.0009423689,0.00037988435,0.0005403863,0.000191843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016529497,0.0002265435,0.00043542462,0.0002008629,0.00019396741,0.00032148216,0.0007422729,0.00019320408,0.000027509006],"category_scores_gemma":[0.0001934508,0.00021360377,0.00028679962,0.0007062191,0.000024000128,0.0012120417,0.000081331804,0.0010061163,0.000005215302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000614879,0.00010259577,0.00009568779,0.0000037590294,0.000059638696,0.000058857313,0.00052583497,0.79081607,0.0009994142,0.0006157289,0.0009845156,0.20567639],"study_design_scores_gemma":[0.00053919444,0.0004894653,0.00037820032,0.00044174356,0.000029309871,0.0012445946,0.000096306234,0.9952412,0.00040653205,0.0002937834,0.000619852,0.0002197965],"about_ca_topic_score_codex":0.000008224548,"about_ca_topic_score_gemma":0.000018932591,"teacher_disagreement_score":0.78108937,"about_ca_system_score_codex":0.00053545233,"about_ca_system_score_gemma":0.0001486425,"threshold_uncertainty_score":0.8710509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17050235,0.00018702827,0.8205761,0.00022111136,0.0008110266,0.00027201782,8.849076e-7,0.00024730252,0.007182189],"genre_scores_gemma":[0.97955054,0.000013065636,0.019042835,0.00039282144,0.00034688602,0.00004540293,0.0000050498707,0.000018837887,0.00058458355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791926,0.0001614399,0.00038542063,0.00040694815,0.00023248848,0.0008944211],"domain_scores_gemma":[0.9985324,0.00043959732,0.00011778636,0.0006690917,0.000051024133,0.00019010014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006229044,0.0002103519,0.00026823094,0.00008215735,0.00008392215,0.00011229923,0.00070784264,0.00012985655,0.000066243105],"category_scores_gemma":[0.00004307675,0.0001938715,0.000058483372,0.00081657403,0.000043033073,0.0007535815,0.00031609632,0.00029358524,0.000052276257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007536624,0.0007116776,0.20070258,0.00008071393,0.00007883299,0.0001775597,0.0059652408,0.02228927,0.0012392878,0.480394,0.019362736,0.26892275],"study_design_scores_gemma":[0.00055043335,0.000023206692,0.010478293,0.00004468781,0.0000031230238,0.000019790423,0.00011307903,0.9864961,0.0003524496,0.00015745983,0.0014206205,0.00034075195],"about_ca_topic_score_codex":0.00004070307,"about_ca_topic_score_gemma":0.000115234514,"teacher_disagreement_score":0.9642068,"about_ca_system_score_codex":0.0000908485,"about_ca_system_score_gemma":0.000023009266,"threshold_uncertainty_score":0.79058504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014803973,0.000922543,0.98556244,0.0002786855,0.0010964104,0.008511748,0.00000792579,0.00089089,0.0012489401],"genre_scores_gemma":[0.9682193,0.00014282714,0.0041864957,0.0011291774,0.003540309,0.021430708,0.00010158135,0.0001741704,0.0010754775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942392,0.00027741198,0.0011100769,0.001698836,0.0006759579,0.0019984916],"domain_scores_gemma":[0.99598753,0.00083970936,0.00064613105,0.0019018804,0.00028342233,0.00034132405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009043761,0.000836339,0.00092142733,0.000155243,0.0007685382,0.0007674263,0.002408611,0.0007008788,0.00001755694],"category_scores_gemma":[0.000008368181,0.0008157996,0.00041394753,0.0010795217,0.00016105999,0.00060119986,0.000585114,0.0007605145,0.000014368863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016557191,0.00028848063,0.00047420117,0.000042781077,0.000062426036,0.000056170014,0.000054391578,0.44740748,0.00001853798,0.09506063,0.030291775,0.42607754],"study_design_scores_gemma":[0.001765985,0.0003588117,0.00025942878,0.00050698634,0.000021272332,0.000021749647,0.0000107643755,0.96859276,0.00013954143,0.0018865193,0.02549381,0.0009423404],"about_ca_topic_score_codex":0.00003862165,"about_ca_topic_score_gemma":0.00019755603,"teacher_disagreement_score":0.981376,"about_ca_system_score_codex":0.00022175733,"about_ca_system_score_gemma":0.0001309156,"threshold_uncertainty_score":0.9994293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1840768,0.00026611978,0.8019124,0.0025168392,0.00069677236,0.0010894085,3.2667813e-7,0.00023793343,0.009203372],"genre_scores_gemma":[0.9845348,0.000021639342,0.0065909843,0.0056110388,0.00020107161,0.0002161157,0.0000019220738,0.000023412205,0.0027990318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977667,0.000054693,0.00043984555,0.00060872175,0.0003402282,0.00078980933],"domain_scores_gemma":[0.9980002,0.00020228577,0.000108223685,0.0013857607,0.000077024815,0.0002264821],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005114367,0.0002764882,0.0002547097,0.00009027786,0.000118236116,0.00029723902,0.0023853453,0.00014082955,0.00019935599],"category_scores_gemma":[0.000029300661,0.00017516098,0.00007952073,0.00085213914,0.00005248335,0.00074517285,0.0011422702,0.00044879026,0.0012417836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009855596,0.0001317677,0.0027155972,0.000012022712,0.00003311385,0.00003489005,0.0018155219,0.70134366,0.00059966574,0.013153037,0.15265726,0.12749359],"study_design_scores_gemma":[0.00029417986,0.00009203905,0.0028605533,0.00005114976,0.0000016886792,0.000005039767,0.00010863238,0.9750829,0.0011576513,0.0010979151,0.018899664,0.00034861418],"about_ca_topic_score_codex":0.00021942057,"about_ca_topic_score_gemma":0.00035106207,"teacher_disagreement_score":0.80045795,"about_ca_system_score_codex":0.00010330751,"about_ca_system_score_gemma":0.000039456976,"threshold_uncertainty_score":0.99953586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16602063,0.0018148846,0.8269157,0.002045516,0.0008839819,0.0011812403,0.000006207773,0.00021655989,0.00091526954],"genre_scores_gemma":[0.9841178,0.0013466462,0.013278906,0.00063967775,0.00020494612,0.00033701595,0.0000092699065,0.000036281013,0.000029448642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744666,0.00036546486,0.0007397006,0.00040337036,0.00039204504,0.0006527897],"domain_scores_gemma":[0.9953224,0.0013698164,0.00047408056,0.0021344356,0.00047599923,0.00022328069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009752375,0.0002767902,0.00034797564,0.00031841677,0.0007898945,0.0005926616,0.004966128,0.00016749154,0.00000416986],"category_scores_gemma":[0.00012376563,0.00026183535,0.00013796709,0.0017641303,0.00009542107,0.0002779866,0.00039428912,0.0014557712,0.0000123248865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043208493,0.00066995295,0.00014258927,0.0000036711976,0.000034101795,0.000008070948,0.00043319692,0.95921797,0.00006716187,0.009255749,0.00055900466,0.029565332],"study_design_scores_gemma":[0.002056309,0.00053708925,0.0017748283,0.00061336794,0.000017893477,0.0001241129,0.00003949563,0.98919636,0.00028627864,0.002400173,0.0025354903,0.00041857528],"about_ca_topic_score_codex":0.000007174923,"about_ca_topic_score_gemma":0.00012901079,"teacher_disagreement_score":0.8180972,"about_ca_system_score_codex":0.0005666913,"about_ca_system_score_gemma":0.00033082152,"threshold_uncertainty_score":0.9999834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20742638,0.001194239,0.789616,0.0002263825,0.00017839305,0.0006760633,0.000001468225,0.0002905961,0.0003904693],"genre_scores_gemma":[0.981807,0.0011587858,0.016489021,0.00023433416,0.000114026734,0.00013475564,0.0000048590337,0.000027843453,0.000029378678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741715,0.000015879177,0.0003646907,0.00090265175,0.00026560572,0.0010340459],"domain_scores_gemma":[0.99858373,0.00006394025,0.00009899214,0.00024610444,0.00030763188,0.0006996171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018478867,0.00043064466,0.00044246117,0.00044867487,0.00020823718,0.00048402243,0.0007237455,0.00023092135,0.000010843155],"category_scores_gemma":[0.000022149654,0.00041331342,0.000041269577,0.0011878635,0.00007111156,0.0006182398,0.0001151188,0.0007890045,0.0000039404727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010775409,0.00020361466,0.015618196,0.00013201601,0.000087009415,0.0002787932,0.0027673058,0.05188963,0.00044550464,0.14850932,0.00018223324,0.7797786],"study_design_scores_gemma":[0.00053873874,0.0006080719,0.008193281,0.00016698611,0.0000052765176,0.000104383435,0.000010373834,0.98859435,0.000072263945,0.00013928967,0.0010438842,0.0005230893],"about_ca_topic_score_codex":0.00039020844,"about_ca_topic_score_gemma":0.0012619543,"teacher_disagreement_score":0.93670475,"about_ca_system_score_codex":0.00024139835,"about_ca_system_score_gemma":0.00064006785,"threshold_uncertainty_score":0.99983186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034731824,0.0003571889,0.96282786,0.00029925894,0.00094092946,0.00025118652,0.00006781268,0.00030970498,0.00021421413],"genre_scores_gemma":[0.98732466,0.0000029326782,0.011961341,0.0001052867,0.00044405082,0.000007116283,0.00013611563,0.000015780375,0.0000027416552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969716,0.00031044387,0.0007194949,0.00041479283,0.00052025774,0.0010633785],"domain_scores_gemma":[0.99725944,0.00073263136,0.0005030557,0.0011042834,0.00019145252,0.00020914839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021130312,0.00027431222,0.0003715221,0.00004378545,0.0005724178,0.00022110184,0.0017605567,0.00011934701,0.000009141038],"category_scores_gemma":[0.00023368507,0.00021714061,0.00017420904,0.0013476813,0.0001569518,0.00045857998,0.0008532379,0.00044757576,0.00001758864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025068053,0.0008553764,0.19603497,0.00014842344,0.000400205,0.000029841935,0.0044286987,0.056211345,0.0012314012,0.45776343,0.004956369,0.27791485],"study_design_scores_gemma":[0.0003381468,0.000031265114,0.03338959,0.00009121,0.000025961504,0.000040571467,0.00024692054,0.9599534,0.0022001797,0.00068499567,0.002658164,0.00033956452],"about_ca_topic_score_codex":0.00006780164,"about_ca_topic_score_gemma":0.000001440185,"teacher_disagreement_score":0.9525928,"about_ca_system_score_codex":0.00016980642,"about_ca_system_score_gemma":0.000066966335,"threshold_uncertainty_score":0.88547367},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052960142,0.00014156642,0.99009764,0.00022815581,0.001526617,0.0010007692,0.000003906749,0.0005503244,0.001155031],"genre_scores_gemma":[0.70884174,0.000029967132,0.28577468,0.0014458752,0.0008727027,0.00017032278,0.0000150829255,0.000047944606,0.0028016823],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970675,0.000042181633,0.00050305534,0.00080826884,0.00033604886,0.001242949],"domain_scores_gemma":[0.9975374,0.0007554468,0.00016383595,0.0010088093,0.0002210452,0.0003134862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013531296,0.00029708995,0.00035822825,0.0000898604,0.00033314832,0.00038643554,0.0022103551,0.000198585,0.00003314705],"category_scores_gemma":[0.000051834737,0.00027303648,0.00014875902,0.00085338793,0.00006680021,0.0010224914,0.00083637866,0.00020644929,0.000059331494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037645496,0.0017769972,0.018011376,0.00025091114,0.00034841453,0.0001492129,0.0010563636,0.22152865,0.0017434866,0.12000255,0.40870008,0.22605549],"study_design_scores_gemma":[0.0013908903,0.000067126115,0.0025129598,0.000033723707,0.000007937432,0.000008952916,0.000025727213,0.98493093,0.0023005938,0.0014608295,0.006855885,0.0004044362],"about_ca_topic_score_codex":0.00024450748,"about_ca_topic_score_gemma":0.0018351803,"teacher_disagreement_score":0.7634023,"about_ca_system_score_codex":0.00007601434,"about_ca_system_score_gemma":0.00006205542,"threshold_uncertainty_score":0.99997216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17117411,0.029441476,0.79515094,0.002525089,0.0008387782,0.00018964215,0.0000039417673,0.00003812766,0.0006378719],"genre_scores_gemma":[0.95762765,0.0023728893,0.03955716,0.00022071149,0.00019517187,0.000003892073,0.000003986141,0.0000067324663,0.000011828974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987807,0.00016012952,0.0005298839,0.00015927062,0.00020845597,0.00016150494],"domain_scores_gemma":[0.99820656,0.0006141051,0.00036473645,0.00036932528,0.0003776389,0.00006765068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041228498,0.00011481823,0.00018999403,0.00015857443,0.00013177065,0.00022451713,0.0013533626,0.000055957193,0.000003834117],"category_scores_gemma":[0.000029920402,0.00011607452,0.00005334802,0.00014780131,0.00027173237,0.00028236577,0.00091539253,0.0003730744,7.8972215e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020456402,0.00023587776,0.0106753,0.0000071005484,0.00010843986,0.00012444901,0.0028761136,0.09127183,0.0001564076,0.014344213,0.00055599614,0.87962383],"study_design_scores_gemma":[0.0015466036,0.00014482581,0.02950389,0.0005190291,0.000015039488,0.0015793162,0.0005681891,0.9581267,0.000023951454,0.0019585078,0.0057550403,0.00025885762],"about_ca_topic_score_codex":0.000019163235,"about_ca_topic_score_gemma":0.000085205895,"teacher_disagreement_score":0.87936497,"about_ca_system_score_codex":0.00006743633,"about_ca_system_score_gemma":0.000058817837,"threshold_uncertainty_score":0.4733382},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02824115,0.000013250546,0.9650409,0.00028890924,0.00037635793,0.00014575581,1.4466616e-7,0.00020544654,0.005688089],"genre_scores_gemma":[0.9877118,0.000006163992,0.011383143,0.00043625242,0.0001430761,0.000020772364,0.0000015164289,0.000007759893,0.00028951175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999005,0.00007816597,0.00016992139,0.0003428388,0.00016457531,0.00023949757],"domain_scores_gemma":[0.9993525,0.00004599873,0.000043689623,0.00046759963,0.00002614835,0.00006402211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028455342,0.00010532663,0.00011307523,0.00009359787,0.000056671055,0.00008691595,0.00046729716,0.00009952203,0.00009237334],"category_scores_gemma":[0.000016912032,0.0000930207,0.000027530405,0.00041556134,0.000014041099,0.00029839858,0.00022609344,0.00018258525,0.00010254144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133673475,0.00007997833,0.0025172955,0.000023757386,0.000005198176,0.000018552399,0.00045507096,0.03656237,0.0004685851,0.0331005,0.00304834,0.923707],"study_design_scores_gemma":[0.00025829396,0.00007112277,0.004053994,0.000015119431,0.000001014942,0.000014768302,0.000012327937,0.9845682,0.0008488779,0.0014579915,0.008567148,0.000131134],"about_ca_topic_score_codex":0.000107841,"about_ca_topic_score_gemma":0.0010062517,"teacher_disagreement_score":0.9594706,"about_ca_system_score_codex":0.000052151634,"about_ca_system_score_gemma":0.000012382349,"threshold_uncertainty_score":0.37932742},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010972526,0.000044692257,0.997721,0.000053614327,0.000116491334,0.00054865703,0.0000019548952,0.000068077585,0.00034823205],"genre_scores_gemma":[0.59442174,0.0000012234216,0.40541604,0.00008347494,0.000014070181,0.000038169463,0.000001874744,0.0000045192924,0.000018914923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990597,0.00006057399,0.00028307037,0.00024599975,0.00012708982,0.00022358554],"domain_scores_gemma":[0.9992567,0.00028916163,0.00008905346,0.0002276177,0.00006832457,0.000069184396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042398795,0.00009464792,0.0001797334,0.00007156548,0.000015832988,0.000011032657,0.00031131247,0.00007884402,0.00003569146],"category_scores_gemma":[0.000020606849,0.000082223814,0.00005326177,0.00015190996,0.000023615557,0.00017281208,0.000016602176,0.00007366031,0.0000027569663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022113858,0.00010112795,0.00045672193,0.0000114029845,0.000005042431,0.000003915119,0.0005186561,0.0010312664,0.0005668158,0.0012175398,0.000024477045,0.99604094],"study_design_scores_gemma":[0.002216283,0.00014144692,0.00354131,0.000057897865,0.00000525068,0.0000011717186,0.0000065977165,0.9885634,0.0048440807,0.0004055497,0.00012152566,0.000095459814],"about_ca_topic_score_codex":0.00010102309,"about_ca_topic_score_gemma":0.00001689472,"teacher_disagreement_score":0.99594545,"about_ca_system_score_codex":0.00001879833,"about_ca_system_score_gemma":0.000045611825,"threshold_uncertainty_score":0.335299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3689643,0.016500412,0.61132264,0.00068614254,0.0015406702,0.00022522597,0.0000025501154,0.000054213262,0.00070382305],"genre_scores_gemma":[0.99485743,0.0019499818,0.0027420162,0.000059834023,0.00023323232,0.000015319942,0.000018461351,0.000014081769,0.00010963009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975906,0.00027530245,0.0011147609,0.00016550095,0.00065687235,0.00019698899],"domain_scores_gemma":[0.9973489,0.00022048205,0.0012060415,0.00055034057,0.0006203066,0.00005394268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011757291,0.00014606377,0.00024255695,0.00026850274,0.000078477715,0.00040039213,0.0025509237,0.00010394238,0.000003808766],"category_scores_gemma":[0.000017386948,0.00014443226,0.00008184653,0.00033000318,0.000042958505,0.0014257472,0.00020513937,0.0004345068,0.000007846829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412136,0.00023452689,0.0037241664,0.000006758414,0.000048422044,0.000011997046,0.0003606384,0.7526626,0.0010741499,0.0042365994,0.0035401278,0.2340359],"study_design_scores_gemma":[0.0007540461,0.000058341644,0.0020932748,0.00025095834,0.0000039312313,0.0001293177,0.000043136068,0.9842889,0.00006970968,0.00003671869,0.012128358,0.00014336129],"about_ca_topic_score_codex":0.000060437764,"about_ca_topic_score_gemma":0.000031819258,"teacher_disagreement_score":0.6258931,"about_ca_system_score_codex":0.0003059247,"about_ca_system_score_gemma":0.00008054366,"threshold_uncertainty_score":0.58897763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111465916,0.00017237247,0.8865324,0.00042631425,0.00020374438,0.0006894288,0.0000032074213,0.000212121,0.0002944662],"genre_scores_gemma":[0.9443634,0.00021081498,0.054549348,0.0003683012,0.00020788999,0.00020431782,0.000011028274,0.000031692365,0.000053185944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707544,0.000015738193,0.00046199397,0.00097134337,0.00028416535,0.001191291],"domain_scores_gemma":[0.99854875,0.00016647286,0.00012268909,0.00024641983,0.00027331998,0.0006423541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003035136,0.00046730862,0.00048139595,0.0004999345,0.0002637024,0.00042404834,0.0007661728,0.00026956786,0.0000066920156],"category_scores_gemma":[0.0000814493,0.00048781032,0.00007649767,0.00074936694,0.000054852622,0.0004854996,0.00011027181,0.0007192303,0.000008222982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011867523,0.0002090686,0.003066033,0.00014841989,0.00007959395,0.00006814198,0.003200883,0.03697331,0.0005429493,0.6694175,0.0012891268,0.2848863],"study_design_scores_gemma":[0.0006845272,0.00039255814,0.003163978,0.00021070325,0.0000043983,0.000050752667,0.00000663277,0.9932354,0.00005455508,0.0002965526,0.0013393547,0.0005605487],"about_ca_topic_score_codex":0.00018294233,"about_ca_topic_score_gemma":0.0004009916,"teacher_disagreement_score":0.9562621,"about_ca_system_score_codex":0.00026624207,"about_ca_system_score_gemma":0.00035570882,"threshold_uncertainty_score":0.99975735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001029101,0.00005084476,0.79961705,0.001828478,0.00009299598,0.000032398286,2.7878452e-8,0.00021443359,0.19713469],"genre_scores_gemma":[0.76521504,0.00000421908,0.22476631,0.0022181803,0.00018863913,0.000005144035,1.4584123e-7,0.0000026090454,0.0075997324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995936,0.00000799684,0.00006021073,0.0001304755,0.00008160152,0.00012612692],"domain_scores_gemma":[0.99957883,0.00001792618,0.000010506652,0.00033824868,0.000012046303,0.000042423027],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006370671,0.000036650392,0.000035849116,0.000015440317,0.00002367984,0.000048517042,0.00044090845,0.00001797394,0.00024783428],"category_scores_gemma":[0.0000023669697,0.000030384062,0.000017164739,0.00012253394,0.0000068999957,0.00027915018,0.0001142683,0.000038160408,0.00090621074],"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":[2.271173e-7,0.000017291786,0.00012321542,4.0383821e-7,0.0000018587665,0.0000023790158,0.000053714204,0.0006156813,0.00010296052,0.48093992,0.054009985,0.46413234],"study_design_scores_gemma":[0.000111470705,0.00001781987,0.00066358387,0.0000015123355,5.0913377e-7,0.000011013272,0.0000014804336,0.4392304,0.0020241647,0.0018068391,0.5560324,0.00009879926],"about_ca_topic_score_codex":0.000002607469,"about_ca_topic_score_gemma":0.000011926735,"teacher_disagreement_score":0.7641859,"about_ca_system_score_codex":0.000010822149,"about_ca_system_score_gemma":0.000010988639,"threshold_uncertainty_score":0.9998717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55053693,0.00022365723,0.4474236,0.000066641005,0.00074083963,0.00015403863,5.446661e-7,0.000048200352,0.00080556626],"genre_scores_gemma":[0.98111963,0.000057646877,0.018384013,0.00023443034,0.00007136511,0.000005275627,3.0485995e-7,0.000006154255,0.000121157726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991387,0.0000114509485,0.0002029,0.00025121073,0.00016723614,0.00022850613],"domain_scores_gemma":[0.99935365,0.000059591952,0.000091905415,0.0003249113,0.00009342626,0.000076538156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002582624,0.0001047841,0.00014387196,0.000039863186,0.000081235405,0.000049460356,0.0002638478,0.000066319095,0.00006002412],"category_scores_gemma":[0.000006731452,0.00008716442,0.000033533714,0.00014593232,0.000071890245,0.0003142779,0.00014381568,0.00018545086,0.0000016751505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012761244,0.00033402105,0.04625735,0.00004393132,0.00017324346,0.000010877773,0.00042543755,0.018300079,0.21099366,0.0139072705,0.0010037973,0.7084227],"study_design_scores_gemma":[0.00044784558,0.00014141806,0.0138415275,0.000010667166,0.00000487519,0.00001924018,0.00000482692,0.9836,0.0009791763,0.000050741754,0.0007866886,0.000112963055],"about_ca_topic_score_codex":0.000008900159,"about_ca_topic_score_gemma":0.000020597889,"teacher_disagreement_score":0.96529996,"about_ca_system_score_codex":0.000011462286,"about_ca_system_score_gemma":0.000031061954,"threshold_uncertainty_score":0.3554462},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55965203,0.000096673226,0.43715575,0.00007909273,0.00036872303,0.00015674083,0.0000010084399,0.000053148633,0.0024368297],"genre_scores_gemma":[0.9883293,0.000003953139,0.011455129,0.000042168715,0.00014278702,0.0000086989,0.0000032478547,0.000004524427,0.000010226298],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.00009266751,0.00037113126,0.0002114656,0.00018192195,0.00030969648],"domain_scores_gemma":[0.99904114,0.00045656203,0.00010940834,0.0002461507,0.00002595329,0.00012077469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072639005,0.00009397845,0.00022551428,0.000040900493,0.00004959026,0.000029066054,0.00024904282,0.00005629334,0.000017239126],"category_scores_gemma":[0.000021977332,0.00009009541,0.000025493382,0.00022622755,0.00007639899,0.0003440969,0.00011564458,0.00014575518,0.0000016042441],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032261105,0.00027944896,0.7578949,0.000017155426,0.0000044964704,9.4907915e-7,0.0005865058,0.00026460085,0.00017149067,0.162632,0.000090562666,0.078054704],"study_design_scores_gemma":[0.00017584953,0.000022959899,0.19324705,0.000033402102,0.0000022690547,0.0000043728173,0.00004411028,0.80558217,0.00015068734,0.00059465197,0.00004441989,0.00009805397],"about_ca_topic_score_codex":0.00004286237,"about_ca_topic_score_gemma":0.000033348562,"teacher_disagreement_score":0.8053176,"about_ca_system_score_codex":0.000036842008,"about_ca_system_score_gemma":0.000026022477,"threshold_uncertainty_score":0.3673984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2176366,0.00004662856,0.7813926,0.000149364,0.00021357158,0.00014519317,0.0000017417635,0.00016975345,0.00024457145],"genre_scores_gemma":[0.9606811,0.0000025039042,0.039039288,0.00011835819,0.00010432697,0.0000039628953,0.000041883155,0.000007775773,8.0728967e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986166,0.00005528726,0.00038556205,0.00029054837,0.0001773283,0.00047471392],"domain_scores_gemma":[0.9989538,0.00022711729,0.0002349139,0.00037045978,0.000090526315,0.0001231418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235382,0.00018429171,0.00020112372,0.000096716176,0.00022975876,0.00060313306,0.0004589591,0.00010676784,0.0000022395964],"category_scores_gemma":[0.00007755389,0.0001734679,0.000020923904,0.00081717875,0.000054988643,0.0010725508,0.00023658208,0.000631932,0.0000027163776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017380273,0.000032115648,0.037969455,0.00003170944,0.000015314235,0.000047429392,0.00085645233,0.28895387,0.00018878862,0.010007584,0.00022787301,0.661652],"study_design_scores_gemma":[0.0005104913,0.00003104532,0.03218479,0.00009773889,0.0000030243039,0.0000998798,0.000037467373,0.9659697,0.000062597624,0.00012943425,0.0006607239,0.00021312885],"about_ca_topic_score_codex":0.000044647204,"about_ca_topic_score_gemma":0.000022572593,"teacher_disagreement_score":0.7430445,"about_ca_system_score_codex":0.00004272111,"about_ca_system_score_gemma":0.000053075368,"threshold_uncertainty_score":0.70738155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29533428,0.0033268488,0.69821465,0.00013787,0.0007451851,0.0015742903,0.000013073386,0.0004285951,0.0002252014],"genre_scores_gemma":[0.9020191,0.0019718462,0.0946207,0.0003208077,0.00016452276,0.00079620717,0.000034084682,0.000041316784,0.000031424814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772316,0.00016569457,0.0005707887,0.00070918695,0.00021279034,0.0006183821],"domain_scores_gemma":[0.9944438,0.0011966529,0.00033268862,0.003460638,0.00033290373,0.00023331589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085046067,0.00033720373,0.00040281008,0.00010295763,0.0011455676,0.00039632464,0.002950981,0.0002589083,0.0000051718916],"category_scores_gemma":[0.00003313225,0.00035122276,0.00014760204,0.00042033455,0.00022765197,0.00039450492,0.0026353563,0.0009137311,0.000006411821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011607712,0.0004546488,0.0004192648,0.00006074168,0.00006352052,0.0000025958295,0.0026298221,0.0025068396,0.0028403476,0.22272554,0.00039845568,0.76788664],"study_design_scores_gemma":[0.0006665398,0.00013656101,0.00016495468,0.00005775954,0.000017939488,0.000025492005,0.00011281179,0.9545254,0.00019108765,0.0027691484,0.040929355,0.00040296637],"about_ca_topic_score_codex":0.000027700833,"about_ca_topic_score_gemma":0.00022347007,"teacher_disagreement_score":0.95201856,"about_ca_system_score_codex":0.000038316186,"about_ca_system_score_gemma":0.00006790331,"threshold_uncertainty_score":0.99989396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012865206,0.00076433504,0.994412,0.000160196,0.00072040496,0.0010695077,0.0000039235942,0.00046578413,0.0011172966],"genre_scores_gemma":[0.39138308,0.000029283245,0.60586184,0.0018124948,0.00041313272,0.00019624217,0.000028958624,0.00003024245,0.00024471257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785906,0.000050372266,0.00042682834,0.000591172,0.000274779,0.000797814],"domain_scores_gemma":[0.9983532,0.00054583413,0.00015518033,0.00059152744,0.00016075956,0.00019353436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012032993,0.00021970474,0.00023515552,0.00009659885,0.00027447916,0.00019122376,0.0006719968,0.00017363105,0.00003607313],"category_scores_gemma":[0.000013969127,0.00020794611,0.00014200431,0.0005290733,0.000037720532,0.0003613596,0.00016584969,0.00019243495,0.000016938864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025785386,0.00012137617,0.00004553133,0.0000063020266,0.000015928526,0.00003577857,0.000096645905,0.011651717,0.00015709588,0.0039597508,0.0023859614,0.9814981],"study_design_scores_gemma":[0.00073890935,0.0005037854,0.00030284037,0.00003487938,0.000010017713,0.000022545046,0.000026666461,0.9870842,0.0010325119,0.00022824518,0.0097385915,0.0002768036],"about_ca_topic_score_codex":0.000010060806,"about_ca_topic_score_gemma":0.000048943315,"teacher_disagreement_score":0.9812213,"about_ca_system_score_codex":0.00014166182,"about_ca_system_score_gemma":0.000072135575,"threshold_uncertainty_score":0.84797966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028116375,0.00010076343,0.9914932,0.0002651509,0.0050157383,0.00012955407,0.000002444948,0.00002015208,0.00016133007],"genre_scores_gemma":[0.26520708,0.000024159937,0.73410153,0.00017395742,0.00046870808,0.0000048931406,0.0000014761764,0.00000602492,0.000012151383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976816,0.00006578741,0.00069700106,0.00029882684,0.000981158,0.00027560152],"domain_scores_gemma":[0.9960702,0.00024501304,0.0006637498,0.00038443043,0.0024624516,0.00017414185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017695455,0.0001314377,0.00020619707,0.0004756667,0.00017767862,0.00055606634,0.0034340085,0.00004159473,0.000013422376],"category_scores_gemma":[0.000093237635,0.00012499558,0.0001418305,0.00060405943,0.000268382,0.0029424322,0.0002579538,0.00015857081,0.0000017661539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010157211,0.00017620107,0.000093667586,0.000002164945,0.00005291402,0.000010103127,0.00023592234,0.12884228,0.00016718876,0.07897159,0.00018862987,0.79124916],"study_design_scores_gemma":[0.0005953546,0.0003654289,0.00053324795,0.000047915928,0.0000064902074,0.00037326541,0.000008714524,0.9874247,0.00037672726,0.0056471615,0.0044932044,0.00012781122],"about_ca_topic_score_codex":0.000002286679,"about_ca_topic_score_gemma":0.000004454487,"teacher_disagreement_score":0.8585824,"about_ca_system_score_codex":0.00014039618,"about_ca_system_score_gemma":0.0005982197,"threshold_uncertainty_score":0.6381299},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118041396,0.000097555225,0.8763882,0.0011407664,0.0017769253,0.000313906,2.2930948e-7,0.00036841678,0.0018726382],"genre_scores_gemma":[0.94461584,0.00002930292,0.05366315,0.0006349685,0.00085852714,0.000034231158,0.0000036770903,0.000017040396,0.00014326433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971466,0.00040172398,0.0005733706,0.0009352068,0.00026090338,0.0006821809],"domain_scores_gemma":[0.9980115,0.00031376,0.00013293864,0.0013345546,0.00007820942,0.00012902549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023031177,0.00022721708,0.00033993667,0.00008901709,0.00012270075,0.00029988476,0.0009836312,0.00014491436,0.000044696157],"category_scores_gemma":[0.00034986646,0.00021305305,0.00008043823,0.0006642333,0.000046161513,0.0007409797,0.00068017555,0.00035609482,0.000035436617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013700867,0.00022183178,0.010556827,0.000040375468,0.000016424236,0.000020174115,0.0019600408,0.20959605,0.00050551083,0.058815204,0.0041918107,0.7139387],"study_design_scores_gemma":[0.0005827408,0.00011260006,0.0068425313,0.000058150425,0.0000028193442,0.0000055903165,0.000014794093,0.98505837,0.00007676362,0.0016261778,0.0053527444,0.00026670404],"about_ca_topic_score_codex":0.000104722574,"about_ca_topic_score_gemma":0.00033461707,"teacher_disagreement_score":0.82657444,"about_ca_system_score_codex":0.00016923482,"about_ca_system_score_gemma":0.000043455253,"threshold_uncertainty_score":0.8688051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006677351,0.00018053206,0.9895252,0.0006271617,0.0015215419,0.000504471,6.2056404e-7,0.00034504817,0.00061804574],"genre_scores_gemma":[0.5270455,0.000032773085,0.47021723,0.00077822007,0.00034938392,0.000118689444,0.000007939624,0.00001672709,0.0014335554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886256,0.000028392722,0.00021841394,0.000419312,0.0001152357,0.0003560848],"domain_scores_gemma":[0.9989028,0.00014843358,0.00006348682,0.0006395461,0.00013495298,0.000110803194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036418813,0.00014274365,0.00014657331,0.00003843561,0.00020806259,0.00028079606,0.0007335489,0.00014057697,0.00004212678],"category_scores_gemma":[0.00005702277,0.00012404287,0.00006730437,0.00022395843,0.000029502462,0.000585107,0.00020465562,0.00027734053,0.00003694136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014555023,0.00012832775,0.000505971,0.000011802937,0.000021724938,0.0000036203955,0.00025138917,0.018934244,0.005210038,0.12858687,0.015999347,0.8303321],"study_design_scores_gemma":[0.00040726192,0.000060313883,0.0006889799,0.000006329848,0.0000031779587,0.0000060593356,0.0000041680087,0.96378124,0.00025765644,0.00005503717,0.034557022,0.00017277442],"about_ca_topic_score_codex":0.0000044182043,"about_ca_topic_score_gemma":0.00049719645,"teacher_disagreement_score":0.944847,"about_ca_system_score_codex":0.000015368574,"about_ca_system_score_gemma":0.00003752865,"threshold_uncertainty_score":0.50583214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072848017,0.00005320282,0.7635183,0.0022942997,0.000108091655,0.00003497368,2.5730523e-8,0.00023270129,0.23302993],"genre_scores_gemma":[0.7553003,0.0000051145194,0.23600411,0.002296777,0.00021529534,0.0000059758795,1.419258e-7,0.0000028290538,0.0061694626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956614,0.000008724065,0.00006542031,0.00013665945,0.00008845828,0.00013457234],"domain_scores_gemma":[0.99955803,0.000019815758,0.000011285102,0.00035149872,0.000013078553,0.000046266454],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007124276,0.00003919002,0.00003818157,0.000015617234,0.000025890206,0.000050716222,0.00046992648,0.000019153382,0.00019180198],"category_scores_gemma":[0.0000028183354,0.000032468397,0.000018540926,0.00012253555,0.000007327209,0.0002749616,0.00012396218,0.00004232844,0.0011842959],"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":[1.8748958e-7,0.000012902621,0.000072995834,3.4327937e-7,0.0000016127933,0.0000017710906,0.000044187345,0.00049572013,0.000038910508,0.48705095,0.037424903,0.4748555],"study_design_scores_gemma":[0.0001286121,0.00001869651,0.00086661876,0.0000019467327,6.4124913e-7,0.000012845813,0.0000021359242,0.38218844,0.0013529569,0.0034621926,0.6118449,0.000120006014],"about_ca_topic_score_codex":0.0000031514076,"about_ca_topic_score_gemma":0.000013575368,"teacher_disagreement_score":0.7545718,"about_ca_system_score_codex":0.000012536372,"about_ca_system_score_gemma":0.000011062424,"threshold_uncertainty_score":0.9995934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030278249,0.000011181067,0.95948863,0.00018283076,0.0012194393,0.00057527726,0.000005803336,0.0002846995,0.007953861],"genre_scores_gemma":[0.8797564,0.0000037912416,0.118194535,0.0004907636,0.00042160793,0.00020343358,0.000022286087,0.000015649382,0.00089151703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869615,0.000028114566,0.00020911798,0.00046045164,0.00015222252,0.0004539611],"domain_scores_gemma":[0.9991142,0.00032068603,0.00006682083,0.00036954766,0.000040224797,0.00008851621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031749162,0.00014994756,0.00014636057,0.00008920962,0.00009930343,0.00014962349,0.00048774402,0.00015810948,0.00061018683],"category_scores_gemma":[0.000034498793,0.000137802,0.00005775062,0.0003593579,0.000015635367,0.0003201009,0.00010560093,0.0003981926,0.000045458626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059300328,0.00021266751,0.0014829108,0.0000126742,0.000016836742,0.000012548359,0.00017984633,0.46624634,0.0013186662,0.09158584,0.30818188,0.1306905],"study_design_scores_gemma":[0.00032287437,0.00016788613,0.0020505372,0.00001604575,0.0000014426355,0.000011434412,0.0000028061813,0.97749865,0.00046717908,0.00025483585,0.01902954,0.00017678269],"about_ca_topic_score_codex":0.000056630513,"about_ca_topic_score_gemma":0.00022322402,"teacher_disagreement_score":0.8494782,"about_ca_system_score_codex":0.000043886575,"about_ca_system_score_gemma":0.000031103995,"threshold_uncertainty_score":0.6681118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030362946,0.0008077021,0.9928967,0.0003817867,0.00025996333,0.0011987363,0.000008818088,0.0002046889,0.0012053528],"genre_scores_gemma":[0.9586764,0.0025781796,0.034910675,0.00042896025,0.000026925807,0.0032412503,0.000016718497,0.000028202741,0.000092715796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979693,0.00040194418,0.00046766357,0.0005005894,0.0002122747,0.00044820894],"domain_scores_gemma":[0.9950776,0.0011480486,0.00013744732,0.0034140872,0.0001021424,0.00012064047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061807106,0.00024232507,0.0003056743,0.0001710972,0.00037770098,0.00012077157,0.0027659156,0.00018612317,0.000017718658],"category_scores_gemma":[0.0000073733613,0.00025812967,0.000161024,0.0006740877,0.0001528556,0.0003142032,0.00003341652,0.00066876883,0.000011623367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006706797,0.0019340004,0.000014069915,0.000052704745,0.00006915324,4.1758264e-7,0.0038078025,0.20576555,0.0001297232,0.060728036,0.00021970156,0.7272118],"study_design_scores_gemma":[0.0007348451,0.0002731444,0.000011903415,0.00005984208,0.000019185814,0.0000028758445,0.000084893356,0.9905765,0.00094241806,0.0027324874,0.004283673,0.00027825235],"about_ca_topic_score_codex":0.000015742602,"about_ca_topic_score_gemma":0.00040810704,"teacher_disagreement_score":0.957986,"about_ca_system_score_codex":0.00010458616,"about_ca_system_score_gemma":0.000046708494,"threshold_uncertainty_score":0.99998707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027359204,0.000044930297,0.9567742,0.0013033744,0.0012972387,0.000893312,2.5535826e-7,0.000491296,0.011836223],"genre_scores_gemma":[0.87240493,0.0000039272263,0.12572162,0.0014052892,0.00030216196,0.00009871295,4.4690003e-7,0.00001423285,0.000048663303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959133,0.0002737361,0.00052089634,0.0011271525,0.0010659146,0.0010989821],"domain_scores_gemma":[0.99633366,0.0009776484,0.00013134496,0.0015649797,0.00038775938,0.0006046364],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024744887,0.00031683123,0.00045823562,0.0001959539,0.0005664513,0.0012609533,0.004843178,0.00008787686,0.00039714837],"category_scores_gemma":[0.00023108862,0.0002464566,0.00014561765,0.0015934001,0.0031311058,0.0015963173,0.0018428284,0.00034802657,0.00080689875],"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.000083324456,0.00006397192,0.000018432125,0.000008088188,0.000006660546,0.000016152237,0.0003446713,0.0008242732,0.0005754811,0.84815747,0.0007126201,0.14918888],"study_design_scores_gemma":[0.0059205266,0.00013426374,0.00042166255,0.000034121796,0.0000055667565,0.00007224591,0.0000040570976,0.90916026,0.0027539053,0.08099136,0.00013016487,0.00037189276],"about_ca_topic_score_codex":0.000011278117,"about_ca_topic_score_gemma":2.5417802e-7,"teacher_disagreement_score":0.908336,"about_ca_system_score_codex":0.0000689649,"about_ca_system_score_gemma":0.00016926364,"threshold_uncertainty_score":0.99999875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001334312,0.0001613304,0.9218663,0.000055319706,0.00028807443,0.07519954,0.00001258642,0.00069981,0.00038272617],"genre_scores_gemma":[0.7701488,0.000003246127,0.03019801,0.00008519919,0.00011739872,0.19926938,0.000105352556,0.00004991144,0.000022658858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965956,0.00072587735,0.0009635607,0.00067379425,0.00034396732,0.00069720775],"domain_scores_gemma":[0.99459225,0.0003617089,0.00077802426,0.0036400128,0.0003904152,0.0002375602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018478596,0.00035199997,0.00044711708,0.00011061193,0.0006087346,0.00042513292,0.0035562767,0.00022602653,0.000010444003],"category_scores_gemma":[0.000038411017,0.0003426584,0.00014190075,0.00067233376,0.0000855563,0.00043697143,0.00042361827,0.00040112867,0.000018379415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025503567,0.0013026018,0.0007565119,0.00024412086,0.000076240794,0.00000391747,0.0024187106,0.85692596,0.00013261028,0.020399328,0.0011406059,0.11634435],"study_design_scores_gemma":[0.0014737265,0.00027006902,0.00049008,0.00024251237,0.000009055742,0.000011049224,0.000081282175,0.9866503,0.0001278513,0.000028599574,0.0102185225,0.00039694487],"about_ca_topic_score_codex":0.00007972011,"about_ca_topic_score_gemma":0.00003383078,"teacher_disagreement_score":0.8916683,"about_ca_system_score_codex":0.00020668523,"about_ca_system_score_gemma":0.00014001154,"threshold_uncertainty_score":0.99990255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023044464,0.00014254694,0.98099977,0.00020952425,0.0005206057,0.01501756,8.104838e-7,0.00042147233,0.0024572792],"genre_scores_gemma":[0.5155564,0.000006648422,0.40718064,0.0019392492,0.0024925177,0.069468446,0.000011937032,0.0000617499,0.0032823929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827623,0.000058631205,0.00027247873,0.0003695864,0.00021658487,0.0008064784],"domain_scores_gemma":[0.99846804,0.000176887,0.000091888876,0.0008836618,0.00012418088,0.00025536108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005712918,0.00019301331,0.00020473493,0.000040092884,0.00014288354,0.00016404362,0.00092850946,0.00013805061,0.00005154676],"category_scores_gemma":[0.000033366116,0.0001587274,0.000105601444,0.00034851162,0.00003217278,0.00078358356,0.000299425,0.00015135456,0.000096010815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039682334,0.00058330817,0.004650168,0.00006940837,0.00007694262,0.000006992137,0.00045693634,0.030738609,0.00043577596,0.37828267,0.11743729,0.4672222],"study_design_scores_gemma":[0.00053068926,0.000075468706,0.0007148297,0.00002050841,0.0000039279953,0.000009262436,0.0000035776154,0.66986877,0.0007408619,0.00019061205,0.32760724,0.00023425595],"about_ca_topic_score_codex":0.000009326109,"about_ca_topic_score_gemma":0.0000031268567,"teacher_disagreement_score":0.6391301,"about_ca_system_score_codex":0.000043370743,"about_ca_system_score_gemma":0.000031424108,"threshold_uncertainty_score":0.6472715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.957613,0.000232895,0.040698484,0.00013323769,0.00011035242,0.00045624335,0.0000014771751,0.000044090473,0.00071022357],"genre_scores_gemma":[0.9674503,0.000014468521,0.032357402,0.000079509504,0.00005279556,0.0000114496,4.819993e-7,0.0000069056705,0.000026643926],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834764,0.00015880124,0.00036073299,0.0005367331,0.00020917156,0.00038689433],"domain_scores_gemma":[0.99876785,0.00030109615,0.000097139455,0.0005872043,0.00005511695,0.00019158624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012072619,0.00018620444,0.0003082713,0.00007451191,0.00006244692,0.00007129216,0.00021910145,0.0001231643,0.0000211646],"category_scores_gemma":[0.0000791123,0.00015721725,0.000023460892,0.00026112914,0.00023461174,0.00060370145,0.00035316794,0.00019685329,0.0000017298677],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008416396,0.00042882102,0.7982686,0.00025556286,0.0000151513195,0.0000039146084,0.0013442705,0.000956211,0.0008496133,0.15091544,0.00007978076,0.046798464],"study_design_scores_gemma":[0.001712117,0.00036865938,0.42461058,0.000145021,0.00002127323,0.00005026172,0.00002393515,0.53655934,0.0019278901,0.03344319,0.0005199514,0.0006177496],"about_ca_topic_score_codex":0.00040615996,"about_ca_topic_score_gemma":0.00016349733,"teacher_disagreement_score":0.53560317,"about_ca_system_score_codex":0.00006108487,"about_ca_system_score_gemma":0.00004997457,"threshold_uncertainty_score":0.64111334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029115218,0.000028975834,0.9854692,0.00019189483,0.0005071577,0.0009807444,5.5153413e-7,0.0003081745,0.009601775],"genre_scores_gemma":[0.8917594,0.000013473172,0.10049082,0.001521688,0.00022495273,0.00049007963,0.0000125927145,0.000040147792,0.0054468703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976578,0.000054828,0.00043705894,0.0007018941,0.00033420275,0.00081427005],"domain_scores_gemma":[0.9981946,0.0001344893,0.00014626297,0.0009454986,0.00021022586,0.00036895106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004980998,0.00030264002,0.00029862637,0.00009646954,0.00024024028,0.00015668328,0.0012963034,0.00015180123,0.00023437598],"category_scores_gemma":[0.000029178851,0.00027558263,0.00013760815,0.00046974816,0.000044037257,0.0003099408,0.000388403,0.0002580188,0.0002749595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002566242,0.0008341191,0.0033401717,0.00013455315,0.0001531624,0.000060918388,0.001763568,0.51019806,0.00041806427,0.33662578,0.033423066,0.11279193],"study_design_scores_gemma":[0.0006095699,0.0010731132,0.000049525268,0.00007886394,0.0000111731415,0.000002290299,0.000039677794,0.9856056,0.0017891101,0.00010639635,0.010226444,0.00040822895],"about_ca_topic_score_codex":0.00014920013,"about_ca_topic_score_gemma":0.000068300775,"teacher_disagreement_score":0.8888478,"about_ca_system_score_codex":0.00008173447,"about_ca_system_score_gemma":0.000101609265,"threshold_uncertainty_score":0.99996966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029915565,0.0027860277,0.9931477,0.00010843019,0.00078404904,0.00088839774,0.00001216566,0.00015105424,0.0018230432],"genre_scores_gemma":[0.9165666,0.00040478932,0.08024438,0.0007179123,0.00030592238,0.00044689834,0.00014079893,0.000034110704,0.0011385875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978735,0.00009697392,0.00040337432,0.00061037857,0.00019571352,0.0008200467],"domain_scores_gemma":[0.9974571,0.00055133057,0.00008993096,0.0015642842,0.00007366225,0.00026369735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285819,0.00021164099,0.00029880088,0.00007086205,0.00013078658,0.00012696699,0.0017439198,0.00013895937,0.000068332905],"category_scores_gemma":[0.00006504492,0.00018572464,0.000048788752,0.0004376675,0.00007298513,0.0015609179,0.0012170253,0.00025443968,0.000036665002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046582158,0.0002935934,0.0007797461,0.000026574944,0.000055760294,0.000022238246,0.0006771725,0.09121622,0.000018238405,0.12869838,0.06334219,0.7148233],"study_design_scores_gemma":[0.0004029803,0.00011788253,0.000085979074,0.000026078256,0.000008386632,0.000012529963,0.00010413665,0.8915741,0.000017718363,0.00011159455,0.10730153,0.00023711463],"about_ca_topic_score_codex":0.000005922814,"about_ca_topic_score_gemma":0.000089445326,"teacher_disagreement_score":0.91626745,"about_ca_system_score_codex":0.00010349677,"about_ca_system_score_gemma":0.00009779523,"threshold_uncertainty_score":0.75736314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025439275,0.00006930533,0.9718818,0.00009080748,0.00075097015,0.00023093,3.577319e-7,0.00036531544,0.0011712285],"genre_scores_gemma":[0.98435074,0.000006498308,0.014318485,0.0004054705,0.00019110338,0.00004533282,0.000012017605,0.000018131366,0.0006522135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998481,0.000110685585,0.00019649371,0.00051184004,0.00028762102,0.00041236423],"domain_scores_gemma":[0.99894154,0.00017147852,0.000110954345,0.0005901146,0.000065721164,0.000120184406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003129491,0.00018689029,0.00016893676,0.000040145573,0.00018431431,0.00015386513,0.00037503568,0.000115938274,0.000024762221],"category_scores_gemma":[0.00002933427,0.0001501331,0.000049526832,0.00033701406,0.000035925954,0.00053498,0.00014332599,0.0002153223,0.000021287671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007564475,0.00031740693,0.03290107,0.00001848147,0.0000839133,0.00001610097,0.00040174962,0.44252026,0.0022747125,0.0042113215,0.16094571,0.35623363],"study_design_scores_gemma":[0.00050368416,0.00018002902,0.0032581282,0.000038001603,0.0000078779585,0.000013459346,0.0000093821,0.9885533,0.00029172908,0.00004111625,0.0068805246,0.00022276484],"about_ca_topic_score_codex":0.00029374295,"about_ca_topic_score_gemma":0.0003438955,"teacher_disagreement_score":0.9589115,"about_ca_system_score_codex":0.000077540135,"about_ca_system_score_gemma":0.000021180686,"threshold_uncertainty_score":0.612225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06674323,0.0041991062,0.9178582,0.00705372,0.0005176556,0.0010833448,0.000030868352,0.00046900267,0.0020448873],"genre_scores_gemma":[0.908962,0.016581045,0.07295174,0.0011835927,0.00006611654,0.000111921356,0.000055229975,0.00006033281,0.00002801291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959557,0.0001938602,0.0012044417,0.0012485448,0.0006365784,0.0007608944],"domain_scores_gemma":[0.99305606,0.0013576375,0.00067787705,0.0036132424,0.0007855975,0.000509608],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012655823,0.00074686244,0.0010276162,0.0011420256,0.0016396232,0.0007356571,0.004059531,0.0002935118,0.0000014102981],"category_scores_gemma":[0.00000938337,0.0007193628,0.00024021759,0.0024050907,0.00089554995,0.0007711254,0.0019298627,0.0010379322,0.000001805899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001444925,0.0063405237,0.018319307,0.00041417283,0.00901784,0.000026428754,0.023114502,0.49410322,0.0055604787,0.25798896,0.002825336,0.18084429],"study_design_scores_gemma":[0.0009734228,0.00094309775,0.0016814717,0.0004958055,0.0003745439,0.00007570864,0.00025181027,0.9930433,0.000094488685,0.00018756915,0.0011111851,0.00076757063],"about_ca_topic_score_codex":0.000066404325,"about_ca_topic_score_gemma":0.00010338844,"teacher_disagreement_score":0.84490645,"about_ca_system_score_codex":0.00014607098,"about_ca_system_score_gemma":0.00008627276,"threshold_uncertainty_score":0.99966013},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033783389,0.00055187725,0.9935082,0.0000789767,0.0019139006,0.0002322895,0.0000046496884,0.000021433512,0.0003103375],"genre_scores_gemma":[0.66355985,0.00004306015,0.33585542,0.00006448736,0.00044370245,0.000003934723,0.00001563124,0.0000107873575,0.0000031142672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793714,0.00012534109,0.0010175039,0.00015502777,0.0004939391,0.00027104854],"domain_scores_gemma":[0.9949756,0.0017269386,0.0015385656,0.00030626412,0.0013432808,0.000109351444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033322233,0.00014541429,0.00035902543,0.00019480533,0.000073532814,0.00008950252,0.0015896944,0.000073083196,0.0000072131934],"category_scores_gemma":[0.00036751793,0.00013921254,0.00011745004,0.00031938602,0.000044223954,0.0002796979,0.00033343377,0.0002316401,0.0000010196512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008585237,0.00019998361,0.0007391943,0.000007909478,0.00022144624,0.0000014207582,0.00028498264,0.86373097,0.0000652522,0.01074794,0.0004088144,0.12350626],"study_design_scores_gemma":[0.00070088933,0.0000692212,0.007423117,0.00004644119,0.00003279621,0.00003981966,0.00001390496,0.99056613,0.0001918881,0.0002988016,0.00049212924,0.00012486544],"about_ca_topic_score_codex":0.000019530376,"about_ca_topic_score_gemma":0.0000027737824,"teacher_disagreement_score":0.6601815,"about_ca_system_score_codex":0.00010972735,"about_ca_system_score_gemma":0.000100077064,"threshold_uncertainty_score":0.5676923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04860345,0.000012763891,0.9499144,0.00018189468,0.000042347358,0.00027477197,6.177215e-8,0.00010377218,0.000866531],"genre_scores_gemma":[0.9067268,0.000004621352,0.09281616,0.00030915125,0.00003676006,0.000047153226,0.0000010466821,0.000009597309,0.000048713504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.00025447397,0.00020053101,0.0003644884,0.00013282306,0.00027253904],"domain_scores_gemma":[0.9988363,0.00070941204,0.000054204113,0.00028146376,0.00002300278,0.00009561208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012546093,0.00013677403,0.0001760878,0.00006199311,0.00004421281,0.00019147631,0.00019805196,0.00008019361,0.00000818609],"category_scores_gemma":[0.00003325852,0.000111766945,0.000018840443,0.00017976678,0.000071916234,0.00021693947,0.00010606764,0.0001615567,0.0000038345665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025921994,0.000052485855,0.0001927742,0.000018386967,0.000003365622,0.000005514164,0.0003193021,0.046433307,0.000006895438,0.55732036,0.00001541937,0.3956063],"study_design_scores_gemma":[0.0004397458,0.00014257018,0.0009675161,0.000064627915,0.0000030606586,0.0000041386484,0.000039581184,0.9910173,0.000027090115,0.007119377,0.000039495837,0.00013552565],"about_ca_topic_score_codex":0.0000039898555,"about_ca_topic_score_gemma":0.000011730949,"teacher_disagreement_score":0.94458395,"about_ca_system_score_codex":0.0000149442085,"about_ca_system_score_gemma":0.000014608793,"threshold_uncertainty_score":0.45577237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013198495,0.000003852748,0.9682183,0.00002578522,0.00011907655,0.030255573,0.0000010626887,0.0002543406,0.0009900093],"genre_scores_gemma":[0.48533043,7.298995e-7,0.20895942,0.00082645257,0.00016774405,0.30403456,0.0000037475277,0.000038462294,0.0006384628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998385,0.00007343592,0.00030161795,0.0005954994,0.0001447304,0.00049970497],"domain_scores_gemma":[0.99892837,0.0001234336,0.00016007276,0.0004936053,0.00014253349,0.00015199835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027541208,0.00022479298,0.00022212407,0.000051151328,0.00019685748,0.00012681623,0.0006393417,0.00013683687,0.00003167307],"category_scores_gemma":[0.00000866113,0.00019147106,0.00007211358,0.000245326,0.00006948772,0.000362606,0.000297081,0.00012720087,0.000002105404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025275414,0.0006398803,0.013003449,0.00011172307,0.0000728711,0.000029591396,0.0011024709,0.002273464,0.000044990156,0.17012405,0.0026849813,0.8096598],"study_design_scores_gemma":[0.0018035439,0.00014284637,0.0007141573,0.000060796396,0.000004484779,0.0000017698545,0.000027163887,0.9941589,0.001137581,0.00017545781,0.0015104398,0.00026284673],"about_ca_topic_score_codex":0.00014195732,"about_ca_topic_score_gemma":0.00012559208,"teacher_disagreement_score":0.9918854,"about_ca_system_score_codex":0.000040717106,"about_ca_system_score_gemma":0.00006622985,"threshold_uncertainty_score":0.78079635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1634861,0.000067110406,0.8348226,0.00017371055,0.00024912544,0.00013694627,1.6927004e-7,0.000097782795,0.00096647564],"genre_scores_gemma":[0.97506577,0.000008226234,0.023771083,0.0011092186,0.000019714187,0.0000147788905,0.0000032929058,0.0000049592104,0.0000029620467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998687,0.00003569905,0.00056947756,0.00015860662,0.00026366493,0.0002855471],"domain_scores_gemma":[0.9990543,0.000047254016,0.00043941074,0.00028990218,0.00011794165,0.00005115707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004449712,0.00013616875,0.00017643654,0.00050144695,0.00007294333,0.0002442673,0.0006187713,0.000071997,0.0000081981],"category_scores_gemma":[0.0000369345,0.0001278896,0.000035816756,0.001387657,0.00005946567,0.004750673,0.00016256118,0.00020252961,0.000012927137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001553148,0.00021663544,0.008782272,0.00067812175,0.000038175585,0.000019074048,0.053755492,0.13451804,0.0017746566,0.0124379145,0.0013713668,0.7862529],"study_design_scores_gemma":[0.00057605095,0.000053158783,0.0049014585,0.00043485046,0.000005052682,0.00001009059,0.00015707416,0.9881717,0.0048963325,0.00036250567,0.0001595126,0.00027219055],"about_ca_topic_score_codex":0.000050993105,"about_ca_topic_score_gemma":0.000006026021,"teacher_disagreement_score":0.85365367,"about_ca_system_score_codex":0.00006094568,"about_ca_system_score_gemma":0.000054084732,"threshold_uncertainty_score":0.5215186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6191683,0.00009839923,0.3784155,0.00057947496,0.0015056722,0.00009617402,1.3065043e-7,0.00003146536,0.00010491544],"genre_scores_gemma":[0.9850696,0.000054780452,0.013793279,0.00031427946,0.00071760395,9.3851867e-7,2.6311997e-7,0.000014583256,0.00003468553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977846,0.00030823224,0.0006932081,0.00016800607,0.0005681116,0.00047781243],"domain_scores_gemma":[0.99777824,0.00087552064,0.0005162904,0.00039285643,0.0003383572,0.000098721204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052338527,0.00016188229,0.00032502742,0.00008757731,0.00016079946,0.00015119533,0.0015397004,0.00015944375,0.000008954321],"category_scores_gemma":[0.00020170705,0.000118237906,0.00010748709,0.00053432677,0.000033962584,0.0005801155,0.0002898633,0.0015578645,0.000008557039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109475455,0.0006771063,0.21436277,0.000039551174,0.00026000256,0.00021969576,0.019619396,0.33626807,0.044843644,0.008762502,0.005427756,0.36941004],"study_design_scores_gemma":[0.00083236914,0.00004322998,0.026411174,0.0000858687,0.000011082603,0.0001233296,0.000090369926,0.97158486,0.00034559157,0.00015852366,0.00016380208,0.00014981152],"about_ca_topic_score_codex":0.00006482686,"about_ca_topic_score_gemma":0.00019417221,"teacher_disagreement_score":0.6353168,"about_ca_system_score_codex":0.0002431752,"about_ca_system_score_gemma":0.0001331925,"threshold_uncertainty_score":0.67682326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013436195,0.0007954974,0.9889573,0.000027186268,0.0013297235,0.00603797,7.9451917e-7,0.0005105349,0.0009973875],"genre_scores_gemma":[0.83855814,0.00014193657,0.15339358,0.0014127286,0.0013598916,0.0048855506,0.00002521539,0.00010505839,0.00011792735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540585,0.00075241434,0.0009047232,0.0012163448,0.00035026282,0.0013703869],"domain_scores_gemma":[0.99700487,0.00043873742,0.00033056864,0.0017723785,0.00015169701,0.0003017657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021585107,0.00049836753,0.0006228474,0.00017558891,0.00016715044,0.00036150002,0.0029114303,0.0003502345,0.00004013954],"category_scores_gemma":[0.000024401636,0.0005003495,0.00015436765,0.0016645587,0.00009660303,0.0007537184,0.0015909397,0.00091521064,0.000053826803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009921059,0.000390717,0.067482896,0.000018096818,0.000056464803,0.00027938985,0.0011700217,0.2457992,4.8894134e-7,0.006304508,0.010087059,0.66831195],"study_design_scores_gemma":[0.00070279243,0.00020477177,0.12628801,0.00022268448,0.0000029962368,0.00002618816,0.000002439706,0.86967343,0.0000023566283,0.00040698724,0.0019656774,0.00050168263],"about_ca_topic_score_codex":0.00006955867,"about_ca_topic_score_gemma":0.00043204127,"teacher_disagreement_score":0.83721447,"about_ca_system_score_codex":0.000121832185,"about_ca_system_score_gemma":0.000085900836,"threshold_uncertainty_score":0.99974483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013341703,0.0018155484,0.976456,0.00022786866,0.00077907834,0.0014588105,0.000002063766,0.00080987264,0.005109039],"genre_scores_gemma":[0.5356349,0.0000733508,0.46128348,0.0005436448,0.00026940487,0.00076133263,0.0000040264213,0.000050889386,0.001379012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698716,0.00010585793,0.0007304128,0.0008818361,0.0003047444,0.0009900025],"domain_scores_gemma":[0.9963641,0.0020527034,0.0003110514,0.0009202339,0.000146708,0.0002051841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006957649,0.0003597256,0.00043780723,0.000074373966,0.00039004674,0.00041872583,0.0012233704,0.0002019444,0.0002257353],"category_scores_gemma":[0.00028364646,0.0003464212,0.00017945922,0.0006223216,0.000048542384,0.0006866115,0.0006601288,0.00030227556,0.000036540718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015242222,0.0001289372,0.00003790931,0.000094173665,0.000049265735,0.00001523023,0.001441944,0.06007415,0.0008334674,0.0013885194,0.0059698136,0.92995137],"study_design_scores_gemma":[0.0008879297,0.00019757128,0.000028317547,0.00008647636,0.000010840131,0.00002976882,0.00012968328,0.99393463,0.00031583916,0.0003272311,0.00360497,0.00044675986],"about_ca_topic_score_codex":0.0000024204123,"about_ca_topic_score_gemma":0.00002906833,"teacher_disagreement_score":0.9338605,"about_ca_system_score_codex":0.000090766574,"about_ca_system_score_gemma":0.000015355174,"threshold_uncertainty_score":0.9998988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15535405,0.000019563062,0.8430837,0.0002104219,0.00032909514,0.00072392344,0.0000041534286,0.00016723617,0.00010785371],"genre_scores_gemma":[0.52256656,0.000008331636,0.47691023,0.0002357974,0.000101254824,0.00009414563,0.000019066438,0.00001476807,0.000049882052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984634,0.00006886513,0.00030118896,0.00047850958,0.00024015423,0.0004478614],"domain_scores_gemma":[0.9978907,0.00021548077,0.00019384976,0.0007084412,0.00084190926,0.00014963104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031386878,0.00020244636,0.00024259808,0.00011076222,0.00016405807,0.00033440793,0.00063705427,0.00016257541,0.000024427407],"category_scores_gemma":[0.00004932035,0.00015903558,0.00008216866,0.0012608536,0.00013263544,0.0012944094,0.00018057146,0.0002789758,0.0000036489985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070086506,0.0004302995,0.03332466,0.00003309565,0.00015809215,0.000003162756,0.0005181661,0.0027238769,0.004264523,0.92907685,0.0065523465,0.022844858],"study_design_scores_gemma":[0.0011009036,0.00021308735,0.0032383802,0.000031734027,0.0000102807035,0.0000031078112,0.000015165109,0.9842668,0.0015868086,0.00016111996,0.009091437,0.00028114353],"about_ca_topic_score_codex":0.000033169574,"about_ca_topic_score_gemma":0.0011991706,"teacher_disagreement_score":0.98154294,"about_ca_system_score_codex":0.000012346196,"about_ca_system_score_gemma":0.00010053705,"threshold_uncertainty_score":0.6485283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35982853,0.0009161072,0.6381026,0.000006361592,0.00015101534,0.0002524889,0.0000012546815,0.00010608627,0.00063555565],"genre_scores_gemma":[0.9251707,0.000041870866,0.07458768,0.000059830163,0.000048880363,0.00004535058,0.000005615218,0.000009353564,0.000030684998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979605,0.00024391928,0.00051170413,0.00044329357,0.00034895816,0.0004916369],"domain_scores_gemma":[0.9977675,0.0003863009,0.0002864323,0.0011033076,0.0002854209,0.00017105245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015931773,0.0001884133,0.00046594845,0.00023171912,0.00010431333,0.00005592072,0.0006003386,0.00013306268,0.00006877064],"category_scores_gemma":[0.00005200835,0.00017715436,0.00021909138,0.002445489,0.00007182527,0.0015504063,0.0003589963,0.00014219477,0.0000024295493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039636025,0.00021573584,0.007173452,0.000005914268,0.00015943938,3.9239842e-7,0.00023682798,0.95672435,0.00018401034,0.009052243,0.00005891584,0.026184756],"study_design_scores_gemma":[0.00013924907,0.00003605374,0.010946737,0.000006744397,0.00019651832,0.0000030533622,0.000017988621,0.9871253,0.00039598506,0.00089740986,0.000049840583,0.00018513977],"about_ca_topic_score_codex":0.000096502685,"about_ca_topic_score_gemma":0.00007557634,"teacher_disagreement_score":0.5653422,"about_ca_system_score_codex":0.00015446059,"about_ca_system_score_gemma":0.000049471295,"threshold_uncertainty_score":0.72241455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001106833,0.00009297715,0.9785,0.00003996355,0.00028047478,0.00032031443,2.5190252e-7,0.00047497908,0.019184206],"genre_scores_gemma":[0.31830424,0.000021777805,0.680052,0.00030809574,0.00020938109,0.00006240544,0.0000065474137,0.000015583995,0.001019993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984517,0.00009571822,0.00022484109,0.0005334932,0.00026048426,0.00043376378],"domain_scores_gemma":[0.9990515,0.00008141419,0.000096052616,0.0005639018,0.00008570304,0.00012143078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019504619,0.00018083962,0.0002060194,0.000052989086,0.0002781716,0.000074813106,0.00073565514,0.00011227818,0.000019723922],"category_scores_gemma":[0.00001071671,0.0001638158,0.00006209749,0.00069841294,0.00006294668,0.00047780076,0.00027307952,0.00019198962,0.000017333481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050946555,0.00008211518,0.0014635072,0.0000026323662,0.000018103532,0.000021735941,0.00085793,0.9778758,0.0000022318798,0.0135549465,0.0049614534,0.0011544221],"study_design_scores_gemma":[0.0003759994,0.000038117552,0.0010245543,0.000009794924,0.0000030542358,0.00007325655,0.000027614604,0.9979905,0.000035878038,0.000057297842,0.00015094208,0.0002129816],"about_ca_topic_score_codex":0.000020703688,"about_ca_topic_score_gemma":0.0000017997762,"teacher_disagreement_score":0.3171974,"about_ca_system_score_codex":0.00005162785,"about_ca_system_score_gemma":0.000070561655,"threshold_uncertainty_score":0.66802144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25265393,0.000017222797,0.7465131,0.00005387699,0.00011542238,0.00039073487,6.7373514e-7,0.00008503932,0.00016995211],"genre_scores_gemma":[0.84154034,0.0000035363296,0.15824531,0.000088794666,0.00006949086,0.000023094632,8.0566906e-7,0.000011651118,0.000016971906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866074,0.000024506067,0.0002739915,0.00043482333,0.0001271093,0.000478829],"domain_scores_gemma":[0.99896854,0.000514167,0.000058662514,0.00028818497,0.0000421388,0.00012832528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007458765,0.00013264014,0.00016564016,0.00012143479,0.00011687584,0.00012909129,0.00019953551,0.000102880906,0.00000383356],"category_scores_gemma":[0.0000987021,0.00012653269,0.00004013736,0.00027594203,0.00003886977,0.00039395853,0.00017660574,0.00013642506,0.000004590712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027453873,0.00029529267,0.018736128,0.00012845258,0.000049821698,0.0000923923,0.0010115814,0.0051391223,0.0755257,0.019646917,0.00015627022,0.8789438],"study_design_scores_gemma":[0.0008284618,0.000060755327,0.0038131787,0.000017468004,0.000005172526,0.000054741085,0.00004162103,0.9805242,0.013338846,0.00067737326,0.00047591978,0.00016230792],"about_ca_topic_score_codex":0.00011193478,"about_ca_topic_score_gemma":0.00073052105,"teacher_disagreement_score":0.975385,"about_ca_system_score_codex":0.00008289773,"about_ca_system_score_gemma":0.000013010509,"threshold_uncertainty_score":0.5159853},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009098583,0.0020168582,0.98565376,0.00038699707,0.00026530953,0.00024748643,4.7581754e-8,0.00018584027,0.002145115],"genre_scores_gemma":[0.96784955,0.000038763246,0.030734709,0.0010684265,0.000074182404,0.000021349679,0.000005355032,0.000009901758,0.00019776858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986316,0.000059047125,0.00030599962,0.00036634106,0.00026464672,0.00037239786],"domain_scores_gemma":[0.99889314,0.0002193327,0.00008402244,0.0006169407,0.00009371097,0.0000928726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010029029,0.00012581758,0.00012349502,0.00012893404,0.00005750711,0.00008818209,0.0005671449,0.00012050197,0.00003257633],"category_scores_gemma":[0.000028882061,0.00012147934,0.000037757105,0.0011645459,0.000028829101,0.00032505163,0.00007486217,0.00018569635,0.000043793676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012202691,0.00009426533,0.0035659424,0.000011621087,0.0000060060925,0.00006213602,0.00011413151,0.50818765,0.000027677326,0.021968942,0.00087709527,0.46507233],"study_design_scores_gemma":[0.00038767327,0.00003255519,0.012913046,0.00004993091,0.0000017558434,0.000002065097,0.000008772965,0.98208123,0.0005227031,0.0004772142,0.0033625488,0.00016050231],"about_ca_topic_score_codex":0.000022583206,"about_ca_topic_score_gemma":0.0005157536,"teacher_disagreement_score":0.95875096,"about_ca_system_score_codex":0.000106201565,"about_ca_system_score_gemma":0.00006880566,"threshold_uncertainty_score":0.49537835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008003174,0.00025187014,0.9834502,0.0012755961,0.00038008866,0.00026773207,1.2982221e-7,0.00023256142,0.0061386493],"genre_scores_gemma":[0.94754237,0.0000372996,0.050613325,0.001667697,0.00010441852,0.000018364357,0.0000012835939,0.000007126827,0.000008138805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667704,0.00038567864,0.0005202968,0.00085490005,0.00069261336,0.0008694476],"domain_scores_gemma":[0.99702096,0.0005516021,0.00011705544,0.0018445804,0.0001559107,0.0003099078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027153194,0.0002488418,0.00033657916,0.00025029256,0.00035045968,0.00047564163,0.0045255125,0.00010087473,0.000022065098],"category_scores_gemma":[0.000055695233,0.00021485792,0.00008984128,0.0024115192,0.0015084079,0.00044013056,0.00096847647,0.0003580238,0.000018015218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028457214,0.000098438424,0.000005365127,6.561101e-7,0.0000010776699,0.000008389899,0.00013852262,0.09346842,0.000034042667,0.7577004,0.000049119324,0.14846714],"study_design_scores_gemma":[0.0019403311,0.00014390839,0.0005861779,0.00005152766,0.00000229431,0.0000181501,0.0000013903664,0.9315739,0.00029447797,0.06497839,0.000161404,0.00024802497],"about_ca_topic_score_codex":0.0000065673835,"about_ca_topic_score_gemma":0.000003301154,"teacher_disagreement_score":0.9395392,"about_ca_system_score_codex":0.00013832713,"about_ca_system_score_gemma":0.000114711234,"threshold_uncertainty_score":0.87616515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31856436,0.00070613954,0.6756503,0.000049778253,0.00031021648,0.00019998306,6.133137e-7,0.00015782149,0.0043607806],"genre_scores_gemma":[0.9234939,0.00001657967,0.07608729,0.000070573864,0.00010736298,0.0000112159705,0.0000055672504,0.000008880836,0.00019858361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978319,0.00012205746,0.00067266345,0.00049134647,0.00031195543,0.00057010166],"domain_scores_gemma":[0.9985519,0.00045020116,0.00023198615,0.00060357124,0.000097178774,0.000065158354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069942215,0.00017425258,0.0004313991,0.00028479367,0.00007280592,0.00008301558,0.00065286236,0.00007882694,0.000060874037],"category_scores_gemma":[0.000036305868,0.00016356277,0.00017329359,0.003519504,0.000031075946,0.00028223146,0.00040783425,0.00016953748,0.000009232031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061337623,0.00008997514,0.049402665,0.0000068352037,0.00009089826,0.000021210855,0.00015083447,0.90945137,0.00015130527,0.007303472,0.00040315685,0.032922123],"study_design_scores_gemma":[0.00026718603,0.000023147171,0.02160833,0.000041888925,0.000074325944,0.000001006779,0.000025514015,0.97724485,0.0001566983,0.0001862545,0.00019630343,0.00017449656],"about_ca_topic_score_codex":0.00051341386,"about_ca_topic_score_gemma":0.0021133192,"teacher_disagreement_score":0.60492957,"about_ca_system_score_codex":0.00008965595,"about_ca_system_score_gemma":0.000040888022,"threshold_uncertainty_score":0.6669896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07588359,0.00027222603,0.92170775,0.000024907184,0.0016322761,0.00026411837,2.454514e-7,0.000050763596,0.00016413887],"genre_scores_gemma":[0.9546017,0.000022556047,0.044622056,0.000062665145,0.00066155195,0.0000033915408,3.335839e-7,0.000012997387,0.000012721129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982073,0.00009737674,0.0007472307,0.0003044334,0.00032919357,0.0003145142],"domain_scores_gemma":[0.99797,0.000345056,0.00076768216,0.00025597404,0.00053069374,0.0001305813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013733465,0.00018802113,0.00036106235,0.0001930675,0.00037272795,0.00024682266,0.0006854001,0.00008195343,0.0000035204337],"category_scores_gemma":[0.0000726012,0.00016206756,0.00013058908,0.00020054953,0.000044524106,0.00039223314,0.00028815522,0.00026880257,0.000010984959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012532627,0.000084759966,0.00012731995,0.000110053756,0.00007681284,0.000010180582,0.0014126773,0.006805,0.0017575523,0.04357076,0.000095833595,0.9458237],"study_design_scores_gemma":[0.00049411703,0.0013489758,0.00028296272,0.00062669173,0.00003414381,0.00017831453,0.00027105722,0.97429544,0.01404072,0.0072086686,0.0009995648,0.00021934895],"about_ca_topic_score_codex":0.0000065498616,"about_ca_topic_score_gemma":0.000020187388,"teacher_disagreement_score":0.96749043,"about_ca_system_score_codex":0.00013379831,"about_ca_system_score_gemma":0.000029078703,"threshold_uncertainty_score":0.6608923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4571454,0.000008591159,0.54146427,0.00020938992,0.00026298768,0.00018764836,4.9433686e-7,0.000082834405,0.00063842203],"genre_scores_gemma":[0.985674,0.000004960907,0.013400247,0.000673116,0.00006618324,0.00002350536,3.7777156e-7,0.000012909048,0.00014466372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883324,0.00006690466,0.00018864415,0.00034073432,0.0002510963,0.00031937324],"domain_scores_gemma":[0.9982228,0.00029240196,0.00011287925,0.001175897,0.00010731152,0.00008866223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028634758,0.00016356108,0.00017712354,0.000028618333,0.00010732383,0.00007168638,0.0011702378,0.00009395164,0.000056579847],"category_scores_gemma":[0.000015328791,0.000087875465,0.00005962993,0.00028084722,0.00018417275,0.00011370189,0.0001778682,0.00043259238,0.000016094336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121399586,0.0010495902,0.004881531,0.000027299791,0.00022745942,0.00011938685,0.0012756395,0.1605579,0.015497846,0.7259066,0.0033448052,0.08699056],"study_design_scores_gemma":[0.00024569719,0.00014759564,0.0007993094,0.00001788899,0.000003795605,0.00004423304,0.0000061722885,0.99248236,0.005720261,0.00021827914,0.0001630254,0.00015135302],"about_ca_topic_score_codex":0.00009745918,"about_ca_topic_score_gemma":0.00083785097,"teacher_disagreement_score":0.8319245,"about_ca_system_score_codex":0.000009033422,"about_ca_system_score_gemma":0.000024362971,"threshold_uncertainty_score":0.35834575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033004808,0.00021020713,0.9859701,0.00056530524,0.00091354776,0.0006201639,2.225654e-7,0.000317213,0.008102785],"genre_scores_gemma":[0.90449476,0.00000486395,0.092680566,0.0014744793,0.0008567188,0.00009309363,9.870456e-7,0.000007364605,0.00038716785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987537,0.000026598158,0.00019645148,0.000384453,0.00018792602,0.00045087285],"domain_scores_gemma":[0.9990466,0.00021474747,0.000044227105,0.0005215878,0.0000454011,0.00012741928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028425662,0.00012062624,0.00014873863,0.000036444777,0.000116899515,0.00013842704,0.00060143793,0.000065136235,0.000018772163],"category_scores_gemma":[0.000012884277,0.00010350518,0.000090939044,0.00027283095,0.000017519542,0.000080956444,0.00007727522,0.00010438791,0.00003625909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144545975,0.00019418883,0.00002861418,0.0000042874412,0.000011131317,0.0000118791595,0.00017223654,0.1492585,0.00014292906,0.3009891,0.023053633,0.52611905],"study_design_scores_gemma":[0.00028156574,0.00023932089,0.00010171641,0.000007780422,0.0000036248775,0.000014706428,0.0000042378174,0.94336206,0.00021626981,0.0022163081,0.053405322,0.00014707622],"about_ca_topic_score_codex":0.0000013030058,"about_ca_topic_score_gemma":7.789585e-7,"teacher_disagreement_score":0.9011943,"about_ca_system_score_codex":0.00005137268,"about_ca_system_score_gemma":0.000030325205,"threshold_uncertainty_score":0.4220819},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28982615,0.000045026376,0.7076535,0.00049019407,0.00022089799,0.0009300477,0.0000032616288,0.00008268505,0.0007482013],"genre_scores_gemma":[0.970004,0.0000013175281,0.028299881,0.0010815038,0.0003424659,0.00002567287,0.000012803044,0.000021632868,0.00021069135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977126,0.00022381006,0.00079949625,0.00049899553,0.0002835522,0.00048155762],"domain_scores_gemma":[0.9974072,0.0016225928,0.00036421634,0.0004203024,0.00010089332,0.000084814026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001298821,0.00022089845,0.00049840816,0.00019257369,0.00011751525,0.000104081526,0.0005692884,0.00009584508,0.000013037171],"category_scores_gemma":[0.00011726431,0.00021846453,0.00012131492,0.00023105876,0.000030718635,0.00033393718,0.0003068268,0.000196689,0.000033133943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023263691,0.00012388895,0.00014513901,0.00003958787,0.000025039311,0.000007728072,0.0023929717,0.89789003,0.00030817112,0.0025881175,0.0009638577,0.09528284],"study_design_scores_gemma":[0.007452804,0.00024254716,0.0002673465,0.00019132746,0.0000063649763,0.0000075399753,0.00002776516,0.9907735,0.00046716604,0.00016353773,0.0001897653,0.00021034954],"about_ca_topic_score_codex":0.000007507338,"about_ca_topic_score_gemma":0.000017113858,"teacher_disagreement_score":0.68017787,"about_ca_system_score_codex":0.00011145404,"about_ca_system_score_gemma":0.0000487468,"threshold_uncertainty_score":0.8908725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19899999,0.00027689006,0.7971615,0.0004410837,0.0015614064,0.00065675966,0.0000043360455,0.00058416964,0.00031382684],"genre_scores_gemma":[0.9840518,0.00063740567,0.013227278,0.0010625074,0.00053502084,0.00011001534,0.000009249011,0.00009895962,0.00026774788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945686,0.0004306301,0.00104766,0.0015171646,0.0007599665,0.0016759994],"domain_scores_gemma":[0.99534684,0.0010977482,0.00029355427,0.0026898726,0.000158675,0.00041329797],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00066095963,0.0007136679,0.0007372464,0.0005374499,0.00085308065,0.00020106006,0.001800078,0.0010025948,0.00008511452],"category_scores_gemma":[0.000027627973,0.00074296305,0.00046284538,0.0028730668,0.00028839524,0.00027637757,0.0000942641,0.0031697638,0.00006425377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000593839,0.00034897268,0.002703103,0.0000069074044,0.00006442016,0.00031509975,0.00026696132,0.9651822,0.000019234089,0.00031046767,0.00014642144,0.030576866],"study_design_scores_gemma":[0.0012550915,0.00014049062,0.011258898,0.00016996896,0.000030341653,0.00024063305,0.00004320223,0.9855744,0.00005028069,0.000045777917,0.0004206681,0.0007702436],"about_ca_topic_score_codex":0.00020828971,"about_ca_topic_score_gemma":0.00014917167,"teacher_disagreement_score":0.7850518,"about_ca_system_score_codex":0.00021175585,"about_ca_system_score_gemma":0.00007842782,"threshold_uncertainty_score":0.9995021},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06471473,0.0059571355,0.92444366,0.002542353,0.00060778164,0.00087849103,0.0000130872795,0.00032692114,0.0005158278],"genre_scores_gemma":[0.9650714,0.0033772876,0.029866016,0.00053279166,0.00011053111,0.00084626244,0.00005675844,0.00004546114,0.00009351515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997249,0.00041780458,0.00063395035,0.0006993891,0.00032227946,0.00067756936],"domain_scores_gemma":[0.9950984,0.000958796,0.00023826065,0.003292241,0.00018577286,0.00022650666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037331763,0.0003730853,0.00045436365,0.00023157208,0.0005105669,0.0006399166,0.002875206,0.00022318354,0.000023708188],"category_scores_gemma":[0.000018090817,0.0003859434,0.000108853164,0.00096411206,0.00046315524,0.0016830968,0.00081101136,0.000778337,0.000047736197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023585715,0.0014822285,0.01140561,0.00005577555,0.00012447692,0.000028968425,0.00080634654,0.017934555,0.0023318084,0.017175514,0.0009160516,0.9477151],"study_design_scores_gemma":[0.00063620997,0.000073462325,0.031388227,0.0001476948,0.000010738599,0.000028251186,0.000041292198,0.96594715,0.00006149448,0.00046806576,0.0007565715,0.0004408297],"about_ca_topic_score_codex":0.0003485841,"about_ca_topic_score_gemma":0.00088307785,"teacher_disagreement_score":0.9480126,"about_ca_system_score_codex":0.00025925142,"about_ca_system_score_gemma":0.00024030793,"threshold_uncertainty_score":0.9998593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127411,0.00003407183,0.9604016,0.00026719877,0.00080354075,0.00011753118,8.00224e-8,0.00037458574,0.025260272],"genre_scores_gemma":[0.8570072,0.000007672658,0.13977434,0.0015959761,0.00044754765,0.000004347472,8.0493584e-7,0.000022145561,0.001139933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984857,0.00009933624,0.0002211103,0.00042924428,0.00024238527,0.0005222526],"domain_scores_gemma":[0.9986736,0.00012889275,0.00008006263,0.0009183474,0.000063799394,0.0001352713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005057291,0.000149584,0.0001970253,0.000030646785,0.00018094064,0.000206817,0.0010019299,0.00008664368,0.00015499032],"category_scores_gemma":[0.00001642819,0.00013718252,0.00004530117,0.00067865907,0.00003203657,0.0003837801,0.00045728215,0.00014520467,0.00015633611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003455997,0.00004872659,0.0035106195,0.0000130904855,0.000028786757,0.000012884275,0.00020810698,0.08241318,0.0003666414,0.8072212,0.06750961,0.038663715],"study_design_scores_gemma":[0.00013949523,0.000028772594,0.00015150197,0.000020773254,0.0000044571725,0.00000812029,0.000008157278,0.98287714,0.0005641546,0.0072785676,0.008711739,0.00020711837],"about_ca_topic_score_codex":0.00006239242,"about_ca_topic_score_gemma":0.00006055535,"teacher_disagreement_score":0.90046394,"about_ca_system_score_codex":0.000043418608,"about_ca_system_score_gemma":0.00004301696,"threshold_uncertainty_score":0.5594141},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105109006,0.00009465164,0.88518655,0.00042409333,0.00058734656,0.00023475186,3.962778e-7,0.0002399658,0.008123265],"genre_scores_gemma":[0.9574265,0.000040863997,0.041457526,0.00089412014,0.0001253863,0.000013566922,6.7693225e-7,0.00001000257,0.00003134894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686253,0.00019781296,0.00038762123,0.0009578327,0.00064655615,0.0009476428],"domain_scores_gemma":[0.9981197,0.00027434342,0.000050246377,0.0011657404,0.000060303544,0.0003296546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018031297,0.00022948485,0.00026078857,0.00017375294,0.00023583538,0.0004836553,0.0028205349,0.00010097926,0.0012149642],"category_scores_gemma":[0.000022043841,0.00020340164,0.000064577966,0.0015774333,0.0023107019,0.00093590206,0.0005330227,0.0003987852,0.00040828722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012070411,0.00006430415,0.0006127513,0.0000018673746,0.0000017707456,0.00004075623,0.0002246759,0.011554316,0.000015318834,0.8853256,0.00023016101,0.1019164],"study_design_scores_gemma":[0.0003390368,0.00013262767,0.01170076,0.00003927324,0.0000013699181,0.00007032013,9.530884e-7,0.9508087,0.00008643256,0.036044553,0.00049655966,0.0002794209],"about_ca_topic_score_codex":0.0000028324664,"about_ca_topic_score_gemma":0.0000015601322,"teacher_disagreement_score":0.9392544,"about_ca_system_score_codex":0.00011137954,"about_ca_system_score_gemma":0.0000684191,"threshold_uncertainty_score":0.99969804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014085684,0.032146372,0.95050836,0.0020136174,0.00093184394,0.00011799188,0.000014786084,0.000019749295,0.00016158876],"genre_scores_gemma":[0.9381343,0.03773781,0.023268452,0.0002143863,0.00043510293,0.0000014004805,0.00019191903,0.000012458373,0.000004171361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821144,0.00017673269,0.00072973233,0.00033400097,0.00031615942,0.00023190318],"domain_scores_gemma":[0.995627,0.0011270948,0.00053420744,0.0022379784,0.0003855486,0.000088185545],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032731467,0.00014921401,0.00024958974,0.0002274429,0.00020863101,0.000511835,0.0077103926,0.00007121593,0.0000013947212],"category_scores_gemma":[0.00008636146,0.00014028611,0.00001438636,0.00045664332,0.00013572535,0.002849397,0.008455961,0.0006094981,2.0690392e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035626374,0.00008564167,0.006631602,0.000004097656,0.00009243027,0.000056947756,0.00035487095,0.0031238112,0.00002653537,0.0032698414,0.00016997533,0.9861486],"study_design_scores_gemma":[0.00058284425,0.000018029514,0.017671367,0.0006926364,0.000016630564,0.0003415965,0.00008468699,0.9534245,0.0000011078743,0.00028154225,0.026710594,0.00017447292],"about_ca_topic_score_codex":0.000034433637,"about_ca_topic_score_gemma":0.0010117147,"teacher_disagreement_score":0.98597413,"about_ca_system_score_codex":0.00005707878,"about_ca_system_score_gemma":0.00008918366,"threshold_uncertainty_score":0.99956346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07729551,0.00003497004,0.8952858,0.00035001122,0.0002870831,0.000268034,5.0773116e-7,0.0003805943,0.026097506],"genre_scores_gemma":[0.9663594,0.0000010138042,0.032385018,0.00018479861,0.00007770224,0.00001379387,0.0000020370003,0.000007776296,0.0009684598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988501,0.00004074317,0.00024333327,0.00034684868,0.00015542154,0.0003635653],"domain_scores_gemma":[0.999384,0.000085837346,0.00004244116,0.00041573143,0.000027273978,0.000044722558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017844111,0.00011204428,0.000117222495,0.00006155641,0.00004577121,0.00011077512,0.0005248585,0.00005985088,0.000055439774],"category_scores_gemma":[0.000007414529,0.00010241755,0.000029325314,0.00027346736,0.000018318253,0.00028422746,0.00022698904,0.00013156398,0.0002338748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012229714,0.0006642098,0.15792397,0.000033083732,0.00001376395,0.0008258326,0.0007928581,0.07294803,0.0016453331,0.50755656,0.009813727,0.24777043],"study_design_scores_gemma":[0.0003449696,0.000012361026,0.035363752,0.000013183606,5.997645e-7,0.0000085751835,0.000013539187,0.962479,0.0005092941,0.00045597294,0.00065158354,0.00014717542],"about_ca_topic_score_codex":0.0011344517,"about_ca_topic_score_gemma":0.0012482742,"teacher_disagreement_score":0.88953096,"about_ca_system_score_codex":0.000044827215,"about_ca_system_score_gemma":0.000017393695,"threshold_uncertainty_score":0.41764665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024014194,0.00019432935,0.97234726,0.0003257799,0.0009175918,0.00068802084,0.0000011639893,0.00028878252,0.0012228852],"genre_scores_gemma":[0.95849943,0.000051541025,0.04011039,0.0003495263,0.0006499767,0.00016033958,0.000009985972,0.000029376277,0.00013942615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746734,0.00015475626,0.0005150212,0.00074134994,0.00022556543,0.0008959634],"domain_scores_gemma":[0.99840593,0.00048959313,0.00018120473,0.000701685,0.00008206568,0.00013954286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001357851,0.0002842761,0.00040469432,0.00020656317,0.00017575151,0.00042128717,0.0010180129,0.00022202147,0.000017612976],"category_scores_gemma":[0.00008671455,0.00026782975,0.00021374162,0.00078856706,0.000037210106,0.0008373004,0.0003144343,0.000273213,0.0000095094665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013927765,0.00009569514,0.003085407,0.00004450273,0.00007554804,0.0000115742305,0.00020466311,0.2832901,0.000090337366,0.13941579,0.004116295,0.5694308],"study_design_scores_gemma":[0.0012497912,0.00039250107,0.0010027394,0.00008102727,0.000009120528,0.0000082836,0.00005155693,0.9834587,0.000026943113,0.009274993,0.0040638987,0.00038044597],"about_ca_topic_score_codex":0.000050443057,"about_ca_topic_score_gemma":0.0015176404,"teacher_disagreement_score":0.93448526,"about_ca_system_score_codex":0.000056250996,"about_ca_system_score_gemma":0.000052013183,"threshold_uncertainty_score":0.9999774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006819587,0.000043832046,0.98793596,0.00028792562,0.0030562307,0.00075049984,9.677041e-7,0.00020848971,0.00089649647],"genre_scores_gemma":[0.83435315,0.00002124896,0.16192523,0.0017017458,0.0018534438,0.00005471063,0.000003823531,0.000040504958,0.00004616641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973855,0.00021764907,0.00045251686,0.0006938804,0.00046509248,0.0007853732],"domain_scores_gemma":[0.9961999,0.0012397644,0.0003500753,0.0018374163,0.00018721442,0.00018564623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008351992,0.00040604587,0.00045350485,0.00005534104,0.0002827297,0.00024218208,0.002439533,0.000287013,0.00010733413],"category_scores_gemma":[0.000011312119,0.000259413,0.00009868577,0.0008359423,0.0005164746,0.00023921023,0.00052250887,0.001320766,0.000016238058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031245396,0.000032680382,0.0003198043,0.0000050939184,0.000053702126,0.000021572841,0.000082089224,0.6730146,0.000016647416,0.20569272,0.08067042,0.040059436],"study_design_scores_gemma":[0.00043970486,0.00027734015,0.00084282656,0.00014650854,0.000014381371,0.00007502305,0.0000027307467,0.9909744,0.0000666723,0.0051856698,0.0016488992,0.00032584203],"about_ca_topic_score_codex":0.00000435403,"about_ca_topic_score_gemma":0.000007201057,"teacher_disagreement_score":0.82753354,"about_ca_system_score_codex":0.000024248233,"about_ca_system_score_gemma":0.00014281127,"threshold_uncertainty_score":0.9999858},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95622474,0.003105352,0.03860948,0.000007913128,0.00030596615,0.0005322008,2.474221e-7,0.00003842745,0.0011756687],"genre_scores_gemma":[0.99850196,0.000119241915,0.0011026452,0.000022435188,0.000043434036,0.000072899384,4.821885e-7,0.0000073772967,0.00012951689],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99880666,0.00010275773,0.0003621463,0.00020183278,0.00021883762,0.00030776442],"domain_scores_gemma":[0.9989914,0.0001356742,0.00012160732,0.0006360603,0.000040826042,0.000074436146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002646579,0.00011957814,0.00029780483,0.00007780151,0.00001427308,0.000011242328,0.0005931447,0.000059498696,0.00005592949],"category_scores_gemma":[0.0000064204314,0.000091612426,0.000043307435,0.0003798539,0.000026135624,0.00020885984,0.0003853172,0.00012515062,0.0000054908796],"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.000053639633,0.008356561,0.59953076,0.00004752798,0.00011367123,0.000008934701,0.012049964,0.03878793,0.0001642751,0.0080502955,0.0015527713,0.3312837],"study_design_scores_gemma":[0.0036891284,0.0039503425,0.7125904,0.00014903168,0.000048967388,0.000010308408,0.0020928967,0.2723928,0.0016578307,0.00041890124,0.0022029309,0.0007964744],"about_ca_topic_score_codex":0.00001413355,"about_ca_topic_score_gemma":0.00020267432,"teacher_disagreement_score":0.33048722,"about_ca_system_score_codex":0.000022638224,"about_ca_system_score_gemma":0.000010774325,"threshold_uncertainty_score":0.37358463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057589646,0.00017461223,0.93835455,0.0006402805,0.0002863906,0.00045267193,0.000008300348,0.00027612582,0.0022173934],"genre_scores_gemma":[0.89687127,0.0000029250104,0.10141285,0.00026615104,0.00040698392,0.000110815425,0.000030497484,0.000018933975,0.0008795928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863714,0.000040981213,0.0002581005,0.000450798,0.00019926275,0.00041370397],"domain_scores_gemma":[0.99894536,0.00013333272,0.00009423864,0.0006618469,0.000086347194,0.000078856836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020192008,0.00015507593,0.00015877819,0.000045615612,0.00016067948,0.00016674394,0.000804868,0.00009202485,0.000011369402],"category_scores_gemma":[0.000013208607,0.0001605988,0.00008620373,0.00022760681,0.000040981307,0.00018080034,0.00018321155,0.00008659702,0.00007151799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007389891,0.00058034423,0.0013085041,0.00006448582,0.000055564222,0.00009238264,0.00042268776,0.1794103,0.0026037262,0.21695168,0.1299856,0.4684508],"study_design_scores_gemma":[0.0005937396,0.00008850003,0.0015636616,0.000015929905,0.000009974316,0.000052013904,0.000011986241,0.86814994,0.0019346365,0.0009587865,0.12633903,0.00028180884],"about_ca_topic_score_codex":0.00011195499,"about_ca_topic_score_gemma":0.00009451428,"teacher_disagreement_score":0.8392816,"about_ca_system_score_codex":0.00007686598,"about_ca_system_score_gemma":0.00004206439,"threshold_uncertainty_score":0.65490294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033405997,0.000015993906,0.99453735,0.001070193,0.00040467217,0.00051331293,0.0000014516551,0.0003690514,0.00275394],"genre_scores_gemma":[0.9311555,0.0000016937199,0.065581225,0.0026424348,0.0001666614,0.000036049158,0.0000071049603,0.00002464036,0.00038468157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982128,0.00012697902,0.00035486362,0.00052148104,0.00022392429,0.00055991864],"domain_scores_gemma":[0.9979979,0.0008788263,0.000122933,0.0006337933,0.00011451555,0.00025207107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008128382,0.00021207861,0.0002951647,0.00004531767,0.00020195026,0.00016474498,0.000661884,0.00013826447,0.00005374045],"category_scores_gemma":[0.00003718747,0.00017748411,0.00014367851,0.00017473627,0.000038730683,0.00016469468,0.00003989882,0.00015385753,0.000010599286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013202096,0.00019043086,0.00035892002,0.000047061065,0.000048744518,0.000018894241,0.00012970016,0.17248218,0.00083132106,0.33995047,0.006581851,0.4792284],"study_design_scores_gemma":[0.0013940668,0.00017640083,0.0000999026,0.000038949136,0.000012450853,0.0000038471126,0.000004643769,0.9891004,0.00010175057,0.0003751501,0.008443455,0.0002489604],"about_ca_topic_score_codex":0.0000075586136,"about_ca_topic_score_gemma":0.0000027373217,"teacher_disagreement_score":0.9308215,"about_ca_system_score_codex":0.00002944295,"about_ca_system_score_gemma":0.00006474374,"threshold_uncertainty_score":0.72375923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011623747,0.000014069742,0.924529,0.00025490252,0.0021316386,0.07112436,0.0000050018866,0.00039431042,0.001535055],"genre_scores_gemma":[0.13638458,0.00000974763,0.7356339,0.0032895613,0.0059199687,0.11801555,0.000019746256,0.00025755863,0.00046937887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929992,0.00006963397,0.0010372683,0.0029788301,0.0012383454,0.0016767452],"domain_scores_gemma":[0.99430877,0.0011836118,0.00081526156,0.0026963498,0.000609042,0.00038695903],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020429878,0.0010340721,0.0010291922,0.00048470567,0.0006706086,0.001194888,0.006495552,0.0011307105,0.000034153785],"category_scores_gemma":[0.00011859128,0.0009695458,0.00033659182,0.0008343305,0.000908528,0.0008726033,0.002576182,0.002673533,0.000018015357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005206591,0.00009640202,0.000018465431,0.00018445405,0.00003127656,0.000059047085,0.0013789689,0.0343475,0.000462614,0.08867813,0.00010116227,0.8745899],"study_design_scores_gemma":[0.00078254985,0.00024526252,0.000009414957,0.0006584197,0.000008332158,0.000039042156,1.0121026e-7,0.87539023,0.0032826043,0.11590962,0.002655474,0.0010189282],"about_ca_topic_score_codex":0.00001908176,"about_ca_topic_score_gemma":0.00030424778,"teacher_disagreement_score":0.873571,"about_ca_system_score_codex":0.00036719424,"about_ca_system_score_gemma":0.00091355445,"threshold_uncertainty_score":0.999842},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032968674,0.000517049,0.9663669,0.00030732524,0.0011481735,0.0019520067,0.00011785311,0.00041094318,0.029146781],"genre_scores_gemma":[0.28510123,0.0002598748,0.5943886,0.00773165,0.00487888,0.0065695127,0.024266878,0.000452733,0.07635063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968273,0.000017922399,0.0013749353,0.0006524706,0.0006853554,0.00044201987],"domain_scores_gemma":[0.9962451,0.00021313083,0.0013727047,0.00044518404,0.0015686227,0.00015526841],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073123886,0.0005647028,0.000419617,0.00041836934,0.00092257804,0.0038355086,0.0008909019,0.00054945756,0.000031437336],"category_scores_gemma":[0.000065273496,0.00062304013,0.00019047817,0.000089021254,0.00007896929,0.005681841,0.00015547809,0.0003652181,0.00001848942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002242757,0.00006916664,0.000019286792,0.0005059422,0.00009496786,0.0000014326558,0.00056250545,0.26044393,0.000039886225,0.11473413,0.009361629,0.61394286],"study_design_scores_gemma":[0.000931463,0.00017442567,0.0000103087505,0.0002710148,0.000018189921,0.000011685449,0.000018379194,0.741277,0.000071786446,0.0022677158,0.2544545,0.00049358123],"about_ca_topic_score_codex":0.000003099453,"about_ca_topic_score_gemma":0.000033835815,"teacher_disagreement_score":0.6134493,"about_ca_system_score_codex":0.0003265816,"about_ca_system_score_gemma":0.00031449503,"threshold_uncertainty_score":0.9996221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11541644,0.0016769952,0.86069095,0.013831449,0.0021570222,0.0014421715,0.0000042302977,0.00013933936,0.004641404],"genre_scores_gemma":[0.9909152,0.0041510793,0.0033824223,0.0007666763,0.00045942832,0.00018313632,0.0000040260065,0.000033176017,0.00010488676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766475,0.000527891,0.0007130857,0.00030831696,0.00028780737,0.0004981287],"domain_scores_gemma":[0.99311537,0.0031271128,0.0006721624,0.0026063866,0.00031076072,0.00016824187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011951568,0.00027655493,0.0003920371,0.00008613306,0.0009902633,0.00056776806,0.004365232,0.00012813912,0.000025388563],"category_scores_gemma":[0.000041436608,0.00019609806,0.00016608894,0.00046764218,0.0002494104,0.00041397024,0.0010517865,0.00087136327,0.000008568529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041977073,0.00017801867,0.0006840733,0.000011508888,0.00012313269,0.0000021161609,0.0006789723,0.00135639,0.000058635414,0.60913384,0.008751746,0.37897956],"study_design_scores_gemma":[0.00061648816,0.0002504531,0.0003128715,0.00079077977,0.000018767128,0.00007743347,0.00008434933,0.96397996,0.000048230693,0.030884951,0.0026546048,0.00028114047],"about_ca_topic_score_codex":0.000013874192,"about_ca_topic_score_gemma":0.0000113225415,"teacher_disagreement_score":0.96262354,"about_ca_system_score_codex":0.000054483397,"about_ca_system_score_gemma":0.00004394379,"threshold_uncertainty_score":0.81117594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038134918,0.00001157393,0.90549904,0.00033119298,0.000061020077,0.09290015,5.3558506e-7,0.00004904393,0.0007661178],"genre_scores_gemma":[0.6829651,0.0000010191317,0.04772756,0.0005852614,0.00008105267,0.2667566,0.0000034306076,0.00001132703,0.0018686752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904567,0.000023924282,0.00027869584,0.00029597577,0.00016619313,0.000189548],"domain_scores_gemma":[0.9992537,0.00007167676,0.000115566116,0.00038836795,0.000117985364,0.000052714488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016946314,0.00010909764,0.00015281554,0.000036765767,0.00004644442,0.00007599646,0.0003429246,0.000038136477,0.000007666303],"category_scores_gemma":[0.000020227231,0.000086108485,0.000028053648,0.00020138752,0.000028284518,0.0005546741,0.00007494764,0.000039005547,8.9884355e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002543978,0.0011119267,0.001691079,0.00076140347,0.000048890954,0.000004586226,0.0008399445,0.026382977,0.0017755284,0.23178695,0.020069648,0.71527267],"study_design_scores_gemma":[0.0035912641,0.001886835,0.006130741,0.00038091536,0.000010909662,0.000013419715,0.000039488088,0.8859568,0.07436842,0.01987851,0.0072332835,0.0005093973],"about_ca_topic_score_codex":0.000009154737,"about_ca_topic_score_gemma":0.000015237845,"teacher_disagreement_score":0.85957384,"about_ca_system_score_codex":0.000024693392,"about_ca_system_score_gemma":0.00007267635,"threshold_uncertainty_score":0.35114023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37474373,0.0001939849,0.5947193,0.004925756,0.00048536484,0.0004984332,0.000007021059,0.00032342237,0.02410298],"genre_scores_gemma":[0.98440343,0.00014006306,0.014199295,0.0009807515,0.00009229165,0.000039341587,0.000046331283,0.000015051385,0.00008344595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983059,0.000101684185,0.00045073553,0.0004248349,0.0004009869,0.0003158352],"domain_scores_gemma":[0.99826777,0.00015131179,0.00027115128,0.0009342122,0.00028932557,0.00008623168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038975064,0.00023727202,0.00020545167,0.0003144297,0.00036647834,0.000308041,0.0015028159,0.00009059292,0.00003544046],"category_scores_gemma":[0.0000066417356,0.00022710914,0.000042507196,0.0003616067,0.00010647162,0.00065918156,0.00022299356,0.00046272267,0.000040161005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041166737,0.0011496453,0.05340085,0.000055999273,0.00018612089,0.000015371841,0.0022081698,0.107530355,0.00023755524,0.4097782,0.0011623929,0.42386368],"study_design_scores_gemma":[0.00095613545,0.00023954386,0.011785488,0.0004264548,0.0000065995555,0.000025105668,0.00006052147,0.98394275,0.00013118928,0.00027956537,0.0018741098,0.0002725433],"about_ca_topic_score_codex":0.000040504114,"about_ca_topic_score_gemma":0.00011904899,"teacher_disagreement_score":0.8764124,"about_ca_system_score_codex":0.00021255511,"about_ca_system_score_gemma":0.00016685746,"threshold_uncertainty_score":0.92612416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067360744,0.0043929215,0.9206849,0.00006774384,0.00075624284,0.002463648,0.000011392064,0.0004411894,0.003821219],"genre_scores_gemma":[0.99652016,0.00016241519,0.0011493496,0.00010974846,0.00009126337,0.0017389007,0.00013799148,0.000011608396,0.00007856517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978534,0.00012520833,0.00095365127,0.00030794623,0.00037520548,0.00038459155],"domain_scores_gemma":[0.9984713,0.00017170154,0.00042352043,0.0007025663,0.0001515568,0.00007932019],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00081544125,0.00023274613,0.00028358345,0.00026967507,0.00012888339,0.0011524239,0.00046595346,0.0001821482,0.0000061199844],"category_scores_gemma":[0.000009638327,0.00022428976,0.00004605919,0.0006742066,0.000049354647,0.004109839,0.00014162275,0.00019998451,0.000047418358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017063016,0.00004320791,0.00041700967,0.00011218821,0.0000050208746,0.0000035403227,0.00061181013,0.92049396,0.000021546182,0.009160704,0.004651531,0.0644624],"study_design_scores_gemma":[0.00050025026,0.00009540791,0.0012220221,0.0001250161,0.0000029378189,0.000018690958,0.00043716308,0.9008917,0.00003773923,0.00007413892,0.09634709,0.00024782334],"about_ca_topic_score_codex":0.00006108671,"about_ca_topic_score_gemma":0.000052017484,"teacher_disagreement_score":0.9291594,"about_ca_system_score_codex":0.00013250891,"about_ca_system_score_gemma":0.00006470094,"threshold_uncertainty_score":0.9998845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023614213,0.000951472,0.95834726,0.0048352666,0.00069966866,0.0009612104,0.00003165712,0.0007625393,0.009796736],"genre_scores_gemma":[0.92995507,0.00015329073,0.06718793,0.00026272913,0.0001482834,0.00033813453,0.00017891437,0.00002547122,0.001750212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987139,0.00010936868,0.0003790013,0.00031373874,0.00016577456,0.0003182173],"domain_scores_gemma":[0.99546546,0.00029441193,0.00017422003,0.0037676932,0.00023366834,0.00006456868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020753106,0.00017657281,0.00021826518,0.000092810544,0.00031568334,0.00019742787,0.0038363712,0.00008316072,0.000015621965],"category_scores_gemma":[0.000004126683,0.00017727906,0.00009150774,0.00052919093,0.000091576774,0.00037683634,0.0005914508,0.00016519727,0.00017191305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030370491,0.0018194832,0.0020375773,0.00019248207,0.00014259342,0.0000040729046,0.0004241103,0.0010044989,0.028463012,0.81005347,0.0924781,0.06335025],"study_design_scores_gemma":[0.0010600789,0.00006409386,0.009098682,0.0000717926,0.00003365305,0.000010159664,0.0000085369775,0.87802404,0.0014572482,0.013122979,0.096629776,0.00041894693],"about_ca_topic_score_codex":0.0000714947,"about_ca_topic_score_gemma":0.00080858986,"teacher_disagreement_score":0.90634084,"about_ca_system_score_codex":0.000044275883,"about_ca_system_score_gemma":0.00003246087,"threshold_uncertainty_score":0.722923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009255166,0.0004931014,0.9856978,0.0014524757,0.00092773983,0.010197947,0.00009041677,0.00012336115,0.000091627204],"genre_scores_gemma":[0.9699263,0.00014513025,0.0024677452,0.00014413022,0.0010398742,0.025518702,0.000057667603,0.000018274279,0.0006821808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985465,0.0002230194,0.00038008543,0.00039381234,0.00014982044,0.0003067719],"domain_scores_gemma":[0.9989097,0.00020052533,0.00012321745,0.00059843145,0.00006828459,0.00009985036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003668149,0.00018838832,0.00025557668,0.000047359797,0.0008604096,0.00023757498,0.00035509825,0.0001561989,0.0000047491653],"category_scores_gemma":[0.000003709597,0.00014798206,0.00006187447,0.0003025846,0.00008444092,0.00018856776,0.000011721715,0.00019665781,0.0000028916795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026258192,0.00015741591,0.000012414174,0.00003187927,0.00003358849,8.8680173e-7,0.00018040887,0.9581372,0.000020802234,0.0047834404,0.028374597,0.008004788],"study_design_scores_gemma":[0.0014427619,0.0005156613,0.00014918022,0.000085538326,0.000024968667,0.00004880109,0.000077126126,0.51664746,0.0000260361,0.0002920447,0.48045385,0.00023659402],"about_ca_topic_score_codex":0.00011081377,"about_ca_topic_score_gemma":0.00062596897,"teacher_disagreement_score":0.98323005,"about_ca_system_score_codex":0.00006590334,"about_ca_system_score_gemma":0.000029530245,"threshold_uncertainty_score":0.6617662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1881277,0.0021068007,0.63151515,0.039814666,0.005420192,0.094223954,0.000012534121,0.0013327574,0.037446268],"genre_scores_gemma":[0.971308,0.00011750916,0.023022952,0.0006917208,0.00032435107,0.0044879443,0.000005703869,0.000022613161,0.000019230321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981889,0.00037603892,0.00054080406,0.00028054652,0.00026667453,0.0003470408],"domain_scores_gemma":[0.9972608,0.00061557454,0.00039031997,0.0014613414,0.000107578315,0.00016438586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011153967,0.00019245519,0.00022332944,0.00018484892,0.00059767836,0.0005408067,0.00175315,0.000116457166,0.000008568175],"category_scores_gemma":[0.000016649074,0.00017710068,0.000062100095,0.00059089623,0.00010737245,0.00036257645,0.00032618543,0.0016741334,0.0000050110625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005979837,0.0004081284,0.035323326,0.000023341523,0.000029471184,0.00008709789,0.0008595758,0.00574576,0.0002485395,0.057318885,0.00060435437,0.8992917],"study_design_scores_gemma":[0.0010539511,0.00012673948,0.0065205097,0.00030466772,0.0000047259587,0.00015537483,0.000015905975,0.87829924,0.000025888714,0.002547537,0.11068731,0.00025817868],"about_ca_topic_score_codex":0.000007860961,"about_ca_topic_score_gemma":0.00025045045,"teacher_disagreement_score":0.89903355,"about_ca_system_score_codex":0.000054161625,"about_ca_system_score_gemma":0.00012750384,"threshold_uncertainty_score":0.72733694},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027616316,0.000029526616,0.8766795,0.00009300492,0.0002921421,0.11588611,0.0000012540925,0.00064917596,0.0060931626],"genre_scores_gemma":[0.028493278,0.0000113867645,0.39167443,0.00053136324,0.000415588,0.571686,0.0000065656013,0.00006356377,0.0071177725],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687064,0.00006933047,0.0006016237,0.0009319524,0.00041542368,0.0011110049],"domain_scores_gemma":[0.997648,0.00041723615,0.00017260006,0.0011357036,0.00029482867,0.00033161443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005436348,0.00032257676,0.00037888644,0.000069166344,0.0005867615,0.00016602648,0.0009471744,0.00022629257,0.00014132829],"category_scores_gemma":[0.00012472611,0.00027658802,0.000154333,0.00074114173,0.00012342735,0.0008013582,0.0005158365,0.0003922415,0.000106290776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009535272,0.004009406,0.008684573,0.00025448046,0.0002025447,0.00020156417,0.0016298871,0.17158967,0.00040373855,0.07541423,0.55733186,0.17932451],"study_design_scores_gemma":[0.0015623802,0.00040430686,0.000091540096,0.000042886808,0.000004530292,0.00006074791,0.000020034595,0.73745996,0.00041027233,0.00008761793,0.2595697,0.0002860065],"about_ca_topic_score_codex":0.000015864474,"about_ca_topic_score_gemma":0.000010652514,"teacher_disagreement_score":0.5658703,"about_ca_system_score_codex":0.00015018255,"about_ca_system_score_gemma":0.00016384109,"threshold_uncertainty_score":0.99996865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58247083,0.0014816482,0.41515434,0.00019313725,0.00011840923,0.00022955258,0.000004116526,0.00028393138,0.00006403032],"genre_scores_gemma":[0.99646777,0.0003047403,0.0029191826,0.000058848225,0.00002218008,0.00014305163,0.000007469846,0.000014495212,0.00006226106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977549,0.00015699,0.00048248566,0.00087386405,0.00021092597,0.0005208901],"domain_scores_gemma":[0.9977671,0.00020022619,0.00035382537,0.0013073265,0.00029729554,0.000074248135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048235233,0.00030101067,0.0007754301,0.00073988124,0.00013258147,0.000081690036,0.0011644852,0.0005140026,0.000016192913],"category_scores_gemma":[0.000022644337,0.00029459933,0.00014315563,0.0034498342,0.0005994585,0.00025060945,0.0003584458,0.00045558732,0.000005907371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059178616,0.00075053214,0.06778718,0.000085618834,0.0021195142,0.00037616765,0.00025734107,0.23169567,0.082849585,0.25023338,0.0005882129,0.36319762],"study_design_scores_gemma":[0.0004015273,0.00018439397,0.013735448,0.000037738937,0.00025192776,0.000018603376,0.000027352486,0.97023827,0.010333505,0.0037913462,0.0006026008,0.00037727467],"about_ca_topic_score_codex":0.00008108892,"about_ca_topic_score_gemma":0.00053788675,"teacher_disagreement_score":0.7385426,"about_ca_system_score_codex":0.000039394774,"about_ca_system_score_gemma":0.00008290784,"threshold_uncertainty_score":0.9999506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1823722,0.0007319286,0.81443053,0.00000793211,0.0008950479,0.0007091064,3.235251e-7,0.00028256176,0.00057039683],"genre_scores_gemma":[0.9805522,0.000088447385,0.018711835,0.000061631305,0.00019452922,0.00024948822,0.0000018635959,0.000019308542,0.00012067625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833804,0.00003664169,0.00040977926,0.0004920063,0.00017809164,0.0005454129],"domain_scores_gemma":[0.9990367,0.00021976957,0.000113940914,0.0004909427,0.000051881336,0.000086709166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007756594,0.00017530195,0.00021916463,0.00013024824,0.00011900344,0.00012626032,0.000486555,0.00014305848,0.000004143026],"category_scores_gemma":[0.000012821226,0.00016043772,0.00007312681,0.00052030594,0.000019216757,0.0004561604,0.000230496,0.00016282941,0.000008800702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007786671,0.00004256754,0.000074978445,0.000053737727,0.000007722828,0.000010945927,0.0003608019,0.09329348,0.015033452,0.0023511148,0.000019378032,0.88867396],"study_design_scores_gemma":[0.00075471407,0.00025097752,0.0008278709,0.00014630842,0.000004654754,0.000019292862,0.00027766003,0.9100426,0.085893124,0.000112149355,0.0013442099,0.00032642725],"about_ca_topic_score_codex":0.000027402217,"about_ca_topic_score_gemma":0.0013017028,"teacher_disagreement_score":0.8883475,"about_ca_system_score_codex":0.0002795793,"about_ca_system_score_gemma":0.000016519065,"threshold_uncertainty_score":0.654246},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00803333,0.00012405169,0.98199445,0.0003038042,0.00012581701,0.00013714348,7.709706e-8,0.00023306522,0.009048246],"genre_scores_gemma":[0.9664842,0.00006759353,0.032261975,0.00048004827,0.00009196805,0.0000051018665,0.0000012556836,0.000007234126,0.00060066325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986686,0.000035263183,0.0002367561,0.0004330674,0.00020615905,0.0004201248],"domain_scores_gemma":[0.99906486,0.00012503823,0.00006303399,0.0005540964,0.0000432423,0.0001497495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008458373,0.00012817011,0.00021070735,0.00019847295,0.00010781508,0.00020779189,0.0005136914,0.000066787135,0.000032147756],"category_scores_gemma":[0.0000036904892,0.000109252134,0.000068868365,0.0016102212,0.000045405788,0.00032536403,0.00034322613,0.00013012199,0.000008045274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050871645,0.000030245046,0.019493325,0.0000069190696,0.00028363673,0.000074815856,0.00016602871,0.002569356,0.00004166315,0.29429734,0.0007214673,0.6823101],"study_design_scores_gemma":[0.00009818672,0.000017922399,0.008048247,0.000005201915,0.000055320183,0.000007855169,0.000016879063,0.9896504,0.00023393135,0.0014215426,0.0002799151,0.00016454687],"about_ca_topic_score_codex":0.00006768575,"about_ca_topic_score_gemma":0.0003136238,"teacher_disagreement_score":0.9870811,"about_ca_system_score_codex":0.000021994065,"about_ca_system_score_gemma":0.00001031858,"threshold_uncertainty_score":0.44551727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08032997,0.000012172576,0.91500956,0.00029893368,0.00042947725,0.000662575,0.0000012757645,0.00015621739,0.0030998427],"genre_scores_gemma":[0.97572714,5.0654967e-7,0.023615975,0.00015824675,0.00008568263,0.00011009278,0.000004357017,0.000011983481,0.00028603297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985892,0.00003027817,0.00029868894,0.00046534534,0.0001910974,0.00042535944],"domain_scores_gemma":[0.99882716,0.00028257637,0.000072890754,0.000606643,0.00011209686,0.000098638026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004816669,0.00014315163,0.00014883028,0.00007648842,0.00008607908,0.00017127501,0.0007244306,0.00010035284,0.0000560611],"category_scores_gemma":[0.000060943323,0.00012967856,0.0000405409,0.00038766282,0.00003200291,0.00016747275,0.0001749359,0.00024109814,0.000040725914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018148205,0.0004979683,0.0023556766,0.00007476265,0.000018021112,0.000040554736,0.0013347957,0.3369713,0.0027186733,0.5408304,0.0010054786,0.11413423],"study_design_scores_gemma":[0.00045237286,0.0000397283,0.0037200022,0.000018066547,0.0000020495374,0.000007442348,0.000058925532,0.9941773,0.0007967068,0.00029662167,0.00026429974,0.00016651423],"about_ca_topic_score_codex":0.00008840319,"about_ca_topic_score_gemma":0.0009923712,"teacher_disagreement_score":0.8953971,"about_ca_system_score_codex":0.000030750383,"about_ca_system_score_gemma":0.00008435731,"threshold_uncertainty_score":0.52881384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017367557,0.0018354537,0.9627963,0.0008571807,0.0077481875,0.0011805756,0.0000031187087,0.0005556821,0.007655972],"genre_scores_gemma":[0.83334434,0.0014593544,0.15552329,0.003622721,0.0019590408,0.0007882041,0.00012847137,0.00013383797,0.003040774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995824,0.00016334582,0.0008466837,0.0016113188,0.00058551785,0.0009691412],"domain_scores_gemma":[0.9959644,0.00013676683,0.00028522595,0.0031752107,0.00013810892,0.00030027246],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010602417,0.0005938858,0.0007443052,0.0002160623,0.000075710304,0.00046324928,0.0037785445,0.0012865147,0.00044431374],"category_scores_gemma":[0.000020924426,0.0005517778,0.00028731034,0.00041796546,0.00007985628,0.0002758195,0.0046949154,0.0036191158,0.00016979473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021193096,0.00026793967,0.0009172455,0.00007622289,0.000084705,0.0014425911,0.0005539517,0.68752843,0.000031184987,0.012394525,0.026339022,0.27034298],"study_design_scores_gemma":[0.0003547543,0.000057641435,0.0012232502,0.00009955608,0.000009599976,0.000060360202,0.0000041068492,0.93297195,0.000045252193,0.0016525919,0.06281676,0.00070415484],"about_ca_topic_score_codex":0.00008868577,"about_ca_topic_score_gemma":0.0012723667,"teacher_disagreement_score":0.81597674,"about_ca_system_score_codex":0.00012812496,"about_ca_system_score_gemma":0.00038753983,"threshold_uncertainty_score":0.9996934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20145606,0.000061905346,0.7746031,0.000013461197,0.00046746762,0.00007981942,1.1169062e-7,0.0001998802,0.023118185],"genre_scores_gemma":[0.89981097,0.000001564758,0.09950387,0.00036696848,0.00008157486,0.0000046431946,2.4951098e-7,0.0000089742525,0.00022117993],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990458,0.00003524384,0.00015953116,0.00024267279,0.00014794168,0.00036883575],"domain_scores_gemma":[0.99932486,0.00003265386,0.000056356595,0.0004416774,0.000033104534,0.00011134792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020641915,0.00010729467,0.000120274046,0.000057664096,0.00008330672,0.00005995141,0.0006306638,0.000056525354,0.000060710376],"category_scores_gemma":[0.000005802156,0.00009384736,0.000037271646,0.0002666711,0.000028084767,0.0005785441,0.00030795636,0.00011809596,0.000056406276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041404306,0.00047142876,0.4340003,0.00004308706,0.00013739109,0.0004414191,0.01664481,0.0004672605,0.0057373135,0.4319029,0.007879616,0.102233075],"study_design_scores_gemma":[0.00037690872,0.0000809515,0.02318181,0.000087880566,0.000007927632,0.00013308965,0.00014801993,0.96477944,0.007673979,0.0013256787,0.0017049254,0.00049940404],"about_ca_topic_score_codex":0.000127659,"about_ca_topic_score_gemma":0.0000051038423,"teacher_disagreement_score":0.9643122,"about_ca_system_score_codex":0.000023348846,"about_ca_system_score_gemma":0.000030090605,"threshold_uncertainty_score":0.38269845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44237712,0.0000021549017,0.55438745,0.0018985833,0.00032325412,0.0002297097,4.5034142e-7,0.00012049179,0.00066078914],"genre_scores_gemma":[0.96674025,0.000015406104,0.03267407,0.00048990437,0.00002449484,0.0000430257,0.0000010061033,0.000002159908,0.000009692091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983398,0.0000023084476,0.0004504151,0.00025699096,0.00072542287,0.00022507475],"domain_scores_gemma":[0.99806875,0.000025421623,0.00047658733,0.00018640271,0.0011949871,0.0000478738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004799482,0.00011893985,0.000117283336,0.00046312352,0.00035926214,0.00014102248,0.0023037903,0.00007711891,0.0000013680051],"category_scores_gemma":[0.00009364382,0.000093304596,0.000021329985,0.00079669687,0.00049436,0.0032882453,0.0009789126,0.0001720183,0.000015383026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000510064,0.00003501638,0.002493715,0.000006972201,0.0000061205124,1.0631724e-7,0.0009089764,0.0000708962,0.006581759,0.37986806,0.00007289277,0.60995036],"study_design_scores_gemma":[0.00026503377,0.000095186704,0.009397301,0.000050611925,0.0000012916755,0.000078005905,0.00007982125,0.85499495,0.1301912,0.001916545,0.0027783036,0.00015175804],"about_ca_topic_score_codex":0.0000053731374,"about_ca_topic_score_gemma":5.311337e-7,"teacher_disagreement_score":0.854924,"about_ca_system_score_codex":0.00013131418,"about_ca_system_score_gemma":0.00020551732,"threshold_uncertainty_score":0.42810538},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4555229,0.00022444465,0.54326856,0.000016021035,0.00027709603,0.00018383353,5.697226e-8,0.00004666165,0.00046042277],"genre_scores_gemma":[0.98048353,0.00012561903,0.0192018,0.000018598654,0.000042295243,0.00003565767,3.867541e-7,0.00000429923,0.00008778602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992966,0.0000402394,0.00020873244,0.00021567488,0.00008454534,0.00015418653],"domain_scores_gemma":[0.99948984,0.00007710771,0.000079440906,0.00028196038,0.000029418516,0.00004222004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036326368,0.000066404544,0.000100224424,0.000065226326,0.00004695966,0.00003540023,0.00019652133,0.00008981331,0.00002492641],"category_scores_gemma":[0.00002086425,0.00006199615,0.000024090956,0.0003229692,0.000027935683,0.0002729578,0.0002139633,0.0002358245,0.0000017597459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029995754,0.000026143985,0.00096144713,0.0000030520373,0.0000021173983,7.7566136e-7,0.00014776563,0.002015624,0.004761606,0.0027757264,0.000011514529,0.98929125],"study_design_scores_gemma":[0.00029523775,0.00014491683,0.017111303,0.00002787263,0.0000028856998,0.000012298497,0.000035536785,0.97688335,0.00218237,0.002333344,0.0008582686,0.00011264368],"about_ca_topic_score_codex":0.000013404167,"about_ca_topic_score_gemma":0.0015606318,"teacher_disagreement_score":0.9891786,"about_ca_system_score_codex":0.000010166857,"about_ca_system_score_gemma":0.000014007844,"threshold_uncertainty_score":0.25281295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006839206,0.0016568856,0.9768161,0.0036954556,0.0006240964,0.00033529976,0.000018289913,0.00026033868,0.015909597],"genre_scores_gemma":[0.9134732,0.00031801237,0.084146805,0.00026712043,0.00020515468,0.00008647689,0.00032689312,0.000016794387,0.0011595319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856377,0.00027702202,0.00031263198,0.00029267385,0.0002146597,0.00033922624],"domain_scores_gemma":[0.99023056,0.00047278116,0.00013518117,0.008844707,0.00017270521,0.00014408979],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071517465,0.00015542799,0.0001608857,0.00008215325,0.00030768252,0.00012918744,0.006593655,0.00006685861,0.00004214265],"category_scores_gemma":[0.00006857815,0.00015212351,0.000029399425,0.0006558857,0.00012850565,0.0020501507,0.0022413398,0.00028451017,0.0008678008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010153397,0.0018078772,0.0051908167,0.000018394381,0.00014425989,0.000003948584,0.004194403,0.0006604747,0.014965748,0.11078151,0.39466247,0.46755996],"study_design_scores_gemma":[0.00019545623,0.000031041935,0.005571874,0.00003610856,0.000022179085,0.000036125595,0.000022008739,0.79940456,0.0006167227,0.00042557396,0.19332631,0.00031204382],"about_ca_topic_score_codex":0.000015570251,"about_ca_topic_score_gemma":0.0001464065,"teacher_disagreement_score":0.9127893,"about_ca_system_score_codex":0.000065848035,"about_ca_system_score_gemma":0.000042698866,"threshold_uncertainty_score":0.9999101},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012096501,0.00007855071,0.98549265,0.00035437968,0.0003821658,0.00051657273,0.000002132285,0.00069752056,0.0003795024],"genre_scores_gemma":[0.9215114,0.00003228531,0.07783314,0.00038067275,0.000013591044,0.00013024606,6.7272265e-7,0.000031861888,0.00006610361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981697,0.000079866244,0.00034160682,0.0006665015,0.00020606956,0.00053620845],"domain_scores_gemma":[0.99860823,0.000051682255,0.00011043968,0.0010440412,0.000116518815,0.000069069916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018604306,0.0002702661,0.00030699003,0.00042209713,0.00015580161,0.00005815197,0.0007384032,0.00051814044,0.00011949689],"category_scores_gemma":[0.0000032346886,0.00024167467,0.00007968166,0.0013787188,0.00023608428,0.00039423662,0.000005773804,0.0007305928,0.000036683476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006234914,0.00023048648,0.00040245126,0.0000024202432,0.000048927483,0.000130449,0.00011923255,0.99266803,0.00008582726,0.0014639918,0.000011964126,0.0047738827],"study_design_scores_gemma":[0.0017964066,0.0005317689,0.00039307863,0.000040462084,0.000021630565,0.00015322833,0.00003152643,0.99170417,0.0045890007,0.00021496815,0.00016421259,0.00035956234],"about_ca_topic_score_codex":0.000034748016,"about_ca_topic_score_gemma":0.00007052859,"teacher_disagreement_score":0.90941495,"about_ca_system_score_codex":0.00009902905,"about_ca_system_score_gemma":0.000049398543,"threshold_uncertainty_score":0.98552066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015286442,0.0011117092,0.98554385,0.00069968024,0.00022834781,0.001121011,2.568123e-7,0.00023303808,0.009533469],"genre_scores_gemma":[0.5098909,0.0006681164,0.48493987,0.0010917343,0.00012371504,0.000684124,0.000011857658,0.000015724636,0.0025739544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985171,0.000027966327,0.00031201233,0.0005253937,0.00020693985,0.00041058523],"domain_scores_gemma":[0.9989658,0.000051602452,0.000071173454,0.00076661,0.00006870016,0.00007613426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004461525,0.00014323212,0.00014577815,0.000097861,0.00006795211,0.0001389127,0.0008056627,0.00008382088,0.00003174154],"category_scores_gemma":[0.0000056376275,0.00013842729,0.00005904436,0.00052493444,0.0000136399385,0.00036272593,0.00011559937,0.00010961574,0.000031099542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014677113,0.0001394384,0.00009232273,0.0000085725715,0.0000075820703,0.000003697241,0.000083947976,0.14877594,0.000040658382,0.059089605,0.009203166,0.7825404],"study_design_scores_gemma":[0.00044962604,0.00013436339,0.0040331148,0.000022098318,0.0000030972583,0.0000015072621,0.000021049398,0.9377904,0.00008177179,0.0020736337,0.055194173,0.00019516086],"about_ca_topic_score_codex":0.0000016058532,"about_ca_topic_score_gemma":0.000031411033,"teacher_disagreement_score":0.78901446,"about_ca_system_score_codex":0.000113761715,"about_ca_system_score_gemma":0.000016268365,"threshold_uncertainty_score":0.56449014},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016521506,0.00048196904,0.9802642,0.00006766925,0.0005711084,0.001915857,0.000006355089,0.00013497956,0.000036365305],"genre_scores_gemma":[0.47927096,0.00006630745,0.5201813,0.000040613904,0.00017676743,0.00013389061,0.000008115863,0.000016541939,0.000105492385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824274,0.00006190451,0.0004745507,0.00054681237,0.00022495603,0.00044903823],"domain_scores_gemma":[0.99760306,0.0011045067,0.0002619205,0.0006911599,0.00022375889,0.00011560571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035258473,0.00022893197,0.0003222081,0.000074634365,0.00043728505,0.00008754143,0.00069015974,0.00015715034,0.0000060016973],"category_scores_gemma":[0.000109478024,0.00017372773,0.00021860219,0.0003773163,0.00017510216,0.0005463168,0.0001485935,0.00013458317,8.820781e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033176673,0.00018603871,0.0037766148,0.000053357726,0.0001211233,0.0000010085868,0.0009935022,0.43163747,0.0028447816,0.0056808605,0.0028370542,0.55153644],"study_design_scores_gemma":[0.0019940834,0.00009180598,0.0006629869,0.000021723232,0.00003233392,0.000056779187,0.00016689092,0.9946405,0.0009213028,0.0001264011,0.0010792514,0.0002059033],"about_ca_topic_score_codex":0.00014801272,"about_ca_topic_score_gemma":0.00021338713,"teacher_disagreement_score":0.56300306,"about_ca_system_score_codex":0.00007140053,"about_ca_system_score_gemma":0.00010809656,"threshold_uncertainty_score":0.70844114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025233828,0.00009194038,0.9594926,0.00059751375,0.00028629627,0.00029681687,1.1682164e-7,0.0005340811,0.013466762],"genre_scores_gemma":[0.92742705,0.00006216841,0.0707735,0.0014216758,0.00011560294,0.000014593502,0.0000013727152,0.000009762586,0.00017427526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983437,0.00012924353,0.0003384002,0.00052934955,0.00013857296,0.0005207057],"domain_scores_gemma":[0.99912345,0.00012002741,0.00007552103,0.0005312457,0.000037675913,0.00011205495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043338077,0.00020407148,0.0002655302,0.00009838177,0.00012386161,0.00026372352,0.0008747681,0.00011066569,0.000019815847],"category_scores_gemma":[0.000004804957,0.00019187533,0.00005146913,0.00051667815,0.000016742006,0.0007606978,0.00013535448,0.00040001902,0.000026165812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052012683,0.00010530693,0.00028439926,0.0000020853222,0.000014110188,0.000051680265,0.0014271328,0.72005314,0.00007102735,0.22815236,0.00089490565,0.048938654],"study_design_scores_gemma":[0.00034197865,0.00006768584,0.0009096971,0.000024787041,0.0000022709885,0.00001117318,0.00002123253,0.9977573,0.0001330652,0.00024703838,0.00024134766,0.00024242423],"about_ca_topic_score_codex":0.00003975445,"about_ca_topic_score_gemma":0.000093826944,"teacher_disagreement_score":0.90219325,"about_ca_system_score_codex":0.00019207434,"about_ca_system_score_gemma":0.000079364916,"threshold_uncertainty_score":0.78244483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120328115,0.0008547652,0.8838421,0.006010519,0.00147805,0.00050880987,0.00010338393,0.0002390719,0.09493046],"genre_scores_gemma":[0.94617146,0.00068505434,0.051912036,0.0002625608,0.00009109235,0.00008722448,0.00013314902,0.000012712422,0.00064467697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825174,0.00017980555,0.00054617506,0.00034859902,0.00040941755,0.00026429558],"domain_scores_gemma":[0.9962902,0.0002942205,0.00034728055,0.0023581393,0.00063680817,0.00007332155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030022307,0.00020129014,0.00022029124,0.00016530056,0.00017515224,0.00014962124,0.004775601,0.00012336734,0.00017493228],"category_scores_gemma":[0.000035652498,0.00021051282,0.000118339856,0.00034295392,0.00027274157,0.00037069403,0.00047211722,0.00044084017,0.000058734247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016419091,0.00089332974,0.0008494073,0.000005081439,0.00006715464,0.0000026132,0.00020913238,0.018619863,0.0016702662,0.94557613,0.011082502,0.021008104],"study_design_scores_gemma":[0.00048029993,0.000064918,0.003865499,0.00008259949,0.0000084471985,0.000008404912,0.000021427573,0.9729012,0.0006456072,0.0062243952,0.015430926,0.00026623774],"about_ca_topic_score_codex":0.0002298021,"about_ca_topic_score_gemma":0.0010965433,"teacher_disagreement_score":0.9542814,"about_ca_system_score_codex":0.00010548579,"about_ca_system_score_gemma":0.00009670181,"threshold_uncertainty_score":0.88743347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18990016,0.000016104055,0.8067019,0.000035855162,0.0003304482,0.00021318931,1.8068738e-7,0.00017088822,0.0026313057],"genre_scores_gemma":[0.9742391,0.000014322643,0.02500083,0.0006163552,0.00008416619,0.0000046033324,0.000002717273,0.0000072871658,0.00003062859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982092,0.00004011554,0.0005746173,0.00022486252,0.00032890736,0.000622328],"domain_scores_gemma":[0.99888134,0.00025274963,0.00022169463,0.00043545858,0.00011304526,0.00009570999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013092526,0.00015296241,0.00016749649,0.00011151377,0.00008784568,0.00027429604,0.00061577465,0.00007908083,0.000009711164],"category_scores_gemma":[0.000055179207,0.00014828748,0.000036321577,0.00088903523,0.000021059182,0.0029765174,0.00028344936,0.00024798783,0.000027000628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002670909,0.00003761288,0.013719138,0.000014867817,0.000010408683,0.000029565173,0.0018076745,0.3941258,0.00023709907,0.024779473,0.00023815845,0.56497353],"study_design_scores_gemma":[0.00039682374,0.0000137812585,0.0075919614,0.000050996747,0.0000010193695,0.000009087327,0.000048289192,0.9907191,0.00044744348,0.00026594102,0.0002642549,0.00019132924],"about_ca_topic_score_codex":0.00030596554,"about_ca_topic_score_gemma":0.00029357793,"teacher_disagreement_score":0.78433895,"about_ca_system_score_codex":0.00028753097,"about_ca_system_score_gemma":0.00010408925,"threshold_uncertainty_score":0.6046988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008631346,0.008484576,0.9798456,0.000014997954,0.00077127904,0.0013110762,0.000070480055,0.00011498416,0.00075570133],"genre_scores_gemma":[0.9373515,0.0019730304,0.059358303,0.000024584424,0.000044642886,0.0011329076,0.00008149912,0.00002746444,0.000006063184],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9921481,0.0051829945,0.0014345576,0.00045025029,0.00040697918,0.00037713497],"domain_scores_gemma":[0.9890759,0.002870179,0.00086786377,0.0061507067,0.0009205044,0.00011485066],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.010681297,0.00024244083,0.0006591594,0.00048729745,0.00014339067,0.0000532595,0.0059880656,0.00021526529,0.00003264172],"category_scores_gemma":[0.00019016599,0.00027169858,0.00017913245,0.0041706595,0.0005268123,0.00060864596,0.00063697394,0.00034430667,0.00001395445],"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.00016564876,0.010766201,0.40253952,0.00028338528,0.0005645155,0.0000049673536,0.006308519,0.026831515,0.0030216824,0.21057105,0.0018528331,0.33709016],"study_design_scores_gemma":[0.0025075383,0.00053201965,0.9188558,0.00029158755,0.000079344776,0.0000023898551,0.000106795516,0.0525304,0.002968169,0.011652852,0.009244672,0.0012284643],"about_ca_topic_score_codex":0.001736006,"about_ca_topic_score_gemma":0.010233888,"teacher_disagreement_score":0.9287202,"about_ca_system_score_codex":0.000058860627,"about_ca_system_score_gemma":0.0002852997,"threshold_uncertainty_score":0.99997354},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000059572453,0.00006361147,0.9938541,0.00027774504,0.00059995725,0.0004107915,0.0000010155105,0.00036330876,0.0044234795],"genre_scores_gemma":[0.0115731275,0.0000018015554,0.9859973,0.0016325493,0.00026555604,0.00014664303,0.0000041169214,0.00001715257,0.00036174076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987278,0.00001798276,0.00020511965,0.00041569778,0.00015031405,0.00048306794],"domain_scores_gemma":[0.9989935,0.00013864136,0.000053426767,0.0006196367,0.000072531155,0.00012224252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325167,0.00014772647,0.00015705056,0.000046333837,0.0001349202,0.00018240538,0.0007875936,0.00009631395,0.000032559743],"category_scores_gemma":[0.000011471399,0.00013682178,0.000071117785,0.0003722111,0.000018791507,0.00031864244,0.00020818261,0.0001122557,0.000015668855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024663777,0.00003750991,0.0000044040917,0.0000054368493,0.000009011265,0.000005351705,0.0000147294995,0.6395201,0.000010418203,0.053035084,0.0009072515,0.30644822],"study_design_scores_gemma":[0.0009543756,0.00009066965,0.000021831478,0.000024707402,0.0000044261706,0.000008880999,0.0000019554118,0.98759264,0.00012199954,0.005909774,0.005085821,0.00018292175],"about_ca_topic_score_codex":0.00006217927,"about_ca_topic_score_gemma":0.000041621188,"teacher_disagreement_score":0.34807253,"about_ca_system_score_codex":0.00008262394,"about_ca_system_score_gemma":0.00010998755,"threshold_uncertainty_score":0.557943},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044990075,0.00024282747,0.99536973,0.0011533507,0.0002480917,0.00029876773,0.0000027727187,0.000434282,0.0018002597],"genre_scores_gemma":[0.5815603,0.00009109609,0.41406286,0.0011045729,0.00055159006,0.00017975131,0.000028345548,0.00003276887,0.0023886892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984122,0.00004280858,0.00029023402,0.0005485738,0.00025077764,0.00045542134],"domain_scores_gemma":[0.9988672,0.00020668337,0.00011312238,0.00043582104,0.00021170298,0.00016543799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018196364,0.00022176336,0.00021178856,0.00007786469,0.00018756148,0.00017565797,0.00048624264,0.0001159408,0.00008385163],"category_scores_gemma":[0.000010846306,0.00018257396,0.000074919575,0.00041097286,0.000088568835,0.0005330748,0.000100852645,0.00010926948,0.00000945553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013021549,0.00021791796,0.00019695413,0.000007051486,0.0000772826,0.0000073954816,0.00009851363,0.23618364,0.0001358913,0.06873508,0.003999633,0.6902104],"study_design_scores_gemma":[0.00092256296,0.00014361393,0.00019581028,0.000025150961,0.000010135929,0.00004680384,0.000008074144,0.9803117,0.00024679583,0.00011711114,0.017705645,0.00026661734],"about_ca_topic_score_codex":0.000006566071,"about_ca_topic_score_gemma":0.00018707226,"teacher_disagreement_score":0.74412805,"about_ca_system_score_codex":0.000064825166,"about_ca_system_score_gemma":0.00007874107,"threshold_uncertainty_score":0.744515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01305235,0.00015092241,0.983412,0.00018721416,0.0005998688,0.00030160794,0.0000019760923,0.0007480269,0.001546004],"genre_scores_gemma":[0.92472637,0.000008659053,0.072332695,0.00035788352,0.00081649516,0.00013597403,0.000020678845,0.0000365103,0.0015647474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976993,0.000053200274,0.00043674657,0.00071723276,0.00025710548,0.00083637284],"domain_scores_gemma":[0.9985881,0.000331099,0.0001439748,0.00068078696,0.00012813724,0.00012791564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002990525,0.00028438162,0.0002915626,0.0000723652,0.00026296577,0.00032152407,0.0010914633,0.00018962688,0.000018088398],"category_scores_gemma":[0.000005386179,0.00026660255,0.00017645514,0.000438805,0.000045281835,0.00041006753,0.000276576,0.00016323011,0.000008356745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007726364,0.00008263507,0.00006392487,0.0000044899903,0.000011613681,0.000012148607,0.000039343446,0.78468454,0.00001600975,0.05281157,0.010445848,0.15182014],"study_design_scores_gemma":[0.00061989075,0.00007645799,0.00008809923,0.000020452357,0.000007675683,0.000016893473,0.000015929454,0.99541855,0.00019351977,0.00013731809,0.003047643,0.0003575462],"about_ca_topic_score_codex":0.0001859669,"about_ca_topic_score_gemma":0.00032506604,"teacher_disagreement_score":0.911674,"about_ca_system_score_codex":0.00006918534,"about_ca_system_score_gemma":0.000052700932,"threshold_uncertainty_score":0.9999786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24664114,0.0004221745,0.7507978,0.000011516398,0.00024318187,0.0012253276,5.345865e-7,0.00015222511,0.00050611014],"genre_scores_gemma":[0.83152354,0.000104522,0.16727957,0.00007135161,0.00008100361,0.00045036117,6.173463e-7,0.000018244666,0.00047079293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807197,0.00012042168,0.00048233205,0.000561649,0.00027172148,0.00049189985],"domain_scores_gemma":[0.99823004,0.00043664186,0.00021776193,0.0008811848,0.0001390803,0.00009530977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076170545,0.00020552389,0.0003638151,0.00006671003,0.00016236774,0.0000672536,0.0010377266,0.000087707216,0.00003602631],"category_scores_gemma":[0.000015184213,0.00017882399,0.00009116893,0.0005141237,0.000022122886,0.00038500538,0.0003541892,0.00017704259,0.0000074288846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012327387,0.0005744233,0.0020125303,0.000019829462,0.000034461333,0.0000024783749,0.0030911972,0.10929527,0.00004415822,0.00039933954,0.0005007598,0.88401324],"study_design_scores_gemma":[0.0010956521,0.0011031546,0.00061135914,0.000025590896,0.000013140032,0.0000051004736,0.00034775754,0.9956829,0.00016487218,0.000008971828,0.0007311224,0.00021036342],"about_ca_topic_score_codex":0.000012603225,"about_ca_topic_score_gemma":0.000040419283,"teacher_disagreement_score":0.88638765,"about_ca_system_score_codex":0.0000349355,"about_ca_system_score_gemma":0.000011238844,"threshold_uncertainty_score":0.7292231},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035144943,0.00013069916,0.9905093,0.0034026082,0.0001673865,0.0012106864,0.000012234841,0.0003449781,0.00070765667],"genre_scores_gemma":[0.899173,0.0008232611,0.09833026,0.00057078514,0.000046080917,0.00079915853,0.000019705934,0.000035997375,0.00020174486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794406,0.0001820574,0.00048028477,0.00060641445,0.0003065368,0.00048067883],"domain_scores_gemma":[0.9963426,0.00030741328,0.00019285515,0.0028128559,0.00016214747,0.00018213551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039679313,0.0003257796,0.00033202325,0.00018221195,0.0010157592,0.0002828486,0.0015249422,0.00014546688,0.000003257002],"category_scores_gemma":[0.0000016515197,0.00032909962,0.000106089334,0.0006323242,0.00017336279,0.0005057814,0.000030668467,0.00047503551,0.0000034892673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001349944,0.00045529858,0.00002016328,0.000056114386,0.00017809271,0.0000045118168,0.0009332882,0.6679791,0.00024346006,0.021852616,0.0005857093,0.30755663],"study_design_scores_gemma":[0.0010118987,0.00023553845,0.0006242612,0.00024364288,0.00007742369,0.000025434385,0.00017553192,0.9948424,0.0004821373,0.00007309287,0.0017898328,0.0004188128],"about_ca_topic_score_codex":0.000019042505,"about_ca_topic_score_gemma":0.00028771965,"teacher_disagreement_score":0.8956585,"about_ca_system_score_codex":0.00013776735,"about_ca_system_score_gemma":0.00004908538,"threshold_uncertainty_score":0.9999161},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018362153,0.0000019623901,0.8992088,0.000043278844,0.0003026024,0.098018765,3.4978032e-7,0.00018375949,0.00040427473],"genre_scores_gemma":[0.8006856,1.3894056e-7,0.036718186,0.00020147407,0.0002516326,0.16178657,0.000004137538,0.000034515422,0.00031774168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979254,0.00008537514,0.00054192054,0.00051873765,0.00034598217,0.00058261305],"domain_scores_gemma":[0.998375,0.00026671484,0.00025747472,0.0006601353,0.00030227334,0.0001384246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012415813,0.00020094235,0.00027599916,0.000112150345,0.000117111966,0.0000813174,0.0007108323,0.000120774464,0.000018699802],"category_scores_gemma":[0.000019371508,0.00017032334,0.00008246694,0.00073827483,0.00006741681,0.00026341176,0.00006791924,0.00014976235,0.0000022174906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046095543,0.0026572125,0.00056348,0.00038235134,0.000048556187,0.000007574936,0.0012932922,0.36517242,0.00077688886,0.08622387,0.004502556,0.5379109],"study_design_scores_gemma":[0.0008598415,0.00092422724,0.00018516167,0.00005857373,0.000005570873,0.000009397712,0.00007034707,0.97920674,0.017692149,0.00024341031,0.00053073955,0.00021385473],"about_ca_topic_score_codex":0.000029934903,"about_ca_topic_score_gemma":0.0001380377,"teacher_disagreement_score":0.8624906,"about_ca_system_score_codex":0.00008130241,"about_ca_system_score_gemma":0.00009738954,"threshold_uncertainty_score":0.69455844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012543479,0.00027009388,0.9139656,0.0005615762,0.00056678464,0.000105954336,1.238297e-7,0.00029503106,0.07169135],"genre_scores_gemma":[0.9905419,0.00006126279,0.004220641,0.0027332983,0.00016736957,0.000024305626,9.0819356e-7,0.000015709322,0.0022346382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830604,0.000085677624,0.0002981704,0.0005166391,0.00024314475,0.0005503424],"domain_scores_gemma":[0.9988055,0.00033110252,0.00006931832,0.0006495622,0.000024000969,0.000120499426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019025331,0.00017884324,0.0001895045,0.000105980245,0.00005457993,0.00013514436,0.0008931832,0.000115866824,0.0002127118],"category_scores_gemma":[0.000015652453,0.00016596935,0.00005336148,0.0005870329,0.000024399675,0.00026674345,0.00025218382,0.00023070895,0.000089005865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004784149,0.00018182366,0.0002882471,0.0000032944715,0.000012447614,0.00015219391,0.0002238847,0.13632928,0.000028333556,0.32835472,0.031878676,0.5025423],"study_design_scores_gemma":[0.0002911692,0.000069308015,0.0001354925,0.000032253847,0.0000010871902,0.000012050789,0.000004779188,0.9949262,0.0000489768,0.00087683805,0.0033997123,0.00020209902],"about_ca_topic_score_codex":0.00008576727,"about_ca_topic_score_gemma":0.00013396799,"teacher_disagreement_score":0.9779984,"about_ca_system_score_codex":0.000058792626,"about_ca_system_score_gemma":0.0000070196625,"threshold_uncertainty_score":0.67680335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018827267,0.00005228891,0.9775932,0.0009635114,0.0002221902,0.0008326157,0.000019734538,0.00014467184,0.001344524],"genre_scores_gemma":[0.96308935,0.00013493352,0.03552069,0.00010843148,0.000007997605,0.0010701432,0.000005910286,0.000019972096,0.000042598815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981181,0.0004338554,0.0005304978,0.0003355904,0.00029661178,0.0002853216],"domain_scores_gemma":[0.9962712,0.0006360215,0.00021910583,0.0024072619,0.00037109831,0.00009530821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031787262,0.00019681288,0.00028724154,0.00036677407,0.00037545452,0.00012292064,0.0016083362,0.00013417137,0.00002752314],"category_scores_gemma":[0.000005869047,0.00021430486,0.00011302247,0.0017643924,0.00016111539,0.00081212574,0.000020326697,0.0005873577,0.000031143176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002467233,0.002585432,0.00043554977,0.00006535098,0.00015807616,0.0000018178133,0.0021703434,0.4975732,0.04832477,0.011353689,0.0002569405,0.43705016],"study_design_scores_gemma":[0.0006727866,0.00014036421,0.0026295383,0.00010693568,0.000016314221,0.0000014426369,0.00024288138,0.9627561,0.0325998,0.00027317693,0.00032337796,0.00023729757],"about_ca_topic_score_codex":0.00042782445,"about_ca_topic_score_gemma":0.0013434672,"teacher_disagreement_score":0.944262,"about_ca_system_score_codex":0.00026051106,"about_ca_system_score_gemma":0.00020822891,"threshold_uncertainty_score":0.8739099},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4840427,0.000046775323,0.5149177,0.00006762113,0.0006875752,0.00017822265,0.000003886673,0.000046953985,0.000008580116],"genre_scores_gemma":[0.9679305,0.00010919859,0.031633783,0.00025365388,0.000033918972,0.0000137636025,0.0000014795716,0.000017710465,0.000005975026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983884,0.00008748085,0.0003963604,0.00053480815,0.0002141611,0.00037878793],"domain_scores_gemma":[0.9987437,0.0005591716,0.00012068233,0.00041737754,0.000034054017,0.00012498372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032057308,0.00024911354,0.00030655882,0.00025498637,0.00023904645,0.00013067966,0.0002976733,0.00011451146,0.000004315596],"category_scores_gemma":[0.0000018449683,0.000262802,0.00007621527,0.0003310306,0.00011511492,0.00035760272,0.000018805911,0.0006058642,0.0000015249387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015195688,0.0003085872,0.00048821475,0.000038304475,0.000118719465,0.0003864404,0.0016808443,0.5652854,0.0016636497,0.0003852167,0.00009464798,0.42939806],"study_design_scores_gemma":[0.0011302783,0.0002364862,0.00068844634,0.00018261347,0.000017824588,0.00032652204,0.000100668185,0.99627596,0.0006861249,0.000055172906,0.000041680065,0.00025822778],"about_ca_topic_score_codex":0.000112230315,"about_ca_topic_score_gemma":0.00034520755,"teacher_disagreement_score":0.48388782,"about_ca_system_score_codex":0.000044297398,"about_ca_system_score_gemma":0.000016786718,"threshold_uncertainty_score":0.9999824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011093179,0.0005081119,0.98648113,0.00071377045,0.00022325825,0.00064267917,9.948322e-7,0.00015230711,0.00018458693],"genre_scores_gemma":[0.3773657,0.00007034651,0.6208116,0.0011313002,0.00020356613,0.00010037663,5.9488167e-7,0.000016456876,0.0003000737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983055,0.000044634064,0.0003152894,0.0005966932,0.00016085002,0.00057705713],"domain_scores_gemma":[0.9982869,0.0008701263,0.00007797801,0.00055948005,0.000065982065,0.00013955637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005543666,0.00020431215,0.00024370075,0.00006757511,0.00010359636,0.00033582814,0.00057118555,0.00024924666,0.00001970303],"category_scores_gemma":[0.000042929867,0.0001865597,0.000052182288,0.00036682593,0.000065812514,0.0004618121,0.00022320007,0.00028584292,0.000011662562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013290766,0.0002725236,0.001898459,0.00002314212,0.00003313081,0.000014622658,0.0006552784,0.30441234,0.00046101474,0.20112807,0.0026857553,0.48828274],"study_design_scores_gemma":[0.0007578027,0.00008447099,0.0019422417,0.0000428041,0.0000029360242,0.000018957944,0.000007823657,0.99166286,0.00031195572,0.0022666187,0.002638192,0.00026335058],"about_ca_topic_score_codex":0.0000075980342,"about_ca_topic_score_gemma":0.000063300104,"teacher_disagreement_score":0.6872505,"about_ca_system_score_codex":0.000053831256,"about_ca_system_score_gemma":0.00004007676,"threshold_uncertainty_score":0.76076835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14598846,0.00012330388,0.84311527,0.008233518,0.0005512533,0.0006658283,0.000015440426,0.00009508926,0.0012118284],"genre_scores_gemma":[0.99174434,0.00015136864,0.0065990184,0.00056936586,0.00023549961,0.00015127193,0.0000957175,0.00001554305,0.00043789833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984454,0.00006275096,0.00048154488,0.00041152048,0.00032818172,0.00027059764],"domain_scores_gemma":[0.99887496,0.00020052327,0.0002674773,0.0003031738,0.00031050915,0.000043326025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065186404,0.00017165084,0.0001717844,0.00004927577,0.00021656547,0.00051064626,0.0007604238,0.000104355466,0.0000054791863],"category_scores_gemma":[0.000010053953,0.00016914286,0.00011491551,0.00028636845,0.000076325574,0.0007131349,0.00019916569,0.00015445064,0.0000030901147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019757912,0.0018697211,0.038022157,0.00028043517,0.0003022535,0.000013014071,0.0056540244,0.10070726,0.070538566,0.7235333,0.036317166,0.022564564],"study_design_scores_gemma":[0.0009046108,0.000032761403,0.0038944345,0.00009471337,0.000007357078,0.000011838587,0.00008944332,0.98940927,0.0018472917,0.0026732902,0.0008138328,0.00022114598],"about_ca_topic_score_codex":0.000488754,"about_ca_topic_score_gemma":0.00020363663,"teacher_disagreement_score":0.88870203,"about_ca_system_score_codex":0.00019054384,"about_ca_system_score_gemma":0.000043584572,"threshold_uncertainty_score":0.6897446},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021126796,0.0012765442,0.9717099,0.00007255374,0.0017803418,0.0038651347,4.366161e-7,0.000050619477,0.00011766536],"genre_scores_gemma":[0.9548093,0.0002562285,0.03899953,0.0001290242,0.0034606515,0.002280156,0.0000029825062,0.000022416238,0.000039726114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798095,0.00006004066,0.00079680345,0.00029763134,0.00047129358,0.0003932709],"domain_scores_gemma":[0.99814665,0.0002957323,0.0008501295,0.00018666145,0.0004420052,0.000078831654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246384,0.00021684852,0.0002977285,0.00020429904,0.00022655864,0.00032918894,0.0010500306,0.000118676675,0.0000028315126],"category_scores_gemma":[0.0000068102554,0.00019601168,0.000113126276,0.00020445403,0.000045643388,0.00049148296,0.00038201932,0.00034561532,3.112121e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001259776,0.00008662893,0.0030325234,0.000022728484,0.000066967936,0.000032103442,0.00006173157,0.2604121,0.0002165033,0.0021820706,0.00066515047,0.7330955],"study_design_scores_gemma":[0.0014727756,0.0005128442,0.0025818362,0.00082428055,0.000011532195,0.0007700545,0.000006566728,0.918712,0.000797649,0.0012413848,0.07276066,0.00030839292],"about_ca_topic_score_codex":0.000007753789,"about_ca_topic_score_gemma":0.000009019705,"teacher_disagreement_score":0.9336825,"about_ca_system_score_codex":0.00012887495,"about_ca_system_score_gemma":0.000069075955,"threshold_uncertainty_score":0.7993124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023529211,0.000048057285,0.97196406,0.00048688098,0.0023209264,0.00088020886,0.0000018329267,0.00045237932,0.00031645785],"genre_scores_gemma":[0.89220536,0.000017967575,0.10542564,0.0013464072,0.00022268425,0.00022394968,0.000007977979,0.00004219708,0.0005078032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967153,0.00009254818,0.0006369233,0.0011003201,0.00041881588,0.0010360606],"domain_scores_gemma":[0.9975441,0.00019832309,0.00018696986,0.0016580136,0.00012223297,0.00029034307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076154614,0.00043531018,0.00043934,0.0001558778,0.00015404278,0.00025872723,0.0019006536,0.00034446843,0.000082370556],"category_scores_gemma":[0.000028359209,0.00039379764,0.00015579045,0.00072118937,0.00011956541,0.00057268626,0.000544814,0.00097182987,0.00006815399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012149283,0.0065155975,0.01199601,0.00015261285,0.00020643852,0.0005722541,0.002502596,0.38725907,0.015160467,0.09762456,0.0114965625,0.46639234],"study_design_scores_gemma":[0.002494481,0.00011182921,0.003115736,0.000029722689,0.0000052937403,0.000005406646,0.000023578967,0.9904424,0.0027057228,0.00010262318,0.00046428043,0.00049892627],"about_ca_topic_score_codex":0.00060532143,"about_ca_topic_score_gemma":0.0050673727,"teacher_disagreement_score":0.8686762,"about_ca_system_score_codex":0.00011000416,"about_ca_system_score_gemma":0.0001459017,"threshold_uncertainty_score":0.9998514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015272497,0.000015016075,0.97753,0.0003439827,0.0016705205,0.00039955825,0.0000013940952,0.00029105807,0.004475975],"genre_scores_gemma":[0.9572032,0.000022893,0.03975869,0.000743032,0.00036448293,0.000037518697,0.0000061726982,0.000016957983,0.0018470458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986125,0.000027098216,0.00020238386,0.00049259857,0.00023992348,0.00042545208],"domain_scores_gemma":[0.99870723,0.00018894758,0.00006952266,0.00075777626,0.00007982668,0.00019669565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000336978,0.00016438935,0.00017452074,0.00003937993,0.00018670318,0.00014205786,0.0010274329,0.00021548534,0.00023002812],"category_scores_gemma":[0.000012207144,0.00013536507,0.000117541356,0.00024871394,0.00004088163,0.0003928867,0.00022208226,0.0003304674,0.000016312584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005273773,0.000124032,0.0014296822,0.000033412107,0.00003333294,0.000016476253,0.00029730704,0.00034800457,0.0040774127,0.6059985,0.12891278,0.2586763],"study_design_scores_gemma":[0.0006215689,0.00006918786,0.0014540014,0.000016007596,0.0000067705614,0.0000040871128,0.0000051978946,0.97551876,0.0008117635,0.0017364252,0.019514972,0.00024123717],"about_ca_topic_score_codex":0.000022975184,"about_ca_topic_score_gemma":0.00003502847,"teacher_disagreement_score":0.9751708,"about_ca_system_score_codex":0.000015752577,"about_ca_system_score_gemma":0.00003704889,"threshold_uncertainty_score":0.5520028},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003226581,0.00025889426,0.9904419,0.002864868,0.00014504483,0.000343489,0.00001968086,0.00042252106,0.005471299],"genre_scores_gemma":[0.8557313,0.000023749739,0.14342335,0.00013626824,0.000030093906,0.00011789171,0.000014769482,0.000006757981,0.00051578257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992409,0.0000430283,0.00019032127,0.00020246995,0.00009974392,0.00022354591],"domain_scores_gemma":[0.9981714,0.00015769232,0.00004220387,0.0014780893,0.00007783728,0.00007275921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013463314,0.0000841353,0.00012127023,0.000025162904,0.00016462724,0.00009966507,0.001591219,0.000047121925,0.00002065553],"category_scores_gemma":[0.000006761558,0.0000751407,0.00006888828,0.0002753232,0.00003286195,0.00020539295,0.00009892795,0.00007165128,0.0000682279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000357995,0.00014079397,0.0001359265,0.00006795664,0.000051490915,0.000005984901,0.0003504618,0.0004935889,0.0012315046,0.9481845,0.02687361,0.022460591],"study_design_scores_gemma":[0.0002468305,0.000026949345,0.000053786276,0.000017196244,0.0000057241095,0.000008932842,0.0000317854,0.9804336,0.00012783056,0.00027270723,0.018673837,0.00010081525],"about_ca_topic_score_codex":0.000007654225,"about_ca_topic_score_gemma":0.0000136809285,"teacher_disagreement_score":0.97994,"about_ca_system_score_codex":0.000044921024,"about_ca_system_score_gemma":0.0000062291288,"threshold_uncertainty_score":0.30641487},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029605888,0.0006350619,0.9551194,0.0022624994,0.00014835634,0.00022090264,9.0757915e-8,0.0002828822,0.011724917],"genre_scores_gemma":[0.98864275,0.000115271985,0.007968737,0.0024470878,0.00010047145,0.000012658315,0.000004492067,0.000006707879,0.00070179655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987081,0.00007456969,0.0002466173,0.00040773753,0.00020043968,0.00036247852],"domain_scores_gemma":[0.9990734,0.000067231085,0.000059247355,0.0006817324,0.0000305469,0.00008788173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033653088,0.00012612095,0.0001417658,0.00007542878,0.00004926326,0.000115715105,0.0008269615,0.000060381713,0.000017528948],"category_scores_gemma":[0.000007673049,0.000121625635,0.000036307483,0.00042573235,0.000017984887,0.0003421109,0.000109027256,0.0002052628,0.00003782169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008066039,0.00006965186,0.00012328527,0.0000013344921,0.0000024251003,0.000030356914,0.00009623449,0.02719356,0.000051789022,0.052224394,0.011213973,0.90898496],"study_design_scores_gemma":[0.00027546196,0.000086889406,0.0050914586,0.000024718996,0.0000012081794,0.000015001396,0.000006285395,0.9761994,0.00023075507,0.0020788556,0.01580055,0.00018943346],"about_ca_topic_score_codex":0.0000064803003,"about_ca_topic_score_gemma":0.00003599031,"teacher_disagreement_score":0.9590369,"about_ca_system_score_codex":0.00006191827,"about_ca_system_score_gemma":0.000026377656,"threshold_uncertainty_score":0.49597496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020487508,0.000113491296,0.9768348,0.0003352443,0.0006529056,0.00063040905,7.2580787e-7,0.0004832139,0.0004617415],"genre_scores_gemma":[0.9310958,0.000024514266,0.06774595,0.0006278048,0.00013457253,0.000031649673,0.0000033534707,0.000024655961,0.00031174222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964798,0.00017713133,0.0006979603,0.0010602218,0.0004019228,0.0011829588],"domain_scores_gemma":[0.998144,0.00021947225,0.00016722451,0.0010610818,0.0000998756,0.00030836384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008437577,0.00041835938,0.00048176319,0.0001926358,0.0001929321,0.00027171284,0.0014180839,0.00023593193,0.000017230828],"category_scores_gemma":[0.000054264263,0.00038325938,0.00014521275,0.0010206818,0.00006376135,0.00032911685,0.0003622152,0.0005825949,0.00005518148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002443518,0.0014646112,0.0016333511,0.000009669812,0.000023772802,0.00023472066,0.002048583,0.885943,0.00021235614,0.02527584,0.00039909844,0.08273059],"study_design_scores_gemma":[0.00206857,0.00007744545,0.015803134,0.00008790502,0.000004982931,0.000023391818,0.00005784053,0.9811758,0.00017978808,0.000027835598,0.00002469643,0.00046862845],"about_ca_topic_score_codex":0.00014824378,"about_ca_topic_score_gemma":0.00023188496,"teacher_disagreement_score":0.91060823,"about_ca_system_score_codex":0.00018359938,"about_ca_system_score_gemma":0.000054363703,"threshold_uncertainty_score":0.99986196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3331032,0.00008131077,0.6623312,0.00017449613,0.00043989194,0.00044557438,0.000012774314,0.00015864479,0.003252873],"genre_scores_gemma":[0.961629,0.000011712563,0.038109556,0.00007064585,0.00006575647,0.000017877801,0.000034369496,0.000009264573,0.000051825005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997713,0.00017559723,0.0005260535,0.0007774105,0.00039740605,0.00041049137],"domain_scores_gemma":[0.99549025,0.00046771948,0.00016665537,0.0036230176,0.00014189126,0.000110433975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023894422,0.0001596689,0.00039938008,0.00033063343,0.0000418742,0.00008707356,0.0029287108,0.0001387798,0.000075764205],"category_scores_gemma":[0.00042540248,0.00013752755,0.00006950048,0.0028246427,0.000093545226,0.0006293557,0.0012278019,0.00049471756,0.0000049217288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014012369,0.00033353505,0.051228303,0.00002824486,0.00039623718,0.000051665098,0.0007001672,0.74337476,0.0008436619,0.115443975,0.0013712951,0.08621417],"study_design_scores_gemma":[0.00018778806,0.00001734311,0.018722089,0.0000129308255,0.00008404094,0.0000020449977,0.000014835656,0.98000014,0.000049904393,0.0006431922,0.00011284654,0.00015283338],"about_ca_topic_score_codex":0.0013409564,"about_ca_topic_score_gemma":0.034759022,"teacher_disagreement_score":0.6285258,"about_ca_system_score_codex":0.00004229482,"about_ca_system_score_gemma":0.00012796494,"threshold_uncertainty_score":0.9828541},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18763617,0.0012214934,0.80571276,0.0016867137,0.00026702767,0.0015462084,0.000010038415,0.00090808136,0.0010115161],"genre_scores_gemma":[0.9631441,0.0010788613,0.034722667,0.00036405833,0.000291551,0.00017334611,0.00007700887,0.00003741343,0.000110965295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690944,0.00024515236,0.00086992834,0.00070847286,0.00022514326,0.0010418777],"domain_scores_gemma":[0.99531263,0.001053834,0.00047982924,0.0026668017,0.00024602056,0.00024089731],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013159465,0.0003586591,0.00051296694,0.00014256865,0.001891541,0.00044250148,0.002423012,0.00023008417,0.000007747934],"category_scores_gemma":[0.000022679202,0.00038551906,0.00019327382,0.00065678626,0.00018481453,0.00046209132,0.001385153,0.0005146602,0.0000075362773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060753105,0.000185503,0.000061937026,0.00001579026,0.00003733241,0.000002085245,0.0009191337,0.024770452,0.0006653607,0.08154099,0.001026847,0.89076847],"study_design_scores_gemma":[0.00056317466,0.00018208871,0.0006642163,0.00013327535,0.000028376948,0.00002320279,0.000071239585,0.99357635,0.00002471306,0.00042083467,0.0038822815,0.00043024443],"about_ca_topic_score_codex":0.000028993669,"about_ca_topic_score_gemma":0.0000250313,"teacher_disagreement_score":0.9688059,"about_ca_system_score_codex":0.000092924194,"about_ca_system_score_gemma":0.00011209333,"threshold_uncertainty_score":0.9998597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01877717,0.00055961544,0.97902274,0.00044941547,0.0004524766,0.0002930158,6.630593e-7,0.00016987692,0.00027499808],"genre_scores_gemma":[0.6018494,0.000011449039,0.39763767,0.00031326248,0.00008898424,0.00003750492,0.0000019562112,0.000012628327,0.000047165475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981161,0.00006331401,0.00029717194,0.00060630316,0.00030397144,0.0006131853],"domain_scores_gemma":[0.99834925,0.00068646885,0.00013951212,0.000566893,0.00007424003,0.000183648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007552559,0.00021048995,0.0002655553,0.0002687175,0.000118493685,0.00018311532,0.00076613575,0.00014810373,0.000009358262],"category_scores_gemma":[0.00013276575,0.00020358418,0.000112980044,0.0018505437,0.000017682507,0.000244213,0.00024576593,0.0002171819,0.0000027663796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001256584,0.000049970837,0.000025090616,0.0000046722407,0.000003786497,0.0000050502204,0.000041851596,0.7445109,0.000048391736,0.012515613,0.000063111715,0.24271904],"study_design_scores_gemma":[0.0016939149,0.000099323566,0.0001479354,0.000048353402,0.000004347889,0.000002158693,0.000009287167,0.99365276,0.0026077135,0.0007713497,0.0007203732,0.00024246317],"about_ca_topic_score_codex":0.00015500882,"about_ca_topic_score_gemma":0.00034718777,"teacher_disagreement_score":0.5830722,"about_ca_system_score_codex":0.00028932843,"about_ca_system_score_gemma":0.00026739,"threshold_uncertainty_score":0.83019215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006138464,0.0004221575,0.9916424,0.00012231483,0.0018738604,0.0012511056,0.0000031138513,0.00032196278,0.0037492218],"genre_scores_gemma":[0.8057274,0.000033168853,0.19206712,0.00084549724,0.0007763706,0.000033281012,0.0000018225184,0.00005961432,0.00045573115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939407,0.00009996954,0.0007724853,0.002679953,0.0014414629,0.0010654224],"domain_scores_gemma":[0.9955574,0.0006920345,0.00043793893,0.0027048353,0.00029267746,0.0003150802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010159191,0.00084400637,0.00081929425,0.00076430634,0.0005533462,0.0005466819,0.004510174,0.0003841611,0.00002362053],"category_scores_gemma":[0.00005045659,0.00079218287,0.00016912735,0.0009656495,0.0007750476,0.0006959062,0.0030736998,0.001547259,0.00008609187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001079286,0.00020303708,0.00016765622,0.0000124043345,0.000045124827,0.056989484,0.008008187,0.088761345,0.0000028443576,0.004999238,0.00018797033,0.84061193],"study_design_scores_gemma":[0.0005924132,0.0010005598,0.00007215604,0.00020832261,0.000017766793,0.015155884,0.0000032263893,0.9704505,0.000033412423,0.0103068985,0.00093926105,0.001219571],"about_ca_topic_score_codex":0.00022714603,"about_ca_topic_score_gemma":0.0005860821,"teacher_disagreement_score":0.8816892,"about_ca_system_score_codex":0.0004586806,"about_ca_system_score_gemma":0.0007141567,"threshold_uncertainty_score":0.9994529},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015127434,0.0000921724,0.9932148,0.0004472019,0.002955929,0.0009999616,0.0000044985622,0.000453517,0.0003191979],"genre_scores_gemma":[0.84965676,0.0000058982127,0.1474287,0.0015191862,0.00031507862,0.00014640582,0.0000031415718,0.000033440287,0.00089137495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762654,0.000060756483,0.00041828354,0.0007781921,0.00027186892,0.0008443703],"domain_scores_gemma":[0.99755275,0.00065615133,0.00013219254,0.0010362706,0.0002685879,0.00035403372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061863574,0.00030115648,0.00038881938,0.0001397155,0.00019838642,0.00025063904,0.00150207,0.00035010974,0.000049023336],"category_scores_gemma":[0.00014594395,0.00025396686,0.0002190582,0.0005966812,0.00008728959,0.00040311724,0.00028462728,0.00058579235,0.00006738276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027629812,0.0044757235,0.0030221727,0.000063465755,0.00052079203,0.00014440916,0.0011500577,0.07506431,0.0027211728,0.49068913,0.0685239,0.35334858],"study_design_scores_gemma":[0.0031760924,0.00010841797,0.0012092696,0.0000063496377,0.000009854004,0.000014136539,0.000010711432,0.9919219,0.00014508543,0.0001281153,0.002918633,0.0003514488],"about_ca_topic_score_codex":0.00003772221,"about_ca_topic_score_gemma":0.00014096453,"teacher_disagreement_score":0.9168576,"about_ca_system_score_codex":0.00002984049,"about_ca_system_score_gemma":0.000052124084,"threshold_uncertainty_score":0.99999124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8204829,0.00008507948,0.16533056,0.000048696234,0.00008757072,0.00054838514,0.0000010270776,0.000032972956,0.013382804],"genre_scores_gemma":[0.9577852,0.000031960044,0.041672196,0.000117205454,0.000014490689,0.00013682205,0.0000018482306,0.000005488624,0.00023479064],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882686,0.00029335826,0.00023977282,0.00013519054,0.00020431264,0.0003004841],"domain_scores_gemma":[0.99889857,0.00016465546,0.000110410125,0.0005534268,0.00019635443,0.00007656824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626317,0.00013019989,0.00020772367,0.00005793216,0.00010045759,0.000020197402,0.0005065262,0.00004224594,0.000040137613],"category_scores_gemma":[0.000016874696,0.000094998846,0.000012559955,0.0008326067,0.00009050624,0.0008010174,0.00024470786,0.00028678836,0.000019177201],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005212024,0.0061007207,0.5779115,0.00021013552,0.00020758092,0.000012750979,0.21797675,0.018296253,0.0074538877,0.09970975,0.0025432159,0.06905625],"study_design_scores_gemma":[0.004549955,0.0038083526,0.14207532,0.00047535854,0.000015817774,0.000017083961,0.004622731,0.6196532,0.22098167,0.000052133786,0.0027249658,0.0010233708],"about_ca_topic_score_codex":0.00010994262,"about_ca_topic_score_gemma":0.00024847453,"teacher_disagreement_score":0.601357,"about_ca_system_score_codex":0.000074491814,"about_ca_system_score_gemma":0.00009277163,"threshold_uncertainty_score":0.38739407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12140501,0.00035935373,0.8683708,0.0001134736,0.0002844815,0.00010341529,4.1539604e-8,0.00019947774,0.009163963],"genre_scores_gemma":[0.95471036,0.000019171242,0.044213053,0.00038217547,0.00010849319,0.000010213303,8.6429395e-7,0.0000066243333,0.0005490458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989174,0.00004462083,0.00021059807,0.00033412993,0.00013449758,0.00035876365],"domain_scores_gemma":[0.99932164,0.00009054897,0.000045056884,0.00047250086,0.000022510747,0.000047736994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022888185,0.000106256346,0.00013253384,0.00005642996,0.00004894267,0.0001038884,0.0005358783,0.00007575933,0.00001914471],"category_scores_gemma":[0.0000057947104,0.000101197635,0.000036003235,0.0003831316,0.000021106198,0.00028782102,0.00026670194,0.00015758222,0.000036533296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071750223,0.00012270272,0.08493571,0.000005828672,0.0000060101006,0.00038814053,0.00014319389,0.099379905,0.000105556166,0.05181839,0.010655304,0.7524321],"study_design_scores_gemma":[0.0002240123,0.000025621724,0.07343244,0.0000134627435,0.0000010041798,0.000019700876,0.0000032946602,0.92143804,0.0001155313,0.0019099786,0.0026507166,0.00016621154],"about_ca_topic_score_codex":0.000043835247,"about_ca_topic_score_gemma":0.001254526,"teacher_disagreement_score":0.83330536,"about_ca_system_score_codex":0.00004168725,"about_ca_system_score_gemma":0.000020646085,"threshold_uncertainty_score":0.41267195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19600353,0.00040255365,0.7986593,0.00031971704,0.00046700847,0.00040632664,6.631783e-7,0.00018090713,0.0035599866],"genre_scores_gemma":[0.9666671,0.000015037818,0.023887362,0.0008735623,0.00018573053,0.00010861433,0.000008487921,0.000014658647,0.008239431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853027,0.000045405603,0.00032031036,0.00048198662,0.000195337,0.00042667985],"domain_scores_gemma":[0.9991587,0.00004210516,0.000038324783,0.0005650736,0.00009716175,0.00009862809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025241825,0.00015394749,0.00015570705,0.000083692736,0.000091954826,0.00049867143,0.0005847581,0.000113702554,0.00020690334],"category_scores_gemma":[0.000007633769,0.00014320544,0.000039359995,0.0006690642,0.000022636474,0.00049448275,0.00021159986,0.00015500622,0.00018655916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033750857,0.00034031403,0.036778335,0.000005184509,0.000004533464,0.00008064151,0.00019303347,0.73639965,0.0016413886,0.020238746,0.03350767,0.17077674],"study_design_scores_gemma":[0.0009115194,0.00015576683,0.09498396,0.000027598619,0.000003697986,0.000013494418,0.0000038058047,0.86521024,0.002366135,0.00020719752,0.035648134,0.000468464],"about_ca_topic_score_codex":0.00017674711,"about_ca_topic_score_gemma":0.0022084557,"teacher_disagreement_score":0.7747719,"about_ca_system_score_codex":0.000078987425,"about_ca_system_score_gemma":0.000035657078,"threshold_uncertainty_score":0.58397484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020696342,0.00017295759,0.9946592,0.0003481805,0.00069577695,0.0011926985,0.000012738923,0.00046344535,0.00038536082],"genre_scores_gemma":[0.5254933,0.0000055592855,0.47167015,0.0018015676,0.00046797452,0.00008980064,0.00008297944,0.000049533435,0.00033912255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969014,0.000043690197,0.0004405162,0.0011868152,0.00047485833,0.0009527506],"domain_scores_gemma":[0.9960996,0.00062971376,0.00018712583,0.0024912627,0.00029703087,0.00029525303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001523003,0.00031942784,0.00031387122,0.000115784205,0.00023896393,0.00046894883,0.0050596846,0.0002821172,0.000021558551],"category_scores_gemma":[0.000028402814,0.00024606634,0.00006349781,0.00087555376,0.00007804157,0.0004312998,0.0012161,0.00045500256,0.000014619602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007889458,0.00037255036,0.00036957613,0.000029884022,0.00004112618,0.000044775592,0.000048763435,0.777652,0.000022403814,0.002911915,0.0027129,0.21571517],"study_design_scores_gemma":[0.0016311612,0.00014005363,0.00060225395,0.00004848244,0.000015669526,0.000007693385,0.000009298719,0.99333197,0.00072312524,0.0000052030023,0.0030898405,0.00039522618],"about_ca_topic_score_codex":0.000039251787,"about_ca_topic_score_gemma":0.00031213107,"teacher_disagreement_score":0.5234237,"about_ca_system_score_codex":0.00006937545,"about_ca_system_score_gemma":0.00015942605,"threshold_uncertainty_score":0.99999917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043324786,0.0006325388,0.9862902,0.00043433649,0.0063316613,0.0009761995,0.0000058474347,0.0009220662,0.00007463873],"genre_scores_gemma":[0.8081184,0.0006619347,0.18741162,0.0006410347,0.0022893783,0.00042730605,0.000010364151,0.00010885649,0.00033109367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960136,0.00016775442,0.0007802419,0.0012262927,0.00048035753,0.001331743],"domain_scores_gemma":[0.99647254,0.00083967525,0.00027850905,0.0018055753,0.00024482247,0.0003588786],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000536221,0.0005815789,0.0005788429,0.00023601364,0.0017024808,0.00023045509,0.0020062048,0.0004732539,0.000016707856],"category_scores_gemma":[0.000012318497,0.0006263771,0.00047127903,0.0012155665,0.0001430773,0.0006351276,0.000040635117,0.0010991022,0.000033693963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003837807,0.00012867054,0.00009992158,0.000015416896,0.00008436234,0.00004933589,0.0002696796,0.7576395,0.00003408938,0.00022258863,0.00021764566,0.24120037],"study_design_scores_gemma":[0.0013048121,0.00019676384,0.00008066962,0.00024303247,0.000043846223,0.00014561291,0.000019858518,0.99045575,0.0003008616,0.00018027565,0.0063476656,0.00068085955],"about_ca_topic_score_codex":0.00002639136,"about_ca_topic_score_gemma":0.000102479295,"teacher_disagreement_score":0.8037859,"about_ca_system_score_codex":0.00020837369,"about_ca_system_score_gemma":0.00015514875,"threshold_uncertainty_score":0.99961877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06720545,0.00002626547,0.9101962,0.000108308544,0.00018876084,0.0007110409,4.2139564e-7,0.000076152326,0.021487392],"genre_scores_gemma":[0.8569446,0.0000060688476,0.14264356,0.000078632766,0.00001668729,0.00014476592,0.0000014049106,0.0000036013473,0.00016063546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993162,0.000029108274,0.0001429133,0.00019727234,0.00013640402,0.00017808785],"domain_scores_gemma":[0.9995535,0.00005146051,0.000021516467,0.00027074464,0.00005374924,0.00004900032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046434114,0.000059787737,0.00006524134,0.0000467382,0.00003885909,0.000014147834,0.0003369131,0.000036482063,0.00017847103],"category_scores_gemma":[0.000014327157,0.00004987382,0.000022222002,0.00016048944,0.000011369945,0.00030363127,0.000028640867,0.000050085502,0.000024605708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015181083,0.00013780303,0.002484678,0.000011031721,0.0000042215606,9.562513e-7,0.0023055787,0.0022469822,0.00016206525,0.016180484,0.0007040972,0.9757469],"study_design_scores_gemma":[0.0004347206,0.00006637796,0.020038247,0.000011203422,0.0000026797845,0.0000014901829,0.000009865406,0.97719765,0.0006957236,0.000636558,0.0008324218,0.000073066454],"about_ca_topic_score_codex":0.000017167193,"about_ca_topic_score_gemma":0.000043954456,"teacher_disagreement_score":0.97567385,"about_ca_system_score_codex":0.000022230854,"about_ca_system_score_gemma":0.000041076204,"threshold_uncertainty_score":0.20337953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152394585,0.000093217604,0.94822264,0.00032220344,0.00019174021,0.000067880355,1.4793093e-7,0.00011692162,0.035745773],"genre_scores_gemma":[0.9883122,0.000014866262,0.010585382,0.0005577545,0.000032044733,0.00001050141,9.5088154e-7,0.0000030531642,0.00048328744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993037,0.000025208601,0.00015285725,0.00016545874,0.0001579429,0.00019483625],"domain_scores_gemma":[0.99957407,0.000020512265,0.00003454978,0.0003119131,0.000016022435,0.000042912634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056158085,0.00007230592,0.00006641351,0.000079387915,0.000028769153,0.00006349592,0.00039059168,0.000048496328,0.00025084728],"category_scores_gemma":[0.0000028778616,0.00006191802,0.000018486484,0.00034284155,0.000009114133,0.00027053803,0.00012105778,0.0000734034,0.00005111834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010744491,0.00006380037,0.00019180281,0.0000062766617,0.0000024207968,0.000033853703,0.0009021657,0.21816885,0.00014845567,0.2213895,0.034356434,0.52473533],"study_design_scores_gemma":[0.0001343847,0.000013338565,0.0010798824,0.0000051263946,3.099341e-7,0.000022295095,0.00000563177,0.98683363,0.00028882083,0.001283171,0.010256804,0.000076599164],"about_ca_topic_score_codex":0.0000138518235,"about_ca_topic_score_gemma":0.000036131947,"teacher_disagreement_score":0.9730727,"about_ca_system_score_codex":0.000047621583,"about_ca_system_score_gemma":0.0000027663853,"threshold_uncertainty_score":0.27466017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19376254,0.0033911383,0.793363,0.000056915327,0.0008146118,0.00066551054,4.6539543e-7,0.0003647778,0.007581074],"genre_scores_gemma":[0.98486453,0.0015096779,0.012490017,0.0003584876,0.000113777496,0.00020971065,0.0000021568947,0.000019749748,0.00043189808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800783,0.00004624917,0.0003934492,0.0006075665,0.00026822806,0.00067666103],"domain_scores_gemma":[0.9986504,0.0001640613,0.00008548437,0.0008949755,0.000043078995,0.00016204284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030539604,0.0002246684,0.00030565314,0.00022068659,0.00016878101,0.000085881074,0.0010890107,0.00013777071,0.00004675574],"category_scores_gemma":[0.0000104537285,0.0002126882,0.00012982996,0.0010217916,0.000092181195,0.0004451338,0.00041748895,0.0003160193,0.000069519534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043479147,0.00052029465,0.10305179,0.00004892585,0.000076691,0.0021734622,0.0019496704,0.17953327,0.00009547384,0.0068524196,0.00940429,0.69625026],"study_design_scores_gemma":[0.0005863528,0.00022881963,0.024366315,0.000044868655,0.000004421365,0.00015232441,0.000020792246,0.96435016,0.000026380152,0.0005379727,0.009269066,0.0004125332],"about_ca_topic_score_codex":0.000011870678,"about_ca_topic_score_gemma":0.000069977155,"teacher_disagreement_score":0.791102,"about_ca_system_score_codex":0.000044767276,"about_ca_system_score_gemma":0.00005464571,"threshold_uncertainty_score":0.8673173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007206529,0.00017988184,0.9938423,0.0004284888,0.0019369076,0.0013191787,0.000011753545,0.00013292594,0.0014278856],"genre_scores_gemma":[0.44565323,0.000046217985,0.5529074,0.00061435346,0.0004986033,0.00014095228,0.000018972283,0.000037822756,0.00008247458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995383,0.000041434396,0.000802147,0.001886155,0.0010185677,0.00086865935],"domain_scores_gemma":[0.99650526,0.0005531653,0.00024917978,0.002087251,0.00043178347,0.00017334179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027352523,0.000536354,0.00059610396,0.0006812215,0.00029571008,0.00040659873,0.0038039975,0.00052490825,0.000019828223],"category_scores_gemma":[0.00021562896,0.00052288926,0.00012996737,0.0006444777,0.00046869976,0.0006839866,0.0010994831,0.0013767208,0.000014260666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056857198,0.000024636862,0.000021764174,0.00004831271,0.000002839458,0.0000061548567,0.0002870779,0.63797283,0.0000272118,0.00886228,0.0000038204425,0.35273737],"study_design_scores_gemma":[0.00024868015,0.00011612642,0.00011617071,0.00023451512,0.0000066509656,0.000019768595,6.0050276e-8,0.82271016,0.00012581995,0.17574711,0.00022444481,0.00045047284],"about_ca_topic_score_codex":0.000078031815,"about_ca_topic_score_gemma":0.0007364047,"teacher_disagreement_score":0.44493258,"about_ca_system_score_codex":0.00047083895,"about_ca_system_score_gemma":0.0010854315,"threshold_uncertainty_score":0.99972224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15747607,0.00016012225,0.8388393,0.000014181677,0.0015312205,0.0015474184,0.000008840751,0.00015652625,0.00026634772],"genre_scores_gemma":[0.99390864,0.000018647643,0.0043841843,0.000047975554,0.00012754119,0.0014170534,0.00007002604,0.00001292641,0.000012985835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978982,0.000089227906,0.00099764,0.00024690264,0.00035524802,0.00041277544],"domain_scores_gemma":[0.9980147,0.00015545296,0.00061727426,0.000777434,0.00032683343,0.00010834077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816323,0.00020469743,0.00035440558,0.00027331916,0.000120186945,0.00029195307,0.00079075265,0.00025010933,0.0000049018345],"category_scores_gemma":[0.0000261954,0.00020528781,0.000082703606,0.0005675286,0.00004827932,0.0030631009,0.000055882032,0.0002621972,0.000011361006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004276222,0.00008018676,0.00020107743,0.00025923856,0.000010724534,4.617597e-7,0.0017402654,0.7525885,0.0077215875,0.0030386026,0.00028460726,0.23403199],"study_design_scores_gemma":[0.0009361544,0.00019714139,0.0002453643,0.00014586351,0.0000036738516,0.0000037308366,0.00019385784,0.9888052,0.0048018163,0.000013162894,0.004433925,0.00022012729],"about_ca_topic_score_codex":0.000041966145,"about_ca_topic_score_gemma":0.000057040354,"teacher_disagreement_score":0.8364326,"about_ca_system_score_codex":0.00007847224,"about_ca_system_score_gemma":0.00010562217,"threshold_uncertainty_score":0.83713937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043317407,0.00026109398,0.950648,0.000106039486,0.0004644448,0.00024153262,2.6787143e-7,0.00032368276,0.004637496],"genre_scores_gemma":[0.9426393,0.000014102936,0.05579411,0.00033477932,0.00016982839,0.00003665296,0.0000022388483,0.000015950574,0.0009930407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980906,0.00007637006,0.00037654562,0.0005570076,0.00028631106,0.0006131146],"domain_scores_gemma":[0.9989533,0.00013231415,0.000081243634,0.00067971053,0.00006922589,0.000084214254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043823879,0.00019921911,0.00023340266,0.00007314678,0.000068887995,0.000145195,0.0008559556,0.00013301177,0.000024792798],"category_scores_gemma":[0.000011637389,0.00018489116,0.00006178798,0.00062466983,0.000032849708,0.00041876067,0.00032280234,0.00028066203,0.00006371826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013187427,0.0005431715,0.0950406,0.000018878125,0.0000127755,0.00032054406,0.00040307044,0.664778,0.0007734603,0.047580563,0.008251638,0.18226409],"study_design_scores_gemma":[0.000732472,0.000014688474,0.030269366,0.00003084734,0.0000011601645,0.0000082184215,0.000008997994,0.9675696,0.00016758389,0.00013267816,0.0008287357,0.00023566872],"about_ca_topic_score_codex":0.0018282672,"about_ca_topic_score_gemma":0.0042787553,"teacher_disagreement_score":0.8993219,"about_ca_system_score_codex":0.00017143597,"about_ca_system_score_gemma":0.00006451165,"threshold_uncertainty_score":0.7539643},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010888904,0.0000028428906,0.87128776,0.00021363256,0.00023575843,0.117378056,3.7085047e-7,0.00034239818,0.009450316],"genre_scores_gemma":[0.2991234,0.0000027550564,0.13850799,0.0012310711,0.0010115079,0.55747813,0.0000019015017,0.000045208635,0.0025980044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980191,0.00006186147,0.00040194794,0.0005386849,0.00024933164,0.0007290515],"domain_scores_gemma":[0.9988491,0.00021624092,0.00011815606,0.0006395209,0.0000697719,0.00010720878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049812096,0.00018713807,0.00025911673,0.00004427477,0.00021929089,0.00008174101,0.0009641008,0.00010171449,0.000036654146],"category_scores_gemma":[0.00001994507,0.00016604736,0.000086785694,0.0005649828,0.000042716612,0.00040748014,0.00029680214,0.00016770745,0.000029257046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117995114,0.00044521922,0.048573386,0.00011407661,0.00004431002,0.00021090692,0.0012481418,0.012034886,0.0001375907,0.6425365,0.17043605,0.12410093],"study_design_scores_gemma":[0.0014070485,0.00011929253,0.0028829167,0.0000812752,0.0000012631587,0.000038115235,0.000007907626,0.9786132,0.0003154367,0.002113823,0.014105044,0.00031467856],"about_ca_topic_score_codex":0.00003061047,"about_ca_topic_score_gemma":0.00006828016,"teacher_disagreement_score":0.9665783,"about_ca_system_score_codex":0.00006126054,"about_ca_system_score_gemma":0.00011983897,"threshold_uncertainty_score":0.6771215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00307631,0.00045629978,0.99305975,0.00022575934,0.00037583025,0.0005742689,0.0000015742378,0.00018530033,0.0020448891],"genre_scores_gemma":[0.5538541,0.00003640815,0.44291794,0.0011386687,0.000115438765,0.00011372496,0.0000022467757,0.000027222955,0.0017942219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984873,0.000043087388,0.00022016464,0.00058957847,0.0001435276,0.0005163297],"domain_scores_gemma":[0.9987545,0.00033660952,0.00007391678,0.0005933297,0.00006254604,0.00017907469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028851943,0.0002193394,0.00022066383,0.000052581112,0.00014854541,0.00017763501,0.0005359169,0.00014095285,0.000013735306],"category_scores_gemma":[0.000027967197,0.00018486891,0.00007459587,0.0002771585,0.00005554056,0.00015660712,0.00016144248,0.00021628973,0.0000052480113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059465237,0.0010711142,0.0015617878,0.00019910364,0.0001223674,0.00003099855,0.0017809925,0.16336086,0.004070759,0.49487242,0.031577278,0.30129287],"study_design_scores_gemma":[0.0015299785,0.000092196184,0.00015651854,0.000020305082,0.000007954432,0.000037353882,0.000017510361,0.9736727,0.0007055134,0.00074117846,0.02269131,0.000327484],"about_ca_topic_score_codex":0.000016785383,"about_ca_topic_score_gemma":0.00011146396,"teacher_disagreement_score":0.81031185,"about_ca_system_score_codex":0.000019009041,"about_ca_system_score_gemma":0.000051972293,"threshold_uncertainty_score":0.7538735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046592993,0.00007531079,0.99209267,0.000045795714,0.0011785742,0.0013112583,0.0000032510711,0.00037564896,0.00025820907],"genre_scores_gemma":[0.6830665,0.000011529342,0.316166,0.00014240896,0.000111430214,0.0002247645,0.0000041114367,0.000037977643,0.0002353172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657494,0.00012373186,0.0007124926,0.0010966647,0.0002851152,0.0012070384],"domain_scores_gemma":[0.9980792,0.0003185595,0.00019692254,0.0009545032,0.00016004647,0.0002908168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010434722,0.0004153983,0.0004898522,0.00017662419,0.0002079025,0.00014485887,0.0014288977,0.00024978945,0.000022871529],"category_scores_gemma":[0.000061245075,0.0003772921,0.00018522976,0.0006369566,0.00009228338,0.00031006496,0.0005367696,0.00038393837,0.00002672558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023997019,0.00737695,0.008439358,0.00015636331,0.0002908224,0.00039810446,0.028312534,0.5000864,0.00027786937,0.09841498,0.001301732,0.35470486],"study_design_scores_gemma":[0.0028827484,0.00009753261,0.00418538,0.00007378647,0.0000095417745,0.000014885683,0.0001371036,0.9916241,0.000416442,0.000038838432,0.00002618247,0.0004934349],"about_ca_topic_score_codex":0.00040392583,"about_ca_topic_score_gemma":0.0004109453,"teacher_disagreement_score":0.6784072,"about_ca_system_score_codex":0.0001398997,"about_ca_system_score_gemma":0.000058497575,"threshold_uncertainty_score":0.9998679},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021598772,0.00046842967,0.9933939,0.0006592891,0.0017608296,0.0011587978,0.000016860584,0.00026128415,0.00012074694],"genre_scores_gemma":[0.8460347,0.0004870478,0.151798,0.00019768372,0.00044213096,0.00081539043,0.000045963327,0.000056600846,0.00012248322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974727,0.00016237136,0.00060259545,0.00074371643,0.00025749367,0.0007611213],"domain_scores_gemma":[0.996886,0.0009401953,0.00021224254,0.0016684994,0.00010012471,0.00019294625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008061921,0.00036088037,0.00039250066,0.00019222472,0.00051039323,0.00032395616,0.0014040633,0.0003478433,0.0000088260085],"category_scores_gemma":[0.000012594016,0.00038691662,0.00013902607,0.000978629,0.00013787395,0.0004882888,0.00004674761,0.0011419371,0.000003946035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001439604,0.00015065607,0.00018229478,0.000012937599,0.000031774205,0.000004167952,0.00024772974,0.11955092,0.00008253327,0.0003098326,0.0002712411,0.8791415],"study_design_scores_gemma":[0.0011001297,0.00012405959,0.00057196757,0.0001919548,0.000029941799,0.000035930487,0.00002034636,0.98151046,0.00012800025,0.0026700157,0.013204393,0.00041277797],"about_ca_topic_score_codex":0.00008023615,"about_ca_topic_score_gemma":0.0036344922,"teacher_disagreement_score":0.87872875,"about_ca_system_score_codex":0.000098593446,"about_ca_system_score_gemma":0.000055515648,"threshold_uncertainty_score":0.99985826},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013279521,0.00006209603,0.53410345,0.0003455378,0.00012151253,0.00012873497,1.2107176e-7,0.0002655562,0.46364504],"genre_scores_gemma":[0.9742366,0.00002703472,0.023035426,0.0014529186,0.000016834196,0.000023994038,6.852912e-7,0.0000040644027,0.0012024145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995357,0.000038983202,0.00008277986,0.00014048428,0.00008409555,0.00011795406],"domain_scores_gemma":[0.9989264,0.000039715134,0.000030827578,0.00093233015,0.000026800786,0.000043932865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013939418,0.000053541906,0.000053477386,0.000026694124,0.000050468236,0.000027569095,0.0008755629,0.000030398991,0.00010438117],"category_scores_gemma":[0.0000051946918,0.00004496826,0.000020605708,0.00011444391,0.000020014273,0.00015812117,0.0001829436,0.000076223645,0.00038768727],"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.0000032394032,0.000065347194,0.000037073518,9.888919e-7,0.000005256421,0.0000019732702,0.0016010888,0.000028932245,0.000012167727,0.9712954,0.0070069595,0.019941533],"study_design_scores_gemma":[0.0011761301,0.00078351947,0.016652575,0.00008162423,0.0000082534625,0.000031562984,0.00012796897,0.80930245,0.012935572,0.06220995,0.09586645,0.0008239603],"about_ca_topic_score_codex":0.000064792985,"about_ca_topic_score_gemma":0.000013528568,"teacher_disagreement_score":0.9729087,"about_ca_system_score_codex":0.000010029814,"about_ca_system_score_gemma":0.000008405875,"threshold_uncertainty_score":0.49830648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132231945,0.00026639542,0.9637749,0.00003476087,0.000055100638,0.02207015,0.000007196437,0.00025073285,0.0003175741],"genre_scores_gemma":[0.19369383,0.00012634182,0.74687034,0.00045174197,0.00026571902,0.056264915,0.000024297442,0.000089251036,0.0022135694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983049,0.00004106017,0.00021817119,0.0007673541,0.00022750764,0.00044100487],"domain_scores_gemma":[0.99825245,0.00020966325,0.00010088096,0.0011791036,0.00010606105,0.00015182828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025925646,0.000224705,0.00027805017,0.000042015625,0.0002975166,0.00010376132,0.0008537027,0.00009117549,0.0000135882865],"category_scores_gemma":[0.00001171965,0.00017046988,0.000032605272,0.00037739586,0.00011145211,0.0005015385,0.00047576774,0.00015370066,0.0000030585293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001157405,0.00070990104,0.0048825475,0.0001760969,0.0006361743,0.00056881714,0.0034297842,0.79446894,0.00036733606,0.007490434,0.042643774,0.1434688],"study_design_scores_gemma":[0.0009299622,0.00091867556,0.0002608527,0.00005130375,0.000008359233,0.000110735375,0.000041538442,0.96837676,0.00014038086,0.000036485708,0.02883241,0.00029256218],"about_ca_topic_score_codex":0.000016175754,"about_ca_topic_score_gemma":0.000066078785,"teacher_disagreement_score":0.21690455,"about_ca_system_score_codex":0.000036953483,"about_ca_system_score_gemma":0.00009695361,"threshold_uncertainty_score":0.695156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6144648,0.01673386,0.25235942,0.015514467,0.0013379684,0.0025646926,0.000023119352,0.00085680385,0.09614483],"genre_scores_gemma":[0.87974197,0.001342022,0.11833401,0.00011170778,0.000056167126,0.000116018244,0.000013965868,0.000009876746,0.00027429409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985079,0.00024730494,0.0003870065,0.00021252928,0.00045107518,0.00019418262],"domain_scores_gemma":[0.9950176,0.00016928384,0.00020068661,0.0040197466,0.00053380127,0.000058905225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011426525,0.00011854256,0.0001540656,0.00011111438,0.0001528517,0.000035201785,0.0028449479,0.00005901343,0.000047453974],"category_scores_gemma":[0.000053472537,0.00012173819,0.000053720047,0.000556269,0.00010107317,0.0005888866,0.0004277233,0.00019918893,0.00037974663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044766293,0.0002757577,0.00038339023,0.000008522174,0.00002091607,1.0415095e-7,0.00065859826,0.023181414,0.002391857,0.0021732035,0.0037847704,0.967117],"study_design_scores_gemma":[0.00047919288,0.000043367632,0.0071241893,0.00003206714,0.000021340968,0.0000050456624,0.0000056329973,0.9349089,0.0007235225,0.000098472185,0.056436997,0.00012122358],"about_ca_topic_score_codex":0.0000029322673,"about_ca_topic_score_gemma":0.00017180695,"teacher_disagreement_score":0.9669958,"about_ca_system_score_codex":0.0001082957,"about_ca_system_score_gemma":0.000118801174,"threshold_uncertainty_score":0.52866685},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019875872,0.0013697853,0.9920204,0.000074077136,0.00047448286,0.0054512257,0.0000050966546,0.00008888568,0.00031724892],"genre_scores_gemma":[0.45013765,0.00030900553,0.54648095,0.0006427304,0.00074738386,0.0014489554,0.000014601634,0.00006985026,0.00014885473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961029,0.0000366152,0.0008040537,0.001405708,0.00072562724,0.00092507905],"domain_scores_gemma":[0.9963954,0.00082580437,0.00069644366,0.0015499908,0.00032165265,0.0002106702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017841726,0.0005419209,0.001010943,0.00092383625,0.00026388277,0.00031839235,0.0026777857,0.00040204226,0.000011555857],"category_scores_gemma":[0.00005249453,0.0004925912,0.0002397567,0.0014995108,0.00061167864,0.0007400587,0.0014415596,0.0006255651,0.000001962582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001189639,0.000018402208,0.000797434,0.00006581444,0.00007761893,0.000002289995,0.00037371958,0.19746473,0.000013833052,0.0035164352,0.0000059540844,0.7976519],"study_design_scores_gemma":[0.00024888743,0.00025000345,0.001263534,0.00042281026,0.00010423355,0.000010574425,9.614643e-8,0.99304336,0.00011309052,0.002739295,0.0012882797,0.0005158614],"about_ca_topic_score_codex":0.000003406708,"about_ca_topic_score_gemma":0.00004266364,"teacher_disagreement_score":0.797136,"about_ca_system_score_codex":0.00016070924,"about_ca_system_score_gemma":0.00022618743,"threshold_uncertainty_score":0.9997526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061737746,0.0001869651,0.9792703,0.00007581541,0.00075555523,0.000118204814,1.0022422e-7,0.00020744697,0.013211871],"genre_scores_gemma":[0.9611606,0.00004520048,0.03602606,0.0007228914,0.00008989366,0.000029703802,0.0000013294139,0.000020666346,0.0019036621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784285,0.00020064814,0.00041131576,0.0006211598,0.00021627349,0.00070777157],"domain_scores_gemma":[0.99876845,0.00018145076,0.000097823,0.0007489541,0.000051701765,0.00015161371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047365692,0.00022396057,0.00025534205,0.00009743472,0.00009427249,0.00017563232,0.00085169857,0.00015513698,0.00005430222],"category_scores_gemma":[0.00003142358,0.0002147092,0.00007098839,0.00088564504,0.00003900552,0.00040801874,0.00023889943,0.00025407068,0.000027802345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049453442,0.0002288517,0.0067796735,0.0000048618795,0.000016239157,0.00012394464,0.00033740065,0.043399494,0.00012883717,0.7528433,0.0022826043,0.19384985],"study_design_scores_gemma":[0.00062704954,0.000025329933,0.0006003312,0.000028717895,0.0000015746774,0.000022509454,0.000038477425,0.99434924,0.00025032897,0.0002349518,0.0035365785,0.000284936],"about_ca_topic_score_codex":0.0002117784,"about_ca_topic_score_gemma":0.00045807523,"teacher_disagreement_score":0.9549868,"about_ca_system_score_codex":0.00007635409,"about_ca_system_score_gemma":0.000058992173,"threshold_uncertainty_score":0.87555873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01767609,0.00006653877,0.978623,0.0006830389,0.00055607356,0.00087931805,0.00000223556,0.0005607328,0.0009530077],"genre_scores_gemma":[0.87543607,0.0000030396761,0.12095539,0.0027966013,0.00031167723,0.00010274571,0.00001392541,0.000021477497,0.00035906376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997605,0.00007772166,0.00036799547,0.0008089871,0.00034164672,0.00079864374],"domain_scores_gemma":[0.99801236,0.00019165566,0.00011550948,0.0011769908,0.00019203467,0.00031146558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005414042,0.00030138428,0.0003141945,0.00012069318,0.00023245822,0.00030135777,0.001177639,0.00017704706,0.000026829897],"category_scores_gemma":[0.000015243442,0.0002642734,0.00015140402,0.0005659878,0.000046174027,0.0002608702,0.00008122193,0.00019768608,0.000023155411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010432876,0.0007536388,0.00008256502,0.000014525142,0.000023807459,0.000017073466,0.00018505109,0.6766537,0.0025843498,0.24299087,0.006356618,0.07023349],"study_design_scores_gemma":[0.0015190835,0.00035892622,0.00020137859,0.000028358763,0.000008167293,0.000003076979,0.00000849151,0.9925122,0.0039924798,0.00036856043,0.000628065,0.00037115658],"about_ca_topic_score_codex":0.000010675405,"about_ca_topic_score_gemma":0.000014851722,"teacher_disagreement_score":0.85776,"about_ca_system_score_codex":0.000059609287,"about_ca_system_score_gemma":0.00007432851,"threshold_uncertainty_score":0.9999809},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21423766,0.00023245027,0.78443843,0.00013193737,0.0001743422,0.00013688946,3.3779907e-7,0.0001083056,0.00053962815],"genre_scores_gemma":[0.94286567,0.00031110056,0.056478932,0.000115553165,0.000046385274,0.000021335649,0.000007294658,0.000009153792,0.00014455203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984229,0.00004911315,0.00041976816,0.00045663558,0.00026468493,0.00038685946],"domain_scores_gemma":[0.9991231,0.00005158084,0.00014217458,0.0005193207,0.00009074325,0.000073077805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003813365,0.00016187104,0.00033118814,0.00045052925,0.000059290167,0.000052461677,0.000634199,0.000105021645,0.000029664883],"category_scores_gemma":[0.0000054473257,0.00015368644,0.00012396081,0.004866958,0.00003823898,0.0004716242,0.0001547555,0.00026489847,0.000010802888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038367957,0.000039487833,0.0053043454,0.0000032414682,0.000073129915,0.0000024789126,0.00010191876,0.8141896,0.000028217106,0.00080488506,0.000007598023,0.17944121],"study_design_scores_gemma":[0.00046389012,0.000109573084,0.048395425,0.000020904792,0.000051816074,0.0000043073464,0.0000047922895,0.95046103,0.00010724287,0.00017380212,0.00004691177,0.00016027706],"about_ca_topic_score_codex":0.00015563902,"about_ca_topic_score_gemma":0.0022877562,"teacher_disagreement_score":0.72862804,"about_ca_system_score_codex":0.00020107675,"about_ca_system_score_gemma":0.000067845634,"threshold_uncertainty_score":0.6267151},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23235586,0.000023625844,0.76633286,0.00010665994,0.0001511461,0.00054164015,2.1247062e-7,0.00018252865,0.00030546446],"genre_scores_gemma":[0.6598307,0.0000015102981,0.33959988,0.00025164537,0.0000915421,0.00012437839,0.0000013842113,0.00001355727,0.00008543319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829066,0.0000449445,0.00033042132,0.00055177516,0.00016855272,0.0006136738],"domain_scores_gemma":[0.99886674,0.00017976233,0.00007763778,0.0006073263,0.000113176546,0.00015535341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041559848,0.00016780497,0.0001943511,0.00008116671,0.00010954541,0.0002805822,0.00074127654,0.00010642438,0.000011169156],"category_scores_gemma":[0.000017378921,0.0001547482,0.00005371263,0.0003387236,0.00002352004,0.00042565056,0.00017413498,0.00018743172,0.0000182971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020848863,0.00005385728,0.00020613172,0.000005433057,0.0000022371235,0.0000012629888,0.00017350835,0.9492258,0.0002540424,0.012563458,0.000055406177,0.03745678],"study_design_scores_gemma":[0.00033301685,0.000034003693,0.00016122832,0.000028827377,0.0000014764469,0.0000035605653,0.000035627818,0.9986891,0.00009322997,0.000406479,0.0000048039246,0.00020861463],"about_ca_topic_score_codex":0.00007842163,"about_ca_topic_score_gemma":0.000034969526,"teacher_disagreement_score":0.4274748,"about_ca_system_score_codex":0.00005377776,"about_ca_system_score_gemma":0.000040851464,"threshold_uncertainty_score":0.63104486},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2801265,0.0061521246,0.69501424,0.00021108385,0.0004707541,0.00080066605,0.000001334375,0.0002525088,0.016970793],"genre_scores_gemma":[0.99079955,0.00022264193,0.006351849,0.002116125,0.000022529786,0.0001394459,0.0000017627374,0.000011979029,0.00033411995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984992,0.00011221909,0.00026510295,0.00048153003,0.00019436605,0.0004475382],"domain_scores_gemma":[0.9991366,0.00014050392,0.000052440788,0.0005126256,0.00005121897,0.00010659242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045803175,0.00015658703,0.0001829418,0.000062858024,0.00008978744,0.00013662748,0.00033463704,0.00008767699,0.00014948782],"category_scores_gemma":[0.000011829152,0.00014663416,0.000028482975,0.00075792783,0.000025821142,0.00014002662,0.00015418444,0.00017274487,0.000054937267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009126774,0.00015934645,0.0010463658,0.000014585228,0.0000071917193,0.0000325356,0.0003254424,0.92838657,0.000036952133,0.059231017,0.0009642468,0.009786646],"study_design_scores_gemma":[0.00070141675,0.00006772428,0.0010690183,0.00002735909,0.0000023324783,0.00002789441,0.000035943372,0.9663016,0.000073674826,0.0013586539,0.030117175,0.00021720139],"about_ca_topic_score_codex":0.000016944929,"about_ca_topic_score_gemma":0.00014630657,"teacher_disagreement_score":0.71067303,"about_ca_system_score_codex":0.000047177105,"about_ca_system_score_gemma":0.000043855416,"threshold_uncertainty_score":0.5979567},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000421887,0.000019107489,0.8818004,0.0011281563,0.00012572999,0.111810185,6.9367934e-7,0.000443199,0.0046303407],"genre_scores_gemma":[0.019467264,0.0000037260488,0.2237987,0.0024551828,0.0008533228,0.7474879,0.0000028815352,0.000036950467,0.0058940626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982524,0.000041299758,0.00032326608,0.00055939803,0.00022482366,0.00059883855],"domain_scores_gemma":[0.99865717,0.00014527525,0.00010398664,0.0008374553,0.00009409018,0.00016201346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000293146,0.00021056598,0.00021022637,0.00004614452,0.00013626418,0.00021379712,0.0012241296,0.00013405082,0.00014775906],"category_scores_gemma":[0.000007680904,0.00017730691,0.000118856165,0.00031539574,0.00003617339,0.00052531407,0.0003226507,0.000173372,0.000086491935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040300034,0.00011919821,0.00004315718,0.000023944402,0.000015213624,0.0000050141484,0.000093451905,0.012615043,0.000015770549,0.0432065,0.10712257,0.83669984],"study_design_scores_gemma":[0.00074873446,0.00011279529,0.000045576584,0.000020312584,0.0000016420305,0.000007353534,0.0000029295998,0.64881045,0.00017441227,0.00047770227,0.3494201,0.00017796492],"about_ca_topic_score_codex":0.000003358113,"about_ca_topic_score_gemma":0.000093114555,"teacher_disagreement_score":0.83652186,"about_ca_system_score_codex":0.000064997934,"about_ca_system_score_gemma":0.000065713895,"threshold_uncertainty_score":0.7230366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050850473,0.00008653527,0.991795,0.00032020357,0.00040879712,0.0011301434,5.854747e-7,0.0002981112,0.00087556546],"genre_scores_gemma":[0.8232931,0.000039453145,0.17370869,0.00052589946,0.00016591263,0.00041550474,0.0000021106503,0.000018115325,0.0018312032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981823,0.00011703614,0.00034398102,0.0006035663,0.00014660918,0.00060650305],"domain_scores_gemma":[0.9983184,0.0005094995,0.0001392529,0.00070027204,0.00017020492,0.00016239524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000273118,0.00025233589,0.0005439477,0.00006653275,0.00022426907,0.000068303954,0.0011226548,0.00014233861,0.00003998725],"category_scores_gemma":[0.000019327728,0.0001804355,0.00011051732,0.00026284254,0.00019272638,0.0002924815,0.00016185112,0.000199294,0.000013035585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025853592,0.0008978142,0.006603567,0.000035290275,0.0006313814,0.00035673348,0.002114822,0.023675187,0.00040728744,0.864162,0.03339727,0.06513327],"study_design_scores_gemma":[0.006244423,0.00055938767,0.0003918587,0.000016315105,0.000012928208,0.00014962073,0.000016520898,0.9916861,0.00022764967,0.00015858645,0.00026268113,0.00027389935],"about_ca_topic_score_codex":0.00003791438,"about_ca_topic_score_gemma":0.00015306263,"teacher_disagreement_score":0.96801096,"about_ca_system_score_codex":0.000048512673,"about_ca_system_score_gemma":0.000117360905,"threshold_uncertainty_score":0.7357946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13019674,0.000025350424,0.78583616,0.000048426144,0.00013675795,0.083509184,0.0000014031216,0.0000713666,0.00017458238],"genre_scores_gemma":[0.77742743,0.0000057331945,0.016436845,0.00028253807,0.00026513016,0.20549673,0.0000139864715,0.000016356033,0.000055233115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979889,0.00015597092,0.00042109462,0.00048327228,0.0006356123,0.00031518115],"domain_scores_gemma":[0.99819744,0.000065199885,0.0002447831,0.00066069985,0.00076636183,0.000065519176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006976617,0.00019749968,0.00021843906,0.00005731681,0.00020141533,0.00008576393,0.00055049185,0.00006124466,0.000019017038],"category_scores_gemma":[0.000015679947,0.00017452179,0.000096160926,0.0003279682,0.00003478246,0.0014916329,0.0001582146,0.00009653007,0.0000070244014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050275885,0.00008729995,0.00010062536,0.000023086746,0.000025798192,0.000002589961,0.00009236967,0.9725861,0.00055438123,0.0004676311,0.0007427924,0.025267035],"study_design_scores_gemma":[0.0010987823,0.00033459574,0.00018222912,0.000034829936,0.000016500713,0.00006323608,0.0000030466572,0.98171425,0.015853131,0.00006101198,0.00043953562,0.00019885863],"about_ca_topic_score_codex":0.000023559951,"about_ca_topic_score_gemma":0.00003559369,"teacher_disagreement_score":0.76939934,"about_ca_system_score_codex":0.00010712667,"about_ca_system_score_gemma":0.00022904413,"threshold_uncertainty_score":0.7116792},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000357151,0.0000077495615,0.62607694,0.000026886659,0.000093974755,0.000015043177,5.8240808e-9,0.000111502464,0.37331077],"genre_scores_gemma":[0.7818091,0.0000013519547,0.21565548,0.0004674858,0.000020496424,0.0000037789648,2.8860706e-8,0.0000014763181,0.0020408174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975175,0.000005725599,0.000036055924,0.000086153115,0.0000411492,0.0000791707],"domain_scores_gemma":[0.9996767,0.000006038709,0.0000070483675,0.00027310033,0.000008513628,0.000028586486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004239833,0.00002268247,0.000022398937,0.000009199755,0.000012545657,0.000011767352,0.00038523367,0.000011252519,0.00032886397],"category_scores_gemma":[0.0000014538509,0.00001788428,0.000010853414,0.00007675703,0.000006024957,0.0001387017,0.0000961781,0.000021859141,0.00046224814],"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":[1.7238906e-7,0.000009307514,0.0003140702,2.2223375e-7,0.0000011139856,0.000004350193,0.00016110115,9.570896e-7,0.000011441779,0.9434924,0.0052295057,0.050775353],"study_design_scores_gemma":[0.0006883726,0.00033911923,0.0675268,0.000013101007,0.0000052863293,0.00009072277,0.000040024446,0.37565726,0.028583292,0.33999532,0.18616968,0.00089102384],"about_ca_topic_score_codex":0.000013628138,"about_ca_topic_score_gemma":0.0000034798495,"teacher_disagreement_score":0.78145194,"about_ca_system_score_codex":0.0000025078778,"about_ca_system_score_gemma":0.0000052905075,"threshold_uncertainty_score":0.5941419},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047462806,0.00015225,0.9875221,0.004511124,0.0004935336,0.00060825,0.0000019662282,0.0001613242,0.0018031336],"genre_scores_gemma":[0.96858114,0.00002039145,0.01918211,0.011031398,0.00034059,0.00019891192,0.0000051271645,0.000017801203,0.000622524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981788,0.000118391305,0.00035142794,0.0005532627,0.00017796602,0.000620193],"domain_scores_gemma":[0.9982977,0.00077029655,0.00008001638,0.0006740201,0.000052741485,0.00012522406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049125805,0.00020363301,0.0003247783,0.000114867005,0.00006953763,0.00006566204,0.0007889884,0.00019940964,0.00011420083],"category_scores_gemma":[0.000020016596,0.00018534635,0.000094082694,0.00030392644,0.000063243686,0.00021365378,0.00008267874,0.00024446385,0.000047856298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018572567,0.00023350667,0.000300213,0.0000031777893,0.000011458676,0.000011261095,0.00005201951,0.40029055,0.000047076628,0.11437492,0.009122509,0.47536758],"study_design_scores_gemma":[0.0029477892,0.00054965855,0.00042948092,0.00001548931,0.0000033833758,0.0000026736518,0.0000065578047,0.98058224,0.000075566815,0.00021175091,0.014960771,0.00021466907],"about_ca_topic_score_codex":0.000008174796,"about_ca_topic_score_gemma":0.00047857154,"teacher_disagreement_score":0.96834004,"about_ca_system_score_codex":0.00010281147,"about_ca_system_score_gemma":0.000066960136,"threshold_uncertainty_score":0.75582045},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095427185,0.0014427697,0.98757786,0.000111271394,0.00028167877,0.0005689611,0.0000013674256,0.0002810887,0.00019229334],"genre_scores_gemma":[0.52910495,0.00007426259,0.46974316,0.00014242409,0.00015491557,0.000045524117,0.000010494753,0.0000180895,0.0007062138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845546,0.000050819195,0.00030955987,0.0005614792,0.00016283793,0.00045982256],"domain_scores_gemma":[0.99918497,0.00020223403,0.0000968415,0.0003401971,0.0000654866,0.00011027574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034089142,0.00020120398,0.000185501,0.000047827783,0.0002510872,0.00024982577,0.00032971954,0.00015032954,0.000008571634],"category_scores_gemma":[0.000014986008,0.00017728956,0.000078477,0.00021748332,0.000033314936,0.0006716289,0.00010525128,0.00015174826,0.0000032208418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007317282,0.00032949564,0.00716388,0.000044336575,0.000020759613,0.000009940167,0.00039569748,0.33345133,0.0023246524,0.0055258637,0.0076528797,0.643008],"study_design_scores_gemma":[0.0013289916,0.00007709916,0.009112558,0.00004679167,0.000009077372,0.000006962927,0.000011893932,0.98277426,0.00011814225,0.00016487719,0.00611153,0.0002377978],"about_ca_topic_score_codex":0.00010310403,"about_ca_topic_score_gemma":0.00026886005,"teacher_disagreement_score":0.6493229,"about_ca_system_score_codex":0.00004828713,"about_ca_system_score_gemma":0.000019023248,"threshold_uncertainty_score":0.72296584},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006101016,0.0000029960208,0.9441943,0.0001385093,0.00028224767,0.05261527,0.000006796277,0.0006783135,0.0014714643],"genre_scores_gemma":[0.2295288,0.000005067162,0.21364018,0.0009008709,0.001368423,0.55040365,0.00008694293,0.00009871108,0.003967331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974954,0.00006975098,0.00041325847,0.0008928903,0.000505821,0.0006228548],"domain_scores_gemma":[0.99807507,0.0002602249,0.0001907401,0.00072857644,0.00038271956,0.00036265215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028304814,0.0003419504,0.00032684728,0.00010443241,0.0005968554,0.00014217223,0.00079499074,0.00015179718,0.0001223326],"category_scores_gemma":[0.000015990232,0.00027317414,0.00010787504,0.00052058115,0.00016484708,0.00070680404,0.000114792565,0.00025596775,0.000009991764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005647065,0.011698661,0.07839458,0.00042659728,0.0012160792,0.0011453332,0.0015742969,0.35950875,0.009586546,0.13709234,0.13405044,0.25965932],"study_design_scores_gemma":[0.001957595,0.0006204588,0.0047992202,0.000041919495,0.00000868298,0.0003845213,0.000010023459,0.976668,0.00045482465,0.00020182406,0.014359225,0.00049371476],"about_ca_topic_score_codex":0.000066513756,"about_ca_topic_score_gemma":0.00010627453,"teacher_disagreement_score":0.7305541,"about_ca_system_score_codex":0.000099609555,"about_ca_system_score_gemma":0.00031518308,"threshold_uncertainty_score":0.99997205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048827176,0.00077777315,0.9540507,0.0007203523,0.000076437136,0.04349386,0.0000049130726,0.00011851703,0.00026912818],"genre_scores_gemma":[0.8154837,0.00015107602,0.011499428,0.0004126749,0.00018554748,0.17203507,0.00018492842,0.000017454533,0.000030146988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986443,0.00026512024,0.00029509846,0.00025660446,0.00016144806,0.00037745343],"domain_scores_gemma":[0.99810517,0.00019128936,0.00020356708,0.0013011177,0.000042777025,0.00015609158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077096716,0.00016693033,0.00016367095,0.000026952343,0.00038684462,0.000120807235,0.0008348918,0.00018387823,0.000010149044],"category_scores_gemma":[0.000025177224,0.0001674375,0.000058709356,0.0001725421,0.00008241418,0.0007264638,0.0004849993,0.00029839526,0.0000062643917],"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.00028891678,0.0021883522,0.007833249,0.0003173319,0.00022358239,0.0000013029552,0.011620686,0.016572772,0.00008117511,0.76636887,0.03778025,0.1567235],"study_design_scores_gemma":[0.00083007896,0.00005661873,0.002338737,0.00006958889,0.0000129618875,0.000007446635,0.00003936137,0.7247304,0.000050203536,0.007452948,0.2641645,0.000247184],"about_ca_topic_score_codex":0.000008052077,"about_ca_topic_score_gemma":0.00000935458,"teacher_disagreement_score":0.9425513,"about_ca_system_score_codex":0.000055746703,"about_ca_system_score_gemma":0.000014912623,"threshold_uncertainty_score":0.68279034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06539542,0.00006469715,0.83467835,0.000035101686,0.00011449636,0.09945631,0.0000010635428,0.0002012306,0.00005334938],"genre_scores_gemma":[0.521069,0.000005561006,0.03897582,0.00022545936,0.000102851045,0.43944576,0.000007759716,0.000027018987,0.00014075759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984168,0.000083110535,0.000289154,0.0006630951,0.00020528918,0.00034255],"domain_scores_gemma":[0.9988863,0.00017111775,0.00013412606,0.00049469643,0.00014462176,0.00016915689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035349443,0.00019587982,0.00021790623,0.00006454351,0.0002810755,0.00015150523,0.00030267978,0.0001027112,0.000007077499],"category_scores_gemma":[0.000011135161,0.00016664872,0.000033392964,0.00028946353,0.00012116938,0.00029341836,0.00008085002,0.000100898375,7.1213776e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025538556,0.00047976503,0.0012386934,0.00013864187,0.0000108394515,0.000017305425,0.000975537,0.48409733,0.00008702786,0.0011649439,0.001178876,0.51035565],"study_design_scores_gemma":[0.0016690681,0.00088760804,0.000896985,0.00004089864,0.0000037294042,0.00003530249,0.000025370511,0.99257565,0.0008358568,0.000051194198,0.0027473422,0.0002310232],"about_ca_topic_score_codex":0.0000040231175,"about_ca_topic_score_gemma":0.000012763773,"teacher_disagreement_score":0.7957025,"about_ca_system_score_codex":0.000033654338,"about_ca_system_score_gemma":0.00009482729,"threshold_uncertainty_score":0.6795738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14629231,0.0000063224975,0.7987704,0.00017152529,0.00008095289,0.03692197,0.0000032314,0.00049621635,0.017257052],"genre_scores_gemma":[0.87596303,7.489597e-7,0.117687106,0.0004370717,0.00007726778,0.0048411726,0.0000024711644,0.00002604576,0.00096505356],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977357,0.00005047075,0.0004924742,0.00055796374,0.0005439198,0.00061951776],"domain_scores_gemma":[0.9984225,0.00013518603,0.00029064965,0.0008281412,0.00017306305,0.00015047027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008033435,0.0002340979,0.00027438736,0.000100596946,0.00010952402,0.00009782011,0.0011444866,0.00010382511,0.000040959556],"category_scores_gemma":[0.000026283506,0.00015964064,0.00004478183,0.000863928,0.00011262202,0.00038059673,0.00031696752,0.0002301386,0.0000068266304],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020807986,0.0028782513,0.4607948,0.0006549851,0.00020161277,0.0056118225,0.0071297414,0.018972011,0.005971509,0.16089718,0.012369112,0.32243818],"study_design_scores_gemma":[0.01493471,0.0066378415,0.24146147,0.002621754,0.00012155745,0.0023770854,0.0014447116,0.55979717,0.1472865,0.0004144975,0.01803662,0.004866086],"about_ca_topic_score_codex":0.0001291971,"about_ca_topic_score_gemma":0.000734538,"teacher_disagreement_score":0.72967076,"about_ca_system_score_codex":0.000023962126,"about_ca_system_score_gemma":0.00012048791,"threshold_uncertainty_score":0.6509956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060901728,0.00024306719,0.9363325,0.0009866183,0.00017409747,0.00078030897,0.0000040746813,0.00015795472,0.00041961588],"genre_scores_gemma":[0.8393254,0.00005000631,0.15682715,0.0031602052,0.00019679901,0.00019073616,0.000034909714,0.000022000877,0.00019278395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825436,0.00008945042,0.0002937966,0.0005569764,0.0002915424,0.00051387225],"domain_scores_gemma":[0.9988184,0.000118596145,0.0000845388,0.000804548,0.000028505074,0.00014542745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035170806,0.00018959615,0.00021055841,0.000050732604,0.00013927519,0.000052292522,0.0006242601,0.00010777617,0.000061256294],"category_scores_gemma":[0.0000026433358,0.00018686445,0.000045618883,0.00033822583,0.000026278438,0.00041911105,0.00009572642,0.00011484733,0.000036334826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104048675,0.00038915084,0.0036227743,0.00004096654,0.000013767824,0.000075237214,0.00039111226,0.96917063,0.00034729383,0.0076550054,0.010713769,0.0074762516],"study_design_scores_gemma":[0.0012488784,0.00024942466,0.013874091,0.000025780557,0.000003876917,0.000012568447,0.0000079979745,0.9677269,0.00045164622,0.0008022501,0.0153272245,0.00026938043],"about_ca_topic_score_codex":0.0001685497,"about_ca_topic_score_gemma":0.00036782422,"teacher_disagreement_score":0.7795054,"about_ca_system_score_codex":0.00013898796,"about_ca_system_score_gemma":0.00007225462,"threshold_uncertainty_score":0.7620111},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059059087,0.0013494792,0.887927,0.0006894325,0.0009985573,0.00043267087,8.2436594e-7,0.0006136392,0.048929293],"genre_scores_gemma":[0.97444725,0.00006621916,0.020345742,0.00053785223,0.00027419144,0.000032518128,0.00000788688,0.000024751165,0.004263602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785435,0.00009407991,0.0004472993,0.00062429503,0.00030790464,0.0006720404],"domain_scores_gemma":[0.99875903,0.00011428906,0.000100589095,0.0008615461,0.000053268755,0.00011128349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029399892,0.00023518078,0.0002744187,0.00012811515,0.00007489105,0.00023828332,0.0011251534,0.00016193153,0.0001380812],"category_scores_gemma":[0.0000038821836,0.00022164556,0.00008390943,0.001094144,0.00005702018,0.00040706983,0.0003690001,0.00031243716,0.00013698002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022218388,0.00033342023,0.006583914,0.000011712443,0.000013616827,0.000285119,0.00008265454,0.04056806,0.00021942548,0.08329846,0.03358591,0.8349955],"study_design_scores_gemma":[0.00071874587,0.000055422766,0.042694636,0.00004216305,0.0000033188646,0.000047920825,0.000011372075,0.93591934,0.00012619136,0.0010772832,0.018912703,0.0003909048],"about_ca_topic_score_codex":0.00028630404,"about_ca_topic_score_gemma":0.0012650928,"teacher_disagreement_score":0.91538817,"about_ca_system_score_codex":0.00010991543,"about_ca_system_score_gemma":0.00004863084,"threshold_uncertainty_score":0.9038444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69677144,0.0000031690586,0.30233905,0.000056232184,0.00023706049,0.0001499721,0.0000015605947,0.000024736737,0.0004167709],"genre_scores_gemma":[0.984935,0.000011444006,0.01478647,0.00023194186,0.00002595236,0.000004544678,9.1538305e-7,0.0000019789263,0.0000017939171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866176,0.000027625925,0.000365768,0.00017019993,0.00055203354,0.0002226072],"domain_scores_gemma":[0.9985286,0.0002933985,0.0003165469,0.0004043997,0.0003774511,0.00007961826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013162455,0.00011646845,0.00013835536,0.00036163285,0.00026046124,0.0002186253,0.00079781143,0.000042825435,0.000005148431],"category_scores_gemma":[0.000106736596,0.00007378694,0.000051991377,0.0017802296,0.0002616922,0.0030651006,0.00016787575,0.00022252367,0.0000076813585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078335725,0.00017415298,0.027227676,0.00006981968,0.000024362254,3.063175e-7,0.0038802482,0.17061561,0.003741844,0.08179449,0.00038782074,0.7120053],"study_design_scores_gemma":[0.0002128481,0.0005309473,0.09570781,0.00002827354,0.0000016609328,0.0000041399953,0.00000401187,0.89818233,0.005141462,0.00001431754,0.00009660192,0.00007557299],"about_ca_topic_score_codex":0.0000048036372,"about_ca_topic_score_gemma":6.292914e-7,"teacher_disagreement_score":0.7275667,"about_ca_system_score_codex":0.000037988975,"about_ca_system_score_gemma":0.00018266057,"threshold_uncertainty_score":0.3008944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002395407,0.0008493442,0.9912823,0.00079908554,0.00031875752,0.0012767208,0.00000408545,0.00030483308,0.0027694607],"genre_scores_gemma":[0.7908238,0.000024743678,0.19811884,0.00970995,0.00045677036,0.00059049047,0.000032773638,0.000035272846,0.00020732981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971276,0.00021032541,0.0007289209,0.00080536434,0.00041798354,0.00070980017],"domain_scores_gemma":[0.99694186,0.0007080984,0.0003039696,0.001532828,0.0003102255,0.00020298891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011505542,0.00032543298,0.0004956137,0.00008005894,0.0001296991,0.00010883654,0.001529917,0.00023519534,0.00004139729],"category_scores_gemma":[0.000026290314,0.00028693816,0.00024057641,0.0008340708,0.000049046663,0.0003757971,0.00025139193,0.0003249424,0.0000062899167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008150651,0.00024798594,0.000050687235,0.000028523242,0.000012285929,3.4497546e-7,0.00005392214,0.8242925,0.0000052516166,0.0038607563,0.0026852617,0.16868097],"study_design_scores_gemma":[0.0010893724,0.0003046806,0.00039706004,0.00001526864,0.000007907479,0.000001878827,0.000018467554,0.9907992,0.000032052536,0.00008000347,0.006934089,0.00032002208],"about_ca_topic_score_codex":0.000016399528,"about_ca_topic_score_gemma":0.00011743661,"teacher_disagreement_score":0.7931635,"about_ca_system_score_codex":0.00006894903,"about_ca_system_score_gemma":0.000055454464,"threshold_uncertainty_score":0.9999583},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034317728,0.002369166,0.95998335,0.0016464421,0.0011972723,0.00036284374,0.000040163963,0.000069836846,0.000013213507],"genre_scores_gemma":[0.982168,0.00013780285,0.016400103,0.0002734026,0.0008180442,0.00001834438,0.000135996,0.000031085645,0.000017179053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974613,0.00014985561,0.0009104575,0.00043480252,0.000570516,0.00047303853],"domain_scores_gemma":[0.99617904,0.0005799199,0.00091777515,0.00026657997,0.0018615598,0.00019515047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065007905,0.0003095045,0.0004231038,0.00014805673,0.00016995828,0.0005699627,0.0006959051,0.00023606369,0.000005984419],"category_scores_gemma":[0.000078239784,0.00028828668,0.0001333572,0.0004052249,0.00016500989,0.00049432117,0.00016488935,0.00042346804,5.232475e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007847415,0.00030720516,0.01254951,0.00003127743,0.00034783647,0.00027470585,0.00008006677,0.89411896,0.000056704215,0.0053484067,0.0054028826,0.080697715],"study_design_scores_gemma":[0.0024984733,0.00019177802,0.006360268,0.00028544397,0.000043364173,0.00031179574,0.000044818673,0.98680705,0.000058132286,0.0002463359,0.002853725,0.00029880626],"about_ca_topic_score_codex":0.000007699821,"about_ca_topic_score_gemma":0.000011986096,"teacher_disagreement_score":0.9478503,"about_ca_system_score_codex":0.00015833565,"about_ca_system_score_gemma":0.00009956631,"threshold_uncertainty_score":0.9999569},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008042343,0.000027955033,0.894262,0.00017065373,0.00027329355,0.103164256,0.000001172648,0.0006606096,0.0013596525],"genre_scores_gemma":[0.08944074,0.0000023889718,0.24896026,0.0008373432,0.0010636654,0.6543804,0.000009799844,0.000094221294,0.005211201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972315,0.00007352864,0.0005827093,0.0008518761,0.00029797983,0.00096240593],"domain_scores_gemma":[0.9983386,0.0002049869,0.00023960328,0.00088703464,0.00018042504,0.0001493537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056140067,0.00034263145,0.0003361471,0.00006928984,0.00030936208,0.00036290643,0.0012592489,0.00021693332,0.000025066787],"category_scores_gemma":[0.000017153332,0.00030279852,0.00018269809,0.00048788133,0.00005360668,0.0005131175,0.00045603365,0.00026882312,0.000033661774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023215153,0.001655987,0.0009363434,0.0002460592,0.0001013606,0.00008216585,0.0006172287,0.35006875,0.0002432092,0.18510388,0.08933863,0.37137425],"study_design_scores_gemma":[0.0021783358,0.00014064909,0.00026885723,0.00007247512,0.000004453445,0.000010639544,0.000013454761,0.9781893,0.00032692277,0.001009009,0.017380273,0.00040561307],"about_ca_topic_score_codex":0.00006827731,"about_ca_topic_score_gemma":0.00030481993,"teacher_disagreement_score":0.6453017,"about_ca_system_score_codex":0.00008902249,"about_ca_system_score_gemma":0.00007619739,"threshold_uncertainty_score":0.9999424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005684478,0.006024082,0.9845752,0.0009806304,0.0014457649,0.0011541846,0.000014000965,0.00010407463,0.000017548142],"genre_scores_gemma":[0.9800363,0.0012523086,0.016433463,0.001482399,0.00053955265,0.00014279084,0.000011033934,0.0000842571,0.00001789084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960405,0.00092362915,0.0008854621,0.00060936826,0.000298607,0.001242416],"domain_scores_gemma":[0.9951289,0.0017719966,0.00096327846,0.0014010603,0.00021742913,0.000517286],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0021878886,0.0005738642,0.00078952493,0.0001768997,0.0019480482,0.00053925964,0.0014443445,0.00032586578,0.0000022002569],"category_scores_gemma":[0.000032823624,0.00052393164,0.00019478676,0.0002979996,0.00029108586,0.00067842635,0.00038390246,0.0011941827,6.5936143e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002487555,0.008666365,0.018990703,0.0002548862,0.0022210851,0.00006503369,0.008146291,0.25277615,0.008601958,0.030022528,0.0012867431,0.6664807],"study_design_scores_gemma":[0.0062208837,0.00043663252,0.00046792073,0.00027950187,0.000082527346,0.00009082919,0.00012607446,0.99108607,0.00003227767,0.000041468065,0.0005769705,0.00055883796],"about_ca_topic_score_codex":0.000034519864,"about_ca_topic_score_gemma":0.000024398283,"teacher_disagreement_score":0.9743518,"about_ca_system_score_codex":0.00024329076,"about_ca_system_score_gemma":0.00007903007,"threshold_uncertainty_score":0.9997212},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060468353,0.0010467839,0.93662995,0.00006625138,0.00012440237,0.0014342772,4.323948e-7,0.000081121136,0.00014840261],"genre_scores_gemma":[0.73233575,0.0000643026,0.26663554,0.00036261056,0.000057519017,0.00044038755,0.0000027593644,0.000014002629,0.00008709158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998381,0.000047143203,0.00046391715,0.000406259,0.00022161214,0.00048007007],"domain_scores_gemma":[0.9981339,0.0006901613,0.00019001777,0.0007878125,0.00013958098,0.000058547725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020204,0.00016843394,0.00019342835,0.000084417625,0.00013757513,0.00009483865,0.0010056094,0.00012948351,0.000011976081],"category_scores_gemma":[0.000012776368,0.00012541395,0.000076491684,0.0005816772,0.000085856846,0.00038071262,0.00014816536,0.00018575019,0.000005035476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008592037,0.000050742023,0.0010274724,0.000017429196,0.000005862919,3.9719757e-7,0.00010170358,0.88434994,0.00047040658,0.0006017358,0.00017193065,0.11311645],"study_design_scores_gemma":[0.0006392439,0.00017715906,0.0007166258,0.000025797814,0.000003744525,0.0000013881095,0.000018702769,0.9748332,0.019445831,0.000030248386,0.0039549847,0.00015309424],"about_ca_topic_score_codex":0.0000042705387,"about_ca_topic_score_gemma":0.000025705354,"teacher_disagreement_score":0.67186743,"about_ca_system_score_codex":0.00006786123,"about_ca_system_score_gemma":0.000059755515,"threshold_uncertainty_score":0.51142323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03889371,0.00010884985,0.9566815,0.000042696272,0.00007211202,0.003743186,2.8433053e-7,0.00011040464,0.0003472571],"genre_scores_gemma":[0.95022863,0.000004796726,0.047834475,0.000015956526,0.00010554184,0.0017609983,8.0770684e-7,0.000036621026,0.000012174222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777234,0.00006351259,0.00078128575,0.00044350178,0.00030921143,0.000630134],"domain_scores_gemma":[0.99885535,0.00034150088,0.00011314543,0.00046708618,0.000062058214,0.00016088552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015065967,0.00026204318,0.00054619863,0.00010648572,0.000027119686,0.000062239844,0.00043252157,0.00020320591,0.0000020686794],"category_scores_gemma":[0.00015422383,0.00025122816,0.00004516036,0.0005450986,0.000027866594,0.0003681528,0.00062688306,0.00052318966,0.0000030446195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007582236,0.00005149692,0.0008947174,0.00020584775,0.000009091166,0.000009559472,0.001144954,0.980522,0.00018377838,0.015519895,0.00000804095,0.0014430572],"study_design_scores_gemma":[0.0006859895,0.00004315167,0.000052749754,0.0017184275,0.0000030249344,0.00001413668,0.00001595441,0.99085766,0.00010611511,0.006239285,0.000011169072,0.0002523516],"about_ca_topic_score_codex":0.000028760905,"about_ca_topic_score_gemma":0.000025301157,"teacher_disagreement_score":0.91133493,"about_ca_system_score_codex":0.00019778908,"about_ca_system_score_gemma":0.000029947629,"threshold_uncertainty_score":0.999994},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014432229,0.00000181115,0.89331883,0.0013556883,0.00021403942,0.10270763,0.0000011953072,0.00044776683,0.001808718],"genre_scores_gemma":[0.11678769,3.3218038e-7,0.36884043,0.010854174,0.001081389,0.5006837,0.000029664807,0.00005281666,0.0016697538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769884,0.00010730361,0.00042918618,0.0007191982,0.00041554825,0.0006299061],"domain_scores_gemma":[0.99785674,0.00021633143,0.00015039233,0.0013055014,0.00024967085,0.00022139132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007413821,0.00024393911,0.0002223529,0.00008717475,0.00023052012,0.00031804357,0.0013856929,0.00015014215,0.00007837531],"category_scores_gemma":[0.000030266925,0.00021048488,0.00010957952,0.0006442979,0.000032351367,0.00033469714,0.000065452645,0.00018112658,0.000017034889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012764354,0.000486384,0.000171555,0.00002433876,0.000008303556,0.0000077602635,0.00005279242,0.8023619,0.00007285005,0.067332305,0.068406425,0.06094776],"study_design_scores_gemma":[0.0012934323,0.0006371905,0.0007078849,0.000032317435,0.0000031446104,0.0000015417355,0.0000023750692,0.98103094,0.0006055545,0.0013085558,0.014096777,0.00028028648],"about_ca_topic_score_codex":0.000016357531,"about_ca_topic_score_gemma":0.00003359023,"teacher_disagreement_score":0.5244784,"about_ca_system_score_codex":0.00008788642,"about_ca_system_score_gemma":0.00014377413,"threshold_uncertainty_score":0.8583324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027103108,0.000004190987,0.91913056,0.00057031115,0.00009647301,0.0769216,4.165174e-7,0.00032493938,0.0026805014],"genre_scores_gemma":[0.53556365,0.0000019560966,0.2671291,0.0019210846,0.00046233207,0.19417052,0.0000044574244,0.000030524243,0.0007164028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982584,0.000060599228,0.00034734386,0.0005604064,0.00025043485,0.0005227765],"domain_scores_gemma":[0.99857813,0.00038312667,0.00015095595,0.00058977265,0.00015534904,0.00014269196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035251238,0.00021576577,0.00020842667,0.000058081332,0.00024589573,0.00025553672,0.00080942054,0.000113506365,0.0000163192],"category_scores_gemma":[0.000053639877,0.00018473921,0.00008554584,0.00031864364,0.000029229246,0.0003582347,0.00010926765,0.00018631847,0.000021198639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006964065,0.0003176502,0.00031680262,0.00001898334,0.000014908555,0.000013296519,0.00023698444,0.077027746,0.00007398479,0.14462595,0.0057450826,0.771539],"study_design_scores_gemma":[0.0012849942,0.00047805076,0.001616766,0.000095184245,0.0000030376154,0.0000067610686,0.00000555244,0.99158996,0.00017214197,0.0011828777,0.003321095,0.0002435967],"about_ca_topic_score_codex":0.000001283141,"about_ca_topic_score_gemma":0.000009750586,"teacher_disagreement_score":0.91456217,"about_ca_system_score_codex":0.000064804495,"about_ca_system_score_gemma":0.000046653327,"threshold_uncertainty_score":0.75334466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005789226,0.000051555206,0.9919041,0.000428765,0.00024590406,0.001042067,0.0000317132,0.00036254924,0.00014411352],"genre_scores_gemma":[0.8781514,0.00012273206,0.12005991,0.00031025565,0.00002465058,0.0012166951,0.00003014877,0.000046838057,0.00003738118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727166,0.0002911685,0.0007802553,0.00068035664,0.00031359578,0.00066298427],"domain_scores_gemma":[0.993966,0.0014992129,0.00038892898,0.0035913212,0.00036411808,0.00019042252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005907862,0.00038935404,0.00061853376,0.00063912023,0.00090375665,0.00017795051,0.0027287856,0.00028092533,0.000024175653],"category_scores_gemma":[0.000009007975,0.00038833558,0.00038950934,0.0032224315,0.00027565067,0.000551563,0.000023868966,0.00095790555,0.0000058884725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006110073,0.0045831436,0.007342767,0.00010678851,0.0029207724,0.000026024953,0.009782401,0.5511811,0.00017855232,0.31873292,0.0000459319,0.104488626],"study_design_scores_gemma":[0.00090946053,0.00017136916,0.00089947885,0.0003295502,0.00029327828,0.000004364192,0.0003516055,0.99578494,0.0005448635,0.00021827282,0.000036995727,0.0004558473],"about_ca_topic_score_codex":0.00055367424,"about_ca_topic_score_gemma":0.004181237,"teacher_disagreement_score":0.87236214,"about_ca_system_score_codex":0.0001854052,"about_ca_system_score_gemma":0.00015790878,"threshold_uncertainty_score":0.9998568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027231125,0.00003973785,0.9841497,0.000092270166,0.0007778391,0.0004107755,8.86318e-7,0.00083485123,0.010970832],"genre_scores_gemma":[0.9613013,0.0000010326661,0.036823895,0.000108081564,0.00040666046,0.00009532414,0.000010717405,0.000017051925,0.0012358912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985701,0.000050574454,0.00033726063,0.00042045428,0.00015229217,0.00046934243],"domain_scores_gemma":[0.9989958,0.00018769452,0.00010779667,0.00051676086,0.00012839295,0.00006360234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993357,0.00016439494,0.00021327063,0.00004180608,0.00015177738,0.0002531141,0.00078036904,0.000109742505,0.000005995661],"category_scores_gemma":[0.0000060417874,0.00013603554,0.000088711866,0.0004341371,0.000020450052,0.00025633042,0.00015149331,0.00012694718,0.000015882239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000411427,0.000019680861,0.0002798141,0.000015089049,0.000010110413,0.000006231267,0.000018047534,0.009480834,0.0000676544,0.9494106,0.010646834,0.03004095],"study_design_scores_gemma":[0.0002780901,0.000027827145,0.000106945365,0.000054951437,0.0000049297014,0.000013014151,0.000033797518,0.9969631,0.00050098274,0.00032296593,0.00151708,0.00017633782],"about_ca_topic_score_codex":0.00024708427,"about_ca_topic_score_gemma":0.000111825044,"teacher_disagreement_score":0.98748225,"about_ca_system_score_codex":0.00010589173,"about_ca_system_score_gemma":0.000039269373,"threshold_uncertainty_score":0.5547368},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077384926,0.00011852531,0.98891026,0.0065636877,0.0007361536,0.00079277414,0.00008738971,0.00015619808,0.0018611671],"genre_scores_gemma":[0.9813193,0.00026285285,0.01614729,0.0005139175,0.00021530382,0.00078820484,0.0001391286,0.000021488257,0.00059251644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982009,0.00015875458,0.00050636585,0.0004748513,0.0003169425,0.00034218613],"domain_scores_gemma":[0.9975263,0.00034126634,0.00030878774,0.00116311,0.000550823,0.000109720575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004508104,0.0002579976,0.00026400987,0.00014485753,0.00035655918,0.0003579085,0.0018287466,0.00014692957,0.000014685816],"category_scores_gemma":[0.000029496416,0.00026819212,0.00009668416,0.00013221709,0.00019377843,0.0003816018,0.00029372508,0.00033125468,0.000016576214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004154997,0.00055044994,0.00006394169,0.0000062946874,0.000088532855,0.0000022953177,0.00012013799,0.10533384,0.00040888833,0.88365185,0.004165257,0.0055669723],"study_design_scores_gemma":[0.0014300465,0.00011135362,0.0010165158,0.00008330249,0.00001643561,0.0000105454155,0.000031049192,0.9926626,0.00014675678,0.0034948078,0.0007247692,0.0002717832],"about_ca_topic_score_codex":0.00016096828,"about_ca_topic_score_gemma":0.0003564839,"teacher_disagreement_score":0.98054546,"about_ca_system_score_codex":0.00014788251,"about_ca_system_score_gemma":0.000081628365,"threshold_uncertainty_score":0.99997705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01971454,0.000052578715,0.97774386,0.0003842878,0.00049392163,0.00034743245,6.0455545e-7,0.00024653875,0.001016246],"genre_scores_gemma":[0.97519284,0.00002349251,0.023390539,0.0007337203,0.000059855378,0.00007491481,0.0000012716353,0.000015752525,0.0005076265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979604,0.00015586907,0.00034758114,0.000614068,0.0003222838,0.0005998078],"domain_scores_gemma":[0.99875337,0.00013082704,0.000089323046,0.0008015415,0.000050376253,0.00017454349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038244642,0.00023636223,0.00027797333,0.00009048376,0.00011501401,0.000059188107,0.0010291939,0.0001417951,0.000058793667],"category_scores_gemma":[0.000010558991,0.00021725024,0.000077356504,0.0004986938,0.000083177794,0.00033686298,0.00027603266,0.00034565115,0.0000515927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003446823,0.0011814174,0.008932224,0.000022088336,0.0000388904,0.00030367431,0.0014427425,0.94813466,0.00048019597,0.012322895,0.012585222,0.014521528],"study_design_scores_gemma":[0.00079892797,0.000055015178,0.0036676999,0.000031152264,0.0000013631736,0.000015122555,0.000008999403,0.99265546,0.002282046,0.000043802618,0.00017720838,0.00026320122],"about_ca_topic_score_codex":0.0002313551,"about_ca_topic_score_gemma":0.00030165626,"teacher_disagreement_score":0.9554783,"about_ca_system_score_codex":0.00016768875,"about_ca_system_score_gemma":0.00006135911,"threshold_uncertainty_score":0.88592076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043536454,0.00076099066,0.95279163,0.000035032786,0.0006397297,0.00025262428,0.000009890832,0.0001757228,0.0017978967],"genre_scores_gemma":[0.9407248,0.000105112624,0.058458574,0.00023807073,0.000121586265,0.000079977064,0.000028561017,0.000022631008,0.00022067035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769795,0.00007469361,0.00037659067,0.0009318203,0.00022343147,0.00069550466],"domain_scores_gemma":[0.99722636,0.00018646428,0.00011279817,0.0022558416,0.000066977096,0.00015153934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054171024,0.00022981079,0.00026978532,0.00009869336,0.00013478643,0.00013448125,0.002786485,0.00014498048,0.000025108602],"category_scores_gemma":[0.000017876351,0.00021485155,0.00005798805,0.00046943722,0.00007668024,0.00030159837,0.0011807687,0.00015594241,0.0000046136124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042746375,0.0004734182,0.0005635081,0.000018597759,0.00004274331,0.000064200096,0.0008444095,0.046674874,0.00006207403,0.091885544,0.0025245622,0.8568033],"study_design_scores_gemma":[0.00038110383,0.000096011034,0.00042736487,0.000025032314,0.0000063215684,0.000018666746,0.000019662126,0.9932044,0.00030760173,0.0005803206,0.004654557,0.00027895294],"about_ca_topic_score_codex":0.00040177352,"about_ca_topic_score_gemma":0.003388113,"teacher_disagreement_score":0.9465295,"about_ca_system_score_codex":0.00008309784,"about_ca_system_score_gemma":0.00007398878,"threshold_uncertainty_score":0.87613916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030322256,0.0010965933,0.9647415,0.000095587064,0.0015483967,0.0010387406,0.00072285207,0.00035908972,0.00007498628],"genre_scores_gemma":[0.9984631,0.00033213064,0.00041271793,0.00002218,0.000101676145,0.0003469913,0.000097425094,0.000020443416,0.00020331924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684393,0.00045192527,0.0008121027,0.00076428894,0.0005038127,0.00062395143],"domain_scores_gemma":[0.99816525,0.00035527238,0.00020165669,0.000815693,0.00013979402,0.00032230566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005382652,0.0004019036,0.0007510833,0.00017114166,0.00047366912,0.00019766328,0.00057739334,0.00028632957,0.000005084405],"category_scores_gemma":[0.000013019469,0.00036948235,0.00014066021,0.0008746997,0.00014481954,0.0004874235,0.000008879213,0.0005345008,0.000041570536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014515134,0.00030433864,0.00039029305,0.00008167794,0.00005898477,0.00019188446,0.00021931273,0.99673164,0.000053171752,0.0007702968,0.0008657288,0.00018754523],"study_design_scores_gemma":[0.003881454,0.00015690915,0.0013031621,0.00015769411,0.000022059225,0.0003617761,0.00012821698,0.9905991,0.000029428842,0.000025333582,0.002852906,0.0004819741],"about_ca_topic_score_codex":0.00081723445,"about_ca_topic_score_gemma":0.00007653112,"teacher_disagreement_score":0.96814084,"about_ca_system_score_codex":0.00020746383,"about_ca_system_score_gemma":0.00012652829,"threshold_uncertainty_score":0.9998757},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027528987,0.00000793872,0.9840305,0.0002772887,0.00013451732,0.00018681087,8.4763553e-7,0.00019176191,0.012417442],"genre_scores_gemma":[0.84752864,2.826944e-7,0.14930795,0.00030543428,0.00015995615,0.00003688654,0.0000025425663,0.0000069577713,0.0026513434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992083,0.000009775903,0.00015444304,0.00026087865,0.00011825884,0.00024834333],"domain_scores_gemma":[0.99954623,0.000037175992,0.00004277454,0.00029132402,0.000052094096,0.000030407664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016115943,0.00008070675,0.000075067095,0.00003062424,0.000078120174,0.0001286563,0.00034612275,0.000044542714,0.0000078265475],"category_scores_gemma":[0.000005047616,0.00007203896,0.00005079446,0.000111838846,0.000010033015,0.0003679859,0.000091056565,0.00004861147,0.000024321396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036763267,0.000078042794,0.0006942589,0.000010513205,0.000005781555,0.0000017205001,0.00024201837,0.34735358,0.0009121207,0.59089667,0.02049291,0.03930872],"study_design_scores_gemma":[0.00017520862,0.000013721934,0.00018750891,0.000005908771,0.0000015283246,0.0000024136175,0.0000026370283,0.98844826,0.00035147427,0.010069567,0.0006514219,0.00009033808],"about_ca_topic_score_codex":0.000040672214,"about_ca_topic_score_gemma":0.00021254325,"teacher_disagreement_score":0.84477574,"about_ca_system_score_codex":0.00003523152,"about_ca_system_score_gemma":0.000018679148,"threshold_uncertainty_score":0.29376635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07862735,0.000045547324,0.91584903,0.0004444584,0.00012058204,0.00024036174,9.685588e-8,0.00033481795,0.004337765],"genre_scores_gemma":[0.92610914,0.000019651015,0.0728084,0.0008186386,0.00009745841,0.00001642035,0.0000016447158,0.000010158247,0.00011851429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983949,0.000051648516,0.00025384262,0.0005155353,0.00023874328,0.00054530025],"domain_scores_gemma":[0.998993,0.000109828434,0.00006743326,0.00065242307,0.000048519254,0.0001288186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741235,0.00019179487,0.00022435441,0.00008341451,0.000075982105,0.00015868091,0.00084595324,0.00010286284,0.000016326429],"category_scores_gemma":[0.000008616343,0.00015349811,0.000038257476,0.00077105244,0.000030373914,0.0005334347,0.00012484168,0.00030405034,0.00002195224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053078496,0.00027327353,0.021842826,0.0000075653165,0.00001893937,0.00022352458,0.00046016363,0.44398314,0.00030568268,0.3220778,0.000791097,0.20996289],"study_design_scores_gemma":[0.0006315365,0.00012215857,0.008512414,0.000051694642,0.0000016283493,0.000014686306,0.000020749814,0.9893308,0.0003524572,0.0006362535,0.00008536314,0.0002402067],"about_ca_topic_score_codex":0.00005477121,"about_ca_topic_score_gemma":0.000343136,"teacher_disagreement_score":0.8474818,"about_ca_system_score_codex":0.000051758765,"about_ca_system_score_gemma":0.000045629666,"threshold_uncertainty_score":0.6259472},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023975786,0.00014215216,0.97282726,0.0012926152,0.0005039131,0.00023268093,0.0000012446844,0.000117067626,0.0009072993],"genre_scores_gemma":[0.98826516,0.00011169774,0.009560563,0.00095639256,0.00016801679,0.00022761205,0.0000026956131,0.000008156563,0.0006997249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988929,0.000053084,0.00029675403,0.00032094127,0.000096644115,0.00033966827],"domain_scores_gemma":[0.9994516,0.0000782247,0.00006911301,0.00030689643,0.000034003544,0.00006018406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015157228,0.00010513932,0.00016544314,0.000062632345,0.000040204788,0.000017483508,0.00043270228,0.00007977558,0.000198574],"category_scores_gemma":[0.0000061741403,0.00010076962,0.000044175446,0.00011807723,0.00001918647,0.00024479843,0.00006135829,0.0000520795,0.000029550709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005143273,0.00020181976,0.026386365,0.00001174873,0.000029871871,0.000004568945,0.00011043489,0.003925981,0.0019354546,0.53594023,0.010628074,0.42077404],"study_design_scores_gemma":[0.0022517508,0.000081765145,0.0061238827,0.0000065564755,0.0000037956042,0.0000050134563,0.0000033035415,0.9742157,0.0014475078,0.003545812,0.012112374,0.00020255623],"about_ca_topic_score_codex":0.00005480307,"about_ca_topic_score_gemma":0.00075712183,"teacher_disagreement_score":0.9702897,"about_ca_system_score_codex":0.000055986708,"about_ca_system_score_gemma":0.000017250997,"threshold_uncertainty_score":0.41092658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014720863,0.00076020387,0.9937213,0.00025818133,0.0021124785,0.00056300254,0.0000060974767,0.00020860064,0.0008980543],"genre_scores_gemma":[0.80592835,0.00014274579,0.19132765,0.0008227857,0.0014181037,0.000030656578,0.000009413958,0.00007858932,0.00024169397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487215,0.000071728435,0.00062088197,0.0018821387,0.0012341888,0.0013189133],"domain_scores_gemma":[0.99687696,0.00067279354,0.000360097,0.0015305944,0.00024535842,0.00031419194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006606056,0.0007815028,0.0007650676,0.0007545032,0.00020209338,0.0004910982,0.0029375046,0.00053304754,0.00007421548],"category_scores_gemma":[0.000021309032,0.0006587766,0.0001197756,0.0011619314,0.0007167725,0.00090961554,0.001131208,0.0017302582,0.00002913267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002084029,0.0000717197,0.004536688,0.000026067584,0.000021508373,0.00022663546,0.0004908846,0.17493205,0.000037928545,0.0053736884,0.000016044689,0.81424594],"study_design_scores_gemma":[0.00041989385,0.00017495398,0.0040294253,0.00062301476,0.0000070830038,0.00019736422,2.0176593e-7,0.98921883,0.00017074124,0.0035188862,0.00059619534,0.0010434313],"about_ca_topic_score_codex":0.00005794026,"about_ca_topic_score_gemma":0.0005726413,"teacher_disagreement_score":0.81428677,"about_ca_system_score_codex":0.0005307362,"about_ca_system_score_gemma":0.0004695414,"threshold_uncertainty_score":0.99958634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08688842,0.0016712041,0.87423486,0.000033202294,0.0007023157,0.0007292211,4.2623978e-7,0.00062792114,0.03511244],"genre_scores_gemma":[0.95783573,0.00009585329,0.041207273,0.00025815633,0.000049940805,0.00016204739,0.0000014770851,0.0000136557765,0.00037586162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792254,0.00015345268,0.00045285217,0.0006652707,0.00020882592,0.0005970351],"domain_scores_gemma":[0.9983986,0.00013810158,0.000107783744,0.0011532102,0.00006007202,0.00014225856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008447612,0.00019643737,0.00025558026,0.00007538665,0.000075856326,0.00008363009,0.0011668259,0.00015333737,0.0002579492],"category_scores_gemma":[0.000025948464,0.00017901558,0.00008552524,0.00079588033,0.00005634012,0.00052132405,0.0005555088,0.00033993233,0.0000685717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024908451,0.00059883075,0.022459278,0.000010464585,0.000020091666,0.000079904385,0.0016345973,0.0037402473,0.000041892337,0.021211743,0.0009530178,0.949225],"study_design_scores_gemma":[0.0005973744,0.0002107071,0.146919,0.000041860305,0.00000485274,0.000021864304,0.00010518887,0.84687936,0.00021501779,0.001511254,0.003021382,0.00047213788],"about_ca_topic_score_codex":0.000059445963,"about_ca_topic_score_gemma":0.00042128866,"teacher_disagreement_score":0.9487529,"about_ca_system_score_codex":0.00009825222,"about_ca_system_score_gemma":0.000048343998,"threshold_uncertainty_score":0.7300044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013533902,0.0016657133,0.9271293,0.00052951137,0.0011022754,0.00022617953,3.7512183e-7,0.0003910723,0.067602165],"genre_scores_gemma":[0.95017564,0.000085680775,0.03834565,0.0039333864,0.00016612407,0.000033401342,0.0000013336183,0.000015798545,0.0072429692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986625,0.00009733363,0.00018781448,0.00038164426,0.0001980018,0.00047270826],"domain_scores_gemma":[0.9988689,0.00010413546,0.000053079366,0.0007692993,0.000051236344,0.00015337538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002708969,0.00014004619,0.00015714714,0.000022120246,0.00012142455,0.00013268802,0.0007462814,0.00007810248,0.0004239451],"category_scores_gemma":[0.00001778768,0.00012211088,0.000061985054,0.00041750405,0.00003293678,0.0002822325,0.00014584072,0.00016064676,0.00038172147],"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.0000024678932,0.00003086477,0.0007909516,0.000003287223,0.00001775189,0.000025413321,0.00013744736,0.001848855,0.0000055915466,0.6054063,0.18654048,0.2051906],"study_design_scores_gemma":[0.0004280609,0.00010835024,0.0006490928,0.000021871812,0.0000043172104,0.000033920813,0.000046308567,0.046231806,0.00019797457,0.010093408,0.94182664,0.00035826705],"about_ca_topic_score_codex":0.000008159127,"about_ca_topic_score_gemma":0.00012437331,"teacher_disagreement_score":0.94882226,"about_ca_system_score_codex":0.000033831053,"about_ca_system_score_gemma":0.00007092429,"threshold_uncertainty_score":0.49795374},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083358296,0.002652873,0.99305934,0.00069804036,0.0013068015,0.0018926556,0.00001286223,0.00022683149,0.000067243156],"genre_scores_gemma":[0.28001678,0.00017308063,0.7165201,0.0023885914,0.00055982056,0.0001383692,0.000019599984,0.00011438122,0.00006934039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950832,0.00005387991,0.000636839,0.0023260699,0.0007648578,0.0011351572],"domain_scores_gemma":[0.99677634,0.0009140417,0.00041784116,0.0011844279,0.00034368777,0.00036368147],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010601796,0.0007976274,0.00084567425,0.0003942496,0.0004907516,0.0011145294,0.0018197164,0.00059447926,0.0000069176185],"category_scores_gemma":[0.000041064384,0.0007355852,0.00013177501,0.0005203949,0.0014164011,0.00048969424,0.001241142,0.00090646814,0.0000017834591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025505748,0.000026583062,0.00008152312,0.00007045426,0.000016298536,0.00009581415,0.0002944661,0.08586302,0.0000032566143,0.004782326,0.000012636224,0.9087281],"study_design_scores_gemma":[0.0012727481,0.00032398934,0.00006883455,0.0009869201,0.000016087224,0.00008631503,4.1426532e-7,0.9845978,0.00006313805,0.010661966,0.0010718411,0.00084996026],"about_ca_topic_score_codex":0.000008086024,"about_ca_topic_score_gemma":0.00004155835,"teacher_disagreement_score":0.90787816,"about_ca_system_score_codex":0.00030023206,"about_ca_system_score_gemma":0.0005294197,"threshold_uncertainty_score":0.9999224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009002174,0.0001591779,0.97939086,0.0022756949,0.00019944935,0.00024444162,1.799052e-7,0.00016704666,0.0085609695],"genre_scores_gemma":[0.95486796,0.00005074835,0.043091655,0.001657651,0.00014794186,0.0000108507975,0.0000011081413,0.0000060490174,0.0001660334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987543,0.00013792604,0.00032187154,0.0002424175,0.00024525062,0.00029820955],"domain_scores_gemma":[0.9987721,0.00023172185,0.00014570687,0.0007504936,0.00005654988,0.00004346891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039444875,0.00012513084,0.00018641542,0.000018102746,0.00011307094,0.000090777525,0.0007108603,0.00006686555,0.000039140665],"category_scores_gemma":[0.0000128763495,0.00008206163,0.000077740566,0.00040164808,0.000054613356,0.00037162154,0.000103485305,0.00014360812,0.000028972965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020429785,0.0002378616,0.00024950044,0.000025111083,0.00005733063,0.000037045007,0.001818318,0.17761537,0.0008056301,0.57662714,0.014468023,0.22803822],"study_design_scores_gemma":[0.00019003662,0.000080034195,0.0009992021,0.000048872975,0.0000093448625,0.000027684577,0.00003427901,0.9854836,0.0008763249,0.011576417,0.00053884066,0.00013536893],"about_ca_topic_score_codex":0.00001757685,"about_ca_topic_score_gemma":0.0000051065717,"teacher_disagreement_score":0.9458658,"about_ca_system_score_codex":0.000017549331,"about_ca_system_score_gemma":0.000018221699,"threshold_uncertainty_score":0.33463764},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034596864,0.00008602386,0.9847269,0.00007500537,0.00023892407,0.008605838,3.299926e-7,0.00035709477,0.0024502096],"genre_scores_gemma":[0.36834055,0.0000065160807,0.6203958,0.0028008823,0.00018779341,0.0072278827,0.0000023117643,0.00008301685,0.0009552932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997655,0.0001848849,0.00032578752,0.00068968395,0.0004076023,0.0007370548],"domain_scores_gemma":[0.99814016,0.00011078026,0.00015152572,0.0012218602,0.00015211629,0.00022354939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004919969,0.00030353668,0.00029726577,0.00008405888,0.00019129607,0.00032414956,0.00084131886,0.00013311664,0.00008484151],"category_scores_gemma":[0.000014634695,0.00023454391,0.00008092189,0.00090609357,0.00009121012,0.00047289446,0.00007056542,0.00025471902,0.00002667465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001947652,0.0009156705,0.033400606,0.00010208943,0.00012680794,0.00054253754,0.00025713342,0.8755914,0.0011488737,0.029819058,0.011708988,0.04619208],"study_design_scores_gemma":[0.0011257828,0.00031296155,0.0003440191,0.00018051756,0.000008947003,0.000060432707,0.000008041346,0.97476196,0.0016591509,0.000118419826,0.020949053,0.00047073318],"about_ca_topic_score_codex":0.00001548981,"about_ca_topic_score_gemma":0.00015073248,"teacher_disagreement_score":0.36488086,"about_ca_system_score_codex":0.00008288841,"about_ca_system_score_gemma":0.00027388276,"threshold_uncertainty_score":0.9564423},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035215776,0.00022400508,0.9490628,0.00006363265,0.00069999514,0.00038400947,6.3715777e-7,0.0003610826,0.01398803],"genre_scores_gemma":[0.98360765,0.00003038342,0.015316346,0.00046229878,0.00013240399,0.000076524666,0.0000021623528,0.000023821882,0.00034840323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977366,0.00016391014,0.00040153653,0.00065998314,0.00034863543,0.00068934826],"domain_scores_gemma":[0.9985776,0.00004751579,0.00009702608,0.00102536,0.00004633145,0.00020617622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037154873,0.00025788095,0.00028853343,0.00008970444,0.00006978193,0.0000986109,0.001254588,0.00017263819,0.00021626634],"category_scores_gemma":[0.000004442952,0.00023221366,0.00009456131,0.0003894462,0.000057525776,0.0002487786,0.00051249075,0.00026891573,0.00008216235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015485768,0.0021341094,0.011626338,0.00008461043,0.00027174322,0.005766918,0.005747509,0.2280176,0.0025349937,0.13212541,0.010123416,0.6014125],"study_design_scores_gemma":[0.0004949404,0.00014592007,0.0013217032,0.000037349295,0.000006577373,0.000039589188,0.000025576213,0.9779517,0.018373897,0.00046470689,0.00066488306,0.00047313294],"about_ca_topic_score_codex":0.00025183332,"about_ca_topic_score_gemma":0.000102760205,"teacher_disagreement_score":0.94839185,"about_ca_system_score_codex":0.000100296515,"about_ca_system_score_gemma":0.000045821893,"threshold_uncertainty_score":0.9469398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39729,0.0006329965,0.6002883,0.00049756357,0.00012889116,0.00018049931,3.5465337e-7,0.00013707197,0.0008443603],"genre_scores_gemma":[0.9567592,0.00008969241,0.04204769,0.0004142298,0.00012579771,0.00003554991,7.957779e-7,0.00001285392,0.00051419483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850684,0.00006670038,0.00021337715,0.00054458325,0.00025224066,0.00041627715],"domain_scores_gemma":[0.99923754,0.00014187054,0.00006319247,0.00037450495,0.00006412887,0.000118766045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026355239,0.00017896741,0.00019582418,0.00007831074,0.000101743586,0.00011857098,0.00032646276,0.00007292197,0.000015199376],"category_scores_gemma":[0.0000048340717,0.00014196332,0.000023102974,0.0005518471,0.00008596315,0.00016282382,0.0001645914,0.00023290717,0.000012251124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006985377,0.00020901767,0.008082195,0.000010831624,0.000017060142,0.00006175522,0.00032525905,0.7864078,0.00013879991,0.0082787685,0.00031354814,0.1960851],"study_design_scores_gemma":[0.0005288376,0.000053949287,0.022131862,0.000054587257,0.000002111016,0.00008818199,0.000017741899,0.97562814,0.00010738636,0.000014043814,0.001154587,0.00021854523],"about_ca_topic_score_codex":0.000018495988,"about_ca_topic_score_gemma":0.00053839665,"teacher_disagreement_score":0.5594692,"about_ca_system_score_codex":0.00006737967,"about_ca_system_score_gemma":0.00003789382,"threshold_uncertainty_score":0.57890964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010976758,0.07181229,0.912165,0.0018052103,0.0010659918,0.00026172563,0.0000070016554,0.00004984031,0.0018561904],"genre_scores_gemma":[0.9868001,0.003829137,0.008946603,0.00015623098,0.00014116915,0.00002391554,0.000004720936,0.000006887941,0.00009127815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826604,0.00023444367,0.0007864648,0.00018641041,0.00033289372,0.00019373964],"domain_scores_gemma":[0.9979243,0.00027571933,0.0006289693,0.00057806354,0.00049708976,0.00009585848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007875,0.00014257678,0.00025783738,0.00027169945,0.00013053021,0.00022076536,0.0020814019,0.00006928752,0.0000025367106],"category_scores_gemma":[0.000020819292,0.00013382449,0.0000898305,0.00026828714,0.000080224054,0.0003995906,0.00040438154,0.00031276705,0.0000018304725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004078499,0.0005720015,0.00026020108,0.0000022427957,0.00011423479,0.000081196995,0.0013881762,0.34465688,0.00010145581,0.28937802,0.0003477363,0.36305708],"study_design_scores_gemma":[0.00047607048,0.0002357788,0.0017442686,0.00024478332,0.0000067616074,0.00044559423,0.00035956484,0.9735705,0.0000057522116,0.0006564603,0.02210813,0.00014630785],"about_ca_topic_score_codex":0.00002616452,"about_ca_topic_score_gemma":0.000023248263,"teacher_disagreement_score":0.9758233,"about_ca_system_score_codex":0.00031663553,"about_ca_system_score_gemma":0.00015484361,"threshold_uncertainty_score":0.5457204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019490892,0.000102246675,0.97873545,0.000090078735,0.0013682059,0.015971117,0.00007355582,0.0004254093,0.0012848274],"genre_scores_gemma":[0.870734,0.00010238613,0.09046631,0.00023711304,0.0006550201,0.037155993,0.00017202353,0.0001188601,0.0003583175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993699,0.0035687208,0.00085836614,0.0007087989,0.00041212773,0.000752969],"domain_scores_gemma":[0.98805857,0.0037920265,0.00060026644,0.0065086535,0.0008232711,0.000217238],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.01047274,0.0004195865,0.00064606045,0.00015848206,0.0007083142,0.00029010262,0.0059145666,0.00023560373,0.000012290043],"category_scores_gemma":[0.00028410993,0.00036863185,0.00014209487,0.0010492181,0.0003075307,0.00065983954,0.0006008629,0.0004599032,0.00003402153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025273715,0.0097128935,0.08405793,0.00032593784,0.0019749452,0.00004814041,0.012624015,0.015982026,0.0019248119,0.288157,0.049015526,0.53364944],"study_design_scores_gemma":[0.011721877,0.006656163,0.22530138,0.0024921894,0.00018918082,0.000060828632,0.0001562683,0.6482372,0.0071441964,0.005704362,0.08636935,0.0059669693],"about_ca_topic_score_codex":0.001099122,"about_ca_topic_score_gemma":0.0033598023,"teacher_disagreement_score":0.8882692,"about_ca_system_score_codex":0.00013994343,"about_ca_system_score_gemma":0.00030401777,"threshold_uncertainty_score":0.99987656},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001674852,0.000059219532,0.9774833,0.000111358466,0.0001946449,0.00031541835,0.0000010852133,0.00021148945,0.019948669],"genre_scores_gemma":[0.73185873,4.5957e-7,0.2670971,0.0001157165,0.00011139815,0.000042679567,0.0000010092743,0.000004256829,0.0007686624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990663,0.00002385936,0.00017924847,0.0003210783,0.0001455668,0.00026394406],"domain_scores_gemma":[0.9990285,0.00036631108,0.000055031607,0.00041213684,0.00010012429,0.000037907917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004260209,0.000082297716,0.000105850704,0.000045422166,0.00008535225,0.00008022307,0.00048362074,0.00004584381,0.000010515523],"category_scores_gemma":[0.000045101926,0.00007190705,0.00006558848,0.00052286836,0.000017814618,0.00024699795,0.00015781318,0.00006116204,0.00001576186],"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.0000031489317,0.0000695979,0.000786767,0.000003014863,0.000004977035,0.0000011897889,0.000025028936,0.0032001212,0.000032447875,0.9478074,0.0060363384,0.042030007],"study_design_scores_gemma":[0.00019319127,0.00006611658,0.002073186,0.0000024227975,0.0000027868543,0.0000015748277,0.000009117302,0.9654851,0.0010666837,0.027255828,0.003722393,0.00012159612],"about_ca_topic_score_codex":0.00015235238,"about_ca_topic_score_gemma":0.00005569127,"teacher_disagreement_score":0.962285,"about_ca_system_score_codex":0.000055138196,"about_ca_system_score_gemma":0.000029154942,"threshold_uncertainty_score":0.29322845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010517713,0.000070562506,0.9869717,0.00027633813,0.0007307648,0.00083871756,0.0000015757706,0.00018151046,0.0004111682],"genre_scores_gemma":[0.9485973,0.00007315681,0.049591105,0.00033110383,0.00012537463,0.00037449322,0.000004061476,0.000022365322,0.00088101136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977171,0.00007976207,0.00047851156,0.0007583832,0.00022500461,0.0007412649],"domain_scores_gemma":[0.9985348,0.0003204956,0.000110367306,0.0007549209,0.0000826043,0.0001967989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034323407,0.00027806754,0.00035727592,0.00011437478,0.00013043708,0.000079286656,0.0012672629,0.0001576367,0.00001998463],"category_scores_gemma":[0.000028478791,0.00025315644,0.00010498226,0.00039027107,0.00009665891,0.00038994657,0.0004036109,0.00025705324,0.000024468474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006661653,0.008115206,0.021352356,0.00027870084,0.00046262264,0.0013714341,0.023092894,0.27225074,0.00267718,0.22829495,0.071822524,0.36961523],"study_design_scores_gemma":[0.0013664166,0.00014893503,0.002107555,0.000052913558,0.0000029102227,0.00003203341,0.000040895844,0.9952493,0.00039673326,0.00008813679,0.00019598239,0.0003182152],"about_ca_topic_score_codex":0.000051022525,"about_ca_topic_score_gemma":0.00017610939,"teacher_disagreement_score":0.9380796,"about_ca_system_score_codex":0.00013721353,"about_ca_system_score_gemma":0.00006414397,"threshold_uncertainty_score":0.9999921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5354562,0.00001443468,0.46077183,0.000044267665,0.00007101061,0.00007332917,6.797059e-8,0.000048738562,0.003520153],"genre_scores_gemma":[0.97736627,0.0000947163,0.022089062,0.00007126036,0.000046902074,0.000007526265,4.706358e-7,0.0000058912115,0.0003178895],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991669,0.000047608057,0.00019484575,0.0002510631,0.00012817384,0.00021139802],"domain_scores_gemma":[0.9995975,0.00007260267,0.000053089483,0.00018472261,0.000043219556,0.000048903992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014583512,0.00008948724,0.00015530986,0.000038274735,0.000041064857,0.00002109921,0.00022458959,0.000083247614,0.000037737114],"category_scores_gemma":[0.0000035299554,0.00008350099,0.00002303355,0.00042353672,0.000061609826,0.00029146782,0.00013128204,0.00013763596,0.0000054567613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045561977,0.00026626932,0.6489222,0.000026886379,0.00003846301,0.000057523095,0.0008502964,0.09536515,0.00066737685,0.20554903,0.007606669,0.04060455],"study_design_scores_gemma":[0.00024033448,0.000026988042,0.03432454,0.000011218447,0.0000012110928,0.000079914265,0.0000059226572,0.9643697,0.0006917291,0.00007034564,0.000081635335,0.000096441276],"about_ca_topic_score_codex":0.000102688726,"about_ca_topic_score_gemma":0.00008117656,"teacher_disagreement_score":0.86900455,"about_ca_system_score_codex":0.000022161837,"about_ca_system_score_gemma":0.000027839626,"threshold_uncertainty_score":0.34050715},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048937965,0.00047914698,0.94687575,0.000010498732,0.00019099023,0.002737112,9.593192e-7,0.00018808182,0.0005794708],"genre_scores_gemma":[0.96210325,0.0000048066327,0.033814237,0.000038212573,0.00010145759,0.003826771,0.0000114474615,0.000015408914,0.000084393374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980812,0.00018308772,0.00041677465,0.0005414986,0.00047243395,0.00030498859],"domain_scores_gemma":[0.9983303,0.00011025127,0.00017343218,0.0009886621,0.00033745245,0.00005990657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011895299,0.00016290609,0.00021184178,0.000107421256,0.00009839038,0.00006886931,0.0007792054,0.00009812348,0.000020855121],"category_scores_gemma":[0.000006428611,0.00014459172,0.00006618243,0.000525642,0.000025214205,0.00019145354,0.00013612039,0.000073688236,9.139497e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012917745,0.0013666358,0.00008163993,0.0000038340827,0.0000075687826,8.112073e-7,0.00013185393,0.88853306,0.00070064195,0.008001415,0.00079834816,0.10036125],"study_design_scores_gemma":[0.00068158266,0.0016519364,0.0004929087,0.0000075807893,0.00001796585,0.0000022421766,0.00009370361,0.9926315,0.0023029002,0.0011857848,0.0007620743,0.00016982754],"about_ca_topic_score_codex":0.00007646862,"about_ca_topic_score_gemma":0.00035484074,"teacher_disagreement_score":0.9131653,"about_ca_system_score_codex":0.00007616657,"about_ca_system_score_gemma":0.00006531261,"threshold_uncertainty_score":0.5896279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008392695,0.00072772405,0.96804786,0.001697053,0.00074991497,0.00094373286,6.172303e-7,0.00052615855,0.01891422],"genre_scores_gemma":[0.98599637,0.00012466182,0.01127222,0.0016009641,0.00018571308,0.00008769444,0.0000029911498,0.000016802329,0.00071257923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973323,0.00013512015,0.00047003254,0.00082868856,0.00040906193,0.0008247959],"domain_scores_gemma":[0.9983096,0.00023040766,0.00012901593,0.0009966289,0.00011494339,0.00021939547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005180544,0.0002910822,0.00037556543,0.00013499445,0.000094727955,0.0003627417,0.0024809411,0.0001874016,0.000093334806],"category_scores_gemma":[0.000029693652,0.00025846733,0.000072280105,0.0013178868,0.00007112256,0.0012834339,0.000483458,0.0004534911,0.00005011315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010632728,0.00067211484,0.000995464,0.000023369656,0.000030952702,0.00023998492,0.0007209183,0.29499856,0.0000494087,0.21013753,0.019813508,0.47221187],"study_design_scores_gemma":[0.0005064343,0.00024167211,0.007320374,0.00007120702,0.000004755881,0.000011722263,0.00001797867,0.9763596,0.00007107478,0.014084993,0.00093891093,0.00037126354],"about_ca_topic_score_codex":0.00005059201,"about_ca_topic_score_gemma":0.00050957943,"teacher_disagreement_score":0.9776037,"about_ca_system_score_codex":0.00016497547,"about_ca_system_score_gemma":0.00014974951,"threshold_uncertainty_score":0.99998677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88064635,0.00005593326,0.10677439,0.0010264994,0.00012221983,0.00020549304,8.335298e-7,0.00020485386,0.010963416],"genre_scores_gemma":[0.9963545,0.000009916831,0.002959664,0.0003736305,0.00022767637,0.0000062788677,6.9306094e-7,0.000009308772,0.000058305824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.00007400133,0.00028323816,0.00026852402,0.00022226652,0.0003687943],"domain_scores_gemma":[0.9988344,0.00021768658,0.00018418345,0.0006658119,0.000041666648,0.00005630725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041389,0.00014308095,0.00015889635,0.00007070256,0.00015647433,0.000140789,0.00090808,0.000046677887,0.0000300512],"category_scores_gemma":[0.00003079764,0.00008452771,0.0001788758,0.00039700593,0.00005590709,0.00035752848,0.00024924325,0.00020699036,0.00002878495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001746939,0.0002319398,0.069370694,0.000008772008,0.00014834836,0.000007971009,0.0032788091,0.028314969,0.013990686,0.20806952,0.00050389906,0.6760569],"study_design_scores_gemma":[0.00025571603,0.00017159265,0.19843093,0.000095251926,0.0000059175622,0.000016348313,0.000056359597,0.79508716,0.0050827875,0.00032747188,0.00022328248,0.00024721096],"about_ca_topic_score_codex":0.00013101616,"about_ca_topic_score_gemma":0.000010770745,"teacher_disagreement_score":0.76677215,"about_ca_system_score_codex":0.000036318044,"about_ca_system_score_gemma":0.00002991395,"threshold_uncertainty_score":0.34469402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005299023,0.0037061553,0.98246443,0.0002281185,0.00034788338,0.0009776088,0.0000052874607,0.00032372703,0.006647762],"genre_scores_gemma":[0.8435789,0.00065624696,0.14848034,0.0019799867,0.00034473545,0.00072869123,0.00004659017,0.000026076872,0.004158467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985441,0.000021791138,0.00026297334,0.0005401281,0.00012952673,0.00050147803],"domain_scores_gemma":[0.999036,0.00017796672,0.000064006854,0.0005947527,0.00003995537,0.00008730122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025494263,0.000149105,0.00019090516,0.00007657763,0.000075103955,0.0001624067,0.0010440638,0.000091075155,0.00028461445],"category_scores_gemma":[0.000018382758,0.00014083489,0.00007431158,0.00045242644,0.000019228972,0.00053414196,0.0002487969,0.00015793281,0.000021866432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019142024,0.0001474787,0.00034431557,0.0000059183553,0.000007119157,0.000011243948,0.00033957188,0.032660007,0.000034777207,0.01933029,0.034801293,0.91229886],"study_design_scores_gemma":[0.00050047715,0.00024268718,0.004253921,0.00004943619,0.0000017313114,0.0000029810908,0.00002583959,0.92933506,0.00009048646,0.005553151,0.059696343,0.00024786138],"about_ca_topic_score_codex":0.0000027898855,"about_ca_topic_score_gemma":0.000053619868,"teacher_disagreement_score":0.91205096,"about_ca_system_score_codex":0.000058762434,"about_ca_system_score_gemma":0.000023209133,"threshold_uncertainty_score":0.57430804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018445225,0.00001422514,0.97416824,0.00077507587,0.00016844067,0.00051148486,6.592137e-7,0.00015675173,0.0057599214],"genre_scores_gemma":[0.95937854,0.0000057696793,0.038272474,0.0021436666,0.00011194718,0.000010986118,8.05632e-7,0.000007748114,0.00006806091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998579,0.00017827442,0.00022742547,0.00033301883,0.00031709715,0.00036515534],"domain_scores_gemma":[0.99827427,0.00062284875,0.00014353918,0.00078533386,0.00009598707,0.00007799737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031876043,0.00019242383,0.000224987,0.000035477933,0.00010571987,0.00007839011,0.0010292943,0.000089232075,0.0001948295],"category_scores_gemma":[0.000023254033,0.00010463143,0.000038683298,0.00069100456,0.0001711571,0.00013618913,0.00006545241,0.00024138221,0.00001054703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040759078,0.0000344319,0.00010863986,0.000002117756,0.000033673277,0.0000149126645,0.00016947332,0.089760125,0.00021723672,0.8376409,0.026440935,0.045536786],"study_design_scores_gemma":[0.0011757532,0.0016005383,0.009135136,0.00021243209,0.000023036684,0.00008665543,0.0000602483,0.91168725,0.004057485,0.07109089,0.00029087716,0.0005797109],"about_ca_topic_score_codex":0.000003462303,"about_ca_topic_score_gemma":0.000004159649,"teacher_disagreement_score":0.9409333,"about_ca_system_score_codex":0.000020764886,"about_ca_system_score_gemma":0.00010522813,"threshold_uncertainty_score":0.4266746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3863249,0.0012007504,0.6114914,0.0000057425414,0.00037620583,0.00037113088,0.0000012994852,0.00006262539,0.0001659743],"genre_scores_gemma":[0.98649704,0.00022173642,0.013109433,0.000032247826,0.000030639538,0.000024147972,0.0000027263518,0.0000089223395,0.00007311335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985174,0.000046921774,0.000396791,0.00038537369,0.00023578467,0.00041773403],"domain_scores_gemma":[0.9988716,0.0004249226,0.000134466,0.00041270012,0.000055725508,0.00010057387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008201607,0.00016564428,0.00030012688,0.00009459385,0.00005101621,0.00004909535,0.0003916608,0.00011136656,0.0000039199017],"category_scores_gemma":[0.000006574551,0.0001421017,0.000024083261,0.0004034131,0.00007551115,0.00031203026,0.00024968776,0.00017925777,0.0000025826491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010290584,0.0012778983,0.039975766,0.0070398855,0.00019416124,0.0004974914,0.0033365788,0.18752785,0.00034949387,0.3113394,0.001492999,0.4459394],"study_design_scores_gemma":[0.001053007,0.00015519884,0.106911294,0.00011544962,0.000006140516,0.0000069055063,0.000029641367,0.89110744,0.00020779212,0.00022643493,0.00002751322,0.00015316976],"about_ca_topic_score_codex":0.00013003805,"about_ca_topic_score_gemma":0.00066473545,"teacher_disagreement_score":0.7035796,"about_ca_system_score_codex":0.00010507014,"about_ca_system_score_gemma":0.000026113752,"threshold_uncertainty_score":0.5794739},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5218638,0.000104688166,0.47150627,0.0006744291,0.00044072588,0.0004169662,4.496802e-7,0.00006860054,0.0049240496],"genre_scores_gemma":[0.99936974,0.000080000296,0.00013282095,0.00010853036,0.00007457742,0.0000331401,1.9380907e-7,0.000007450108,0.00019352353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984425,0.00046830464,0.00027375607,0.00024898906,0.00030302838,0.00026347258],"domain_scores_gemma":[0.99336624,0.005282857,0.0001837866,0.0010508122,0.00007670332,0.000039629114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012254651,0.00015028109,0.00026175837,0.00002382173,0.00022770691,0.000031288746,0.001476234,0.00007421133,0.000016065178],"category_scores_gemma":[0.00011361544,0.00006890129,0.00013359812,0.00032335692,0.00030769303,0.0001207566,0.00039691996,0.0002710354,0.0000064570163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021518595,0.00010934567,0.01916743,0.000036628757,0.00022719507,0.00002652125,0.0010329965,0.01014384,0.00057555,0.6433987,0.013132099,0.31193447],"study_design_scores_gemma":[0.00047570514,0.0012446324,0.0070558437,0.000078624806,0.000012932364,0.000036892638,0.000033740882,0.9364771,0.053185977,0.0008308624,0.00036619088,0.00020145126],"about_ca_topic_score_codex":0.00007821035,"about_ca_topic_score_gemma":0.00012099208,"teacher_disagreement_score":0.9263333,"about_ca_system_score_codex":0.000021027483,"about_ca_system_score_gemma":0.000030935404,"threshold_uncertainty_score":0.2809713},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077367714,0.00006314156,0.983395,0.00019671182,0.0008511481,0.0075944914,0.000005876751,0.00003644926,0.000120428915],"genre_scores_gemma":[0.9583272,0.0000050335498,0.037079755,0.0002351044,0.0005845502,0.0036731048,0.0000011648187,0.000025237554,0.00006890018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835646,0.00028557747,0.00044536413,0.00020743643,0.0003400449,0.00036508584],"domain_scores_gemma":[0.9977822,0.0007680838,0.0003562002,0.00080630014,0.0002040716,0.000083158804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511547,0.00015937944,0.00022681044,0.000036853566,0.0004315888,0.0004052348,0.001612482,0.000048040576,0.000010878738],"category_scores_gemma":[0.00004668406,0.00008103286,0.00012454332,0.0002237576,0.00006390717,0.00016389243,0.00015913787,0.00037829927,0.0000057971506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037152684,0.00011947515,0.000074105505,0.000053525015,0.000095365125,0.000010672188,0.0005156595,0.5744173,0.00015495816,0.39569005,0.020438448,0.00839325],"study_design_scores_gemma":[0.0009262215,0.00053723925,0.000131692,0.00026289208,0.000011247589,0.00042752537,0.00003475818,0.9593722,0.0015541335,0.015595864,0.020967068,0.00017912245],"about_ca_topic_score_codex":0.000001985446,"about_ca_topic_score_gemma":2.5819253e-7,"teacher_disagreement_score":0.9505904,"about_ca_system_score_codex":0.00005828771,"about_ca_system_score_gemma":0.000073783434,"threshold_uncertainty_score":0.39076886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02994611,0.0016932109,0.9645758,0.0003614819,0.0012417705,0.0010984587,0.00007165075,0.0009980992,0.000013397706],"genre_scores_gemma":[0.9712824,0.00026869102,0.027550496,0.00020703586,0.00004048073,0.000520443,0.000009365915,0.000040836807,0.00008020131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769384,0.00008188086,0.00044977435,0.00081136345,0.00028754378,0.00067561975],"domain_scores_gemma":[0.998249,0.00027582917,0.00018920876,0.0008326605,0.00033430118,0.00011899503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018180023,0.00036957895,0.00047501104,0.0004046604,0.000777253,0.000041924635,0.0007380091,0.0006208428,0.000024959703],"category_scores_gemma":[0.000015891188,0.00037412092,0.00030091128,0.0013567262,0.00043009597,0.00033426454,0.000009261972,0.0007984635,0.000020511006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029005134,0.0010569117,0.00018905869,0.0000146621,0.00070437556,0.00019559744,0.00020124918,0.9308495,0.006445837,0.0033733128,0.0005712339,0.05610819],"study_design_scores_gemma":[0.0021571168,0.00069485244,0.00005922401,0.000053495343,0.00007179269,0.0005975403,0.000047526104,0.96920544,0.009551731,0.0006250263,0.016406396,0.0005298414],"about_ca_topic_score_codex":0.0000029098292,"about_ca_topic_score_gemma":0.000008137654,"teacher_disagreement_score":0.94133633,"about_ca_system_score_codex":0.00024010528,"about_ca_system_score_gemma":0.00012606067,"threshold_uncertainty_score":0.9998711},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5693025,0.0013864036,0.4270329,0.00012721967,0.00075175875,0.0005661225,0.000001522767,0.0004088521,0.00042274734],"genre_scores_gemma":[0.9940543,0.00030371,0.0032194748,0.0015410089,0.0005161657,0.00013272515,0.000021297636,0.0001059943,0.00010531367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461794,0.00027954314,0.00087937986,0.0015491773,0.000954442,0.0017195382],"domain_scores_gemma":[0.9967004,0.000824056,0.00041096972,0.0015541017,0.00017667211,0.0003338197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006674941,0.00076517236,0.00088320166,0.0002481339,0.0005793462,0.00017339589,0.0018099901,0.0005186635,0.000030642605],"category_scores_gemma":[0.00001264247,0.0006841923,0.00019522799,0.0018301286,0.00032110864,0.0006012313,0.00060873653,0.0016345073,0.00004724954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038384585,0.0002498489,0.007969097,0.000008346606,0.00006132683,0.0011415281,0.00021604102,0.919975,0.00000984284,0.009814391,0.0015279192,0.058642827],"study_design_scores_gemma":[0.0021186003,0.0003756234,0.0098614395,0.00060578744,0.000013394293,0.0002843269,0.000012696355,0.9854707,0.000016589449,0.00023008209,0.00016161389,0.00084910507],"about_ca_topic_score_codex":0.00012987784,"about_ca_topic_score_gemma":0.0012090931,"teacher_disagreement_score":0.42475182,"about_ca_system_score_codex":0.00025192072,"about_ca_system_score_gemma":0.00021252279,"threshold_uncertainty_score":0.99956095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06906918,0.00008336886,0.92951447,0.00012535688,0.00008392254,0.00058676134,0.0000011110518,0.00009204834,0.00044380708],"genre_scores_gemma":[0.57739544,0.0000085358415,0.42242828,0.000029825846,0.00006534841,0.000035108176,0.0000026468033,0.000009750623,0.00002504714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985978,0.000045512577,0.0004126218,0.00038515983,0.00018888843,0.00037002147],"domain_scores_gemma":[0.9989552,0.0002880767,0.00021754959,0.00029745602,0.00017112018,0.00007057926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033167185,0.00016892198,0.00025691095,0.000112853886,0.0000631418,0.000044107433,0.00030521987,0.00010580336,0.000008317068],"category_scores_gemma":[0.000016548925,0.0001456291,0.000053315,0.0004109322,0.00006705867,0.00072195707,0.00009524551,0.00014254761,0.00000195089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024104567,0.00006819796,0.0009846833,0.000008822004,0.000018937051,0.0000023746622,0.00027805724,0.36791715,0.00015196591,0.013727138,0.000025805626,0.61657584],"study_design_scores_gemma":[0.0013435725,0.0003431128,0.0015990132,0.000087018954,0.0000081244725,0.000021807804,0.00009383036,0.99558824,0.0005285603,0.00013967087,0.00006736889,0.00017969367],"about_ca_topic_score_codex":0.000010924091,"about_ca_topic_score_gemma":0.00028113852,"teacher_disagreement_score":0.62767106,"about_ca_system_score_codex":0.00007614334,"about_ca_system_score_gemma":0.000048689497,"threshold_uncertainty_score":0.59385824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063209934,0.00009606013,0.87920076,0.000091861744,0.0005027485,0.0003050325,5.289293e-7,0.0005875395,0.11858338],"genre_scores_gemma":[0.5285261,0.0000021002127,0.4694715,0.0010089827,0.00035375296,0.00005684639,0.000001742884,0.000018773751,0.0005601399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981125,0.00010598121,0.00029382913,0.0005686222,0.0002809913,0.00063808827],"domain_scores_gemma":[0.9986317,0.00016915286,0.00013216508,0.0007951109,0.00008760303,0.00018424253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036844864,0.00022244497,0.00021383449,0.000060011018,0.0001872692,0.00009117269,0.0011722739,0.00010949523,0.00023219796],"category_scores_gemma":[0.000014900522,0.0001857318,0.00008694242,0.0005763216,0.000051478557,0.00055443245,0.00030200527,0.00024584544,0.00025406166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008548599,0.0003037391,0.008403941,0.000020627229,0.00008002375,0.00023008187,0.00129649,0.0055295415,0.00003975538,0.874844,0.033404157,0.07576214],"study_design_scores_gemma":[0.0005484797,0.0003659734,0.003121559,0.000083291205,0.000013266088,0.000021893955,0.000015438703,0.9691301,0.0026511147,0.01364155,0.009823684,0.00058363564],"about_ca_topic_score_codex":0.00006735463,"about_ca_topic_score_gemma":0.00004447487,"teacher_disagreement_score":0.9636006,"about_ca_system_score_codex":0.00003775252,"about_ca_system_score_gemma":0.00010029731,"threshold_uncertainty_score":0.7573923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5163962,0.000012433995,0.48212424,0.00008892072,0.00007185623,0.00014476632,4.981276e-7,0.000040159644,0.0011208678],"genre_scores_gemma":[0.9612228,0.0000013884825,0.038525593,0.00015406327,0.000043316228,0.000020228304,9.1118716e-7,0.000006496902,0.00002519642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894893,0.000052165713,0.00024337524,0.00036045662,0.00016637353,0.00022872603],"domain_scores_gemma":[0.99904567,0.000090605194,0.000037957772,0.00070832024,0.000054971126,0.000062480794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005849961,0.0001090013,0.00017813027,0.000043893913,0.000028748726,0.00003785162,0.00042410102,0.0000824753,0.000013804638],"category_scores_gemma":[0.00002934389,0.00009585955,0.000034423825,0.00022085701,0.00006405149,0.00021937827,0.00016515814,0.00027682265,0.0000026161845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053874945,0.0008448167,0.028614845,0.00012530963,0.000019401574,0.000018082083,0.0023674513,0.71953756,0.0281537,0.112441145,0.00011078974,0.107713014],"study_design_scores_gemma":[0.00031115147,0.0000346502,0.0021275103,0.000010359827,0.0000012556238,0.0000014177099,0.000013806775,0.9890734,0.0016862246,0.0066167032,0.00001900743,0.000104529005],"about_ca_topic_score_codex":0.00056585844,"about_ca_topic_score_gemma":0.00087576406,"teacher_disagreement_score":0.44482657,"about_ca_system_score_codex":0.000018219573,"about_ca_system_score_gemma":0.00006683211,"threshold_uncertainty_score":0.3909039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005020222,0.0000068516724,0.9525335,0.0016862504,0.00032956863,0.0399682,0.0000027618162,0.0004215776,0.000031070475],"genre_scores_gemma":[0.7161744,0.0000026309187,0.02944931,0.00016864226,0.000029437659,0.25397098,8.3444917e-7,0.000020158246,0.00018358996],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869436,0.000022351269,0.00026156634,0.0005370023,0.00015766032,0.00032703066],"domain_scores_gemma":[0.99882513,0.0000714618,0.000082704115,0.00084474316,0.00010830226,0.000067645764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014716816,0.00018986053,0.00018083585,0.00025056128,0.00023307846,0.00008829898,0.0005600835,0.00030233344,0.000011589886],"category_scores_gemma":[0.0000085230595,0.00017711907,0.00006179486,0.00049364,0.00015284031,0.00036885255,0.00000822493,0.0004463567,0.00001742006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016453449,0.0015998262,0.00018808401,0.00037565507,0.0002564616,0.000048633505,0.0002361298,0.06283326,0.11950996,0.14605393,0.0011078846,0.66762567],"study_design_scores_gemma":[0.004401004,0.0012784488,0.00022374326,0.00015590101,0.000045321958,0.00020186884,0.000037322738,0.4415,0.4852831,0.02008882,0.045902852,0.0008815931],"about_ca_topic_score_codex":0.000008279686,"about_ca_topic_score_gemma":0.0001101517,"teacher_disagreement_score":0.9230842,"about_ca_system_score_codex":0.00003780038,"about_ca_system_score_gemma":0.00007592034,"threshold_uncertainty_score":0.72227067},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031203622,0.000041985702,0.95101076,0.00010736218,0.00010108671,0.04764311,5.279415e-7,0.0002718773,0.0005112415],"genre_scores_gemma":[0.32389936,0.000013917076,0.045304134,0.0007848985,0.00030184205,0.6290903,0.0000031767374,0.000035218512,0.0005671794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855196,0.000027049966,0.00026160016,0.00053130684,0.00015305242,0.00047504567],"domain_scores_gemma":[0.99908894,0.000104042745,0.000098939054,0.00049121893,0.00007775084,0.00013909399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020331451,0.00018774868,0.00019505744,0.000035874644,0.0001919175,0.00021750867,0.00054917025,0.000118552096,0.000011118833],"category_scores_gemma":[0.0000032321882,0.00016174848,0.00006003043,0.0002436643,0.00004192326,0.00036287142,0.00033481236,0.00010730846,0.0000023723208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027986034,0.00009853516,0.00008756222,0.000036164198,0.000018196215,0.000010769375,0.00019296711,0.042278055,0.00004441898,0.10122994,0.0015830876,0.8543923],"study_design_scores_gemma":[0.0017518988,0.0003490894,0.000048890077,0.0000834448,0.000003099856,0.000020010022,0.000025994317,0.9549973,0.00059249613,0.0032453018,0.03857488,0.00030759745],"about_ca_topic_score_codex":0.000025028885,"about_ca_topic_score_gemma":0.00010548582,"teacher_disagreement_score":0.91271925,"about_ca_system_score_codex":0.000055889406,"about_ca_system_score_gemma":0.000072741524,"threshold_uncertainty_score":0.65959114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094374016,0.0003065855,0.89959353,0.0011131617,0.00041177077,0.0012942078,0.0000027667502,0.00063198275,0.0022719542],"genre_scores_gemma":[0.73489374,0.000019131401,0.262777,0.0017928156,0.00015348611,0.0001198225,0.000032668017,0.000033848024,0.00017746762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952623,0.00027728782,0.0005374815,0.0013953651,0.0015602743,0.0009672879],"domain_scores_gemma":[0.9968009,0.00006433691,0.00021410057,0.001785981,0.0005400161,0.0005946762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011987751,0.0005179311,0.00045574005,0.00020949214,0.00035121347,0.00049780856,0.0015080415,0.00026579245,0.0001981047],"category_scores_gemma":[0.000008800497,0.00040158347,0.000096032185,0.0017448976,0.00004415867,0.0005288826,0.00020726229,0.00041960814,0.00007140634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035733194,0.0011727388,0.00008234118,0.000014709969,0.000105533894,0.00011555733,0.0014274338,0.1943219,0.002125581,0.36496714,0.0024820503,0.4328277],"study_design_scores_gemma":[0.0011367251,0.001043831,0.0010205801,0.00008976581,0.0000393653,0.00002915512,0.000053381722,0.9917837,0.0013014363,0.0017344023,0.0011183263,0.0006493439],"about_ca_topic_score_codex":0.000009111032,"about_ca_topic_score_gemma":0.00011386625,"teacher_disagreement_score":0.7974618,"about_ca_system_score_codex":0.00032771044,"about_ca_system_score_gemma":0.00022252997,"threshold_uncertainty_score":0.9998436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032970287,0.00021512,0.95340544,0.0010365535,0.0031685357,0.0007065245,0.0000049345226,0.0006608821,0.007831722],"genre_scores_gemma":[0.96018416,0.000018654522,0.037549373,0.00056513306,0.0007369817,0.000079522564,0.000009219594,0.00003260083,0.0008243844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980375,0.00006517877,0.0003336731,0.0005993051,0.00037304408,0.0005912596],"domain_scores_gemma":[0.9984188,0.00019226682,0.00007844147,0.0010760404,0.000051016217,0.00018343335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054398004,0.00020983316,0.00023385523,0.00009786144,0.000076682256,0.00020359975,0.0017659097,0.00021223047,0.00017875462],"category_scores_gemma":[0.000032320524,0.00020749561,0.00006882711,0.00048596205,0.00005657851,0.00035463553,0.00056296866,0.0008051642,0.00045460858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009357139,0.00043616377,0.005340961,0.000004937543,0.000032313194,0.0005208196,0.00029074878,0.009265219,0.0015315887,0.010843457,0.010796559,0.9609279],"study_design_scores_gemma":[0.0003487187,0.000054043594,0.003900615,0.000014436401,0.000003947756,0.0000625843,0.000002509234,0.98587424,0.00038402664,0.0015888691,0.0074472604,0.000318778],"about_ca_topic_score_codex":0.0000603362,"about_ca_topic_score_gemma":0.00012850708,"teacher_disagreement_score":0.976609,"about_ca_system_score_codex":0.000037849382,"about_ca_system_score_gemma":0.000057891015,"threshold_uncertainty_score":0.84614253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043997392,0.000018573917,0.9535263,0.000159104,0.00032354452,0.00026521285,2.7206687e-7,0.0001786225,0.0015309359],"genre_scores_gemma":[0.9170339,0.00000205426,0.0817899,0.0005497496,0.00013770729,0.000016771062,0.0000016516052,0.0000080189075,0.00046021113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.000015054008,0.00013516983,0.000329306,0.00013132751,0.00029966916],"domain_scores_gemma":[0.9994561,0.000067295645,0.00003175589,0.0002905329,0.000053825068,0.00010050951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044949763,0.00008909713,0.00008178941,0.00006106737,0.00009824665,0.000094766525,0.00023707945,0.00006774694,0.000012276612],"category_scores_gemma":[0.0000061653977,0.00007837375,0.000022242533,0.00015953845,0.00001576268,0.00014608336,0.00004271553,0.00006205763,0.000008098296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011402076,0.000055981996,0.000025099223,0.0000064916444,0.00000527539,0.0000025068782,0.00021138317,0.0007676986,0.0025644498,0.93683994,0.00048144127,0.05902833],"study_design_scores_gemma":[0.00034985718,0.00036198806,0.0006209681,0.00000350178,0.000004307948,0.000029714482,0.00005309404,0.96942544,0.018581096,0.009274338,0.0011379538,0.00015773864],"about_ca_topic_score_codex":0.000015574318,"about_ca_topic_score_gemma":0.000053929736,"teacher_disagreement_score":0.96865773,"about_ca_system_score_codex":0.00002532767,"about_ca_system_score_gemma":0.00001124645,"threshold_uncertainty_score":0.31959885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03959958,0.00003913967,0.9566247,0.00079625717,0.00031263448,0.00060840586,0.000003380421,0.0003672633,0.0016486705],"genre_scores_gemma":[0.9939452,0.000026772257,0.0036478573,0.0020811954,0.0001622611,0.00006810105,0.0000044403077,0.000037932903,0.000026244272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965862,0.00003547983,0.0004835753,0.00114295,0.00034825754,0.0014035314],"domain_scores_gemma":[0.9979743,0.00014836859,0.00011733844,0.00039072672,0.00027747967,0.0010918214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032954584,0.00055816595,0.0005691258,0.0007686208,0.00024205555,0.0005881468,0.0011693408,0.0003048984,0.000022914468],"category_scores_gemma":[0.00004667675,0.0005722018,0.000074057956,0.0011598371,0.00007096856,0.0005896199,0.00006336496,0.0010495235,0.000009438525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014586723,0.0003832919,0.011657535,0.00005360504,0.00007183136,0.0004287412,0.001843577,0.075579055,0.00094611204,0.8089082,0.00074623805,0.0992359],"study_design_scores_gemma":[0.00090462435,0.00088072586,0.011307577,0.00015170065,0.0000051448574,0.00004275462,0.0000063169114,0.9856498,0.000039077317,0.0001639524,0.0001908399,0.00065748236],"about_ca_topic_score_codex":0.0008183357,"about_ca_topic_score_gemma":0.00044210887,"teacher_disagreement_score":0.95434564,"about_ca_system_score_codex":0.00028738825,"about_ca_system_score_gemma":0.00062266906,"threshold_uncertainty_score":0.99967295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37731153,0.000034087665,0.6048206,0.0007028665,0.000036743237,0.00021667566,1.9334625e-7,0.00009165747,0.01678567],"genre_scores_gemma":[0.924344,0.0000031978511,0.07106198,0.0025029182,0.00009175484,0.000035212277,4.8936323e-7,0.0000055977207,0.0019548167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991341,0.000023667772,0.00013039426,0.0003635943,0.00012255774,0.00022566333],"domain_scores_gemma":[0.99970937,0.00002300211,0.000018456129,0.00015583038,0.000024456998,0.000068908106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016332396,0.000086863685,0.00008572105,0.00006600126,0.00003996899,0.0003332441,0.00029051022,0.00004832289,0.000010461787],"category_scores_gemma":[0.0000035067405,0.00007783375,0.000010765058,0.0005589769,0.000007143821,0.0010072705,0.00022279074,0.00009412247,0.000045209712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070615686,0.0008036207,0.06407083,0.00009851024,0.00003064183,0.000010898598,0.0049482216,0.47202802,0.0048433174,0.17119604,0.007857997,0.27404127],"study_design_scores_gemma":[0.00026612077,0.000027909198,0.09254296,0.000007028766,9.037066e-7,0.000030097424,0.000008859655,0.9009132,0.0005286095,0.00019698079,0.0053192647,0.0001580807],"about_ca_topic_score_codex":0.00019719324,"about_ca_topic_score_gemma":0.00091113185,"teacher_disagreement_score":0.54703254,"about_ca_system_score_codex":0.000044474757,"about_ca_system_score_gemma":0.000017756269,"threshold_uncertainty_score":0.32134807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040716055,0.00025125273,0.88530266,0.0003624514,0.00056108204,0.1118538,0.0000032321936,0.00094885874,0.0003094929],"genre_scores_gemma":[0.5517402,0.000022920542,0.023859408,0.0037312126,0.0018125182,0.41837522,0.000046709196,0.000119121214,0.00029264152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494934,0.0002563544,0.0010016096,0.001450105,0.0005255413,0.0018170195],"domain_scores_gemma":[0.99630195,0.00060052855,0.00057232584,0.0018210935,0.00027100462,0.0004331198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000991937,0.0007238122,0.00077211775,0.00010937742,0.0006161106,0.000612902,0.0023136868,0.00062968954,0.000032361113],"category_scores_gemma":[0.000024490188,0.0007009948,0.000428094,0.00111496,0.00010373361,0.0006288719,0.0003114274,0.0008530235,0.000014323302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018689648,0.00019670364,0.00014779437,0.000027197182,0.000019700628,0.000017357283,0.00007738379,0.57541,0.0000038050216,0.0015531332,0.008118611,0.4142414],"study_design_scores_gemma":[0.0036740508,0.0009684885,0.000254685,0.00034005032,0.000018731445,0.0000151278155,0.000016644233,0.95850635,0.000039591625,0.00035391643,0.03502374,0.00078863086],"about_ca_topic_score_codex":0.0000028957493,"about_ca_topic_score_gemma":0.000022913999,"teacher_disagreement_score":0.8614433,"about_ca_system_score_codex":0.00020740127,"about_ca_system_score_gemma":0.00019663037,"threshold_uncertainty_score":0.99954414},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010894879,0.00009495876,0.98622775,0.00013003446,0.00061547966,0.00086615514,0.0000024822982,0.0005843172,0.00058393157],"genre_scores_gemma":[0.77468747,0.00005003688,0.22309819,0.00046401485,0.00027105695,0.000294878,0.0000080637365,0.000029206696,0.0010970602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767464,0.000056440174,0.00041295824,0.0008165818,0.0002800513,0.00075931195],"domain_scores_gemma":[0.99808484,0.00028925543,0.00011789177,0.0011184064,0.00016800188,0.0002215908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047367282,0.00027709734,0.00036578914,0.000063881525,0.00041989348,0.00010453732,0.0012617448,0.00018514857,0.00002908951],"category_scores_gemma":[0.000027946631,0.00025295952,0.00022919297,0.00045640836,0.000087401495,0.0006325381,0.00046878538,0.0002480891,0.000023004068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015711148,0.0022121577,0.041394036,0.00032798876,0.00049012766,0.00027645734,0.0030523764,0.05249649,0.0008639615,0.49616423,0.14109409,0.26147097],"study_design_scores_gemma":[0.0007695906,0.000076258075,0.0006192364,0.000023742596,0.000005031573,0.000034721037,0.000024517252,0.99556506,0.00032677237,0.00021135273,0.0020133695,0.00033037324],"about_ca_topic_score_codex":0.000030681953,"about_ca_topic_score_gemma":0.000027670229,"teacher_disagreement_score":0.94306856,"about_ca_system_score_codex":0.00008927119,"about_ca_system_score_gemma":0.00008810893,"threshold_uncertainty_score":0.99999225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011696589,0.0014011961,0.98407793,0.000048641516,0.000069025016,0.0025227827,0.0000014349984,0.00008197107,0.000100439924],"genre_scores_gemma":[0.9912186,0.0008972085,0.0052762716,0.00008969659,0.00020560368,0.002266682,0.000015912263,0.000012591353,0.000017417828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983815,0.00010414114,0.00041659613,0.0005240587,0.00022618442,0.0003475113],"domain_scores_gemma":[0.9984294,0.00038268295,0.0002541662,0.00050744275,0.0003163641,0.000109911496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013387642,0.00019716693,0.000278801,0.00009788445,0.00029804368,0.00013017579,0.00043595405,0.00013849275,0.000003838724],"category_scores_gemma":[0.00000849119,0.00018854633,0.00004651356,0.0008000512,0.00006837146,0.00029040716,0.000119726705,0.00017486693,5.224801e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007148551,0.000035342935,0.00016074313,0.000006250705,0.000009490599,3.9976477e-8,0.00002942798,0.4066042,0.000009075977,0.0071885064,0.00014117244,0.5858086],"study_design_scores_gemma":[0.00043007865,0.0002878919,0.0019200989,0.000054057786,0.000054908563,0.0000052168834,0.00002336096,0.9959469,0.00007119536,0.0008202673,0.00019499823,0.00019101193],"about_ca_topic_score_codex":0.0000031052884,"about_ca_topic_score_gemma":0.0000020085563,"teacher_disagreement_score":0.97952205,"about_ca_system_score_codex":0.000041961343,"about_ca_system_score_gemma":0.0000482368,"threshold_uncertainty_score":0.76886964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06063481,0.001669955,0.9156788,0.00025349797,0.0009415756,0.00023562014,1.1956455e-7,0.00029898153,0.020286618],"genre_scores_gemma":[0.96218663,0.00024846135,0.035569884,0.0004426347,0.00025611877,0.000012484765,0.0000017195296,0.000020290008,0.0012617449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977875,0.00005646545,0.0004678759,0.0006175265,0.00027131467,0.00079934666],"domain_scores_gemma":[0.9986138,0.00017450849,0.000098597,0.00088481436,0.00005048752,0.00017782245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073848,0.00019330974,0.0002275312,0.00015463172,0.00009060197,0.00014976665,0.0010344689,0.00015066018,0.000053021467],"category_scores_gemma":[0.000015216642,0.00018888434,0.00006292729,0.0011316782,0.000049977425,0.0005041059,0.00037491287,0.00040151877,0.00005204634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126558,0.00006425988,0.0008212658,0.0000051481047,0.000005763974,0.00013173575,0.00036009174,0.00643398,0.00016441793,0.020954676,0.002265373,0.96878064],"study_design_scores_gemma":[0.0008822726,0.00014026373,0.013935556,0.0001993236,0.000003936198,0.00009997726,0.00009013691,0.96415323,0.0010607558,0.0011442936,0.017604258,0.000685983],"about_ca_topic_score_codex":0.000056524797,"about_ca_topic_score_gemma":0.00030612847,"teacher_disagreement_score":0.96809465,"about_ca_system_score_codex":0.00012391976,"about_ca_system_score_gemma":0.000053496533,"threshold_uncertainty_score":0.770248},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043111388,0.00021764058,0.9931369,0.00033935692,0.00062144076,0.00038669867,0.0000070238307,0.00059630745,0.00038351666],"genre_scores_gemma":[0.95052534,0.00006163851,0.046480466,0.00035578173,0.00007426979,0.00005778054,0.000009068818,0.000016809367,0.002418841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982647,0.00008751658,0.00032163912,0.0005804659,0.0002570061,0.0004886753],"domain_scores_gemma":[0.9985735,0.00014661091,0.000096267875,0.000867159,0.0001166796,0.00019977555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018912049,0.00022691512,0.00027999553,0.000059623155,0.00021901532,0.00018486196,0.0020808356,0.00010028414,0.00007787063],"category_scores_gemma":[0.000058288322,0.00019000871,0.000112256435,0.0004698725,0.000083467115,0.0009174628,0.0009098069,0.0002097598,0.00025062024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006035695,0.006105077,0.014091807,0.0001383633,0.0006735593,0.001925754,0.007565529,0.58207667,0.0027306802,0.008694802,0.3314303,0.043963887],"study_design_scores_gemma":[0.004127822,0.000030707,0.0036569424,0.000013606574,0.0000038034034,0.000070295806,0.00001002079,0.98413503,0.0050127343,0.00005425725,0.0025898428,0.00029492416],"about_ca_topic_score_codex":0.00013656935,"about_ca_topic_score_gemma":0.00007783561,"teacher_disagreement_score":0.9466564,"about_ca_system_score_codex":0.000051240855,"about_ca_system_score_gemma":0.000049677066,"threshold_uncertainty_score":0.774833},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004649777,0.0000025926395,0.8467089,0.00050875655,0.00004197158,0.15126334,0.0000019117379,0.00009617909,0.0013298414],"genre_scores_gemma":[0.0091334,0.000007098412,0.39583543,0.0004290094,0.00004153748,0.59424955,0.00006336571,0.000016962664,0.00022366198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829745,0.000062548446,0.00041938195,0.00073196867,0.00029734577,0.00019130066],"domain_scores_gemma":[0.9978498,0.000077617464,0.00038393814,0.0012200976,0.00040465634,0.000063878586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022756978,0.00021416569,0.0003799543,0.00035309026,0.00005419626,0.00007533623,0.00085033325,0.00015364178,0.000005216446],"category_scores_gemma":[0.0000050197973,0.00019128811,0.00011401482,0.0010335702,0.000033062443,0.00008595878,0.00072773546,0.00011980482,0.0000012106358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008226217,0.00030060788,0.00094057235,0.0039331075,0.0011200514,0.00001288981,0.00024051983,0.8971554,0.0000025002698,0.019168323,0.0040307306,0.073013],"study_design_scores_gemma":[0.0004947886,0.000053121832,0.0019251786,0.0001256425,0.00019949384,0.0000010304551,0.000003501683,0.99385536,0.00009512025,0.00091658835,0.0021318304,0.0001983472],"about_ca_topic_score_codex":0.00009697285,"about_ca_topic_score_gemma":0.00011805116,"teacher_disagreement_score":0.45087346,"about_ca_system_score_codex":0.000054485758,"about_ca_system_score_gemma":0.0001845493,"threshold_uncertainty_score":0.7800503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18045102,0.00040382624,0.8112036,0.00005023266,0.0020356798,0.00030204098,1.8507333e-7,0.00041076555,0.0051426287],"genre_scores_gemma":[0.99458987,0.00026583485,0.0042558005,0.000086824366,0.00030923221,0.00007800186,6.5198543e-7,0.000023068947,0.00039070268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981665,0.00010039037,0.00032904051,0.00057591696,0.00023378509,0.0005943613],"domain_scores_gemma":[0.99882925,0.00007167804,0.000103747916,0.00077207625,0.0000643772,0.00015889925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003477027,0.00022123694,0.00022348449,0.0001229846,0.00008936395,0.000094169314,0.0008523535,0.00018740284,0.000024163597],"category_scores_gemma":[0.000010120271,0.00021240146,0.00006838722,0.00072351686,0.000040041064,0.0006133644,0.00034002433,0.00035849525,0.000086056796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006861523,0.00029577743,0.006558704,0.000020874115,0.00003970344,0.000170886,0.0022981423,0.006828752,0.00060757453,0.0025276027,0.0008018878,0.9797815],"study_design_scores_gemma":[0.0005226654,0.00022164051,0.026147174,0.00006653718,0.000005243339,0.000025000754,0.00009361761,0.9605124,0.010366309,0.00091102754,0.0006566921,0.00047166375],"about_ca_topic_score_codex":0.00008463072,"about_ca_topic_score_gemma":0.000419955,"teacher_disagreement_score":0.9793098,"about_ca_system_score_codex":0.00010000813,"about_ca_system_score_gemma":0.000025784511,"threshold_uncertainty_score":0.866148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006457891,0.00005284966,0.9905667,0.0003260512,0.0003812079,0.0010573884,0.0000034950292,0.00060001673,0.00055444153],"genre_scores_gemma":[0.45297152,0.0000039368856,0.5445385,0.001418369,0.0004528928,0.00032935027,0.000021447826,0.000033632747,0.00023038522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719197,0.00007145208,0.00047429977,0.0009488149,0.00044731444,0.00086615176],"domain_scores_gemma":[0.99837095,0.00036786907,0.0002275978,0.0006577762,0.00019324254,0.0001825469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070476386,0.0003923451,0.0003466524,0.0001800518,0.00039557347,0.00027396396,0.00083827024,0.00022731024,0.000016522066],"category_scores_gemma":[0.00001348523,0.00036230774,0.00013614053,0.0008981025,0.00004617132,0.0005435101,0.00010952802,0.0003976622,0.000013909894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033987515,0.00020571655,0.00001873052,0.00001642209,0.0000069937246,2.5457442e-7,0.000019856212,0.5482228,0.00003479152,0.00022805166,0.00040992605,0.45080248],"study_design_scores_gemma":[0.002582069,0.0005907694,0.00014691522,0.00007872409,0.000012590767,0.00001128955,0.000004760359,0.99249715,0.0014211468,0.0000051948678,0.002196131,0.0004532657],"about_ca_topic_score_codex":0.000013764602,"about_ca_topic_score_gemma":0.000016271593,"teacher_disagreement_score":0.4503492,"about_ca_system_score_codex":0.00024454406,"about_ca_system_score_gemma":0.00015276825,"threshold_uncertainty_score":0.9998829},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029334198,0.000019187897,0.8408467,0.0007120307,0.00013296807,0.15450567,0.000042301373,0.00018835538,0.00061934715],"genre_scores_gemma":[0.46250272,0.000004597438,0.02011358,0.00020690695,0.00019272747,0.5167609,0.000021915741,0.000032983135,0.00016369356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971464,0.000036207595,0.0007090284,0.0009057086,0.0007437329,0.00045888216],"domain_scores_gemma":[0.9976481,0.00010035628,0.00071346905,0.00017704807,0.0011557023,0.00020529826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039603855,0.00043630408,0.00044261417,0.00015613128,0.00033329675,0.0004940728,0.00095180515,0.0001331336,0.000005058593],"category_scores_gemma":[0.000051945342,0.0003861621,0.000063261185,0.00053954497,0.0002652551,0.002788391,0.00035640242,0.00031472705,0.0000016958307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.059037898,0.024080697,0.09002663,0.037901197,0.0038652285,0.0015726018,0.04551684,0.16995192,0.12145904,0.11930418,0.15777776,0.16950603],"study_design_scores_gemma":[0.0045843744,0.0007419486,0.0007415584,0.00094071985,0.00003517601,0.0009904744,0.00009498038,0.95047635,0.033283647,0.003863682,0.0033752127,0.0008718567],"about_ca_topic_score_codex":0.000026272948,"about_ca_topic_score_gemma":0.0000012464047,"teacher_disagreement_score":0.82073313,"about_ca_system_score_codex":0.00009295317,"about_ca_system_score_gemma":0.00033960326,"threshold_uncertainty_score":0.99985904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003870071,0.00027998825,0.996474,0.00058517733,0.00067915884,0.0012378391,7.765319e-7,0.00024015548,0.00011584692],"genre_scores_gemma":[0.84780127,0.00007355267,0.15020323,0.00067467033,0.00018416894,0.00017167481,0.0000031184002,0.000028558348,0.00085975806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785525,0.00007629029,0.0004676576,0.0006926773,0.0002344229,0.0006737042],"domain_scores_gemma":[0.9985664,0.00028470458,0.0001583926,0.00056715246,0.00016795206,0.00025538282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017371996,0.00027432907,0.000274899,0.00009243227,0.00020925606,0.00018826986,0.0006027968,0.00015789495,0.00000932189],"category_scores_gemma":[0.000024602763,0.00024812834,0.00006578522,0.00025477106,0.00006409234,0.00035276334,0.00035696122,0.0001716647,0.000009710683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024484977,0.0010396531,0.00008416071,0.00013965138,0.00034941558,0.000042149004,0.005320877,0.59516835,0.002927539,0.11880915,0.057453446,0.21842077],"study_design_scores_gemma":[0.0007815881,0.00018775807,0.00019215881,0.00004199424,0.000009680199,0.000014627565,0.00011340871,0.98743385,0.009762588,0.0008773453,0.00027382057,0.00031115388],"about_ca_topic_score_codex":0.00002592733,"about_ca_topic_score_gemma":0.000056681434,"teacher_disagreement_score":0.84741426,"about_ca_system_score_codex":0.00010588157,"about_ca_system_score_gemma":0.000036706726,"threshold_uncertainty_score":0.9999971},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21867843,0.00012713592,0.77724016,0.0006523883,0.00027746224,0.00020924603,8.1179046e-8,0.00019926949,0.0026158586],"genre_scores_gemma":[0.97391254,0.00006048059,0.024794493,0.0009515955,0.00019943104,0.0000073920196,0.0000016676156,0.000008603082,0.00006382809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839187,0.00005202336,0.00036437233,0.0005091708,0.00017050318,0.00051208725],"domain_scores_gemma":[0.9992335,0.00006820308,0.00008839636,0.0004404486,0.00004121338,0.0001282253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054726965,0.0001794729,0.0002637103,0.00009332396,0.00009460347,0.00022113447,0.00045389487,0.00011674082,0.000009038898],"category_scores_gemma":[0.00001531393,0.00016673178,0.000037315807,0.00061748986,0.00002627297,0.00042595528,0.00023313757,0.00034210415,0.000008103288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002401347,0.00020613536,0.008867416,0.000015975458,0.000026192836,0.00017868353,0.0011529501,0.15720786,0.0019465073,0.15321931,0.0010706245,0.67608434],"study_design_scores_gemma":[0.00036719124,0.00006787477,0.01179808,0.00007620288,0.0000020061345,0.000016131777,0.000023025636,0.98645973,0.00037828754,0.00057643774,0.000025139183,0.00020988274],"about_ca_topic_score_codex":0.0000639912,"about_ca_topic_score_gemma":0.000037305406,"teacher_disagreement_score":0.8292519,"about_ca_system_score_codex":0.000047534166,"about_ca_system_score_gemma":0.000031427055,"threshold_uncertainty_score":0.67991245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020527216,0.0015786424,0.97448313,0.0007671042,0.00025316403,0.0001859048,9.9360115e-8,0.000052466734,0.0021522522],"genre_scores_gemma":[0.9931254,0.00012394533,0.0064247637,0.00017002701,0.00003018578,0.00002746628,4.7728844e-7,0.00000353653,0.00009421703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917525,0.00004812035,0.00023594381,0.00016062157,0.00014425493,0.00023583653],"domain_scores_gemma":[0.99925506,0.00015323165,0.000071597504,0.00044186565,0.00003905148,0.00003916947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026861578,0.000064874344,0.000089411,0.000018713396,0.000051029598,0.000042428284,0.00053905905,0.000044879325,0.000008769902],"category_scores_gemma":[0.000022459399,0.000043850247,0.000028893117,0.00035512634,0.00006685606,0.00018224331,0.00012315324,0.00009927084,0.000008433254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065379145,0.00004570417,0.00063059974,0.0000012006728,0.000005486104,0.0000039212923,0.0005759497,0.34039938,0.000017348651,0.21400979,0.00041974938,0.4438843],"study_design_scores_gemma":[0.0012474088,0.00022948952,0.04188182,0.000049265735,0.0000046124233,0.0000036174613,0.00006789729,0.9332255,0.0014508547,0.01743573,0.0041798996,0.00022389933],"about_ca_topic_score_codex":0.000027340624,"about_ca_topic_score_gemma":0.0006606586,"teacher_disagreement_score":0.97259814,"about_ca_system_score_codex":0.000035616227,"about_ca_system_score_gemma":0.00004019523,"threshold_uncertainty_score":0.17881612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045138085,0.00013395552,0.99354863,0.00050040416,0.00015999739,0.00051967794,7.446042e-7,0.00028429032,0.00033851384],"genre_scores_gemma":[0.6074729,0.000018109324,0.3903434,0.0009970788,0.0002901401,0.0000458969,0.0000057908487,0.000014779184,0.00081191777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983298,0.00006012736,0.00034267092,0.0005950442,0.00018096904,0.0004913515],"domain_scores_gemma":[0.9989956,0.000107179956,0.00012631773,0.0005172041,0.00010718933,0.00014652096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007078795,0.00019208326,0.00022481135,0.000047211233,0.00025759963,0.0004397432,0.00045146275,0.00013752571,0.0000034605991],"category_scores_gemma":[0.00002004498,0.00017706509,0.0000691014,0.00024777977,0.000042142925,0.00041271138,0.0001508874,0.00017344703,0.0000031276522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005136133,0.000062736595,0.00014881133,0.000004471875,0.000014137526,0.0000048319102,0.0003729212,0.005170538,0.00011372642,0.04094875,0.0015286412,0.9516253],"study_design_scores_gemma":[0.00074439764,0.00009716694,0.004159619,0.000027852255,0.0000054695643,0.0000216587,0.000019307341,0.9931438,0.00040687548,0.0002488387,0.00089411554,0.00023088805],"about_ca_topic_score_codex":0.000023630222,"about_ca_topic_score_gemma":0.000015271875,"teacher_disagreement_score":0.9879733,"about_ca_system_score_codex":0.000053701748,"about_ca_system_score_gemma":0.000026168475,"threshold_uncertainty_score":0.7220505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6906043,0.0006206324,0.302965,0.00025838285,0.00019215356,0.00024123455,1.7333623e-7,0.00004759221,0.005070531],"genre_scores_gemma":[0.9931445,0.00015003546,0.0063973214,0.00020972322,0.000033074946,0.000031534015,0.0000024238414,0.0000052630503,0.000026110598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987747,0.000059866357,0.00025733747,0.0002537354,0.0004306761,0.00022368923],"domain_scores_gemma":[0.9992186,0.000034933713,0.00008618888,0.0004771793,0.00015321007,0.00002989133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075163954,0.000102532045,0.00013099107,0.00006248219,0.000028554985,0.000106641026,0.0005568161,0.00006212383,0.00001542279],"category_scores_gemma":[0.0000057025923,0.000090763184,0.000025047102,0.000717298,0.00002113787,0.002091584,0.00014914156,0.00011908327,0.000010217439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049740834,0.000037104557,0.0004397142,0.000009313745,0.0000034868458,6.999855e-7,0.0002759307,0.93232745,0.000038461825,0.01644231,0.000014599363,0.050405942],"study_design_scores_gemma":[0.00062701246,0.00006419242,0.033800416,0.000069313086,0.000004911392,0.000002527477,0.000101288715,0.96170586,0.00023085513,0.003255759,0.00002523065,0.00011261248],"about_ca_topic_score_codex":0.00007292615,"about_ca_topic_score_gemma":0.0013389819,"teacher_disagreement_score":0.30254018,"about_ca_system_score_codex":0.00009717245,"about_ca_system_score_gemma":0.0002782779,"threshold_uncertainty_score":0.37012154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015617056,0.00005018604,0.988825,0.00004176089,0.00026302083,0.00037850862,8.3494974e-8,0.0002702673,0.008609459],"genre_scores_gemma":[0.75349206,0.0000010842092,0.24437444,0.00018033735,0.00040802942,0.000021167243,0.0000024508481,0.000013829952,0.0015065997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985912,0.0000447545,0.00030256738,0.0003691618,0.00017688736,0.0005154615],"domain_scores_gemma":[0.9992158,0.00019569232,0.00014854253,0.00029378044,0.000096054275,0.000050176634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036359264,0.00015395312,0.00016079054,0.000044868848,0.00029072672,0.0001641019,0.0003452141,0.000075188866,0.0000133634285],"category_scores_gemma":[0.000015892647,0.00014625103,0.000087143075,0.0002524666,0.000020773177,0.00031537624,0.00021390514,0.00016580861,0.000007092229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004930702,0.000006620305,0.00024200825,0.000001733217,0.000007632567,0.0000026129187,0.000033254597,0.92338485,0.00006832805,0.07042585,0.00032226718,0.0054999273],"study_design_scores_gemma":[0.00028206277,0.00007930889,0.00007187979,0.000020780111,0.000006514345,0.000007795974,0.00003474013,0.99697673,0.00023197856,0.0003738638,0.0017207894,0.00019355364],"about_ca_topic_score_codex":0.00019334565,"about_ca_topic_score_gemma":0.00001738662,"teacher_disagreement_score":0.75193036,"about_ca_system_score_codex":0.00009894978,"about_ca_system_score_gemma":0.00003201901,"threshold_uncertainty_score":0.59639436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010026975,0.000057440142,0.9840219,0.0018174883,0.00032014228,0.0003003453,3.3754768e-7,0.0003716505,0.0030837269],"genre_scores_gemma":[0.98910993,0.000022313721,0.006726328,0.0037004673,0.000120192315,0.000029410883,0.000006007072,0.000008561287,0.00027676646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839413,0.000115990224,0.00031723725,0.0004812269,0.0002285353,0.000462896],"domain_scores_gemma":[0.9988402,0.00018580355,0.00007495041,0.0006879022,0.000074195996,0.0001369641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036830295,0.00018506925,0.00023845863,0.00009936208,0.00006785026,0.00016357139,0.0007428156,0.00015747477,0.000059502032],"category_scores_gemma":[0.000012206434,0.00017083011,0.0000642539,0.0006392487,0.000034805806,0.00032876947,0.00007417688,0.0002897442,0.000031156902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056048968,0.00036777562,0.0085176425,0.000010386644,0.000012319781,0.0002124985,0.0001231095,0.1324201,0.00008025215,0.42056262,0.016724132,0.4209131],"study_design_scores_gemma":[0.0007561029,0.00011384163,0.012394141,0.000052721487,0.0000020137072,0.00000499746,0.0000031789095,0.98497516,0.00020852624,0.0009310779,0.0003311439,0.00022706708],"about_ca_topic_score_codex":0.0000413709,"about_ca_topic_score_gemma":0.00020416126,"teacher_disagreement_score":0.979083,"about_ca_system_score_codex":0.000070847556,"about_ca_system_score_gemma":0.00009401041,"threshold_uncertainty_score":0.696625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018572964,0.0027903796,0.98951197,0.000056953177,0.000249674,0.0014196874,0.000009118296,0.00020626928,0.0057373536],"genre_scores_gemma":[0.035522293,0.007041896,0.9437586,0.0016119828,0.0005880376,0.000607294,0.0010734032,0.00021661891,0.009579882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759036,0.00006173718,0.00062859105,0.00091649586,0.00034034002,0.00046248367],"domain_scores_gemma":[0.9987263,0.000092034315,0.00035396666,0.00053777464,0.00012251634,0.00016741134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004470107,0.00041874696,0.00040737574,0.00020610612,0.00013113084,0.00026813618,0.0005387732,0.00038998606,0.00032011032],"category_scores_gemma":[0.000002783729,0.0004425339,0.00006405923,0.00013803752,0.00003232362,0.00064807246,0.0001987931,0.00038642235,0.000006979468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056786316,0.000022405604,0.000009664977,0.0000084053445,0.000010230924,0.000027981247,0.00008330755,0.8140704,7.276407e-7,0.019233894,0.000058830672,0.16646844],"study_design_scores_gemma":[0.0010775513,0.00035428282,0.00003921807,0.000120287084,0.000015205703,0.000007856124,0.000016166952,0.9954627,0.000005272996,0.0009157251,0.0015090597,0.00047663256],"about_ca_topic_score_codex":0.000022733684,"about_ca_topic_score_gemma":0.00026180278,"teacher_disagreement_score":0.18139231,"about_ca_system_score_codex":0.00028821,"about_ca_system_score_gemma":0.00020242107,"threshold_uncertainty_score":0.99980265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19148387,0.000038270515,0.7992177,0.00001732174,0.00014361127,0.00462577,0.0000093748695,0.00020180666,0.004262267],"genre_scores_gemma":[0.9898822,0.000039109258,0.009326749,0.0000433589,0.000031756397,0.00010796819,0.000010416083,0.00001494255,0.00054351514],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984833,0.00007425632,0.0002744571,0.0005120253,0.0002089152,0.00044704758],"domain_scores_gemma":[0.9984153,0.00011164515,0.00029964672,0.00082674547,0.00021341305,0.00013325523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969315,0.000197774,0.00040595196,0.00047430224,0.0001819337,0.000033348333,0.0015510655,0.0001456969,0.00004029939],"category_scores_gemma":[0.000008761104,0.00021774726,0.0002656167,0.0030340792,0.000085424275,0.0006973725,0.0003496077,0.00017031016,0.000004580499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003022802,0.0002610045,0.85964143,0.000078528006,0.0009173752,0.000039310893,0.00023556624,0.021805944,0.000005848247,0.016956197,0.0015126105,0.09824391],"study_design_scores_gemma":[0.00078961614,0.00027931176,0.007366662,0.000071137874,0.0003025312,4.077218e-9,0.00060390955,0.97379786,0.00072894397,0.00003594678,0.015691746,0.0003323601],"about_ca_topic_score_codex":0.00002357512,"about_ca_topic_score_gemma":0.0028928637,"teacher_disagreement_score":0.9519919,"about_ca_system_score_codex":0.00008555387,"about_ca_system_score_gemma":0.00006754508,"threshold_uncertainty_score":0.88794756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19859158,0.00028517746,0.79741234,0.00038279418,0.00017705616,0.00027029487,3.845252e-7,0.00018256412,0.0026978385],"genre_scores_gemma":[0.9817008,0.000037623533,0.017355341,0.00063868286,0.00006795054,0.00000764401,0.0000021255412,0.000019767993,0.00017010086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977467,0.000085022264,0.00035196566,0.00062325294,0.00032945522,0.00086358754],"domain_scores_gemma":[0.99839497,0.0006448749,0.00005990103,0.00060644926,0.000071750124,0.00022203838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013962843,0.0002066141,0.00023160905,0.0001470709,0.00016156134,0.00018929443,0.00059631723,0.00016316732,0.000045449757],"category_scores_gemma":[0.000017255354,0.00019492827,0.00004464454,0.00074780796,0.000069847876,0.00027894447,0.00039140205,0.00041175188,0.000015355017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013085864,0.00030638778,0.24870056,0.000092395276,0.00003543106,0.0011120461,0.0020418244,0.11189926,0.00008923202,0.011560457,0.0014663098,0.62256527],"study_design_scores_gemma":[0.0005940974,0.00008000736,0.053740848,0.00007059019,0.0000014353072,0.00001873695,0.00012621701,0.9441488,0.00015590797,0.00002314246,0.00078281725,0.0002574374],"about_ca_topic_score_codex":0.000099289064,"about_ca_topic_score_gemma":0.0024112673,"teacher_disagreement_score":0.8322495,"about_ca_system_score_codex":0.00008935939,"about_ca_system_score_gemma":0.000052123167,"threshold_uncertainty_score":0.79489446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3097987,0.0004025488,0.6372518,0.0015413405,0.00025021005,0.00065233285,8.301232e-7,0.00053720904,0.04956504],"genre_scores_gemma":[0.9928415,0.000046838417,0.0053111617,0.0010493419,0.000044258348,0.000057240937,0.0000194788,0.000016265736,0.0006139404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989988,0.000046927802,0.00019389419,0.00028251714,0.00019476218,0.00028307762],"domain_scores_gemma":[0.99880975,0.00015195135,0.000064126245,0.00090652064,0.000028978406,0.000038661226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019429144,0.00014901103,0.00013752411,0.000091593494,0.00008415681,0.00014876977,0.00072617445,0.00007985773,0.000029821607],"category_scores_gemma":[0.0000016687969,0.00011176933,0.000029310935,0.0003514234,0.00003728056,0.00022200502,0.00008620802,0.0002735291,0.00004856941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036539317,0.00027553612,0.0015237117,0.00000466854,0.000007773169,0.000014039029,0.00015925309,0.7529837,0.0000023914,0.015553763,0.022509107,0.20692955],"study_design_scores_gemma":[0.0005680677,0.00029226264,0.008027321,0.00008298874,0.0000017089795,0.0000045058696,0.0000109531675,0.9863791,0.000033530225,0.0006361244,0.003739168,0.00022428425],"about_ca_topic_score_codex":0.000061210674,"about_ca_topic_score_gemma":0.001991728,"teacher_disagreement_score":0.68304276,"about_ca_system_score_codex":0.00007108614,"about_ca_system_score_gemma":0.000022655155,"threshold_uncertainty_score":0.4557821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710348,0.000035924793,0.01563216,0.0001023366,0.000038273472,0.0044961134,2.443001e-7,0.000021169557,0.008638942],"genre_scores_gemma":[0.9933285,0.0000030802237,0.005613996,0.00024350361,0.000016209216,0.0007373669,1.3859045e-7,0.0000048768975,0.000052339412],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989252,0.00014756959,0.00031739345,0.00018767205,0.00021070371,0.0002114474],"domain_scores_gemma":[0.99901044,0.00019885434,0.00017777247,0.00053546147,0.000056635243,0.000020841682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012230305,0.00009341401,0.00015922406,0.000028872091,0.000075256816,0.00007678752,0.00080405513,0.000044407807,0.00001977708],"category_scores_gemma":[0.00001461281,0.00004970387,0.000027893902,0.00023602978,0.00010492141,0.00046882537,0.00022148031,0.00015573161,0.0000023127723],"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.000035808494,0.00040687883,0.72194374,0.00024705994,0.000034445275,0.000015753556,0.043148935,0.0001703765,0.0031400716,0.050863158,0.0006819387,0.17931181],"study_design_scores_gemma":[0.00076866534,0.0002747441,0.574725,0.00039614824,0.000008722663,0.000052922154,0.0023454719,0.39125532,0.028993376,0.00046393764,0.00047441816,0.00024129223],"about_ca_topic_score_codex":0.00010463002,"about_ca_topic_score_gemma":0.000091215894,"teacher_disagreement_score":0.39108494,"about_ca_system_score_codex":0.000007785515,"about_ca_system_score_gemma":0.00003226484,"threshold_uncertainty_score":0.2026865},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48269892,0.00003746417,0.51596254,0.000050444836,0.00023690815,0.0005871599,4.4921893e-7,0.000054259395,0.00037184512],"genre_scores_gemma":[0.9682118,0.0000108731565,0.03125667,0.000027586251,0.00008024971,0.00031519603,0.0000069338425,0.0000111849595,0.00007945928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986909,0.000048837843,0.0002609909,0.0003142809,0.00046150983,0.00022348142],"domain_scores_gemma":[0.9983039,0.00009611044,0.00020417177,0.00072495884,0.0006122708,0.00005858512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927523,0.00011380492,0.0001522537,0.000051591946,0.00008182984,0.000058028327,0.0005430277,0.000044844055,0.000021056012],"category_scores_gemma":[0.000015617505,0.00008861571,0.000038011778,0.0002312998,0.00004082389,0.0004121351,0.000062737265,0.0001155458,0.0000055126784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006769467,0.00012563079,0.0016474831,0.00008339072,0.00004774785,4.2294675e-7,0.0003557837,0.030957391,0.0025231026,0.03739489,0.00059759326,0.92619884],"study_design_scores_gemma":[0.00059433235,0.00015926137,0.0023176323,0.000039486487,0.000027944085,0.000012049145,0.0000095148725,0.9924398,0.0037935528,0.000170561,0.0003156957,0.00012015494],"about_ca_topic_score_codex":0.0000017531729,"about_ca_topic_score_gemma":0.00003912969,"teacher_disagreement_score":0.9614824,"about_ca_system_score_codex":0.000028205233,"about_ca_system_score_gemma":0.000119608936,"threshold_uncertainty_score":0.36136436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010745686,0.0025017473,0.9882081,0.0026298042,0.002852711,0.00071266893,0.000003062132,0.0002006208,0.0027838286],"genre_scores_gemma":[0.4494046,0.0013896675,0.53458744,0.0065910546,0.0036926093,0.00011144173,0.000044809494,0.00017900085,0.0039993552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419576,0.000076708224,0.0008340957,0.0021163186,0.0017105351,0.0010666051],"domain_scores_gemma":[0.9963718,0.00049325946,0.00039997295,0.0019051442,0.0005976663,0.00023212818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016411657,0.00070631603,0.0007251584,0.00091769756,0.00020623577,0.0009873129,0.0042344825,0.0007127901,0.00003692303],"category_scores_gemma":[0.00007064889,0.00070917665,0.00011590543,0.0018983397,0.0005464881,0.0011973035,0.001470251,0.0015609498,0.00005696411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061562696,0.000023959989,0.000038844013,0.000008322795,0.000004144338,0.000084131,0.00045726832,0.31623897,0.000008983639,0.012055957,0.00015715271,0.6709161],"study_design_scores_gemma":[0.00037678017,0.00012664705,0.0001351251,0.0003532422,0.0000044820217,0.000038025726,2.260076e-7,0.95924747,0.000068500594,0.02291351,0.01595303,0.00078294444],"about_ca_topic_score_codex":0.0000092757855,"about_ca_topic_score_gemma":0.001417533,"teacher_disagreement_score":0.6701332,"about_ca_system_score_codex":0.00083635654,"about_ca_system_score_gemma":0.0008032466,"threshold_uncertainty_score":0.9995359},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015824545,0.000013226072,0.9946806,0.0020181567,0.00053660927,0.0010062534,0.0000015704964,0.00007583077,0.0000853099],"genre_scores_gemma":[0.9288849,0.0000928366,0.068868645,0.00037207024,0.00041276627,0.0006763992,0.000018511153,0.000018276369,0.00065558596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897456,0.00003556998,0.0001837777,0.000342552,0.00014281817,0.00032069636],"domain_scores_gemma":[0.9993534,0.00011826682,0.00009340184,0.00032584424,0.00004880843,0.00006029755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209215,0.00012763332,0.00012125298,0.000040347448,0.00014842159,0.00019102875,0.00036089134,0.00010503595,0.0000053081517],"category_scores_gemma":[0.0000041945373,0.00009167317,0.000026105345,0.00023335301,0.00004158295,0.0003679991,0.00019572268,0.00021061383,0.0000016434118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042573906,0.000053960433,0.00011282939,0.000006529992,0.000009631409,0.0000010723213,0.00034598945,0.0005846248,0.003176661,0.048091915,0.00025834588,0.9473542],"study_design_scores_gemma":[0.00031822955,0.000045480494,0.0026959113,0.000014212958,0.0000035797082,0.000006707818,0.000013454115,0.99538094,0.00030580067,0.0003366589,0.00075702806,0.00012202275],"about_ca_topic_score_codex":0.000033994642,"about_ca_topic_score_gemma":0.00016027284,"teacher_disagreement_score":0.9947963,"about_ca_system_score_codex":0.000025937914,"about_ca_system_score_gemma":0.000025197283,"threshold_uncertainty_score":0.37383235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069176764,0.00008338273,0.98760366,0.0020061757,0.0011521388,0.0014443179,0.00005848828,0.0005614737,0.0001726891],"genre_scores_gemma":[0.9772798,0.00018564194,0.018059619,0.0015415193,0.00020612092,0.0025248658,0.00006894036,0.00006670648,0.000066801746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968992,0.00063461583,0.0006670622,0.00054855476,0.00045182146,0.00079875515],"domain_scores_gemma":[0.99192303,0.0019417661,0.00033160296,0.0049829013,0.00043395854,0.0003867259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009845672,0.0003731464,0.0004139157,0.00025451477,0.0011963045,0.00037302382,0.0050972095,0.00030328063,0.000037046953],"category_scores_gemma":[0.000012557372,0.0004006478,0.00022384233,0.0010997131,0.00020478258,0.0031109117,0.000026217465,0.00071129267,0.000021354357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058702246,0.008310227,0.0010188596,0.00015423122,0.00054831256,0.0000013573335,0.0022882482,0.604791,0.018748458,0.07062589,0.0033386978,0.2895877],"study_design_scores_gemma":[0.0015845699,0.00013614631,0.001337076,0.00006966039,0.00007314053,0.0000016579177,0.000025867566,0.98574686,0.009340207,0.00016375449,0.00107662,0.00044445094],"about_ca_topic_score_codex":0.00012058666,"about_ca_topic_score_gemma":0.0007232582,"teacher_disagreement_score":0.9703621,"about_ca_system_score_codex":0.00021133447,"about_ca_system_score_gemma":0.00018549309,"threshold_uncertainty_score":0.99984455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8028818,0.00005240531,0.1918677,0.000017294047,0.00013771883,0.00013664235,9.1298307e-7,0.00006247218,0.0048430823],"genre_scores_gemma":[0.99531054,0.00002636414,0.0042072525,0.000034366705,0.00012785227,0.0000061925402,0.0000025091545,0.000010398359,0.00027450867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987357,0.00003589525,0.0003821409,0.0002746931,0.0002595491,0.0003119815],"domain_scores_gemma":[0.9987577,0.00012867013,0.0002023655,0.0007399427,0.00011476452,0.000056546145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019757156,0.00015690415,0.00026564152,0.000074773954,0.000035208668,0.000022883616,0.00074043794,0.00017363785,0.000036730788],"category_scores_gemma":[0.0000038028807,0.00011978706,0.0001447012,0.00043733366,0.0000589397,0.00022423067,0.00014995149,0.0002682412,0.000012190441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004296172,0.00028980614,0.059816632,0.000022569626,0.000028126804,0.0000037207224,0.00004683424,0.8492586,0.00049934915,0.0148183005,0.0018542563,0.07331884],"study_design_scores_gemma":[0.00029728422,0.00044028394,0.09846372,0.000046936388,0.0000027286387,0.0000029125476,7.769632e-7,0.8984233,0.002120712,0.000054300166,0.000030482845,0.00011654909],"about_ca_topic_score_codex":0.00035333392,"about_ca_topic_score_gemma":0.000030596682,"teacher_disagreement_score":0.19242877,"about_ca_system_score_codex":0.000041857107,"about_ca_system_score_gemma":0.000050360057,"threshold_uncertainty_score":0.48847744},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026863411,0.000058121357,0.8951353,0.0000625323,0.000060842285,0.07762162,0.0000021824944,0.00013507126,0.000060923063],"genre_scores_gemma":[0.8709853,0.0000046889063,0.008206018,0.000387538,0.000088377834,0.12024992,0.000004527923,0.000013418517,0.000060167342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818593,0.00007006542,0.0003357776,0.00075448805,0.00021485276,0.00043890218],"domain_scores_gemma":[0.9988691,0.00009356575,0.000121326484,0.00059157074,0.00011576626,0.00020864436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024177266,0.0002522602,0.00024026832,0.000052223728,0.00020499142,0.00036973355,0.00040090067,0.000059683967,0.000004495354],"category_scores_gemma":[0.0000040111604,0.00021234751,0.00004129635,0.0001715951,0.00006846924,0.0005058412,0.00014007477,0.00009365612,0.0000012113037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013578852,0.00037825992,0.000114357645,0.00002869599,0.000021577296,0.000012077362,0.00020880796,0.83934045,0.00015619388,0.008785909,0.00036866157,0.15044923],"study_design_scores_gemma":[0.0011023353,0.0015773536,0.00050582,0.000051318944,0.0000062453264,0.00003155587,0.000018882893,0.99355626,0.0020274804,0.00049209525,0.0003429769,0.0002876468],"about_ca_topic_score_codex":0.00001419491,"about_ca_topic_score_gemma":0.000013500504,"teacher_disagreement_score":0.8869293,"about_ca_system_score_codex":0.000060660186,"about_ca_system_score_gemma":0.000050815474,"threshold_uncertainty_score":0.865928},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007176169,0.0009356317,0.9877278,0.0007115942,0.0006262069,0.0012448983,0.0000025756162,0.0009461436,0.00062893983],"genre_scores_gemma":[0.6563957,0.000022479597,0.34193367,0.0007869916,0.00030530296,0.0003465916,0.0000029184841,0.000043474458,0.00016289625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732393,0.0000637134,0.00045601832,0.00087200955,0.00040966718,0.00087466463],"domain_scores_gemma":[0.99766713,0.00041785286,0.00021085532,0.0012919523,0.00015469057,0.00025753662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003889169,0.00037841185,0.00050754804,0.00008846768,0.00022913635,0.00031578387,0.0014579438,0.0003020153,0.000008705551],"category_scores_gemma":[0.000017765175,0.0002937742,0.00015820905,0.00080565247,0.00009821568,0.00032903632,0.0002120478,0.0003513381,0.00005696703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035590492,0.00028767565,0.00009412951,0.00013959469,0.00013908568,0.00010138097,0.00090072607,0.043372955,0.000015509411,0.92521125,0.0010239842,0.028357798],"study_design_scores_gemma":[0.0027731718,0.0015639056,0.000114159724,0.0011919478,0.000044747005,0.00020761324,0.00028976199,0.9850823,0.00013909735,0.0049795895,0.0027686502,0.0008450252],"about_ca_topic_score_codex":0.00001638495,"about_ca_topic_score_gemma":0.00006202102,"teacher_disagreement_score":0.9417094,"about_ca_system_score_codex":0.00016763688,"about_ca_system_score_gemma":0.00018462363,"threshold_uncertainty_score":0.9999514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010472407,0.00009562181,0.98771715,0.00029964274,0.00058870437,0.00038650158,0.0000018381184,0.00019058562,0.00024754897],"genre_scores_gemma":[0.5795296,0.00012547667,0.4198003,0.0001516657,0.00011012827,0.0001510636,0.000043285905,0.000018455308,0.00007005269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984103,0.0000461779,0.00035260228,0.0005797876,0.0002426085,0.00036855091],"domain_scores_gemma":[0.99909616,0.00011355944,0.00015601021,0.00030235047,0.00023779874,0.000094096526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015730898,0.00020422123,0.00020982313,0.00017337326,0.00014057348,0.00013741077,0.00026824602,0.00012235639,0.000011057071],"category_scores_gemma":[0.000013762446,0.0001817852,0.00005196005,0.0008659453,0.00010097727,0.0008136356,0.000052681688,0.000110320165,0.0000013705118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019640688,0.00015588221,0.00067976885,0.000007646349,0.000022869444,0.000009902737,0.00015609506,0.87139696,0.0002182343,0.04928367,0.000038118844,0.077834435],"study_design_scores_gemma":[0.002553862,0.00025852016,0.0009039042,0.00006686918,0.00000859869,0.00007098981,0.00009658503,0.99488616,0.0002872658,0.0005388513,0.00008221431,0.00024616168],"about_ca_topic_score_codex":0.0000486588,"about_ca_topic_score_gemma":0.0010342572,"teacher_disagreement_score":0.56905717,"about_ca_system_score_codex":0.00017986819,"about_ca_system_score_gemma":0.000101010584,"threshold_uncertainty_score":0.7412985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48472196,0.009591561,0.5018064,0.0013035762,0.0001624624,0.0008633546,0.000008077223,0.00021144039,0.0013311581],"genre_scores_gemma":[0.99238133,0.00479081,0.0016328807,0.0009592767,0.00007044245,0.000045424604,0.00010034896,0.000008713673,0.000010768207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841225,0.00019842741,0.00044267203,0.0004006013,0.00021051719,0.0003355086],"domain_scores_gemma":[0.99735624,0.000345889,0.00033147325,0.00167355,0.0001831097,0.00010975044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007406176,0.00021926787,0.00046008325,0.00014912488,0.0003590973,0.00012951386,0.0014563656,0.00023653074,0.000004730671],"category_scores_gemma":[0.0000042658417,0.00021437679,0.00016663995,0.0012049428,0.0000887769,0.00039105304,0.0002451587,0.00037614274,5.341024e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007914781,0.00021458187,0.0020056784,0.000048868795,0.00038608667,6.923018e-7,0.0017690999,0.82830465,0.000004849549,0.09183781,0.0003050594,0.07504347],"study_design_scores_gemma":[0.00035076894,0.00019815561,0.0090353135,0.00010972844,0.0001851951,0.0000014892152,0.0000418536,0.9871464,0.000017693143,0.0018369862,0.0008613843,0.00021506549],"about_ca_topic_score_codex":0.000013155191,"about_ca_topic_score_gemma":0.00008055058,"teacher_disagreement_score":0.5076594,"about_ca_system_score_codex":0.000021856633,"about_ca_system_score_gemma":0.000015510075,"threshold_uncertainty_score":0.87420315},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011490877,0.00007695593,0.85983235,0.000030334617,0.000076946955,0.13230588,0.000001418994,0.00033012565,0.006196887],"genre_scores_gemma":[0.32740203,0.000009339567,0.15046714,0.00021229981,0.00020281841,0.521379,0.000007910915,0.000033941724,0.00028555145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973816,0.00013654584,0.0004676476,0.0009226035,0.0002977737,0.0007938237],"domain_scores_gemma":[0.9986297,0.00016570387,0.00017140133,0.00075840345,0.00012627395,0.00014850732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006174274,0.00029851796,0.00036204507,0.00009432135,0.0002302998,0.0001000022,0.0010298945,0.00023058917,0.000015629123],"category_scores_gemma":[0.000027707652,0.00026388004,0.00013199636,0.00082159985,0.000074666554,0.0006825467,0.0004160373,0.0004898903,0.000004999601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010995261,0.0062243673,0.010599528,0.00059845997,0.00029645284,0.00022647077,0.041489083,0.43150285,0.000069226204,0.10349327,0.03158281,0.37281796],"study_design_scores_gemma":[0.0014146669,0.00030311712,0.00030797586,0.000021010555,0.0000027114113,0.000045561854,0.000118205346,0.9880222,0.00013315138,0.0008598696,0.008418244,0.0003533058],"about_ca_topic_score_codex":0.000011469055,"about_ca_topic_score_gemma":0.000035021916,"teacher_disagreement_score":0.7093652,"about_ca_system_score_codex":0.00015185619,"about_ca_system_score_gemma":0.00015383177,"threshold_uncertainty_score":0.99998134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020100949,0.000024168532,0.9968433,0.00040349236,0.00017079331,0.00080164924,6.7843837e-7,0.00015721419,0.0013977096],"genre_scores_gemma":[0.33813354,0.00006487752,0.6589012,0.00056636485,0.0001734821,0.00039809672,0.000008975242,0.000019994806,0.001733453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985469,0.000037756545,0.00032816158,0.00043503038,0.0002103228,0.00044182633],"domain_scores_gemma":[0.9992868,0.00007062509,0.000084759304,0.00039278186,0.00008014478,0.00008491654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033014835,0.00015867858,0.00019985472,0.000058054204,0.00010862471,0.000037472993,0.0005493619,0.00010432715,0.000010577499],"category_scores_gemma":[0.000005953615,0.00014270926,0.000056582663,0.00038741404,0.000026619266,0.00038928527,0.00020096284,0.00012814564,0.000007088193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000813147,0.000060779075,0.000048587703,0.0000061746214,0.000005439104,0.0000029688606,0.00031853173,0.96405643,0.0000026181617,0.029528145,0.004949237,0.0010129596],"study_design_scores_gemma":[0.00042108007,0.000054750708,0.00000780702,0.000028842713,0.0000018693802,0.000005424691,0.000004480443,0.99688655,0.000042598174,0.0022860137,0.000080912694,0.00017965623],"about_ca_topic_score_codex":0.000013362085,"about_ca_topic_score_gemma":0.000023770648,"teacher_disagreement_score":0.33794206,"about_ca_system_score_codex":0.000089703855,"about_ca_system_score_gemma":0.000086809196,"threshold_uncertainty_score":0.5819515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001755842,0.00014035968,0.9840134,0.00050820544,0.00071535655,0.0010832034,0.000008166557,0.00032588487,0.011449599],"genre_scores_gemma":[0.69433916,0.00030161522,0.2977792,0.0036609697,0.00041947575,0.0017899167,0.0001070921,0.000051753545,0.0015508297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853885,0.000083354615,0.00028892767,0.00053089845,0.0001666034,0.00039138127],"domain_scores_gemma":[0.9986184,0.0004199546,0.00012511158,0.0005550413,0.00016594933,0.000115541014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027909002,0.00020148329,0.00021121195,0.000086555076,0.00031080237,0.000102715036,0.0005049102,0.00010559013,0.0001338865],"category_scores_gemma":[0.000025760655,0.00018825344,0.00007632147,0.0006229945,0.000036962323,0.00041248283,0.00010181593,0.0001466369,0.000030903728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018378613,0.00026253064,0.00017088474,0.000016434375,0.000030456551,0.0000145906815,0.00051886897,0.4109655,0.000110203495,0.007210024,0.09459987,0.48591682],"study_design_scores_gemma":[0.00076128397,0.000635548,0.0001512515,0.000017686149,0.0000029947055,0.0000037781492,0.00002603531,0.89420795,0.00057096104,0.0002096045,0.10318,0.00023292447],"about_ca_topic_score_codex":0.0000017204738,"about_ca_topic_score_gemma":0.000015750999,"teacher_disagreement_score":0.6925833,"about_ca_system_score_codex":0.00010564522,"about_ca_system_score_gemma":0.00009321113,"threshold_uncertainty_score":0.7676753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046311794,0.0021419304,0.9878496,0.000045759345,0.0001755961,0.00095851754,7.043943e-7,0.00014322509,0.0040534963],"genre_scores_gemma":[0.5889034,0.00020711875,0.40927583,0.00046716642,0.00015658897,0.00038149185,0.000012742205,0.000017497465,0.00057814067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983363,0.0000501231,0.00036042873,0.00053081807,0.00013829255,0.00058400235],"domain_scores_gemma":[0.99881667,0.00036487085,0.00006716137,0.0005188167,0.0000987761,0.000133724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041766,0.00016711613,0.00023712384,0.00015315534,0.00014003072,0.00011826625,0.0007043341,0.00012286285,0.000023246968],"category_scores_gemma":[0.00003071219,0.00014419314,0.00007387491,0.0011418491,0.00004303684,0.0003459465,0.00030333537,0.00024473172,0.000005438038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043349068,0.000276646,0.0008048468,0.000010291683,0.000029393002,0.000021746679,0.001241509,0.3713087,0.00009223068,0.046736114,0.0031327526,0.5763024],"study_design_scores_gemma":[0.00048830156,0.00014766997,0.00037599844,0.000012532435,0.0000036202846,0.000007659453,0.00014402665,0.9903787,0.00011133959,0.00022297048,0.0078889355,0.00021824504],"about_ca_topic_score_codex":0.0000059766503,"about_ca_topic_score_gemma":0.00024879372,"teacher_disagreement_score":0.61907,"about_ca_system_score_codex":0.00008760299,"about_ca_system_score_gemma":0.000048529993,"threshold_uncertainty_score":0.58800256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024656956,0.009031763,0.9394335,0.00029023323,0.00032929928,0.000696305,8.1499955e-8,0.0003453188,0.04740781],"genre_scores_gemma":[0.82183856,0.003550713,0.15659945,0.001232596,0.000109566616,0.0006399471,0.000003096812,0.000026132304,0.015999926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985519,0.00004366246,0.00026994033,0.0004736535,0.00023004116,0.00043081757],"domain_scores_gemma":[0.9989892,0.000036566405,0.00005225823,0.00079380703,0.000041679916,0.00008648514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025985466,0.00013979789,0.00013809545,0.00011043459,0.00005824396,0.00013509697,0.0007586921,0.00007669156,0.00042705485],"category_scores_gemma":[0.000003095164,0.00013671216,0.000033456978,0.0012032603,0.000024436054,0.0004756558,0.00034688457,0.00015582242,0.0004875878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034530985,0.00025373083,0.0006112183,0.000023383507,0.000015681786,0.00004165487,0.0001782918,0.114546016,0.000006256619,0.034771252,0.028437873,0.8211112],"study_design_scores_gemma":[0.00033434582,0.000047995945,0.00064265286,0.000033663207,0.0000016995357,0.000003753771,0.000019693036,0.9357033,0.000016126958,0.00035345915,0.062680654,0.00016265831],"about_ca_topic_score_codex":0.000004627688,"about_ca_topic_score_gemma":0.000045699333,"teacher_disagreement_score":0.8211573,"about_ca_system_score_codex":0.00009775374,"about_ca_system_score_gemma":0.0000055287283,"threshold_uncertainty_score":0.6267117},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01412328,0.00032555094,0.9747418,0.0045514125,0.0008463673,0.0007651398,0.000057601228,0.00018650781,0.004402322],"genre_scores_gemma":[0.95259476,0.0007144381,0.044852287,0.0003172787,0.00016727293,0.000566734,0.00030386366,0.000021121881,0.0004622267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801826,0.00019646205,0.00057712186,0.00052206125,0.00030714562,0.0003789181],"domain_scores_gemma":[0.9966528,0.00035148085,0.00029981247,0.0020481332,0.0005650144,0.00008280426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005139899,0.00022847,0.00022554054,0.00021220915,0.00029930446,0.00032841257,0.0039913873,0.00016723367,0.000012996048],"category_scores_gemma":[0.00002524274,0.00025302317,0.000083386476,0.0004161435,0.00014207835,0.00078261195,0.00025979907,0.0004193227,0.000019584239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001455814,0.0015995316,0.00069450296,0.000009648737,0.00003381764,0.0000031891643,0.00020777338,0.044181824,0.011088986,0.78564817,0.004712047,0.15167494],"study_design_scores_gemma":[0.0007263677,0.00014074343,0.0022364443,0.00009354263,0.0000041649687,0.0000035221703,0.000021629376,0.9859897,0.00032931764,0.006615214,0.0035757716,0.00026358938],"about_ca_topic_score_codex":0.00031612205,"about_ca_topic_score_gemma":0.0058326456,"teacher_disagreement_score":0.94180787,"about_ca_system_score_codex":0.00028003362,"about_ca_system_score_gemma":0.00015671624,"threshold_uncertainty_score":0.9999922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05532918,0.022358734,0.9145448,0.0007758797,0.0006014036,0.0012171248,0.000006196647,0.00031900857,0.0048476276],"genre_scores_gemma":[0.909437,0.0021664782,0.08718951,0.0000763515,0.00007619,0.0004425288,0.00005431295,0.000017061784,0.0005405844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985366,0.00019568359,0.00053080503,0.00030454886,0.00020365544,0.00022874908],"domain_scores_gemma":[0.9967155,0.00034977144,0.00032584014,0.0023200891,0.00023036987,0.000058451664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034349557,0.00017690967,0.00022911798,0.00012775688,0.00017927954,0.00015988611,0.0013140873,0.00010231916,0.000015908294],"category_scores_gemma":[0.000017450824,0.0001804881,0.000059895337,0.0005462012,0.0001525878,0.00090319966,0.00041934836,0.00023706837,0.000026673117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006158273,0.0020494729,0.0016288593,0.000063133884,0.000110692454,0.000005675384,0.0029451062,0.0656341,0.07741851,0.07021204,0.04195338,0.7379174],"study_design_scores_gemma":[0.0010505924,0.00025165713,0.002918082,0.00008983166,0.000028783219,0.000017256416,0.00015632786,0.9429173,0.007907405,0.0010292269,0.043249242,0.000384336],"about_ca_topic_score_codex":0.000050023224,"about_ca_topic_score_gemma":0.00023468159,"teacher_disagreement_score":0.87728316,"about_ca_system_score_codex":0.00009480723,"about_ca_system_score_gemma":0.000030997948,"threshold_uncertainty_score":0.7360091},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42376485,0.000019773117,0.57302254,0.00021897347,0.00019432581,0.00026438548,1.4877139e-7,0.00021721613,0.0022977774],"genre_scores_gemma":[0.9653612,0.000006595464,0.034090664,0.00017764825,0.00013287133,0.00010524774,0.0000026705718,0.0000130644175,0.00011008976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987128,0.00003584758,0.00021746407,0.0004554766,0.00023273629,0.00034570805],"domain_scores_gemma":[0.99899715,0.000111109635,0.000097393764,0.00063240016,0.00007700092,0.000084915155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033742533,0.00014587195,0.00016595268,0.000035324923,0.00006385468,0.000109272456,0.00071619125,0.000110658766,0.000011724441],"category_scores_gemma":[0.000008251773,0.00012097937,0.000024075092,0.00058887014,0.00005894034,0.00028636653,0.000097861244,0.0003975638,0.000024843888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027270076,0.00020506709,0.022846041,0.000026353957,0.000025450317,0.000027655888,0.00056853023,0.10345016,0.004438317,0.22801714,0.0013766856,0.63899136],"study_design_scores_gemma":[0.00029472084,0.000029056742,0.008004226,0.000021265456,0.0000020172945,0.000013083918,0.000011534498,0.99049956,0.00054376473,0.00013869996,0.0002581091,0.00018396425],"about_ca_topic_score_codex":0.00004933075,"about_ca_topic_score_gemma":0.0028957464,"teacher_disagreement_score":0.8870494,"about_ca_system_score_codex":0.00003468267,"about_ca_system_score_gemma":0.00007380485,"threshold_uncertainty_score":0.49333954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028461142,0.0007412544,0.8603048,0.0012112816,0.00063257007,0.00019065976,3.1517752e-7,0.00081038754,0.10764759],"genre_scores_gemma":[0.97195333,0.00007510843,0.021037074,0.0009001773,0.0000976404,0.0000132753785,2.6715065e-7,0.000009185224,0.0059139426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998766,0.000031933057,0.00017772082,0.00036359232,0.00028822405,0.00037251625],"domain_scores_gemma":[0.9990748,0.000069957336,0.000056683304,0.00064846483,0.00005483776,0.00009525494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016057736,0.000116710304,0.00013381823,0.000022247725,0.00008923313,0.00013948468,0.0008386258,0.00005723155,0.00031932894],"category_scores_gemma":[0.000012940557,0.00010370473,0.00004850462,0.00033345202,0.00002339091,0.00033185424,0.000246682,0.00013507246,0.0006779131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020430552,0.00007924651,0.00064647745,0.0000067245583,0.000015181444,0.000045548604,0.00083277613,0.0005108667,0.00063103216,0.076164424,0.029191216,0.89187443],"study_design_scores_gemma":[0.00030173454,0.00004100987,0.00045780124,0.000017522463,0.0000016772683,0.000014999517,0.000011605888,0.98284304,0.00076166255,0.00045210897,0.014887469,0.00020936609],"about_ca_topic_score_codex":0.0000075347402,"about_ca_topic_score_gemma":0.000018900604,"teacher_disagreement_score":0.98233217,"about_ca_system_score_codex":0.00006435467,"about_ca_system_score_gemma":0.000016063866,"threshold_uncertainty_score":0.8713427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030244421,0.0025847615,0.96178526,0.0006096426,0.0002957068,0.0004015757,2.5221138e-7,0.00035976229,0.003718648],"genre_scores_gemma":[0.93562186,0.00007548474,0.061103273,0.0022283106,0.0001570677,0.000102543745,0.000002150004,0.000013273952,0.00069604674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984046,0.00007293543,0.0003452568,0.00044300774,0.00020156021,0.0005326339],"domain_scores_gemma":[0.998951,0.00017116623,0.00007836365,0.00064220966,0.000044673227,0.000112557165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004299446,0.00015859256,0.000194515,0.00007607281,0.000060848557,0.00013360893,0.00081907277,0.00009869575,0.00011059115],"category_scores_gemma":[0.000015038582,0.0001455167,0.0000685903,0.0004791565,0.000029524585,0.00040772537,0.00019853258,0.00024963228,0.00010331424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007636055,0.000101823534,0.002294008,0.0000022738143,0.000004734409,0.000017893735,0.00011265716,0.21181886,0.00006854742,0.007813195,0.0012151516,0.7765432],"study_design_scores_gemma":[0.00063955423,0.00006473584,0.0011516045,0.000027212222,0.0000013759758,0.0000033651997,0.000030178086,0.9801988,0.0003372317,0.000027108956,0.017325683,0.00019314513],"about_ca_topic_score_codex":0.000012746341,"about_ca_topic_score_gemma":0.00041115523,"teacher_disagreement_score":0.90537745,"about_ca_system_score_codex":0.000104573126,"about_ca_system_score_gemma":0.000048694536,"threshold_uncertainty_score":0.5933998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022456907,0.0014505096,0.9720137,0.000082591374,0.0002838813,0.0012579134,0.000017621413,0.00033335984,0.002103478],"genre_scores_gemma":[0.7574566,0.00014228419,0.23803349,0.0010635245,0.00015687052,0.0015881307,0.00008261953,0.000036126818,0.0014403664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979254,0.000043527016,0.00037191118,0.0007880127,0.00022116673,0.0006499617],"domain_scores_gemma":[0.9983898,0.00038263868,0.00009711096,0.0008961741,0.00009931298,0.00013498729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003020319,0.00021480091,0.000280806,0.000106698666,0.00016888457,0.000079071055,0.0011621705,0.00014024928,0.0005970244],"category_scores_gemma":[0.000040625393,0.00021209201,0.0001262748,0.0007170462,0.000078674864,0.00044480932,0.00044020062,0.0002605115,0.000030382022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048522762,0.0023403696,0.07484323,0.00019861064,0.00013475346,0.00036076969,0.0028196988,0.13590203,0.00017660396,0.017950788,0.2684397,0.4963482],"study_design_scores_gemma":[0.0007933573,0.00011479661,0.0027974804,0.00004561455,0.0000016107549,0.0000037587029,0.000015553684,0.9520778,0.00018638118,0.00033022524,0.04339156,0.00024183809],"about_ca_topic_score_codex":0.000015892512,"about_ca_topic_score_gemma":0.00016479363,"teacher_disagreement_score":0.8161758,"about_ca_system_score_codex":0.00008136557,"about_ca_system_score_gemma":0.00012629897,"threshold_uncertainty_score":0.8648861},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11038934,0.000035954916,0.8866332,0.00066672906,0.00008693218,0.0002385099,7.869854e-7,0.000058265567,0.0018902478],"genre_scores_gemma":[0.84832513,0.0000010456373,0.1509846,0.0006301432,0.000018076174,0.000013728171,0.0000010204774,0.0000036265915,0.000022613573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904037,0.000039993538,0.00034045783,0.00022305574,0.00015381667,0.00020228291],"domain_scores_gemma":[0.9991377,0.0002619658,0.000105191684,0.00036628926,0.0000907156,0.000038157956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736345,0.00007096542,0.00017805092,0.00009910115,0.00002631586,0.000028670185,0.00058134034,0.000041720596,0.0000034941272],"category_scores_gemma":[0.000034058194,0.00006615951,0.000043904543,0.0012960519,0.00000810505,0.00021204287,0.00017597672,0.000064937965,0.000006390878],"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.00001524984,0.00020253776,0.0076680076,0.00010194669,0.000015337211,0.0000019140518,0.000915316,0.057644226,0.0027320678,0.9114921,0.000045369034,0.019165926],"study_design_scores_gemma":[0.004995045,0.00020329628,0.16172664,0.00015100962,0.000009190309,0.000006849186,0.00012148577,0.751352,0.032236814,0.048321903,0.000256999,0.00061877235],"about_ca_topic_score_codex":0.0012417444,"about_ca_topic_score_gemma":0.0007494586,"teacher_disagreement_score":0.8631702,"about_ca_system_score_codex":0.000056302993,"about_ca_system_score_gemma":0.000039969145,"threshold_uncertainty_score":0.26979065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005294693,0.0000042673273,0.9298453,0.00004844451,0.00007949409,0.060854618,5.542435e-7,0.0004674332,0.00817044],"genre_scores_gemma":[0.24982527,0.0000027253936,0.52521825,0.00037800588,0.0003020084,0.22362834,0.000005608682,0.000034758366,0.00060505315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976265,0.00009339962,0.0004525478,0.00071593444,0.00026221867,0.00084943016],"domain_scores_gemma":[0.99881786,0.00012519547,0.00012531315,0.0007217851,0.0000770597,0.00013279943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007466871,0.00023199018,0.00031915985,0.00007811894,0.00022410437,0.000099642224,0.0010699485,0.00017797301,0.00001020843],"category_scores_gemma":[0.0000102887325,0.00020833313,0.000109001994,0.00072567386,0.000029009618,0.00044773443,0.0004000071,0.00029280444,0.000006441025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028588902,0.0071508684,0.094885774,0.0007712274,0.00019082146,0.00020069584,0.013990831,0.15642063,0.00006452261,0.6118307,0.032523096,0.08168495],"study_design_scores_gemma":[0.0014589995,0.000078111254,0.00065228966,0.000017472988,0.000002049195,0.000031245014,0.0000363625,0.9950009,0.000067800334,0.000112084555,0.0022700133,0.00027267964],"about_ca_topic_score_codex":0.000015857355,"about_ca_topic_score_gemma":0.00004373804,"teacher_disagreement_score":0.83858025,"about_ca_system_score_codex":0.00008749944,"about_ca_system_score_gemma":0.0000944984,"threshold_uncertainty_score":0.8495579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039626695,0.000644494,0.95552135,0.0002277172,0.0004523468,0.00070354517,0.0000020858186,0.00047889698,0.0023428563],"genre_scores_gemma":[0.98715585,0.00024854302,0.0097626,0.00077793375,0.00033041756,0.0007317742,0.000009200758,0.00003835454,0.00094530836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968409,0.00017898195,0.0005832833,0.0010745589,0.0003854422,0.00093686633],"domain_scores_gemma":[0.99800175,0.00020299778,0.00015086672,0.0012968926,0.000109093504,0.00023838054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039557315,0.00038030095,0.0004384862,0.00014980251,0.00012630723,0.00020423552,0.0014575754,0.00024540184,0.00014867398],"category_scores_gemma":[0.000008318873,0.00036637438,0.00012306483,0.00089182385,0.000085077234,0.0011457895,0.0009510802,0.0004422397,0.00003846286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030245905,0.00025515113,0.00013855874,0.000014656378,0.000014559073,0.000026340651,0.00044678783,0.34212995,0.000045116598,0.0015680043,0.0005695378,0.6547611],"study_design_scores_gemma":[0.00057213986,0.0001443342,0.0005547815,0.000074129326,0.0000028632505,0.000017279048,0.000082412684,0.9858864,0.00082822156,0.00014249119,0.011257097,0.00043785886],"about_ca_topic_score_codex":0.00014404845,"about_ca_topic_score_gemma":0.0041995775,"teacher_disagreement_score":0.9475292,"about_ca_system_score_codex":0.00038086373,"about_ca_system_score_gemma":0.00010711977,"threshold_uncertainty_score":0.9998788},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044495545,0.00025368956,0.9521553,0.0006199672,0.0001595816,0.00018782687,3.229238e-7,0.00031895319,0.0018088056],"genre_scores_gemma":[0.89101785,0.000011540002,0.10746208,0.00056868384,0.00024143935,0.00003537837,0.0000026399662,0.000017302003,0.0006431111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853784,0.000026935033,0.00020344506,0.0004688817,0.000336477,0.00042640886],"domain_scores_gemma":[0.9991104,0.000037765647,0.00004147694,0.0005810276,0.00010731962,0.000121979756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014957879,0.00016899142,0.0001693817,0.000047791513,0.00012337323,0.00020986582,0.00052712497,0.00007816322,0.000040009538],"category_scores_gemma":[0.000005110697,0.00012702674,0.000039151833,0.00031239344,0.00002763496,0.00039898983,0.00015613163,0.00016607682,0.00007694271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022060738,0.00013101714,0.0000490512,0.0000063070784,0.000017357064,0.000072008006,0.00007126006,0.947851,0.00036509265,0.046076927,0.0026075137,0.0027304275],"study_design_scores_gemma":[0.00038788153,0.00008251222,0.000019528175,0.000010103636,0.000005145666,0.000029332301,0.0000067766423,0.99776727,0.00019761511,0.00077118445,0.0005136681,0.00020895893],"about_ca_topic_score_codex":0.00008316529,"about_ca_topic_score_gemma":0.00018044654,"teacher_disagreement_score":0.8465223,"about_ca_system_score_codex":0.000045882636,"about_ca_system_score_gemma":0.00009029232,"threshold_uncertainty_score":0.518},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5772151,0.04094667,0.3455366,0.002452579,0.014209115,0.0060255746,0.00002790518,0.0012825911,0.012303902],"genre_scores_gemma":[0.984733,0.008016552,0.004422015,0.0013521552,0.001196278,0.000092150796,0.000019978748,0.00005455599,0.00011332285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953743,0.00051265926,0.0012244695,0.0010660815,0.00064792664,0.0011745162],"domain_scores_gemma":[0.99602807,0.0009781143,0.00074339256,0.0017205966,0.0002561423,0.0002736811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013712224,0.00057337584,0.0014254085,0.00011446736,0.00021044363,0.00010666341,0.001701836,0.00034780646,0.00005939856],"category_scores_gemma":[0.000034383895,0.0005435519,0.00024566794,0.0017621567,0.0002208169,0.00033150162,0.0004812475,0.0015795662,0.00005128657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041361546,0.0014084495,0.013913485,0.0035492007,0.0004533828,0.00070149783,0.003150899,0.48435792,0.0009200517,0.14530852,0.069818735,0.27600423],"study_design_scores_gemma":[0.0009203122,0.00021402337,0.0037272265,0.01094327,0.00003196358,0.000045201767,0.000053849195,0.97781557,0.00023955305,0.00022123402,0.004892991,0.00089482823],"about_ca_topic_score_codex":0.000022456017,"about_ca_topic_score_gemma":0.00028884926,"teacher_disagreement_score":0.49345762,"about_ca_system_score_codex":0.00007292238,"about_ca_system_score_gemma":0.00010644403,"threshold_uncertainty_score":0.9997016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12541649,0.007925099,0.86452717,0.001050622,0.00032704935,0.00040010418,0.0000012476133,0.000039978375,0.0003122202],"genre_scores_gemma":[0.98027796,0.0013581999,0.01799609,0.0002367778,0.00007422382,0.000023094053,0.000002662001,0.0000210032,0.000010006355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978953,0.00031693632,0.0009075671,0.00023142998,0.00021972612,0.0004290605],"domain_scores_gemma":[0.9950463,0.0027385117,0.0008175584,0.0009827316,0.00027531383,0.00013954735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014164869,0.00020031533,0.00040591013,0.00017199288,0.00046420004,0.0002085893,0.0013496306,0.00015846426,0.0000067314113],"category_scores_gemma":[0.00011130392,0.0001849383,0.00012817382,0.00063224474,0.00008273725,0.00022588491,0.0004458381,0.0008509772,5.7218193e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035813853,0.00027844944,0.00049321784,0.000009790734,0.000046914814,0.000012855269,0.0014406402,0.618372,0.000011913292,0.018558478,0.0005273728,0.36021256],"study_design_scores_gemma":[0.0011103505,0.00026551133,0.0007965596,0.0005521766,0.000013408213,0.00006128227,0.00014155387,0.9963445,0.0000023525995,0.00024385791,0.0002793456,0.00018907087],"about_ca_topic_score_codex":0.0000031910367,"about_ca_topic_score_gemma":0.00002944666,"teacher_disagreement_score":0.85486144,"about_ca_system_score_codex":0.00010625054,"about_ca_system_score_gemma":0.000023545774,"threshold_uncertainty_score":0.7541565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038888492,0.00007814702,0.99495935,0.0016341617,0.00037496863,0.0005313306,4.791493e-7,0.0003321036,0.0017005431],"genre_scores_gemma":[0.15370254,0.000010797957,0.84237117,0.0018481949,0.0005784786,0.00016072937,9.693649e-7,0.000014175374,0.0013129767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987991,0.000045450888,0.0001908026,0.00038536527,0.00017179783,0.00040749315],"domain_scores_gemma":[0.9986642,0.00046692503,0.000055028366,0.00065683236,0.000046865393,0.000110161294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029606128,0.00013594414,0.00014660164,0.0000379417,0.0000913294,0.0001532356,0.00095387,0.0001200161,0.00012975305],"category_scores_gemma":[0.000016586897,0.00011806528,0.000054947144,0.00021325515,0.000023324268,0.00030929584,0.0001387366,0.00013069953,0.00023905534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011847931,0.00006355769,0.00001671856,0.0000077378445,0.000015197573,0.0000045072534,0.00025611933,0.008758209,0.00014681226,0.70830035,0.04287516,0.23954381],"study_design_scores_gemma":[0.00028127249,0.00011448739,0.00003553815,0.000023676826,0.0000045202128,0.000011960776,0.0000069326184,0.91271,0.006566551,0.034008734,0.04597893,0.00025740577],"about_ca_topic_score_codex":0.0000042504657,"about_ca_topic_score_gemma":0.000007317101,"teacher_disagreement_score":0.90395176,"about_ca_system_score_codex":0.000037334696,"about_ca_system_score_gemma":0.000041046183,"threshold_uncertainty_score":0.48145625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014380505,0.00017556192,0.9821677,0.00008130788,0.0015577547,0.00070989376,0.0000014258602,0.0005281835,0.00039763286],"genre_scores_gemma":[0.9547298,0.0001773127,0.043322317,0.00067799946,0.00085616804,0.000119127166,0.000016258064,0.000054579872,0.00004641563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558246,0.00030781046,0.0008302813,0.0014954312,0.00044333097,0.0013406646],"domain_scores_gemma":[0.9971361,0.00041170244,0.0002667203,0.001619481,0.00018942214,0.0003765412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000567833,0.0006404102,0.0007865519,0.00019843876,0.0002827039,0.0002761396,0.0023925246,0.00035202847,0.000036093857],"category_scores_gemma":[0.0000045304523,0.0005948859,0.00013891907,0.0012946414,0.00058276736,0.0008031606,0.0014601535,0.0012193924,0.000018467183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053651187,0.00024116112,0.011439531,0.00002453965,0.000063172716,0.0010585051,0.0006091741,0.70387155,0.000001298498,0.0022552076,0.0015173464,0.27886486],"study_design_scores_gemma":[0.0010968626,0.00028727227,0.008572261,0.00038554455,0.0000068350696,0.0006824613,0.000014821937,0.98811907,0.000007359676,0.00006516082,0.000072278664,0.0006900767],"about_ca_topic_score_codex":0.000048269052,"about_ca_topic_score_gemma":0.00015976105,"teacher_disagreement_score":0.94034934,"about_ca_system_score_codex":0.00019951785,"about_ca_system_score_gemma":0.0001439725,"threshold_uncertainty_score":0.99965024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8164247,0.000089898356,0.16209374,0.0013561297,0.00092958467,0.0002695785,0.0000031924499,0.00017123859,0.018661926],"genre_scores_gemma":[0.9462481,0.00032378995,0.052969415,0.00019579231,0.00006919731,0.00003112526,0.000023783474,0.000007862128,0.00013089573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873763,0.0000626776,0.00038826998,0.00033948754,0.00022745554,0.00024447648],"domain_scores_gemma":[0.99804723,0.00023569839,0.00015396491,0.0012344584,0.00024396203,0.000084659776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003860408,0.00015741517,0.00014657686,0.00020518353,0.00023684799,0.00033944828,0.0026357707,0.000088645975,0.000029538913],"category_scores_gemma":[0.000068136775,0.0001658407,0.000030881118,0.00024219824,0.00020104599,0.00078297587,0.0012664552,0.0006085768,0.000045400655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018509818,0.0003627637,0.2429554,0.000018611147,0.000029579163,0.000004230588,0.0018432725,0.0007348474,0.0025058072,0.3325015,0.0003430984,0.4186824],"study_design_scores_gemma":[0.00041192732,0.000022722037,0.1493901,0.00005065366,0.0000017917318,0.000033774417,0.000037265152,0.8382978,0.000083823696,0.0006787388,0.010833528,0.0001578965],"about_ca_topic_score_codex":0.00015009394,"about_ca_topic_score_gemma":0.0009393838,"teacher_disagreement_score":0.8375629,"about_ca_system_score_codex":0.000048547954,"about_ca_system_score_gemma":0.000065124674,"threshold_uncertainty_score":0.67627877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030708065,0.00069264404,0.96375215,0.0010619059,0.000551933,0.00031557397,0.0000021257665,0.00039087448,0.0025247491],"genre_scores_gemma":[0.97594565,0.00025356936,0.022500647,0.00083784584,0.0001309015,0.00005286155,0.000022765955,0.0000209763,0.00023477251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977892,0.00007862676,0.00041500013,0.00065893494,0.00032675546,0.0007314759],"domain_scores_gemma":[0.9985975,0.00009596618,0.000091211914,0.0009602642,0.000058729656,0.00019634659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034853432,0.0002537041,0.0002944209,0.00008742647,0.00009118604,0.00019134805,0.0013773323,0.00018800762,0.000040329345],"category_scores_gemma":[0.00001607878,0.00023593428,0.0000837255,0.0011762922,0.000068964335,0.00049289427,0.00049297,0.0003992612,0.00011976957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021278362,0.00027494258,0.0015809137,0.000012058001,0.000025427717,0.0002744331,0.00032270412,0.45607555,0.000050562507,0.4086985,0.0029333609,0.12973025],"study_design_scores_gemma":[0.0023707908,0.0001747801,0.013034073,0.00014941684,0.000007471039,0.00005180167,0.00003297479,0.9591044,0.00047415047,0.012297049,0.011495671,0.0008073976],"about_ca_topic_score_codex":0.00007588566,"about_ca_topic_score_gemma":0.00041327937,"teacher_disagreement_score":0.9452376,"about_ca_system_score_codex":0.00024039207,"about_ca_system_score_gemma":0.00012624104,"threshold_uncertainty_score":0.962112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3651131,0.0024589992,0.6302221,0.00036886166,0.00014195264,0.0006292365,0.0000043182554,0.00015363566,0.0009077788],"genre_scores_gemma":[0.8798797,0.00028799294,0.11941483,0.00016026937,0.00004543499,0.00014021464,0.000016956508,0.000016965134,0.000037631653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796164,0.0002949049,0.00065250567,0.00048230568,0.0002282097,0.0003804369],"domain_scores_gemma":[0.99600506,0.00049330964,0.00025374137,0.0028997185,0.0002175084,0.00013066886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007985717,0.00021482003,0.00036631647,0.00009011054,0.0004599159,0.00015318443,0.0019719547,0.00009885773,0.000005205427],"category_scores_gemma":[0.0000053257045,0.00022133748,0.00008669221,0.0006157049,0.00016255393,0.00017440916,0.0023430854,0.00029443754,0.0000020841487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004482795,0.00077038765,0.020038543,0.000040238345,0.00002414284,0.0000026423918,0.00048598283,0.075858966,0.002716519,0.040683363,0.00084936497,0.8585254],"study_design_scores_gemma":[0.00031152312,0.00012892748,0.021502603,0.00009061263,0.000015126903,0.000009745449,0.000048753813,0.9629673,0.000203827,0.00020139615,0.014233542,0.00028664],"about_ca_topic_score_codex":0.00011772393,"about_ca_topic_score_gemma":0.000107600805,"teacher_disagreement_score":0.8871083,"about_ca_system_score_codex":0.00007407359,"about_ca_system_score_gemma":0.00006651378,"threshold_uncertainty_score":0.90258807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034208994,0.0001102014,0.9838635,0.00022646085,0.0006799188,0.00045792066,8.33281e-7,0.0004089168,0.010831352],"genre_scores_gemma":[0.8230692,0.00010730802,0.16672635,0.0024310977,0.00064908445,0.00019929583,0.000009009215,0.000029733583,0.006778894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846876,0.000008771555,0.0002747061,0.00045685505,0.00022275894,0.0005681312],"domain_scores_gemma":[0.9987082,0.0002008311,0.000075613665,0.0007745177,0.00008033014,0.00016052122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023344521,0.00017798509,0.00021514544,0.000048418475,0.00025162185,0.000077042176,0.0010609141,0.000120467026,0.00007163581],"category_scores_gemma":[0.000017541584,0.00014216141,0.00012606994,0.00032575848,0.000060194336,0.0006191256,0.0002579919,0.0001465938,0.00007366427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022010818,0.0000927478,0.0010739926,0.000010047109,0.00004646931,0.00004308287,0.0003126293,0.013177355,0.000026572776,0.6794198,0.238777,0.06699827],"study_design_scores_gemma":[0.00054931844,0.00013364638,0.00077261793,0.00000866927,0.000003861178,0.000091513546,0.0000061751634,0.9620467,0.00024693823,0.0077947374,0.028053759,0.00029207562],"about_ca_topic_score_codex":0.000014383793,"about_ca_topic_score_gemma":0.000017304676,"teacher_disagreement_score":0.94886935,"about_ca_system_score_codex":0.000037798134,"about_ca_system_score_gemma":0.00005743174,"threshold_uncertainty_score":0.57971746},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001091273,0.000047530648,0.86718166,0.00022932644,0.00022963769,0.12890233,0.000001016162,0.0004839429,0.0028154063],"genre_scores_gemma":[0.07488444,0.000008400779,0.064309835,0.001877715,0.000692108,0.85644567,0.0000043891337,0.00006610763,0.0017113441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975803,0.000044386365,0.00042571838,0.00079048425,0.00039698495,0.00076210644],"domain_scores_gemma":[0.9982621,0.00020898067,0.00016393299,0.0010001108,0.00016853146,0.00019635286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054685853,0.00030062068,0.00028434463,0.00004896778,0.00027681858,0.00029434572,0.0011341502,0.0001775807,0.000055352357],"category_scores_gemma":[0.000027223377,0.00025100436,0.00015611305,0.0003945119,0.000045387413,0.00041788822,0.00033255038,0.00026956762,0.000076752964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013863774,0.0004605482,0.00011891952,0.000083030805,0.00004883038,0.000034746256,0.00060113065,0.6476474,0.000028033503,0.06434572,0.017960269,0.26853272],"study_design_scores_gemma":[0.0059304866,0.0018995651,0.00013358725,0.00034342517,0.000009637623,0.000026799715,0.000050257124,0.8141995,0.0011871775,0.007512642,0.16783506,0.000871873],"about_ca_topic_score_codex":0.0000062660247,"about_ca_topic_score_gemma":0.00004612699,"teacher_disagreement_score":0.8028718,"about_ca_system_score_codex":0.00023335118,"about_ca_system_score_gemma":0.000227209,"threshold_uncertainty_score":0.9999942},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044043913,0.0008134537,0.9526139,0.00007295143,0.00047083612,0.0003150133,0.0000013148531,0.00018588499,0.0014827509],"genre_scores_gemma":[0.7729988,0.000078839854,0.22401136,0.00055778486,0.00009604864,0.00011413746,0.0000019088197,0.000026115016,0.0021150038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980496,0.00009086312,0.0002909487,0.0006935856,0.0002110972,0.0006639171],"domain_scores_gemma":[0.99862814,0.00031832012,0.00008541992,0.0006150566,0.00012971807,0.00022332973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046271915,0.00024210343,0.00023910568,0.000053723325,0.0002585213,0.00040822732,0.00046841172,0.00015468715,0.000034586636],"category_scores_gemma":[0.000021110684,0.0002122111,0.00008772165,0.00029194547,0.00009845032,0.00019185981,0.00016320615,0.00012394361,0.000006408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002830771,0.000107373446,0.00019138928,0.00000924106,0.000028857858,0.000016186472,0.0001258159,0.76097655,0.0002534742,0.19933511,0.0028228322,0.03610483],"study_design_scores_gemma":[0.000639506,0.0001441201,0.00013319755,0.000010033859,0.0000070564515,0.000038014543,0.000014290472,0.9817328,0.0018779787,0.00018240175,0.01491805,0.00030257992],"about_ca_topic_score_codex":0.0000050363283,"about_ca_topic_score_gemma":0.000009594512,"teacher_disagreement_score":0.72895485,"about_ca_system_score_codex":0.000040817944,"about_ca_system_score_gemma":0.000058375834,"threshold_uncertainty_score":0.86537176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016881032,0.00026234004,0.9939816,0.00020106524,0.0010606322,0.0006604362,0.0000043966343,0.00017376512,0.001967679],"genre_scores_gemma":[0.78924793,0.000041470616,0.2098833,0.00048588272,0.00025382906,0.0000069043244,0.0000023675832,0.00003736853,0.000040956053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536204,0.00006601225,0.0006356089,0.0018782371,0.0011809669,0.00087715575],"domain_scores_gemma":[0.99565053,0.0008647159,0.0006314554,0.0020856499,0.00052220706,0.0002454486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095862953,0.00070144865,0.0010303006,0.00044485048,0.0002245019,0.0002695128,0.0028635925,0.0004723889,0.000017111804],"category_scores_gemma":[0.000038006365,0.00059268007,0.00014897167,0.0008837792,0.0020354416,0.00046997648,0.0013219167,0.0012419209,0.0000075795465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032135948,0.000059617785,0.00042916756,0.000059403952,0.00003431614,0.00037843568,0.00030540072,0.67958283,0.00007365886,0.10233964,0.0000057059974,0.21669967],"study_design_scores_gemma":[0.0007387721,0.0004929628,0.00038416393,0.0013247861,0.000022433158,0.00032106834,2.2828642e-7,0.9326859,0.0020885882,0.06084444,0.000062468454,0.0010341859],"about_ca_topic_score_codex":0.00008330223,"about_ca_topic_score_gemma":0.00040913452,"teacher_disagreement_score":0.7875598,"about_ca_system_score_codex":0.00046384393,"about_ca_system_score_gemma":0.001200459,"threshold_uncertainty_score":0.99965245},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3403997,0.09880385,0.52776027,0.002302192,0.00075616513,0.02609707,0.0000066805082,0.00043549467,0.0034385477],"genre_scores_gemma":[0.9758994,0.010549271,0.01202403,0.00027716896,0.00013885832,0.0010810838,0.0000048117377,0.000013691623,0.000011667761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970517,0.0011426709,0.00070066395,0.00038632873,0.00020687183,0.00051177206],"domain_scores_gemma":[0.99683464,0.0012638755,0.00046477962,0.0010902341,0.00012553381,0.00022094745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019759962,0.0002786723,0.000471089,0.00015501738,0.000793783,0.0007284806,0.0013762849,0.0001033638,0.0000017741606],"category_scores_gemma":[0.000014846352,0.000259687,0.000054441396,0.00070645893,0.00014769724,0.00052511424,0.0004985183,0.0011902585,0.0000017291158],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005480626,0.00024546924,0.023631329,0.0000034246484,0.000023630542,0.000017794244,0.0010706161,0.0055448315,0.000013271134,0.0022601413,0.00010214407,0.96703255],"study_design_scores_gemma":[0.0010659331,0.0005065663,0.06625754,0.0007528598,0.000005293329,0.00014337694,0.00011888599,0.904665,0.000003538235,0.00021087177,0.025896857,0.00037330508],"about_ca_topic_score_codex":0.000004872191,"about_ca_topic_score_gemma":0.00019340056,"teacher_disagreement_score":0.96665925,"about_ca_system_score_codex":0.00008822224,"about_ca_system_score_gemma":0.000052650408,"threshold_uncertainty_score":0.9999855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008954998,0.000025901116,0.99347025,0.00030988533,0.00055013597,0.0022575506,0.000006855686,0.00021054146,0.0030793354],"genre_scores_gemma":[0.08138683,0.000002795562,0.91552407,0.0002208094,0.00011013592,0.0011121347,0.0000039382667,0.0000324822,0.0016068035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712765,0.00021072,0.0004141954,0.0009863653,0.0003452173,0.0009158368],"domain_scores_gemma":[0.99808264,0.0005179395,0.000095952775,0.0008755417,0.0001911967,0.00023671244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021022966,0.00028734474,0.0003674243,0.00019771584,0.00015191534,0.00020478714,0.0012507368,0.00023487704,0.00005152809],"category_scores_gemma":[0.000090687245,0.00025322926,0.00009926555,0.0007634582,0.0000394359,0.0005416828,0.00050571014,0.0006679916,0.000032085238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008857448,0.0039390526,0.0017233021,0.00015532692,0.00021618424,0.000030282645,0.0078065353,0.05741525,0.026960472,0.80044746,0.0022470702,0.09897052],"study_design_scores_gemma":[0.00227375,0.00018604806,0.00092341716,0.000022990067,0.0000065416302,0.000013686307,0.00008085671,0.98719907,0.0040705046,0.004243623,0.0006507891,0.000328715],"about_ca_topic_score_codex":0.00055137323,"about_ca_topic_score_gemma":0.00070732966,"teacher_disagreement_score":0.9297838,"about_ca_system_score_codex":0.00015322266,"about_ca_system_score_gemma":0.0002749727,"threshold_uncertainty_score":0.999992},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6270368,0.00115328,0.3676323,0.0014003075,0.00056358625,0.0006612515,0.0000016281512,0.0009545776,0.0005962806],"genre_scores_gemma":[0.9944358,0.00030102456,0.0043666437,0.00021460098,0.000080622,0.00045233115,0.0000058867254,0.00002456716,0.00011856318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968724,0.00015270968,0.000583248,0.0012146898,0.00033632453,0.00084061717],"domain_scores_gemma":[0.99716073,0.000203771,0.00019633578,0.0021598276,0.00019881377,0.00008052499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051174767,0.0003793876,0.00049486425,0.00041092752,0.00012627778,0.000110840985,0.002254179,0.000882162,0.000020685491],"category_scores_gemma":[0.000041682673,0.00037420457,0.000101038764,0.0017231334,0.00040373986,0.00025690824,0.00034730477,0.0012611888,0.00010942443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041801904,0.0006218575,0.006431191,0.000031988602,0.000024041421,0.00058890885,0.00007609099,0.15636402,0.0031288154,0.30663022,0.001489048,0.524572],"study_design_scores_gemma":[0.0011397655,0.00060120015,0.002788505,0.00022130902,0.00001035506,0.00005081713,0.00001773645,0.8873916,0.008214594,0.08989447,0.008815097,0.000854525],"about_ca_topic_score_codex":0.000031771302,"about_ca_topic_score_gemma":0.00022247556,"teacher_disagreement_score":0.7310276,"about_ca_system_score_codex":0.0001685708,"about_ca_system_score_gemma":0.00013637342,"threshold_uncertainty_score":0.999871},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17323051,0.0013320154,0.7995501,0.000095156574,0.00035028835,0.00025393273,5.2731146e-8,0.00017321043,0.025014734],"genre_scores_gemma":[0.95877045,0.00006829843,0.040579345,0.00033565768,0.00003225483,0.000014835002,2.2848431e-7,0.000011136966,0.0001877804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985396,0.000107643165,0.0002650755,0.00048081382,0.000155621,0.00045119115],"domain_scores_gemma":[0.99895346,0.00041874425,0.00005134104,0.00042736373,0.00002064492,0.00012845291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052415667,0.0001613493,0.00021344336,0.00008183431,0.00009186048,0.0001674851,0.0003368891,0.00007023804,0.000024140705],"category_scores_gemma":[0.000084107036,0.00014700799,0.00002671694,0.00037041414,0.000034878743,0.0002671949,0.00018996204,0.00025439926,0.00002134027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002300471,0.000220678,0.03812619,0.000027709053,0.000026696613,0.00014719229,0.0010110157,0.32830647,0.000057090932,0.47652152,0.0017207442,0.1538117],"study_design_scores_gemma":[0.00058982364,0.00005185812,0.005088591,0.000057760804,0.0000017787628,0.000018865705,0.000019366445,0.99057513,0.000045087403,0.0023225686,0.001028539,0.00020061903],"about_ca_topic_score_codex":0.000006527015,"about_ca_topic_score_gemma":0.00008716373,"teacher_disagreement_score":0.7855399,"about_ca_system_score_codex":0.000034624405,"about_ca_system_score_gemma":0.000017324097,"threshold_uncertainty_score":0.59948117},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4823763,0.0064737624,0.5087782,0.000029500334,0.0010160328,0.0010434062,0.0000075843695,0.00023046925,0.00004474136],"genre_scores_gemma":[0.9865102,0.0022230914,0.009462902,0.00043648676,0.00079090946,0.00032761012,0.000057946352,0.00007688993,0.00011392365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952959,0.00030426876,0.00095851696,0.0014495412,0.00032323107,0.0016685709],"domain_scores_gemma":[0.9978135,0.0006194884,0.00034981014,0.00087781827,0.00009371294,0.00024564794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086367514,0.0006037891,0.0008535208,0.00015328273,0.0007090034,0.0005957881,0.0010839023,0.00037731678,0.000016754155],"category_scores_gemma":[0.000009780178,0.0006449259,0.0002157162,0.0010309723,0.00014507667,0.0005613393,0.0006739202,0.0006234269,0.0000043183254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068737776,0.00011928507,0.00041433237,0.00003221191,0.000045359448,0.00005620055,0.0005215002,0.42160666,0.0000309616,0.001591784,0.00014466674,0.5753683],"study_design_scores_gemma":[0.0013878776,0.0004071837,0.0002386821,0.00038813078,0.000031790267,0.00008822495,0.0001345985,0.98651344,0.000031166437,0.0020467436,0.008039199,0.00069296284],"about_ca_topic_score_codex":0.00003189658,"about_ca_topic_score_gemma":0.00008536448,"teacher_disagreement_score":0.5746753,"about_ca_system_score_codex":0.0002304399,"about_ca_system_score_gemma":0.00008576461,"threshold_uncertainty_score":0.9996002},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010475195,0.000014747786,0.9880259,0.0001491577,0.00028561067,0.00074765977,1.633023e-7,0.0002604219,0.000041167445],"genre_scores_gemma":[0.5719322,0.0000040580603,0.4273665,0.00031196105,0.00004535359,0.00018809878,0.0000013680669,0.000009792377,0.00014069016],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988375,0.000077611505,0.0002132991,0.00040307594,0.00016123982,0.00030731806],"domain_scores_gemma":[0.9994017,0.000114579496,0.00006231933,0.00030036527,0.0000648665,0.000056180284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003180617,0.00013185274,0.00012641145,0.00017362338,0.00014651069,0.000035178862,0.0002770253,0.00013073193,0.000019437966],"category_scores_gemma":[0.000032390104,0.00012671798,0.000046789894,0.00046713438,0.000016141199,0.00028419646,0.000047007285,0.0001385185,0.000027022505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052513304,0.001327706,0.0004894032,0.000107792854,0.000046249155,0.00009695993,0.0013556834,0.06827353,0.48535857,0.029381208,0.003408908,0.40962887],"study_design_scores_gemma":[0.0008611653,0.0001832978,0.0002675271,0.000008152444,0.0000012502318,0.000017297769,0.000004370082,0.8264897,0.17096554,0.00084614835,0.00022405991,0.00013152188],"about_ca_topic_score_codex":0.000074714735,"about_ca_topic_score_gemma":0.00021495785,"teacher_disagreement_score":0.75821614,"about_ca_system_score_codex":0.00012446132,"about_ca_system_score_gemma":0.000060958875,"threshold_uncertainty_score":0.51674086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05167423,0.000012248706,0.94663864,0.00023107129,0.00025722347,0.00047002322,0.0000012712339,0.00022890914,0.00048639698],"genre_scores_gemma":[0.8049339,4.8533644e-7,0.19410674,0.00065132615,0.0000699722,0.00003288241,0.0000066882844,0.000010032571,0.00018794817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987233,0.000038432125,0.00026079622,0.00041563512,0.00015099849,0.00041083293],"domain_scores_gemma":[0.99874717,0.00034108682,0.00006446377,0.000577506,0.00014162842,0.00012812135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075670524,0.00013187388,0.00012709528,0.000052758183,0.0001017966,0.00009856853,0.000562911,0.000078045516,0.0000207322],"category_scores_gemma":[0.0000223571,0.00012320412,0.00007683333,0.00019721485,0.000040192623,0.00017460331,0.00008190008,0.000072591334,0.00002757345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026110167,0.00060163025,0.0009611201,0.00008256077,0.000059097572,0.000060134887,0.00032710048,0.088282876,0.007986407,0.09919114,0.0012279825,0.8009589],"study_design_scores_gemma":[0.00046106873,0.00010218722,0.0003877755,0.000005659961,0.0000036151223,0.0000047637573,0.0000045792563,0.9546702,0.042308357,0.00012211401,0.0017865186,0.0001431538],"about_ca_topic_score_codex":0.000012255811,"about_ca_topic_score_gemma":0.00007060754,"teacher_disagreement_score":0.8663873,"about_ca_system_score_codex":0.000027400496,"about_ca_system_score_gemma":0.00005521459,"threshold_uncertainty_score":0.50241184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027001651,0.00011972271,0.9712218,0.00005444859,0.00010341697,0.00037136395,5.4176917e-7,0.00009220805,0.0010348589],"genre_scores_gemma":[0.6056951,0.0000034708896,0.39406002,0.0000976916,0.000063126616,0.0000137482375,0.0000029652563,0.000008541929,0.000055289966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998627,0.000033851902,0.0002625706,0.00054519356,0.0001165594,0.00041478776],"domain_scores_gemma":[0.9986753,0.00049918855,0.0000555048,0.00068674237,0.000012741044,0.00007053525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488667,0.00011450395,0.00012616569,0.00007230649,0.000110570654,0.00030692448,0.0009219374,0.000058530575,0.0000022200468],"category_scores_gemma":[0.00004393949,0.00010857774,0.000012238024,0.00014072172,0.000024385126,0.001037079,0.00080093276,0.00011840335,0.000001684107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051554056,0.00007169901,0.013032702,0.00010853118,0.000020498906,0.000060961927,0.0023783604,0.116732985,0.0006068992,0.016694225,0.00038207183,0.84985954],"study_design_scores_gemma":[0.00032595603,0.000020977903,0.0022392145,0.00002240542,0.0000013510795,0.000020817226,0.00005859284,0.99592805,0.000465709,0.0005464853,0.00022820421,0.00014222434],"about_ca_topic_score_codex":0.000061336184,"about_ca_topic_score_gemma":0.00026634318,"teacher_disagreement_score":0.8791951,"about_ca_system_score_codex":0.000026440965,"about_ca_system_score_gemma":0.000014411343,"threshold_uncertainty_score":0.44276717},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1101176,0.00007545701,0.8848787,0.0006069237,0.0011011184,0.0011936084,9.5345104e-7,0.000534847,0.0014908231],"genre_scores_gemma":[0.9904524,0.00003534364,0.006246831,0.0015188067,0.0008430173,0.00061647495,0.000026115744,0.000101852835,0.00015913956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945554,0.00038745944,0.00096652686,0.0014474422,0.00052970636,0.0021134247],"domain_scores_gemma":[0.99655193,0.0006505978,0.000426088,0.0016815453,0.00022207721,0.0004677371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075619144,0.0006996248,0.0009061807,0.00023587058,0.00028420193,0.00047022544,0.002049482,0.0005662945,0.00020610352],"category_scores_gemma":[0.000019248226,0.00063586177,0.0001575968,0.0015133701,0.0003360292,0.00081938715,0.00061170186,0.0013818801,0.000088416935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010571967,0.0004531564,0.057058506,0.000040841653,0.0000958074,0.00056638796,0.00046824687,0.73202413,0.000041039846,0.050416466,0.0034172072,0.15531246],"study_design_scores_gemma":[0.0019218995,0.00025347454,0.011217213,0.00020573704,0.000013689726,0.000065013126,0.00005465733,0.9851699,0.000048609185,0.000072801304,0.00020245761,0.0007745699],"about_ca_topic_score_codex":0.00070930657,"about_ca_topic_score_gemma":0.0012899984,"teacher_disagreement_score":0.8803348,"about_ca_system_score_codex":0.0002233062,"about_ca_system_score_gemma":0.00020226325,"threshold_uncertainty_score":0.9996093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45947546,0.00009807107,0.44211778,0.00015506237,0.00023335409,0.0012238976,0.000005596162,0.00013676223,0.09655402],"genre_scores_gemma":[0.9488216,0.00000535728,0.050523825,0.00008554471,0.0000048467064,0.000049756596,0.000001801119,0.000002791841,0.0005044436],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922484,0.00007586184,0.00021657202,0.00018745965,0.00016371389,0.00013155598],"domain_scores_gemma":[0.9992591,0.000040061557,0.000092245624,0.00055129855,0.00003521891,0.000022056909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002531846,0.00005843063,0.00012315754,0.00012873634,0.000016903092,0.000015792695,0.0006876887,0.00003154301,0.0002596586],"category_scores_gemma":[0.00000330157,0.000038791743,0.00005873842,0.0015216982,0.000023241579,0.00017601566,0.00019013073,0.000059879265,0.000007461093],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027163307,0.00059006707,0.38770956,0.00004612477,0.0006264496,0.000013768191,0.016378518,0.023164045,0.00044384296,0.19024526,0.0060362634,0.37471893],"study_design_scores_gemma":[0.00018955674,0.00006548682,0.4436808,0.000011453317,0.00007448857,9.1121865e-7,0.000089968984,0.5494894,0.0010754504,0.004810751,0.00037478155,0.00013698151],"about_ca_topic_score_codex":0.0005796528,"about_ca_topic_score_gemma":0.0011052055,"teacher_disagreement_score":0.52632535,"about_ca_system_score_codex":0.000020813914,"about_ca_system_score_gemma":0.000021988342,"threshold_uncertainty_score":0.28430796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99172103,0.0000024814444,0.0029129267,0.000019904292,0.0000075878693,0.0031618255,9.769365e-7,0.000010902643,0.0021623494],"genre_scores_gemma":[0.999045,7.362488e-7,0.00075657753,0.000019249403,0.000004265428,0.00015255033,2.694453e-7,0.0000015946771,0.000019757235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99884623,0.000080129015,0.00044911966,0.00020166888,0.00025736523,0.00016550701],"domain_scores_gemma":[0.9986017,0.00008286578,0.00028699148,0.0009360797,0.00006841524,0.000024002522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006320206,0.00008858268,0.0003173046,0.000127778,0.000015714182,0.00000797279,0.00080879667,0.000040797044,0.00001840157],"category_scores_gemma":[0.000026053092,0.000052478812,0.00019974324,0.0017840951,0.00003822398,0.00013047358,0.00010637082,0.000102351325,4.6636646e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035028905,0.0003891024,0.43435737,0.000018409966,0.00006389725,2.8972028e-7,0.00035837857,0.54187334,0.0008163264,0.001488873,0.000013118286,0.020585878],"study_design_scores_gemma":[0.00008875055,0.00024124916,0.5182457,0.000034561068,0.000006174912,1.3521574e-7,0.0000023746459,0.47380143,0.0075069056,0.000044212647,3.832005e-7,0.000028124281],"about_ca_topic_score_codex":0.00023474732,"about_ca_topic_score_gemma":0.000040206265,"teacher_disagreement_score":0.08388832,"about_ca_system_score_codex":0.000051867122,"about_ca_system_score_gemma":0.000055819823,"threshold_uncertainty_score":0.21400237},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01837395,0.0001782297,0.9783648,0.00035741186,0.00060415216,0.00034906503,0.0000010084669,0.00017234808,0.0015989857],"genre_scores_gemma":[0.92003965,0.000008041083,0.07825659,0.0004392198,0.0009615386,0.00008267678,0.0000054257566,0.000017433706,0.0001894004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988471,0.00005211415,0.00019272685,0.00037750092,0.00014053816,0.0003900134],"domain_scores_gemma":[0.99905634,0.0002777162,0.00008192009,0.0004378937,0.000045203407,0.000100951365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055336254,0.00012677412,0.00017526644,0.000030029896,0.00007536209,0.00017176123,0.00033818142,0.00007361289,0.0000045080114],"category_scores_gemma":[0.000056571866,0.00012052765,0.000059770155,0.00018243518,0.000018854565,0.00038761346,0.00022824535,0.00008013021,0.000012517866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004319386,0.000046112636,0.003762505,0.00010937999,0.000050384246,0.000003979028,0.0008574488,0.058360983,0.0012661779,0.3792789,0.0282074,0.5280135],"study_design_scores_gemma":[0.00032872162,0.00009634997,0.0011357572,0.000029199511,0.000007054594,0.0000052516075,0.0000018165158,0.9266717,0.000053762295,0.020600185,0.050920304,0.00014992233],"about_ca_topic_score_codex":0.000003960043,"about_ca_topic_score_gemma":0.0000070247625,"teacher_disagreement_score":0.90166575,"about_ca_system_score_codex":0.0000202353,"about_ca_system_score_gemma":0.000015809692,"threshold_uncertainty_score":0.4914975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030122332,0.02879783,0.8943117,0.038286526,0.00038583574,0.0017138642,0.000022682683,0.00025749058,0.0061017033],"genre_scores_gemma":[0.9086948,0.020830404,0.07001363,0.00034836968,0.000021419497,0.000041469946,0.000030527568,0.0000139094145,0.000005489893],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9906587,0.0010666039,0.0062490664,0.00013449257,0.0014300243,0.0004611328],"domain_scores_gemma":[0.9758829,0.0015761949,0.011707128,0.0018975168,0.008609722,0.0003265749],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.01532488,0.00047935423,0.0009370413,0.0037207163,0.0015924479,0.0016911654,0.004049157,0.00048760453,0.000004413654],"category_scores_gemma":[0.0030148865,0.00037659737,0.00016642829,0.0024801744,0.0014741138,0.017192502,0.00093606923,0.0019224861,0.0000037981379],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003916899,0.00013558997,0.00045805544,0.00011819682,0.00025572075,8.9783293e-7,0.009616003,0.003405035,0.000051706,0.3340249,0.0011093108,0.6504329],"study_design_scores_gemma":[0.011165925,0.003930087,0.0045035686,0.001598137,0.0005190523,0.008565584,0.3331734,0.24367294,0.00066145,0.016862884,0.3738231,0.0015238741],"about_ca_topic_score_codex":0.000025247933,"about_ca_topic_score_gemma":0.000015977976,"teacher_disagreement_score":0.87857246,"about_ca_system_score_codex":0.0004284748,"about_ca_system_score_gemma":0.00088794885,"threshold_uncertainty_score":0.9998686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10970478,0.0000696328,0.88661844,0.00023420062,0.0004860282,0.00078467524,7.790877e-7,0.0005481687,0.0015533009],"genre_scores_gemma":[0.5985016,0.000011950854,0.39989585,0.0006880602,0.00040174654,0.00009606869,0.000008447719,0.00003894783,0.00035729216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969682,0.00006514068,0.00066951104,0.0008441344,0.0003044034,0.0011486029],"domain_scores_gemma":[0.9977201,0.0007939178,0.00015817386,0.00094593654,0.00012395105,0.00025788776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020639359,0.00032233194,0.0004043441,0.00024848862,0.00012859944,0.00018484856,0.001214199,0.00028436258,0.000055939865],"category_scores_gemma":[0.000051725085,0.00031715448,0.00017976406,0.0011319501,0.000061673425,0.00042986465,0.00011484778,0.00030082455,0.000054779597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119385564,0.00037856153,0.0010011421,0.00004288609,0.000035081743,0.00008917828,0.00023422304,0.9010335,0.0017772778,0.02558357,0.006092701,0.06361247],"study_design_scores_gemma":[0.0012855175,0.000113917275,0.0003064672,0.00008215245,0.0000058765263,0.0000054864563,0.00001585857,0.9959392,0.0010378007,0.00015145932,0.000665802,0.00039047812],"about_ca_topic_score_codex":0.00005500736,"about_ca_topic_score_gemma":0.00056311453,"teacher_disagreement_score":0.48879686,"about_ca_system_score_codex":0.00015326774,"about_ca_system_score_gemma":0.0001616334,"threshold_uncertainty_score":0.99992806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085527666,0.00093116483,0.8986752,0.0021670244,0.00056250463,0.0004875005,0.0000018978518,0.0005350133,0.011112039],"genre_scores_gemma":[0.95459265,0.00007038144,0.043079447,0.0011717506,0.00027095046,0.000025354906,0.0000010817589,0.000020378862,0.0007680334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983607,0.00006019117,0.00017945169,0.0005748405,0.0003024816,0.00052234053],"domain_scores_gemma":[0.99888116,0.00014376035,0.00007356551,0.0007406098,0.000040144663,0.000120739765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010558372,0.00024121672,0.0002545827,0.000037682777,0.0001565696,0.00019945683,0.00063789054,0.00008925405,0.00028745463],"category_scores_gemma":[0.0000037866553,0.00017344007,0.0000392179,0.0004671458,0.00017637771,0.00030886036,0.00026517623,0.00024785596,0.000048907485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012455382,0.00047620214,0.004285637,0.000088814275,0.00033686956,0.0005929944,0.008333438,0.102955684,0.0001214947,0.40281355,0.18929338,0.29057738],"study_design_scores_gemma":[0.004230757,0.0018575321,0.0061785253,0.00047595086,0.000048951057,0.000645952,0.0001827886,0.9390318,0.0006592793,0.010203112,0.034495723,0.001989651],"about_ca_topic_score_codex":0.000083081766,"about_ca_topic_score_gemma":0.00018090749,"teacher_disagreement_score":0.8690649,"about_ca_system_score_codex":0.000019958521,"about_ca_system_score_gemma":0.00001533615,"threshold_uncertainty_score":0.70726806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001662827,0.0039386735,0.9915162,0.00005848373,0.00046197153,0.0016925641,6.414337e-7,0.00018161502,0.001983597],"genre_scores_gemma":[0.63233316,0.0025955609,0.35817617,0.00019648513,0.00018515198,0.0021159034,0.0000022692911,0.00003389789,0.0043614255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986375,0.00009366498,0.00031464954,0.00032843783,0.00024474348,0.0003809942],"domain_scores_gemma":[0.9984308,0.00038356739,0.00013129068,0.000893222,0.00009334981,0.00006776851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000557702,0.00014294981,0.00018497524,0.000031565316,0.00029376798,0.000058259353,0.0012213715,0.00006608359,0.0000040079303],"category_scores_gemma":[0.0000036814781,0.00009356129,0.000096500466,0.00031669013,0.0000607713,0.00013419015,0.00027945408,0.000082197635,0.000010463769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008016123,0.00009610807,0.000029779561,0.00013663767,0.00017561913,0.000046220008,0.000726841,0.4586889,0.000012958062,0.23342265,0.07998098,0.22660312],"study_design_scores_gemma":[0.00040930242,0.00022631489,0.000041672432,0.000044050914,0.000011476924,0.000028951446,0.00012856493,0.9385857,0.00010340475,0.0002791434,0.060001288,0.0001401298],"about_ca_topic_score_codex":0.0000013899222,"about_ca_topic_score_gemma":0.000003930124,"teacher_disagreement_score":0.63334,"about_ca_system_score_codex":0.000050738563,"about_ca_system_score_gemma":0.000027284052,"threshold_uncertainty_score":0.38153186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012594187,0.00007983694,0.7669601,0.0019864882,0.00008784027,0.0001108921,1.17176285e-7,0.00023746242,0.2179431],"genre_scores_gemma":[0.91337836,0.0000028002962,0.08585628,0.00015176003,0.00001952236,0.000010570509,0.0000010045391,0.0000022979646,0.0005774096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995439,0.000030890787,0.00013976388,0.000115979776,0.000039340495,0.00013010211],"domain_scores_gemma":[0.9990062,0.00007428433,0.000025940923,0.0008716706,0.00000834313,0.000013577977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015584016,0.000038120626,0.000049759594,0.000033655597,0.000042522424,0.0000577847,0.0010201831,0.000020703477,0.000011476607],"category_scores_gemma":[0.0000031885618,0.000038026563,0.00001467027,0.00019843908,0.000017531629,0.00017752821,0.00038625955,0.000076963035,0.00007785801],"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":[7.7430485e-8,0.000022168362,0.0052658627,2.2538387e-7,4.5602647e-7,7.5517005e-7,0.00003628115,0.0019627428,0.000043450375,0.98087615,0.00088713557,0.010904676],"study_design_scores_gemma":[0.00008934734,0.0000033365588,0.029067729,0.000004186388,2.7569195e-7,0.0000018360395,0.0000044002245,0.9593926,0.00006675207,0.0071065174,0.0042026015,0.000060382183],"about_ca_topic_score_codex":0.000608469,"about_ca_topic_score_gemma":0.0009936658,"teacher_disagreement_score":0.97376966,"about_ca_system_score_codex":0.00004580086,"about_ca_system_score_gemma":0.000023663164,"threshold_uncertainty_score":0.18957709},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048761456,0.00009230271,0.993897,0.00009019897,0.000096964584,0.00018095472,4.4713482e-7,0.00009411296,0.0006718576],"genre_scores_gemma":[0.86230844,0.00012188343,0.13731505,0.0000868329,0.00003759431,0.000011408247,0.0000011388958,0.000004783266,0.000112894006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923396,0.000042660195,0.00018749839,0.0001899655,0.00012488688,0.00022099871],"domain_scores_gemma":[0.999299,0.00014223365,0.00006566141,0.00035303642,0.00006942748,0.00007062794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011175318,0.00008935377,0.00012805361,0.000049245795,0.00020909238,0.000021840378,0.0003101126,0.000069630405,0.00002280892],"category_scores_gemma":[0.000007134255,0.000078170815,0.000025286281,0.00034310392,0.0000896169,0.00036601294,0.00019536923,0.00009491823,0.0000018685407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044505387,0.000035091594,0.0022807883,0.0000056847807,0.00002908955,0.0000061719315,0.00063328096,0.3664571,0.00020222938,0.59114337,0.012812504,0.026390254],"study_design_scores_gemma":[0.0001474642,0.00003313775,0.0085748555,0.000006161267,0.0000035062808,0.000046841014,0.000004705265,0.98659694,0.000059318656,0.0043329825,0.00010695181,0.00008713459],"about_ca_topic_score_codex":0.000011831833,"about_ca_topic_score_gemma":0.0000061107094,"teacher_disagreement_score":0.85743225,"about_ca_system_score_codex":0.000014278369,"about_ca_system_score_gemma":0.00005357392,"threshold_uncertainty_score":0.31877133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3494416,0.00003491209,0.6426172,0.001365803,0.00030941734,0.0003102584,0.0000012688895,0.00025551187,0.005663992],"genre_scores_gemma":[0.94273376,0.00001007184,0.056710366,0.00025279156,0.00008833744,0.000016402239,4.1463005e-7,0.0000047923213,0.00018303184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893373,0.000049052775,0.00018430836,0.00027356847,0.00031681205,0.00024253722],"domain_scores_gemma":[0.9990631,0.00015997713,0.0000682526,0.0005307001,0.00010383619,0.000074186966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021011359,0.00012168334,0.00014027224,0.00003944084,0.00010952152,0.000050262766,0.0005704593,0.000022793613,0.00002046491],"category_scores_gemma":[0.000022542654,0.00007023728,0.00004408584,0.00033123879,0.000085171894,0.00047907323,0.000077484336,0.00015178727,0.000015791278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022798155,0.0018925647,0.008502666,0.00004175927,0.0002798483,0.00009792548,0.010130196,0.05410741,0.033269264,0.16588876,0.0032917534,0.7222699],"study_design_scores_gemma":[0.0009672953,0.0006274078,0.20189054,0.00010157295,0.000016909542,0.0001505766,0.000097591736,0.7648119,0.027762098,0.0006272241,0.002467051,0.00047985988],"about_ca_topic_score_codex":0.00010083733,"about_ca_topic_score_gemma":0.000042974334,"teacher_disagreement_score":0.72179,"about_ca_system_score_codex":0.00002042147,"about_ca_system_score_gemma":0.000024296383,"threshold_uncertainty_score":0.2864193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020645706,0.00007497731,0.9966847,0.00005891239,0.0001483741,0.00047059514,0.0000013603367,0.0002125607,0.0002839608],"genre_scores_gemma":[0.56417495,0.000027037275,0.43506685,0.00014511065,0.000052625408,0.00007396869,0.000004918533,0.000013883349,0.0004406474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881893,0.000033907665,0.00021869339,0.0004893786,0.000111647285,0.0003274639],"domain_scores_gemma":[0.9992716,0.000108114014,0.00008702679,0.00030481152,0.00012361622,0.000104876526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014240654,0.0001742617,0.00020371574,0.000066348635,0.00023931169,0.000097494085,0.00037193016,0.00011088096,0.0000033699637],"category_scores_gemma":[0.000014204715,0.0001635236,0.000046331057,0.00019819196,0.000059541908,0.0005385784,0.00023978954,0.00014182314,8.550943e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002323456,0.00003257275,0.00022078303,0.0000044563926,0.000016064774,0.0000039672973,0.001143298,0.9934952,0.000008086185,0.0023000743,0.00063944154,0.0021128003],"study_design_scores_gemma":[0.0007530743,0.00005980545,0.00013245999,0.000031862903,0.000005337231,0.000033998484,0.000045182573,0.9986708,0.00001987488,0.000042380605,0.0000039641773,0.00020124513],"about_ca_topic_score_codex":0.000013426151,"about_ca_topic_score_gemma":0.00001818013,"teacher_disagreement_score":0.56211036,"about_ca_system_score_codex":0.000043189662,"about_ca_system_score_gemma":0.000043029486,"threshold_uncertainty_score":0.6668299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036179894,0.0006499099,0.9499483,0.0004555212,0.00027307196,0.00014900335,5.6658855e-8,0.0001603389,0.044745773],"genre_scores_gemma":[0.985772,0.000037908445,0.011206076,0.00044677054,0.00013547143,0.000024450677,0.000004717732,0.0000055532223,0.0023670653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914384,0.00004058676,0.00019880851,0.00025147301,0.0001253591,0.00023995066],"domain_scores_gemma":[0.999497,0.000055703582,0.000041115258,0.00034774715,0.00002674747,0.00003168668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001724852,0.00008251443,0.00009143331,0.0000461887,0.00003223675,0.000110735455,0.00036874737,0.0000686581,0.000060737544],"category_scores_gemma":[0.0000035408218,0.00007623512,0.000024745581,0.00035605623,0.000016032069,0.0003305003,0.000067326546,0.00011077603,0.000057846224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005341651,0.00008101481,0.0015029009,0.0000027981348,0.0000030033473,0.000035125115,0.0000639332,0.12783293,0.00010873202,0.5315058,0.024302121,0.31455624],"study_design_scores_gemma":[0.00027664783,0.00003031878,0.018827926,0.000009067309,7.8224394e-7,0.000004812294,0.000003610561,0.95416623,0.00018996451,0.00415758,0.022193473,0.00013959447],"about_ca_topic_score_codex":0.000046348632,"about_ca_topic_score_gemma":0.0006039881,"teacher_disagreement_score":0.982154,"about_ca_system_score_codex":0.00003415235,"about_ca_system_score_gemma":0.000020000634,"threshold_uncertainty_score":0.3108778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05951222,0.00006155661,0.9374606,0.0005937431,0.00045102663,0.00025846506,2.4433746e-7,0.00031217045,0.0013499936],"genre_scores_gemma":[0.9251449,0.0000023066286,0.073133245,0.001229899,0.00028914268,0.000031670435,0.000001724851,0.000014444503,0.00015267332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808156,0.0000956905,0.0003821263,0.0005471088,0.00025955684,0.0006339399],"domain_scores_gemma":[0.9988613,0.00019063642,0.00008862053,0.0006820753,0.000047438924,0.00012990244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059326726,0.00019057696,0.0002062824,0.00010305624,0.00008990447,0.00013377825,0.00091811054,0.00011180831,0.00004017063],"category_scores_gemma":[0.000017087747,0.00017500442,0.00007079566,0.0007184421,0.0000350124,0.0001216347,0.00026531005,0.00030150462,0.00008198524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028533375,0.00014214264,0.0017009907,0.0000020690097,0.0000022486024,0.000012803987,0.00008772005,0.9303561,0.00003149239,0.007950471,0.0003405698,0.059370555],"study_design_scores_gemma":[0.0007700146,0.00001858487,0.0026944985,0.00003660546,0.0000013890686,0.0000028530349,0.00000893961,0.99550265,0.00029143674,0.00000452585,0.00044550622,0.00022302264],"about_ca_topic_score_codex":0.000079955185,"about_ca_topic_score_gemma":0.00042756126,"teacher_disagreement_score":0.86563265,"about_ca_system_score_codex":0.00014515965,"about_ca_system_score_gemma":0.00006086217,"threshold_uncertainty_score":0.7136473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042858534,0.00006155945,0.95123214,0.00013271671,0.0010366742,0.00058838486,9.626203e-8,0.00022638579,0.042436168],"genre_scores_gemma":[0.7080282,0.000032305532,0.28982687,0.000624387,0.00014747422,0.0002210129,6.5138295e-7,0.000014105941,0.0011049691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981368,0.00008041031,0.00031586085,0.0005983374,0.0002758523,0.0005927355],"domain_scores_gemma":[0.9985307,0.00022258415,0.000051224968,0.0010546378,0.000033133034,0.00010772903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061117066,0.00018571109,0.00017911823,0.0000522273,0.00008533601,0.00035404094,0.0011969074,0.00016632961,0.00038196633],"category_scores_gemma":[0.000011094882,0.00016261835,0.00005763217,0.00053145905,0.00008135737,0.000806423,0.0005735776,0.0005493227,0.00019475006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022311815,0.00031974708,0.0024091175,0.00000971442,0.00002808684,0.00033087932,0.00021650695,0.14791027,0.00013111284,0.74318767,0.007968038,0.09746654],"study_design_scores_gemma":[0.00063314557,0.00009235036,0.005049776,0.000011146249,0.0000045911115,0.00002706365,0.000012048661,0.9494151,0.0006865078,0.013853606,0.029856037,0.00035864598],"about_ca_topic_score_codex":0.000024299701,"about_ca_topic_score_gemma":0.00004640358,"teacher_disagreement_score":0.8015048,"about_ca_system_score_codex":0.000035070683,"about_ca_system_score_gemma":0.000022365284,"threshold_uncertainty_score":0.6631384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07999977,0.00040085116,0.91838586,0.000045785513,0.00009302601,0.0007811653,0.0000031000725,0.00014641907,0.00014401514],"genre_scores_gemma":[0.47673178,0.000087690554,0.52269495,0.00022147757,0.000030258821,0.000120826735,0.000010396886,0.000010315929,0.00009232874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859864,0.000017633654,0.0002841233,0.00054015877,0.00025094245,0.0003085293],"domain_scores_gemma":[0.99926996,0.00009180925,0.0001119812,0.00029662694,0.00013103029,0.00009856086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022196033,0.00016496715,0.00017581519,0.00007296704,0.00028016348,0.00009686737,0.00028763065,0.00007727776,0.0000034030759],"category_scores_gemma":[0.0000028379384,0.0001707164,0.00005672037,0.00026842763,0.00006386778,0.0004932247,0.0002795712,0.0000995757,0.0000010999612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140489,0.000083398074,0.000040377232,0.000023101604,0.000025364921,0.0000041200665,0.00054101617,0.9558627,0.00001905789,0.032624435,0.00029000218,0.010472398],"study_design_scores_gemma":[0.0007991718,0.000045893456,0.00010416244,0.000021136877,0.000008184145,0.000052083215,0.000022535347,0.9931299,0.0000045982356,0.005335561,0.00027444292,0.00020234127],"about_ca_topic_score_codex":0.0000030277877,"about_ca_topic_score_gemma":0.000005180271,"teacher_disagreement_score":0.396732,"about_ca_system_score_codex":0.00006700843,"about_ca_system_score_gemma":0.00004755638,"threshold_uncertainty_score":0.6961613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44968078,0.0005029856,0.5477147,0.0005352953,0.00024338183,0.00077631726,4.982536e-7,0.00015559644,0.00039040836],"genre_scores_gemma":[0.97425187,0.00012800616,0.024985258,0.00036605677,0.000029265228,0.00019719952,0.0000054685775,0.000011818861,0.000025085857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745303,0.0002593282,0.0005129938,0.0009390495,0.00033455063,0.0005010517],"domain_scores_gemma":[0.9983403,0.00017649279,0.00013849982,0.0009107537,0.00027217495,0.00016174697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011906364,0.00027033585,0.00028882132,0.00012017877,0.000074331976,0.0002173882,0.0010499837,0.00016978075,0.000040454004],"category_scores_gemma":[0.00008600183,0.0002474944,0.000039497536,0.000828686,0.00010286382,0.0008997195,0.0007362458,0.00041448072,0.000018767703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010513186,0.00045938054,0.0062996172,0.00007405468,0.000022487768,0.000017212311,0.0036846222,0.09382823,0.00033365085,0.016297372,0.000054911623,0.87882334],"study_design_scores_gemma":[0.0012004696,0.00018582011,0.028578132,0.00023130642,0.0000073620786,0.0000126197865,0.00006868634,0.96032774,0.00018334016,0.008880865,0.00002662331,0.00029701332],"about_ca_topic_score_codex":0.00017058356,"about_ca_topic_score_gemma":0.0059721894,"teacher_disagreement_score":0.87852633,"about_ca_system_score_codex":0.00028452676,"about_ca_system_score_gemma":0.0001444002,"threshold_uncertainty_score":0.99999774},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055532467,0.00003826345,0.9413869,0.0005758738,0.00053663895,0.00034115888,4.379047e-7,0.00013374776,0.0014545484],"genre_scores_gemma":[0.6420421,0.0000035884914,0.35660297,0.0006756553,0.00030948225,0.000017402775,0.0000017326769,0.000009955631,0.00033714343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985896,0.00002226643,0.00033978795,0.0003964301,0.00017242722,0.00047954003],"domain_scores_gemma":[0.9987171,0.00052749785,0.000063116146,0.0005159794,0.00006898555,0.00010728479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007995959,0.00012166627,0.00014420172,0.00011297015,0.000055490997,0.00013350348,0.00061180425,0.00012169966,0.000021132233],"category_scores_gemma":[0.000103699436,0.000114769435,0.000059747053,0.00031827914,0.000020866406,0.00043918256,0.0001935888,0.0001572675,0.000029825962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014808668,0.00023066305,0.010816939,0.00004342829,0.000025809444,0.00019259453,0.0013974794,0.018078744,0.0014809358,0.12848508,0.0042349836,0.8348653],"study_design_scores_gemma":[0.00087295566,0.000158929,0.0038749562,0.00003126246,0.000003071517,0.0000075004536,0.000018735063,0.9793584,0.0021436594,0.0019349261,0.011322466,0.00027314565],"about_ca_topic_score_codex":0.00019427414,"about_ca_topic_score_gemma":0.0020968956,"teacher_disagreement_score":0.96127963,"about_ca_system_score_codex":0.000051110535,"about_ca_system_score_gemma":0.00004843768,"threshold_uncertainty_score":0.46801618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000734894,0.0034832016,0.9926398,0.00018865241,0.0018774417,0.0014703586,0.000017740866,0.00011986458,0.00012946983],"genre_scores_gemma":[0.2593067,0.0004991988,0.73515785,0.0035119075,0.00071148394,0.00036521693,0.00018427745,0.000104581246,0.00015878383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962557,0.000043826454,0.0007938923,0.0013217746,0.00072215736,0.0008626356],"domain_scores_gemma":[0.99629366,0.00043514138,0.00061683846,0.0014886912,0.0009981658,0.00016748332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011343875,0.0005308871,0.000619001,0.00040558516,0.0002421925,0.00031717523,0.0026639022,0.00050336716,0.0000083146915],"category_scores_gemma":[0.000054762615,0.0005247051,0.00015361619,0.0013258994,0.00032528015,0.0011681103,0.00073579984,0.0005867636,0.0000058178584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016449854,0.000032130145,0.000009326504,0.00008962097,0.0000106091775,0.0000036564636,0.00021754025,0.5586039,0.000031268846,0.004755704,0.00007825714,0.43615156],"study_design_scores_gemma":[0.00043668866,0.00037762208,0.00005555364,0.0004136372,0.000016797982,0.00003219233,2.9282592e-7,0.959705,0.00024571817,0.032392737,0.005801964,0.0005217748],"about_ca_topic_score_codex":0.000006176605,"about_ca_topic_score_gemma":0.00014694678,"teacher_disagreement_score":0.43562979,"about_ca_system_score_codex":0.00037931782,"about_ca_system_score_gemma":0.00041513643,"threshold_uncertainty_score":0.99972045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0213169,0.00007075621,0.9692716,0.00040445197,0.0008785908,0.0002584013,3.100948e-7,0.00031858493,0.0074803866],"genre_scores_gemma":[0.98252106,0.000026426824,0.014288503,0.001874283,0.00034335925,0.00005787692,0.0000037276359,0.000017439392,0.00086730806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981546,0.00009636823,0.0003305669,0.00053977553,0.00030694954,0.00057174015],"domain_scores_gemma":[0.9986254,0.00021629894,0.00007080324,0.0008832967,0.000053325468,0.0001508826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002858669,0.00019771872,0.00024885873,0.0001059093,0.000112762595,0.00006858602,0.0011383315,0.00014313418,0.00015549235],"category_scores_gemma":[0.0000118732605,0.0001833833,0.00007932727,0.00081503484,0.000080879836,0.0003367012,0.00021778344,0.00030134188,0.00014209482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005349944,0.00074213155,0.054268155,0.000030477067,0.000038607894,0.0013375784,0.00065373926,0.40974957,0.00012560595,0.17746244,0.20717598,0.14836222],"study_design_scores_gemma":[0.0005073594,0.000044734195,0.0040130233,0.00002028344,0.0000013152877,0.00002156133,0.0000039105284,0.9922728,0.00020195749,0.00015344152,0.0025138897,0.0002457256],"about_ca_topic_score_codex":0.00012273662,"about_ca_topic_score_gemma":0.00020287686,"teacher_disagreement_score":0.9612042,"about_ca_system_score_codex":0.00006625568,"about_ca_system_score_gemma":0.0001308263,"threshold_uncertainty_score":0.7478154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02521169,0.000798055,0.9655721,0.0000284462,0.00024512713,0.00015425122,7.7181504e-8,0.00010429846,0.007885945],"genre_scores_gemma":[0.9257268,0.00004202262,0.07359583,0.00019050135,0.000029054334,0.000008935363,2.702408e-7,0.00001057403,0.00039604207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984296,0.00012279753,0.00037625586,0.00037248462,0.00025038043,0.00044848333],"domain_scores_gemma":[0.9989601,0.00020491063,0.0001258478,0.0005713105,0.00005984948,0.000077988385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085661205,0.00013803058,0.0002262217,0.00005437008,0.00004350951,0.00004760317,0.0005426109,0.000091690374,0.00002855117],"category_scores_gemma":[0.0001024564,0.00012994531,0.00005617601,0.0005896525,0.000025952395,0.00023695071,0.00017708557,0.00022484464,0.000011617544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140697275,0.00022633254,0.062231604,0.000030060435,0.00002129307,0.00005390492,0.0034175706,0.30546322,0.0005150704,0.07350498,0.0008886955,0.5536332],"study_design_scores_gemma":[0.00046779338,0.000035562294,0.0019850016,0.000063101994,0.0000017107739,0.000009390599,0.000072438175,0.9944095,0.00042812145,0.00020335577,0.0021505144,0.00017348635],"about_ca_topic_score_codex":0.000050018076,"about_ca_topic_score_gemma":0.00019147253,"teacher_disagreement_score":0.9005151,"about_ca_system_score_codex":0.000087717206,"about_ca_system_score_gemma":0.00007737778,"threshold_uncertainty_score":0.5299016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05679926,0.001073833,0.926362,0.00056994276,0.00020516201,0.0005150939,2.1060266e-7,0.00044850388,0.014026009],"genre_scores_gemma":[0.9025761,0.00006391997,0.09491868,0.0009820942,0.00010670189,0.000026443782,0.0000019716665,0.000014631982,0.0013094406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979795,0.00008234131,0.0003489748,0.0006145327,0.00028977304,0.0006848566],"domain_scores_gemma":[0.9987775,0.000096502845,0.000117611926,0.000818069,0.000048846607,0.00014145866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004492251,0.00023188046,0.0002542821,0.00009583556,0.00008937389,0.00019190079,0.0009510464,0.000115691575,0.00003932867],"category_scores_gemma":[0.000011355605,0.00018770211,0.00005705022,0.00084525836,0.00002628517,0.00065173913,0.00019992662,0.0003843749,0.000037795486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004115806,0.0003036077,0.009295064,0.0000072006897,0.00001591817,0.0001708069,0.00064353406,0.18909429,0.00006263562,0.00569245,0.002780327,0.791893],"study_design_scores_gemma":[0.0010201484,0.00030966575,0.026809169,0.00014097763,0.00000437356,0.000025743473,0.000028621329,0.96544504,0.00013164662,0.00044592645,0.0052294135,0.0004092662],"about_ca_topic_score_codex":0.000012006639,"about_ca_topic_score_gemma":0.0002943501,"teacher_disagreement_score":0.84577686,"about_ca_system_score_codex":0.00006211701,"about_ca_system_score_gemma":0.000045611883,"threshold_uncertainty_score":0.765427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10348518,0.0006118007,0.89040065,0.0033704396,0.00068095035,0.00015699954,1.6139893e-7,0.00010496883,0.0011888291],"genre_scores_gemma":[0.81729716,0.00042529558,0.1819003,0.00015101665,0.00014354827,0.0000039797155,1.1720664e-7,0.000013254764,0.00006535123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979687,0.00006642934,0.00077670516,0.00033234866,0.00031967688,0.0005361481],"domain_scores_gemma":[0.99833673,0.00009415752,0.00044117332,0.0008571198,0.00015169242,0.00011912407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046725426,0.00021497582,0.0004733958,0.00087832584,0.00008182022,0.000044868157,0.002475079,0.0005297316,0.0000134690235],"category_scores_gemma":[0.000060015947,0.00018861072,0.000108169785,0.0012605567,0.0002075654,0.00035421446,0.001120108,0.00164566,0.000008230183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015016885,0.00079625414,0.015309205,0.00004363298,0.00040271378,0.020408025,0.00080986274,0.015637638,0.002580006,0.86578786,0.006807682,0.07126693],"study_design_scores_gemma":[0.0036011504,0.0015752151,0.0045617293,0.0007600915,0.00007323986,0.014661252,0.00020330185,0.91293794,0.0043839924,0.051329874,0.0049457657,0.00096646853],"about_ca_topic_score_codex":0.000003831298,"about_ca_topic_score_gemma":0.00001392825,"teacher_disagreement_score":0.8973003,"about_ca_system_score_codex":0.00021836691,"about_ca_system_score_gemma":0.00007877351,"threshold_uncertainty_score":0.7691322},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6412774,0.0016569621,0.35553566,0.00005152342,0.00025356715,0.00048749318,0.0000015335063,0.000114037444,0.0006218652],"genre_scores_gemma":[0.9809224,0.0001688561,0.018597843,0.000044160934,0.000160555,0.00006790797,0.000009367501,0.000023210045,0.000005724887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785304,0.00037334164,0.0006447854,0.00035835677,0.00017271872,0.00059776887],"domain_scores_gemma":[0.9965537,0.0009788488,0.0005195138,0.0016809829,0.00012882026,0.00013812497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249872,0.00022679273,0.00040375622,0.00014995881,0.00035332682,0.000098294324,0.0015037047,0.00014465538,0.000001315394],"category_scores_gemma":[0.000041956468,0.00024345896,0.0000720666,0.00066770427,0.00020326233,0.0007185668,0.0023612329,0.0005514363,0.0000016950614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023641927,0.0005875648,0.033768803,0.00004437848,0.000055095818,0.0000020241707,0.011058376,0.008796067,0.006872424,0.061179895,0.000014565059,0.87759715],"study_design_scores_gemma":[0.0005246659,0.000066644636,0.008371326,0.00018956985,0.000011090327,0.000014913401,0.00088249746,0.98889846,0.0004877527,0.00007150879,0.0002186473,0.00026293757],"about_ca_topic_score_codex":0.0005470093,"about_ca_topic_score_gemma":0.000056058918,"teacher_disagreement_score":0.98010236,"about_ca_system_score_codex":0.000109446024,"about_ca_system_score_gemma":0.000058975005,"threshold_uncertainty_score":0.9927968},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091519055,0.0020864666,0.9925508,0.0007702996,0.0012505845,0.0011231413,0.0000011558027,0.00021491398,0.0010874714],"genre_scores_gemma":[0.6390778,0.00010891646,0.33742902,0.00052382855,0.0006353774,0.00016155058,0.0000055755486,0.000046372712,0.022011569],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769855,0.0000682449,0.0004938548,0.00047775186,0.00064109993,0.00062051346],"domain_scores_gemma":[0.99749106,0.00058793795,0.00014212007,0.00082907587,0.0007435494,0.00020628044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028134054,0.00019919549,0.00035127247,0.00010698579,0.00008106339,0.00014721623,0.0012109653,0.00015720775,0.000012115364],"category_scores_gemma":[0.00005192961,0.00017350365,0.00008502377,0.0005380165,0.000035340458,0.00024429747,0.00021044452,0.00012039264,0.00002530592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013986311,0.00016140519,0.00017886888,0.000088991794,0.00009168839,0.00002310016,0.0012851522,0.32552177,0.00045738064,0.09539243,0.33628416,0.2403752],"study_design_scores_gemma":[0.00035281017,0.00034862876,0.00012805017,0.000063622654,0.000008962794,0.000009151082,0.000082991406,0.91038847,0.0018232072,0.00026408603,0.08625217,0.0002778666],"about_ca_topic_score_codex":0.00003755881,"about_ca_topic_score_gemma":0.000029926776,"teacher_disagreement_score":0.65512174,"about_ca_system_score_codex":0.000050625633,"about_ca_system_score_gemma":0.000042965636,"threshold_uncertainty_score":0.70752734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48889133,0.000012957536,0.5099782,0.00022901045,0.00020504055,0.0002609134,0.0000017390993,0.00007264114,0.00034820364],"genre_scores_gemma":[0.9564651,0.0000053989274,0.04291691,0.00041979447,0.0000785203,0.000048748865,0.000015915073,0.000008971496,0.000040644856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866956,0.000048192713,0.00025777193,0.0004226577,0.0002546181,0.00034717162],"domain_scores_gemma":[0.9990603,0.00009258694,0.000071094546,0.00065883435,0.000017035583,0.00010015964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026669307,0.0001390598,0.00013735192,0.00006285515,0.00005888997,0.00010303819,0.00048414152,0.00012479501,0.00037660074],"category_scores_gemma":[0.000010337264,0.00013595681,0.000027584456,0.0003751393,0.000025968091,0.0004867174,0.00037173176,0.00032577163,0.00009112239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048392354,0.0020614301,0.102425136,0.00016335791,0.00011144514,0.00027725156,0.0031538026,0.45584476,0.17343074,0.13644212,0.003204435,0.12283712],"study_design_scores_gemma":[0.00028287387,0.000014675989,0.03393898,0.00000964673,0.000002664256,0.000021637261,0.000018845394,0.95184255,0.00049163745,0.00036876215,0.012832344,0.00017537203],"about_ca_topic_score_codex":0.0002969778,"about_ca_topic_score_gemma":0.00017778689,"teacher_disagreement_score":0.4959978,"about_ca_system_score_codex":0.00010640738,"about_ca_system_score_gemma":0.000036746864,"threshold_uncertainty_score":0.55441576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03040857,0.030415019,0.9173968,0.005536628,0.0008117994,0.003943943,0.00026768222,0.0006592772,0.010560318],"genre_scores_gemma":[0.8713656,0.012201615,0.11356179,0.0012062372,0.00026761985,0.00093003345,0.0002451161,0.000035807287,0.00018619248],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962318,0.00034620723,0.0011492134,0.0008717126,0.0003914151,0.001009667],"domain_scores_gemma":[0.9952838,0.00048469225,0.00054020394,0.0030817832,0.00027891004,0.00033060287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058694073,0.0005262227,0.0006938198,0.00020508775,0.0003358168,0.00034858895,0.0037183694,0.00033264977,0.000052765856],"category_scores_gemma":[0.000016768005,0.0005502377,0.00014517369,0.0019169878,0.0003036461,0.0009825916,0.0011417737,0.0007531129,0.000039939132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000314674,0.0007841834,0.00469251,0.000049723632,0.00010127192,0.0000048707107,0.0008215459,0.07580622,0.00006241765,0.008114052,0.0064829667,0.90304875],"study_design_scores_gemma":[0.001503073,0.00016518906,0.0074269194,0.00018532906,0.00006446778,0.00010148382,0.00021940444,0.47304568,0.000059981063,0.0028983757,0.51330495,0.0010251405],"about_ca_topic_score_codex":0.0001404811,"about_ca_topic_score_gemma":0.0107904235,"teacher_disagreement_score":0.9020236,"about_ca_system_score_codex":0.00029432584,"about_ca_system_score_gemma":0.0004245983,"threshold_uncertainty_score":0.9996949},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024601421,0.0010004468,0.99317163,0.00019754126,0.000628026,0.0007785808,0.000004532462,0.0005351207,0.0012239517],"genre_scores_gemma":[0.47119394,0.000083324936,0.52524143,0.0018481623,0.00041559406,0.0004791603,0.000035524223,0.000031544143,0.00067133317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807537,0.000053220905,0.00035110308,0.0006171873,0.0002708059,0.00063230237],"domain_scores_gemma":[0.9983991,0.0004021189,0.00012179779,0.00075424195,0.00015239362,0.00017036949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030263892,0.00022578132,0.00024296399,0.00006590409,0.00042825929,0.0001187152,0.00081646437,0.000084776395,0.00005948556],"category_scores_gemma":[0.000015941487,0.00021530325,0.00015742236,0.00028904603,0.000068539055,0.00036578302,0.00015416871,0.00018141608,0.000039855637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029115463,0.00022932273,0.00021187913,0.00001433147,0.000041117517,0.00011424881,0.00016649366,0.32627428,0.00004508665,0.0046437914,0.025359657,0.64287066],"study_design_scores_gemma":[0.0006227112,0.00024827098,0.00010440718,0.000019779585,0.0000063343814,0.000065109365,0.0000047494523,0.98644125,0.0005469549,0.0002534448,0.011399906,0.00028710032],"about_ca_topic_score_codex":0.0000082342185,"about_ca_topic_score_gemma":0.000005165043,"teacher_disagreement_score":0.660167,"about_ca_system_score_codex":0.0000851623,"about_ca_system_score_gemma":0.00011737843,"threshold_uncertainty_score":0.8779812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035552406,0.0004893523,0.9906423,0.00021206625,0.00096942944,0.00083033263,6.345571e-7,0.0003395226,0.0029611238],"genre_scores_gemma":[0.9236885,0.0002199993,0.0714651,0.0024574904,0.00031904774,0.00036921704,0.0000063013526,0.000031994834,0.0014423619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998355,0.00002495176,0.00030426952,0.0005451824,0.00022463071,0.00054599816],"domain_scores_gemma":[0.99883056,0.00015129194,0.00008991457,0.0007178256,0.00006157656,0.00014883842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032327804,0.00019147428,0.0001785331,0.000051948806,0.0001605669,0.00016414953,0.00092313765,0.00009960618,0.000048065795],"category_scores_gemma":[0.000019492769,0.00016775305,0.00012798165,0.0002919466,0.000023545963,0.00021344624,0.0002645912,0.00017169605,0.00013118582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012365113,0.00011625105,0.000025572057,0.000004592554,0.000017357264,0.0000073478864,0.00024902896,0.5244719,0.000007237023,0.097480334,0.0027453797,0.37486267],"study_design_scores_gemma":[0.0009049232,0.00091224414,0.00014174716,0.00009440384,0.000008418247,0.000009436796,0.0000560092,0.87942857,0.0015865513,0.006699273,0.10969835,0.00046007033],"about_ca_topic_score_codex":0.000004856483,"about_ca_topic_score_gemma":0.000020455862,"teacher_disagreement_score":0.92013323,"about_ca_system_score_codex":0.00015408792,"about_ca_system_score_gemma":0.000043224987,"threshold_uncertainty_score":0.6840771},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010771058,0.000027565982,0.9848492,0.00023824701,0.00027680356,0.00035416687,8.3228855e-7,0.00034487084,0.0031372632],"genre_scores_gemma":[0.9348794,0.000028728226,0.06221211,0.00074413005,0.00013730291,0.000111533656,0.0000016194612,0.000012474589,0.0018726822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988305,0.000028313709,0.00016797667,0.00042619873,0.00015284194,0.00039415393],"domain_scores_gemma":[0.9988901,0.00022923954,0.000054005646,0.0006258238,0.00008807251,0.00011275095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002207976,0.00013580751,0.00018844963,0.000028832364,0.00021211104,0.000045819652,0.00070955296,0.000094480776,0.000009741239],"category_scores_gemma":[0.000012377258,0.00012310693,0.00009330369,0.00020528129,0.00004952348,0.00039410943,0.00020349685,0.000117314325,0.0000108547865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011549197,0.00008229455,0.00035409135,0.000005115409,0.000018388777,0.000009070034,0.00023356632,0.26350144,0.00003073512,0.67430115,0.034548305,0.026904311],"study_design_scores_gemma":[0.00030926545,0.000035838875,0.00014623108,0.0000034787765,0.0000022407512,0.000021021926,0.0000016405914,0.9951297,0.0001279592,0.0037497547,0.00030005694,0.00017279566],"about_ca_topic_score_codex":0.000013779853,"about_ca_topic_score_gemma":0.000040092404,"teacher_disagreement_score":0.9241084,"about_ca_system_score_codex":0.000033276126,"about_ca_system_score_gemma":0.00006877337,"threshold_uncertainty_score":0.5020155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4592486,0.000042870925,0.5200155,0.000062241576,0.00010204312,0.00006644633,4.3234672e-7,0.00010546617,0.020356461],"genre_scores_gemma":[0.97065204,0.000010655312,0.027988194,0.00008917791,0.000103645754,0.000006172796,0.0000028230247,0.000004057253,0.0011432553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901605,0.000030340656,0.00025131073,0.000239397,0.00020571362,0.00025718476],"domain_scores_gemma":[0.99914676,0.00007059913,0.000097465556,0.0005873584,0.00006353643,0.00003425708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019063562,0.00008789661,0.00023518842,0.00010383627,0.000047549514,0.00003197836,0.00050538627,0.000042344127,0.000058852736],"category_scores_gemma":[0.0000012502159,0.00007516469,0.00010926839,0.0022877082,0.000030682655,0.00017381868,0.00013022976,0.000058308793,0.000016651911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043535865,0.000058624126,0.12663092,0.00000891116,0.00021815415,0.0000050503545,0.000041134004,0.770183,0.00014694438,0.07278276,0.0049240417,0.024996057],"study_design_scores_gemma":[0.0000638163,0.00001911982,0.08473085,0.0000045498728,0.000059320606,0.000001106991,0.0000015012002,0.9139605,0.00028860715,0.00010259666,0.0006806976,0.00008732604],"about_ca_topic_score_codex":0.000120989345,"about_ca_topic_score_gemma":0.000116325944,"teacher_disagreement_score":0.51140344,"about_ca_system_score_codex":0.000014655834,"about_ca_system_score_gemma":0.000017262293,"threshold_uncertainty_score":0.3065127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28294528,0.00025567884,0.7146156,0.00020619556,0.00045858978,0.0012156471,0.000028353154,0.00022368087,0.000050969942],"genre_scores_gemma":[0.9849195,0.001160577,0.012628869,0.00006500206,0.000016801698,0.00110185,0.000025752608,0.000025959438,0.00005568671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812007,0.00028716563,0.00059488456,0.0004995439,0.00016093277,0.00033742125],"domain_scores_gemma":[0.9968189,0.0005212149,0.00022793448,0.002134773,0.00018046964,0.00011668326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004196156,0.00023466971,0.00028113366,0.00022524968,0.0006058181,0.00010489226,0.0011967149,0.0002148505,0.0000067429773],"category_scores_gemma":[0.000009554808,0.00024991008,0.00008518127,0.0006133033,0.00019378954,0.0005667108,0.00003675822,0.00053511513,0.0000052732976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010377532,0.0012867283,0.00010319271,0.000046870566,0.000113299546,0.0000024798112,0.011680956,0.013475619,0.0013847204,0.018032147,0.00008669875,0.95274955],"study_design_scores_gemma":[0.0026186418,0.0006026139,0.0029665409,0.000085408814,0.000042805314,0.0000111493455,0.00017632545,0.9851337,0.0040121907,0.003295421,0.0006563051,0.00039888438],"about_ca_topic_score_codex":0.00014178341,"about_ca_topic_score_gemma":0.0024328853,"teacher_disagreement_score":0.9716581,"about_ca_system_score_codex":0.00012526066,"about_ca_system_score_gemma":0.000040903018,"threshold_uncertainty_score":0.9999953},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07675119,0.00009105457,0.9205836,0.00011911318,0.0009125618,0.0012974179,0.0000016160508,0.00006300251,0.00018046469],"genre_scores_gemma":[0.93868226,0.00012579735,0.057922922,0.0029578973,0.00019416686,0.00008471852,0.0000021777003,0.00001182167,0.000018230587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975657,0.000052219428,0.0007323245,0.0004880899,0.00043200096,0.00072969904],"domain_scores_gemma":[0.99856293,0.0004221972,0.00026533782,0.00044398286,0.000108759275,0.00019681068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002800155,0.00025675338,0.00031883066,0.00033995154,0.00039515307,0.00067270815,0.00080578314,0.00013126785,0.000017343971],"category_scores_gemma":[0.00003948283,0.00018451482,0.000047770554,0.0011537533,0.0001286891,0.0038903512,0.00019386914,0.00040638147,0.0000041384947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002983049,0.000067161134,0.0003304459,0.000024666668,0.000005295616,0.0000039821093,0.0027831318,0.4184104,0.00020323278,0.0024718302,0.00022488138,0.57517666],"study_design_scores_gemma":[0.0019656022,0.00073437067,0.0016558837,0.00026217208,0.0000023784053,0.000011582488,0.000032412485,0.98973376,0.00007845906,0.00011356449,0.005140128,0.00026970048],"about_ca_topic_score_codex":0.0000028921634,"about_ca_topic_score_gemma":0.000008842576,"teacher_disagreement_score":0.86266065,"about_ca_system_score_codex":0.00009024335,"about_ca_system_score_gemma":0.00020719194,"threshold_uncertainty_score":0.7524296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004191333,7.623897e-7,0.9149413,0.00020767064,0.00003440994,0.07963824,4.3133483e-7,0.00020572043,0.00078012137],"genre_scores_gemma":[0.71899736,1.5938662e-8,0.19962323,0.0002774028,0.000038700382,0.08102679,9.987446e-7,0.0000058917553,0.000029582816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987507,0.000049532326,0.0002744473,0.00040404187,0.00015431098,0.00036696604],"domain_scores_gemma":[0.9991776,0.00011437023,0.00006174739,0.00047991192,0.000068252644,0.000098135904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030381684,0.0001188123,0.00011077957,0.000079184596,0.00010243347,0.00015530153,0.0005745488,0.000048888054,0.000010891253],"category_scores_gemma":[0.00004268244,0.00010820374,0.00003650488,0.00026733114,0.000013756909,0.00016505609,0.000057102,0.00007681914,0.000011520071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019546434,0.0008301708,0.00047977595,0.000013131686,0.0000028318036,0.000033875935,0.00045747714,0.7135409,0.00062621624,0.04915946,0.00014002617,0.2346966],"study_design_scores_gemma":[0.00071088836,0.00027335444,0.0027196174,0.000024765035,8.4034195e-7,0.00002105464,0.000003570045,0.99394333,0.0010908482,0.0007528902,0.00032208159,0.0001367517],"about_ca_topic_score_codex":0.000013766984,"about_ca_topic_score_gemma":0.000055861216,"teacher_disagreement_score":0.7153181,"about_ca_system_score_codex":0.00006233621,"about_ca_system_score_gemma":0.000032929882,"threshold_uncertainty_score":0.44124207},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006120704,0.003265912,0.9866345,0.00013217652,0.0005121945,0.0003975326,7.2095435e-7,0.00048155314,0.007963319],"genre_scores_gemma":[0.24113159,0.00019673223,0.7516846,0.0013868152,0.00061999157,0.00052233454,0.00001982695,0.00005705662,0.004381046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979862,0.00007895767,0.00039592315,0.0006054735,0.0002742861,0.00065914314],"domain_scores_gemma":[0.998841,0.00012928841,0.00007779178,0.00080934673,0.00004276394,0.00009982923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003568278,0.00022681413,0.00024912303,0.00015973483,0.00008180669,0.00019597985,0.0009103011,0.00013982321,0.00014678341],"category_scores_gemma":[0.0000026178354,0.00021476235,0.00008378821,0.00094544125,0.000036085014,0.00044251911,0.00034954573,0.00026118557,0.00006447245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052699047,0.00011654545,0.000309788,0.000006086605,0.0000035214282,0.00008634171,0.00002402488,0.42508572,0.000015498106,0.0012482026,0.004544855,0.56855416],"study_design_scores_gemma":[0.0006144711,0.00007539827,0.00089330255,0.000032350683,0.0000019031415,0.000011930572,0.000003909375,0.954171,0.00026395742,0.0004932718,0.043172672,0.00026583372],"about_ca_topic_score_codex":0.000069702975,"about_ca_topic_score_gemma":0.00043703226,"teacher_disagreement_score":0.5682883,"about_ca_system_score_codex":0.0001123467,"about_ca_system_score_gemma":0.00006078402,"threshold_uncertainty_score":0.87577546},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05269471,0.0002277892,0.93921393,0.0003209417,0.0002856197,0.00029946447,8.061785e-7,0.00008920505,0.0068675093],"genre_scores_gemma":[0.9968404,0.00003267358,0.0017963864,0.0009791015,0.00006583174,0.000027892154,7.555087e-7,0.000008499059,0.00024843647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987501,0.00028534755,0.00017058717,0.0003390996,0.00019469105,0.000260169],"domain_scores_gemma":[0.99648607,0.0026578864,0.000111185465,0.00058027735,0.00009632522,0.00006825453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007221285,0.00013693406,0.00019541556,0.000028534196,0.00010461586,0.000056788358,0.0006289565,0.00007400347,0.000058901463],"category_scores_gemma":[0.00020106013,0.00008644686,0.00007351092,0.00025175704,0.00011660227,0.00013537295,0.00013199559,0.00021939921,0.000033184013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008786392,0.00046373796,0.0014164137,0.000012459105,0.0001209778,0.000007122208,0.0008907471,0.018122569,0.00013670187,0.47049844,0.009501094,0.49874187],"study_design_scores_gemma":[0.00072993216,0.0002808529,0.0066223266,0.000048312515,0.00000816705,0.0000041020926,0.000019835896,0.9876653,0.0018025478,0.0018793875,0.0007735763,0.00016565535],"about_ca_topic_score_codex":0.000010706357,"about_ca_topic_score_gemma":0.0000671763,"teacher_disagreement_score":0.96954274,"about_ca_system_score_codex":0.000016286236,"about_ca_system_score_gemma":0.00002013245,"threshold_uncertainty_score":0.35252008},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028849205,0.00022050749,0.9683221,0.0006046914,0.0006148367,0.0007756523,0.0000045933944,0.00021371192,0.0003947033],"genre_scores_gemma":[0.89602023,0.000015431762,0.102826305,0.000510507,0.0002533226,0.00020479114,0.000032859552,0.000024028024,0.00011253015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808025,0.00005040732,0.00048059042,0.0005940685,0.00021163073,0.0005830439],"domain_scores_gemma":[0.9988567,0.00016746261,0.00022201941,0.0005558194,0.00012564636,0.00007229972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699079,0.00021995846,0.0002879443,0.0000855594,0.00014545351,0.00016989527,0.0008472999,0.00015658699,0.0000043576374],"category_scores_gemma":[0.000018896506,0.00024083938,0.00009208342,0.00049281615,0.000024406876,0.00032588042,0.00021474058,0.00020416969,0.000013412911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005778173,0.0003983722,0.0011759005,0.000067993875,0.000021443602,0.000013524767,0.00018004117,0.064954236,0.0036843475,0.80936474,0.004088485,0.11599311],"study_design_scores_gemma":[0.0014664571,0.000043773878,0.0033799547,0.00007224588,0.000005865019,0.00000814588,0.000007126419,0.9828145,0.00022073752,0.010832724,0.0008735257,0.0002749808],"about_ca_topic_score_codex":0.00013753916,"about_ca_topic_score_gemma":0.00076665025,"teacher_disagreement_score":0.9178602,"about_ca_system_score_codex":0.00016165125,"about_ca_system_score_gemma":0.000058462912,"threshold_uncertainty_score":0.98211443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066463295,0.00010237146,0.98886853,0.0035676514,0.00013728095,0.00032906208,0.0000014738644,0.00012609625,0.00022122877],"genre_scores_gemma":[0.63734883,9.902154e-7,0.36066246,0.0018952972,0.0000396149,0.00003377937,0.0000051803645,0.0000055488968,0.000008286759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992057,0.000016950722,0.00019708529,0.00023981632,0.00015734737,0.00018312041],"domain_scores_gemma":[0.99894524,0.00018652563,0.00010666509,0.0004256013,0.00028813363,0.00004783554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016515235,0.00008732841,0.00010650187,0.000037446614,0.000070543036,0.000047678048,0.0004352352,0.00009544662,0.0000102769245],"category_scores_gemma":[0.00003324802,0.0000842411,0.000043373875,0.0005979714,0.000011135841,0.00019461213,0.000051330153,0.00008805082,0.000012174012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023376684,0.00014454933,0.00009221563,0.00013284267,0.000017737593,0.0000015366236,0.0011857883,0.30406305,0.00044975852,0.67539585,0.00019743967,0.018295841],"study_design_scores_gemma":[0.0007611283,0.00019107948,0.0005301661,0.0003357298,0.000010862625,0.0000031647546,0.000050623723,0.92978454,0.008082313,0.059784427,0.00026407916,0.00020186351],"about_ca_topic_score_codex":0.00003101889,"about_ca_topic_score_gemma":0.00006845134,"teacher_disagreement_score":0.6307025,"about_ca_system_score_codex":0.000058131824,"about_ca_system_score_gemma":0.00015035675,"threshold_uncertainty_score":0.34352526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003176952,0.000018963763,0.9927552,0.0014838893,0.000344435,0.00040445718,5.1894824e-7,0.00027217454,0.0015434215],"genre_scores_gemma":[0.82443166,0.0000116676765,0.17281356,0.0019198724,0.00030039842,0.000044382614,0.000023467845,0.0000062371314,0.00044874003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906147,0.000025774714,0.00019810555,0.00029665118,0.00015638377,0.00026161055],"domain_scores_gemma":[0.9992867,0.000088212706,0.00006676126,0.00038035426,0.00011142868,0.00006651933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024200078,0.00010244953,0.000108437576,0.000036682093,0.00010193957,0.00012989993,0.00040300415,0.00008042001,0.000015292082],"category_scores_gemma":[0.000010372921,0.00009659026,0.000053298078,0.00027942323,0.00001454899,0.00057173515,0.00003158894,0.000072755276,0.000009723089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006162464,0.000030475208,0.000042477965,0.0000025702375,0.0000051914167,8.1476105e-7,0.000094443014,0.02764505,0.0001294715,0.4623982,0.020667812,0.4889773],"study_design_scores_gemma":[0.00024750666,0.000104583545,0.00090263295,0.000009127935,0.0000028121399,0.0000014706235,0.0000047155086,0.9827192,0.0004864539,0.013932398,0.0014644325,0.00012468286],"about_ca_topic_score_codex":0.0000030733033,"about_ca_topic_score_gemma":0.0000118848575,"teacher_disagreement_score":0.95507413,"about_ca_system_score_codex":0.00003907177,"about_ca_system_score_gemma":0.000025410181,"threshold_uncertainty_score":0.39388365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015503439,0.0004966588,0.9739144,0.0005402533,0.00079567044,0.00027024528,0.0000013753771,0.00044493593,0.008033063],"genre_scores_gemma":[0.86828864,0.00008891217,0.12841314,0.0020283295,0.00038558547,0.000075258795,0.000005024542,0.000034934634,0.00068019895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977436,0.000076335135,0.00042784255,0.0007259914,0.00029008373,0.0007361611],"domain_scores_gemma":[0.99769634,0.0008330287,0.00017090446,0.0009928086,0.00011487655,0.00019205196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036003825,0.00027368136,0.00029261317,0.00010492176,0.0002438726,0.00025899286,0.0014421552,0.00016851009,0.00006603825],"category_scores_gemma":[0.00003385489,0.00025383683,0.00016489465,0.0004548937,0.00006289503,0.0005365398,0.00044174606,0.00020997768,0.000011605604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018531608,0.000040835646,0.000055705827,0.0000070466767,0.00002239554,0.0000052576297,0.00009172391,0.019594219,0.00006301791,0.51112425,0.011426314,0.45755067],"study_design_scores_gemma":[0.0006043445,0.00013935044,0.000020109272,0.00006180706,0.000006109832,0.00001620841,0.00005090329,0.97691953,0.0004208509,0.0094722295,0.0119498465,0.00033871477],"about_ca_topic_score_codex":0.000013182018,"about_ca_topic_score_gemma":0.00013276722,"teacher_disagreement_score":0.9573253,"about_ca_system_score_codex":0.00005656481,"about_ca_system_score_gemma":0.000045337478,"threshold_uncertainty_score":0.99999136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020386023,0.00046326718,0.99090326,0.00033793747,0.0057899277,0.0008372581,0.0000013779267,0.00087686366,0.0005862509],"genre_scores_gemma":[0.55592513,0.000035138313,0.43640935,0.0042237397,0.002836307,0.00037451516,0.000032204025,0.0000790611,0.000084541134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952644,0.00030347236,0.0007735888,0.0015933556,0.0005256226,0.0015395219],"domain_scores_gemma":[0.99518263,0.0014428969,0.0003639636,0.002370567,0.00019725146,0.00044268533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009050902,0.0006728159,0.0006793891,0.0002004122,0.00046587898,0.0005815569,0.0028989818,0.00048644,0.000012980645],"category_scores_gemma":[0.00000928272,0.0006718257,0.00040432802,0.00096898817,0.00012743556,0.00017161308,0.0010734039,0.0005372725,0.000018974786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017584296,0.000096768614,0.000032987846,0.00001717173,0.000039388022,0.000008661218,0.00001529541,0.4992905,1.5789215e-7,0.19167021,0.004412405,0.30439886],"study_design_scores_gemma":[0.0012379624,0.00022532868,0.0002566113,0.0002658619,0.000034783832,0.0000064345886,0.000001667603,0.96276146,0.000013548553,0.0035980898,0.030847698,0.000750568],"about_ca_topic_score_codex":0.0000081097705,"about_ca_topic_score_gemma":0.0000062651793,"teacher_disagreement_score":0.5557213,"about_ca_system_score_codex":0.00013668461,"about_ca_system_score_gemma":0.000033006734,"threshold_uncertainty_score":0.9995733},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007119832,0.000036961515,0.8427282,0.00006372634,0.00016043535,0.15441239,0.0000015504828,0.00032969425,0.0021958372],"genre_scores_gemma":[0.0081991805,0.00000968969,0.19807719,0.000636367,0.00022500813,0.7904979,0.000002986276,0.000024455487,0.0023272391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982477,0.000028607172,0.00031324776,0.0006079363,0.00024559096,0.00055692345],"domain_scores_gemma":[0.9986489,0.00016655757,0.00012543704,0.0007443651,0.0001649665,0.00014977742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019673894,0.00021537564,0.00022780066,0.00005148859,0.0002468149,0.00008427497,0.0010538605,0.00012372585,0.00006139049],"category_scores_gemma":[0.0000135610035,0.00018250624,0.00013087272,0.00043574884,0.00008482625,0.0005219952,0.00040751425,0.00017346951,0.00003884758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003834609,0.0021699916,0.00091778924,0.00011588981,0.00015559261,0.000072274015,0.0021623536,0.066361345,0.0005439114,0.06741885,0.24984963,0.6098489],"study_design_scores_gemma":[0.002038818,0.00049000676,0.00039624222,0.00003087981,0.0000025729887,0.000039402617,0.000014401445,0.6566877,0.00035606758,0.0003999194,0.3392117,0.0003323271],"about_ca_topic_score_codex":0.0000046867626,"about_ca_topic_score_gemma":0.00002123387,"teacher_disagreement_score":0.64465106,"about_ca_system_score_codex":0.00007037211,"about_ca_system_score_gemma":0.00011004183,"threshold_uncertainty_score":0.74423885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053378385,0.00045482587,0.94394904,0.00045358785,0.00018618499,0.00016082554,1.3561223e-7,0.00020117512,0.0012158128],"genre_scores_gemma":[0.9783408,0.00045095297,0.020212075,0.0006475585,0.00005984701,0.0000623529,0.000008538091,0.00001494171,0.00020291624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860275,0.000055691573,0.00025915407,0.0004721888,0.0002422418,0.00036797248],"domain_scores_gemma":[0.99913764,0.00006285496,0.00008836714,0.00054726686,0.000060799935,0.00010305846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019275102,0.00017231608,0.00017443624,0.00009753495,0.00006242359,0.00011881984,0.0005158841,0.0001146381,0.000029834155],"category_scores_gemma":[0.000002713849,0.00014542208,0.000028044322,0.0005201052,0.000057918918,0.0005210127,0.00010221925,0.00015061063,0.000025679272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008105503,0.00025805732,0.0031101147,0.000015144882,0.000026849686,0.00007374175,0.0003710241,0.41891715,0.00017651371,0.31496713,0.0006268436,0.26137638],"study_design_scores_gemma":[0.00274243,0.00033947823,0.011170857,0.00017798116,0.0000081991775,0.000056812998,0.000023578263,0.9800571,0.0008238621,0.002304706,0.001740663,0.0005542935],"about_ca_topic_score_codex":0.000078011835,"about_ca_topic_score_gemma":0.002045067,"teacher_disagreement_score":0.92496246,"about_ca_system_score_codex":0.00013782176,"about_ca_system_score_gemma":0.00008927145,"threshold_uncertainty_score":0.593014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7000678,0.000044362183,0.20460327,0.015958773,0.00031911547,0.034920517,0.0000025402235,0.00035365453,0.043729953],"genre_scores_gemma":[0.976725,0.000003114212,0.011149824,0.0021106028,0.0001306783,0.00741453,3.090118e-7,0.000009663442,0.0024562993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987865,0.000028972541,0.0001950564,0.0002366009,0.00044898168,0.000303899],"domain_scores_gemma":[0.99892694,0.00012858842,0.000062333114,0.00066411786,0.0001414071,0.000076632234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581872,0.00012003194,0.00014392422,0.00003124591,0.00012437785,0.000098606135,0.0007393753,0.00004219015,0.000028848855],"category_scores_gemma":[0.000029846562,0.00007291452,0.000029986571,0.0004172709,0.00006854431,0.00016154017,0.00030897732,0.00012639965,0.00004238898],"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.00001608425,0.00008601533,0.0011111151,0.000022301834,0.00001369498,0.0000015268637,0.0016553233,0.30472034,0.000095844734,0.6409669,0.034724683,0.016586155],"study_design_scores_gemma":[0.003967297,0.01016243,0.057836145,0.0015162044,0.000024726902,0.000101785605,0.0003963196,0.31669277,0.043127704,0.075596444,0.48840138,0.0021767996],"about_ca_topic_score_codex":0.000043336877,"about_ca_topic_score_gemma":0.000015948839,"teacher_disagreement_score":0.56537044,"about_ca_system_score_codex":0.00002282513,"about_ca_system_score_gemma":0.000046321362,"threshold_uncertainty_score":0.2973368},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038147323,0.000022326112,0.95640683,0.0014058843,0.00028908913,0.0010683702,0.0000020850662,0.00008958361,0.0025685362],"genre_scores_gemma":[0.972796,0.000005197561,0.024383927,0.0018805821,0.000074067684,0.00020668894,0.0000072488,0.00000850354,0.0006377431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989104,0.000048403992,0.00027399152,0.00031821596,0.00018036507,0.00026861174],"domain_scores_gemma":[0.99919367,0.00031432364,0.00006112523,0.00032045736,0.000039368697,0.0000710444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039400056,0.00011595102,0.00020874821,0.000092436116,0.00004743099,0.00008612306,0.00033688833,0.00005856772,0.0000209578],"category_scores_gemma":[0.000039603125,0.00009692604,0.00005303047,0.00015169418,0.0000146168,0.00029298684,0.00005996897,0.00008082916,0.00004771743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006705862,0.00033606766,0.00010867617,0.000014231831,0.000025001751,0.00003747369,0.00090543256,0.40418768,0.00019722372,0.5483194,0.0042279046,0.040970344],"study_design_scores_gemma":[0.025374006,0.0009299995,0.000995641,0.000044976285,0.00000549819,0.000005280292,0.00003916183,0.95460737,0.00084849406,0.016054427,0.00083341973,0.0002617003],"about_ca_topic_score_codex":0.000046002242,"about_ca_topic_score_gemma":0.00036702963,"teacher_disagreement_score":0.9346487,"about_ca_system_score_codex":0.00008663143,"about_ca_system_score_gemma":0.0000611348,"threshold_uncertainty_score":0.3952529},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066451705,0.00022941135,0.95746076,0.012669857,0.0009065758,0.0005407223,0.00006101045,0.0002966844,0.02717047],"genre_scores_gemma":[0.8651089,0.000091252594,0.13155316,0.0012596346,0.0003280066,0.00052042207,0.00035015814,0.000023635283,0.0007648372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819505,0.0001242021,0.00051358173,0.00043858433,0.00036976612,0.00035878422],"domain_scores_gemma":[0.9963234,0.0006750468,0.0003005797,0.0019154645,0.00070337456,0.00008213982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003606906,0.0002290763,0.00019163989,0.00016460424,0.00044917632,0.00043357647,0.0038654364,0.00012894848,0.0000709318],"category_scores_gemma":[0.000046622714,0.0002514981,0.00015285602,0.0003082912,0.00012793907,0.00037360698,0.00026457672,0.00037002107,0.000074840624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027006958,0.0003750258,0.0002549278,0.0000037759703,0.000037755286,0.0000017600177,0.00004487252,0.02263895,0.00056166836,0.9503874,0.013695139,0.011971684],"study_design_scores_gemma":[0.0005828248,0.00007543023,0.0004709888,0.00010344312,0.000007923087,0.000004346372,0.000009825728,0.96851134,0.00021141546,0.008521653,0.02123877,0.000262059],"about_ca_topic_score_codex":0.00006744907,"about_ca_topic_score_gemma":0.00034731318,"teacher_disagreement_score":0.94587237,"about_ca_system_score_codex":0.00020171494,"about_ca_system_score_gemma":0.00020764387,"threshold_uncertainty_score":0.99999374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005691504,0.0007183315,0.9384058,0.00044795786,0.00029611433,0.03739573,0.0000011689551,0.00087931816,0.016164051],"genre_scores_gemma":[0.8096957,0.00006558682,0.050587486,0.0017460424,0.0002219803,0.13385916,0.000005661124,0.000056845598,0.00376153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780136,0.00013390265,0.0004102144,0.00065882085,0.00033604377,0.0006596598],"domain_scores_gemma":[0.99842244,0.0001330813,0.000106503576,0.001121755,0.000061706996,0.00015451694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003408452,0.00023822692,0.00027842345,0.00011377757,0.00007394917,0.00020214274,0.0013159527,0.00016425591,0.0006790457],"category_scores_gemma":[0.000007944357,0.00021260761,0.0000785803,0.0009963472,0.000055408113,0.00042371775,0.00023086493,0.00034757575,0.00025285536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022698589,0.00069255783,0.0025283154,0.000044679753,0.000009634863,0.00011200662,0.00020371273,0.053438764,0.00007964984,0.0079269195,0.020912323,0.91402876],"study_design_scores_gemma":[0.0008628028,0.00023346233,0.00040002345,0.00008331196,0.000001070422,0.0000045492948,0.0000048773654,0.9752408,0.0004106578,0.00008743992,0.022384364,0.00028660154],"about_ca_topic_score_codex":0.000005465439,"about_ca_topic_score_gemma":0.00005887318,"teacher_disagreement_score":0.9218021,"about_ca_system_score_codex":0.000090381094,"about_ca_system_score_gemma":0.000041359603,"threshold_uncertainty_score":0.86698866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52559036,0.009075202,0.44626996,0.013928466,0.0014336427,0.00096137903,0.0000045884944,0.00017517139,0.0025612337],"genre_scores_gemma":[0.9858464,0.006462132,0.007115657,0.00019755383,0.00028971853,0.000031743464,0.000020737118,0.000015573401,0.00002049288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983553,0.000420292,0.00038844222,0.00030659098,0.00019867661,0.000330687],"domain_scores_gemma":[0.99692154,0.00067215314,0.00027422394,0.0019127657,0.00010167579,0.00011761665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008486613,0.00016081327,0.00023091731,0.00014567435,0.0005114476,0.00050597254,0.002604969,0.00007017024,0.0000068743075],"category_scores_gemma":[0.000010110836,0.00013147686,0.000021149535,0.0005074067,0.00012029767,0.00090426713,0.0010035377,0.0007529787,0.000005668975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017803028,0.00017258365,0.018477095,0.000012375901,0.000053449374,0.000066093875,0.0011192928,0.0014075761,0.0002565315,0.029154127,0.001388316,0.9478748],"study_design_scores_gemma":[0.00043804978,0.00012935585,0.00942672,0.00060973724,0.000009173395,0.00037460114,0.00016724487,0.9766401,0.000020603928,0.00056883256,0.011358752,0.0002568083],"about_ca_topic_score_codex":0.000020371737,"about_ca_topic_score_gemma":0.00013679864,"teacher_disagreement_score":0.97523254,"about_ca_system_score_codex":0.00005781965,"about_ca_system_score_gemma":0.000040350347,"threshold_uncertainty_score":0.5361471},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005064786,0.00002580536,0.92479634,0.00031301467,0.0000522949,0.07255937,9.481004e-7,0.00031791738,0.0014278301],"genre_scores_gemma":[0.19709924,0.0000051589986,0.5049237,0.0011436928,0.00023208602,0.29566324,0.0000054024104,0.00007039332,0.0008570805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979702,0.000050998806,0.00025423564,0.00078239664,0.00027866065,0.00066349993],"domain_scores_gemma":[0.99848276,0.00012741625,0.00014043048,0.0005490085,0.00053377706,0.00016662711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023819653,0.00032823283,0.00032000337,0.00006386107,0.00030041958,0.00029304222,0.0006314583,0.00010190947,0.0000106539355],"category_scores_gemma":[0.000011771802,0.00021059618,0.00005179815,0.0009248384,0.00011103576,0.00064111565,0.00011100095,0.00029331876,0.00000972696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025742438,0.00071129156,0.0012733724,0.0000911472,0.000412142,0.00012614124,0.0033120536,0.8841125,0.00012889304,0.07103447,0.0020907035,0.034133088],"study_design_scores_gemma":[0.011362837,0.010790988,0.0006317468,0.0005859532,0.000032571897,0.0001999755,0.00019967183,0.9582892,0.0040219342,0.0014227234,0.011196678,0.0012657421],"about_ca_topic_score_codex":0.00002006908,"about_ca_topic_score_gemma":0.0007606949,"teacher_disagreement_score":0.4198726,"about_ca_system_score_codex":0.0001434395,"about_ca_system_score_gemma":0.00038718345,"threshold_uncertainty_score":0.8587863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003131758,0.0001563689,0.9930624,0.00058481575,0.00067711715,0.00088790205,0.00000252634,0.00048587707,0.0010112491],"genre_scores_gemma":[0.56928915,0.00000893273,0.42850864,0.0014580464,0.00029873755,0.0000591703,0.0000036093877,0.000020994852,0.00035271564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968168,0.000054656986,0.00060241757,0.001004556,0.00040080972,0.00112077],"domain_scores_gemma":[0.99774474,0.0005774745,0.00019515598,0.0009397089,0.00016834386,0.00037459919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009378385,0.000367154,0.00047262787,0.0003216291,0.00030601028,0.00041411075,0.0015956839,0.00019599419,0.000019469058],"category_scores_gemma":[0.00011351907,0.00034780975,0.00021435916,0.0020719536,0.000026686082,0.00056890916,0.0003319176,0.00030420398,0.000018991554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031525262,0.00033595896,0.00025269264,0.000011177453,0.00008001605,0.000024083567,0.0007428885,0.051791016,0.0006309411,0.1725165,0.004225283,0.7693579],"study_design_scores_gemma":[0.0010668564,0.0001899044,0.001111093,0.000042548225,0.00001964985,0.000038463168,0.000032807195,0.99531657,0.0003627487,0.00008567601,0.0012749106,0.0004587519],"about_ca_topic_score_codex":0.000059367278,"about_ca_topic_score_gemma":0.0000655304,"teacher_disagreement_score":0.94352555,"about_ca_system_score_codex":0.00015771168,"about_ca_system_score_gemma":0.00008450118,"threshold_uncertainty_score":0.99989736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06139399,0.0003797014,0.93318623,0.00023831034,0.0008685176,0.0010728568,0.0000011947088,0.00041591123,0.0024432759],"genre_scores_gemma":[0.98235714,0.00003996109,0.015480557,0.0010724071,0.00028137412,0.00042026397,0.000003453391,0.0000305978,0.0003142261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977768,0.000037863672,0.00037134634,0.0007612534,0.00031772835,0.00073499844],"domain_scores_gemma":[0.9983843,0.00030538658,0.00014002135,0.00088238006,0.000102351216,0.00018555475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005016735,0.00025846777,0.00027732004,0.00007360255,0.00023635534,0.0004661555,0.0017012068,0.00013528625,0.000017330409],"category_scores_gemma":[0.000015962165,0.00022095953,0.0001403065,0.0005137038,0.000048038753,0.00021875322,0.0005443855,0.00022048426,0.00003777599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014888457,0.000116793286,0.000028940422,0.000007793205,0.000012245968,0.0000064826672,0.00013913536,0.8873943,0.000013311851,0.048828315,0.0007557946,0.062681995],"study_design_scores_gemma":[0.0010642246,0.000292602,0.00013559413,0.00007510766,0.0000065419654,0.0000073134515,0.000020232752,0.9942652,0.00050650566,0.0011871958,0.0021177253,0.00032178158],"about_ca_topic_score_codex":0.000009178925,"about_ca_topic_score_gemma":0.000023083547,"teacher_disagreement_score":0.92096317,"about_ca_system_score_codex":0.00013796323,"about_ca_system_score_gemma":0.00007944114,"threshold_uncertainty_score":0.9010468},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69268286,0.0000034259613,0.29932132,0.0015204387,0.00013667128,0.00027478297,9.942967e-7,0.000058824957,0.0060007023],"genre_scores_gemma":[0.9958025,3.349683e-7,0.002006104,0.0014435931,0.000058953472,0.000015304195,3.8544272e-7,0.0000062194586,0.0006665784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878013,0.00012795108,0.00021996206,0.00025439562,0.00033333886,0.0002842024],"domain_scores_gemma":[0.9979878,0.0008994606,0.00008553637,0.0009357125,0.000054812383,0.00003668454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055748236,0.000109815664,0.00010900504,0.000029352284,0.00016925456,0.00016693767,0.0012413396,0.000034780056,0.00002589049],"category_scores_gemma":[0.00004741071,0.000055235792,0.000048054142,0.00047766726,0.00006428916,0.000121495985,0.00029993217,0.0001601812,0.000050486655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003052175,0.000049895538,0.00042307796,0.0000017693878,0.0000038713506,0.0000018169551,0.00036031136,0.032980952,0.00026326018,0.95310795,0.00961165,0.003192366],"study_design_scores_gemma":[0.00028989045,0.00019344887,0.02986534,0.00007067615,0.000008389595,0.000011692913,0.00009473313,0.944751,0.013367726,0.006990514,0.004012826,0.00034371976],"about_ca_topic_score_codex":0.0013771795,"about_ca_topic_score_gemma":0.0003274828,"teacher_disagreement_score":0.94611746,"about_ca_system_score_codex":0.000031519012,"about_ca_system_score_gemma":0.000018591825,"threshold_uncertainty_score":0.23067385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27210653,0.00014048057,0.5100226,0.0003970622,0.001551232,0.21133655,8.178684e-7,0.0004542385,0.003990499],"genre_scores_gemma":[0.88887,5.766411e-7,0.022699958,0.00040467555,0.00042971407,0.08713437,4.582631e-7,0.00002318399,0.0004370871],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983101,0.00010590966,0.0003614613,0.00024444828,0.00033858704,0.00063948013],"domain_scores_gemma":[0.9983184,0.00027994742,0.00031444902,0.0009040325,0.00011460337,0.00006857064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007758735,0.00017219031,0.00016552527,0.000015586902,0.00047233695,0.00017498547,0.0013103549,0.00006977516,0.000018032788],"category_scores_gemma":[0.000038709306,0.00008987767,0.00009894509,0.00047931456,0.0000657027,0.00084437645,0.00052175694,0.00018674716,0.0000049478826],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007838325,0.00033847048,0.8195345,0.00016110788,0.00012275878,7.658342e-7,0.003991004,0.008718135,0.0006946835,0.019666271,0.0490097,0.09768421],"study_design_scores_gemma":[0.0012186603,0.0001559952,0.13418372,0.00037014633,0.000022818802,0.000016832728,0.00014154533,0.84025913,0.003705954,0.0002218695,0.019317457,0.00038586816],"about_ca_topic_score_codex":0.0000033724295,"about_ca_topic_score_gemma":0.000006280701,"teacher_disagreement_score":0.831541,"about_ca_system_score_codex":0.000050928116,"about_ca_system_score_gemma":0.000070179456,"threshold_uncertainty_score":0.3665105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023178566,0.0057704723,0.9540327,0.00010692688,0.0002702052,0.00020492013,2.0019122e-7,0.00031617368,0.0161198],"genre_scores_gemma":[0.8991969,0.0001869293,0.09804393,0.000379605,0.00021778951,0.00005587982,0.0000025758125,0.000012025916,0.001904338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989629,0.00003654764,0.00019856059,0.00036338833,0.0001311477,0.00030745676],"domain_scores_gemma":[0.99931693,0.000113053124,0.00005426033,0.00040963627,0.000037325244,0.000068819965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019168234,0.00013105251,0.0001321941,0.000035397636,0.0001037461,0.00022729946,0.00040611773,0.000072769144,0.000035997327],"category_scores_gemma":[0.000005389289,0.00010754399,0.00003287159,0.00026708326,0.000040143113,0.0003294286,0.0002811577,0.00016262266,0.00001887793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027106714,0.0000470498,0.0012959245,0.000005487437,0.0000075379344,0.00002196112,0.00015851356,0.010692371,0.00013391406,0.08890394,0.018708343,0.8800222],"study_design_scores_gemma":[0.0002087291,0.000095943644,0.0014650216,0.000020445565,0.0000028315271,0.000027835684,0.00002411209,0.94637746,0.00014824832,0.003035254,0.048374746,0.00021936519],"about_ca_topic_score_codex":0.00003153353,"about_ca_topic_score_gemma":0.00014369725,"teacher_disagreement_score":0.9356851,"about_ca_system_score_codex":0.000020253568,"about_ca_system_score_gemma":0.000015170592,"threshold_uncertainty_score":0.43855166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007219151,0.0026983435,0.9853804,0.0019608687,0.00056176994,0.0013068196,0.0000030128524,0.00027258124,0.00059702445],"genre_scores_gemma":[0.69299424,0.000094777926,0.28442436,0.019830178,0.0007489163,0.0014762522,0.000031842555,0.00006693244,0.00033248463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997606,0.00007290288,0.0003884566,0.0007609619,0.00025180753,0.00091986364],"domain_scores_gemma":[0.99829936,0.00035088748,0.00010425683,0.0010251268,0.00007211937,0.00014823422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042612362,0.00030887203,0.00033745196,0.00008953861,0.00012062774,0.00028575544,0.0012516835,0.00019855202,0.00001580376],"category_scores_gemma":[0.000011491428,0.0002682185,0.00013429057,0.0012992715,0.00003002923,0.00054118084,0.00030643962,0.00037287,0.000017532197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050258855,0.00008923522,0.00010466818,0.00001931691,0.000008544372,0.000013806362,0.00014999283,0.96189153,0.000014558084,0.007892062,0.0012788757,0.028487122],"study_design_scores_gemma":[0.0036535456,0.00046120348,0.0011465091,0.00023565112,0.000013873489,0.000016690386,0.00003238464,0.90967983,0.00012746533,0.03637862,0.047442228,0.00081202463],"about_ca_topic_score_codex":0.0000321395,"about_ca_topic_score_gemma":0.0025150042,"teacher_disagreement_score":0.70095605,"about_ca_system_score_codex":0.00012418961,"about_ca_system_score_gemma":0.00018179425,"threshold_uncertainty_score":0.999977},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008957644,0.00011955801,0.9860308,0.00015236253,0.0011170479,0.0012860128,0.0000051459488,0.00035274308,0.0019786835],"genre_scores_gemma":[0.60198706,0.00002177864,0.39301947,0.0005481567,0.00020609856,0.00034113642,0.0000029957857,0.000045977267,0.003827367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720645,0.000059796756,0.00048449982,0.001006597,0.000250285,0.0009923943],"domain_scores_gemma":[0.9977169,0.00015827306,0.00013078455,0.0012536035,0.00026427224,0.00047618878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004114823,0.00039720882,0.0003942765,0.000096016476,0.00019880362,0.00017772452,0.001964859,0.0002141474,0.00008542929],"category_scores_gemma":[0.000037916736,0.0003586442,0.00015568412,0.00044544425,0.000060243605,0.00050872774,0.000831307,0.0002520112,0.00047531925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007380041,0.009595051,0.005615074,0.0004821088,0.000846332,0.00026353967,0.026993224,0.029482858,0.013182557,0.30893266,0.09938449,0.5044841],"study_design_scores_gemma":[0.0008689873,0.00045264873,0.00008578824,0.000110425775,0.000013317386,0.000009366346,0.00015783995,0.98844177,0.0078879045,0.000110783876,0.0013308196,0.0005303338],"about_ca_topic_score_codex":0.00027783262,"about_ca_topic_score_gemma":0.0002850486,"teacher_disagreement_score":0.9589589,"about_ca_system_score_codex":0.00006918323,"about_ca_system_score_gemma":0.000047602694,"threshold_uncertainty_score":0.9998866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3962563,0.0003347001,0.597351,0.000032990778,0.00007910053,0.00008208095,7.322593e-8,0.00005260816,0.0058111288],"genre_scores_gemma":[0.9851403,0.00007011131,0.014589821,0.000049420836,0.000041384195,0.000013174881,5.9426765e-7,0.0000053006056,0.00008985717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905187,0.00003544899,0.00025058404,0.00025784035,0.00014111996,0.00026311292],"domain_scores_gemma":[0.9994011,0.00006720962,0.00005528407,0.00040675935,0.000042418204,0.000027229062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032282283,0.000092346134,0.00016258094,0.000062653446,0.000028819153,0.000024642915,0.00043525043,0.00006209373,0.000009882262],"category_scores_gemma":[0.000004848129,0.000086096654,0.0000347801,0.00043633452,0.000020014626,0.00037532568,0.00016535926,0.00013572685,0.000004439775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004515034,0.00004095183,0.0052172085,0.000005141801,0.0000013463642,0.0000019673423,0.00002806451,0.95871615,0.000019003783,0.007207372,0.00008227605,0.028676024],"study_design_scores_gemma":[0.00022193388,0.000037619073,0.004394165,0.000023836737,8.48178e-7,0.0000030021404,0.0000032764137,0.9943658,0.00008188046,0.00070236763,0.000065095235,0.00010015223],"about_ca_topic_score_codex":0.00010814079,"about_ca_topic_score_gemma":0.00037987862,"teacher_disagreement_score":0.58888406,"about_ca_system_score_codex":0.0000324336,"about_ca_system_score_gemma":0.00002757549,"threshold_uncertainty_score":0.35109195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050211777,0.00021742137,0.7669467,0.013382915,0.00011553927,0.0009779008,6.7096016e-7,0.0007085008,0.21262923],"genre_scores_gemma":[0.78926426,0.000005383204,0.18924884,0.0013581258,0.00034361565,0.00026469296,0.0000037012583,0.000030884894,0.019480474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985154,0.000055188346,0.0001897121,0.0004316466,0.00038214232,0.0004258693],"domain_scores_gemma":[0.99879795,0.00007919907,0.0000884272,0.0009035047,0.00007466436,0.000056269528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026030958,0.00017237444,0.00013440495,0.000033407534,0.00016734416,0.0003173153,0.0014171205,0.00005434654,0.00006157188],"category_scores_gemma":[0.0000014470527,0.00009011175,0.00004128375,0.0004857699,0.00007636614,0.000383656,0.0002923257,0.00018011163,0.0001840428],"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.000008173473,0.00016286412,0.0035980742,0.000029041583,0.000041303374,0.000037505215,0.00053791027,0.0069132214,0.00033160503,0.7024251,0.22147733,0.064437844],"study_design_scores_gemma":[0.0031462156,0.0008431885,0.023961842,0.00022170671,0.000069864676,0.00044716336,0.00014089455,0.38680965,0.0030037705,0.11483092,0.46417087,0.0023538924],"about_ca_topic_score_codex":0.0003980415,"about_ca_topic_score_gemma":0.00063302723,"teacher_disagreement_score":0.7842431,"about_ca_system_score_codex":0.00003399755,"about_ca_system_score_gemma":0.00006472506,"threshold_uncertainty_score":0.36746505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011072782,0.0004483323,0.9895175,0.000077973076,0.004705817,0.00076912914,0.000015656475,0.0005428892,0.0028154287],"genre_scores_gemma":[0.92855334,0.0008026813,0.06939439,0.0001368892,0.00039985753,0.0003304552,0.000049966333,0.000052716445,0.0002796796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9808561,0.01640601,0.0009440012,0.0006658638,0.00041980148,0.00070822414],"domain_scores_gemma":[0.98512137,0.0050098044,0.00046441104,0.008491117,0.0006517287,0.00026158607],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.019717395,0.00037544538,0.00059139257,0.00015130387,0.00057662826,0.00029000727,0.009047673,0.00029320034,0.00006209934],"category_scores_gemma":[0.0004184489,0.00038770091,0.00014288805,0.0014930636,0.00036371363,0.00082518026,0.0012854714,0.0005380022,0.00022263417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001833044,0.0038979147,0.03794767,0.00004078562,0.0011386602,0.000058794656,0.010332365,0.0058988263,0.0016335129,0.517543,0.130581,0.29074416],"study_design_scores_gemma":[0.0025984778,0.00057778007,0.22630824,0.00020696517,0.00012489189,0.00005907693,0.000062930645,0.7355196,0.003668426,0.013385273,0.014065852,0.0034224754],"about_ca_topic_score_codex":0.0023979393,"about_ca_topic_score_gemma":0.001518991,"teacher_disagreement_score":0.92744607,"about_ca_system_score_codex":0.00012797334,"about_ca_system_score_gemma":0.00030095983,"threshold_uncertainty_score":0.9998575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08903998,0.0000766909,0.90947634,0.00020148774,0.00018693895,0.0005627424,0.0000011125484,0.00012192027,0.0003327852],"genre_scores_gemma":[0.95965,0.000009581549,0.040138878,0.00008240936,0.00005202161,0.000025481935,0.000009709671,0.0000024479523,0.00002950103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986752,0.00016726032,0.00037881013,0.00034349246,0.00015565801,0.0002795532],"domain_scores_gemma":[0.9991327,0.00015358231,0.00011010619,0.00045934608,0.00008904406,0.000055207525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008313051,0.000110943096,0.00022615588,0.000025796468,0.000041688763,0.000029222141,0.00032667548,0.00008486883,0.000010058652],"category_scores_gemma":[0.00012325286,0.00009736392,0.000065059205,0.000597965,0.00003071794,0.0002942892,0.00006611295,0.00013179374,0.000005355407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041387184,0.0018684879,0.025438007,0.000041954496,0.000022051721,0.00001557927,0.00076619256,0.3490727,0.0007667939,0.1710975,0.0025760215,0.44792086],"study_design_scores_gemma":[0.0025703362,0.0001296582,0.07623089,0.000030730567,0.0000024624972,0.000003300317,0.0000055190453,0.91373587,0.0004495196,0.006394561,0.00031654947,0.0001306289],"about_ca_topic_score_codex":0.00010077583,"about_ca_topic_score_gemma":0.00022407403,"teacher_disagreement_score":0.87061,"about_ca_system_score_codex":0.00008476296,"about_ca_system_score_gemma":0.000041361895,"threshold_uncertainty_score":0.39703852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10471049,0.00015158755,0.8931741,0.00003432951,0.00022364309,0.00040713974,4.242261e-7,0.00023353164,0.0010647416],"genre_scores_gemma":[0.86653596,0.000047398513,0.13251746,0.00037436376,0.000038476835,0.00007516422,0.0000017082153,0.000025323441,0.00038414903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977956,0.000085478954,0.000369842,0.00071688363,0.00026875146,0.00076344464],"domain_scores_gemma":[0.9986965,0.000044443488,0.00010911225,0.0008777661,0.00008000997,0.00019217069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027945612,0.00029708832,0.0003032132,0.00011491766,0.000074285446,0.000097556636,0.0011256814,0.00011481966,0.000112079266],"category_scores_gemma":[0.0000032392386,0.0002314354,0.00005924491,0.0005221529,0.00008687371,0.00038191502,0.00043839874,0.00027363884,0.000041789735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011685251,0.004084369,0.07772492,0.00007047237,0.00040965626,0.0065169367,0.009622186,0.80952525,0.00093393103,0.017081914,0.0015037786,0.07135805],"study_design_scores_gemma":[0.0010935,0.0003424916,0.0030228626,0.000055321998,0.0000046991236,0.000119647695,0.00006142853,0.9944798,0.00038058925,0.000007738262,0.00007777122,0.0003541483],"about_ca_topic_score_codex":0.00021280618,"about_ca_topic_score_gemma":0.0007037425,"teacher_disagreement_score":0.7618255,"about_ca_system_score_codex":0.00006921424,"about_ca_system_score_gemma":0.000047115776,"threshold_uncertainty_score":0.9437662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051767133,0.0046534534,0.56338894,0.003825785,0.0067318073,0.003457146,0.000050618306,0.0035796906,0.3625454],"genre_scores_gemma":[0.7221528,0.0026891495,0.12664774,0.014798792,0.004857458,0.00063013023,0.00016313278,0.00024710456,0.12781367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699414,0.00013600918,0.0004959906,0.00088772963,0.00045135917,0.0010347844],"domain_scores_gemma":[0.998042,0.00021541142,0.00015550338,0.0011870828,0.00013982752,0.0002602118],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004255904,0.0003751958,0.0004150603,0.00015651881,0.00012759495,0.00025068718,0.0016963369,0.00026581084,0.0046286043],"category_scores_gemma":[0.000022554512,0.00036480292,0.00012456872,0.00078423385,0.00007304938,0.00077640085,0.0007559875,0.0005418082,0.001933693],"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.000030944066,0.00019810005,0.000525849,0.000025870451,0.00002202019,0.00009127172,0.00040377057,0.0070875296,0.000029799707,0.0022579357,0.3450493,0.64427763],"study_design_scores_gemma":[0.00046377728,0.0001142771,0.0012952143,0.000062238374,0.000002938939,0.000019404359,0.000007091502,0.5863434,0.000017306525,0.00002676789,0.41128767,0.00035988903],"about_ca_topic_score_codex":0.000114703565,"about_ca_topic_score_gemma":0.0028612625,"teacher_disagreement_score":0.67038566,"about_ca_system_score_codex":0.00022230051,"about_ca_system_score_gemma":0.00012147112,"threshold_uncertainty_score":0.9998804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035541564,0.001125235,0.95224714,0.0000674997,0.000724816,0.0004889186,4.778704e-7,0.00029383408,0.009510507],"genre_scores_gemma":[0.9599938,0.00009862158,0.038162712,0.0012237786,0.00004791566,0.00014580211,0.0000029401992,0.000022074448,0.0003023574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801236,0.00017019421,0.0003525136,0.00058243,0.00026967752,0.0006128061],"domain_scores_gemma":[0.99859965,0.00016184626,0.000083891944,0.0009446567,0.000050315528,0.00015966881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037101086,0.00023634832,0.00025776934,0.00011980901,0.000068752386,0.00014679017,0.0009294287,0.0001742409,0.0003386763],"category_scores_gemma":[0.0000135435985,0.00021558552,0.000073521864,0.0009721843,0.000054441214,0.00029921115,0.0001295628,0.00036511448,0.00004704035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001601875,0.00013850056,0.007911952,0.000014736598,0.000013019398,0.00008587031,0.00013823075,0.57028764,0.00009313875,0.09569662,0.0075033084,0.31810093],"study_design_scores_gemma":[0.00090174016,0.00011965889,0.0026176192,0.0000276754,0.0000026446344,0.000012359572,0.000017002463,0.9449125,0.00069961685,0.0022012491,0.048090294,0.00039763402],"about_ca_topic_score_codex":0.0000068245167,"about_ca_topic_score_gemma":0.000100393685,"teacher_disagreement_score":0.92445225,"about_ca_system_score_codex":0.000104983985,"about_ca_system_score_gemma":0.00013367445,"threshold_uncertainty_score":0.8791322},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020670202,0.000028373104,0.97159517,0.0000540421,0.00007119401,0.006992685,0.0000014696627,0.00013072057,0.00045617155],"genre_scores_gemma":[0.8519491,9.2601357e-7,0.14610335,0.00011858721,0.00007989574,0.0016114017,0.0000047835874,0.000011034685,0.00012090776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815303,0.000042261992,0.00053770025,0.00044644464,0.0002522194,0.0005683689],"domain_scores_gemma":[0.9981318,0.000650141,0.00022666626,0.00071450416,0.00015092577,0.00012595538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010299796,0.00016644236,0.0004000125,0.00020978769,0.00009105906,0.00008050792,0.0008825333,0.0000907051,0.000018262179],"category_scores_gemma":[0.000037172485,0.00013828807,0.0002748626,0.0014187454,0.000058093457,0.0001505519,0.00024290905,0.00014720052,0.0000013886113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075759745,0.000097491364,0.0043072635,0.000022456064,0.00040645842,0.000005708886,0.0005227597,0.11452075,0.0002461814,0.017022103,0.00008234031,0.86269075],"study_design_scores_gemma":[0.00039384802,0.00011389115,0.008716056,0.00002619928,0.00007035115,0.0000026804603,0.000023036579,0.9893439,0.0007063631,0.00008381459,0.00034925164,0.00017062461],"about_ca_topic_score_codex":0.000016690032,"about_ca_topic_score_gemma":0.0002937973,"teacher_disagreement_score":0.87482315,"about_ca_system_score_codex":0.000036752346,"about_ca_system_score_gemma":0.000025463085,"threshold_uncertainty_score":0.5639224},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044145558,0.000007801908,0.9338051,0.0009742301,0.00086529367,0.00015759269,2.5968575e-7,0.00031076357,0.019733418],"genre_scores_gemma":[0.8412355,6.047512e-7,0.15705192,0.0009331657,0.00016100894,0.00002598995,0.0000010413172,0.00000696282,0.0005837823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909633,0.000026600204,0.00013624849,0.00029721396,0.00019093484,0.0002526826],"domain_scores_gemma":[0.99889916,0.0001615982,0.00003944804,0.0007367609,0.000051015042,0.000112033325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024610982,0.0000985592,0.000114287424,0.0000436011,0.0000722695,0.0003938412,0.0016521652,0.000070610906,0.00052872556],"category_scores_gemma":[0.000026799253,0.000079059886,0.00005646686,0.00025380056,0.00004051197,0.0005396793,0.00028146495,0.0002290051,0.00015119671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016154718,0.000559647,0.00493776,0.000027461176,0.00005289952,0.00015270538,0.0001892846,0.101559535,0.014251125,0.33628812,0.10160071,0.4402192],"study_design_scores_gemma":[0.0015037879,0.00004058617,0.0009131281,0.000003240048,0.000002614259,0.000007017501,8.228674e-7,0.9645297,0.0101657305,0.00049201184,0.0221582,0.0001831427],"about_ca_topic_score_codex":0.000024982472,"about_ca_topic_score_gemma":0.000048497466,"teacher_disagreement_score":0.8629702,"about_ca_system_score_codex":0.0000062451845,"about_ca_system_score_gemma":0.000071935734,"threshold_uncertainty_score":0.57891744},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011931145,0.00001306938,0.9641513,0.00063647487,0.00011115378,0.020951796,0.0000019941128,0.000108331296,0.0020947028],"genre_scores_gemma":[0.52875763,6.284522e-7,0.41023844,0.0017689955,0.00046235172,0.058422748,0.000060077557,0.000022051898,0.0002670795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984742,0.00009437089,0.00028233766,0.00046599438,0.00037188816,0.00031123287],"domain_scores_gemma":[0.99889463,0.00015465375,0.0000869107,0.0007138111,0.000109127395,0.000040880055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000770795,0.00012762376,0.00013578996,0.00006371185,0.000055720553,0.0003231129,0.0007497944,0.00011192101,0.000037294394],"category_scores_gemma":[0.00001910863,0.000115920244,0.000027404842,0.00047643777,0.000011423668,0.0014220111,0.00010336867,0.00011211198,0.0000187628],"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.000024892703,0.0002616017,0.0026693994,0.000050226223,0.000003487036,0.0000030656201,0.00019891276,0.06920822,0.00013452907,0.8971482,0.0011945545,0.029102918],"study_design_scores_gemma":[0.00036949938,0.000107485226,0.012056527,0.00005666125,0.0000024102808,0.0000019985496,0.000010687213,0.69369197,0.00024107115,0.29223666,0.0010688497,0.00015619789],"about_ca_topic_score_codex":0.00031928133,"about_ca_topic_score_gemma":0.0017736611,"teacher_disagreement_score":0.62448376,"about_ca_system_score_codex":0.00007030776,"about_ca_system_score_gemma":0.000087436965,"threshold_uncertainty_score":0.47270903},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31185734,0.0001924882,0.68681777,0.000010176534,0.00026550223,0.00017655145,1.554984e-7,0.00006922838,0.0006107847],"genre_scores_gemma":[0.982053,0.000009702141,0.017730724,0.000030856816,0.00014010453,0.000014609686,6.63151e-7,0.00000616862,0.000014163799],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988045,0.00008042802,0.00034002846,0.0002653232,0.00013379498,0.0003759323],"domain_scores_gemma":[0.99928737,0.00012751023,0.00011078579,0.000352594,0.00003105013,0.00009068258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012374282,0.00010194451,0.00016392014,0.000057024088,0.000054937314,0.000041707433,0.00023448467,0.00008479931,0.000010656559],"category_scores_gemma":[0.000040128387,0.00009546446,0.000025182371,0.0003329723,0.000033048218,0.0009371397,0.00036196935,0.0001711755,9.730926e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014936841,0.00023681406,0.5736178,0.00007507082,0.000016194219,0.0000016796281,0.0015257226,0.02097778,0.004545819,0.013291556,0.00003890318,0.38565773],"study_design_scores_gemma":[0.00019697058,0.000029042776,0.08029893,0.000032091313,0.0000030573747,0.0000050173976,0.000028124767,0.9185646,0.0006732706,0.000085719774,0.0000050682593,0.0000781078],"about_ca_topic_score_codex":0.0003255382,"about_ca_topic_score_gemma":0.00007729391,"teacher_disagreement_score":0.8975868,"about_ca_system_score_codex":0.0000479604,"about_ca_system_score_gemma":0.000014940116,"threshold_uncertainty_score":0.38929275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71168065,0.0000054644643,0.28634226,0.000027285674,0.000007684412,0.0006596288,1.3452332e-7,0.000031169853,0.0012457133],"genre_scores_gemma":[0.9883337,5.36271e-7,0.011557245,0.00006456147,0.000009801192,0.000011673037,3.9470976e-7,0.000004001002,0.000018067585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990826,0.0000607231,0.0001782091,0.00033356057,0.00019156448,0.0001533049],"domain_scores_gemma":[0.99938047,0.000113855705,0.000106587446,0.000258091,0.00010534729,0.000035659155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008533114,0.00010923171,0.00018157861,0.00007679823,0.00003457117,0.000030399793,0.00015926875,0.000032171058,4.8792253e-7],"category_scores_gemma":[0.000005396345,0.00008788812,0.000008834803,0.00027466659,0.000017535081,0.00043913446,0.000073736344,0.00010150994,2.7030188e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006705803,0.00038543245,0.0021766783,0.0000023803186,0.000015946785,0.0000101287405,0.009780092,0.9695564,0.00018107796,0.0022686752,0.0000025677984,0.015553579],"study_design_scores_gemma":[0.00085587497,0.00070957944,0.05930184,0.000016685355,0.000004902574,0.0000026104444,0.0009530041,0.93723,0.00019031418,0.0006370128,7.410245e-7,0.000097444936],"about_ca_topic_score_codex":0.00008744092,"about_ca_topic_score_gemma":0.00009875664,"teacher_disagreement_score":0.27665305,"about_ca_system_score_codex":0.00003656346,"about_ca_system_score_gemma":0.000025613894,"threshold_uncertainty_score":0.35839736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036762804,0.0020851016,0.9569155,0.0012818329,0.00028447583,0.0013609072,0.000003155098,0.00043035325,0.0008758742],"genre_scores_gemma":[0.8931138,0.000203967,0.09520071,0.010299354,0.00018148893,0.0002392154,0.000017878869,0.000038090908,0.00070549484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752605,0.00007230647,0.00046826538,0.00084839924,0.00029703073,0.0007879605],"domain_scores_gemma":[0.9983571,0.00018321471,0.00013435779,0.0009954176,0.0001811201,0.00014879978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044074218,0.00033643228,0.00037640825,0.00012103803,0.00015019628,0.00040518556,0.0013513308,0.00018154777,0.000006803714],"category_scores_gemma":[0.000010380488,0.0003083783,0.00010004273,0.0011292269,0.000017022856,0.0019164686,0.0002642642,0.00029059142,0.000011415486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052568586,0.00019843412,0.00009349783,0.000043546803,0.000010062139,0.000005340007,0.00069171743,0.91493464,0.0006765588,0.002861535,0.00065115956,0.07978095],"study_design_scores_gemma":[0.0007277403,0.00008230708,0.00085782626,0.00010336,0.000007898688,0.0000040349173,0.00003117776,0.9944863,0.0002785544,0.002290345,0.0007191647,0.00041128925],"about_ca_topic_score_codex":0.00003693289,"about_ca_topic_score_gemma":0.000986669,"teacher_disagreement_score":0.8617148,"about_ca_system_score_codex":0.00015730628,"about_ca_system_score_gemma":0.00015326643,"threshold_uncertainty_score":0.9999368},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018925447,0.00023462102,0.9769906,0.0017605033,0.00048500963,0.00030939782,1.7866317e-7,0.00028039614,0.0010138797],"genre_scores_gemma":[0.6157945,0.000053549196,0.3782339,0.0054901587,0.00009018682,0.00004664704,4.8860244e-7,0.0000138182695,0.00027677248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998406,0.000041215764,0.00026189434,0.00052072,0.00022454579,0.00054560386],"domain_scores_gemma":[0.99851614,0.00021622407,0.000036052486,0.00097320945,0.00003678412,0.00022159475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022683744,0.00016294995,0.0001827967,0.00010525566,0.000049041715,0.0002719151,0.001011974,0.00016190228,0.000048473423],"category_scores_gemma":[0.000074744006,0.00015176304,0.000052425432,0.0012374264,0.000020107125,0.0005382976,0.000462849,0.0003639862,0.00025598137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014897215,0.00011937728,0.0017473833,0.0000027179838,0.000007961226,0.0001245267,0.00077000906,0.5557374,0.0000102345,0.34301636,0.0025817133,0.09586745],"study_design_scores_gemma":[0.002419291,0.0009161661,0.07080735,0.0007607878,0.000010261511,0.00007075598,0.00007811755,0.63732433,0.0002929632,0.16067214,0.1244668,0.0021810543],"about_ca_topic_score_codex":0.00007198427,"about_ca_topic_score_gemma":0.0005040831,"teacher_disagreement_score":0.5987567,"about_ca_system_score_codex":0.00012208753,"about_ca_system_score_gemma":0.00005506248,"threshold_uncertainty_score":0.61887175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006880187,0.000100519675,0.9875637,0.00002990241,0.00028832976,0.0001986754,1.0251669e-7,0.00013968052,0.0047989027],"genre_scores_gemma":[0.7881856,0.000025863423,0.21103968,0.00016022897,0.00010980335,0.0000046907385,4.864062e-7,0.000009099189,0.0004645375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986518,0.000051573214,0.00031826965,0.00030964508,0.00024610956,0.00042257737],"domain_scores_gemma":[0.9988154,0.00029558223,0.000101244696,0.0005851024,0.00008046975,0.00012219562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386684,0.00012929445,0.00019317362,0.00006038984,0.000049936723,0.000050581355,0.0008779369,0.00010422596,0.000057183297],"category_scores_gemma":[0.0000073275337,0.00011370211,0.00005498671,0.0004518904,0.000060818482,0.000258957,0.00021809418,0.00013959668,0.0000135531145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007118298,0.00017853404,0.0016732019,0.000014158684,0.000061527564,0.00008055657,0.0003931147,0.4487266,0.0009043579,0.28353631,0.011753941,0.2526065],"study_design_scores_gemma":[0.0002626271,0.000104643404,0.00085270475,0.0000141829905,0.000003958968,0.000022919365,0.00001031496,0.99472106,0.003391526,0.00018647191,0.00027703584,0.00015257881],"about_ca_topic_score_codex":0.000015549957,"about_ca_topic_score_gemma":0.0000061693695,"teacher_disagreement_score":0.78130543,"about_ca_system_score_codex":0.000022378688,"about_ca_system_score_gemma":0.00003643755,"threshold_uncertainty_score":0.46366376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04754651,0.00007425684,0.93496907,0.0002942753,0.0007167781,0.00025096428,1.2679331e-7,0.00020305405,0.015944991],"genre_scores_gemma":[0.9891371,0.000031265634,0.009510383,0.0003636028,0.00015755389,0.000019783476,0.0000025550903,0.000010503704,0.00076725765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830747,0.000063174266,0.0003920293,0.00047696597,0.00020683657,0.00055353355],"domain_scores_gemma":[0.9989121,0.00022066006,0.0000840749,0.0005820685,0.00006620737,0.00013491439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008838708,0.00017195953,0.00020909286,0.00012900513,0.00004441955,0.000113479284,0.00086812937,0.00015793496,0.00007688442],"category_scores_gemma":[0.000017687416,0.00015906646,0.00004098464,0.0006554821,0.000057931178,0.00041725795,0.00031052183,0.00032461807,0.000061697014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032147123,0.00014062502,0.005893775,0.0000075671032,0.000011270955,0.00010935776,0.0003610516,0.0024565796,0.00013225636,0.28579774,0.0026044156,0.7024532],"study_design_scores_gemma":[0.00053322007,0.00015339136,0.016905505,0.000091852824,0.0000031985876,0.000019675432,0.00004450241,0.9785519,0.000639776,0.0020035626,0.0007041651,0.00034922198],"about_ca_topic_score_codex":0.00011014746,"about_ca_topic_score_gemma":0.0013753186,"teacher_disagreement_score":0.9760953,"about_ca_system_score_codex":0.00010227898,"about_ca_system_score_gemma":0.000033717402,"threshold_uncertainty_score":0.64865416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028030663,0.001964554,0.9795555,0.001462971,0.00040082337,0.00022584364,1.683108e-7,0.0003431356,0.013243946],"genre_scores_gemma":[0.6337552,0.0002902391,0.3625726,0.0023521346,0.00018952254,0.00004538303,0.000002819899,0.00002356156,0.0007685062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982983,0.000053409127,0.0003172815,0.0005251973,0.00022971058,0.00057608704],"domain_scores_gemma":[0.99889773,0.00008372701,0.00006572954,0.00077362364,0.000031342446,0.00014784679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037860704,0.0001882692,0.00021564186,0.00009590846,0.00006720026,0.00018965367,0.0011283531,0.00014101976,0.00006328735],"category_scores_gemma":[0.000014949311,0.00017523495,0.00007165013,0.0007515199,0.000034182172,0.0005818036,0.0004632374,0.00034817122,0.00014246412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005592885,0.00007655846,0.00021081127,0.000002459319,0.000008856429,0.000071335504,0.0004213675,0.8930978,0.000015892443,0.029488318,0.0009727122,0.07562826],"study_design_scores_gemma":[0.0014517669,0.0001265904,0.0016171125,0.00007168502,0.00000460635,0.000032602708,0.000030350271,0.98053753,0.0001718755,0.0036363788,0.01179729,0.00052219053],"about_ca_topic_score_codex":0.00004780751,"about_ca_topic_score_gemma":0.00024448955,"teacher_disagreement_score":0.6309522,"about_ca_system_score_codex":0.0001858085,"about_ca_system_score_gemma":0.0001026895,"threshold_uncertainty_score":0.7145874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034044487,0.0011330714,0.99309236,0.00019826466,0.0007578992,0.00060971075,0.000001059919,0.00035546292,0.0004477223],"genre_scores_gemma":[0.83726984,0.0000096505555,0.16025083,0.00055126403,0.0010196717,0.00025093343,0.000013349473,0.000025418969,0.00060906576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816465,0.00005324153,0.00030837167,0.00045555874,0.0002538843,0.00076426327],"domain_scores_gemma":[0.99821657,0.00026717802,0.00012211813,0.0009150535,0.00020834187,0.00027074118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005180052,0.00022683456,0.0002156664,0.0000572354,0.0002022453,0.00015994445,0.0007975604,0.0001557963,0.00002754044],"category_scores_gemma":[0.000059405334,0.00020547795,0.0001050795,0.00048952486,0.00003268658,0.00096437876,0.00027944503,0.00017771768,0.000049403807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005014407,0.0010732466,0.117585145,0.00024122871,0.0002949396,0.000018625116,0.0035141516,0.12893316,0.00042381193,0.2756908,0.13461538,0.3375594],"study_design_scores_gemma":[0.00038835083,0.000047214966,0.0025455623,0.000044085904,0.000009610842,0.000007617424,0.0000361843,0.97941,0.00027089746,0.0000882299,0.016869733,0.00028253626],"about_ca_topic_score_codex":0.0000305751,"about_ca_topic_score_gemma":0.000017108016,"teacher_disagreement_score":0.8504768,"about_ca_system_score_codex":0.0000760809,"about_ca_system_score_gemma":0.000054899923,"threshold_uncertainty_score":0.83791476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03814105,0.0008334265,0.9582266,0.00006251183,0.0007476866,0.0013307435,0.0000325694,0.00034506558,0.0002803234],"genre_scores_gemma":[0.9578702,0.000023306064,0.041310497,0.0002747094,0.00025542555,0.00015140873,0.00002359411,0.000030351828,0.000060530325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797744,0.000007370042,0.0004162942,0.0005902145,0.00028771535,0.0007209946],"domain_scores_gemma":[0.9987014,0.00018795794,0.00027740948,0.00019247923,0.0004425612,0.00019817006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007894822,0.00024773495,0.0002683697,0.00009741041,0.0002514303,0.0002014582,0.000534003,0.00020306291,0.000013643854],"category_scores_gemma":[0.00009167005,0.0002476988,0.00012368702,0.0006417792,0.00007523387,0.0009169934,0.000138174,0.00029632202,0.000005370015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005558356,0.0024227875,0.102903984,0.00063574966,0.0020897451,0.00011051243,0.028812338,0.14755313,0.03583547,0.09954878,0.16827969,0.40624946],"study_design_scores_gemma":[0.0013693013,0.0003989612,0.001288729,0.00007513473,0.000026933343,0.000025920848,0.0001674291,0.9794489,0.00028099224,0.00040967212,0.01623753,0.00027049487],"about_ca_topic_score_codex":0.0000016277996,"about_ca_topic_score_gemma":0.0000011077827,"teacher_disagreement_score":0.9197291,"about_ca_system_score_codex":0.00022351413,"about_ca_system_score_gemma":0.00003984578,"threshold_uncertainty_score":0.9999975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00477829,0.000027227683,0.9875504,0.0007149958,0.0039626416,0.00092685,0.0000018857177,0.0005675071,0.0014702408],"genre_scores_gemma":[0.98390824,0.000016757567,0.011751747,0.0010612988,0.0018870953,0.00065972115,0.000007756247,0.000046844663,0.00066052284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690294,0.00005692099,0.0005184328,0.0009027461,0.0005344743,0.0010844718],"domain_scores_gemma":[0.9978403,0.00036270643,0.00023489154,0.001002105,0.00024625298,0.00031377884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010524198,0.00035465535,0.0003832684,0.00006468091,0.00037728043,0.00050213886,0.0014095518,0.00024947088,0.00006827883],"category_scores_gemma":[0.000047351834,0.0003360829,0.00018553811,0.0003467234,0.000055182612,0.00078325556,0.0005909871,0.00046807638,0.000027107877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006263604,0.00042161945,0.00026476887,0.00012008206,0.00022087955,0.00006689511,0.0024943103,0.10585127,0.008139583,0.6017978,0.025495447,0.25506467],"study_design_scores_gemma":[0.0005720343,0.000100454105,0.000040378185,0.000058809022,0.000009638843,0.000013342213,0.00007975383,0.9910298,0.002678004,0.0017938113,0.003162819,0.00046116576],"about_ca_topic_score_codex":0.000032773667,"about_ca_topic_score_gemma":0.00013574194,"teacher_disagreement_score":0.97912997,"about_ca_system_score_codex":0.00009455971,"about_ca_system_score_gemma":0.00015021082,"threshold_uncertainty_score":0.9999091},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556752,0.0000032696619,0.02511971,0.0002815312,0.000018093295,0.017298598,4.2169032e-7,0.000015336067,0.0015878432],"genre_scores_gemma":[0.99064684,1.3296555e-7,0.0011391565,0.00005712166,0.0000133509675,0.0080962265,3.716373e-7,0.0000036144056,0.000043185846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875766,0.00023807022,0.00021808954,0.000158701,0.00049496,0.00013254689],"domain_scores_gemma":[0.99899024,0.00030491964,0.000068196285,0.0005653108,0.0000589338,0.00001242419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022657586,0.00007747546,0.000108673536,0.000039842547,0.000028550263,0.000017868779,0.0006285499,0.000026630865,0.000013014067],"category_scores_gemma":[0.000032888052,0.00003673561,0.000027357686,0.00030407403,0.000025087582,0.00008009718,0.00007341585,0.000080915175,0.000011773785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016358683,0.000030606094,0.00012133749,0.0000090007,0.0000012644605,6.0282346e-8,0.00011642433,0.96482503,0.00010304558,0.0030307444,0.00046989878,0.03127621],"study_design_scores_gemma":[0.00038307975,0.0003323888,0.0031238082,0.000051407562,0.000002965382,4.1502395e-7,0.0000019357078,0.9900254,0.0059468336,0.00007444919,0.0000157379,0.00004159981],"about_ca_topic_score_codex":0.00001697883,"about_ca_topic_score_gemma":0.00008019855,"teacher_disagreement_score":0.034971643,"about_ca_system_score_codex":0.000029754283,"about_ca_system_score_gemma":0.000029259092,"threshold_uncertainty_score":0.14980347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3201499,0.00001350927,0.6771632,0.00011471196,0.001721413,0.00036253405,6.3460703e-7,0.00035441658,0.000119674],"genre_scores_gemma":[0.8760667,0.0000313859,0.12286967,0.00024341808,0.0002560414,0.000080664264,0.000003831414,0.00003845449,0.00040982396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969218,0.00009042665,0.0006451946,0.00093398825,0.00032853574,0.0010800967],"domain_scores_gemma":[0.9979546,0.0002210647,0.00017841403,0.0012681459,0.00011244038,0.00026533223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008393834,0.00039364275,0.00043198525,0.0001615069,0.00021099485,0.00024582242,0.0017678528,0.00032521418,0.000036596375],"category_scores_gemma":[0.00005167942,0.00036397282,0.00008179854,0.0007918155,0.00011708662,0.0009696848,0.0006845555,0.0012201128,0.0001054465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077697456,0.0026140825,0.07494841,0.00010596456,0.00013054619,0.00039287307,0.004416983,0.45265397,0.005565865,0.12479662,0.0011654177,0.33313158],"study_design_scores_gemma":[0.0016301165,0.00003765177,0.036635954,0.00005000832,0.0000037086286,0.000025811905,0.000024934134,0.9600499,0.0010359386,0.0000144686055,0.000038210466,0.0004532755],"about_ca_topic_score_codex":0.0004973191,"about_ca_topic_score_gemma":0.001970756,"teacher_disagreement_score":0.55591685,"about_ca_system_score_codex":0.00007103118,"about_ca_system_score_gemma":0.000059945884,"threshold_uncertainty_score":0.9998812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20705049,0.00022641214,0.79145557,0.000035859826,0.0004226069,0.0005274733,2.1422322e-7,0.00011737434,0.00016403096],"genre_scores_gemma":[0.9406852,0.00009805859,0.058344286,0.00029184594,0.00025846332,0.00013430128,0.0000016233945,0.000015054004,0.00017112849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987294,0.00004788546,0.0002769998,0.00040676026,0.00014989074,0.00038904705],"domain_scores_gemma":[0.9993229,0.00007753318,0.00008062056,0.00039691423,0.000046706784,0.000075345306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031546844,0.00013659423,0.00015409275,0.00010028791,0.00011019638,0.00009886727,0.0004409401,0.00012639764,0.000027447006],"category_scores_gemma":[0.000006285069,0.00013271096,0.000057890964,0.00044965,0.000017047085,0.00054137234,0.00021915,0.00014626946,0.0000114310305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012093378,0.000043821707,0.00008703373,0.000003850391,0.0000030420747,0.0000015293318,0.000078137935,0.18485542,0.0005353376,0.00058248657,0.00016225754,0.813635],"study_design_scores_gemma":[0.00044411852,0.00007889491,0.00028384727,0.000023173878,0.0000025975164,0.0000069984,0.00000975904,0.9871479,0.0021551482,0.00016131064,0.009527291,0.00015891618],"about_ca_topic_score_codex":0.000017190168,"about_ca_topic_score_gemma":0.0005281335,"teacher_disagreement_score":0.8134761,"about_ca_system_score_codex":0.00018723348,"about_ca_system_score_gemma":0.000023369874,"threshold_uncertainty_score":0.5411796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037542817,0.00024954622,0.9924639,0.0002526786,0.0003685127,0.0010037229,0.000002780866,0.00033542703,0.0015691601],"genre_scores_gemma":[0.75097257,0.000106949396,0.24476905,0.0017908604,0.00023099473,0.00067497545,0.000022716307,0.000024270485,0.0014076157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833757,0.00005020337,0.00030622762,0.00061319786,0.000256781,0.00043603714],"domain_scores_gemma":[0.9983761,0.0003076908,0.00011243315,0.0009385706,0.0001290026,0.0001362111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000291746,0.00020640892,0.00020787923,0.0000757233,0.00024156355,0.000061103194,0.0007569457,0.00014234707,0.000019352883],"category_scores_gemma":[0.000031414627,0.00018860535,0.00012442702,0.00028935034,0.00004433724,0.00030107176,0.0001079342,0.0001638376,0.00003767543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040572122,0.00010650811,0.00004959029,0.000004519035,0.0000040444966,0.0000023468951,0.00018735992,0.93616676,0.000015380603,0.0020458272,0.020922827,0.04045425],"study_design_scores_gemma":[0.00083427835,0.00021822396,0.00013283272,0.000012992963,0.0000040398595,0.0000032119679,0.0000036128165,0.9922883,0.000093803836,0.00022186774,0.005951965,0.00023486474],"about_ca_topic_score_codex":0.0000044426497,"about_ca_topic_score_gemma":0.000016025178,"teacher_disagreement_score":0.74769485,"about_ca_system_score_codex":0.00008936176,"about_ca_system_score_gemma":0.00010958847,"threshold_uncertainty_score":0.7691103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29867303,0.0005797412,0.68919986,0.00080149155,0.0017708474,0.0005699451,9.084244e-7,0.00050089264,0.007903305],"genre_scores_gemma":[0.9494011,0.000114033624,0.049249087,0.0004426785,0.00017359258,0.000026141528,0.0000016261304,0.000024613804,0.00056713884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979682,0.000058591213,0.00037813516,0.00067256397,0.00021990896,0.0007025874],"domain_scores_gemma":[0.99855244,0.00028716325,0.000090632275,0.0007786998,0.00005770061,0.0002333529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005951151,0.00023526633,0.00027321395,0.00009235155,0.00012854575,0.00032699047,0.0008021786,0.00021246633,0.00008547425],"category_scores_gemma":[0.000040594856,0.00021918229,0.00004163509,0.00053406385,0.00009817461,0.0005321422,0.0007216423,0.00073269004,0.000058971025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023687255,0.0001878202,0.019397328,0.000017337534,0.000018090801,0.000116200245,0.0006859954,0.0050809244,0.00127832,0.03859006,0.00181181,0.9327924],"study_design_scores_gemma":[0.00058555044,0.000046355963,0.0058171153,0.000041434683,0.000002923222,0.000044253477,0.000028253658,0.9881936,0.00010962802,0.0004227404,0.0044159265,0.00029223104],"about_ca_topic_score_codex":0.00010922286,"about_ca_topic_score_gemma":0.0004948469,"teacher_disagreement_score":0.98311263,"about_ca_system_score_codex":0.000025262943,"about_ca_system_score_gemma":0.000042775904,"threshold_uncertainty_score":0.8937994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13880353,0.00003461471,0.5536091,0.00036672413,0.00036540598,0.00012706648,9.124729e-7,0.00017912555,0.30651358],"genre_scores_gemma":[0.97174037,0.0000017367005,0.02627728,0.00029045707,0.000087958026,0.0000043457276,8.5264634e-7,0.0000040841255,0.0015929118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920326,0.000025016345,0.00015912137,0.00022018197,0.00021132859,0.00018109952],"domain_scores_gemma":[0.99928224,0.000056553334,0.00005380956,0.0005482824,0.000031801046,0.000027334729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011164644,0.00007919545,0.00010802332,0.00002916117,0.000036765432,0.000039565188,0.00049024017,0.000044972126,0.00006248989],"category_scores_gemma":[0.0000033537322,0.00006609087,0.0000409944,0.00018386087,0.000045935256,0.00015792101,0.000095024734,0.00007117714,0.000083831765],"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.0000017991601,0.000089431785,0.0007463022,0.000005223614,0.000004183187,0.000004978627,0.0000427653,0.0019086006,0.00036070874,0.96781135,0.024031833,0.004992809],"study_design_scores_gemma":[0.0016045271,0.00097448664,0.10840348,0.00009311728,0.000014817874,0.00006240007,0.000015396894,0.39968762,0.0906325,0.27409297,0.12331822,0.0011004749],"about_ca_topic_score_codex":0.00039453537,"about_ca_topic_score_gemma":0.000114605806,"teacher_disagreement_score":0.8329368,"about_ca_system_score_codex":0.000021785383,"about_ca_system_score_gemma":0.000015466003,"threshold_uncertainty_score":0.26951075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05876056,0.00045843603,0.93832177,0.000057489862,0.000345897,0.0014410666,0.0000026244522,0.00014257948,0.00046958777],"genre_scores_gemma":[0.937169,0.00007811746,0.061059523,0.0009058733,0.00009991272,0.0005250883,0.000008964009,0.000017929611,0.00013556839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981195,0.000036495116,0.00034909672,0.00063924084,0.00023402156,0.00062169775],"domain_scores_gemma":[0.9986599,0.00046824542,0.00009705136,0.00057443004,0.000062545034,0.00013784309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011639368,0.00020966392,0.00023441062,0.00013643985,0.000116831594,0.000096500524,0.0004291739,0.00016862524,0.000014106889],"category_scores_gemma":[0.000012142932,0.00019702861,0.00007127858,0.00045936345,0.000054058295,0.0002419371,0.00016265397,0.00020325555,0.000004523746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020405829,0.0007566036,0.000974963,0.000038569287,0.000010925938,0.000018658224,0.0002008709,0.1295037,0.0010173615,0.0043094624,0.0021180285,0.8608468],"study_design_scores_gemma":[0.0013680893,0.00054992596,0.0033681635,0.00004407881,0.0000035420062,0.000004376413,0.000017673307,0.9883767,0.00046704506,0.00008795695,0.00546763,0.00024486476],"about_ca_topic_score_codex":0.000025000692,"about_ca_topic_score_gemma":0.00047239158,"teacher_disagreement_score":0.8784085,"about_ca_system_score_codex":0.0001490662,"about_ca_system_score_gemma":0.00005156175,"threshold_uncertainty_score":0.80345935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.267977,0.0017677611,0.72744185,0.00001695714,0.0013769504,0.00071085204,0.0000015064959,0.0004795336,0.00022757852],"genre_scores_gemma":[0.98176086,0.00031935656,0.0171944,0.00017884387,0.00014745495,0.0002399601,0.0000012857624,0.00004943712,0.00010837886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964442,0.00022456252,0.00078413927,0.0010440587,0.0004990981,0.0010039147],"domain_scores_gemma":[0.99781865,0.0006565294,0.0002043527,0.0010045012,0.00008629201,0.00022968146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005696622,0.00042219562,0.0004675311,0.00036961152,0.00072157953,0.000114722316,0.0010467557,0.0002072056,0.000037485832],"category_scores_gemma":[0.000005753613,0.00046035656,0.0002314819,0.0017208545,0.00012653347,0.00018455494,0.000027354357,0.0010347428,0.00009367113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010177826,0.00025748656,0.000036904217,0.000007520591,0.000010569419,0.00007868108,0.00077954866,0.71268976,0.00006921115,0.000021750224,0.00003767631,0.28600073],"study_design_scores_gemma":[0.0007476041,0.0003158652,0.00020247663,0.00015202712,0.0000069409975,0.00019279664,0.00006741524,0.99598914,0.0006944981,0.000012055005,0.0011685631,0.0004505988],"about_ca_topic_score_codex":0.000013218827,"about_ca_topic_score_gemma":0.00002392618,"teacher_disagreement_score":0.71378386,"about_ca_system_score_codex":0.00027367886,"about_ca_system_score_gemma":0.00010850129,"threshold_uncertainty_score":0.9997848},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114212506,0.000038697122,0.883741,0.00004782081,0.00012268417,0.00015279252,4.3001714e-7,0.00011150165,0.0015725684],"genre_scores_gemma":[0.9109243,0.0000040658356,0.088833146,0.00009730849,0.000030623814,0.0000073997944,0.000007419113,0.0000046231107,0.00009111287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989465,0.00003000698,0.00035751812,0.00016891504,0.00031940875,0.00017767765],"domain_scores_gemma":[0.9989594,0.0002790838,0.00015685555,0.00041736546,0.00013364667,0.0000536106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012580171,0.000096292635,0.00017082797,0.0000721378,0.000106537664,0.000016876375,0.00039022474,0.00005161444,0.000047911784],"category_scores_gemma":[0.000016986118,0.00008811263,0.000040051455,0.00033816148,0.000039480612,0.00066426746,0.000058041256,0.00008133122,0.000060120663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000365381,0.000058098496,0.0036363127,0.000012886362,0.0000024080755,7.081926e-7,0.0002759535,0.96087366,0.00003188573,0.00041483552,0.00031919978,0.034370422],"study_design_scores_gemma":[0.000329534,0.000100968085,0.004055187,0.000012917787,0.0000016697338,0.0000016311789,0.0000052139408,0.98954266,0.0051803505,0.000025265059,0.00064150675,0.000103088685],"about_ca_topic_score_codex":0.0000108105,"about_ca_topic_score_gemma":0.0000042833535,"teacher_disagreement_score":0.7967118,"about_ca_system_score_codex":0.000028432221,"about_ca_system_score_gemma":0.000042784504,"threshold_uncertainty_score":0.3593129},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06805216,0.0025008898,0.92581993,0.0014231339,0.0010792254,0.0007160066,0.000015175683,0.00034074154,0.000052719406],"genre_scores_gemma":[0.98737323,0.00030027478,0.009145173,0.001748186,0.0010363985,0.00017699438,0.00007224031,0.00005801805,0.00008945385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952423,0.00043667998,0.0009796788,0.0013445108,0.00042879963,0.0015680376],"domain_scores_gemma":[0.9974092,0.0006467714,0.0003127996,0.0010146912,0.00016328311,0.0004532289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000804448,0.0006288499,0.0009526654,0.00016886933,0.00030460907,0.00023371143,0.0012215031,0.0006778188,0.000034777015],"category_scores_gemma":[0.000018830688,0.00061496784,0.0001508222,0.00087956694,0.00034714866,0.00061133393,0.0006047005,0.001221162,0.000020090481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000742942,0.00026375693,0.003437311,0.0000075476796,0.000057400095,0.0001667044,0.00012083434,0.79119563,0.000027853057,0.006456387,0.0013710078,0.19682127],"study_design_scores_gemma":[0.0042323954,0.000091485956,0.0077863173,0.000105779865,0.000018971587,0.00012503251,0.000017394836,0.98536974,0.00001623759,0.00008508004,0.0014879823,0.00066359295],"about_ca_topic_score_codex":0.00015542067,"about_ca_topic_score_gemma":0.00078775926,"teacher_disagreement_score":0.9193211,"about_ca_system_score_codex":0.00020149011,"about_ca_system_score_gemma":0.00008771281,"threshold_uncertainty_score":0.99963015},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005607524,0.00002632032,0.91809916,0.0005495941,0.00046599482,0.07796025,0.000013673822,0.0007049781,0.0021239452],"genre_scores_gemma":[0.007849697,0.0000072216053,0.25048354,0.0010628037,0.00086119527,0.73661083,0.000046158057,0.000041872998,0.003036686],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997813,0.00006296162,0.000383775,0.0007451479,0.0003833588,0.00061177753],"domain_scores_gemma":[0.99846417,0.0002832356,0.00010876633,0.00059794355,0.00026202065,0.00028385414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002532573,0.00026299516,0.00025808378,0.00009577825,0.0004979947,0.00011161642,0.0007344855,0.00013802943,0.00021087522],"category_scores_gemma":[0.00005047238,0.00024212165,0.00016539764,0.0008215101,0.000060456063,0.00034486008,0.00026208395,0.0001937915,0.00009126065],"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.00041697765,0.00088345195,0.0019830093,0.000046476023,0.00016017603,0.000055500746,0.00017596154,0.15925547,0.00012363734,0.01778453,0.66400963,0.15510514],"study_design_scores_gemma":[0.0013098415,0.00040352147,0.0051804986,0.00002900749,0.0000045370593,0.0001979721,0.0000028209479,0.45587003,0.0003649387,0.00073614804,0.5354587,0.00044202415],"about_ca_topic_score_codex":0.000013791347,"about_ca_topic_score_gemma":0.00005525188,"teacher_disagreement_score":0.66761565,"about_ca_system_score_codex":0.00023773848,"about_ca_system_score_gemma":0.00022290039,"threshold_uncertainty_score":0.98734343},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013067956,0.0012899415,0.9797521,0.004785305,0.00015425487,0.0006819798,0.000023189277,0.00014729428,0.000097946075],"genre_scores_gemma":[0.98753226,0.0052508106,0.0060122637,0.0006859874,0.000018488456,0.00037431504,0.0000097856,0.000014726039,0.000101351696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982619,0.00023974433,0.00043284576,0.00044261,0.0002355382,0.0003873194],"domain_scores_gemma":[0.9953304,0.0010690225,0.00014107228,0.0032051757,0.00014661586,0.000107718624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005915917,0.00023898337,0.0003498472,0.00024560437,0.00088997657,0.00024102526,0.0023760833,0.00015919252,0.000005862878],"category_scores_gemma":[0.0000038299995,0.00021105034,0.00021431681,0.0020480244,0.00021140988,0.00042492113,0.000019599349,0.0006886056,0.0000039140764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054863172,0.00061560277,0.00022019335,0.00000799596,0.00031163052,0.0000014341754,0.0009316993,0.18961926,0.000064217485,0.0026452045,0.00025440843,0.8052735],"study_design_scores_gemma":[0.0004904545,0.00007646523,0.009054623,0.0000411256,0.00016899365,0.000005171947,0.00005792354,0.9879455,0.00007213918,0.00017088039,0.0016721698,0.00024455372],"about_ca_topic_score_codex":0.000039432936,"about_ca_topic_score_gemma":0.004517563,"teacher_disagreement_score":0.9744643,"about_ca_system_score_codex":0.00011605107,"about_ca_system_score_gemma":0.00006148673,"threshold_uncertainty_score":0.8606383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14126146,0.000086903456,0.8562381,0.00046017638,0.0006302351,0.0003715359,0.0000017345005,0.00009590717,0.0008539228],"genre_scores_gemma":[0.9339496,0.000087955144,0.06419396,0.0007442821,0.0005172122,0.000085640204,0.0000020989198,0.000010691573,0.00040859092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998792,0.000019503079,0.00029906552,0.00033492642,0.0001505853,0.00040394158],"domain_scores_gemma":[0.99891967,0.00014703846,0.00013246913,0.00056339445,0.00015648988,0.00008097099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019415366,0.00014939871,0.000310328,0.00004383276,0.00012637473,0.000012395153,0.00081018877,0.00015933882,0.000022938513],"category_scores_gemma":[0.000006521551,0.00012705171,0.00009799897,0.00025122412,0.00011135089,0.0002520897,0.00011809876,0.00014750526,0.000003161544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028370915,0.0005711422,0.020512749,0.000096773256,0.00018703812,0.0000131266315,0.0007246276,0.01936873,0.0018497842,0.8805649,0.02235166,0.05347575],"study_design_scores_gemma":[0.0015406924,0.0002255833,0.001876675,0.00000898341,0.0000044412545,0.00005309937,0.000010197304,0.99410677,0.000341272,0.000023487435,0.0016602279,0.00014856194],"about_ca_topic_score_codex":0.000009136382,"about_ca_topic_score_gemma":0.000010890104,"teacher_disagreement_score":0.97473806,"about_ca_system_score_codex":0.00001956998,"about_ca_system_score_gemma":0.000070158734,"threshold_uncertainty_score":0.5181018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045087956,0.000111595175,0.95273215,0.0012864979,0.00026224199,0.00017692137,2.9829707e-7,0.000018647555,0.00032372124],"genre_scores_gemma":[0.82811666,0.000025419162,0.17109492,0.0002758152,0.00042667505,0.000036995327,5.730016e-7,0.0000050372937,0.000017931905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901205,0.00003613986,0.00043207224,0.00014747557,0.00024996846,0.00012226542],"domain_scores_gemma":[0.9990373,0.00016378383,0.0002867345,0.00015980125,0.00028742,0.000064959815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025795685,0.00007532968,0.000111138936,0.00018747145,0.00003353596,0.00025269782,0.0009432806,0.000032564363,0.000015226],"category_scores_gemma":[0.000007629555,0.00007269229,0.000041411447,0.00015861612,0.000020445503,0.000628218,0.00027644282,0.00019374146,0.000018956935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022040992,0.000096039774,0.008568355,0.000006072945,0.000055144763,0.000016305898,0.00036955628,0.004212242,0.0003771036,0.01567776,0.001109861,0.96950936],"study_design_scores_gemma":[0.001156896,0.000102279395,0.10771571,0.00018200118,0.000008970788,0.0011707238,0.000036542133,0.8225808,0.00043371614,0.044215422,0.022084305,0.00031264816],"about_ca_topic_score_codex":0.000014739031,"about_ca_topic_score_gemma":0.0000052257633,"teacher_disagreement_score":0.9691967,"about_ca_system_score_codex":0.000046000045,"about_ca_system_score_gemma":0.000028653074,"threshold_uncertainty_score":0.29643053},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051541187,0.00030972905,0.94527686,0.00025325123,0.0015319183,0.00043312038,5.281996e-7,0.00022096348,0.00043245958],"genre_scores_gemma":[0.9882488,0.00043690667,0.010495314,0.0002793455,0.00026975657,0.00018402726,0.0000034952932,0.0000435034,0.000038822618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970153,0.00040991718,0.00057648774,0.00083479134,0.00032458562,0.00083890854],"domain_scores_gemma":[0.99785256,0.00078519736,0.0001767302,0.0009953303,0.00005269933,0.00013747056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091463607,0.00037937603,0.00048167238,0.00040344798,0.00026816886,0.00034291815,0.0011376693,0.00021304285,0.000010109135],"category_scores_gemma":[0.000006663889,0.0003687678,0.000099291276,0.0015700557,0.00009204517,0.0006736067,0.000024664938,0.0010054519,0.00001013305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002638007,0.00012661988,0.0010817868,0.000013102953,0.000018799108,0.000032473537,0.00045887782,0.6411704,0.00007994836,0.00047376208,0.000011312955,0.35626912],"study_design_scores_gemma":[0.0027551414,0.00027581592,0.0012209361,0.0014083417,0.000015982074,0.00004664228,0.000034075743,0.9923333,0.00022709333,0.0008126445,0.00036366947,0.00050638046],"about_ca_topic_score_codex":0.00004467955,"about_ca_topic_score_gemma":0.002327115,"teacher_disagreement_score":0.9367076,"about_ca_system_score_codex":0.0002946324,"about_ca_system_score_gemma":0.000064544445,"threshold_uncertainty_score":0.99987644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67794615,0.0016927462,0.28571597,0.0003459062,0.0025660857,0.016096393,0.000009657094,0.0005981808,0.015028891],"genre_scores_gemma":[0.99158686,0.000027496151,0.005221651,0.00009610179,0.00031339328,0.002319344,0.000004877126,0.000014800576,0.0004154905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835694,0.000061302955,0.0004286006,0.00039604073,0.00030384565,0.0004532791],"domain_scores_gemma":[0.99917847,0.00007323254,0.0001741267,0.0004622443,0.000056026245,0.00005589705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035646866,0.00017401774,0.00025241077,0.000110900306,0.000075817254,0.000079397585,0.00067785237,0.00011126133,0.00007356624],"category_scores_gemma":[0.0000067372166,0.00017766755,0.00007323988,0.0006929157,0.000045257424,0.0004983748,0.00025569132,0.00022491436,0.000019852378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009694424,0.0003970096,0.15102135,0.0001041029,0.000024319004,0.000031675227,0.0002073139,0.69324356,0.00025476233,0.010549069,0.012665803,0.13140407],"study_design_scores_gemma":[0.00066083873,0.00012947126,0.12166288,0.00020074629,0.0000021318176,0.000014274558,0.0000019544993,0.85512286,0.0005060116,0.0008193297,0.020621546,0.0002579488],"about_ca_topic_score_codex":0.00007793879,"about_ca_topic_score_gemma":0.000111525624,"teacher_disagreement_score":0.31364065,"about_ca_system_score_codex":0.00011784638,"about_ca_system_score_gemma":0.000051620733,"threshold_uncertainty_score":0.7245072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015419275,0.0000892298,0.99292725,0.0034715086,0.00024834496,0.00083034,0.00001039229,0.00019538165,0.00068561576],"genre_scores_gemma":[0.5334367,0.000050022667,0.4645019,0.0014514856,0.00013211062,0.0002274306,0.000080409256,0.00003890078,0.00008103918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795663,0.00019881807,0.0004983974,0.0006088959,0.00018349585,0.0005537639],"domain_scores_gemma":[0.9892348,0.00063873274,0.0002823073,0.009619357,0.00006769534,0.00015709327],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009116346,0.00022552867,0.00028009154,0.00014275032,0.00033500214,0.00016128807,0.012309106,0.00010119666,0.000004245425],"category_scores_gemma":[0.00012179302,0.00025457644,0.000072745686,0.0006129327,0.00012436148,0.0009867059,0.0034548633,0.0005096624,0.0000070552996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117721516,0.00074479333,0.00819024,0.000078128396,0.000572429,0.000034235218,0.01034932,0.0061549447,0.0032866544,0.19596407,0.12947151,0.6450359],"study_design_scores_gemma":[0.0006349401,0.000023006922,0.00034041295,0.00009678918,0.000023874312,0.000010246756,0.000080288264,0.9957819,0.00006794582,0.0005497764,0.0020806587,0.0003101843],"about_ca_topic_score_codex":0.00039582842,"about_ca_topic_score_gemma":0.0002971082,"teacher_disagreement_score":0.98962694,"about_ca_system_score_codex":0.0001324916,"about_ca_system_score_gemma":0.00014841431,"threshold_uncertainty_score":0.99999064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7792997,0.0010046327,0.21898583,0.00005853928,0.000035386274,0.00024082373,3.387679e-7,0.00004031943,0.00033445682],"genre_scores_gemma":[0.98766667,0.00027653028,0.011739106,0.00022223065,0.000013208322,0.000046268786,0.000008730861,0.0000037657392,0.000023491946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863714,0.00008325091,0.00032695069,0.00036600043,0.0003492134,0.00023745821],"domain_scores_gemma":[0.99908936,0.00008218815,0.00012250668,0.0005320096,0.00011673117,0.00005721407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077931304,0.00012663052,0.00029184023,0.00030098876,0.000040033985,0.000046454294,0.00037201168,0.000083695275,0.0000461123],"category_scores_gemma":[0.000008918772,0.00011564314,0.00006225031,0.001961737,0.00003652466,0.00033192273,0.000053345077,0.00011358584,0.0000012262909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010657433,0.000055413715,0.015600185,0.0000040646355,0.000025571619,5.998693e-7,0.00009220497,0.52009207,0.00007398673,0.00027264174,0.000024981415,0.4637476],"study_design_scores_gemma":[0.0004246934,0.000117913056,0.090271294,0.000019344432,0.00007093486,3.181468e-7,0.000009740004,0.90845335,0.00042011694,0.000022050921,0.00007266358,0.00011757931],"about_ca_topic_score_codex":0.000006308018,"about_ca_topic_score_gemma":0.000048740418,"teacher_disagreement_score":0.46363002,"about_ca_system_score_codex":0.00005002568,"about_ca_system_score_gemma":0.000057505607,"threshold_uncertainty_score":0.47157905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81418043,0.00014460404,0.1021085,0.000617592,0.00020106707,0.0002135342,1.9235476e-7,0.00026158168,0.08227247],"genre_scores_gemma":[0.97510445,0.0000025007018,0.022889597,0.00073062343,0.0000690925,0.000018577146,0.0000011135676,0.000004778873,0.0011792466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913675,0.000027987955,0.00020366472,0.00023421856,0.00013861894,0.00025876198],"domain_scores_gemma":[0.9995315,0.00005253421,0.000043329976,0.0003148686,0.000017862374,0.00003987996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020083501,0.000084217696,0.0000957551,0.000051105253,0.000040313982,0.00007852368,0.00047361656,0.000038916758,0.000026903539],"category_scores_gemma":[0.0000074803634,0.00007708665,0.000016043236,0.00033805784,0.00003268726,0.00037838676,0.00014524574,0.00012222314,0.00011275569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016370578,0.00007624029,0.30852816,0.00003070296,0.0000037497648,0.000029446672,0.00046078907,0.017560005,0.00035779993,0.4802731,0.012174161,0.18050422],"study_design_scores_gemma":[0.00031231338,0.00003314179,0.10875805,0.000036446745,5.284012e-7,0.000013382945,0.000012625926,0.8806333,0.0008352646,0.0030731887,0.006126054,0.00016569885],"about_ca_topic_score_codex":0.00038809952,"about_ca_topic_score_gemma":0.00066260895,"teacher_disagreement_score":0.8630733,"about_ca_system_score_codex":0.00003072992,"about_ca_system_score_gemma":0.000028566361,"threshold_uncertainty_score":0.31435025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1798756,0.0014015054,0.806016,0.0024417976,0.0003256192,0.00041580506,3.938596e-7,0.00034852396,0.009174754],"genre_scores_gemma":[0.8874038,0.0003387991,0.109708056,0.00083339505,0.000121098485,0.000017732751,6.505027e-7,0.0000109753855,0.0015654856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880403,0.000035283123,0.00021756548,0.00041085726,0.00013311321,0.0003991188],"domain_scores_gemma":[0.9992299,0.000105862164,0.000037575515,0.00047974,0.00002823694,0.00011867997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023770034,0.00012911731,0.00016264492,0.000055248638,0.000051352552,0.000120062105,0.00037000887,0.00009336122,0.000037775193],"category_scores_gemma":[0.0000071886107,0.000116422896,0.000022276188,0.00031768446,0.000040711406,0.00038878736,0.00027028364,0.00020376207,0.000053722826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020607653,0.00017472371,0.005510461,0.000012272547,0.000012524622,0.00007645276,0.0005051658,0.09481439,0.00015645208,0.028142218,0.008219848,0.8623549],"study_design_scores_gemma":[0.00041410024,0.000029379873,0.002545589,0.000020510199,0.0000013133383,0.000019403138,0.000013805356,0.9841117,0.000083867686,0.000061909064,0.012540608,0.00015780627],"about_ca_topic_score_codex":0.000024724708,"about_ca_topic_score_gemma":0.00028697713,"teacher_disagreement_score":0.8892973,"about_ca_system_score_codex":0.000038641967,"about_ca_system_score_gemma":0.00001647978,"threshold_uncertainty_score":0.47475877},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051582963,0.00002588662,0.9863045,0.001296406,0.00029182612,0.00026744136,5.531088e-7,0.00026093458,0.006394131],"genre_scores_gemma":[0.8150672,0.000010963748,0.17924237,0.0004113512,0.0000977029,0.00007716205,0.000008554909,0.000008131707,0.0050765993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918044,0.00002400928,0.00016152323,0.00027851877,0.00013743111,0.00021805767],"domain_scores_gemma":[0.99922293,0.00013268714,0.000037018137,0.0004315902,0.00009158147,0.00008418516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010535699,0.00008685719,0.00009508394,0.000041936102,0.00010988632,0.00004680775,0.00047278593,0.00006245641,0.000085875035],"category_scores_gemma":[0.00003236568,0.00006757538,0.00004625777,0.00021844415,0.000034764296,0.00028449847,0.0000691861,0.00007452038,0.00017783423],"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.000011818273,0.0001413526,0.00024879037,0.0000067107103,0.000020140986,0.00001640586,0.00042950566,0.000033395117,0.00063873176,0.91201586,0.063115254,0.023322027],"study_design_scores_gemma":[0.00042795143,0.00013060104,0.0022113794,0.0000085503825,0.0000071626932,0.0001016673,0.0000064789756,0.8275733,0.007632185,0.008208827,0.15345839,0.00023350617],"about_ca_topic_score_codex":0.0000071874747,"about_ca_topic_score_gemma":0.000004424198,"teacher_disagreement_score":0.90380704,"about_ca_system_score_codex":0.000034234647,"about_ca_system_score_gemma":0.000049317743,"threshold_uncertainty_score":0.27556443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057235673,0.0006590859,0.93761975,0.00094738003,0.0017496592,0.00069133274,0.000003709574,0.00046313918,0.0006302452],"genre_scores_gemma":[0.909458,0.000014133442,0.087164715,0.0021358484,0.00082796335,0.00021743195,0.000012638952,0.000025612493,0.00014369443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979421,0.000111359324,0.00028000717,0.0004779544,0.00022756871,0.0009610016],"domain_scores_gemma":[0.9982066,0.00040419528,0.00012155419,0.0008585764,0.00010560125,0.00030348194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079383835,0.00024041512,0.0002821077,0.00005354092,0.00020407476,0.00017141207,0.0008265813,0.00016831183,0.000114026705],"category_scores_gemma":[0.000057053323,0.00022254778,0.00014921071,0.000373823,0.000054963282,0.00083361997,0.00026353938,0.0001852827,0.00008705762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012038017,0.0019820314,0.010999632,0.00011068432,0.00027553758,0.00001720252,0.00051084254,0.042842634,0.0035873626,0.38906008,0.15132107,0.39808914],"study_design_scores_gemma":[0.0016412869,0.00015368681,0.0010584804,0.000011568709,0.000009921191,0.000002807135,0.000004974134,0.93414533,0.002399847,0.00047340605,0.05974366,0.00035503088],"about_ca_topic_score_codex":0.000008511847,"about_ca_topic_score_gemma":0.00004071273,"teacher_disagreement_score":0.8913027,"about_ca_system_score_codex":0.00007462576,"about_ca_system_score_gemma":0.000077279066,"threshold_uncertainty_score":0.9075235},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024269566,0.00083953294,0.97042805,0.00023650346,0.00039435408,0.00047111983,5.183584e-7,0.0004041416,0.0029561995],"genre_scores_gemma":[0.9636178,0.000034866254,0.034522094,0.0014016258,0.00015183954,0.00005481867,0.000009888673,0.000020527557,0.00018656644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977558,0.00007396249,0.0004818463,0.00059283274,0.00031892103,0.00077660015],"domain_scores_gemma":[0.99830836,0.0004063095,0.000118521886,0.00091121375,0.000080387494,0.00017521303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009836894,0.00021770866,0.00022493019,0.00015163887,0.0001232387,0.00016312079,0.0011118056,0.00016830322,0.00009392772],"category_scores_gemma":[0.000019282534,0.00021253213,0.00008936986,0.0009923406,0.000037887265,0.00039241568,0.0003269424,0.00036272302,0.000055614833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054378244,0.0004134855,0.018108048,0.000021440219,0.000020870215,0.0003656072,0.00077949173,0.24479608,0.00014141128,0.011445953,0.0036497943,0.72020346],"study_design_scores_gemma":[0.0006413454,0.00013710221,0.008634332,0.00007490493,0.0000030940953,0.000011898565,0.00004779501,0.9858166,0.00045645537,0.00026286105,0.0035716225,0.00034198817],"about_ca_topic_score_codex":0.000020263604,"about_ca_topic_score_gemma":0.00025947476,"teacher_disagreement_score":0.9393482,"about_ca_system_score_codex":0.00018780891,"about_ca_system_score_gemma":0.00008519941,"threshold_uncertainty_score":0.86668086},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035125177,0.0000051659854,0.88227654,0.00010066142,0.00040258726,0.11442887,9.3827856e-7,0.0004536096,0.0022964883],"genre_scores_gemma":[0.036632072,0.00000427884,0.35301846,0.0028804922,0.001116048,0.59487605,0.0000082848155,0.00011383176,0.011350487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726695,0.000029998891,0.0005358094,0.0007718292,0.00032509788,0.0010703143],"domain_scores_gemma":[0.99812716,0.00022062189,0.00017335916,0.0010029688,0.00020042589,0.00027544633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011416319,0.00030030726,0.00031003493,0.00008787763,0.00021285747,0.00019758142,0.0012498117,0.00023784596,0.00005033523],"category_scores_gemma":[0.000021022575,0.0002634934,0.00015061554,0.00054614444,0.000058320227,0.0005123336,0.00039235485,0.00026468965,0.000050212187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007696756,0.0021793486,0.00082202535,0.00052088825,0.00016482285,0.00015727364,0.00078381767,0.06402017,0.00030265783,0.42496017,0.33023864,0.17508052],"study_design_scores_gemma":[0.0022532898,0.00016889742,0.00016601483,0.00008978309,0.0000035952519,0.000010807542,0.000012693371,0.98029727,0.0014435439,0.0007029161,0.014485256,0.00036591623],"about_ca_topic_score_codex":0.000070292605,"about_ca_topic_score_gemma":0.00020028462,"teacher_disagreement_score":0.9162771,"about_ca_system_score_codex":0.00009945285,"about_ca_system_score_gemma":0.0000805623,"threshold_uncertainty_score":0.9999817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21747568,0.00010029456,0.77926284,0.00026485205,0.0001820624,0.0010148003,0.0000030404717,0.00020936898,0.0014870354],"genre_scores_gemma":[0.8686228,0.000009251334,0.13087593,0.00016072253,0.00003518585,0.0002087754,0.000008889229,0.00001898919,0.000059501934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980631,0.00009454467,0.0005778513,0.00048795505,0.0002635938,0.0005129845],"domain_scores_gemma":[0.9979,0.00034724892,0.00023027984,0.0011316562,0.00026639347,0.00012438887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005963863,0.00023460898,0.00036521425,0.00016659762,0.00017926788,0.0004055678,0.0011315439,0.00013781787,0.000021799644],"category_scores_gemma":[0.000033854183,0.00021856122,0.00006908755,0.00034305008,0.00004160274,0.0009069405,0.00037669446,0.00019960626,0.000031441847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007618148,0.00049515424,0.007983357,0.001087037,0.00022249107,0.000019181145,0.007946468,0.029119998,0.17027046,0.6722356,0.0047094002,0.10583466],"study_design_scores_gemma":[0.0011313994,0.000050537237,0.0030037728,0.00040406254,0.000008666745,0.000028390388,0.00026813956,0.9896395,0.004280717,0.00071350904,0.00015652104,0.00031475368],"about_ca_topic_score_codex":0.0022428299,"about_ca_topic_score_gemma":0.00085527945,"teacher_disagreement_score":0.96051955,"about_ca_system_score_codex":0.00045081234,"about_ca_system_score_gemma":0.00017445232,"threshold_uncertainty_score":0.8912668},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022235757,0.000043282904,0.99443316,0.00025722483,0.00031325404,0.00027374004,0.0000017889508,0.000059190177,0.002394782],"genre_scores_gemma":[0.5865118,0.0000029004054,0.412477,0.0005973535,0.000023600447,0.000014084746,6.4561664e-7,0.0000075626813,0.00036509853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988718,0.00017480974,0.000218412,0.0002735528,0.00026395655,0.00019746696],"domain_scores_gemma":[0.99901223,0.00011372186,0.00005905189,0.0006295035,0.00013555009,0.000049962564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034376342,0.00010834528,0.00012414467,0.000028449558,0.000108395296,0.000050928225,0.00053029327,0.000056433277,0.00007768888],"category_scores_gemma":[0.00005501608,0.00007454128,0.00006356295,0.00031796514,0.000054643348,0.00025348063,0.00009436296,0.0001274428,0.000029463705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001944172,0.00065138465,0.0022739663,0.000028463692,0.000093542265,0.000024107887,0.002149478,0.30856314,0.011110453,0.44405365,0.005635972,0.2253964],"study_design_scores_gemma":[0.000381496,0.000042878357,0.00014454125,0.000020610103,0.0000056788667,0.0000032100345,0.0000498838,0.97466683,0.023220098,0.00018620875,0.0011745563,0.00010401951],"about_ca_topic_score_codex":0.00008567924,"about_ca_topic_score_gemma":0.00003691902,"teacher_disagreement_score":0.66610366,"about_ca_system_score_codex":0.00004095117,"about_ca_system_score_gemma":0.0001069286,"threshold_uncertainty_score":0.30397055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14735615,0.0019713065,0.67787915,0.013666324,0.0011240384,0.0011881748,0.00010391917,0.00024773864,0.15646319],"genre_scores_gemma":[0.9957302,0.0009839102,0.0021263964,0.00043226517,0.000045923887,0.00016921075,0.00002181087,0.000008958342,0.0004812816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872255,0.00022522936,0.00031752867,0.00026815498,0.0002968092,0.0001697095],"domain_scores_gemma":[0.996452,0.001289985,0.00022717584,0.001708334,0.00028128686,0.000041221403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003826992,0.00014963432,0.00015459563,0.00008379677,0.00022859599,0.00014914369,0.0025316672,0.00007387455,0.0000875214],"category_scores_gemma":[0.000040190425,0.000121292804,0.000060457667,0.0002019548,0.0002469198,0.00019881043,0.00038789163,0.00037628307,0.000027008231],"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.000010909122,0.00021615242,0.00014128319,0.0000012094981,0.000023873092,0.0000010857543,0.000079790174,0.014383161,0.00017575554,0.96628493,0.0029984193,0.01568343],"study_design_scores_gemma":[0.00031920036,0.00016717374,0.002825147,0.00008409017,0.000006511346,0.000010568298,0.000025343132,0.9466152,0.00027792525,0.038827427,0.010640604,0.00020078522],"about_ca_topic_score_codex":0.00007459926,"about_ca_topic_score_gemma":0.00034035774,"teacher_disagreement_score":0.9322321,"about_ca_system_score_codex":0.000056337773,"about_ca_system_score_gemma":0.000059148304,"threshold_uncertainty_score":0.4946177},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028787628,0.000024375038,0.9661526,0.0012214399,0.00018105563,0.00038857135,0.000015895459,0.00012288961,0.0031055268],"genre_scores_gemma":[0.78229356,0.000004885383,0.2165905,0.00069948507,0.00018119867,0.000014506273,0.000016535141,0.000009002386,0.00019032757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983763,0.00003446322,0.00039179507,0.00057611277,0.0002918036,0.00032952847],"domain_scores_gemma":[0.9979888,0.000059740785,0.00013354306,0.0016679922,0.00006160767,0.00008831116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000386004,0.00012500123,0.00015936368,0.00004592538,0.00005610532,0.00009208778,0.0017344604,0.000040135186,0.00007684885],"category_scores_gemma":[0.00001528447,0.000116133895,0.000029575098,0.00029312575,0.0000130064645,0.0011747965,0.0016126386,0.000083152394,0.000060910814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005599107,0.00006331593,0.0011918696,0.0000111263535,0.000026893482,0.0000018052281,0.0016407624,0.006366328,0.005065417,0.047624983,0.012001497,0.9260004],"study_design_scores_gemma":[0.00038997247,0.00008304892,0.0013105974,0.000011722406,0.000007616361,0.000003001216,0.00018627913,0.9765113,0.017445415,0.00047880353,0.0033883261,0.00018392458],"about_ca_topic_score_codex":0.0013171348,"about_ca_topic_score_gemma":0.0015267183,"teacher_disagreement_score":0.970145,"about_ca_system_score_codex":0.000059715716,"about_ca_system_score_gemma":0.000071056624,"threshold_uncertainty_score":0.4735803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017511363,0.00023546723,0.9955572,0.0006193645,0.0006088418,0.00046939997,3.9527689e-7,0.00040289544,0.0003553147],"genre_scores_gemma":[0.6488364,0.000013978733,0.3499555,0.00083291257,0.00020162656,0.000059972455,0.0000021122594,0.000012485786,0.000085027175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988051,0.000019276204,0.00021845693,0.0004041487,0.00017297921,0.00038000516],"domain_scores_gemma":[0.9985412,0.0005640037,0.00007700719,0.0006248125,0.00008875574,0.00010423226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018855005,0.00013992895,0.00015101647,0.000038269536,0.00012978255,0.00016085306,0.0006454405,0.00017193127,0.000019073124],"category_scores_gemma":[0.000043964723,0.00012891719,0.0000870144,0.00037698195,0.000024124325,0.00037027485,0.00014023541,0.00016653711,0.000031988104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005315727,0.000019833007,0.000010137703,0.000002426584,0.0000048849097,0.0000012223757,0.000067329565,0.61092705,0.000001529591,0.32214102,0.00008115145,0.066738114],"study_design_scores_gemma":[0.0003446203,0.000087467786,0.00008773507,0.000031723044,0.0000033153601,0.0000011263127,0.000005200894,0.8789689,0.00003885557,0.117223956,0.0030504141,0.00015668436],"about_ca_topic_score_codex":0.0000037323373,"about_ca_topic_score_gemma":0.000015667145,"teacher_disagreement_score":0.64708525,"about_ca_system_score_codex":0.0000694394,"about_ca_system_score_gemma":0.00004541421,"threshold_uncertainty_score":0.5257091},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098487936,0.003936813,0.89160794,0.0012223456,0.00005698495,0.00037118496,4.1645956e-7,0.00027746608,0.0040388852],"genre_scores_gemma":[0.9689187,0.00037069994,0.02959107,0.000901798,0.000015830365,0.000020107864,0.0000111258905,0.000004037403,0.00016661866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982017,0.0003215699,0.00042206867,0.00047940793,0.00022626841,0.00034897547],"domain_scores_gemma":[0.9973986,0.00015376559,0.00011908743,0.0021420321,0.00009118662,0.000095312425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010202436,0.00015218562,0.00034600525,0.00014141764,0.00007728309,0.00015279949,0.001305771,0.00012304875,0.000062044106],"category_scores_gemma":[0.000032165517,0.00014012793,0.00014927927,0.0021582656,0.00004192456,0.00036199304,0.00022071744,0.0002934491,0.000024621108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030022946,0.00074966176,0.056175295,0.0000051631787,0.00018433976,0.00004977295,0.0009540176,0.22927664,0.00004476887,0.030562507,0.0035522978,0.6784155],"study_design_scores_gemma":[0.00023985117,0.00006441366,0.12818986,0.0000092414475,0.000028954399,0.0000016174781,0.000013563939,0.86809915,0.000009266128,0.001595181,0.0015842388,0.00016466796],"about_ca_topic_score_codex":0.00005234044,"about_ca_topic_score_gemma":0.0004911137,"teacher_disagreement_score":0.87043077,"about_ca_system_score_codex":0.00008962172,"about_ca_system_score_gemma":0.000027086646,"threshold_uncertainty_score":0.5714251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039265663,0.000031624753,0.93979865,0.00013189479,0.0001672257,0.05340103,0.0000014867607,0.0007242211,0.0018172951],"genre_scores_gemma":[0.72792435,0.0000042000047,0.17716224,0.0011061435,0.0008291129,0.09003966,0.000030988358,0.00013580163,0.0027674905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707705,0.000077512916,0.00045611922,0.0008841876,0.00039420117,0.001110937],"domain_scores_gemma":[0.99787813,0.00018155837,0.00024536924,0.0011018119,0.0002549155,0.00033819932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012238917,0.00035252044,0.00032096868,0.00009871936,0.000289443,0.00034014706,0.001280349,0.00022984494,0.000055074426],"category_scores_gemma":[0.000012295941,0.0002762881,0.00007746783,0.000780094,0.000076823824,0.0006917586,0.00027489182,0.00031047268,0.0000111359695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065470976,0.0006908069,0.00093264575,0.00017340164,0.000113576105,0.00021643064,0.0046130014,0.002974838,0.00023899623,0.04849374,0.0044088587,0.936489],"study_design_scores_gemma":[0.0019530226,0.001100326,0.00081932184,0.00009154784,0.00001629958,0.00005196778,0.00010073818,0.97325665,0.0005435007,0.0003377635,0.021141205,0.0005876824],"about_ca_topic_score_codex":0.000014961602,"about_ca_topic_score_gemma":0.0005818399,"teacher_disagreement_score":0.9702818,"about_ca_system_score_codex":0.00008187024,"about_ca_system_score_gemma":0.00008605937,"threshold_uncertainty_score":0.99996895},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060503418,0.9094238,0.05411478,0.009436753,0.00036009113,0.0057204324,0.000010764109,0.0008760647,0.014006937],"genre_scores_gemma":[0.68368584,0.2710058,0.04202687,0.0018151053,0.00004466373,0.0011346948,0.000014330996,0.00003056666,0.000242136],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971727,0.00061346,0.0007799867,0.00068436004,0.00023242873,0.00051705365],"domain_scores_gemma":[0.9924388,0.0009840542,0.0003195605,0.0059584067,0.00015768288,0.00014148933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095804635,0.00030492956,0.00059337384,0.00010978982,0.00035172427,0.00013788491,0.0048068557,0.00009104057,0.000034902776],"category_scores_gemma":[0.00034268064,0.00029161293,0.00012289635,0.0012868802,0.0002030767,0.0004237677,0.0036245037,0.0006088909,0.00012763542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010595226,0.0002569468,0.000499517,0.0003106001,0.000020929867,0.000007682149,0.00063727837,0.0002467727,0.000011247478,0.009540468,0.0036385236,0.98482895],"study_design_scores_gemma":[0.00088175293,0.00025972762,0.0016691742,0.008485686,0.00004612756,0.00020481377,0.00011077288,0.47416443,0.00003333934,0.0023729794,0.5107605,0.0010106753],"about_ca_topic_score_codex":0.00005250466,"about_ca_topic_score_gemma":0.000034041084,"teacher_disagreement_score":0.9838183,"about_ca_system_score_codex":0.00012312147,"about_ca_system_score_gemma":0.00003964262,"threshold_uncertainty_score":0.9999536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018402444,0.0075472314,0.9569046,0.012181442,0.00052436226,0.0005108031,0.000003190987,0.0005053873,0.019982746],"genre_scores_gemma":[0.92871827,0.00092592416,0.06864913,0.0011458814,0.00006344681,0.00012304196,0.000017522558,0.000018706782,0.0003380887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843955,0.00027245795,0.0004207861,0.00031466357,0.00017829056,0.0003742724],"domain_scores_gemma":[0.9953202,0.00049634563,0.00014407728,0.003846522,0.00010006751,0.00009277405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003837057,0.00016509205,0.0001879052,0.00016006225,0.00024455035,0.0001498553,0.003132144,0.000097334734,0.000065506254],"category_scores_gemma":[0.00003648328,0.00018508892,0.00006896202,0.001202184,0.00010599046,0.00037119968,0.00040783783,0.00047853068,0.00035606232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001720779,0.0021597228,0.004499611,0.000025892043,0.000054986413,0.00006281407,0.0014210371,0.25250602,0.0007555502,0.066864,0.062174134,0.60945904],"study_design_scores_gemma":[0.00042618503,0.000036717902,0.0022057493,0.0000645146,0.0000044479816,0.0000086099735,0.0000038940548,0.9809852,0.000018060342,0.0002854773,0.015767312,0.00019377975],"about_ca_topic_score_codex":0.000007271028,"about_ca_topic_score_gemma":0.0002525183,"teacher_disagreement_score":0.92687804,"about_ca_system_score_codex":0.00012987114,"about_ca_system_score_gemma":0.000027091777,"threshold_uncertainty_score":0.7547707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45619252,0.00646388,0.48783484,0.0009671002,0.0008938328,0.041436817,9.796842e-7,0.00023006187,0.005979948],"genre_scores_gemma":[0.99083734,0.0006394747,0.003957936,0.0005714938,0.00093263964,0.0030091137,1.6964064e-7,0.000018511739,0.000033350127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978552,0.00008695239,0.00091541954,0.00033593524,0.00032368794,0.0004827903],"domain_scores_gemma":[0.9983889,0.00035759056,0.0008270776,0.00022298406,0.00007622818,0.00012726123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016058148,0.00024765148,0.0005908364,0.00011881018,0.00016177217,0.00007281818,0.0006846047,0.00018958462,8.6963394e-7],"category_scores_gemma":[0.00007746423,0.00019405202,0.000070284885,0.00031549088,0.00015731915,0.00035051638,0.0005999676,0.0013032972,0.0000028999143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012432606,0.00008860143,0.0059691747,0.00022483683,0.0001626923,0.000029666871,0.005550547,0.3239002,0.002147482,0.0070420275,0.0052165682,0.6495439],"study_design_scores_gemma":[0.0059613655,0.0008151178,0.0038070653,0.0011836134,0.000060727536,0.000058844766,0.0034377775,0.95866865,0.0013698377,0.0030056569,0.020551212,0.0010801494],"about_ca_topic_score_codex":0.0000010477823,"about_ca_topic_score_gemma":0.0000019238184,"teacher_disagreement_score":0.6484637,"about_ca_system_score_codex":0.000068586116,"about_ca_system_score_gemma":0.000043075117,"threshold_uncertainty_score":0.79132116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021130277,0.0004539546,0.97411853,0.0014044738,0.0011944197,0.0010181236,0.000045074114,0.00041942493,0.01923299],"genre_scores_gemma":[0.9393056,0.0002033431,0.058848117,0.00009055163,0.00013087418,0.0010226396,0.00005609001,0.00001866908,0.0003241394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830097,0.0001701916,0.00050772616,0.00042016903,0.00029634094,0.00030460104],"domain_scores_gemma":[0.9974657,0.00032053347,0.00025706404,0.0014366404,0.0004596631,0.00006038044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034611308,0.00020808922,0.00019999512,0.00024154449,0.0002216359,0.00023682528,0.0028142836,0.00014442667,0.000009975682],"category_scores_gemma":[0.000012464781,0.00022856124,0.00010375127,0.00036975092,0.00006534835,0.0003757256,0.00024061058,0.00037272717,0.000044537403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001016713,0.0010129398,0.00036526768,0.000019006698,0.00006593976,0.000009089221,0.00027826012,0.012787785,0.00094619463,0.87972116,0.0015079529,0.10318475],"study_design_scores_gemma":[0.00064959266,0.00011362105,0.0011763975,0.00011237184,0.000011709075,0.000013820997,0.00006408105,0.9866058,0.00044433633,0.0019131256,0.008648277,0.0002468683],"about_ca_topic_score_codex":0.00015731131,"about_ca_topic_score_gemma":0.0027699794,"teacher_disagreement_score":0.973818,"about_ca_system_score_codex":0.00052163104,"about_ca_system_score_gemma":0.00010512828,"threshold_uncertainty_score":0.9320457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010876614,0.00005976647,0.9947305,0.00006348661,0.0009347196,0.001452056,0.00000309615,0.0006537272,0.0010150408],"genre_scores_gemma":[0.7056336,0.0000051764664,0.29262492,0.00043059886,0.00014539609,0.00039643823,0.0000045748616,0.000038739643,0.00072058593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970842,0.00015088776,0.00053487107,0.00097249536,0.0003285196,0.0009290231],"domain_scores_gemma":[0.99753535,0.00063336396,0.00020990225,0.001170521,0.00021811908,0.00023276925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010079606,0.00039244577,0.00042698614,0.00025336907,0.00027738712,0.00017005642,0.0014401657,0.00022068045,0.000035780664],"category_scores_gemma":[0.00014742362,0.00033828206,0.00023781478,0.00092362403,0.00008729954,0.0004463671,0.0002632669,0.00029703727,0.000022638305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000320808,0.0044026263,0.006404188,0.00032851173,0.00029374703,0.00006467899,0.0065928544,0.37704188,0.000031704218,0.43089017,0.0064237006,0.16720513],"study_design_scores_gemma":[0.0014837543,0.00029029028,0.0012005469,0.00005685096,0.000013939978,0.0000029484072,0.00007048792,0.99560875,0.0004802101,0.00027938042,0.00007350777,0.00043930835],"about_ca_topic_score_codex":0.00020006616,"about_ca_topic_score_gemma":0.00015825954,"teacher_disagreement_score":0.7045459,"about_ca_system_score_codex":0.00013980051,"about_ca_system_score_gemma":0.00008130669,"threshold_uncertainty_score":0.9999069},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012483921,0.000008227996,0.95678395,0.0011548429,0.0012431241,0.00027845122,3.8324305e-7,0.0003015622,0.027745513],"genre_scores_gemma":[0.7793333,0.000013549122,0.21632749,0.00067288405,0.00026747782,0.000035826757,0.000014792967,0.000017849958,0.0033168443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831265,0.000056377194,0.000302914,0.00046269738,0.0003557451,0.0005096312],"domain_scores_gemma":[0.9987995,0.00008684191,0.000082619095,0.00078921765,0.00013813654,0.00010369971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006587864,0.0001567645,0.00019379286,0.000057264097,0.00008721854,0.00020464495,0.00087302295,0.00016177913,0.0005668201],"category_scores_gemma":[0.000025418538,0.00014529769,0.000042121756,0.0008722945,0.00003945155,0.0007573257,0.0002705611,0.00039047227,0.00007336113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066125094,0.00012346319,0.009158445,0.000006663384,0.000013355098,0.00003862759,0.0002764942,0.53378177,0.00024646992,0.38761348,0.05588309,0.012851568],"study_design_scores_gemma":[0.00029262863,0.000022017772,0.0010542509,0.000008013332,0.0000021020874,0.000010219522,0.000007120597,0.99242276,0.000279819,0.0019557634,0.0037501648,0.00019516879],"about_ca_topic_score_codex":0.00012731922,"about_ca_topic_score_gemma":0.00069983804,"teacher_disagreement_score":0.7668494,"about_ca_system_score_codex":0.000026010062,"about_ca_system_score_gemma":0.00009699084,"threshold_uncertainty_score":0.62062824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005396058,0.00008729494,0.9948911,0.00032115955,0.0017056448,0.0010988339,0.0000020767018,0.0004593906,0.00089487387],"genre_scores_gemma":[0.9520279,0.000034922134,0.0432674,0.0016661925,0.0007406004,0.00023435499,0.000010575195,0.000044526143,0.0019735408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696594,0.00005287209,0.0005622441,0.00081448635,0.0004171864,0.0011872565],"domain_scores_gemma":[0.998108,0.0003057478,0.0001900801,0.0008880615,0.00014694288,0.0003611228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014177661,0.00033536123,0.00035378852,0.00008837127,0.00023724395,0.00019589595,0.0011885733,0.00023456433,0.000025560816],"category_scores_gemma":[0.000021954827,0.00030589596,0.00018948108,0.00039217112,0.000054905293,0.00041979985,0.00041536774,0.00022268029,0.00003466803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034574218,0.0018558161,0.00034209876,0.000094194125,0.0003963603,0.00018063032,0.001986194,0.23334596,0.0007683412,0.4751275,0.05876888,0.22678831],"study_design_scores_gemma":[0.0012826689,0.00018065084,0.00046789052,0.00002638685,0.0000111868285,0.000008054825,0.000042363143,0.9932639,0.001605443,0.0007314383,0.001963663,0.00041633734],"about_ca_topic_score_codex":0.000033497323,"about_ca_topic_score_gemma":0.0002799848,"teacher_disagreement_score":0.95162374,"about_ca_system_score_codex":0.00011739593,"about_ca_system_score_gemma":0.000062558734,"threshold_uncertainty_score":0.9999393},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7170471,0.00004401113,0.2777173,0.0003708905,0.000060844046,0.00006990833,3.5513487e-8,0.00008090462,0.004609011],"genre_scores_gemma":[0.9649612,0.000008076233,0.03438011,0.0005756996,0.0000452345,0.0000018359908,2.2515918e-7,0.0000021391572,0.000025490492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931496,0.00002240971,0.00013606125,0.00022135304,0.00010445324,0.00020074288],"domain_scores_gemma":[0.99972165,0.000029074206,0.000023950066,0.00017008613,0.000008805343,0.000046437017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002448187,0.000067111185,0.000082728635,0.000041194493,0.000042774387,0.00009802092,0.00025150695,0.000031839885,0.0000060524994],"category_scores_gemma":[0.000005866575,0.0000630798,0.000011268781,0.00020671918,0.000010953331,0.0003236703,0.00013656105,0.000104971456,0.0000056423078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003968091,0.00006579053,0.026980845,0.000003996533,0.0000038501657,0.000040368403,0.00054252625,0.0017507349,0.004029553,0.4229005,0.000088277186,0.5435896],"study_design_scores_gemma":[0.00029252976,0.0000451422,0.03277691,0.00002787043,6.212496e-7,0.000012315494,0.00003722838,0.9637033,0.0014182713,0.0015416631,0.000024474091,0.00011970817],"about_ca_topic_score_codex":0.000040277613,"about_ca_topic_score_gemma":0.00003253713,"teacher_disagreement_score":0.9619525,"about_ca_system_score_codex":0.00002692453,"about_ca_system_score_gemma":0.000012682162,"threshold_uncertainty_score":0.25723198},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027953572,0.0000946631,0.9687967,0.00053707336,0.0014568829,0.023577841,0.000005041005,0.00041310565,0.005115954],"genre_scores_gemma":[0.14960603,0.00001108076,0.8281051,0.003318326,0.0029407372,0.014858821,0.000009520024,0.00019912636,0.00095126336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99356985,0.0000507284,0.00085092837,0.0026481969,0.0015817644,0.001298553],"domain_scores_gemma":[0.99586684,0.00037171328,0.0005908751,0.0025561226,0.0002973524,0.00031710273],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000976925,0.0009045121,0.00077804417,0.00046366232,0.00042042724,0.0010562628,0.006031828,0.0005445445,0.00005789108],"category_scores_gemma":[0.00009824117,0.00083273737,0.00022218967,0.0010858983,0.0007976102,0.0009216945,0.0022469102,0.0017250598,0.00009098189],"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.000016404614,0.00006637878,0.000049694587,0.00015375746,0.00001801484,0.0004005301,0.0012230692,0.10212692,0.000051444415,0.39758122,0.00006486422,0.4982477],"study_design_scores_gemma":[0.0009011442,0.00033711165,0.00010546045,0.0020793534,0.000008818904,0.00013426106,1.1904529e-7,0.60949147,0.00067405886,0.37343222,0.011222119,0.0016138885],"about_ca_topic_score_codex":0.000026113203,"about_ca_topic_score_gemma":0.00014201693,"teacher_disagreement_score":0.5073645,"about_ca_system_score_codex":0.0010526156,"about_ca_system_score_gemma":0.0014090221,"threshold_uncertainty_score":0.99998075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022589734,0.00016814169,0.99476016,0.0017334709,0.00028534947,0.00040840366,0.000007937527,0.00013864675,0.00023894553],"genre_scores_gemma":[0.23527996,0.000013172701,0.76211363,0.0005427655,0.0011892266,0.00011946223,0.000011875955,0.000015847354,0.0007140814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989079,0.000019411831,0.00022633308,0.0003727938,0.0001892274,0.00028430118],"domain_scores_gemma":[0.9990927,0.00009834853,0.00010236711,0.00041766488,0.00020120764,0.000087742745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012164318,0.00016344259,0.00018666063,0.000065764914,0.00014578037,0.0000617111,0.0004511394,0.000098946846,0.00001656416],"category_scores_gemma":[0.000004622606,0.00012025264,0.00008156165,0.0003756624,0.000052335326,0.00021291994,0.00008028139,0.000165298,0.00000147953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004058702,0.00034401595,0.0002438042,0.000012157495,0.00007649651,0.0000011094697,0.00040548155,0.82396466,0.0035367531,0.045781486,0.003051103,0.12254234],"study_design_scores_gemma":[0.00079641416,0.00008853421,0.0008690962,0.000016362927,0.000008570065,0.000044156164,0.000017545484,0.9872282,0.0009323252,0.000029768085,0.009795,0.00017399022],"about_ca_topic_score_codex":0.000016750015,"about_ca_topic_score_gemma":0.0014466062,"teacher_disagreement_score":0.23302098,"about_ca_system_score_codex":0.000027206457,"about_ca_system_score_gemma":0.00007202141,"threshold_uncertainty_score":0.49037606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04360109,0.00003302492,0.9512275,0.0028421353,0.0002956843,0.0010170448,0.000012777381,0.00066667516,0.0003041048],"genre_scores_gemma":[0.95345896,0.00025022714,0.04510073,0.00042312423,0.000048747665,0.0005656945,0.000033909288,0.000039813876,0.000078790006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972608,0.00032123463,0.0008656463,0.00063065416,0.00023419302,0.0006874539],"domain_scores_gemma":[0.99484366,0.0016110076,0.00030250472,0.0028503481,0.00020844536,0.00018403458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008155845,0.00033983434,0.0004502918,0.00039105595,0.00090944534,0.00021207043,0.0023812205,0.00025753913,0.000021133641],"category_scores_gemma":[0.000012436198,0.00039893476,0.00026103127,0.0014031323,0.00013148897,0.00051513384,0.0000100041725,0.0007596422,0.000022859373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037549424,0.0007349143,0.000008173986,0.000010443009,0.000026192312,0.0000022297406,0.00026032084,0.7884986,0.0011779342,0.014078307,0.00007008644,0.19509524],"study_design_scores_gemma":[0.0010460897,0.0001893377,0.00007983678,0.00015145306,0.00002641309,0.000006371889,0.00005009461,0.9962473,0.0014565571,0.00028163617,0.00006891668,0.00039598515],"about_ca_topic_score_codex":0.000059870938,"about_ca_topic_score_gemma":0.00045405646,"teacher_disagreement_score":0.90985787,"about_ca_system_score_codex":0.0002510121,"about_ca_system_score_gemma":0.0002350731,"threshold_uncertainty_score":0.9998463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008555151,0.00022632962,0.9944323,0.0021180382,0.00061976886,0.0013047336,0.000010604339,0.0003761063,0.00005663868],"genre_scores_gemma":[0.92416984,0.00066085014,0.07385617,0.000431896,0.00005747797,0.0006085175,0.000009808215,0.000043737386,0.00016170245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971639,0.00039941043,0.0007930526,0.00069973985,0.00022046147,0.0007234462],"domain_scores_gemma":[0.99552244,0.001460985,0.00029959716,0.0021721073,0.00027924907,0.00026560522],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001486359,0.00037406702,0.00043046664,0.00022333434,0.0013671553,0.00017454015,0.0018641829,0.00033007597,0.000007012584],"category_scores_gemma":[0.000018114386,0.0003894408,0.00015383193,0.00056965055,0.0003970676,0.00042104392,0.00007187924,0.0007582099,0.000010414212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002512237,0.0037346836,0.000024162127,0.00007161994,0.0005467952,0.0000097847105,0.0069767353,0.6260011,0.005844863,0.10452379,0.0008126768,0.25120255],"study_design_scores_gemma":[0.0009223277,0.00023206529,0.000091484355,0.00008480417,0.000041154704,0.000032862055,0.00034122326,0.98927104,0.007910791,0.00056117104,0.00011303024,0.00039803397],"about_ca_topic_score_codex":0.00006401967,"about_ca_topic_score_gemma":0.00042239076,"teacher_disagreement_score":0.92331433,"about_ca_system_score_codex":0.00020594591,"about_ca_system_score_gemma":0.00007421067,"threshold_uncertainty_score":0.99993294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013712365,0.000083144805,0.9823504,0.00019552074,0.00031380032,0.00026598267,1.871824e-7,0.00015229647,0.0029262926],"genre_scores_gemma":[0.89984685,0.00054556987,0.09863671,0.00046060095,0.00014209579,0.000030635925,0.0000031479235,0.000012510783,0.00032187236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988171,0.000040326053,0.00024458667,0.0003936093,0.00016557804,0.0003388397],"domain_scores_gemma":[0.9993101,0.00008947558,0.000059109923,0.0004000401,0.000049894305,0.00009141227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001703522,0.00014710672,0.00018022387,0.000071149305,0.000116218755,0.000063342886,0.0004064591,0.00011314978,0.000022317885],"category_scores_gemma":[0.000008534742,0.00013447575,0.000025459929,0.00046337402,0.000064099346,0.0006715952,0.0002743425,0.00016339186,0.000007639301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070331157,0.00007574652,0.0027744093,0.000006036467,0.000008052349,0.00006161615,0.0009500329,0.95271176,0.0000047769195,0.026695216,0.0013547073,0.015350603],"study_design_scores_gemma":[0.0004776953,0.000034168293,0.0014765814,0.000015586971,0.0000013643803,0.000046762758,0.000021413747,0.99755293,0.00003844458,0.00008774567,0.00007771126,0.0001695983],"about_ca_topic_score_codex":0.00010511952,"about_ca_topic_score_gemma":0.00012034658,"teacher_disagreement_score":0.8861345,"about_ca_system_score_codex":0.000038578593,"about_ca_system_score_gemma":0.000029327528,"threshold_uncertainty_score":0.54837614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007898991,0.0000022509923,0.9497244,0.0005927613,0.000036424983,0.029260434,4.5678746e-8,0.00031626906,0.019277519],"genre_scores_gemma":[0.9602594,2.6925707e-7,0.02570348,0.0005159813,0.00014719227,0.013129499,6.953815e-8,0.0000036513445,0.00024048185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993329,0.000029323206,0.00011614535,0.00025105043,0.000100672936,0.00016990857],"domain_scores_gemma":[0.9996514,0.000021860673,0.000040608116,0.00020328045,0.000031800722,0.000051063787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017507542,0.00007149902,0.00006396306,0.00002658339,0.00008814377,0.00013003501,0.00015934218,0.000038594906,0.0000045071442],"category_scores_gemma":[0.000013626703,0.000059502116,0.000015390515,0.00017296533,0.000011587906,0.00034471383,0.00006890629,0.00009178884,0.000054628876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036966842,0.00001377975,0.00008305891,0.0000029408757,0.0000012339792,0.0000035697744,0.0000857974,0.000028189881,0.0016249914,0.021758148,0.000078305726,0.9763163],"study_design_scores_gemma":[0.00090667285,0.0006593249,0.017854001,0.000046574758,0.0000023688747,0.00006687986,0.000011789664,0.9205353,0.035958156,0.014720353,0.00890508,0.00033347608],"about_ca_topic_score_codex":0.0000046114524,"about_ca_topic_score_gemma":0.0000075619932,"teacher_disagreement_score":0.9759828,"about_ca_system_score_codex":0.000017305563,"about_ca_system_score_gemma":0.000012665852,"threshold_uncertainty_score":0.24264258},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074222885,0.0000035440848,0.9230018,0.00028044128,0.00064109504,0.00052460784,2.6795743e-7,0.00021145676,0.0011138716],"genre_scores_gemma":[0.9389049,0.0000033131514,0.05958235,0.00029534727,0.0002987517,0.00012122142,0.000008071963,0.000018484006,0.00076757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984901,0.000040373223,0.00036233768,0.00048276287,0.00015261995,0.00047181695],"domain_scores_gemma":[0.99853325,0.0003687629,0.00013845251,0.00071489037,0.00012517313,0.00011948775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057313265,0.00015703458,0.00019023694,0.000068245135,0.00011127577,0.00015829034,0.0007652165,0.00014492207,0.000020017376],"category_scores_gemma":[0.00012633025,0.00015294288,0.00004695021,0.0004152533,0.00003474856,0.0002915286,0.00021187658,0.0003112395,0.000012564652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002558819,0.00016861498,0.0017530079,0.000039830953,0.000017404282,0.000008661464,0.0009986431,0.034002975,0.020059004,0.35549393,0.000775319,0.58665705],"study_design_scores_gemma":[0.0003644199,0.000032101398,0.0009457258,0.00002375757,0.000002950846,0.0000054975735,0.00002106906,0.9955091,0.0016282249,0.00054996245,0.0007143043,0.0002028768],"about_ca_topic_score_codex":0.000036931186,"about_ca_topic_score_gemma":0.00016064406,"teacher_disagreement_score":0.9615061,"about_ca_system_score_codex":0.00003464684,"about_ca_system_score_gemma":0.0000863142,"threshold_uncertainty_score":0.623683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024681873,0.017535526,0.9788189,0.00007720613,0.0017850292,0.0006100656,0.0000017789414,0.00020880836,0.0007158641],"genre_scores_gemma":[0.50692457,0.002004166,0.48736286,0.0015850608,0.0012275755,0.00008212109,0.000015734768,0.00019846589,0.0005994397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933019,0.00015444783,0.0010156345,0.0025338163,0.0012840527,0.0017101286],"domain_scores_gemma":[0.9962956,0.0007826688,0.0004941746,0.0018664633,0.00022413365,0.00033696252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020787015,0.0008927231,0.0010618899,0.0009868529,0.00040986613,0.0006897688,0.003799341,0.0006936408,0.000036931473],"category_scores_gemma":[0.000026823136,0.0008483032,0.0002031665,0.0014903323,0.0004765773,0.00044919195,0.001508884,0.0013377678,0.000007351685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006997795,0.000020308747,0.0000074980107,0.000018539135,0.0000035426133,0.00004061223,0.00025004693,0.5389779,0.00006569386,0.0014429045,0.000006432424,0.45915952],"study_design_scores_gemma":[0.00050359813,0.0001743291,0.000010173437,0.0012587006,0.000010706638,0.00004982463,4.996887e-7,0.98268884,0.0004943398,0.0042347563,0.00966772,0.0009064903],"about_ca_topic_score_codex":0.000064435895,"about_ca_topic_score_gemma":0.00016429773,"teacher_disagreement_score":0.50667775,"about_ca_system_score_codex":0.00080868194,"about_ca_system_score_gemma":0.0005965624,"threshold_uncertainty_score":0.9993968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34920755,0.00021679001,0.649187,0.0004242717,0.00021321895,0.0002752129,8.2969495e-7,0.00031182007,0.00016330031],"genre_scores_gemma":[0.967145,0.000066229564,0.032348014,0.000112569025,0.000013014544,0.00023126819,0.0000011133573,0.00002062417,0.00006211293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998413,0.000067523004,0.0003521898,0.0005855662,0.0001624282,0.000419237],"domain_scores_gemma":[0.99817276,0.00007174135,0.00008972522,0.0015110607,0.00007999482,0.00007473349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000472097,0.00020392232,0.00023758323,0.00042598328,0.00024159071,0.00012801353,0.0010511153,0.0004949696,0.000012113082],"category_scores_gemma":[0.000007668017,0.0002067561,0.000066721565,0.0011985141,0.0003401418,0.00015579436,0.00003249861,0.0015225549,0.000020136125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021158618,0.00066075474,0.00054066145,0.000015316356,0.000026579728,0.000015986183,0.00020507311,0.8843699,0.0037869094,0.011627475,0.000038859194,0.09869129],"study_design_scores_gemma":[0.000640012,0.00009194819,0.00040917908,0.000033406737,0.00000691418,0.00010907259,0.000029934165,0.99186915,0.0053038425,0.00056010304,0.00073619944,0.00021021625],"about_ca_topic_score_codex":0.00006669353,"about_ca_topic_score_gemma":0.00013231169,"teacher_disagreement_score":0.6179375,"about_ca_system_score_codex":0.000059046084,"about_ca_system_score_gemma":0.000029607236,"threshold_uncertainty_score":0.8431269},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021638207,0.00037604134,0.96535444,0.001630798,0.0007896742,0.0011964801,0.000009541837,0.0005199404,0.008484891],"genre_scores_gemma":[0.9632999,0.0005271891,0.034808267,0.0003693286,0.00021305645,0.00015088104,0.00003903446,0.000041937,0.0005504063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695784,0.00030682742,0.0009769191,0.00057932956,0.00032706172,0.00085200235],"domain_scores_gemma":[0.99249744,0.0018867562,0.00029916802,0.004887074,0.00019095831,0.00023857872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016109166,0.00034187525,0.00043677157,0.00025418386,0.00034601,0.00023299576,0.0047810096,0.00018632009,0.000026087151],"category_scores_gemma":[0.00013645581,0.00032373407,0.00010331431,0.0019364436,0.00027385406,0.00060102716,0.0011546633,0.0007395023,0.00011849364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020488849,0.003726417,0.051620714,0.000025152183,0.00014938044,0.0003923028,0.0036173153,0.014504657,0.0032178746,0.098733075,0.018020174,0.80578804],"study_design_scores_gemma":[0.0008740813,0.00008299871,0.03765581,0.00016757615,0.0000150605065,0.000042913358,0.000096241056,0.9552283,0.00006271208,0.000075744465,0.005286594,0.0004119391],"about_ca_topic_score_codex":0.0000930523,"about_ca_topic_score_gemma":0.017570442,"teacher_disagreement_score":0.9416617,"about_ca_system_score_codex":0.00021734364,"about_ca_system_score_gemma":0.000112062524,"threshold_uncertainty_score":0.9999215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007465512,0.000025932817,0.968008,0.0004992673,0.00023682055,0.00017473954,1.4402724e-7,0.000116960924,0.02347261],"genre_scores_gemma":[0.984384,0.0000015474143,0.0129977595,0.0021914907,0.00007540062,0.0000075472685,1.9823888e-7,0.0000049152713,0.00033712172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989958,0.000028098808,0.00019550907,0.00026233608,0.00016332488,0.00035497578],"domain_scores_gemma":[0.99923563,0.00020955084,0.000030173962,0.00040409295,0.00003183128,0.00008873194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000506158,0.00008207941,0.000108280976,0.000078395045,0.000024800773,0.00012388786,0.00083021505,0.00005397039,0.00007768151],"category_scores_gemma":[0.0000174014,0.00007000497,0.000026640113,0.00035113265,0.000020458294,0.00047580773,0.0001958895,0.00012705843,0.000082745806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047829068,0.0004241891,0.082966276,0.0000150592205,0.000034102075,0.00059177924,0.0007523486,0.008101533,0.0006260347,0.29349622,0.009196231,0.6037484],"study_design_scores_gemma":[0.0015637621,0.000027222575,0.1208749,0.000010708896,0.0000018424494,0.00001738456,0.000020237352,0.87018454,0.00069907843,0.001554713,0.0048179445,0.00022766001],"about_ca_topic_score_codex":0.000079324425,"about_ca_topic_score_gemma":0.00042190822,"teacher_disagreement_score":0.9769185,"about_ca_system_score_codex":0.000034222594,"about_ca_system_score_gemma":0.000019193323,"threshold_uncertainty_score":0.285472},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09417366,0.00010012722,0.90236765,0.00042404808,0.0010518372,0.00044067032,0.0000014442685,0.00023159928,0.0012089913],"genre_scores_gemma":[0.9374206,0.000025766501,0.058010586,0.00088554417,0.00034737188,0.00009702626,0.0000035022586,0.000016614164,0.0031930099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998399,0.00005515989,0.00026694863,0.00054379844,0.00016517258,0.0005699039],"domain_scores_gemma":[0.9986225,0.0004017405,0.00007753067,0.00071091467,0.00007456571,0.000112771064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017734735,0.0001777312,0.00024054995,0.000051477982,0.0002414902,0.00006725243,0.00070672255,0.00012583878,0.000015934058],"category_scores_gemma":[0.000019371953,0.0001492498,0.00012595385,0.00025420816,0.00012619558,0.00014550168,0.000280702,0.0001391797,0.000027769878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047637513,0.00029193488,0.0012265943,0.000014365992,0.00004609093,0.00009435408,0.00046275486,0.7639965,0.0002837161,0.19254614,0.016160969,0.024828976],"study_design_scores_gemma":[0.0005012273,0.00008591713,0.0006698338,0.0000056369795,0.0000034429759,0.000078351906,0.000014671422,0.99554324,0.0003685515,0.00010826511,0.0024105783,0.00021026288],"about_ca_topic_score_codex":0.00003491883,"about_ca_topic_score_gemma":0.000020830426,"teacher_disagreement_score":0.844357,"about_ca_system_score_codex":0.00004517892,"about_ca_system_score_gemma":0.000051306775,"threshold_uncertainty_score":0.608623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015814776,0.0013647575,0.9762259,0.000101199905,0.001312825,0.0012388353,0.0000011556359,0.00015178455,0.0037887671],"genre_scores_gemma":[0.74894667,0.00026281775,0.24213403,0.0013392332,0.0011606086,0.0006737149,0.00002809573,0.00005132061,0.0054034875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975839,0.000083263745,0.0004960503,0.0007023942,0.00019669604,0.0009376791],"domain_scores_gemma":[0.99888766,0.00014486244,0.00012761542,0.0007407102,0.000032905584,0.00006624124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040298657,0.00024701882,0.0003034352,0.00009897858,0.00014512955,0.00021936346,0.0009091219,0.00014793845,0.00003066017],"category_scores_gemma":[0.0000019311544,0.00023747748,0.00011958093,0.000634621,0.000053794447,0.00059282396,0.0005912084,0.000156786,0.000009851731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017650178,0.00009511418,0.0012484121,0.00001319813,0.000018208932,0.000036850157,0.000016206921,0.89144105,0.000002712207,0.059059475,0.016066205,0.031984914],"study_design_scores_gemma":[0.000739022,0.00009784009,0.002354673,0.000037642876,0.000011577251,0.000007990083,0.000017966518,0.94624853,0.000011725929,0.008753572,0.041410945,0.00030851061],"about_ca_topic_score_codex":0.000080919875,"about_ca_topic_score_gemma":0.000365374,"teacher_disagreement_score":0.7340919,"about_ca_system_score_codex":0.00016263904,"about_ca_system_score_gemma":0.000022431814,"threshold_uncertainty_score":0.968405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023828972,0.00003665396,0.95760643,0.00011709831,0.0004272143,0.00018230766,7.9523595e-8,0.00019252107,0.017608698],"genre_scores_gemma":[0.9799467,0.0000040193618,0.019097464,0.0007570972,0.000034850364,0.000032070773,4.2248047e-7,0.000010334873,0.0001170625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859893,0.00019645908,0.00020682711,0.00042397322,0.00015185335,0.00042194227],"domain_scores_gemma":[0.99894613,0.00027405223,0.000048270893,0.00061076134,0.000028310094,0.00009247951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006162329,0.00013943257,0.00018420027,0.00007096544,0.000057438974,0.0001086531,0.00049475854,0.00009177378,0.00007060684],"category_scores_gemma":[0.000029491608,0.00013573196,0.00004515829,0.00059587444,0.00002465892,0.0003109012,0.00012207749,0.0002177081,0.000019006935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010971253,0.00019550796,0.018483857,0.000015511941,0.000009584347,0.00009677507,0.000106646745,0.67696625,0.00014977326,0.23464894,0.0010369826,0.06827923],"study_design_scores_gemma":[0.00043422834,0.000025198395,0.0019004759,0.000018838096,8.023587e-7,0.000006241812,0.000005772016,0.9958681,0.00038101702,0.0004157491,0.000765161,0.00017844021],"about_ca_topic_score_codex":0.000060230817,"about_ca_topic_score_gemma":0.00071383454,"teacher_disagreement_score":0.9561177,"about_ca_system_score_codex":0.000072149975,"about_ca_system_score_gemma":0.000055097928,"threshold_uncertainty_score":0.55349886},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25845775,0.000053264295,0.7198825,0.00023008774,0.00019925751,0.00030031847,2.929332e-7,0.000099378674,0.02077715],"genre_scores_gemma":[0.9756486,0.000019096551,0.02396781,0.00015790702,0.000049113423,0.000008756895,0.00000517938,0.0000022478569,0.0001412855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874544,0.000057556073,0.0002495222,0.00016256029,0.0006270256,0.00015789112],"domain_scores_gemma":[0.9992349,0.000021343609,0.0001054137,0.00038203213,0.00021698885,0.000039301045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086183276,0.00007853465,0.00009734286,0.00006378986,0.000042823445,0.00003194145,0.0003674676,0.000045019686,0.00006840138],"category_scores_gemma":[0.000011086379,0.00007004552,0.000027412903,0.00027232175,0.00001281536,0.0011333432,0.000046885718,0.000057715682,0.00006304638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023159473,0.0000335703,0.000030581094,0.0000020542097,0.0000022583793,2.1911815e-7,0.00019856678,0.015408804,0.00034186608,0.007893123,0.00069768145,0.97538894],"study_design_scores_gemma":[0.00034448734,0.00023496857,0.012609781,0.0000129434,0.000005814204,0.000008067429,0.00000940145,0.98074293,0.0051769656,0.00061513385,0.00015702976,0.0000824793],"about_ca_topic_score_codex":0.0000027922913,"about_ca_topic_score_gemma":0.0000021998596,"teacher_disagreement_score":0.97530645,"about_ca_system_score_codex":0.000049015638,"about_ca_system_score_gemma":0.000037972415,"threshold_uncertainty_score":0.28563735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08569707,0.0009116481,0.9109086,0.00005791137,0.00020518362,0.001491842,0.0000033284387,0.0003526292,0.0003718269],"genre_scores_gemma":[0.7603026,0.000006338907,0.23809144,0.00030113617,0.00032993947,0.0006348345,0.000018631461,0.000039840892,0.000275242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979063,0.00012360195,0.00033470982,0.00071011245,0.00025498428,0.0006702883],"domain_scores_gemma":[0.99808383,0.0004526087,0.00018569012,0.0010347852,0.00013403902,0.00010901737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000424351,0.00034063327,0.0002756772,0.000065979875,0.00028944883,0.0005115881,0.0014749095,0.00012754406,0.000024516097],"category_scores_gemma":[0.000008014289,0.00019794478,0.0001125218,0.00045599154,0.00012532412,0.00042210845,0.00024010372,0.00039353358,0.000003533249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036929872,0.00008510548,0.00032784994,0.000008070288,0.000018506953,0.0000054148095,0.00056289125,0.8492827,0.00047834107,0.0020783718,0.0017723861,0.14534347],"study_design_scores_gemma":[0.00048209738,0.0006442161,0.00006049956,0.000042962605,0.000013300292,0.00004225855,0.00021182261,0.9781379,0.0007726234,0.00041224668,0.01886616,0.0003138807],"about_ca_topic_score_codex":0.00019384295,"about_ca_topic_score_gemma":0.002947754,"teacher_disagreement_score":0.67460555,"about_ca_system_score_codex":0.00007266481,"about_ca_system_score_gemma":0.000056714074,"threshold_uncertainty_score":0.80719537},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073622495,0.0006967215,0.92054087,0.001249012,0.00089377497,0.00038907846,0.000010566748,0.0001647636,0.0024327454],"genre_scores_gemma":[0.8334042,0.0027960995,0.16305858,0.00028915415,0.0001350595,0.00009547024,0.000042544252,0.000018659346,0.0001602521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979173,0.000112582675,0.00070655526,0.00055593235,0.00027682562,0.00043079257],"domain_scores_gemma":[0.9978259,0.00037162285,0.00035993304,0.0009713391,0.00035775252,0.00011345253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045837997,0.00029153717,0.00029852756,0.00030213708,0.00037124188,0.00028967892,0.0019432888,0.00015372525,0.000009072201],"category_scores_gemma":[0.000021514166,0.00031294388,0.00007757885,0.00029821548,0.00020896265,0.0006344446,0.00038300417,0.0004497062,0.000009784334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002426046,0.00016911249,0.00026281134,0.00000677086,0.000027187847,8.2061587e-7,0.00026300014,0.008060401,0.00004830578,0.012292643,0.00006857067,0.9787761],"study_design_scores_gemma":[0.0012838058,0.00013937378,0.0012225433,0.00033674666,0.000007303577,0.000058269183,0.00008413761,0.9940459,0.00004725251,0.00027579238,0.0021714224,0.00032745258],"about_ca_topic_score_codex":0.000021086258,"about_ca_topic_score_gemma":0.00038852947,"teacher_disagreement_score":0.9859855,"about_ca_system_score_codex":0.00023913717,"about_ca_system_score_gemma":0.00011234001,"threshold_uncertainty_score":0.9999323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06001064,0.00007494479,0.93757033,0.0000998494,0.00045006303,0.0009406505,0.0000062963677,0.00039111776,0.00045611954],"genre_scores_gemma":[0.65719575,0.0000129289665,0.34222528,0.00034617644,0.00009534634,0.000036109504,0.000008005778,0.000021855123,0.0000585632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973021,0.0001819681,0.0006672163,0.00072682445,0.00028113558,0.0008407328],"domain_scores_gemma":[0.9973954,0.0015059935,0.0002229641,0.0005057988,0.00019727061,0.00017256087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042235097,0.00030347405,0.0005390738,0.00013019175,0.0002709074,0.00011123122,0.0006847362,0.00018398839,0.000023359917],"category_scores_gemma":[0.00006614362,0.00028521457,0.000117428965,0.00073846494,0.00012581302,0.0002686588,0.00030607462,0.00031280293,0.0000072414255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004195267,0.00023345863,0.002686635,0.000034551358,0.0000718031,0.0004467589,0.0016344757,0.02820534,0.00028783397,0.01439264,0.0012639076,0.95070064],"study_design_scores_gemma":[0.002520228,0.00007936203,0.0005030189,0.00007484394,0.0000031964646,0.00013373909,0.000066590255,0.9955256,0.00039196978,0.00011919793,0.00020228351,0.0003799766],"about_ca_topic_score_codex":0.00008467041,"about_ca_topic_score_gemma":0.000053426236,"teacher_disagreement_score":0.96732026,"about_ca_system_score_codex":0.00012477355,"about_ca_system_score_gemma":0.00011596802,"threshold_uncertainty_score":0.99996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12210034,0.00003185111,0.8753871,0.001040615,0.00032385372,0.0006036097,0.000020369269,0.0003900333,0.00010226815],"genre_scores_gemma":[0.9454423,0.000100918725,0.053749066,0.00015769145,0.000022313065,0.00043377202,0.000034298795,0.000031965257,0.000027661003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975197,0.00036061896,0.0006574294,0.00065840123,0.00029925499,0.00050463073],"domain_scores_gemma":[0.9943846,0.00085657084,0.0002527897,0.0040475735,0.0002836359,0.00017486997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005851341,0.00032828277,0.00035732987,0.00018972298,0.00091312564,0.00038025394,0.0024340115,0.0002649457,0.000022272774],"category_scores_gemma":[0.000016706246,0.0003202232,0.0000994218,0.0013753141,0.00039521776,0.0010684062,0.000044413016,0.0018731632,0.000014956586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020157444,0.007811935,0.015315914,0.000070805065,0.00031476404,0.000037333735,0.0031885053,0.3617143,0.013769262,0.08248216,0.0001354261,0.514958],"study_design_scores_gemma":[0.0010110643,0.000046179634,0.004920972,0.00009125295,0.000017944689,0.00001828521,0.00007369403,0.9895475,0.0036724636,0.00009537713,0.00012680609,0.0003784595],"about_ca_topic_score_codex":0.00022881542,"about_ca_topic_score_gemma":0.012667627,"teacher_disagreement_score":0.82334197,"about_ca_system_score_codex":0.00013775768,"about_ca_system_score_gemma":0.00021455185,"threshold_uncertainty_score":0.99992496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2929965,0.000010262279,0.6877165,0.0007403294,0.00021528175,0.00019272926,2.7508875e-7,0.00007856128,0.01804957],"genre_scores_gemma":[0.9913415,0.0000015944904,0.004311015,0.0038373529,0.000098408236,0.0000072709113,1.69309e-7,0.000007706693,0.00039502213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987424,0.000059211725,0.00023713705,0.00028042946,0.00029748783,0.0003833052],"domain_scores_gemma":[0.9982242,0.0006251818,0.000060986476,0.00089638133,0.00006380989,0.00012942214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010258756,0.00011140792,0.00012814613,0.000041450643,0.00010136955,0.00005092734,0.0010186484,0.00006435291,0.000098693476],"category_scores_gemma":[0.00004522315,0.00007448271,0.000060631148,0.00057356467,0.00004378654,0.00012182175,0.00026128846,0.00020799642,0.0001019031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023236926,0.00010543019,0.00082647835,0.000003024379,0.00001549625,0.00001091948,0.00049461075,0.05973949,0.001511823,0.88931876,0.013154604,0.034796145],"study_design_scores_gemma":[0.00034009083,0.00034714767,0.02250177,0.000035150617,0.00000356267,0.00000465382,0.00002621033,0.9433802,0.020459417,0.007629955,0.0049700453,0.00030179435],"about_ca_topic_score_codex":0.000086595945,"about_ca_topic_score_gemma":0.000099719226,"teacher_disagreement_score":0.8836407,"about_ca_system_score_codex":0.000036537724,"about_ca_system_score_gemma":0.000013536313,"threshold_uncertainty_score":0.30373168},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09428352,0.00065405655,0.89865434,0.000020848154,0.000097480355,0.0001315067,1.8637647e-7,0.00012340205,0.006034631],"genre_scores_gemma":[0.8412589,0.00009104395,0.15785907,0.00004746983,0.000035197172,0.000012783677,0.000001293753,0.000009870143,0.0006844024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882907,0.000023490373,0.00028361037,0.00035357405,0.00018299559,0.0003272583],"domain_scores_gemma":[0.9990964,0.00003427041,0.00010051779,0.0006005115,0.0001150068,0.000053279204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014704773,0.00015773463,0.00018125387,0.00005119391,0.00005521319,0.00005400962,0.0008287382,0.00006331103,0.000014553305],"category_scores_gemma":[0.0000012585798,0.000120341196,0.00003594657,0.00033021235,0.00004261979,0.00041272287,0.00022831003,0.00017256467,0.000012205702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011795372,0.00008101421,0.0012952606,0.000012753319,0.0000033777799,0.0000023378898,0.000052263596,0.97997034,0.000050266353,0.0005855663,0.00012441995,0.017810592],"study_design_scores_gemma":[0.00041893995,0.00015903669,0.00031361452,0.000055612014,0.0000035711957,0.000005807772,0.000009186603,0.99831104,0.00046621964,0.000022189413,0.00006760451,0.000167188],"about_ca_topic_score_codex":0.00004101722,"about_ca_topic_score_gemma":0.00010443712,"teacher_disagreement_score":0.74697536,"about_ca_system_score_codex":0.000022337455,"about_ca_system_score_gemma":0.000038431826,"threshold_uncertainty_score":0.49073714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020726303,0.000065253655,0.9631546,0.00015189734,0.0017168709,0.00031009904,5.1064e-7,0.0004153526,0.01345911],"genre_scores_gemma":[0.45901665,0.000004706721,0.5394994,0.0005938678,0.0006631808,0.000011442027,0.0000010867964,0.000019586332,0.00019006855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998025,0.00013016886,0.00031024724,0.0005765948,0.00028449294,0.00067350944],"domain_scores_gemma":[0.99830836,0.00019898647,0.000109754386,0.0010935529,0.00006886495,0.00022047329],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066044915,0.00023114227,0.00023916471,0.000055752396,0.00022887242,0.00027450646,0.0013317285,0.00016410407,0.0011495844],"category_scores_gemma":[0.000013206879,0.00021561829,0.00008882882,0.00056003215,0.00008068821,0.000673318,0.00021537504,0.00065217004,0.00014208553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107416645,0.00011471325,0.0010670207,0.000016373377,0.000059531256,0.00019840046,0.00022958977,0.011595386,0.050939947,0.83745795,0.014405256,0.0839051],"study_design_scores_gemma":[0.0003538959,0.000063718246,0.0008167756,0.000018368259,0.00001007402,0.000092556525,0.00000542259,0.96108246,0.005310219,0.03118663,0.0006108692,0.00044900054],"about_ca_topic_score_codex":0.00010132377,"about_ca_topic_score_gemma":0.00014242236,"teacher_disagreement_score":0.9494871,"about_ca_system_score_codex":0.000040166502,"about_ca_system_score_gemma":0.0003056307,"threshold_uncertainty_score":0.9997635},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61661243,0.0037589082,0.37885374,0.000036901107,0.00010410062,0.0003766496,0.0000010371398,0.00012802343,0.00012821905],"genre_scores_gemma":[0.91990924,0.0007831552,0.07914259,0.000058849055,0.000019069246,0.000043665554,0.000004422933,0.000036062873,0.0000029545029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970318,0.0007522256,0.00061129604,0.0007291084,0.00019902729,0.00067654846],"domain_scores_gemma":[0.9961518,0.0015084542,0.00042943406,0.001557952,0.000170156,0.00018220712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013206969,0.0003538369,0.00051314407,0.00020222357,0.0011319453,0.00043065366,0.0010630381,0.0001967839,0.0000025385157],"category_scores_gemma":[0.000081925704,0.00040562774,0.0000590605,0.0009911368,0.00023933963,0.0005694398,0.0018391998,0.00086245046,6.68778e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010461094,0.00023715952,0.010037568,0.000078647914,0.000044147342,0.000018675712,0.0038309998,0.11718569,0.0021483446,0.009019163,0.0000027351252,0.8573864],"study_design_scores_gemma":[0.00073444954,0.00005805981,0.0016469528,0.0005412369,0.000009342371,0.00010372714,0.00069335656,0.99543923,0.00011827038,0.00009836993,0.00013327076,0.0004237175],"about_ca_topic_score_codex":0.000065989436,"about_ca_topic_score_gemma":0.000074937074,"teacher_disagreement_score":0.8782536,"about_ca_system_score_codex":0.00012781558,"about_ca_system_score_gemma":0.000104965155,"threshold_uncertainty_score":0.99983954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010698686,0.00017867702,0.98311543,0.0005243967,0.00019251289,0.0001988551,0.0000012325321,0.00026267793,0.004827512],"genre_scores_gemma":[0.98651975,0.00018941454,0.010705911,0.0015345042,0.00009872016,0.00006769058,0.000021513331,0.000023781251,0.00083868904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997768,0.00024550917,0.00041507403,0.00067367026,0.00034857471,0.00054915977],"domain_scores_gemma":[0.99871707,0.00023452542,0.00007715684,0.0006809117,0.00006751339,0.00022279457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025107968,0.000276162,0.00032783748,0.0001225241,0.000201871,0.00006957652,0.0008433208,0.00022293252,0.00019482712],"category_scores_gemma":[0.000002480454,0.00023462807,0.00010034942,0.00070378144,0.00009468804,0.0004420099,0.00007625646,0.00034241838,0.000028257098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017723179,0.0009330919,0.013672167,0.000034370827,0.000057256948,0.0015553008,0.0024304395,0.39176393,0.00035677108,0.041006263,0.06472011,0.48329306],"study_design_scores_gemma":[0.0008754754,0.00011999197,0.0009260128,0.00006431224,0.0000021026442,0.000022227076,0.000012256386,0.9908724,0.002052905,0.00010801169,0.0046164836,0.0003278194],"about_ca_topic_score_codex":0.00012313845,"about_ca_topic_score_gemma":0.00014654206,"teacher_disagreement_score":0.9758211,"about_ca_system_score_codex":0.00008794253,"about_ca_system_score_gemma":0.00019567178,"threshold_uncertainty_score":0.9567855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04956379,0.000010738334,0.9483923,0.00009492055,0.00072632445,0.0009797983,0.0000041412295,0.0002067561,0.000021264694],"genre_scores_gemma":[0.88601255,0.0000050179556,0.11326003,0.00049732195,0.0001302448,0.000078080186,0.000009062006,0.0000067364454,9.224575e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977383,0.00012906332,0.000489784,0.00061166147,0.0005196577,0.0005115577],"domain_scores_gemma":[0.9977696,0.0005351372,0.00031945523,0.0005159833,0.0005591086,0.00030072755],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025943632,0.00028496468,0.00029922393,0.00044644633,0.0007464546,0.0011026326,0.0008832887,0.00012460619,4.7085058e-7],"category_scores_gemma":[0.00017850738,0.00025149056,0.00005350016,0.0011759091,0.00027813102,0.0039133723,0.00022256727,0.0002593361,0.000004193414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009645718,0.00002677932,0.00003447463,0.000024927405,0.0000020006103,9.8090375e-8,0.0013302122,0.6018577,0.00000367309,0.0015144935,0.00000710299,0.39518887],"study_design_scores_gemma":[0.001278935,0.00053903676,0.00835913,0.00012901021,0.0000062427935,0.000007444703,0.000018878995,0.98910433,0.00021626845,0.000012405073,0.00002470238,0.00030361855],"about_ca_topic_score_codex":0.000011500589,"about_ca_topic_score_gemma":0.0000030281944,"teacher_disagreement_score":0.8364488,"about_ca_system_score_codex":0.00016106686,"about_ca_system_score_gemma":0.000103199,"threshold_uncertainty_score":0.99999374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97024465,0.00047131567,0.026356708,0.000013502415,0.00017548302,0.00062102644,5.5309675e-7,0.000046308065,0.002070463],"genre_scores_gemma":[0.9985814,0.000035146102,0.0010494064,0.000021255039,0.000035793877,0.00005866629,0.0000011672561,0.000008869729,0.00020826666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986432,0.000091994574,0.0004318094,0.00032891426,0.00026389028,0.00024014246],"domain_scores_gemma":[0.9989115,0.00019984055,0.00012468151,0.0006757231,0.000050796054,0.000037458292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014587156,0.00014403467,0.00031309781,0.00009825269,0.000018339086,0.000018150633,0.00057277916,0.00006387468,0.000032251355],"category_scores_gemma":[0.000005326828,0.000111436406,0.00004760183,0.0003586263,0.000034532768,0.000081835555,0.00023325667,0.00014319089,0.0000059767644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091426904,0.009800648,0.08477918,0.0000299853,0.00005095808,0.000043495365,0.0014002459,0.71281356,0.00021817484,0.009934188,0.0015251152,0.17931302],"study_design_scores_gemma":[0.0027531155,0.0035473928,0.28320494,0.00010581408,0.000015987192,0.0000025842883,0.0003354863,0.70751333,0.0013436273,0.00038686863,0.00040747877,0.00038335111],"about_ca_topic_score_codex":0.00005555978,"about_ca_topic_score_gemma":0.0010002875,"teacher_disagreement_score":0.19842577,"about_ca_system_score_codex":0.000029455969,"about_ca_system_score_gemma":0.000010301071,"threshold_uncertainty_score":0.45442447},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009810342,0.0005800125,0.99583286,0.00023109926,0.000912006,0.00030448646,0.000003541561,0.00052305125,0.0015148425],"genre_scores_gemma":[0.46289667,0.00026955712,0.5206347,0.0023896592,0.0016726385,0.00067383837,0.000040668023,0.000102946804,0.011319316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977622,0.000040001007,0.0004012327,0.00072566606,0.00024329989,0.0008276085],"domain_scores_gemma":[0.99859154,0.00017469379,0.00013461128,0.00081091456,0.00015791917,0.00013029926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002283445,0.00028024762,0.00029661483,0.000063683525,0.00019117341,0.0002530589,0.0011384264,0.00015526444,0.000018238432],"category_scores_gemma":[0.0000025520483,0.0002552671,0.00015706978,0.00041845575,0.000051729694,0.00044172577,0.00045008273,0.00014591924,0.00001022922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063618636,0.000056110268,0.000008163915,0.0000101733185,0.000011234106,0.000020275756,0.000016347214,0.025311057,0.000016538213,0.01299145,0.01799063,0.9435617],"study_design_scores_gemma":[0.00056070957,0.00007835797,0.00003645481,0.00006437925,0.000004509348,0.000020301733,0.00000794498,0.9665054,0.00024227095,0.0014322059,0.030703798,0.00034368003],"about_ca_topic_score_codex":0.00006749081,"about_ca_topic_score_gemma":0.0004955313,"teacher_disagreement_score":0.943218,"about_ca_system_score_codex":0.00009764603,"about_ca_system_score_gemma":0.00004955866,"threshold_uncertainty_score":0.9999899},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23434362,0.00008031765,0.7607321,0.00016368745,0.00044189917,0.00022188308,1.484248e-7,0.00035724152,0.0036590805],"genre_scores_gemma":[0.96164644,0.000092531365,0.03738526,0.00040536706,0.00016453276,0.00002207002,0.0000015616652,0.00001266225,0.0002695503],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983276,0.00008768071,0.00031170755,0.00047225595,0.00023351696,0.00056724134],"domain_scores_gemma":[0.99893945,0.00021654974,0.000070243885,0.00060527236,0.00004229518,0.00012617378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003004685,0.00016443405,0.00020881272,0.00013142594,0.000119117176,0.00005125421,0.0007327921,0.00012083048,0.000028841085],"category_scores_gemma":[0.000016490014,0.0001531736,0.000070646456,0.00089957047,0.00007476124,0.00032131863,0.00028024727,0.0003215794,0.000048292284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149980615,0.00030559444,0.68452466,0.000010459388,0.000038764763,0.0011912754,0.001592241,0.0797422,0.00018079481,0.03500296,0.0025573869,0.19483867],"study_design_scores_gemma":[0.00033105584,0.000017620065,0.058608096,0.000016342407,9.607527e-7,0.000055558125,0.000010768825,0.9405349,0.000052480686,0.000050678358,0.00013238075,0.00018914403],"about_ca_topic_score_codex":0.00024022502,"about_ca_topic_score_gemma":0.00016098318,"teacher_disagreement_score":0.8607927,"about_ca_system_score_codex":0.000028440423,"about_ca_system_score_gemma":0.000031476055,"threshold_uncertainty_score":0.62462384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014397471,0.00012487202,0.9808819,0.0011031284,0.00023613483,0.00037891231,3.1679303e-7,0.00027342557,0.002603816],"genre_scores_gemma":[0.96944934,0.0000053358162,0.026788158,0.0031027582,0.00027448396,0.000048547867,0.0000011641577,0.000018296081,0.0003119431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793863,0.00011268743,0.00033110054,0.00056294294,0.0004433569,0.0006112614],"domain_scores_gemma":[0.99860036,0.00022315374,0.000106115636,0.0007421815,0.00009216324,0.00023601779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598384,0.00023422278,0.00029572373,0.00008025232,0.00007745144,0.00014580753,0.0007941596,0.00013111482,0.000101419646],"category_scores_gemma":[0.00001601912,0.00017775365,0.000052740543,0.0005577786,0.000033406133,0.0004776593,0.00006534876,0.00028549632,0.000033842123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007064233,0.00013510892,0.013627982,0.000007436714,0.000010923212,0.00006830909,0.00009348968,0.9233548,0.00012906642,0.002967972,0.005458157,0.05407613],"study_design_scores_gemma":[0.0023196947,0.000095931406,0.0021504327,0.00011271748,0.0000050393483,0.000009625386,0.000005151409,0.9920052,0.0006366889,0.000027570108,0.0023631654,0.00026874556],"about_ca_topic_score_codex":0.00011021441,"about_ca_topic_score_gemma":0.0016128081,"teacher_disagreement_score":0.95505184,"about_ca_system_score_codex":0.00020818433,"about_ca_system_score_gemma":0.00025867528,"threshold_uncertainty_score":0.72485834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812602,0.00092487887,0.015058439,0.0005050186,0.000681688,0.00065866794,0.000002327987,0.00006360229,0.0008451845],"genre_scores_gemma":[0.99902904,0.00010947057,0.00024062104,0.0002980223,0.00010629126,0.00006543343,0.000001652293,0.000010969884,0.0001384757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824464,0.00032654917,0.00039524736,0.00034680628,0.00030987276,0.00037688576],"domain_scores_gemma":[0.99692285,0.0011348355,0.00030052615,0.0015060956,0.00009532149,0.000040342416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092026807,0.00019946689,0.00028490473,0.000029012064,0.00016180081,0.000045259694,0.0016571367,0.00009015623,0.000014138226],"category_scores_gemma":[0.00003313537,0.000112990514,0.00012803388,0.00057745166,0.00023436404,0.00015841756,0.00034368527,0.00029343966,0.000016833534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051389955,0.0020229681,0.0403126,0.00096700364,0.00027066644,0.00003561326,0.001476818,0.35994595,0.0037771075,0.13363338,0.0548911,0.4021529],"study_design_scores_gemma":[0.0004841305,0.00052080216,0.15306365,0.000216076,0.000021147294,0.000004431223,0.000013050825,0.8344563,0.008107507,0.0010716772,0.0018101649,0.00023105202],"about_ca_topic_score_codex":0.00009271172,"about_ca_topic_score_gemma":0.00008580012,"teacher_disagreement_score":0.47451034,"about_ca_system_score_codex":0.00004177326,"about_ca_system_score_gemma":0.000048452213,"threshold_uncertainty_score":0.46076193},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009699823,0.00011599038,0.9846078,0.0005075782,0.0028513405,0.0016586034,0.000011696133,0.0004679336,0.000079231526],"genre_scores_gemma":[0.86005306,0.00002899446,0.13648443,0.000983113,0.00046785985,0.0006709172,0.000014329022,0.000070300135,0.0012270025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963734,0.00009724629,0.00059783336,0.0012912889,0.00043498198,0.0012052162],"domain_scores_gemma":[0.99738264,0.00036115138,0.00023255903,0.001247969,0.00022245815,0.0005532268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091732177,0.0005514479,0.00059721246,0.00014020932,0.0004601732,0.00043722635,0.0012943636,0.0004249554,0.000026894168],"category_scores_gemma":[0.000029486124,0.00048483818,0.00019006815,0.00037898292,0.0001777958,0.00053927983,0.00028472958,0.0006174997,0.000021596828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035261156,0.0045460137,0.0010501399,0.00041442947,0.00048194846,0.00016633104,0.0022329448,0.78076756,0.010522519,0.027371997,0.03706987,0.13502364],"study_design_scores_gemma":[0.003678976,0.0001855135,0.0003854719,0.000056165645,0.000022755145,0.000017386075,0.000028933264,0.9898085,0.0042229635,0.0001013479,0.0008406649,0.00065131875],"about_ca_topic_score_codex":0.00013867472,"about_ca_topic_score_gemma":0.0005158024,"teacher_disagreement_score":0.85035324,"about_ca_system_score_codex":0.00007507343,"about_ca_system_score_gemma":0.00011759362,"threshold_uncertainty_score":0.9997603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009408596,0.0013432007,0.98293036,0.00044934778,0.0021876616,0.0009662607,0.000035046894,0.00020780641,0.0024717173],"genre_scores_gemma":[0.9899858,0.00024642373,0.0044463207,0.000548616,0.0022664622,0.0014474047,0.00006634326,0.000025887712,0.0009667317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773204,0.00007129796,0.00055925763,0.000805723,0.00048504077,0.0003466574],"domain_scores_gemma":[0.9983702,0.00012939186,0.00029253648,0.0007171113,0.00038110852,0.000109689485],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024002108,0.00029750986,0.0002882486,0.00013501443,0.00019919852,0.0011226595,0.0012505649,0.0001289775,0.000007184157],"category_scores_gemma":[8.091329e-7,0.00027893085,0.00007231533,0.00034094293,0.000053636246,0.00027087182,0.00023818102,0.00022642087,0.00007051223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010558423,0.00021691923,0.00011015697,0.000026845772,0.00003415852,0.000006340385,0.000037260663,0.4650713,0.00007201606,0.4765522,0.005094395,0.052767873],"study_design_scores_gemma":[0.00033442117,0.000059376187,0.00043244546,0.00011163308,0.0000056028953,0.000035486613,0.000015157445,0.93156725,0.000022750837,0.0004923416,0.066627614,0.0002959182],"about_ca_topic_score_codex":0.000117322736,"about_ca_topic_score_gemma":0.000054808846,"teacher_disagreement_score":0.98057723,"about_ca_system_score_codex":0.00009935077,"about_ca_system_score_gemma":0.00006321097,"threshold_uncertainty_score":0.99996626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08517883,0.0000060079437,0.91283214,0.0004104725,0.00009603855,0.00042549847,3.5030308e-7,0.00011388145,0.0009368021],"genre_scores_gemma":[0.86260873,0.0000062798927,0.13632272,0.0006422354,0.00003990343,0.00011732183,5.512223e-7,0.000008603604,0.00025365062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896914,0.000030512909,0.00018400306,0.0003726167,0.00014712216,0.00029661757],"domain_scores_gemma":[0.9994211,0.00006659222,0.000020721547,0.00034266643,0.000047195463,0.00010171919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019152858,0.000104755076,0.00012539531,0.000091355556,0.000067924346,0.000043683605,0.0003497787,0.000077078774,0.000015087448],"category_scores_gemma":[0.000024060733,0.00009190078,0.000035343633,0.0002493224,0.000033409488,0.00021660214,0.00018803704,0.000101552796,0.00002552529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047594687,0.00003156591,0.0000061882365,0.0000024560397,0.0000012487083,0.0000059863164,0.00041480205,0.8068988,0.0003381939,0.16974385,0.00021642567,0.022292897],"study_design_scores_gemma":[0.00028955276,0.00007980182,0.000084426414,0.000007017844,8.100597e-7,0.00002199232,0.0000023370335,0.96667707,0.0016721342,0.03100541,0.000039324295,0.000120114055],"about_ca_topic_score_codex":0.000012116817,"about_ca_topic_score_gemma":0.00010986679,"teacher_disagreement_score":0.7774299,"about_ca_system_score_codex":0.00005817726,"about_ca_system_score_gemma":0.000030922518,"threshold_uncertainty_score":0.3747605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04678576,0.00025126862,0.9466794,0.0051463866,0.00014798774,0.00057933433,0.000021845783,0.00015052469,0.00023747295],"genre_scores_gemma":[0.83415014,0.0001420683,0.164219,0.000783158,0.00041721636,0.00018034539,0.000052464256,0.000038960545,0.000016637427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972651,0.0005446911,0.0006574798,0.00040159514,0.00050268066,0.00062845874],"domain_scores_gemma":[0.99459875,0.0019619018,0.00052454753,0.0018378916,0.00084681023,0.00023009343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008014291,0.00031030472,0.0004184146,0.00021090375,0.0007491383,0.00045293916,0.0024556615,0.00013365292,0.0000053248177],"category_scores_gemma":[0.00008493638,0.0002709025,0.00012853228,0.0013142338,0.0001290384,0.0004545442,0.00011734965,0.0013627876,0.000007988173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021914461,0.001391593,0.00029531555,0.0000068209274,0.00010779967,0.000023488965,0.0007817633,0.9331604,0.00021544447,0.008968291,0.0028913193,0.05193859],"study_design_scores_gemma":[0.0014038027,0.0004716692,0.0011487192,0.00029626995,0.000034876233,0.00015343228,0.000026893407,0.99465764,0.000116702075,0.00025159505,0.0011062128,0.00033217142],"about_ca_topic_score_codex":0.000012623781,"about_ca_topic_score_gemma":0.00029017945,"teacher_disagreement_score":0.78736436,"about_ca_system_score_codex":0.0005551279,"about_ca_system_score_gemma":0.00046770403,"threshold_uncertainty_score":0.9999743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03356097,0.00015356005,0.96323985,0.00035352114,0.00039339566,0.0004521378,0.0000023581797,0.0004056861,0.0014385526],"genre_scores_gemma":[0.52941805,0.000059285056,0.46884245,0.0007870363,0.00026444462,0.00008761981,0.0000062056674,0.000017277831,0.0005176117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981111,0.000094643874,0.0002684032,0.0006286131,0.00024147559,0.0006557237],"domain_scores_gemma":[0.9981884,0.00027385668,0.000055972658,0.001053025,0.00009354056,0.00033523663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003253094,0.00019612072,0.00023579062,0.000051251245,0.0003649382,0.00010751851,0.0011848332,0.00015196945,0.000045359393],"category_scores_gemma":[0.00003095971,0.00017139163,0.00010806456,0.00029249722,0.00015089018,0.0006193613,0.0001844776,0.00030084272,0.000034670426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018708655,0.0014204099,0.0018792811,0.00003252879,0.0000941882,0.000106897285,0.0017099989,0.092226446,0.00073635316,0.23820938,0.038610887,0.62478656],"study_design_scores_gemma":[0.00053823093,0.0003188503,0.0014888457,0.000005451243,0.0000037230616,0.00006557242,0.0000037502919,0.96700823,0.00013512152,0.001091264,0.029092675,0.0002482896],"about_ca_topic_score_codex":0.0000126446075,"about_ca_topic_score_gemma":0.00005461418,"teacher_disagreement_score":0.8747818,"about_ca_system_score_codex":0.000040687555,"about_ca_system_score_gemma":0.000054833996,"threshold_uncertainty_score":0.69891477},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016976903,0.00018927295,0.94635105,0.00044574848,0.000111856,0.050715875,0.000016160378,0.0004368492,0.000035511166],"genre_scores_gemma":[0.5027208,0.000022321305,0.33540675,0.00025064813,0.00013257931,0.1613291,0.00010375383,0.000030166564,0.0000039005126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815446,0.00018016949,0.00044600692,0.0005664225,0.00017063644,0.0004823178],"domain_scores_gemma":[0.9955183,0.00030001704,0.0002211018,0.0035137553,0.00022817602,0.0002186039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038950224,0.00026040443,0.0002727788,0.00006671396,0.0008155535,0.00046554365,0.003232217,0.00013846374,0.0000020132338],"category_scores_gemma":[0.0000070833344,0.00026198404,0.00008512477,0.00050383876,0.00022724488,0.0003231674,0.0016073564,0.00035639742,0.000003977035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018775194,0.0008832388,0.00010077984,0.00003882316,0.000036728827,0.000003515834,0.0016299821,0.66633016,0.00004307687,0.07739925,0.0005546923,0.252961],"study_design_scores_gemma":[0.0013960664,0.00034636314,0.0005601902,0.000108219996,0.000008687106,0.00002549395,0.000024436249,0.98388517,0.000023565854,0.0007895397,0.012529789,0.00030247035],"about_ca_topic_score_codex":0.0000061545493,"about_ca_topic_score_gemma":0.000035772988,"teacher_disagreement_score":0.6109443,"about_ca_system_score_codex":0.00012094808,"about_ca_system_score_gemma":0.00011077596,"threshold_uncertainty_score":0.99998325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057556305,0.00058432086,0.930955,0.0008901482,0.00032710144,0.00039270875,7.080135e-7,0.0004126274,0.00888108],"genre_scores_gemma":[0.9804919,0.00009455135,0.017885963,0.00094302656,0.00008889967,0.00004487846,0.0000065471395,0.000018537885,0.00042569856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805176,0.00008919683,0.000317825,0.0006400992,0.00027179092,0.0006293314],"domain_scores_gemma":[0.9989325,0.00008005025,0.00008444428,0.000689612,0.000063681786,0.00014974436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021318292,0.0002480697,0.00026165525,0.00012348108,0.00007763124,0.00015985963,0.0011303357,0.00017799868,0.00007396451],"category_scores_gemma":[0.000009480224,0.00021829952,0.000079554346,0.0012238531,0.00007573657,0.00033443116,0.0003589376,0.00055457046,0.00009068546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080946265,0.0003886706,0.0009318061,0.000016877862,0.000053989505,0.00038527555,0.0013459626,0.54696435,0.00026211728,0.16185871,0.00157175,0.28613955],"study_design_scores_gemma":[0.0069526085,0.00073089777,0.019116484,0.0005067779,0.000018901299,0.00010847296,0.00014990511,0.89374834,0.002890256,0.059416603,0.014168846,0.002191922],"about_ca_topic_score_codex":0.00004963596,"about_ca_topic_score_gemma":0.0013302318,"teacher_disagreement_score":0.9229356,"about_ca_system_score_codex":0.00016589744,"about_ca_system_score_gemma":0.0001292439,"threshold_uncertainty_score":0.8901996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024725122,0.00071963196,0.9916359,0.000034454217,0.0005060205,0.0010527048,9.30104e-7,0.00022994964,0.0033478774],"genre_scores_gemma":[0.08275203,0.00004149704,0.9149447,0.00025510366,0.0003010676,0.00073671294,0.000009524733,0.000021073649,0.0009382946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983546,0.00003794131,0.0002996011,0.0005346097,0.0001990029,0.0005742148],"domain_scores_gemma":[0.99912924,0.000053707925,0.000055067132,0.0006652168,0.00002774295,0.00006903574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042926427,0.0001562392,0.0001631199,0.00007926374,0.000090210226,0.00015837056,0.00076835736,0.000055540586,0.00001603842],"category_scores_gemma":[5.059794e-7,0.00015040695,0.00005579087,0.00044468022,0.00001738858,0.00017200694,0.0003019852,0.00007711325,0.000017925446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002008404,0.000080223275,0.000019231577,0.000005793358,0.0000026931414,0.000010382712,0.000024470362,0.5388507,0.0000021823591,0.0043649045,0.001161011,0.45547637],"study_design_scores_gemma":[0.00050784746,0.00013239251,0.0006867201,0.000021385613,0.0000028533395,0.0000031758227,0.000019532083,0.97262406,0.000023420216,0.00095488434,0.024832377,0.00019136627],"about_ca_topic_score_codex":0.000016315453,"about_ca_topic_score_gemma":0.00019102279,"teacher_disagreement_score":0.455285,"about_ca_system_score_codex":0.000088391374,"about_ca_system_score_gemma":0.000010572181,"threshold_uncertainty_score":0.61334175},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004948408,0.00019301526,0.945393,0.00042587976,0.0007245938,0.05099733,0.0000029459313,0.0008836697,0.0008847171],"genre_scores_gemma":[0.43326467,0.000080085534,0.21257447,0.007942931,0.009512335,0.33505684,0.00007142047,0.00024801274,0.001249212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956695,0.00025563667,0.00069773674,0.001270241,0.0005105678,0.0015963129],"domain_scores_gemma":[0.99681145,0.00024194311,0.0003494853,0.0018946651,0.00021993612,0.0004825325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059238554,0.0005509199,0.0005647843,0.00008666065,0.0005193766,0.00044563762,0.001874082,0.00033929377,0.000026973163],"category_scores_gemma":[0.000009105897,0.00052205,0.00025090136,0.00097083166,0.000083315164,0.00032656215,0.00016369174,0.00035506499,0.000018034096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012785125,0.00023866656,0.000025670442,0.000009617961,0.00001606407,0.000025410778,0.00005893638,0.65783113,0.000046830122,0.04226652,0.012757011,0.2865963],"study_design_scores_gemma":[0.001143394,0.0007128336,0.0002601698,0.00010108781,0.000010489735,0.000024324421,0.000006381761,0.88349956,0.00010833353,0.001854687,0.111683466,0.0005952714],"about_ca_topic_score_codex":0.0000043967034,"about_ca_topic_score_gemma":0.000022651213,"teacher_disagreement_score":0.73281854,"about_ca_system_score_codex":0.00011604236,"about_ca_system_score_gemma":0.00008767166,"threshold_uncertainty_score":0.99972314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007368637,0.0006895435,0.9904761,0.000057590394,0.00029401213,0.00085345836,0.000017474656,0.00015220187,0.000091008085],"genre_scores_gemma":[0.99772424,0.00014826097,0.0014360986,0.000033548284,0.00002122418,0.00051930716,0.000028910337,0.000015175564,0.000073263705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982272,0.00024889957,0.00041906475,0.00051659916,0.0002455743,0.00034268657],"domain_scores_gemma":[0.99900466,0.00013180234,0.00014111423,0.00050292676,0.00007135195,0.00014815544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030656418,0.00022894357,0.00031485994,0.000106511055,0.00017395294,0.00015066302,0.00022060945,0.00018094674,0.0000033211898],"category_scores_gemma":[0.0000019539386,0.00019845687,0.000049648446,0.0008142683,0.00005050958,0.00029594073,0.0000014608671,0.00024664414,0.000009242242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010767142,0.00012732255,0.00012629747,0.00001688527,0.000024020248,0.0000081005055,0.00006913332,0.9840161,0.00002724941,0.004174352,0.000066245164,0.011236606],"study_design_scores_gemma":[0.0022025567,0.0001379081,0.0002515968,0.000069355854,0.000017038532,0.00004575688,0.00006952726,0.994966,0.000035334426,0.00012424102,0.0018137335,0.00026699516],"about_ca_topic_score_codex":0.000080075915,"about_ca_topic_score_gemma":0.00021862405,"teacher_disagreement_score":0.99035555,"about_ca_system_score_codex":0.00010741278,"about_ca_system_score_gemma":0.000041803287,"threshold_uncertainty_score":0.8092836},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010752322,0.0000075199614,0.84434223,0.00021116709,0.00015508727,0.14959587,3.1589343e-7,0.00020731059,0.005372948],"genre_scores_gemma":[0.2221869,0.0000038237736,0.028780682,0.0010028079,0.00033036643,0.74701744,0.0000054226944,0.000033498585,0.00063905324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809873,0.0002461638,0.00056139345,0.00045910466,0.00020550132,0.00042908156],"domain_scores_gemma":[0.9986106,0.0005577714,0.00016945484,0.00047778102,0.000102661055,0.0000817166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072713714,0.0001906595,0.0004361411,0.00011358402,0.000074552656,0.00022721877,0.00060172024,0.000088467204,0.00014280649],"category_scores_gemma":[0.00008700096,0.00016343415,0.00012376245,0.00041036206,0.000058597212,0.00049855176,0.00014012943,0.00012550825,0.000016274254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009814471,0.0015247135,0.00014817281,0.00016911443,0.00007423484,0.00007716152,0.0009353742,0.10528236,0.00008890652,0.28845742,0.048018206,0.54540986],"study_design_scores_gemma":[0.07311448,0.0000748453,0.0000032604644,0.00005894449,0.0000031521886,0.000008231279,0.0000019599092,0.92054725,0.00025571228,0.002185549,0.0035506007,0.00019604228],"about_ca_topic_score_codex":0.000016918111,"about_ca_topic_score_gemma":0.00003180366,"teacher_disagreement_score":0.8155616,"about_ca_system_score_codex":0.00006308087,"about_ca_system_score_gemma":0.000017865608,"threshold_uncertainty_score":0.6664651},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021599429,0.0005183561,0.9920672,0.00096354994,0.00022718204,0.0006880722,0.0000034419627,0.00035114508,0.003021103],"genre_scores_gemma":[0.5520579,0.000015165988,0.44604132,0.0006104242,0.00018031007,0.00009010489,0.0000039799183,0.000008098041,0.0009926944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986925,0.00002851331,0.0002625125,0.0004466799,0.00015283469,0.00041692168],"domain_scores_gemma":[0.9985449,0.0003315949,0.000060432143,0.0008427051,0.000112083086,0.00010830948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021966198,0.00013071227,0.00015419869,0.000022925404,0.00016743211,0.00007497283,0.000632189,0.00006722741,0.00005074946],"category_scores_gemma":[0.000017094284,0.000121822195,0.00008679158,0.0002963752,0.00002430395,0.0009790648,0.0001736705,0.000086642685,0.000025329407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053957756,0.000036335427,0.000007966835,0.0000019608215,0.0000042754386,1.0534905e-7,0.000043537002,0.7768157,0.00000866238,0.06879408,0.002639693,0.1516423],"study_design_scores_gemma":[0.0003211684,0.000046257665,0.00006261012,0.000004962569,0.0000029813045,6.788763e-7,0.000002181864,0.90312505,0.000044779794,0.050449073,0.04580138,0.00013887486],"about_ca_topic_score_codex":0.0000012277197,"about_ca_topic_score_gemma":0.00012472372,"teacher_disagreement_score":0.54989797,"about_ca_system_score_codex":0.000060894687,"about_ca_system_score_gemma":0.00004433405,"threshold_uncertainty_score":0.49677652},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12097905,0.00022720464,0.8572548,0.00026427358,0.00041705734,0.0002003854,0.0000011553936,0.0002064397,0.02044963],"genre_scores_gemma":[0.97501343,0.00004291599,0.024014177,0.00047619728,0.00006750155,0.000016691738,0.000004537011,0.0000064819624,0.0003580478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895614,0.00018573995,0.00020038996,0.00027802563,0.00016032213,0.00021939223],"domain_scores_gemma":[0.99941534,0.00011297929,0.0000386715,0.00033600777,0.00003263694,0.00006436678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006826,0.00008810768,0.00009191205,0.000055067398,0.00005239123,0.00010380124,0.00024951054,0.00007430625,0.00005843773],"category_scores_gemma":[0.000051332376,0.000085137726,0.000022495246,0.00035135422,0.000016144018,0.00054866436,0.00005993991,0.00013626306,0.00004293995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042418225,0.00045828734,0.14188659,0.00003328381,0.000051794414,0.00008524218,0.0015584002,0.010600736,0.014468993,0.33254492,0.15739003,0.34087932],"study_design_scores_gemma":[0.0010881516,0.00014592045,0.009004782,0.00005588904,0.0000056281006,0.00007918286,0.000045065084,0.93312055,0.007695087,0.0043316497,0.044009123,0.00041896474],"about_ca_topic_score_codex":0.000112543574,"about_ca_topic_score_gemma":0.00005612062,"teacher_disagreement_score":0.9225198,"about_ca_system_score_codex":0.000065005304,"about_ca_system_score_gemma":0.000048980884,"threshold_uncertainty_score":0.34718156},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050863303,0.000007250205,0.9134009,0.0006157137,0.00013905742,0.083027765,4.4069893e-7,0.00030807138,0.0019921986],"genre_scores_gemma":[0.3608109,0.000002898773,0.12624505,0.0031615826,0.0005720793,0.50860524,0.0000067000888,0.000047989026,0.0005475234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843967,0.00003897471,0.0003029722,0.0005111781,0.00022019629,0.00048699797],"domain_scores_gemma":[0.9989381,0.0001589901,0.00012082182,0.00057146576,0.0000873784,0.0001232889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003196437,0.00019288383,0.00018591259,0.000045887624,0.00024660284,0.0002360143,0.00066273176,0.00011681219,0.000015760414],"category_scores_gemma":[0.0000123688515,0.0001645003,0.000095888376,0.00028114012,0.000027196327,0.00034675995,0.00014868732,0.00016749615,0.000028052958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015822072,0.00034104707,0.0001072498,0.000049378355,0.00004015229,0.000027989838,0.00030072045,0.3016108,0.00015808755,0.52973443,0.0047230916,0.16274884],"study_design_scores_gemma":[0.004130399,0.0008614368,0.00038544196,0.00030412295,0.0000065571403,0.000024867662,0.000012608618,0.9735795,0.0027513346,0.012897745,0.0045601223,0.0004858201],"about_ca_topic_score_codex":0.000005509644,"about_ca_topic_score_gemma":0.000028770233,"teacher_disagreement_score":0.7871558,"about_ca_system_score_codex":0.000111369416,"about_ca_system_score_gemma":0.00007225511,"threshold_uncertainty_score":0.6708128},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11574893,0.0009962886,0.87193906,0.0024159632,0.00015234112,0.00030513594,0.0000033594572,0.00025009058,0.00818883],"genre_scores_gemma":[0.9432502,0.00004571124,0.0554924,0.000099779565,0.00010736346,0.000018821593,0.000010174458,0.000004569976,0.00097097916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993145,0.00004695548,0.00014487881,0.00023826867,0.00012174155,0.00013366119],"domain_scores_gemma":[0.9995583,0.000060397513,0.000022592654,0.0002331254,0.000084160674,0.000041364776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011475839,0.000075279204,0.00008651464,0.000040269202,0.00013750617,0.0003201258,0.00019851972,0.000042253985,0.000027261118],"category_scores_gemma":[0.0000070686256,0.000068193876,0.000011471649,0.00036862917,0.000034228484,0.00080473616,0.00010848212,0.000051270817,0.000021842392],"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.0000051349125,0.00014473023,0.015388413,0.000017523298,0.0000452361,0.000011435712,0.0015677391,0.006179079,0.003320267,0.8196305,0.032821923,0.12086802],"study_design_scores_gemma":[0.0019849283,0.00039423493,0.19227344,0.00006315974,0.000045303248,0.000011628128,0.0005690074,0.61059386,0.015896175,0.02019553,0.1566798,0.001292945],"about_ca_topic_score_codex":0.000030244291,"about_ca_topic_score_gemma":0.00034531092,"teacher_disagreement_score":0.8275013,"about_ca_system_score_codex":0.000022329374,"about_ca_system_score_gemma":0.000041847703,"threshold_uncertainty_score":0.30869806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02762061,0.000596084,0.9693242,0.00042175033,0.0002671164,0.0013742947,0.0000065013905,0.0001616787,0.00022780935],"genre_scores_gemma":[0.21365602,0.00018932564,0.7791532,0.0032432028,0.00035834368,0.00065533747,0.0000049172168,0.00005043337,0.0026892093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976971,0.00007335236,0.00038201836,0.0008249971,0.00037851432,0.000643999],"domain_scores_gemma":[0.9983946,0.00022259602,0.00014570587,0.0009791867,0.00009159647,0.0001662997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032998505,0.00031410734,0.0002721143,0.00006553255,0.0002857731,0.00053599826,0.001092681,0.00015008604,0.00018814235],"category_scores_gemma":[0.0000072827,0.0002718683,0.00014575271,0.00020909606,0.00003236509,0.0018694864,0.0005095917,0.00013740352,0.0001923625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001866296,0.0010603509,0.00008425393,0.00012796806,0.0002766346,0.000054529635,0.0040586605,0.62447464,0.07402879,0.20816374,0.0042497916,0.08323402],"study_design_scores_gemma":[0.0007550524,0.00024350637,0.000028893082,0.000025501744,0.000024224128,0.000028293198,0.000037406277,0.89883405,0.07556372,0.0049649635,0.019014873,0.0004795439],"about_ca_topic_score_codex":0.000010251857,"about_ca_topic_score_gemma":0.000019751486,"teacher_disagreement_score":0.27435938,"about_ca_system_score_codex":0.0002585878,"about_ca_system_score_gemma":0.00009895034,"threshold_uncertainty_score":0.99997336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026235977,0.00012299622,0.97173756,0.00005122642,0.000021675702,0.00039027055,0.000015361948,0.00002476268,0.0014001372],"genre_scores_gemma":[0.7562218,0.00002072332,0.2435042,0.0000061272026,0.000052532872,0.00014784408,0.0000062796294,0.000009623818,0.000030907016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991401,0.00002567264,0.00027825267,0.00018142184,0.00016288795,0.00021166167],"domain_scores_gemma":[0.9990868,0.00019866833,0.00020996609,0.0003533877,0.00007875615,0.000072443036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002585691,0.00011391162,0.00024164282,0.0000402338,0.00006060167,0.00002578979,0.00018806609,0.000050035516,0.000009339041],"category_scores_gemma":[0.0000071781265,0.00009463809,0.0000351349,0.00037133254,0.00011579588,0.00020175271,0.0000997419,0.00009848707,0.0000014025834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013614371,0.0014602356,0.051744297,0.0002572199,0.0001552965,0.0000014639485,0.0025230262,0.005298229,0.00043207136,0.9133901,0.00008118055,0.02464325],"study_design_scores_gemma":[0.0006605416,0.00006312668,0.024261724,0.00012904246,0.00003767174,0.00005799587,0.00047628416,0.96285087,0.0007138653,0.010010688,0.0004042895,0.00033387783],"about_ca_topic_score_codex":0.000037303722,"about_ca_topic_score_gemma":0.000012412774,"teacher_disagreement_score":0.9575527,"about_ca_system_score_codex":0.000017001064,"about_ca_system_score_gemma":0.00001933586,"threshold_uncertainty_score":0.3859229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015861727,0.000017880177,0.97101784,0.00039188348,0.00017296427,0.00014455015,9.43655e-7,0.0004087218,0.011983466],"genre_scores_gemma":[0.7886657,1.7230245e-7,0.2104788,0.00036942845,0.00029348567,0.000019578029,0.0000073814163,0.000010330783,0.00015510134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867016,0.00004175125,0.00020326166,0.00039732447,0.00029538095,0.00039212033],"domain_scores_gemma":[0.9992883,0.00008975504,0.00007270411,0.00042126476,0.00005775568,0.000070199276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018622793,0.00014337282,0.00012742552,0.000046769834,0.00018199591,0.00024979256,0.0004159088,0.000029776744,0.000048665985],"category_scores_gemma":[0.0000037844004,0.000117792515,0.000040358245,0.00023171512,0.000034711877,0.00033212613,0.00007913771,0.000115516086,0.000051756397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038324677,0.0004581873,0.00828477,0.000023730094,0.000055495395,0.0006677803,0.000119523844,0.6435546,0.0014224327,0.2419514,0.0076032453,0.0958205],"study_design_scores_gemma":[0.00041500662,0.00007584028,0.00035449205,0.00002463527,0.0000060712337,0.00003207024,0.0000021789886,0.9841931,0.013825034,0.00038382522,0.00048853614,0.00019919946],"about_ca_topic_score_codex":0.00023625269,"about_ca_topic_score_gemma":0.00002818925,"teacher_disagreement_score":0.772804,"about_ca_system_score_codex":0.0000495374,"about_ca_system_score_gemma":0.00007110219,"threshold_uncertainty_score":0.48034394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014537536,0.00008846691,0.9773007,0.0012897416,0.00092313765,0.0011852364,0.000005032031,0.00058603456,0.004084105],"genre_scores_gemma":[0.7849434,0.000042098636,0.21096362,0.0015787685,0.0005759236,0.0010704367,0.000022962193,0.000062169056,0.00074060104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957017,0.000012447177,0.0008080065,0.0014774721,0.001099583,0.0009007947],"domain_scores_gemma":[0.9977197,0.00018642678,0.0005611845,0.00040295976,0.0008751854,0.000254522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007226846,0.0005644198,0.0004526689,0.0003101031,0.00065736787,0.0006449714,0.0025142669,0.0002609977,0.000018418004],"category_scores_gemma":[0.00006797643,0.0005697707,0.00025541708,0.00088975136,0.00018728235,0.0013650653,0.0003219299,0.0005077733,0.000020104115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021770562,0.0064533576,0.012266867,0.0012694033,0.00088354415,0.00012964946,0.002048432,0.33863387,0.0015130752,0.30796027,0.047607884,0.27905658],"study_design_scores_gemma":[0.0020224676,0.00009162802,0.0013716242,0.000517557,0.000019428235,0.000047536338,0.00004677588,0.99101865,0.00028930506,0.0009525698,0.002987655,0.00063480285],"about_ca_topic_score_codex":0.0000047802137,"about_ca_topic_score_gemma":0.0000033751455,"teacher_disagreement_score":0.7704059,"about_ca_system_score_codex":0.0003695433,"about_ca_system_score_gemma":0.00012956197,"threshold_uncertainty_score":0.9996754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11079728,0.0000329983,0.8697216,0.00039151846,0.0013255433,0.0004212385,3.5959823e-7,0.00032648357,0.016982999],"genre_scores_gemma":[0.9794227,0.00009157718,0.015100679,0.0023769704,0.00036241402,0.00008945358,0.0000015932025,0.00002268008,0.002531945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974319,0.00008269868,0.0004666339,0.0007964365,0.0003848241,0.00083754945],"domain_scores_gemma":[0.9984013,0.00013935841,0.00007941065,0.0010363811,0.00007035366,0.0002732295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042966558,0.00024924945,0.0003323241,0.00013466702,0.00013203769,0.00008397074,0.0014467902,0.00013747679,0.0001333215],"category_scores_gemma":[0.000013892818,0.00024700037,0.00007667111,0.0011268986,0.00005364302,0.00053485035,0.00039399546,0.00034392788,0.0002627548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008198782,0.0006687241,0.017441861,0.000045699126,0.00006753081,0.0022931283,0.0053096176,0.05777693,0.0030760025,0.12880418,0.34937942,0.43505493],"study_design_scores_gemma":[0.00046069268,0.0002428533,0.0053255586,0.00008720506,0.0000033353485,0.00016889202,0.000047405912,0.9655627,0.014580826,0.00019668955,0.012377833,0.00094601704],"about_ca_topic_score_codex":0.00011717091,"about_ca_topic_score_gemma":0.0004022873,"teacher_disagreement_score":0.9077858,"about_ca_system_score_codex":0.00009772516,"about_ca_system_score_gemma":0.000114959636,"threshold_uncertainty_score":0.9999982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25843298,0.00007551215,0.7365515,0.000016961503,0.00037616567,0.00021355611,1.2392069e-7,0.00018126328,0.004151917],"genre_scores_gemma":[0.981322,0.00006802025,0.017479977,0.0003176901,0.00012217052,0.000039644252,0.0000014151781,0.000015925581,0.0006331915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840194,0.000081213824,0.00032896455,0.00047976678,0.00021253037,0.0004955885],"domain_scores_gemma":[0.99907553,0.00008059262,0.00007202712,0.00061803893,0.00004004097,0.00011374799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023313476,0.00017677697,0.00023521137,0.00010030232,0.00006302421,0.00007148061,0.0009759542,0.0001161325,0.00010386464],"category_scores_gemma":[0.0000041132153,0.00016590659,0.00006132555,0.0006420398,0.00006954949,0.0004796363,0.00048665496,0.00026326234,0.00004546895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044958284,0.0007189458,0.072269164,0.00003209949,0.00007648595,0.0017731952,0.0038754903,0.45368522,0.0008173401,0.33869252,0.026623704,0.10139087],"study_design_scores_gemma":[0.0002581912,0.000042377418,0.0010130205,0.000026658248,0.0000012708706,0.00011232784,0.000010442737,0.9971732,0.00048557925,0.00018726234,0.00048084196,0.00020882016],"about_ca_topic_score_codex":0.00032783515,"about_ca_topic_score_gemma":0.00012810763,"teacher_disagreement_score":0.722889,"about_ca_system_score_codex":0.000097906086,"about_ca_system_score_gemma":0.000055413046,"threshold_uncertainty_score":0.6765474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02788474,0.00005917664,0.9329262,0.0007154788,0.00019126825,0.00013562915,5.5839987e-8,0.00035983554,0.037727658],"genre_scores_gemma":[0.86961937,0.000009183715,0.12976931,0.00044159402,0.000028556638,0.000010889159,2.1131616e-7,0.0000037450493,0.00011713842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917495,0.000021801523,0.00016893707,0.00027447724,0.00010910491,0.000250739],"domain_scores_gemma":[0.9994904,0.000039530238,0.00003345864,0.00036839765,0.000016859938,0.00005135302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016039022,0.00008212787,0.000089860514,0.000047253074,0.000025977286,0.000078230725,0.00069469,0.000037804184,0.000033619708],"category_scores_gemma":[0.000009394296,0.0000745621,0.000020661955,0.00025569127,0.0000077803825,0.00029813743,0.00024137628,0.00012201687,0.00017269692],"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.000003216639,0.00024985164,0.0050546303,0.000021348627,0.0000146800585,0.00020351418,0.003168033,0.029649282,0.00030795363,0.8774236,0.0007043771,0.083199516],"study_design_scores_gemma":[0.002667906,0.00035788634,0.025520513,0.0002785908,0.000004376411,0.00013827767,0.00010417406,0.88603413,0.004490849,0.0759708,0.003388525,0.0010439538],"about_ca_topic_score_codex":0.0000992676,"about_ca_topic_score_gemma":0.00025971598,"teacher_disagreement_score":0.8563849,"about_ca_system_score_codex":0.000071602975,"about_ca_system_score_gemma":0.00004111528,"threshold_uncertainty_score":0.30405542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071232654,0.000054035867,0.92547846,0.0013448279,0.000080641425,0.0010224617,0.0000017120516,0.00023641877,0.00054881116],"genre_scores_gemma":[0.9319377,0.0000018759933,0.06547712,0.0022949786,0.0000485685,0.00009165976,0.000008644763,0.000011231088,0.00012822896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885887,0.000054809985,0.00019448719,0.0003583181,0.0002241829,0.00030934621],"domain_scores_gemma":[0.9982842,0.00038719553,0.000070946175,0.0009742728,0.00014396064,0.00013940934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001868429,0.00017506268,0.00020112394,0.00007376377,0.00020887521,0.00020028016,0.00091564603,0.00006930236,0.000013750789],"category_scores_gemma":[0.000047036046,0.00012820368,0.00005039505,0.000385314,0.000031918156,0.00021424612,0.000055016786,0.00016253625,0.00001923903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007253773,0.0001232596,0.00000266042,0.000005130343,0.00002844055,0.0000031045388,0.0006832197,0.68644005,0.000062306426,0.091074914,0.013650734,0.20720078],"study_design_scores_gemma":[0.0030757738,0.001021802,0.00070688035,0.000049265956,0.000013229115,0.0000077396935,0.000016464603,0.98572564,0.00003564233,0.00846064,0.0006489089,0.00023801619],"about_ca_topic_score_codex":0.000003457512,"about_ca_topic_score_gemma":0.000044004784,"teacher_disagreement_score":0.860705,"about_ca_system_score_codex":0.000071540846,"about_ca_system_score_gemma":0.000050699204,"threshold_uncertainty_score":0.52279943},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08287063,0.0028795383,0.90953386,0.00041453802,0.00026958232,0.00049979956,3.5939854e-7,0.0002844007,0.0032472825],"genre_scores_gemma":[0.9552195,0.00034986116,0.04350773,0.00063883007,0.000065785156,0.000015726091,0.000001358199,0.000007067999,0.00019416114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862033,0.000056211058,0.0002699611,0.00046004416,0.00013158622,0.00046185972],"domain_scores_gemma":[0.9992548,0.00008790892,0.000055789733,0.000453096,0.000025956997,0.00012242778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025998292,0.00015147365,0.00018497424,0.000061796716,0.000065543296,0.00018073207,0.0004605373,0.0000868568,0.000021144322],"category_scores_gemma":[0.000012825149,0.0001391597,0.00003245973,0.0003548697,0.000028624723,0.00037769612,0.00021951401,0.00021854606,0.00001004059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009819011,0.00011827157,0.0024501958,0.0000027269978,0.0000045841525,0.000050542993,0.0005200826,0.062187362,0.000043762313,0.0058817687,0.0005240698,0.9282068],"study_design_scores_gemma":[0.0005282704,0.00011892749,0.014457616,0.00003695201,0.0000015384153,0.000017518558,0.000033709966,0.983303,0.000020782545,0.00015908908,0.0011477324,0.00017483646],"about_ca_topic_score_codex":0.000005969235,"about_ca_topic_score_gemma":0.000078159464,"teacher_disagreement_score":0.928032,"about_ca_system_score_codex":0.000039355764,"about_ca_system_score_gemma":0.000012736096,"threshold_uncertainty_score":0.5674768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06301738,0.0016522361,0.9337538,0.00020493996,0.00020312972,0.0007908887,0.000009154004,0.00013975445,0.00022873301],"genre_scores_gemma":[0.7459281,0.0003901218,0.25303134,0.00011298469,0.00013363674,0.00023277722,0.000017654094,0.00001506186,0.00013828924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982946,0.000034257697,0.000501767,0.00043160835,0.00019709549,0.00054069806],"domain_scores_gemma":[0.99882644,0.00022419154,0.00013308761,0.00060499937,0.00010216466,0.00010912426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041996202,0.00018544706,0.00030257268,0.00008369964,0.00006329322,0.000051919815,0.00082956674,0.00011863684,0.000033280514],"category_scores_gemma":[0.000019249892,0.00017271303,0.00008732743,0.00052467885,0.000053792184,0.00051165576,0.00027102733,0.00017741462,0.000012248742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028476285,0.00014165006,0.00072908774,0.000018393153,0.000010605448,0.0000018111277,0.0001311558,0.34603733,0.000057606925,0.00037791528,0.00066223735,0.65180373],"study_design_scores_gemma":[0.0008383447,0.00021810034,0.0013590227,0.000047301397,0.000004191377,0.0000058671594,0.000015350048,0.9849382,0.0006673764,0.000013060033,0.011692821,0.00020038035],"about_ca_topic_score_codex":0.0000033098024,"about_ca_topic_score_gemma":0.00002863009,"teacher_disagreement_score":0.68291074,"about_ca_system_score_codex":0.00008087545,"about_ca_system_score_gemma":0.000039187355,"threshold_uncertainty_score":0.70430326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045323875,0.0022279196,0.988747,0.0008033112,0.0006546734,0.0004346152,4.5678692e-7,0.00045487375,0.0021447605],"genre_scores_gemma":[0.46781462,0.0004363011,0.52259773,0.0043587824,0.00088188314,0.000085079824,0.000007569585,0.00002285849,0.0037951306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983858,0.00003491856,0.00028421287,0.00052223634,0.00023256194,0.0005402741],"domain_scores_gemma":[0.99883914,0.00008964238,0.00008883952,0.000735426,0.00009681598,0.00015010737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038973748,0.00018309847,0.00020970688,0.00006204846,0.00020090741,0.0004054133,0.0011849224,0.00011235967,0.00004070178],"category_scores_gemma":[0.000026699172,0.00017037039,0.00013637703,0.00042623124,0.0000213266,0.0013406212,0.00021825237,0.00014632862,0.000031384567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008972423,0.000057830584,0.00007945632,0.0000048627007,0.000013887431,0.000008017145,0.000046214354,0.0033992042,0.0003805674,0.4537607,0.025252566,0.51698774],"study_design_scores_gemma":[0.0004190624,0.00015504585,0.0004647777,0.000016876555,0.000007690497,0.00000972768,0.0000038069152,0.8715024,0.00088338146,0.020642698,0.10559304,0.0003014795],"about_ca_topic_score_codex":0.0000025747763,"about_ca_topic_score_gemma":0.00001764577,"teacher_disagreement_score":0.8681032,"about_ca_system_score_codex":0.000054441633,"about_ca_system_score_gemma":0.00003421672,"threshold_uncertainty_score":0.6947503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37021247,0.00016443426,0.62852955,0.0001252325,0.00019611252,0.00052625925,0.000003784244,0.0001671141,0.000075073134],"genre_scores_gemma":[0.94736695,0.00009762897,0.052153736,0.00012558606,0.000084351035,0.00007705344,0.0000031959544,0.000029273306,0.00006221713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965384,0.00029904104,0.0007575833,0.0012718383,0.0003748255,0.000758299],"domain_scores_gemma":[0.9981544,0.00068319484,0.00013715909,0.0007065597,0.00008996242,0.00022874685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009009238,0.00040213202,0.000613834,0.00040668345,0.00046039518,0.0002354099,0.00047519524,0.00020368591,0.000020963726],"category_scores_gemma":[0.0000028888533,0.0004019553,0.0001717923,0.0025510134,0.00011872993,0.00038336695,0.000029354316,0.00057062326,0.0000068925583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018688137,0.00016652522,0.0016498894,0.00002216363,0.000041630858,0.000016491842,0.0005764077,0.74406844,0.0003276506,0.00008650304,0.000016154228,0.2530094],"study_design_scores_gemma":[0.000801243,0.00015927828,0.009593313,0.00011986267,0.00009358036,0.00001436006,0.000033960616,0.98735267,0.0008811056,0.00028792964,0.0002431051,0.0004195846],"about_ca_topic_score_codex":0.0013218691,"about_ca_topic_score_gemma":0.0009674347,"teacher_disagreement_score":0.5771545,"about_ca_system_score_codex":0.00011373904,"about_ca_system_score_gemma":0.000049042657,"threshold_uncertainty_score":0.99984324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65708494,0.002224191,0.33654854,0.00035998973,0.00042938077,0.0005565481,1.9968334e-7,0.0006040849,0.002192092],"genre_scores_gemma":[0.98801994,0.00018121606,0.010120751,0.00092998386,0.00014321513,0.00004341682,0.0000023697994,0.00001317333,0.00054595975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797904,0.0001517539,0.00041740463,0.00061437854,0.00021011659,0.00062728656],"domain_scores_gemma":[0.9987334,0.00018856593,0.00011103823,0.0007950864,0.00004159225,0.00013033938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064223487,0.00020762648,0.0002715492,0.00010074439,0.000078677,0.00019606289,0.0010046589,0.00014044846,0.000020027719],"category_scores_gemma":[0.000009816754,0.00020537876,0.00007110667,0.0010468201,0.000029963236,0.0005642736,0.00014710697,0.0003313772,0.000042555992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004801214,0.000047649435,0.000036803078,0.0000015753036,0.000002289609,0.000026834317,0.00022565325,0.36993203,0.000063123225,0.0019365202,0.00064532674,0.6270774],"study_design_scores_gemma":[0.00043741454,0.00015167113,0.0071898587,0.0000456325,0.00000197799,0.000009221218,0.000025443474,0.98896724,0.00007376807,0.00036764453,0.0024598865,0.00027023986],"about_ca_topic_score_codex":0.0000035429,"about_ca_topic_score_gemma":0.00011561953,"teacher_disagreement_score":0.62680715,"about_ca_system_score_codex":0.00007330468,"about_ca_system_score_gemma":0.000041045056,"threshold_uncertainty_score":0.8375103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042200217,0.00011512665,0.93799555,0.0017617213,0.000411482,0.05764047,0.0000012977831,0.0013593493,0.0002929744],"genre_scores_gemma":[0.2277753,0.000011005397,0.55680376,0.0015217223,0.00040452415,0.21269044,0.000008610892,0.000091861824,0.00069279777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969588,0.000045309484,0.00055741804,0.0010074642,0.00032374304,0.0011072761],"domain_scores_gemma":[0.9972045,0.00020382425,0.00028913448,0.0017178315,0.00034852652,0.00023622393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006999799,0.00040295935,0.00042344417,0.00040064243,0.00021108605,0.00015450877,0.0027046467,0.0008374978,0.00004072067],"category_scores_gemma":[0.000068091605,0.00038975358,0.00015565682,0.0012919924,0.00022514007,0.00024643677,0.00024328119,0.00067223376,0.000053994863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012437551,0.00014885743,0.00056683,0.00005499904,0.000054706703,0.00016462179,0.00003541752,0.0051115244,0.0030912124,0.09563456,0.009365455,0.8856475],"study_design_scores_gemma":[0.0037273504,0.0008755025,0.00024764772,0.00022379667,0.000022330722,0.0000613172,0.000012888112,0.63060004,0.05075672,0.020300515,0.29226083,0.000911055],"about_ca_topic_score_codex":0.000006060151,"about_ca_topic_score_gemma":0.00009374154,"teacher_disagreement_score":0.8847364,"about_ca_system_score_codex":0.00009850891,"about_ca_system_score_gemma":0.00046694485,"threshold_uncertainty_score":0.99985546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019993607,0.00092087674,0.9922505,0.00059073605,0.0015103811,0.0006554148,0.0000015209557,0.00045785576,0.0016133591],"genre_scores_gemma":[0.9303832,0.00048752234,0.0666911,0.0009808447,0.00073769205,0.00034147283,0.0000087304925,0.00005672269,0.0003127372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670255,0.00035551545,0.0006483753,0.0009618759,0.00044353522,0.0008881482],"domain_scores_gemma":[0.99770474,0.00042628587,0.00015971255,0.0014349286,0.00008084695,0.00019348766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008199924,0.00042029886,0.00040214809,0.0003126013,0.00039732485,0.00033437044,0.0013528643,0.00029359892,0.000052273008],"category_scores_gemma":[0.000005359914,0.00045229628,0.00017467588,0.0018345483,0.00007295357,0.00067928043,0.000018479948,0.0009009881,0.00002770484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004313375,0.00020828255,0.0000366714,0.0000067902797,0.000013975526,0.000007353247,0.000088016524,0.6098406,0.000015691681,0.00014678367,0.00037495547,0.3892178],"study_design_scores_gemma":[0.0010413128,0.00009946296,0.00013104774,0.0001658588,0.00001573635,0.000015975145,0.0000113015685,0.98436725,0.00014064525,0.00005913209,0.013489531,0.00046271688],"about_ca_topic_score_codex":0.000009643252,"about_ca_topic_score_gemma":0.00040328526,"teacher_disagreement_score":0.9283838,"about_ca_system_score_codex":0.0003494702,"about_ca_system_score_gemma":0.00012740938,"threshold_uncertainty_score":0.9997929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004328212,0.00030338537,0.8763963,0.005785037,0.0005609665,0.0006563431,0.000024132936,0.00016696462,0.11177865],"genre_scores_gemma":[0.9404938,0.00048436696,0.052879445,0.0014958106,0.00018286613,0.00055425015,0.00015302698,0.000023139755,0.0037332918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980124,0.00016120137,0.000497213,0.0005463654,0.00042563872,0.00035717338],"domain_scores_gemma":[0.99678177,0.00022140492,0.00016234638,0.0024324767,0.00027424158,0.00012778498],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0002751418,0.00023858539,0.0002282829,0.00025553058,0.00013815895,0.00055068184,0.005817896,0.00011933916,0.000045372326],"category_scores_gemma":[0.000010506102,0.00025600355,0.000071144976,0.000921538,0.00004816255,0.0007568517,0.0007975361,0.0004932622,0.0002260415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030850813,0.0007578086,0.00040266378,0.00000484007,0.000026814145,0.0000032783037,0.0003544808,0.11699901,0.00027852593,0.8056476,0.018240435,0.057253692],"study_design_scores_gemma":[0.00053316617,0.00005176037,0.0024445513,0.0001235436,0.0000049745095,0.000009928672,0.00006445617,0.9595743,0.00006182625,0.005352585,0.031385165,0.00039378024],"about_ca_topic_score_codex":0.0007662935,"about_ca_topic_score_gemma":0.0041326233,"teacher_disagreement_score":0.9361656,"about_ca_system_score_codex":0.00022535626,"about_ca_system_score_gemma":0.00023042734,"threshold_uncertainty_score":0.9999892},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00671147,0.0014329155,0.98884296,0.0003291472,0.0006640263,0.00068578415,3.5646772e-7,0.00035433364,0.0009790256],"genre_scores_gemma":[0.31179592,0.000088175904,0.68594253,0.0013766693,0.00033195346,0.00006374946,0.0000026847492,0.00002944199,0.00036889155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763036,0.000061610306,0.00044906573,0.00064125314,0.0004505017,0.0007672231],"domain_scores_gemma":[0.9974134,0.0013590647,0.00013193571,0.00073812425,0.00011694512,0.00024054549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019416797,0.00022732423,0.0002483539,0.00007017635,0.00022869892,0.00016798665,0.00091863185,0.00028491646,0.00011724345],"category_scores_gemma":[0.00005519855,0.00019630235,0.0001611621,0.00056535157,0.00003418722,0.0003845136,0.00014781856,0.00035199846,0.000012563603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050062634,0.000041843476,0.00007234308,0.000014836257,0.000013966066,0.00000532022,0.00026909573,0.0048185824,0.0001764346,0.07275526,0.0015527168,0.92022955],"study_design_scores_gemma":[0.00053563155,0.000234449,0.0007138113,0.00013709434,0.00001112218,0.0000061061605,0.000016853413,0.96549547,0.00046980142,0.019404113,0.012681478,0.00029410003],"about_ca_topic_score_codex":0.000004223929,"about_ca_topic_score_gemma":0.000015306437,"teacher_disagreement_score":0.96067685,"about_ca_system_score_codex":0.00006930997,"about_ca_system_score_gemma":0.000058610214,"threshold_uncertainty_score":0.8004978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30185285,0.002780832,0.69174004,0.00020504855,0.0008019073,0.0006186752,8.841184e-7,0.00056716823,0.0014326116],"genre_scores_gemma":[0.99245113,0.001953444,0.0031860166,0.0011431166,0.00073764997,0.00015932322,0.000017857239,0.00011008148,0.00024139542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448085,0.00034954134,0.0009509716,0.0014984555,0.0006870829,0.002033114],"domain_scores_gemma":[0.99686414,0.00046700516,0.0004300985,0.0017125047,0.00017199587,0.0003542261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093101145,0.0007388381,0.000885985,0.00024630857,0.0003590462,0.00047720852,0.0023672415,0.0005326526,0.000035750905],"category_scores_gemma":[0.000010257195,0.0006873972,0.00018016355,0.0027884126,0.00021306335,0.0009315373,0.00070754014,0.0014503635,0.000035360426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025838875,0.00019140833,0.022804376,0.000012897597,0.00006727898,0.0010270783,0.00044000382,0.6219438,0.000015800722,0.0064351466,0.00091647025,0.3458874],"study_design_scores_gemma":[0.001880679,0.00019816525,0.0059806826,0.0005289081,0.000020298303,0.00023804784,0.00009213209,0.9880247,0.000010704922,0.000105664396,0.002026953,0.00089302607],"about_ca_topic_score_codex":0.00014501186,"about_ca_topic_score_gemma":0.0014731518,"teacher_disagreement_score":0.69059825,"about_ca_system_score_codex":0.00025684407,"about_ca_system_score_gemma":0.00014051113,"threshold_uncertainty_score":0.99955773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8832974,0.0012491996,0.09968915,0.00063633034,0.0002498204,0.00062062044,0.0000013209877,0.00029071717,0.01396544],"genre_scores_gemma":[0.9962611,0.00010884021,0.003073419,0.00008910178,0.0000722479,0.00002326853,3.1841256e-7,0.00000873815,0.0003629432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988078,0.000059287962,0.00027627306,0.00025549682,0.00025272334,0.00034842832],"domain_scores_gemma":[0.9988781,0.00025557555,0.000079925085,0.00066332496,0.000040694726,0.00008237799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805205,0.00013041137,0.00013777896,0.000032777112,0.00012056773,0.000079597965,0.0008373954,0.000044834884,0.00004582826],"category_scores_gemma":[0.000008477718,0.00007339931,0.00017818857,0.00029223986,0.000043272463,0.00016938728,0.00005786098,0.00014631444,0.000051228308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009695117,0.00007299064,0.000010175343,8.5929975e-7,0.000014605632,0.0000010046602,0.0005386329,0.321836,0.00008136223,0.0034871725,0.0017440165,0.6722035],"study_design_scores_gemma":[0.00034152585,0.0006718688,0.0020787017,0.000019304542,0.0000032914825,0.000007658825,0.00004008775,0.98867196,0.0006428094,0.000052613523,0.007321955,0.0001482121],"about_ca_topic_score_codex":0.0000062848603,"about_ca_topic_score_gemma":0.000037252175,"teacher_disagreement_score":0.6720553,"about_ca_system_score_codex":0.00007603223,"about_ca_system_score_gemma":0.000057292073,"threshold_uncertainty_score":0.2993137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.862262,0.01231567,0.04699943,0.000118903125,0.004635544,0.0054776804,0.000012474944,0.0006111626,0.067567125],"genre_scores_gemma":[0.9621793,0.0037495522,0.0006809632,0.000011262948,0.00058440474,0.000104589744,0.00013878231,0.0000865966,0.032464575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99484503,0.0006723318,0.0005328259,0.0015149656,0.00089676236,0.0015380983],"domain_scores_gemma":[0.9965112,0.0010266558,0.00032803044,0.0012251908,0.00051804056,0.00039086325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009246721,0.00047706682,0.0007211604,0.0016584374,0.0009344915,0.0003575124,0.0028326013,0.0007366567,0.000015958743],"category_scores_gemma":[0.00006497788,0.0005923888,0.0003450508,0.0023246515,0.00017579601,0.00071101775,0.00039899294,0.002095273,0.0000149668895],"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.013040628,0.0037936012,0.057831407,0.004650351,0.0032478624,0.055215247,0.036480885,0.15046561,0.035288796,0.15723783,0.042437855,0.44030994],"study_design_scores_gemma":[0.0111013595,0.0069578257,0.037578568,0.003987661,0.00022634068,0.00031839288,0.013585049,0.3646844,0.046873886,0.0050977375,0.50247633,0.0071124216],"about_ca_topic_score_codex":0.0009823157,"about_ca_topic_score_gemma":0.014495564,"teacher_disagreement_score":0.4600385,"about_ca_system_score_codex":0.0013771002,"about_ca_system_score_gemma":0.0020526545,"threshold_uncertainty_score":0.99965274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013974202,0.12464803,0.87214905,0.0007543857,0.00034910985,0.00029764333,8.908157e-7,0.00003759839,0.00036586734],"genre_scores_gemma":[0.8238038,0.062489394,0.11291253,0.00031121107,0.0002999398,0.000053468586,0.0000020911145,0.00001808665,0.00010949976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.00016453679,0.0006764396,0.00017333598,0.00015758876,0.0003418487],"domain_scores_gemma":[0.9965765,0.0009788171,0.000628295,0.001350896,0.00029172862,0.00017375767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946717,0.00016175961,0.0003212473,0.00008741152,0.00045178604,0.00022480049,0.0019525142,0.00013492556,0.00001138669],"category_scores_gemma":[0.000034289784,0.00014334105,0.0001628813,0.00035354812,0.000106421096,0.00051982433,0.00053965516,0.00057705643,0.0000014096751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012750868,0.00016738391,0.00027984206,0.0000048081106,0.0000620865,0.000003281117,0.0005643468,0.053855237,0.0000065263935,0.0048794975,0.0061197616,0.9340445],"study_design_scores_gemma":[0.0005707564,0.00028510723,0.00017640184,0.0000842598,0.000024370647,0.00008988221,0.000050405873,0.894609,0.0000013935431,0.00032516316,0.103643246,0.00014004575],"about_ca_topic_score_codex":8.0660976e-7,"about_ca_topic_score_gemma":0.000010560903,"teacher_disagreement_score":0.9339044,"about_ca_system_score_codex":0.000040417483,"about_ca_system_score_gemma":0.000018404015,"threshold_uncertainty_score":0.58452785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054705918,0.00051639293,0.9435498,0.00003597895,0.00036961553,0.00046713464,0.000006649731,0.00024905056,0.00009942935],"genre_scores_gemma":[0.94903344,0.000092394264,0.05045406,0.00008238709,0.00010460176,0.000116241565,0.00000457543,0.000041285894,0.00007098544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751914,0.00013791883,0.0005447368,0.00082686445,0.0003049871,0.0006663347],"domain_scores_gemma":[0.99838394,0.00062132196,0.0001670017,0.00055105967,0.00012923939,0.00014742474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021361628,0.00037567745,0.00039479014,0.0002845702,0.0004272953,0.00017930924,0.00043427298,0.00015567869,0.0000047986437],"category_scores_gemma":[0.000001559777,0.00036360972,0.00008583339,0.0010281572,0.00014666271,0.00038876157,0.000015184558,0.0004839813,0.000003973927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003675499,0.00024892035,0.000061030358,0.0000075650905,0.000021946242,0.00005221297,0.00020343765,0.77062255,0.00004707501,0.0005913639,0.000018559846,0.22808857],"study_design_scores_gemma":[0.001145495,0.00043241927,0.0008964688,0.00020682653,0.000020753248,0.00007982127,0.000080482656,0.9963118,0.0001756695,0.00014127331,0.0000986758,0.0004103523],"about_ca_topic_score_codex":0.0001769032,"about_ca_topic_score_gemma":0.00083217374,"teacher_disagreement_score":0.8943275,"about_ca_system_score_codex":0.00013269903,"about_ca_system_score_gemma":0.000058843652,"threshold_uncertainty_score":0.99988157},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075901474,0.00013285999,0.99467605,0.0007840221,0.0007828417,0.0003735571,0.0000017334793,0.00044605875,0.0020438572],"genre_scores_gemma":[0.6458835,0.000011440508,0.35195053,0.0008440742,0.0008761988,0.000031760894,0.00002462709,0.000016095868,0.00036176873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983797,0.000018459597,0.00032768046,0.00043467843,0.00018040002,0.0006590868],"domain_scores_gemma":[0.99853206,0.0004312609,0.00008549201,0.00063681614,0.00012914075,0.00018523182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009484542,0.00015650381,0.00017538597,0.000047745885,0.00015593207,0.00016457788,0.0008842467,0.00015001126,0.000023962111],"category_scores_gemma":[0.00005568335,0.00014201712,0.00010635527,0.00048907765,0.000029783336,0.00029611174,0.00024311572,0.00018841166,0.000022358325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022795786,0.000049290527,0.00045264998,0.00001062478,0.000036051806,0.000017705079,0.00005899913,0.04294735,0.000066735054,0.5742706,0.008105019,0.3739622],"study_design_scores_gemma":[0.00037142905,0.000075363554,0.0005186306,0.000013717064,0.0000052775044,0.0000074642858,0.000008590205,0.9783027,0.0004914459,0.0028189237,0.017178895,0.00020755811],"about_ca_topic_score_codex":0.000009008507,"about_ca_topic_score_gemma":0.000029127625,"teacher_disagreement_score":0.93535537,"about_ca_system_score_codex":0.00005155039,"about_ca_system_score_gemma":0.00003311282,"threshold_uncertainty_score":0.579129},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13710572,0.006134403,0.85556626,0.00026461305,0.00012164756,0.00039859157,2.7572267e-7,0.00009945741,0.0003090591],"genre_scores_gemma":[0.97641414,0.0037553723,0.018693358,0.0005251333,0.000104107414,0.0001478922,7.733733e-7,0.000012796776,0.0003464306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990583,0.000024730278,0.0001541714,0.00036019934,0.00010409448,0.00029848117],"domain_scores_gemma":[0.999327,0.00014242844,0.000030192916,0.00038997302,0.00003486011,0.000075513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024190862,0.00012319835,0.00013635257,0.000026074369,0.0003966262,0.00012955304,0.0003823787,0.00005241231,0.000002838696],"category_scores_gemma":[0.0000031118263,0.00008564595,0.000030542826,0.00013697318,0.00007274697,0.00027636325,0.00029780887,0.0001175662,8.6929964e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013429175,0.000018152978,0.0002667171,0.00001595523,0.000021962425,0.000009371753,0.0015245711,0.36132708,0.000009560959,0.016805548,0.0011558202,0.6188318],"study_design_scores_gemma":[0.0002494617,0.000047706573,0.000067363246,0.0000109662005,0.000004675044,0.000052239615,0.000058093352,0.996184,0.000007063629,0.0010803858,0.0021146284,0.00012343847],"about_ca_topic_score_codex":0.000010079427,"about_ca_topic_score_gemma":0.000020592888,"teacher_disagreement_score":0.83930844,"about_ca_system_score_codex":0.000010601074,"about_ca_system_score_gemma":0.000013372683,"threshold_uncertainty_score":0.34925404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31409168,0.001743239,0.64713794,0.0009844598,0.0010983443,0.00068466016,0.0000012977473,0.0008541144,0.03340428],"genre_scores_gemma":[0.9429715,0.000027902557,0.05338661,0.00083379,0.00021611863,0.00007512907,0.000006891934,0.000023284529,0.0024587286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801517,0.00008786618,0.00042491575,0.00056317064,0.000275423,0.0006334431],"domain_scores_gemma":[0.99895996,0.0001245357,0.00009012769,0.0006708039,0.000051909934,0.00010267698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697486,0.00020605637,0.00021934502,0.000083013074,0.000087501314,0.00022426184,0.00082636013,0.00014728657,0.00012364023],"category_scores_gemma":[0.000007901689,0.00020105389,0.0000782312,0.0006861199,0.0000363735,0.0004166155,0.0003020408,0.0003230807,0.00006909486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017808272,0.0007177206,0.2213923,0.000030253914,0.000024446159,0.00064877415,0.00048449545,0.09602626,0.0012631654,0.0411149,0.11811651,0.52016336],"study_design_scores_gemma":[0.00083357235,0.000068612804,0.066709295,0.00007211444,0.000008554731,0.000039242022,0.000024328867,0.90989965,0.00078233966,0.0014236204,0.019540086,0.00059855584],"about_ca_topic_score_codex":0.00018138892,"about_ca_topic_score_gemma":0.0014766298,"teacher_disagreement_score":0.8138734,"about_ca_system_score_codex":0.0000777321,"about_ca_system_score_gemma":0.00003843552,"threshold_uncertainty_score":0.819874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05261909,0.0002232688,0.94555444,0.00035383378,0.00017794555,0.00025410682,0.0000019050007,0.00013325312,0.00068215677],"genre_scores_gemma":[0.9620808,0.000008327572,0.03651187,0.00075121695,0.00041539155,0.00006202781,0.000005354251,0.000008253331,0.00015679841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998681,0.00008065264,0.00019837405,0.00033828622,0.00016477784,0.000536929],"domain_scores_gemma":[0.9990995,0.0001397269,0.000083121115,0.00041665602,0.00007538915,0.0001856334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071840384,0.00014956987,0.00026941317,0.000072061994,0.0002691802,0.00012506235,0.00039649234,0.00013894509,0.000018877841],"category_scores_gemma":[0.000015998363,0.00013078445,0.00017797573,0.0006861303,0.000061385,0.000656392,0.00020886658,0.00013321589,0.0000030797287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001749621,0.00029169512,0.29919505,0.00003610363,0.001565364,0.0000033318827,0.002167314,0.015128914,0.000048908816,0.6044885,0.029336238,0.04772107],"study_design_scores_gemma":[0.00020292791,0.0000219941,0.053290486,0.0000014647948,0.0001741671,0.0000030766535,0.000008394991,0.9394321,0.00006403126,0.0006944792,0.005878603,0.00022829397],"about_ca_topic_score_codex":0.000043201824,"about_ca_topic_score_gemma":0.000074718606,"teacher_disagreement_score":0.9243032,"about_ca_system_score_codex":0.000038095026,"about_ca_system_score_gemma":0.000011080486,"threshold_uncertainty_score":0.53332347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061042956,0.0000087891585,0.97001255,0.00036538078,0.00012711232,0.012424218,0.0000011930555,0.00012414338,0.016326217],"genre_scores_gemma":[0.64998233,3.7175158e-7,0.32261488,0.0032029995,0.000270342,0.020535678,0.000002851651,0.000021188302,0.00336935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899447,0.00001650411,0.00021696075,0.00027538138,0.00016648507,0.00033018697],"domain_scores_gemma":[0.9993698,0.00019590542,0.000042545824,0.0002724834,0.000052797866,0.00006648278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006661384,0.00008734042,0.00011656315,0.0000699364,0.000034964698,0.000058732017,0.00037531985,0.000060700786,0.00013679112],"category_scores_gemma":[0.000022839087,0.000077292825,0.000043239426,0.00021423094,0.000016433309,0.00019390832,0.000056227153,0.00008878375,0.00003199634],"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.0005280336,0.0008599397,0.03327294,0.00005669152,0.00006765102,0.00009123356,0.000381339,0.0010125962,0.0031677848,0.7998619,0.07217154,0.088528365],"study_design_scores_gemma":[0.0070391116,0.0005368001,0.050939403,0.00006877696,0.000002260896,0.000046140216,0.00001775216,0.50240624,0.0028044176,0.009645643,0.42588407,0.00060937443],"about_ca_topic_score_codex":0.000010566808,"about_ca_topic_score_gemma":0.00007059966,"teacher_disagreement_score":0.79021627,"about_ca_system_score_codex":0.000048236056,"about_ca_system_score_gemma":0.000036555983,"threshold_uncertainty_score":0.315191},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003872865,0.00008133526,0.99324024,0.0010458588,0.0001258561,0.00033196766,4.293625e-7,0.0001946516,0.0011067842],"genre_scores_gemma":[0.96840787,0.000013781715,0.029780703,0.0011763374,0.00019719235,0.000022567285,0.0000014604688,0.000006767204,0.0003933302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990221,0.000028375092,0.00015112988,0.00035544517,0.00014288587,0.0003000227],"domain_scores_gemma":[0.9993162,0.00018124316,0.00006740381,0.00021607209,0.00008204399,0.00013699826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023805072,0.0001270122,0.00016497818,0.00002882407,0.00018201576,0.00014019353,0.00022314012,0.00006192292,0.0000070695355],"category_scores_gemma":[0.000011748071,0.00009112177,0.000032100077,0.00016552953,0.00002206427,0.00028152214,0.00003503607,0.00010033442,7.1480224e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026105143,0.00013895084,0.004536042,0.00000911953,0.00005758575,0.00001952421,0.00015828766,0.007877084,0.00069522735,0.3747893,0.005018373,0.6064395],"study_design_scores_gemma":[0.0009777371,0.00027931895,0.0047499523,0.000038265844,0.0000069386156,0.0000369986,0.000006652065,0.9925215,0.00010111244,0.00065786036,0.00047413987,0.00014947596],"about_ca_topic_score_codex":0.0000063401653,"about_ca_topic_score_gemma":0.000011090017,"teacher_disagreement_score":0.9846445,"about_ca_system_score_codex":0.000018542612,"about_ca_system_score_gemma":0.0000323875,"threshold_uncertainty_score":0.37158382},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070740754,0.00022153766,0.95745295,0.0003187083,0.00016088081,0.03658721,5.1260594e-7,0.0004397471,0.0041110343],"genre_scores_gemma":[0.3500123,0.000029116958,0.56197566,0.00085435074,0.00030753348,0.08649444,0.0000021053872,0.00003610586,0.00028839175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792504,0.00007751351,0.00049718155,0.00059299485,0.00022402829,0.0006832458],"domain_scores_gemma":[0.998696,0.00035814013,0.00018048007,0.00052901,0.0001119157,0.00012442713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617939,0.00023720387,0.00046625055,0.00010129499,0.00012338978,0.00020223045,0.00087069336,0.0001456716,0.000009770424],"category_scores_gemma":[0.00005922062,0.00020598547,0.00015210577,0.0004607924,0.000024254115,0.0004803473,0.00021772324,0.0002436287,0.000014644828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079095905,0.000695218,0.000310973,0.00005637511,0.00013966022,0.000066512235,0.0014831246,0.40424183,0.00005007307,0.51129615,0.0011362593,0.07973288],"study_design_scores_gemma":[0.015599653,0.0005325341,0.00010065367,0.00014886113,0.00000790286,0.000008087193,0.000037453654,0.9729107,0.00019200829,0.0060152723,0.004123709,0.00032317045],"about_ca_topic_score_codex":0.0000065276304,"about_ca_topic_score_gemma":0.00012823747,"teacher_disagreement_score":0.56866884,"about_ca_system_score_codex":0.00019173848,"about_ca_system_score_gemma":0.00015116541,"threshold_uncertainty_score":0.83998436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013734189,0.00025425927,0.98137605,0.00008263452,0.00045944488,0.0003035139,2.0277706e-7,0.00007128444,0.0037184458],"genre_scores_gemma":[0.9211815,0.000042072796,0.0773303,0.0008204144,0.00055040733,0.000019970825,7.652231e-7,0.00002148371,0.000033097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978395,0.00006143128,0.00076234917,0.00031866992,0.00029815387,0.00071988534],"domain_scores_gemma":[0.9982137,0.0006461459,0.00051106187,0.0003538911,0.00011699032,0.00015818138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016751068,0.00025601665,0.00030720216,0.00015839656,0.00053538533,0.0004564047,0.0012090945,0.00012262909,0.000002074225],"category_scores_gemma":[0.000037640842,0.0001677746,0.00012394422,0.00048898405,0.0000681211,0.0006112967,0.00040492034,0.000739062,0.0000011056676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051516756,0.00006176465,0.0015491445,0.00002021021,0.000042519445,0.000015840931,0.0021444603,0.14823249,0.0000042859365,0.038582038,0.00021728995,0.80907845],"study_design_scores_gemma":[0.00077266403,0.0001892741,0.0012570157,0.00017577595,0.0000063557795,0.0004391599,0.00007987073,0.99472463,0.000025959172,0.0016564948,0.00044176285,0.00023105186],"about_ca_topic_score_codex":0.000038337213,"about_ca_topic_score_gemma":0.00001103322,"teacher_disagreement_score":0.9074473,"about_ca_system_score_codex":0.00007154429,"about_ca_system_score_gemma":0.00007473869,"threshold_uncertainty_score":0.684165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09680314,0.000658111,0.9018078,0.00010700342,0.00016022626,0.00021113825,6.7200745e-8,0.000101013575,0.00015151265],"genre_scores_gemma":[0.9305922,0.0018416417,0.06727288,0.00010880233,0.000034624496,0.00001803346,1.5642418e-7,0.000005156885,0.00012650379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887264,0.0001368194,0.0002563005,0.0003512127,0.00018455941,0.0001984712],"domain_scores_gemma":[0.9987381,0.000426934,0.000077609344,0.0005670047,0.00013053507,0.00005981247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047302744,0.000113555856,0.00025110313,0.000028021406,0.00010574569,0.000011867975,0.00033922016,0.00005574154,0.0000047728117],"category_scores_gemma":[0.000032923068,0.00008772247,0.000027253212,0.00025589776,0.00019420765,0.00027813125,0.00034203738,0.00008557241,0.0000021179837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022703326,0.0009952784,0.046795674,0.00032303287,0.00032614256,0.00023435395,0.018073848,0.4177868,0.0024577994,0.1453056,0.08854177,0.27893266],"study_design_scores_gemma":[0.00024404994,0.00015118856,0.0037152802,0.00003187719,0.0000049020173,0.000024018913,0.000050630642,0.99293077,0.001117018,0.0015352755,0.00004572399,0.00014923721],"about_ca_topic_score_codex":0.000013996311,"about_ca_topic_score_gemma":0.0000020256464,"teacher_disagreement_score":0.8345349,"about_ca_system_score_codex":0.000019363362,"about_ca_system_score_gemma":0.00003171424,"threshold_uncertainty_score":0.35772184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041565637,0.0008885712,0.9917674,0.00043179226,0.00041792734,0.0012830342,0.000003125809,0.00050851185,0.0042839507],"genre_scores_gemma":[0.8407683,0.00032086277,0.14753407,0.0061808387,0.00069293246,0.0009608522,0.00004297342,0.000037832615,0.0034613614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824935,0.00003821639,0.0003230031,0.00058750424,0.00020344688,0.00059848616],"domain_scores_gemma":[0.99824023,0.0003252555,0.000096162024,0.0010158328,0.000119689365,0.00020280815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031620578,0.00021519483,0.00024958843,0.000057770136,0.00014042476,0.000221999,0.0010878235,0.00012854935,0.000038303886],"category_scores_gemma":[0.000047598067,0.00019064399,0.00011734906,0.00047511767,0.000031810207,0.00032073192,0.000118217715,0.00016264222,0.000048417503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021799313,0.00014799507,0.000015824828,0.000007189745,0.000009223336,0.000014996196,0.00006697388,0.03182893,0.000043511947,0.043045145,0.05368361,0.8711148],"study_design_scores_gemma":[0.00064869586,0.000462716,0.0004616498,0.000033966815,0.000009686325,0.000016699381,0.000007818528,0.93486637,0.00013372512,0.006895486,0.056120753,0.0003424269],"about_ca_topic_score_codex":0.000003005336,"about_ca_topic_score_gemma":0.00002777567,"teacher_disagreement_score":0.9030374,"about_ca_system_score_codex":0.00006074278,"about_ca_system_score_gemma":0.00005582208,"threshold_uncertainty_score":0.7774236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33540294,0.0024266732,0.6221457,0.005095678,0.000795647,0.0019205124,0.000002937736,0.00039782256,0.03181206],"genre_scores_gemma":[0.9760096,0.00008181097,0.016005285,0.0029694168,0.00013676044,0.00019134609,6.137757e-7,0.000015128521,0.004590016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844813,0.00008104961,0.00031418446,0.00041600977,0.00034741705,0.00039323524],"domain_scores_gemma":[0.99811614,0.00027756518,0.00007837096,0.0013233505,0.00007295941,0.00013159118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038800953,0.0001613613,0.00017685459,0.00005599662,0.000090520516,0.00006647333,0.0014950216,0.00008088053,0.0006052676],"category_scores_gemma":[0.0000192576,0.00010445665,0.0000867175,0.00053240487,0.000040944273,0.00016424092,0.00034242065,0.00020401519,0.0002866608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026945332,0.00029743076,0.00019910048,0.000003387503,0.000011632256,0.0000075447315,0.00059840496,0.1342817,0.0005950242,0.072554804,0.13627593,0.6551481],"study_design_scores_gemma":[0.00092504185,0.0019800959,0.0052916002,0.0001454256,0.000031027772,0.000023602055,0.00014137202,0.5723449,0.016660068,0.0018091762,0.39959216,0.0010555441],"about_ca_topic_score_codex":0.0000070239957,"about_ca_topic_score_gemma":0.00007587415,"teacher_disagreement_score":0.65409255,"about_ca_system_score_codex":0.000042451004,"about_ca_system_score_gemma":0.000032217726,"threshold_uncertainty_score":0.66272557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077578714,0.0001700208,0.98849446,0.00059071457,0.0008766321,0.0010621916,0.0000419648,0.00076151406,0.00024466266],"genre_scores_gemma":[0.96013004,0.0013432445,0.03501404,0.0003845799,0.00008281227,0.0015512436,0.000024376108,0.0000797669,0.0013898861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716544,0.00016048348,0.00072609266,0.0008558899,0.0003388745,0.0007532271],"domain_scores_gemma":[0.9934247,0.0006931792,0.00023810178,0.0049915705,0.00037266093,0.0002797698],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00042106598,0.00043021716,0.0004574411,0.00024157327,0.002635236,0.00027429563,0.0049993685,0.0003045903,0.00002430648],"category_scores_gemma":[0.000006725843,0.00047063213,0.00037590825,0.000925611,0.0004273367,0.0009495194,0.000078029574,0.0009101238,0.000051935363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014595194,0.0039357347,0.00047859136,0.000081356935,0.00052463345,0.000020316369,0.004065909,0.8518268,0.0008853546,0.039287288,0.0018112251,0.09693685],"study_design_scores_gemma":[0.0013149026,0.000091481015,0.00049328845,0.00007764006,0.000029461225,0.00004362456,0.000028460447,0.9947338,0.001837308,0.00017334922,0.0006694034,0.00050726597],"about_ca_topic_score_codex":0.000102047044,"about_ca_topic_score_gemma":0.00043512447,"teacher_disagreement_score":0.95348036,"about_ca_system_score_codex":0.0001866001,"about_ca_system_score_gemma":0.00013204201,"threshold_uncertainty_score":0.9997745},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26641312,0.0009437769,0.7281231,0.0001628677,0.0004902893,0.00024315955,1.8389494e-7,0.00045309748,0.003170367],"genre_scores_gemma":[0.9882301,0.00037536016,0.009754669,0.00043528562,0.00007959612,0.00002642793,0.0000057541793,0.000019334484,0.0010734403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803954,0.000077518656,0.00038803075,0.0005664879,0.00027848757,0.00064994645],"domain_scores_gemma":[0.99884427,0.00008435638,0.00008842151,0.0008028244,0.000052406,0.0001276993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002725765,0.00020101103,0.00026375224,0.00008812271,0.00016019474,0.00008846721,0.0009048154,0.00008886854,0.00007734175],"category_scores_gemma":[0.000019097837,0.00018398937,0.00007775195,0.0006578898,0.000040571762,0.00040733197,0.00044442667,0.00036274362,0.000083016836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007167061,0.0009978081,0.110061765,0.000037621492,0.00013895468,0.0037706706,0.0013523011,0.6475047,0.0004237925,0.049144633,0.062110208,0.12438586],"study_design_scores_gemma":[0.0004679977,0.00004180496,0.012799965,0.00003625872,0.0000023011085,0.00006757969,0.000004528513,0.9836393,0.0002324333,0.00028791808,0.002175524,0.00024439968],"about_ca_topic_score_codex":0.00005088563,"about_ca_topic_score_gemma":0.00004174873,"teacher_disagreement_score":0.721817,"about_ca_system_score_codex":0.00007563971,"about_ca_system_score_gemma":0.00004536394,"threshold_uncertainty_score":0.7502869},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0559189,0.00017731881,0.92798287,0.000108012944,0.0010970362,0.0018294168,0.0000025652962,0.00024348713,0.012640379],"genre_scores_gemma":[0.98756164,0.00071204844,0.0028691967,0.000008164335,0.00032539156,0.0000362997,0.0000205407,0.000055491986,0.008411236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995989,0.0008487861,0.0002812513,0.001218227,0.00080801477,0.0008547002],"domain_scores_gemma":[0.99737525,0.0008096178,0.00017776951,0.00085402734,0.00040628793,0.00037707153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008588497,0.000353744,0.00042194186,0.00097627146,0.001022471,0.00029273552,0.001348418,0.00062053325,0.0000075410167],"category_scores_gemma":[0.000067516354,0.00039587502,0.0001814711,0.0009387451,0.00031876928,0.0007431878,0.0003819927,0.0011001333,0.0000077767045],"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.0010166016,0.00008924309,0.000010494975,0.00013079713,0.00011531792,0.0006290137,0.00093876844,0.0007933829,0.008675789,0.9757524,0.00034974128,0.0114984205],"study_design_scores_gemma":[0.0010376554,0.0014336986,0.00021781468,0.00015354523,0.00005533988,0.000145389,0.00036836794,0.6514207,0.095699795,0.24673584,0.0020292515,0.0007025758],"about_ca_topic_score_codex":0.00056786934,"about_ca_topic_score_gemma":0.0006011725,"teacher_disagreement_score":0.9316427,"about_ca_system_score_codex":0.0005921625,"about_ca_system_score_gemma":0.0007259074,"threshold_uncertainty_score":0.9998493},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28472131,0.00025205812,0.63765395,0.00077269506,0.00060941663,0.00016763674,0.0000013036591,0.00061434804,0.075207256],"genre_scores_gemma":[0.9824816,0.000024290484,0.014679519,0.0005263368,0.00013610224,0.000015549853,0.0000010320265,0.00000774138,0.0021278528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873394,0.00006661761,0.00024933298,0.00035815977,0.00024199311,0.00034996175],"domain_scores_gemma":[0.99926245,0.00013006103,0.000051531668,0.00045070858,0.00002914358,0.00007609204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017868186,0.00011047978,0.0001265493,0.00008174467,0.000081953294,0.000047107565,0.0007260212,0.00007208086,0.00006373275],"category_scores_gemma":[0.00002349125,0.00010198639,0.000023163633,0.00039222543,0.000030634437,0.00049592747,0.00030787592,0.0001275562,0.00003524838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003151016,0.0003895462,0.08905005,0.000023664921,0.000058603815,0.0035116305,0.0047322693,0.03760362,0.0016003441,0.51736367,0.08334474,0.26229036],"study_design_scores_gemma":[0.0012907102,0.00018436101,0.21832708,0.00004731847,0.000002707409,0.0005764537,0.000045147553,0.74836767,0.009521322,0.005062745,0.015862497,0.00071198115],"about_ca_topic_score_codex":0.00026419817,"about_ca_topic_score_gemma":0.00034966817,"teacher_disagreement_score":0.71076405,"about_ca_system_score_codex":0.00003446557,"about_ca_system_score_gemma":0.00007410136,"threshold_uncertainty_score":0.41588843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120923385,0.0011684735,0.8746389,0.000062499195,0.00040495433,0.00025311683,5.720124e-8,0.0002840987,0.0022645013],"genre_scores_gemma":[0.98246366,0.00012776758,0.016838264,0.0002515107,0.0001042023,0.00007591737,5.6183995e-7,0.00001071215,0.00012737745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871045,0.00004133433,0.000258976,0.000418548,0.00015457018,0.0004161112],"domain_scores_gemma":[0.9992893,0.000051353734,0.00006465448,0.000488309,0.00002916539,0.00007723755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031452486,0.00013117513,0.00013949882,0.00008356263,0.00008059311,0.00012609438,0.0005209058,0.00010622105,0.00001906956],"category_scores_gemma":[0.0000102335625,0.00012744253,0.000050555158,0.00075173296,0.000020372283,0.00049749616,0.00021582744,0.0002408165,0.00005375103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046061377,0.000051407562,0.0005651768,0.0000020364569,0.0000040060813,0.000027105381,0.00023014774,0.35141063,0.0001740509,0.0040453435,0.00002465101,0.64346087],"study_design_scores_gemma":[0.0010365734,0.00029145292,0.008743214,0.000049329818,0.000003050843,0.000047085054,0.000060822535,0.98065346,0.002429812,0.002346853,0.003938961,0.00039935458],"about_ca_topic_score_codex":0.000051148436,"about_ca_topic_score_gemma":0.001231608,"teacher_disagreement_score":0.8615403,"about_ca_system_score_codex":0.00016393633,"about_ca_system_score_gemma":0.00003735424,"threshold_uncertainty_score":0.5196956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3715287,0.000012410096,0.5866615,0.0000014892985,0.00014243224,0.041138545,3.2710327e-7,0.000074422525,0.00044015853],"genre_scores_gemma":[0.90996164,0.0000013406321,0.06508266,0.00005337915,0.00015963621,0.02466371,0.0000040535697,0.00002044728,0.00005315363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779445,0.000097772965,0.00052878633,0.0004524832,0.0006114648,0.000515072],"domain_scores_gemma":[0.9983381,0.00009615267,0.00032397363,0.00064965093,0.00048457627,0.00010755473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040404475,0.00017264592,0.00020896112,0.00008296151,0.00018224677,0.0000780449,0.0006710529,0.00011808156,0.000032088516],"category_scores_gemma":[0.000016700267,0.00016223213,0.000064592234,0.00045329297,0.00004580327,0.00082768616,0.00016815716,0.0001153175,0.0000016026321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035209974,0.000089448455,0.0007349456,0.00002266285,0.000008120359,6.595501e-7,0.00018526638,0.27823424,0.000291368,0.0002507624,0.000024710362,0.72012264],"study_design_scores_gemma":[0.0010835306,0.0003848462,0.0020319438,0.000060913844,0.000015232935,0.0000071154172,0.00003503113,0.99249387,0.0033725658,0.00003626124,0.00028783717,0.00019083235],"about_ca_topic_score_codex":0.0000073881033,"about_ca_topic_score_gemma":0.00003175183,"teacher_disagreement_score":0.7199318,"about_ca_system_score_codex":0.00014786528,"about_ca_system_score_gemma":0.00013215917,"threshold_uncertainty_score":0.6615634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016460337,0.000066428416,0.9832345,0.0008185309,0.0000738797,0.00019916544,0.000002683506,0.00035260245,0.0136061795],"genre_scores_gemma":[0.90055805,0.000026220934,0.09736833,0.00066490844,0.000031740365,0.00006757063,0.000013187688,0.000014793094,0.0012551701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989931,0.000062174695,0.0001712192,0.00019907308,0.00017649091,0.00039795344],"domain_scores_gemma":[0.9976998,0.00009020583,0.00006964876,0.0018009287,0.00007723746,0.0002622033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019092542,0.00013461868,0.00013563072,0.00004350805,0.000160907,0.00008082538,0.0015042193,0.00005898044,0.000016877582],"category_scores_gemma":[0.000003920801,0.000104497805,0.000024364905,0.00033530692,0.00009289505,0.0007831872,0.00056211365,0.00015711924,0.0000565272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081204935,0.00047697916,0.00081435894,0.000012330443,0.000044913184,0.000005129901,0.0013865996,0.01396902,0.00028329983,0.96056604,0.005293732,0.017139493],"study_design_scores_gemma":[0.00017861594,0.000019309271,0.00010538638,0.000010871512,0.000006090302,0.000012924722,0.000024966728,0.99839854,0.00010076453,0.00039497894,0.000578594,0.00016893916],"about_ca_topic_score_codex":0.00006273941,"about_ca_topic_score_gemma":0.000052593117,"teacher_disagreement_score":0.98442954,"about_ca_system_score_codex":0.000027766979,"about_ca_system_score_gemma":0.00008587026,"threshold_uncertainty_score":0.4261297},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011169389,0.0002293192,0.9804895,0.0012900681,0.0017251091,0.0012799221,0.0000021038013,0.00028853136,0.0035260376],"genre_scores_gemma":[0.8379822,0.0024795462,0.15185508,0.0058420836,0.00023785901,0.0012491385,0.000008083799,0.000060875616,0.00028517615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967503,0.00016396432,0.00053747516,0.0010417096,0.00058805617,0.00091851247],"domain_scores_gemma":[0.99810904,0.00017385856,0.00009605396,0.0012466991,0.00005357667,0.00032076688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000779707,0.00041556873,0.00036341976,0.00028195282,0.00037771228,0.00039453345,0.0011316546,0.00022074301,0.00013008763],"category_scores_gemma":[6.8949385e-7,0.00043213659,0.00013128911,0.0017522405,0.00007938016,0.0006247167,0.000070822585,0.0011758701,0.00006566336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017318019,0.00084355654,0.000077891316,0.00018882233,0.00017125458,0.00026784206,0.00016154622,0.5672124,0.000010112935,0.03394548,0.000603893,0.39634404],"study_design_scores_gemma":[0.0017032912,0.0001706913,0.0020121953,0.00013012665,0.0000705917,0.000011145984,0.000052110634,0.95686394,0.000012109946,0.0017426895,0.036692273,0.0005388553],"about_ca_topic_score_codex":0.00001595625,"about_ca_topic_score_gemma":0.0016987995,"teacher_disagreement_score":0.82863444,"about_ca_system_score_codex":0.00007991934,"about_ca_system_score_gemma":0.000023304208,"threshold_uncertainty_score":0.999813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19170426,0.000058807444,0.8020887,0.00005695109,0.0007479231,0.00018616028,5.354383e-7,0.00021881048,0.004937857],"genre_scores_gemma":[0.9445713,0.000013170391,0.054847043,0.00028280675,0.00016857509,0.000013905497,7.1785905e-7,0.000015027188,0.00008740868],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982964,0.00016819766,0.0002864826,0.0005489907,0.00020960084,0.0004903247],"domain_scores_gemma":[0.99910474,0.00017472073,0.00008757229,0.00048027458,0.00003482857,0.000117864394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041992016,0.0001919939,0.0002523787,0.00010676037,0.0001085514,0.00006621701,0.0004998884,0.00013652872,0.0001047608],"category_scores_gemma":[0.000013163015,0.0001823981,0.000071039554,0.00065342593,0.00006984432,0.0005433364,0.00020037654,0.00030840977,0.000011641963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002176741,0.0022539385,0.36858115,0.000053518936,0.00021908,0.00096561335,0.004589451,0.107201986,0.004236707,0.15139543,0.0019197693,0.35836568],"study_design_scores_gemma":[0.0002826469,0.000035148252,0.056834895,0.000024052464,0.0000034215852,0.000074154894,0.000018946303,0.94161475,0.00040965265,0.00034532248,0.00011776625,0.00023923698],"about_ca_topic_score_codex":0.00061259896,"about_ca_topic_score_gemma":0.00050773186,"teacher_disagreement_score":0.83441275,"about_ca_system_score_codex":0.00009854409,"about_ca_system_score_gemma":0.000055321776,"threshold_uncertainty_score":0.7437979},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003830856,0.012820821,0.98129356,0.00022598843,0.0023513185,0.00051428407,0.0000023809146,0.0002352878,0.0021732864],"genre_scores_gemma":[0.30465397,0.008845759,0.6770032,0.0057769036,0.0014314014,0.00037179096,0.000030839095,0.00032762962,0.0015584881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994213,0.00010804154,0.0008619634,0.0024659107,0.0009897545,0.0013613501],"domain_scores_gemma":[0.9963581,0.000640572,0.00037390628,0.0021759197,0.00018340879,0.00026811683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011530216,0.0008609107,0.00089176255,0.0009293076,0.0002409103,0.00070998986,0.0046136808,0.0006102776,0.000049187234],"category_scores_gemma":[0.000064473184,0.0008368118,0.00017766122,0.0014944901,0.0006447949,0.00093357026,0.0019427076,0.0017616458,0.000027217246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040952864,0.000023744984,0.00004071147,0.000017982842,0.0000070669057,0.00018266252,0.00028015845,0.4038056,0.00001387496,0.002424455,0.000023601799,0.59317607],"study_design_scores_gemma":[0.00050327304,0.00021268406,0.00020483871,0.0008949286,0.00000851929,0.00009829295,2.8653085e-7,0.96734875,0.00012655069,0.021866906,0.0074855527,0.0012493854],"about_ca_topic_score_codex":0.000017059541,"about_ca_topic_score_gemma":0.00056509767,"teacher_disagreement_score":0.59192663,"about_ca_system_score_codex":0.00058240787,"about_ca_system_score_gemma":0.00033699622,"threshold_uncertainty_score":0.99940825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27704915,0.0014320345,0.72028345,0.00035344568,0.00059239205,0.0002347534,0.0000025269476,0.000034441622,0.000017774135],"genre_scores_gemma":[0.71756494,0.00005382481,0.2812371,0.0006293455,0.00046536047,0.000004105886,0.000003340558,0.00002365283,0.00001832101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978883,0.00013012833,0.0006415234,0.00035941842,0.0005672385,0.00041338944],"domain_scores_gemma":[0.9972088,0.0008218837,0.000899856,0.0002357031,0.0006883306,0.00014543216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006510324,0.00029542536,0.00035089173,0.00019273831,0.0003351601,0.0003094156,0.0014735843,0.00009757293,0.0000029544913],"category_scores_gemma":[0.00010274191,0.00019485096,0.00023715534,0.00020371702,0.00015285847,0.00029906502,0.0003351073,0.00061068527,4.8625935e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005422183,0.00016858055,0.0029945693,0.000022631317,0.00046051666,0.00037186523,0.004853812,0.7540999,0.00028460057,0.00034101927,0.0008220833,0.23503819],"study_design_scores_gemma":[0.0022466371,0.0004548988,0.0008922828,0.00044132408,0.000028275952,0.0015355336,0.0002400962,0.9914524,0.0001691304,0.00008888733,0.0022221156,0.0002284395],"about_ca_topic_score_codex":0.000010763693,"about_ca_topic_score_gemma":0.00006522016,"teacher_disagreement_score":0.4405158,"about_ca_system_score_codex":0.00012935286,"about_ca_system_score_gemma":0.00017186403,"threshold_uncertainty_score":0.79457915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012437653,0.0002295567,0.98151606,0.010874654,0.000919176,0.0011241464,0.00002748824,0.00036330975,0.0037018165],"genre_scores_gemma":[0.20717616,0.0000252172,0.76874363,0.0038544848,0.0014358326,0.0014425402,0.0001039696,0.0000824684,0.01713568],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654794,0.000121032375,0.00051480817,0.00094776705,0.00077408704,0.0010943448],"domain_scores_gemma":[0.99651164,0.0016861098,0.00013455804,0.0010781346,0.00033809815,0.00025147482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009112793,0.0003358033,0.00042141008,0.00014877584,0.00014099154,0.00038149246,0.0010469981,0.0004185548,0.00079758634],"category_scores_gemma":[0.0003563849,0.0003171297,0.0001379485,0.0010872734,0.000052609972,0.00052097056,0.00060146063,0.00059809233,0.00014749954],"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.000060364593,0.00032942902,0.0003282888,0.000021023048,0.000013821641,0.000103848026,0.00020336156,0.0056029516,0.000007462214,0.15667185,0.77863145,0.058026154],"study_design_scores_gemma":[0.0007488245,0.00035469103,0.0024438,0.000109155444,0.000012183949,0.000038453563,0.000036594836,0.63332415,0.00006604738,0.018649442,0.34350964,0.00070702436],"about_ca_topic_score_codex":0.00011830102,"about_ca_topic_score_gemma":0.0008768526,"teacher_disagreement_score":0.6277212,"about_ca_system_score_codex":0.00014199658,"about_ca_system_score_gemma":0.00009513557,"threshold_uncertainty_score":0.99992806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13633786,0.020130394,0.8290146,0.0024003848,0.0022758013,0.0020064535,0.000018664716,0.000440206,0.0073756175],"genre_scores_gemma":[0.96668005,0.0048776995,0.027463593,0.0005097646,0.0001822662,0.00016451346,0.000018832476,0.000028493256,0.000074792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718386,0.00058449624,0.00084585603,0.00026359354,0.000335306,0.0007869158],"domain_scores_gemma":[0.9961071,0.001043818,0.00041809742,0.0017239084,0.0003876784,0.0003193949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013595624,0.00026656027,0.00036347748,0.00028857883,0.00046961388,0.00024776158,0.0027678993,0.0001699186,0.000024639523],"category_scores_gemma":[0.00023251033,0.0002638945,0.000068605084,0.0022966391,0.000112596645,0.00095467555,0.00042556916,0.0022561052,0.000028867698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036051063,0.016817905,0.082704276,0.000039331924,0.0005221946,0.00020283347,0.021766791,0.2793187,0.006714155,0.22134162,0.012577456,0.35763422],"study_design_scores_gemma":[0.0013958919,0.00026212624,0.0147450585,0.00045724478,0.000012947996,0.0004473301,0.00018428455,0.9670244,0.000056673503,0.00013865947,0.0147552425,0.0005201572],"about_ca_topic_score_codex":0.000007186334,"about_ca_topic_score_gemma":0.00022893936,"teacher_disagreement_score":0.8303422,"about_ca_system_score_codex":0.0005075734,"about_ca_system_score_gemma":0.0003484417,"threshold_uncertainty_score":0.99998134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17178124,0.00003715527,0.8105674,0.00018378111,0.0018333652,0.00014102813,5.0408414e-7,0.00032668043,0.015128857],"genre_scores_gemma":[0.6047362,0.0000023023501,0.39463687,0.00025099883,0.00022956681,0.0000025174843,6.689473e-7,0.000011932211,0.00012894947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986971,0.000016050006,0.00022971892,0.00040333756,0.0002437686,0.0004100162],"domain_scores_gemma":[0.9989379,0.00008647433,0.000080033155,0.00067636475,0.000055395238,0.0001638109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002715955,0.00015362383,0.00013866727,0.000071312934,0.00016120555,0.0003354394,0.0008620101,0.00010116568,0.00024287736],"category_scores_gemma":[0.000010158312,0.00014227844,0.000068852314,0.0002703858,0.000046613448,0.00058101,0.00026882318,0.00037925798,0.00012408881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037747654,0.00011302022,0.0012389196,0.000010424705,0.00003071447,0.00010782108,0.0003377382,0.005863512,0.10390973,0.020546282,0.0017532646,0.8660848],"study_design_scores_gemma":[0.00021046869,0.000017544846,0.0017122199,0.000012226239,0.0000042300508,0.00013834987,0.000013649527,0.97913,0.0081168795,0.00071751355,0.009644399,0.00028248693],"about_ca_topic_score_codex":0.00016803382,"about_ca_topic_score_gemma":0.000039621602,"teacher_disagreement_score":0.97326654,"about_ca_system_score_codex":0.000028710636,"about_ca_system_score_gemma":0.00006084325,"threshold_uncertainty_score":0.58019465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012695092,0.00018488876,0.98437643,0.00017334326,0.0014229722,0.0005736437,0.0000035870082,0.00018702341,0.00038303982],"genre_scores_gemma":[0.5579807,0.000007881847,0.4399074,0.00040353014,0.0013264419,0.0001139721,0.000025214804,0.00003812046,0.00019674907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998144,0.00007533968,0.0004117151,0.0005353107,0.00021644044,0.0006172235],"domain_scores_gemma":[0.9992384,0.00008518522,0.00011420109,0.00042841994,0.00006207727,0.000071763505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030334824,0.00021075759,0.0002453657,0.00016218256,0.00013679669,0.00015779372,0.0004989187,0.00015567197,0.000010603872],"category_scores_gemma":[0.000004757085,0.00022797602,0.000082722254,0.00058256224,0.000033282406,0.00042748224,0.00023385203,0.00018335413,0.000015987815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004740464,0.00023709817,0.0011032359,0.0000582367,0.000020781621,0.000056598434,0.00014474221,0.10660882,0.0004549556,0.0025645609,0.0076349466,0.88106865],"study_design_scores_gemma":[0.00095387927,0.00008022694,0.0013972785,0.000048261114,0.0000060441,0.00008094733,0.0000067493784,0.98755944,0.00054626976,0.0019433695,0.00712445,0.00025310932],"about_ca_topic_score_codex":0.0012386865,"about_ca_topic_score_gemma":0.0018533731,"teacher_disagreement_score":0.88095057,"about_ca_system_score_codex":0.000382438,"about_ca_system_score_gemma":0.00006466338,"threshold_uncertainty_score":0.92965925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028513696,0.0000051459037,0.84619147,0.00068175816,0.00030837112,0.11614803,0.0000028885624,0.00026348638,0.00788517],"genre_scores_gemma":[0.68111944,9.954217e-7,0.03972237,0.000044162407,0.00004388855,0.27690616,0.0000056308622,0.0000140315815,0.00214329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988262,0.00006089409,0.0003824085,0.00032824077,0.00014417246,0.00025805907],"domain_scores_gemma":[0.9985289,0.00014372807,0.00012644319,0.0009803373,0.00015964957,0.000060918454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061166706,0.00012512022,0.00011566131,0.00007269117,0.00011340844,0.00014454474,0.0011575002,0.00010816833,0.00027679314],"category_scores_gemma":[0.000092630624,0.000113125236,0.00005476702,0.00032085273,0.00003686636,0.00081601104,0.0003641883,0.00024620432,0.000025188525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009183938,0.0010607921,0.03268547,0.0001353541,0.000014829691,0.000003131262,0.0035813935,0.00030433392,0.06328209,0.073987916,0.010562267,0.8142906],"study_design_scores_gemma":[0.0014809433,0.000093625524,0.025973095,0.00006967483,0.000001702786,0.0000036809774,0.00003647841,0.91097265,0.015484391,0.0028074044,0.042742085,0.00033425435],"about_ca_topic_score_codex":0.00007507087,"about_ca_topic_score_gemma":0.001066315,"teacher_disagreement_score":0.9106683,"about_ca_system_score_codex":0.00002963422,"about_ca_system_score_gemma":0.000021431628,"threshold_uncertainty_score":0.4613113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033162313,0.00005678599,0.98973614,0.0020832398,0.00047411432,0.0005801761,5.189342e-7,0.00041270466,0.0033400704],"genre_scores_gemma":[0.95609784,0.000025958656,0.038228836,0.0025928966,0.00026274455,0.0000949572,0.000019127556,0.000014065939,0.002663592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841547,0.00007988192,0.00032827983,0.0005243922,0.00016884561,0.00048314212],"domain_scores_gemma":[0.9986928,0.00016339385,0.00012247165,0.0007395496,0.00014570176,0.00013605435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005265837,0.0001928855,0.00021650328,0.000058178026,0.00014637563,0.00023649028,0.0008741316,0.00013528756,0.000027126322],"category_scores_gemma":[0.0000148980025,0.00017524681,0.000094411305,0.0004680623,0.000024063926,0.00044495083,0.000083399704,0.00012651268,0.000030039808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022894592,0.00010086249,0.000028466293,0.0000063225757,0.00001780971,0.000005831564,0.00007573926,0.004961964,0.0010245651,0.36077806,0.020202693,0.6127748],"study_design_scores_gemma":[0.0005058251,0.00019442919,0.00296172,0.00001956411,0.000008386074,0.000008121331,0.000006608765,0.9878967,0.0012254643,0.0037329204,0.003186654,0.00025364387],"about_ca_topic_score_codex":0.000011831906,"about_ca_topic_score_gemma":0.000036664485,"teacher_disagreement_score":0.9829347,"about_ca_system_score_codex":0.00005990756,"about_ca_system_score_gemma":0.000050875606,"threshold_uncertainty_score":0.7146357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010606709,0.00006986752,0.8770805,0.010106271,0.0007166976,0.00051421113,0.00007872645,0.00029579442,0.1005312],"genre_scores_gemma":[0.94952875,0.000107007625,0.046486147,0.0016853926,0.00022416776,0.00026711554,0.00009185132,0.000021740072,0.0015877986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980359,0.00015865797,0.00045919465,0.00045919797,0.00048284506,0.00040418885],"domain_scores_gemma":[0.9962537,0.00042790253,0.00017156138,0.0026018315,0.0003959849,0.00014898286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029984472,0.00023952012,0.00020265607,0.00016594827,0.00031703734,0.00036856544,0.0046303812,0.00010499855,0.00014834735],"category_scores_gemma":[0.000061147824,0.00024065482,0.0001054592,0.00043831032,0.00015876662,0.0003478493,0.00095842715,0.0003951222,0.00039900173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010956331,0.0002000755,0.00039159186,0.0000010325541,0.000016425256,0.000001438351,0.00013919805,0.13535894,0.00028297908,0.8476333,0.013501702,0.002462372],"study_design_scores_gemma":[0.00029339563,0.000039198865,0.0010397751,0.0000834498,0.000005807,0.0000043392747,0.000006678296,0.8594359,0.00009279481,0.13085793,0.007903962,0.0002367371],"about_ca_topic_score_codex":0.00017206604,"about_ca_topic_score_gemma":0.0011769516,"teacher_disagreement_score":0.93892205,"about_ca_system_score_codex":0.0001541523,"about_ca_system_score_gemma":0.00015806027,"threshold_uncertainty_score":0.98136187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6312639,0.00045825867,0.32303002,0.035290502,0.0024719483,0.0014146137,0.0000034185214,0.00014234275,0.00592496],"genre_scores_gemma":[0.99508613,0.000008293735,0.00071545306,0.00039156902,0.00028195805,0.000028494438,0.0000021207698,0.000014393478,0.0034716106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973007,0.0006948657,0.00048025072,0.00042020893,0.0005638647,0.00054012536],"domain_scores_gemma":[0.995164,0.003328576,0.00023517513,0.0009976552,0.00011561564,0.00015901038],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032941971,0.00018192864,0.00017570943,0.00024975563,0.001993586,0.0023905304,0.0016681812,0.000057328754,0.00010549784],"category_scores_gemma":[0.00024836836,0.000103718274,0.00006995396,0.0022492206,0.0005503392,0.0006082575,0.00041654662,0.0011341174,0.000101905185],"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.000008760491,0.00010892054,0.064209335,0.0000059299036,0.000034999597,0.000014116729,0.003967131,0.015743397,0.000029630264,0.73825204,0.12065043,0.056975316],"study_design_scores_gemma":[0.00048162576,0.000035355282,0.22063762,0.000225317,0.000018762623,0.00007731887,0.00026458598,0.71330744,0.000018709907,0.059919704,0.004722194,0.00029138214],"about_ca_topic_score_codex":0.00001597532,"about_ca_topic_score_gemma":0.000091146954,"teacher_disagreement_score":0.697564,"about_ca_system_score_codex":0.00007089001,"about_ca_system_score_gemma":0.00006326156,"threshold_uncertainty_score":0.99930567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02490114,0.0000810623,0.9664814,0.00024385659,0.0002903907,0.00074017834,2.850616e-7,0.00072208594,0.006539594],"genre_scores_gemma":[0.68763536,2.7496762e-7,0.3114452,0.00013681833,0.00024184039,0.000033962016,0.0000014565381,0.000013326465,0.00049176626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984916,0.000056692385,0.00033932718,0.0004455739,0.00017003297,0.00049681583],"domain_scores_gemma":[0.9989638,0.00035833186,0.00014742467,0.0003927443,0.00008973563,0.000047994843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070834835,0.00014374516,0.00016522213,0.000050939823,0.00038187904,0.00023888194,0.0005923696,0.00006945289,0.000008545075],"category_scores_gemma":[0.00006359915,0.00013431523,0.00008149891,0.00037321108,0.000015940826,0.00026436185,0.000248204,0.00017725352,0.000016187802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015311723,0.00010061582,0.0015916884,0.00006007551,0.000023668397,0.000011882958,0.0005029363,0.0264507,0.0020363713,0.23255171,0.0033370408,0.733318],"study_design_scores_gemma":[0.00047421904,0.000060001217,0.00081403955,0.000032572614,0.0000027764347,0.000012920665,0.000030714,0.990891,0.0019223294,0.0028253363,0.0027334527,0.0002006662],"about_ca_topic_score_codex":0.000043463868,"about_ca_topic_score_gemma":0.000037416896,"teacher_disagreement_score":0.9644403,"about_ca_system_score_codex":0.00005349886,"about_ca_system_score_gemma":0.000033724413,"threshold_uncertainty_score":0.54772156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110282965,0.000085551794,0.88350344,0.0002338981,0.00034067885,0.00012670417,2.8463022e-8,0.00023050049,0.0051962403],"genre_scores_gemma":[0.9437262,0.00012274625,0.054959603,0.000584794,0.00015045927,0.00002084934,8.7797423e-7,0.000010375032,0.000424086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998683,0.000042936885,0.00026285002,0.00040652358,0.00017507169,0.00042963168],"domain_scores_gemma":[0.9991329,0.00009174037,0.000039154686,0.0005979247,0.000035789897,0.00010252572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025204007,0.00013249037,0.00017979465,0.00007476943,0.00009530238,0.000052711497,0.00086942693,0.00010798804,0.00003968648],"category_scores_gemma":[0.000008530962,0.00012458928,0.0000488013,0.0006510716,0.000043974993,0.0003831987,0.00030951653,0.0002912743,0.00006930676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009342202,0.00016165712,0.028230786,0.000008010908,0.000018234105,0.00045550833,0.0005516476,0.29692352,0.00008790031,0.58342165,0.0035019012,0.08662987],"study_design_scores_gemma":[0.00024072862,0.000017267272,0.003274674,0.000016067694,6.2518217e-7,0.000053386786,0.0000043246882,0.99563086,0.00010957257,0.0003649577,0.00012603033,0.00016149179],"about_ca_topic_score_codex":0.0000601504,"about_ca_topic_score_gemma":0.00006224488,"teacher_disagreement_score":0.8334432,"about_ca_system_score_codex":0.000042439817,"about_ca_system_score_gemma":0.000053591422,"threshold_uncertainty_score":0.50806034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014991012,0.0010011795,0.9912965,0.0005908363,0.0036472445,0.0011552765,0.000010522775,0.0003386649,0.0018098097],"genre_scores_gemma":[0.59786665,0.00016731753,0.3966028,0.003928278,0.0011301885,0.000040812454,0.00003517868,0.0001266867,0.00010209666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99156094,0.00012661461,0.0013475891,0.0032613631,0.0017332803,0.0019702408],"domain_scores_gemma":[0.99522454,0.00060217,0.0007418272,0.0026484143,0.0003204184,0.00046265245],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016864832,0.0012644355,0.0012539683,0.00096733496,0.00045783835,0.0009328752,0.00523171,0.00072769186,0.00011659571],"category_scores_gemma":[0.00007913841,0.0012605658,0.00031144405,0.001749957,0.0007997305,0.0011294255,0.0033936414,0.0026408979,0.00007801376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003039603,0.000042048152,0.000062358165,0.000036775768,0.00001566189,0.00077721896,0.00035063046,0.6490226,0.000019105915,0.009270558,0.00014467581,0.34022802],"study_design_scores_gemma":[0.0010256281,0.0003308528,0.00043444562,0.0017158887,0.000013305053,0.00028100325,2.6908998e-7,0.7829521,0.00021642046,0.21133026,0.00046503948,0.0012348042],"about_ca_topic_score_codex":0.00004244016,"about_ca_topic_score_gemma":0.00012213626,"teacher_disagreement_score":0.59771675,"about_ca_system_score_codex":0.0015714709,"about_ca_system_score_gemma":0.0015767089,"threshold_uncertainty_score":0.9996601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20759526,0.00049035647,0.7885359,0.000025522217,0.0011760977,0.0011840443,0.00000386807,0.00051923335,0.00046971304],"genre_scores_gemma":[0.9764855,0.000265742,0.021243762,0.0008437107,0.0001737752,0.00069531606,0.0000038249887,0.00006880282,0.00021960225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961374,0.0002862747,0.00072630466,0.0013164928,0.0005347311,0.0009988421],"domain_scores_gemma":[0.9977017,0.00039751033,0.00015842772,0.0013238288,0.000105509156,0.00031299365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004836459,0.00050666806,0.0005865909,0.0004302331,0.0005362192,0.00019909613,0.0015305609,0.00023524674,0.000007706091],"category_scores_gemma":[0.0000024833337,0.0005491458,0.00021366322,0.002774523,0.00007671901,0.0007674882,0.000042667558,0.0010044413,0.00006735901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032452797,0.0005604542,0.000048611204,0.000026286143,0.00002472915,0.000035074005,0.0019590433,0.874515,0.0001523663,0.000076664815,0.00014025583,0.12242906],"study_design_scores_gemma":[0.0007154888,0.00029867113,0.00032718724,0.00016812289,0.000010508105,0.000119987475,0.000116040916,0.9957386,0.0008048221,0.00001610199,0.0010425517,0.0006418668],"about_ca_topic_score_codex":0.000069708534,"about_ca_topic_score_gemma":0.00010377929,"teacher_disagreement_score":0.7688902,"about_ca_system_score_codex":0.00033205948,"about_ca_system_score_gemma":0.00015453981,"threshold_uncertainty_score":0.999696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7836394,0.000044375854,0.21255447,0.0002882176,0.0011687982,0.0006703859,6.182097e-7,0.00040434467,0.0012294302],"genre_scores_gemma":[0.93913275,0.000013630192,0.059655573,0.00038508675,0.0004558798,0.000104912455,0.000004718061,0.000044376025,0.00020305834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717295,0.00011331516,0.00043723208,0.0009473316,0.0004676956,0.0008614693],"domain_scores_gemma":[0.9981185,0.00019773011,0.00014347317,0.0011740492,0.000107630694,0.0002586256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047578645,0.00041540002,0.00043230667,0.00012407836,0.00023137743,0.0006405471,0.001574365,0.00034483123,0.00027696617],"category_scores_gemma":[0.000019104522,0.00030711875,0.00008360486,0.0012387476,0.00012263682,0.00081868906,0.00038184618,0.0014784301,0.000027194254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041925698,0.000092889655,0.006969788,0.000020023168,0.00002960762,0.00010621417,0.0008799044,0.58867407,0.00051119836,0.008015671,0.0028576625,0.39180106],"study_design_scores_gemma":[0.0008168252,0.0001543491,0.006084635,0.0000918343,0.0000072362573,0.00006994793,0.000027647193,0.9906146,0.00014430005,0.000058049714,0.0014837283,0.00044683783],"about_ca_topic_score_codex":0.00006252727,"about_ca_topic_score_gemma":0.0021306844,"teacher_disagreement_score":0.40194055,"about_ca_system_score_codex":0.000050956503,"about_ca_system_score_gemma":0.00024455195,"threshold_uncertainty_score":0.9999381},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21951203,0.00010909972,0.7671027,0.000046051216,0.0006117721,0.00016450848,2.5294273e-7,0.00007762696,0.012375957],"genre_scores_gemma":[0.949783,0.000015809992,0.048625898,0.00055196526,0.00016546786,0.000016130505,0.000001423586,0.0000063953335,0.00083387044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876577,0.00003144806,0.00031340445,0.0002687554,0.00019230424,0.00042830897],"domain_scores_gemma":[0.9989458,0.00018666632,0.00010143463,0.00065106223,0.000042483403,0.000072567214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063191884,0.000108308195,0.0001765949,0.000046739067,0.000056968234,0.000026946305,0.00068010006,0.00006869819,0.00009676454],"category_scores_gemma":[0.0000053435256,0.00009145069,0.000063843596,0.0003907377,0.00007385161,0.00033486748,0.00020929099,0.00010169526,0.000027649347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011747802,0.00040900358,0.097405165,0.00008760168,0.000053662465,0.000058418245,0.0002767221,0.40645576,0.0007988097,0.21492007,0.017039556,0.26237777],"study_design_scores_gemma":[0.0005495788,0.00080652745,0.0316697,0.00004099488,0.000008116175,0.000013540469,0.000020007185,0.9399295,0.009907112,0.00057406066,0.016130257,0.00035061274],"about_ca_topic_score_codex":0.000022054051,"about_ca_topic_score_gemma":0.000035097913,"teacher_disagreement_score":0.730271,"about_ca_system_score_codex":0.00003222756,"about_ca_system_score_gemma":0.000054400803,"threshold_uncertainty_score":0.3729251},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009143635,0.000027849996,0.9826712,0.0019704357,0.00018590773,0.00034893214,0.0000018592204,0.00027047424,0.0053797294],"genre_scores_gemma":[0.81266814,0.000001589945,0.18465976,0.0020557074,0.00014308709,0.0000752994,0.0000032432608,0.000009343618,0.000383804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892247,0.00003711746,0.00014322637,0.0003620534,0.00019874328,0.00033637165],"domain_scores_gemma":[0.9989849,0.00025503853,0.00003337413,0.00054777,0.00004391595,0.00013502619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011927254,0.00012177855,0.0001384981,0.000042958814,0.00012557617,0.000041628395,0.0005869433,0.0000830611,0.00007075065],"category_scores_gemma":[0.00003621615,0.00010031095,0.000092234564,0.0001819604,0.00005590105,0.00011002677,0.00008882747,0.0001622692,0.00003564857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022778082,0.00095394236,0.0025761328,0.00013159636,0.00008285024,0.00047007462,0.002038317,0.016650375,0.000336462,0.6570529,0.20937471,0.11010489],"study_design_scores_gemma":[0.0008505764,0.00021224143,0.0007559065,0.000006599067,0.0000046745454,0.00012838586,0.0000025176812,0.8895667,0.0016932106,0.015061218,0.09146098,0.0002569702],"about_ca_topic_score_codex":0.000012218936,"about_ca_topic_score_gemma":0.00002227541,"teacher_disagreement_score":0.87291634,"about_ca_system_score_codex":0.00002551762,"about_ca_system_score_gemma":0.00008429459,"threshold_uncertainty_score":0.4090562},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082545124,0.0028947848,0.91184276,0.000036510464,0.00021848599,0.0017424343,0.000002479168,0.00016709982,0.00055030297],"genre_scores_gemma":[0.5073475,0.00021793736,0.49125478,0.0002784613,0.000086422464,0.0005916351,0.000010487268,0.000028900733,0.00018387887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813163,0.000053855958,0.00027945745,0.0007909191,0.00023353646,0.00051057397],"domain_scores_gemma":[0.9989627,0.000091232025,0.00011635657,0.00057149306,0.00008755801,0.00017064175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027864784,0.00027920774,0.0003073561,0.00008918005,0.00032733206,0.000145894,0.00046625215,0.00014020824,0.000005421498],"category_scores_gemma":[0.0000034351126,0.0002532391,0.000056352525,0.000405402,0.00015430509,0.00034557751,0.0003029468,0.00017010262,5.656994e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003056926,0.0014725742,0.008340953,0.001996332,0.00048687018,0.00034091956,0.005085011,0.26273757,0.0005763398,0.08173919,0.009465552,0.62745297],"study_design_scores_gemma":[0.0009986409,0.00014550413,0.0001342284,0.000061437175,0.0000164658,0.00007355105,0.000059195187,0.9962041,0.00011736343,0.00024418285,0.001604259,0.00034111037],"about_ca_topic_score_codex":0.0000065840904,"about_ca_topic_score_gemma":0.000010685701,"teacher_disagreement_score":0.73346645,"about_ca_system_score_codex":0.000050498682,"about_ca_system_score_gemma":0.000059642327,"threshold_uncertainty_score":0.999992},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016809141,0.00005287753,0.9074845,0.00023516812,0.0003053755,0.09031958,0.0000019417866,0.00090699125,0.0005254912],"genre_scores_gemma":[0.2343894,0.000016596225,0.2021472,0.0014869003,0.00068576663,0.5491378,0.000010505886,0.00018147558,0.01194442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966363,0.000119005475,0.0006324838,0.0010894631,0.00037711865,0.0011456737],"domain_scores_gemma":[0.9977116,0.00028638524,0.0002966592,0.0012728672,0.00016482566,0.0002676811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004835322,0.00044076928,0.0004248555,0.00008643237,0.00041719936,0.0004195783,0.0017504379,0.0002669886,0.00013707967],"category_scores_gemma":[0.000029109771,0.000395264,0.00022882971,0.00059942616,0.00007025409,0.00056506775,0.00063203275,0.00042599387,0.000088548346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051468433,0.0006024707,0.0005428831,0.0001541354,0.00006770208,0.000036214875,0.0012743453,0.06335926,0.00005855059,0.0030580228,0.018906344,0.9118886],"study_design_scores_gemma":[0.0020028078,0.00020128606,0.00012240493,0.00014680665,0.00000722421,0.000022282384,0.00005248992,0.9713644,0.000025977188,0.000045147444,0.025500119,0.00050907646],"about_ca_topic_score_codex":0.0000134733855,"about_ca_topic_score_gemma":0.0001296293,"teacher_disagreement_score":0.9113795,"about_ca_system_score_codex":0.00016297802,"about_ca_system_score_gemma":0.00004021963,"threshold_uncertainty_score":0.9998499},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17239824,0.00059130025,0.8251854,0.00009298902,0.00016647352,0.00039294147,0.0000017509976,0.00024120676,0.00092970085],"genre_scores_gemma":[0.9138155,0.00002389212,0.08438829,0.00024051755,0.00018718904,0.00003825298,0.000005012087,0.00002505216,0.0012762677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.000054761687,0.00027029973,0.00058860856,0.00022016994,0.00057936244],"domain_scores_gemma":[0.9987467,0.0005814488,0.000120395154,0.0003856168,0.00008265109,0.00008317584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004178151,0.00023723695,0.00025612023,0.00006412067,0.00028179455,0.0003568819,0.00038516705,0.00009719992,0.0000060684965],"category_scores_gemma":[0.0000134862785,0.0001948474,0.000049561186,0.00030680042,0.00007132048,0.0005070069,0.00020519237,0.00016281688,0.0000033973752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035608353,0.00019066679,0.008889696,0.000080511025,0.00015589061,0.00021921752,0.00089868176,0.62524736,0.0013141674,0.09472303,0.00695362,0.2609711],"study_design_scores_gemma":[0.0009245503,0.00025724422,0.0009166448,0.00006163015,0.00001503468,0.000085559186,0.00016173965,0.99505967,0.00014044264,0.00014924638,0.0018960792,0.0003321366],"about_ca_topic_score_codex":0.000059976497,"about_ca_topic_score_gemma":0.00017843457,"teacher_disagreement_score":0.7414173,"about_ca_system_score_codex":0.00003924568,"about_ca_system_score_gemma":0.000031624095,"threshold_uncertainty_score":0.7945646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027418986,0.001947681,0.96615446,0.000056734272,0.0013124286,0.0007325623,5.116316e-7,0.0002884617,0.0020881891],"genre_scores_gemma":[0.9897639,0.0006019672,0.007986931,0.0002087771,0.0009634513,0.000350077,0.0000026201665,0.00003189402,0.00009038397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981716,0.00008826918,0.00029231305,0.00063872285,0.00019273625,0.000616307],"domain_scores_gemma":[0.9987995,0.0001227924,0.00012744563,0.00070825015,0.00006476178,0.00017724253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002957949,0.00024216843,0.00027379204,0.000070729024,0.0001814487,0.000109289205,0.00060657866,0.00019523801,0.0000056561385],"category_scores_gemma":[0.0000022131696,0.00021926769,0.000038081103,0.001120567,0.00010230511,0.00039388263,0.00013925141,0.00041291493,0.000018870596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025420715,0.00023081234,0.015314298,0.000055548953,0.000096792966,0.00007202301,0.0016388246,0.08487856,0.000066798275,0.00764961,0.0041667023,0.88557583],"study_design_scores_gemma":[0.0014579685,0.00059687166,0.031079061,0.0002830809,0.00004698572,0.000097352575,0.00004481178,0.9360361,0.0006050393,0.010505367,0.018188214,0.0010591396],"about_ca_topic_score_codex":0.000049032053,"about_ca_topic_score_gemma":0.00084989826,"teacher_disagreement_score":0.9623449,"about_ca_system_score_codex":0.00006233787,"about_ca_system_score_gemma":0.00004245469,"threshold_uncertainty_score":0.8941477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054287028,0.00017549383,0.94194436,0.00010501842,0.001395019,0.0012856857,0.00001553666,0.0006444205,0.0001474611],"genre_scores_gemma":[0.9807641,0.000028659537,0.018499058,0.00041673981,0.00006222304,0.00012768879,0.0000030022004,0.00002349124,0.00007503812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975459,0.00013441227,0.0004456361,0.00079507375,0.00031938186,0.0007595814],"domain_scores_gemma":[0.99753994,0.0011910425,0.00016437231,0.0007935287,0.00014400376,0.00016712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008334554,0.0003117636,0.00042392933,0.0005304293,0.0007053806,0.000188102,0.0008102602,0.00014788918,0.000016766598],"category_scores_gemma":[0.00001713465,0.00032405555,0.00037435628,0.0018380918,0.00003375465,0.00036838226,0.0000058912988,0.00042376638,0.00002845442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000651753,0.0006473924,0.000011318993,0.000019145504,0.000049764953,0.000007713861,0.00028095738,0.3737288,0.00040074688,0.001864179,0.00018318661,0.62274164],"study_design_scores_gemma":[0.0030870945,0.00063198974,0.0003263996,0.000046720088,0.000026968586,0.000026260897,0.000027940205,0.9900747,0.0023842042,0.002210878,0.00075429457,0.00040253717],"about_ca_topic_score_codex":0.000005359932,"about_ca_topic_score_gemma":0.000015534464,"teacher_disagreement_score":0.9264771,"about_ca_system_score_codex":0.00013437224,"about_ca_system_score_gemma":0.000056905963,"threshold_uncertainty_score":0.99992114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08006801,0.000049693514,0.6973803,0.000021358088,0.0010159933,0.00024971622,5.2186348e-8,0.00025992273,0.22095492],"genre_scores_gemma":[0.941471,0.0000022211989,0.05721764,0.00013356328,0.00003888866,0.000019853089,1.2381383e-7,0.0000052664986,0.0011114926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925035,0.000030037661,0.00014799013,0.00023131781,0.00008963058,0.00025065872],"domain_scores_gemma":[0.9994932,0.000025167214,0.000030882835,0.0003647304,0.000039745413,0.000046306013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022887987,0.0000706135,0.00007439615,0.00006515012,0.000031453037,0.000027415826,0.00060216006,0.00003520811,0.00043636427],"category_scores_gemma":[0.000030434743,0.00006476835,0.000019954668,0.00027629602,0.000008507922,0.00028477912,0.00029688215,0.000089164445,0.0006432542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012834876,0.0002965051,0.06981272,0.000024270154,0.000026008349,0.00010610296,0.005188355,0.000086438864,0.00043595233,0.039096866,0.008671744,0.8762422],"study_design_scores_gemma":[0.0022930128,0.00033594406,0.20454757,0.00011066363,0.000007478551,0.000023419336,0.000179331,0.7096814,0.034249827,0.035610985,0.011875896,0.0010844978],"about_ca_topic_score_codex":0.00002699049,"about_ca_topic_score_gemma":0.00041994295,"teacher_disagreement_score":0.8751577,"about_ca_system_score_codex":0.000025737058,"about_ca_system_score_gemma":0.000011776271,"threshold_uncertainty_score":0.8267946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05107264,0.0012481652,0.9184879,0.00036776517,0.0005484545,0.00045328384,1.2272788e-7,0.00034021036,0.02748143],"genre_scores_gemma":[0.98891824,0.00006217748,0.009074827,0.00035646188,0.00019950824,0.00007315016,0.0000016926992,0.00001257162,0.0013013447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838704,0.000090479414,0.0003977921,0.00041595488,0.00020896591,0.00049973925],"domain_scores_gemma":[0.99907726,0.00022019514,0.000082369756,0.00051915395,0.000037237613,0.000063791296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043805037,0.0001638171,0.0003438472,0.00009425441,0.0000646212,0.00017964184,0.0007512955,0.00010631941,0.00004796799],"category_scores_gemma":[0.0000075355906,0.00014147573,0.00008462226,0.0005608658,0.000026146621,0.00034009188,0.00020885978,0.00021104659,0.000043573484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012962459,0.00030869225,0.0058113197,0.000009751891,0.000030670333,0.00020610818,0.000112581445,0.24459103,0.00030684914,0.5566849,0.013901629,0.17790683],"study_design_scores_gemma":[0.0030749883,0.000029905528,0.0018476043,0.000020393032,0.0000026121852,0.0000061488427,0.000005148356,0.9913897,0.00006007343,0.0017498046,0.0016213201,0.00019229227],"about_ca_topic_score_codex":0.000061592465,"about_ca_topic_score_gemma":0.00060935534,"teacher_disagreement_score":0.93784565,"about_ca_system_score_codex":0.000059299986,"about_ca_system_score_gemma":0.000031220774,"threshold_uncertainty_score":0.5769212},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015505489,0.00008196577,0.9815014,0.00014010156,0.0006196417,0.00053159264,7.5242724e-7,0.00025673705,0.0013623378],"genre_scores_gemma":[0.98154145,0.000053382268,0.017255561,0.0004062424,0.00018879044,0.00010934796,0.0000034222833,0.000020036176,0.00042173394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978584,0.00006322581,0.0004937052,0.0006565019,0.00019247644,0.0007356976],"domain_scores_gemma":[0.9984941,0.0004487672,0.00014665916,0.0006211895,0.0001633039,0.00012600324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006077341,0.00023445748,0.0003645033,0.00017551202,0.00015819298,0.000113535185,0.0011399117,0.0001505865,0.00001693025],"category_scores_gemma":[0.0000786464,0.00021474769,0.00010673731,0.001397895,0.00003651983,0.0005006672,0.00044988337,0.00031405923,0.000008355431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012686884,0.0004247848,0.036989402,0.000093375886,0.00012841895,0.00014604641,0.003070253,0.021518152,0.0008920005,0.09752879,0.0132300425,0.82585186],"study_design_scores_gemma":[0.00065350614,0.000093705814,0.0016670008,0.000051313997,0.0000030339584,0.000023744413,0.000032198623,0.99657655,0.00032416708,0.0002005597,0.00010186098,0.00027237166],"about_ca_topic_score_codex":0.00023729586,"about_ca_topic_score_gemma":0.00038764515,"teacher_disagreement_score":0.9750584,"about_ca_system_score_codex":0.00025803482,"about_ca_system_score_gemma":0.00016878397,"threshold_uncertainty_score":0.8757157},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006489744,0.000008649548,0.94688535,0.00011163544,0.00019889831,0.029013317,1.739274e-7,0.0005075411,0.016784698],"genre_scores_gemma":[0.8141423,3.6146733e-7,0.16458572,0.0010535464,0.00036124373,0.01902102,0.0000013704156,0.000026682523,0.0008077849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833333,0.000045638833,0.00028063447,0.0004631582,0.00034223634,0.0005349738],"domain_scores_gemma":[0.99884474,0.00006559043,0.00008705082,0.0007306746,0.000072464245,0.00019945583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009825119,0.00014668549,0.00012009581,0.00005780888,0.00013561369,0.00016173728,0.0008899977,0.00007723857,0.00007214716],"category_scores_gemma":[0.000013511665,0.000121068704,0.00004752073,0.0004394242,0.000026654849,0.00024632856,0.0003114098,0.00020341546,0.000103100436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006049731,0.0007928918,0.0010198053,0.00004527148,0.000021979617,0.00021505216,0.0033277404,0.0243293,0.00083473435,0.26754084,0.0045276526,0.6972842],"study_design_scores_gemma":[0.0007397801,0.00026752317,0.0019568722,0.000028453696,0.000002257211,0.000035678317,0.00007999585,0.9536478,0.0029954843,0.00041474492,0.0394852,0.00034620197],"about_ca_topic_score_codex":0.0000065222093,"about_ca_topic_score_gemma":0.000043566037,"teacher_disagreement_score":0.9293185,"about_ca_system_score_codex":0.00005792213,"about_ca_system_score_gemma":0.00004738699,"threshold_uncertainty_score":0.49370384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015410357,0.00045002816,0.97551745,0.000079126214,0.0017297836,0.00059815287,0.0000017181037,0.0003387109,0.019743972],"genre_scores_gemma":[0.9066535,0.0000056409754,0.08156021,0.0002800086,0.0012825872,0.0005515733,0.000008412706,0.000014526892,0.009643491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987077,0.00004477001,0.00026342113,0.0003916146,0.000121613964,0.00047087306],"domain_scores_gemma":[0.99908745,0.0001418409,0.00007553084,0.00060824916,0.00003767676,0.000049263006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023189698,0.00012837806,0.00018898323,0.000025186986,0.00012497795,0.00016130267,0.0006474584,0.00007881115,0.000011201802],"category_scores_gemma":[0.0000024954484,0.000107421816,0.000101101126,0.00019708672,0.00003129255,0.00031423033,0.00022016942,0.000059896156,0.00004751649],"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.0000042882334,0.000027687203,0.00025865613,0.000019813697,0.000008477502,0.0000077955865,0.000014595133,0.033042192,0.000024036952,0.8902177,0.07147013,0.0049045873],"study_design_scores_gemma":[0.0011015584,0.0006358166,0.00084331003,0.000060859333,0.000023990042,0.00008700873,0.000071990165,0.60316086,0.0012276588,0.03397401,0.35810298,0.00070997706],"about_ca_topic_score_codex":0.00009548995,"about_ca_topic_score_gemma":0.00007222175,"teacher_disagreement_score":0.9051125,"about_ca_system_score_codex":0.00007996181,"about_ca_system_score_gemma":0.000033601176,"threshold_uncertainty_score":0.43805346},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002452923,0.0005178884,0.9947415,0.00055898033,0.0007309607,0.0007002362,0.0000023803498,0.00017543066,0.00011968905],"genre_scores_gemma":[0.88528585,0.000034929948,0.11355275,0.00038090494,0.00023016274,0.00015807975,0.0000046517953,0.000015322687,0.00033733965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981768,0.00015614646,0.0003207712,0.0006209948,0.00013465749,0.0005906422],"domain_scores_gemma":[0.9989592,0.00031112568,0.00011511952,0.00043704774,0.000054107593,0.00012341558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043218804,0.00023490489,0.00030391323,0.0000388285,0.00017593938,0.00014816054,0.00066100113,0.00020335913,0.000015734508],"category_scores_gemma":[0.00001223426,0.00021081172,0.000070834,0.00014106213,0.00011117097,0.00017496521,0.00040884654,0.00017702539,0.0000120731065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021030853,0.0010337415,0.0013554594,0.000053943353,0.00013923182,0.00009821792,0.00046350702,0.48850018,0.00066107506,0.28666285,0.10626049,0.114560984],"study_design_scores_gemma":[0.0008397174,0.00023340681,0.0007696225,0.00001590692,0.000009653099,0.000031848936,0.000014422692,0.9903214,0.0004861943,0.0052413275,0.0017833966,0.00025308703],"about_ca_topic_score_codex":0.000068307054,"about_ca_topic_score_gemma":0.000055197896,"teacher_disagreement_score":0.88283294,"about_ca_system_score_codex":0.00008396089,"about_ca_system_score_gemma":0.000026389895,"threshold_uncertainty_score":0.8596653},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090886995,0.00005025701,0.9047593,0.00030043157,0.00051714753,0.00060538645,0.0000015216489,0.00033462513,0.002544351],"genre_scores_gemma":[0.6267629,0.0000018002081,0.37210032,0.00074872293,0.00011059165,0.00013252933,0.0000011167439,0.000017723707,0.00012429208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820006,0.00014693616,0.00019182239,0.00069783366,0.00022922634,0.00053415087],"domain_scores_gemma":[0.9980049,0.0005296566,0.00008810026,0.0010829648,0.000083055595,0.00021132261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003523113,0.00023632469,0.00024258794,0.000060909922,0.00021084651,0.0006076574,0.0014237163,0.00011183737,0.00008140946],"category_scores_gemma":[0.00008844365,0.00017322104,0.00007859918,0.0004294565,0.00007721099,0.0010257183,0.0002113994,0.00030267358,0.000008859271],"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.00014841228,0.00027447406,0.0015263556,0.00003402594,0.00007612842,0.00002981802,0.0016231089,0.0033013716,0.00005243259,0.7423398,0.0010222134,0.24957187],"study_design_scores_gemma":[0.004266345,0.0054270043,0.00804996,0.00029165726,0.00005941344,0.0007845694,0.00040857005,0.23283808,0.014059424,0.70543075,0.025581488,0.0028027403],"about_ca_topic_score_codex":0.000020524609,"about_ca_topic_score_gemma":0.0005551626,"teacher_disagreement_score":0.5358759,"about_ca_system_score_codex":0.000053224532,"about_ca_system_score_gemma":0.00007655314,"threshold_uncertainty_score":0.7063749},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011808211,0.00066110224,0.98609555,0.00023168024,0.0004937478,0.00042762092,0.000041744126,0.00014581553,0.00009452336],"genre_scores_gemma":[0.9974515,0.000117294476,0.002072372,0.00005870672,0.0000489543,0.0001735459,0.0000126444065,0.000015804568,0.000049222584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808973,0.00017748708,0.00048425433,0.00055442814,0.00025758985,0.00043652873],"domain_scores_gemma":[0.9987889,0.00048084577,0.00015119476,0.0003267504,0.000075435186,0.00017686296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033436142,0.00026004642,0.0003290389,0.0001499606,0.00031475993,0.0003020531,0.00024922492,0.00017525084,0.000008215272],"category_scores_gemma":[0.000007193562,0.00025769527,0.000052110117,0.000594082,0.000066400935,0.00034703474,0.0000051685274,0.00034408475,0.000005115657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011524946,0.00012865583,0.00016861208,0.000044210607,0.000015703381,0.00003383116,0.0001963766,0.9136798,0.000023471419,0.00042933965,0.00009500881,0.08517347],"study_design_scores_gemma":[0.0012423322,0.00008985666,0.00067386276,0.00021503717,0.000011626327,0.000046448655,0.00010017671,0.99726385,0.000017256985,0.000018358507,0.000048233946,0.0002729712],"about_ca_topic_score_codex":0.00014874211,"about_ca_topic_score_gemma":0.000043428085,"teacher_disagreement_score":0.98564327,"about_ca_system_score_codex":0.00008291468,"about_ca_system_score_gemma":0.000017423834,"threshold_uncertainty_score":0.99998754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019340614,0.00048692332,0.923975,0.0044699116,0.000863082,0.00037162387,0.000013387046,0.00041629112,0.0500632],"genre_scores_gemma":[0.8719592,0.00049145095,0.1257874,0.0012076638,0.00025694462,0.000029173902,0.000022781665,0.000013816408,0.0002315742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811083,0.00011913684,0.0004948396,0.0004663842,0.0004548755,0.00035394845],"domain_scores_gemma":[0.9976212,0.0001994105,0.00031566303,0.0013472143,0.00038799032,0.00012855796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048199028,0.00026396042,0.00022242141,0.00019750294,0.00053139095,0.00037746332,0.0030018697,0.00010130593,0.000041495263],"category_scores_gemma":[0.00001598377,0.0002675265,0.00007026628,0.00026927653,0.00020699052,0.0006166016,0.0005043965,0.0005296622,0.00013454002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015273685,0.00021106098,0.0005017664,0.0000045460993,0.000040109047,0.0000015093503,0.00046928797,0.009774892,0.000026940146,0.1523514,0.00072175846,0.8358815],"study_design_scores_gemma":[0.0005837607,0.00013613437,0.0013634254,0.0001714996,0.000005743625,0.000016730559,0.000051920477,0.98297477,0.00020873448,0.0003895083,0.0138051445,0.00029262557],"about_ca_topic_score_codex":0.00003395631,"about_ca_topic_score_gemma":0.000023823377,"teacher_disagreement_score":0.9731999,"about_ca_system_score_codex":0.0001703921,"about_ca_system_score_gemma":0.00021226588,"threshold_uncertainty_score":0.9999777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5257263,0.00014357624,0.4729424,0.00043448186,0.00056678837,0.00014128648,3.8512908e-7,0.000013431191,0.000031338695],"genre_scores_gemma":[0.9539071,0.000029831888,0.045537334,0.00009904762,0.000402002,0.000005771811,0.0000039784995,0.000010920058,0.000004031887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797696,0.00010492274,0.0006475472,0.00020495473,0.00083920115,0.00022643252],"domain_scores_gemma":[0.99549156,0.00043335895,0.00090878946,0.00015619198,0.0029132809,0.00009683428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001893869,0.00015410637,0.0002658501,0.00022010208,0.0000983812,0.0002075764,0.00070511026,0.00008277028,0.000010079948],"category_scores_gemma":[0.00013633983,0.00013854311,0.00011750426,0.00020328391,0.00005296941,0.00056895666,0.00012286229,0.00023090967,0.0000012094264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004636992,0.00007939426,0.0073326617,0.000021798207,0.00015187354,0.0000032207163,0.00016674548,0.5003074,0.0012248948,0.0046384116,0.00017590547,0.48585135],"study_design_scores_gemma":[0.0016405657,0.00014474642,0.003926861,0.00038652727,0.00003238953,0.00003161445,0.000039780676,0.98937017,0.0038671785,0.00038466483,0.000042816664,0.00013271504],"about_ca_topic_score_codex":0.000012287574,"about_ca_topic_score_gemma":0.000001892035,"teacher_disagreement_score":0.4890628,"about_ca_system_score_codex":0.00009604989,"about_ca_system_score_gemma":0.00021652403,"threshold_uncertainty_score":0.5649624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12746307,0.00086670247,0.87049174,0.00034021962,0.0001169236,0.00026341,5.3496484e-7,0.000053458058,0.0004039609],"genre_scores_gemma":[0.99268126,0.00013996159,0.006738678,0.0003110819,0.00004246596,0.000008245304,0.0000023606303,0.0000045065526,0.00007146175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.000075225515,0.00033278653,0.00030584334,0.00015799505,0.00025866152],"domain_scores_gemma":[0.99937963,0.00006888739,0.00011787009,0.00030047036,0.000055852728,0.000077305376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032080768,0.00012561852,0.0002737815,0.0000676621,0.000032247193,0.00006238087,0.00030585518,0.00009238641,0.00001338078],"category_scores_gemma":[0.0000069146863,0.00011158599,0.00004283589,0.00019291996,0.00005066034,0.00030697414,0.00005739004,0.00013589153,0.0000013796778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019143011,0.00027287658,0.033743035,0.000012255897,0.00002034946,0.000046508874,0.0001887223,0.026053276,0.0005620377,0.02607095,0.0006400321,0.91219854],"study_design_scores_gemma":[0.0016597442,0.00033879784,0.05123598,0.000036531863,0.000003948724,0.0000068332274,0.000008910472,0.9460851,0.00008955641,0.0002588958,0.00014679733,0.00012889608],"about_ca_topic_score_codex":0.00009480362,"about_ca_topic_score_gemma":0.00023039828,"teacher_disagreement_score":0.92003185,"about_ca_system_score_codex":0.000018402836,"about_ca_system_score_gemma":0.00002281507,"threshold_uncertainty_score":0.45503446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062439457,0.0007691581,0.9346446,0.000069245456,0.00027827546,0.0002775914,0.0000051905668,0.00009676958,0.0014197337],"genre_scores_gemma":[0.8815518,0.0008222363,0.11555875,0.0007953042,0.000100181285,0.00008022071,0.0000046698915,0.000017149081,0.0010697064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998585,0.00007671968,0.00025665868,0.00044875187,0.00018808906,0.0004447757],"domain_scores_gemma":[0.9989956,0.00026586134,0.000050778614,0.0004352963,0.000075825,0.00017665076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020834747,0.00016557664,0.0002225561,0.000060697606,0.00010506637,0.00006756679,0.0003471763,0.00012659938,0.00022092066],"category_scores_gemma":[0.000029810535,0.00015364842,0.00001816875,0.0004100027,0.00014041414,0.00035945282,0.00025911117,0.0003473045,0.000024258767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015540628,0.0019255648,0.016832385,0.00018938647,0.0001818633,0.0024654276,0.01259773,0.14628896,0.00009425261,0.19345742,0.20373131,0.42208028],"study_design_scores_gemma":[0.00052843767,0.00016529142,0.007824261,0.000009407912,0.0000024450103,0.00016375583,0.000023752273,0.9778213,0.000026747284,0.0019425866,0.011208637,0.0002834062],"about_ca_topic_score_codex":0.000018912706,"about_ca_topic_score_gemma":0.0006302694,"teacher_disagreement_score":0.8315323,"about_ca_system_score_codex":0.0000393632,"about_ca_system_score_gemma":0.000053194166,"threshold_uncertainty_score":0.6265601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22763653,0.000049611564,0.7705364,0.00027787779,0.00028489457,0.0005919853,7.3661374e-7,0.0001613408,0.00046058028],"genre_scores_gemma":[0.8262848,0.000008030698,0.17204121,0.0008721812,0.00007304697,0.0002038735,0.000003810582,0.0000119063025,0.0005011196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987285,0.000049000966,0.00028094932,0.00040432654,0.00020507012,0.00033214653],"domain_scores_gemma":[0.99883556,0.0004017643,0.000074225216,0.0005493679,0.00006522046,0.00007384868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019313788,0.00013803373,0.00018615322,0.00009000889,0.00009983059,0.000060763166,0.00050614553,0.00015309727,0.000040751667],"category_scores_gemma":[0.00003218892,0.00013043046,0.00007305334,0.00040717103,0.000040017545,0.0004478507,0.0001279235,0.00014661269,0.000041684103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013614817,0.0004939046,0.02867603,0.00009128743,0.00006145916,0.000101276215,0.007977348,0.28625897,0.0004703395,0.63786495,0.013351944,0.024516389],"study_design_scores_gemma":[0.001002482,0.0001304069,0.011749454,0.0000432367,0.0000031845652,0.000015286714,0.00003282546,0.96394277,0.00073155394,0.019506797,0.0025373392,0.00030465567],"about_ca_topic_score_codex":0.000048419,"about_ca_topic_score_gemma":0.00007538728,"teacher_disagreement_score":0.67768383,"about_ca_system_score_codex":0.00006145954,"about_ca_system_score_gemma":0.000051903495,"threshold_uncertainty_score":0.53187996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038630512,0.00035312414,0.99397945,0.0004904855,0.000880812,0.00051684864,0.0000025116026,0.0004967971,0.002893691],"genre_scores_gemma":[0.61510473,0.0000066005173,0.38132414,0.0027751566,0.00031464017,0.000046900477,0.000020643824,0.000027890264,0.00037928103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979672,0.000033330503,0.00038182118,0.0005646778,0.00027950207,0.0007734668],"domain_scores_gemma":[0.9982049,0.00060723117,0.00012820774,0.00068283523,0.00017948949,0.00019732497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090782956,0.00021493305,0.00020245106,0.00008480401,0.00025842097,0.00020424464,0.00082057406,0.00016268498,0.00007051934],"category_scores_gemma":[0.000021868911,0.00020384633,0.00013595562,0.00047865493,0.000034955396,0.00031305823,0.00014774025,0.00019742674,0.000025552288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007003029,0.00022571493,0.0006038069,0.000020420895,0.000055760658,0.00008480079,0.00027396638,0.080434814,0.000071248345,0.030811273,0.012555226,0.87479293],"study_design_scores_gemma":[0.0005880095,0.00020908461,0.00057978503,0.00003378732,0.000005681238,0.000009922852,0.000022229107,0.9915635,0.00030954348,0.0002691105,0.0061209993,0.00028834044],"about_ca_topic_score_codex":0.0000074933437,"about_ca_topic_score_gemma":0.00003489625,"teacher_disagreement_score":0.9111287,"about_ca_system_score_codex":0.00010649385,"about_ca_system_score_gemma":0.00007441605,"threshold_uncertainty_score":0.8312612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007828414,0.095261626,0.90078825,0.0008991314,0.000115493116,0.0014904337,0.0000025096958,0.00028565776,0.00037403684],"genre_scores_gemma":[0.69731534,0.029236078,0.27088803,0.0018163322,0.00016631685,0.0004959827,0.000038874736,0.000024347133,0.000018729663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732155,0.0005383047,0.0004951396,0.00076641655,0.00022641913,0.00065214816],"domain_scores_gemma":[0.99609596,0.0011478537,0.00028751092,0.0020396488,0.0001492828,0.00027971988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012961407,0.0003927382,0.00047247144,0.000077180666,0.000757967,0.0005574726,0.0015853519,0.00058033294,0.0000041928156],"category_scores_gemma":[0.0000460756,0.00039499244,0.00010964837,0.0005936115,0.00021645603,0.00059340906,0.00055668526,0.001064027,0.0000011766434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016209159,0.00038966158,0.000055763056,0.0000432392,0.00007676067,0.0000025120737,0.005487112,0.055240612,0.0000026862724,0.42195868,0.003804637,0.51277626],"study_design_scores_gemma":[0.00055657036,0.0003515802,0.00017354218,0.00011651105,0.000030168381,0.000030978714,0.00014616898,0.8331326,0.000003039435,0.15451378,0.0105342,0.00041084964],"about_ca_topic_score_codex":0.0000028058023,"about_ca_topic_score_gemma":0.00000979633,"teacher_disagreement_score":0.777892,"about_ca_system_score_codex":0.000040668052,"about_ca_system_score_gemma":0.000039876035,"threshold_uncertainty_score":0.9998502},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002563863,0.00005783361,0.9669532,0.00006139348,0.00002784103,0.029415898,6.4180466e-7,0.00017360783,0.00074573205],"genre_scores_gemma":[0.9102445,0.000013267087,0.0060960026,0.00024863836,0.00037261265,0.08295364,0.0000061300907,0.000012809763,0.00005238433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986062,0.000051579977,0.00032882643,0.0005016776,0.0001222557,0.00038947642],"domain_scores_gemma":[0.99930304,0.00005072943,0.00012654776,0.00038136722,0.000041754698,0.00009656202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026627735,0.00016347978,0.00016943326,0.00007299833,0.00025185937,0.000191059,0.00034143656,0.000076370314,0.000009435723],"category_scores_gemma":[0.0000021431451,0.0001667956,0.000032941432,0.00071575964,0.00002968775,0.0002771583,0.00009493058,0.0002516203,0.00000493419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048813367,0.00012821761,0.0010937384,0.0000070153487,0.000003713732,0.0000029669145,0.000024632614,0.7439912,0.00015065372,0.017351365,0.0003426278,0.23689899],"study_design_scores_gemma":[0.00028645367,0.000069680085,0.001360301,0.000029767862,0.000003515294,0.000038569913,0.0000068561767,0.9780269,0.00009584418,0.0019372482,0.017957672,0.00018717097],"about_ca_topic_score_codex":0.000030438168,"about_ca_topic_score_gemma":0.000018164237,"teacher_disagreement_score":0.9608572,"about_ca_system_score_codex":0.00006929538,"about_ca_system_score_gemma":0.000031244086,"threshold_uncertainty_score":0.68017274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45190638,0.00011215498,0.5325023,0.00035793902,0.00021125974,0.00018959041,3.13748e-7,0.00011544838,0.014604593],"genre_scores_gemma":[0.97529125,0.000007297974,0.023852175,0.000346565,0.00012464609,0.000010357246,0.0000029126159,0.0000053563867,0.0003594285],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990448,0.000045879195,0.00020337959,0.00028885764,0.0001809073,0.00023621706],"domain_scores_gemma":[0.99961406,0.00008322811,0.000052881103,0.00019838991,0.00001786455,0.000033548644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003244484,0.00009255956,0.000100474696,0.00004442653,0.000057861158,0.0001320258,0.00019376035,0.00004449768,0.000019723822],"category_scores_gemma":[0.0000073072556,0.00008754891,0.000013753196,0.00020650738,0.00001360762,0.00037171695,0.00012964381,0.00011100329,0.000016797823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003937442,0.00027827325,0.43851757,0.00009408742,0.000024989959,0.00020763287,0.0043956097,0.057278812,0.008270272,0.193647,0.013678973,0.2835674],"study_design_scores_gemma":[0.0009989059,0.00006748331,0.15136556,0.000062296676,0.0000032672738,0.000026491267,0.000068251175,0.8394901,0.0017086206,0.0050341627,0.00086572126,0.0003091158],"about_ca_topic_score_codex":0.0007962708,"about_ca_topic_score_gemma":0.0008741904,"teacher_disagreement_score":0.7822113,"about_ca_system_score_codex":0.0000762046,"about_ca_system_score_gemma":0.000021196951,"threshold_uncertainty_score":0.35701412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033935115,0.0016607125,0.9441852,0.00008506582,0.00035657288,0.00058703823,4.891107e-7,0.0003887475,0.018801088],"genre_scores_gemma":[0.9594413,0.000051515264,0.038920056,0.00016844187,0.00016725,0.00012423815,0.0000028454008,0.00001578856,0.0011085415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982135,0.000084336454,0.00036510217,0.0005450043,0.00020973234,0.0005823061],"domain_scores_gemma":[0.9989668,0.00021332738,0.000084333806,0.0006126472,0.000048667975,0.00007422739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033922336,0.0001815431,0.00020316854,0.00007595159,0.00007344221,0.00014945271,0.000754917,0.00011340351,0.000059918384],"category_scores_gemma":[0.000011177991,0.00016856304,0.00006169012,0.00060219626,0.00004399858,0.0004442148,0.0004122159,0.00027231418,0.000079509875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019970134,0.00042478731,0.01826696,0.0000086476375,0.000015840478,0.0001486462,0.00074921304,0.4050676,0.00011152525,0.07872019,0.004776596,0.49169],"study_design_scores_gemma":[0.00043154974,0.000073219664,0.01220325,0.000028762528,0.0000018584209,0.000008686664,0.000037968635,0.98213947,0.00009508957,0.000602642,0.0041423477,0.00023514588],"about_ca_topic_score_codex":0.000092741946,"about_ca_topic_score_gemma":0.0007204344,"teacher_disagreement_score":0.92550623,"about_ca_system_score_codex":0.00009286226,"about_ca_system_score_gemma":0.000029011353,"threshold_uncertainty_score":0.68738014},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038766386,0.000005743305,0.8567571,0.00008674165,0.00041697183,0.13434911,0.000003744624,0.00059651147,0.0077453014],"genre_scores_gemma":[0.006216617,8.8226807e-7,0.38013187,0.0007161986,0.0008380282,0.6103353,0.000023482862,0.00006166858,0.0016759394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996355,0.000085769025,0.0006778862,0.0015635942,0.00047566637,0.0008420639],"domain_scores_gemma":[0.9963723,0.00021836738,0.000324229,0.002532215,0.00021934242,0.00033357993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005653715,0.00052758714,0.00046690207,0.0001941372,0.00014932876,0.0005855924,0.0030712816,0.0005594604,0.00011573252],"category_scores_gemma":[0.0000233406,0.00049114524,0.00020783312,0.0001874858,0.000035629375,0.00038222322,0.0027176074,0.00049923366,0.000024253053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010146756,0.00074343116,0.00012075222,0.0006010903,0.00010238985,0.00009577264,0.0007628014,0.022589708,0.00035776893,0.34304145,0.014606779,0.6168766],"study_design_scores_gemma":[0.0008222479,0.00019908226,0.00022852987,0.00020490517,0.000008266989,0.000017227107,0.000011577599,0.90047437,0.0013306282,0.009186671,0.0867223,0.0007941889],"about_ca_topic_score_codex":0.00020671588,"about_ca_topic_score_gemma":0.00032934092,"teacher_disagreement_score":0.8778847,"about_ca_system_score_codex":0.00013263221,"about_ca_system_score_gemma":0.00016132259,"threshold_uncertainty_score":0.999754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18181017,0.000027988377,0.7312875,0.00019166103,0.0027324634,0.029696237,0.0000025748147,0.000747026,0.05350442],"genre_scores_gemma":[0.9773708,0.0000012006305,0.016952926,0.00023994151,0.00042180272,0.004737891,8.3039646e-7,0.000016829734,0.0002577771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801576,0.00007155798,0.000398619,0.0005380047,0.00048135887,0.000494705],"domain_scores_gemma":[0.99803966,0.0003963457,0.00014860621,0.001175772,0.00006453106,0.00017510598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005520868,0.00020177252,0.00027916319,0.0000726085,0.00010230089,0.00011217942,0.0010863781,0.00016310088,0.00030060118],"category_scores_gemma":[0.000048055415,0.00015773241,0.00011312373,0.00047103644,0.00010809866,0.00029448653,0.00027530757,0.0005225627,0.000048890153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028827164,0.0043888334,0.028148241,0.00016082171,0.00010926014,0.00011223817,0.0015926805,0.029647857,0.0472063,0.39167243,0.0358228,0.46085027],"study_design_scores_gemma":[0.0012079318,0.0007177569,0.0024598679,0.00006854016,0.000005642628,0.000019500823,0.000006505628,0.9267608,0.018027985,0.000479981,0.049866345,0.0003791437],"about_ca_topic_score_codex":0.000014156976,"about_ca_topic_score_gemma":0.000015359514,"teacher_disagreement_score":0.89711297,"about_ca_system_score_codex":0.00002317634,"about_ca_system_score_gemma":0.00007508358,"threshold_uncertainty_score":0.6432141},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6545168,0.00022118632,0.34423596,0.00011833459,0.00016483327,0.00043948082,7.6446804e-7,0.0001485098,0.00015412328],"genre_scores_gemma":[0.9069244,0.00016579621,0.09154502,0.000822037,0.00006271838,0.00014971592,0.000001448397,0.000023019853,0.00030579284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978066,0.000120732955,0.00041971845,0.0007123712,0.00027705348,0.0006635299],"domain_scores_gemma":[0.9983843,0.0005176819,0.00009111044,0.00064510625,0.00005892064,0.00030290757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029597158,0.0002573027,0.00036526652,0.00013782407,0.0001303735,0.00014356004,0.0005955354,0.00011140169,0.00001618552],"category_scores_gemma":[0.000029909535,0.00023889437,0.000041424086,0.00074658246,0.00007047078,0.00040724728,0.00042458955,0.00027591322,0.00003547294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006314137,0.0002620831,0.006542836,0.000054412954,0.000041265463,0.000752781,0.0073232898,0.114312075,0.0006345175,0.0019330296,0.0032114815,0.86486906],"study_design_scores_gemma":[0.00060190447,0.00025020586,0.0047549456,0.00007277019,0.000004051508,0.00012610354,0.00013890561,0.9915945,0.0002749873,0.00009008038,0.0016394077,0.00045214902],"about_ca_topic_score_codex":0.00006341664,"about_ca_topic_score_gemma":0.000099391,"teacher_disagreement_score":0.87728244,"about_ca_system_score_codex":0.00007337047,"about_ca_system_score_gemma":0.00005571107,"threshold_uncertainty_score":0.97418296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035455711,0.000036206147,0.99239904,0.00140927,0.0002583723,0.0010919088,0.00014750805,0.00067974516,0.00043235233],"genre_scores_gemma":[0.9167493,0.00007481368,0.0817252,0.00041280934,0.000029230698,0.00067303487,0.0001554328,0.00004682568,0.00013332948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973622,0.00023048598,0.00067574525,0.0007057798,0.00037305144,0.0006527577],"domain_scores_gemma":[0.9928216,0.0008027469,0.00021893934,0.005584312,0.00026849625,0.00030394606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079233496,0.0003602391,0.00033669054,0.0003124627,0.0010578237,0.00023520942,0.0047305175,0.0001913729,0.00002123452],"category_scores_gemma":[0.0000029383568,0.0004015342,0.00020885664,0.0011776594,0.0002645395,0.00050602044,0.000040254745,0.0006185708,0.000034441622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047734438,0.006946186,0.000093867784,0.00025049527,0.00050232233,0.00002498277,0.0013470195,0.064036414,0.0042031384,0.15200575,0.0024798946,0.7676326],"study_design_scores_gemma":[0.0013477331,0.0002868952,0.00022293151,0.0002256559,0.00006081277,0.000007044571,0.00033154804,0.97846943,0.011754524,0.00029982196,0.006383949,0.0006096768],"about_ca_topic_score_codex":0.000038662445,"about_ca_topic_score_gemma":0.00053339836,"teacher_disagreement_score":0.914433,"about_ca_system_score_codex":0.00026912653,"about_ca_system_score_gemma":0.0000886605,"threshold_uncertainty_score":0.99984366},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3088632,0.000010788778,0.6678979,0.0000071366812,0.00016052417,0.00010812493,1.7727132e-7,0.0000710026,0.022881163],"genre_scores_gemma":[0.99205756,0.0000064383685,0.0077367458,0.000081385326,0.000046343466,0.000006350732,3.8891343e-7,0.000010757518,0.000054034088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881405,0.00005348975,0.0003005202,0.00030039845,0.00014747772,0.00038405345],"domain_scores_gemma":[0.9991262,0.000091585316,0.00010707002,0.00057760364,0.000026094838,0.00007142411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029841144,0.00013755486,0.00020862218,0.00008204279,0.000026483734,0.000029055656,0.00065605884,0.00008050925,0.00005511303],"category_scores_gemma":[0.000008679304,0.00011436241,0.00008777599,0.00037402837,0.000021782287,0.00026274702,0.0003144515,0.00019615664,0.000010127771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117871976,0.0004884935,0.3075602,0.000021412865,0.000064466665,0.00007824435,0.0031448146,0.44436023,0.0003645858,0.060064133,0.0005947838,0.18314074],"study_design_scores_gemma":[0.00023345808,0.00013039327,0.12774476,0.000069909314,9.742688e-7,0.0000038677626,0.000006922354,0.87142396,0.00015490955,0.00011452744,0.0000015795414,0.000114734394],"about_ca_topic_score_codex":0.0010813558,"about_ca_topic_score_gemma":0.00024158589,"teacher_disagreement_score":0.68319434,"about_ca_system_score_codex":0.00008465135,"about_ca_system_score_gemma":0.000031516975,"threshold_uncertainty_score":0.46635637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039488175,0.0050453725,0.987857,0.0005532579,0.00029612874,0.00019340598,4.3587326e-7,0.00027317784,0.0018323992],"genre_scores_gemma":[0.9803216,0.001463729,0.014704127,0.0011445283,0.0001303441,0.00019236063,0.000017270759,0.000017475351,0.0020085848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983843,0.00007751804,0.00032802147,0.0005340474,0.0002212334,0.00045485733],"domain_scores_gemma":[0.9988876,0.000081706516,0.00007847191,0.00079183665,0.000052589075,0.000107819134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002245309,0.00017906514,0.00017694298,0.000109649394,0.00006051915,0.00011077296,0.00089350995,0.00014237368,0.00009160353],"category_scores_gemma":[0.0000029268156,0.00017391516,0.000054312102,0.00063759414,0.000028999364,0.0005974356,0.00026794706,0.00018066197,0.00007422137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027505455,0.00006010382,0.00008072025,0.0000016352765,0.0000043394607,0.0000053434396,0.00008618678,0.23752262,0.000025424637,0.0037291902,0.0022458474,0.75623584],"study_design_scores_gemma":[0.00023413308,0.000054726715,0.00055302307,0.000015635935,0.0000016734808,0.00000573405,0.000013661625,0.91942865,0.00004298862,0.00029086828,0.07916257,0.00019635577],"about_ca_topic_score_codex":0.00003070308,"about_ca_topic_score_gemma":0.0032029834,"teacher_disagreement_score":0.9763728,"about_ca_system_score_codex":0.0001921848,"about_ca_system_score_gemma":0.000057017787,"threshold_uncertainty_score":0.70920545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20372654,0.000840789,0.79344296,0.000037143847,0.00028401197,0.00067917997,0.0000010819197,0.0002662946,0.0007220172],"genre_scores_gemma":[0.8750087,0.0000066082207,0.12408884,0.00026713026,0.00020926639,0.0002949186,0.000016656537,0.000022750894,0.000085104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978548,0.00006781553,0.00042147932,0.00068512425,0.0002472442,0.000723488],"domain_scores_gemma":[0.99865866,0.00034097064,0.00011561767,0.00069812004,0.000080706406,0.00010593362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069569045,0.00022279414,0.00024323612,0.00012941204,0.00016434601,0.0002784628,0.000766495,0.00012307763,0.000021274836],"category_scores_gemma":[0.000017404938,0.0002203767,0.00008961827,0.00062739034,0.000029578057,0.00028104402,0.00013087122,0.00019965776,0.000009543238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012537634,0.00016910127,0.0009874502,0.000009797568,0.0000021692583,0.00001006073,0.000026257168,0.9516979,0.00019205929,0.003163264,0.0003327579,0.043396663],"study_design_scores_gemma":[0.0009984699,0.00019271468,0.0007128707,0.0000445597,0.0000026156285,0.000002987841,0.000009383206,0.9944224,0.0004959927,0.0001966732,0.0026416215,0.00027971988],"about_ca_topic_score_codex":0.00003170001,"about_ca_topic_score_gemma":0.00016574498,"teacher_disagreement_score":0.6712822,"about_ca_system_score_codex":0.0001171443,"about_ca_system_score_gemma":0.000071527524,"threshold_uncertainty_score":0.89867014},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009914589,0.002175826,0.99147075,0.00019055266,0.00149811,0.0020260033,0.000013392729,0.00080879667,0.0008251132],"genre_scores_gemma":[0.015026342,0.0012728496,0.97437006,0.0010226796,0.00087500474,0.0009775913,0.00013614183,0.00009332081,0.0062260344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607533,0.00013438692,0.00084390404,0.0012487794,0.0004360239,0.0012615593],"domain_scores_gemma":[0.9969393,0.0005116495,0.00039685654,0.0014059024,0.00038995274,0.00035633758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007342098,0.0005201265,0.0005761616,0.00014213416,0.0007359271,0.00030095683,0.001343077,0.00038605838,0.00015724657],"category_scores_gemma":[0.00006794666,0.0004980587,0.00026899533,0.00089027046,0.00014063255,0.0008892992,0.0005782947,0.00041521667,0.000066822344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033177326,0.00020126501,0.000072543684,0.000014014079,0.00007454122,0.000009153158,0.00063442334,0.6361333,0.00014466948,0.0008392083,0.014914721,0.34692895],"study_design_scores_gemma":[0.00096961256,0.0002948715,0.000048504706,0.000028306478,0.000020034424,0.0000899361,0.000024837085,0.90821576,0.000072551746,0.00010913332,0.08953738,0.00058906496],"about_ca_topic_score_codex":0.000048146285,"about_ca_topic_score_gemma":0.0001402213,"teacher_disagreement_score":0.34633988,"about_ca_system_score_codex":0.00021250703,"about_ca_system_score_gemma":0.00019881243,"threshold_uncertainty_score":0.9997471},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057148125,0.00004976732,0.93711317,0.00030188108,0.0005406462,0.00035553545,0.0000013170686,0.00024967967,0.004239887],"genre_scores_gemma":[0.99312824,0.0000024951619,0.0057062027,0.00032822968,0.00035515885,0.000025304385,0.000017762251,0.00001796236,0.0004186278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977886,0.00016527034,0.0005987289,0.00062355597,0.0003418232,0.00048201423],"domain_scores_gemma":[0.99807024,0.0006364616,0.0001918586,0.0007450334,0.0002747287,0.00008169902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030866975,0.00023927896,0.000270219,0.0001413334,0.00012432679,0.0002570115,0.000636475,0.00014661074,0.000096934156],"category_scores_gemma":[0.000042018488,0.00024846694,0.00007683477,0.00068851083,0.00005242848,0.0008475327,0.00024638107,0.00025115916,0.000120007964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010054866,0.000044794684,0.004270686,0.0000040579885,0.0000033261224,0.000012544236,0.00012618612,0.9436752,0.00006498606,0.03278809,0.00021049744,0.018789537],"study_design_scores_gemma":[0.00041707355,0.0000304071,0.04019796,0.00009349006,0.0000037555994,0.0000018072126,0.000006706123,0.9437524,0.000032507956,0.013269708,0.0019353115,0.0002588372],"about_ca_topic_score_codex":0.00010367116,"about_ca_topic_score_gemma":0.000413568,"teacher_disagreement_score":0.93598014,"about_ca_system_score_codex":0.00008728982,"about_ca_system_score_gemma":0.000075549055,"threshold_uncertainty_score":0.9999968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4617284,0.00005306369,0.5365007,0.000017157536,0.00004727504,0.000055056946,1.0052084e-7,0.000046447596,0.001551783],"genre_scores_gemma":[0.99583244,0.000010079411,0.003930268,0.000058115555,0.00001866978,0.00000489568,1.3658007e-7,0.000002590271,0.00014277536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999481,0.000015743015,0.000110697394,0.00016198347,0.000114680864,0.000115897274],"domain_scores_gemma":[0.9995968,0.00004041005,0.000035862682,0.0002530638,0.000030077526,0.000043836324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008383337,0.000049765018,0.000075319665,0.000034775385,0.000059772836,0.000011096859,0.00015696854,0.000027554755,0.0000109101875],"category_scores_gemma":[0.0000072879293,0.000042589007,0.000019722349,0.00020845381,0.000039924686,0.000072283314,0.00012667262,0.000045276603,0.000009461725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057891782,0.0006894162,0.027309371,0.00008271992,0.000075004704,0.00009641881,0.005385242,0.07923519,0.064340204,0.048573192,0.0064068786,0.7677485],"study_design_scores_gemma":[0.0003086986,0.00012420538,0.02853486,0.000005265735,0.0000020255065,0.00006924396,0.000012492185,0.94025993,0.027610717,0.00032163417,0.0026327535,0.00011814243],"about_ca_topic_score_codex":0.00003300102,"about_ca_topic_score_gemma":0.00001676334,"teacher_disagreement_score":0.8610248,"about_ca_system_score_codex":0.000009644789,"about_ca_system_score_gemma":0.000011776012,"threshold_uncertainty_score":0.17367293},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028046276,0.000040356957,0.9081054,0.00021068903,0.00015659747,0.0003280593,5.6509737e-7,0.00016487451,0.062947206],"genre_scores_gemma":[0.90016407,7.4897326e-7,0.09829725,0.00036749852,0.00006441768,0.000028371702,7.437427e-7,0.000005161917,0.0010717098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986337,0.00005836493,0.00025230617,0.00043541164,0.000227197,0.00039300887],"domain_scores_gemma":[0.9991327,0.00017622355,0.000039236846,0.00053243194,0.000048738864,0.00007067499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060013134,0.00010590639,0.00014506398,0.0001506282,0.000042199146,0.00009392283,0.00063468254,0.000053531272,0.000038890677],"category_scores_gemma":[0.000038353697,0.00009909681,0.000029695157,0.0017136816,0.000011888533,0.00028856928,0.0003877041,0.00012771956,0.000107946544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143034085,0.00041701036,0.026125718,0.000009412333,0.000008092251,0.00008371824,0.00039821732,0.16553673,0.00019700041,0.7288939,0.019816099,0.058499802],"study_design_scores_gemma":[0.00025235323,0.00009826229,0.022606673,0.000011585378,0.0000015165058,0.0000042982865,0.00003938342,0.9598361,0.0015499536,0.0114958985,0.0038428607,0.0002610652],"about_ca_topic_score_codex":0.0024527002,"about_ca_topic_score_gemma":0.0010677468,"teacher_disagreement_score":0.8721178,"about_ca_system_score_codex":0.00014185173,"about_ca_system_score_gemma":0.000033345175,"threshold_uncertainty_score":0.40410507},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09042235,0.00041704756,0.9023017,0.000984625,0.00037653997,0.00017559053,1.3427903e-7,0.00023964136,0.005082363],"genre_scores_gemma":[0.98627144,0.000052783565,0.012502213,0.0009137447,0.00006055185,0.000025094356,5.326476e-7,0.000008624301,0.00016502255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878526,0.0000576327,0.00020331459,0.00042450614,0.00013436245,0.00039495385],"domain_scores_gemma":[0.99911284,0.00010429688,0.00004424425,0.0006123037,0.000029315672,0.00009702068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031526719,0.00012964329,0.00016404272,0.00006397224,0.000044980177,0.000107316584,0.0007437017,0.000089848865,0.000043839453],"category_scores_gemma":[0.000019306755,0.00012027991,0.00005041971,0.0005535601,0.00003764352,0.0005072808,0.00038087115,0.00026658454,0.000086739994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023033428,0.00038850584,0.0050435322,0.000007601403,0.000017939865,0.00016432338,0.00074140716,0.16243584,0.0001548836,0.2157289,0.0016492425,0.6136448],"study_design_scores_gemma":[0.0021681979,0.0002872767,0.021823084,0.000085936255,0.0000028170145,0.00003543261,0.00004307909,0.9400283,0.00088439335,0.02700892,0.007078936,0.0005535961],"about_ca_topic_score_codex":0.00007716237,"about_ca_topic_score_gemma":0.0014556774,"teacher_disagreement_score":0.8958491,"about_ca_system_score_codex":0.00012910641,"about_ca_system_score_gemma":0.00004640007,"threshold_uncertainty_score":0.49048725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0890986,0.001004532,0.9070496,0.0001211199,0.00013745934,0.00049090415,3.8489634e-7,0.00029617504,0.0018012413],"genre_scores_gemma":[0.9287092,0.000027300312,0.06935577,0.0016034654,0.0000790256,0.000058476617,0.00000832642,0.000023922626,0.00013450033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976875,0.000107472966,0.00043502773,0.00060801103,0.00036739104,0.0007946003],"domain_scores_gemma":[0.9983972,0.00047998567,0.00012259053,0.0006971653,0.00011166254,0.00019142407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092840375,0.00024647068,0.00026643745,0.0001592878,0.00013272717,0.00021635086,0.00072975387,0.00015451064,0.000063803134],"category_scores_gemma":[0.000009795292,0.00021148275,0.00006893433,0.0011672257,0.00007058388,0.00044407186,0.0001389031,0.00035158262,0.000028723782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026115985,0.00022900749,0.009274248,0.000010641358,0.000023462379,0.00044236553,0.00036143357,0.6912639,0.00009495654,0.0044325455,0.00053830177,0.29306796],"study_design_scores_gemma":[0.0014248458,0.0003591878,0.0031145378,0.00009144643,0.000005570675,0.0000168679,0.000070873575,0.99258626,0.00032174742,0.00007636938,0.0015834575,0.0003488244],"about_ca_topic_score_codex":0.00013458513,"about_ca_topic_score_gemma":0.0013547372,"teacher_disagreement_score":0.8396106,"about_ca_system_score_codex":0.00018571387,"about_ca_system_score_gemma":0.00013526686,"threshold_uncertainty_score":0.8624016},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011669988,0.0000037449718,0.8694637,0.00026662694,0.00014163273,0.12575395,0.0000017082228,0.0004430563,0.0027586096],"genre_scores_gemma":[0.2699167,0.0000020580858,0.1654661,0.0011725026,0.00024748995,0.5601269,0.00001142245,0.00014727915,0.002909523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668694,0.00020145235,0.00046093998,0.001141526,0.0005333896,0.0009757783],"domain_scores_gemma":[0.9970382,0.00063213427,0.00031390128,0.0013729942,0.00031537176,0.00032738526],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006780925,0.00046651237,0.00045780753,0.00012523815,0.000349635,0.0012826276,0.002936962,0.00020641694,0.00017096027],"category_scores_gemma":[0.00009292496,0.00034710954,0.00012714557,0.0009735508,0.000108490894,0.0025373395,0.00087428914,0.00030216906,0.000050532795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015274497,0.0035649908,0.06438183,0.00067413243,0.00042641012,0.00017844117,0.0008946997,0.56368434,0.0004849268,0.059469745,0.12313636,0.18157664],"study_design_scores_gemma":[0.004232939,0.00028353918,0.0013319275,0.00015926495,0.0000075135267,0.000015485073,0.000006339603,0.97592187,0.0023527243,0.00040031548,0.014695087,0.00059300626],"about_ca_topic_score_codex":0.000041115953,"about_ca_topic_score_gemma":0.00011373735,"teacher_disagreement_score":0.70399755,"about_ca_system_score_codex":0.00008946012,"about_ca_system_score_gemma":0.00014794766,"threshold_uncertainty_score":0.9998981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07315615,0.0000065944205,0.9193892,0.0000920801,0.00026755192,0.00021948526,3.3671452e-7,0.00009128781,0.0067773485],"genre_scores_gemma":[0.9385173,0.0000021058177,0.061034307,0.00034508161,0.00006708339,0.000018630717,2.994001e-7,0.00001028819,0.0000049134997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974303,0.00016065955,0.00033461832,0.0006996398,0.0006846938,0.0006900356],"domain_scores_gemma":[0.99798304,0.0006523554,0.00011430001,0.000944123,0.00013392471,0.00017228139],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019105411,0.00020738455,0.0003280993,0.00018004539,0.0001433035,0.0002072778,0.0021415928,0.00006971603,0.000011334477],"category_scores_gemma":[0.00003773417,0.00015843431,0.000030674044,0.0016453391,0.002832598,0.000488932,0.0006109787,0.00033061753,0.0000059308854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012355548,0.000045561046,0.00007633919,0.000012081931,0.000001965986,0.0000025532308,0.00024577312,0.24106002,0.00006171369,0.75317353,0.000007974577,0.00530016],"study_design_scores_gemma":[0.00031933686,0.0005664291,0.00025259206,0.00023832322,0.0000017607298,0.000013931129,0.000003181221,0.89702356,0.00045900568,0.10090394,0.000025645837,0.00019227467],"about_ca_topic_score_codex":0.000015900483,"about_ca_topic_score_gemma":0.0000056030676,"teacher_disagreement_score":0.86536115,"about_ca_system_score_codex":0.000071638155,"about_ca_system_score_gemma":0.00010168064,"threshold_uncertainty_score":0.99988115},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14943287,0.000017608687,0.8476301,0.0011634984,0.00039699711,0.0010502363,0.000003019402,0.0002222865,0.000083401676],"genre_scores_gemma":[0.95374763,0.000003425254,0.042524464,0.0028875389,0.00044178715,0.00030861338,0.00001144731,0.000030438254,0.00004467449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979091,0.00009794706,0.00034575746,0.00074596226,0.00037281256,0.0005283724],"domain_scores_gemma":[0.9970394,0.0010430259,0.00022819651,0.00088904187,0.00040434138,0.0003960381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079395925,0.00026974874,0.0003547168,0.000079139565,0.0002881583,0.0006023258,0.0011887529,0.0002247072,0.000042202806],"category_scores_gemma":[0.00009669358,0.00020362347,0.00004830077,0.0003354026,0.00008880628,0.0015011351,0.00007812126,0.00039440062,0.0000011877399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004949573,0.0010760075,0.07695053,0.00030450802,0.00040179017,0.000036557027,0.0005309116,0.508426,0.16964735,0.11218709,0.0034129648,0.12207669],"study_design_scores_gemma":[0.0054717273,0.00028530878,0.005742592,0.00004917928,0.000024106783,0.000001830101,0.0000063821212,0.9825686,0.0050323596,0.00029602923,0.00021342647,0.0003084159],"about_ca_topic_score_codex":0.00006773823,"about_ca_topic_score_gemma":0.0007565059,"teacher_disagreement_score":0.8051056,"about_ca_system_score_codex":0.000020852443,"about_ca_system_score_gemma":0.0002358521,"threshold_uncertainty_score":0.83035237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010528893,0.00012165988,0.9867052,0.0002052046,0.00041104088,0.0012872289,0.0000017196114,0.00019451675,0.0005445285],"genre_scores_gemma":[0.97873515,0.000036095902,0.0178223,0.0016359605,0.00014952157,0.0007379944,0.0000073689303,0.00001912733,0.00085647823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998181,0.00010092653,0.00037739414,0.0005375276,0.0002476719,0.00055551523],"domain_scores_gemma":[0.99854743,0.00040612908,0.00009143043,0.00063426705,0.000084035106,0.00023670448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039297147,0.00020354782,0.00032232996,0.00008335393,0.0001425824,0.000056631845,0.0006708381,0.00014735507,0.00006320879],"category_scores_gemma":[0.000020798752,0.00017213236,0.00012587379,0.00033613486,0.00004150811,0.00022050858,0.00010140413,0.00017725384,0.0000129518385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006036036,0.0014101211,0.014134924,0.00008123847,0.000074659765,0.00045762584,0.00059346535,0.5440411,0.0010172911,0.03720747,0.15771048,0.24266803],"study_design_scores_gemma":[0.003101738,0.0001985651,0.0010128096,0.000032374377,0.0000037979337,0.000009075365,0.00000267649,0.99052274,0.00039148473,0.000074518524,0.004427041,0.00022317964],"about_ca_topic_score_codex":0.000052634572,"about_ca_topic_score_gemma":0.000084509345,"teacher_disagreement_score":0.9688829,"about_ca_system_score_codex":0.00008685778,"about_ca_system_score_gemma":0.0001460439,"threshold_uncertainty_score":0.7019354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066594936,0.000060089977,0.93091136,0.000049166687,0.0010407788,0.0001134889,7.160555e-7,0.00009600262,0.0011334814],"genre_scores_gemma":[0.8286116,0.000009321308,0.17027761,0.0009653965,0.00012788952,0.0000033424112,7.468578e-7,0.0000018239466,0.0000022388904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857944,0.000018359677,0.00028218786,0.00016608708,0.0005074968,0.0004463988],"domain_scores_gemma":[0.9990276,0.000057194826,0.000121066136,0.0003841239,0.00018415636,0.00022582985],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010310338,0.00010993987,0.000106968706,0.00013554996,0.00036509978,0.0005945951,0.00063345314,0.000031316322,0.0000038136136],"category_scores_gemma":[0.000044838354,0.00009478086,0.000024481518,0.00069847435,0.00014561624,0.02040386,0.00072057085,0.00009532516,0.000051835523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004379118,0.00005388192,0.034153804,0.0000500338,0.0000062073414,0.0000011589265,0.015407119,0.016860576,0.00095915515,0.052960366,0.00087101164,0.8786723],"study_design_scores_gemma":[0.0001585257,0.000013989074,0.023482302,0.000019792298,0.0000010680051,0.00003888571,0.000020879785,0.9701531,0.00028181815,0.000040279967,0.0056539685,0.00013540605],"about_ca_topic_score_codex":0.000015070106,"about_ca_topic_score_gemma":4.122798e-7,"teacher_disagreement_score":0.9532925,"about_ca_system_score_codex":0.00011107506,"about_ca_system_score_gemma":0.00012912702,"threshold_uncertainty_score":0.9932972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019994474,0.000099336874,0.9005174,0.0005480047,0.00019657688,0.000043740787,7.8500726e-8,0.0002002002,0.09639521],"genre_scores_gemma":[0.98967123,0.00001481047,0.0059696743,0.00075197074,0.000055371078,0.000008083871,2.928357e-7,0.0000046539085,0.003523901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999222,0.000028409475,0.00013649296,0.00023998586,0.00012362814,0.00024951273],"domain_scores_gemma":[0.9995069,0.000044754026,0.000024790723,0.0003643342,0.000011259364,0.00004798863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008614199,0.00007071589,0.00007741983,0.000045977657,0.00002878276,0.00006509736,0.0005090381,0.000040655785,0.00030350368],"category_scores_gemma":[0.00000243195,0.00006524306,0.000020963422,0.0002998742,0.0000083160185,0.00022893194,0.00018875719,0.00007355637,0.00012733456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.510559e-7,0.00006453836,0.002910751,0.0000026982134,0.0000036142828,0.00011810048,0.0003502066,0.0010069947,0.000024220806,0.28775653,0.01611411,0.69164777],"study_design_scores_gemma":[0.00011318241,0.000011729412,0.000501596,0.000008712997,2.8478811e-7,0.000009679314,0.000005503332,0.99358445,0.00011732807,0.0008266934,0.0047280528,0.00009278992],"about_ca_topic_score_codex":0.000098164586,"about_ca_topic_score_gemma":0.00016182954,"teacher_disagreement_score":0.99257743,"about_ca_system_score_codex":0.000026380765,"about_ca_system_score_gemma":0.000003928629,"threshold_uncertainty_score":0.33231527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36061934,0.00006880747,0.63751954,0.000069292604,0.00007267122,0.0001398087,1.8124507e-7,0.00013397673,0.0013764143],"genre_scores_gemma":[0.56782305,0.000002056293,0.43188298,0.00018390866,0.000043180367,0.0000069450484,8.5548743e-7,0.000009982973,0.000047010584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985638,0.000032681033,0.00027481507,0.0004548488,0.00021646895,0.00045736306],"domain_scores_gemma":[0.9992542,0.000046692297,0.00009351518,0.0004893282,0.000045627294,0.00007058517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000293024,0.00015820278,0.00016856071,0.0000726089,0.00014440452,0.00018016348,0.00045832287,0.00006554089,0.000007807789],"category_scores_gemma":[0.00001767578,0.00013156196,0.000022684235,0.0005281682,0.000023221697,0.0005516293,0.00020963028,0.00018986719,0.000010983194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036427164,0.00002990835,0.008689707,0.0000050772787,0.0000038589988,0.00005555215,0.00036822568,0.9677934,0.0011366473,0.019622842,0.000021122305,0.0022700354],"study_design_scores_gemma":[0.00074220914,0.00004656124,0.00080364017,0.00016287403,0.000002514622,0.000056997138,0.00006022891,0.9921913,0.005467003,0.0002120385,0.00002625074,0.000228366],"about_ca_topic_score_codex":0.0014716629,"about_ca_topic_score_gemma":0.0008248968,"teacher_disagreement_score":0.20720375,"about_ca_system_score_codex":0.00014494018,"about_ca_system_score_gemma":0.000100623394,"threshold_uncertainty_score":0.53649414},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060411305,0.00014659704,0.98995084,0.00023383742,0.0014253081,0.0009527089,0.0000016781064,0.00007275192,0.0011751453],"genre_scores_gemma":[0.9633191,0.000072417046,0.03573163,0.0005322565,0.00023989654,0.000034373632,0.0000013986811,0.000034353456,0.00003456591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554265,0.00009638536,0.000874377,0.0016738998,0.00095144636,0.0008612524],"domain_scores_gemma":[0.99496293,0.00206471,0.00047552143,0.0022063602,0.00017025678,0.0001202163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016361494,0.0006059754,0.0007469233,0.0005196556,0.00022298215,0.00020984665,0.0048721684,0.0004086124,0.00001183791],"category_scores_gemma":[0.00012663749,0.0004607886,0.0001818525,0.0009984662,0.0009678116,0.00035898574,0.0019698578,0.0017455075,0.000008639203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013962178,0.000060076498,0.00028205063,0.00003814918,0.000008286751,0.00009044293,0.0012769963,0.6658461,0.00004434039,0.011661031,0.000025411553,0.3206531],"study_design_scores_gemma":[0.00022286606,0.00016942093,0.0004926925,0.0011998689,0.0000023466807,0.000028821396,1.5626476e-7,0.97338384,0.00050061714,0.023504613,0.000041020307,0.00045371254],"about_ca_topic_score_codex":0.00004759392,"about_ca_topic_score_gemma":0.00020641762,"teacher_disagreement_score":0.95727795,"about_ca_system_score_codex":0.00045213904,"about_ca_system_score_gemma":0.0003420966,"threshold_uncertainty_score":0.9997844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013684377,0.00005185824,0.9837267,0.00011844035,0.00011971979,0.00048144328,4.8871067e-7,0.00015309796,0.0016638672],"genre_scores_gemma":[0.78374946,0.000007835388,0.21568531,0.00037595973,0.000030563526,0.000037926617,0.0000040642635,0.0000090067415,0.000099887526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804425,0.00009836061,0.00048714268,0.0005403666,0.00030962777,0.00052025786],"domain_scores_gemma":[0.9988717,0.0000725888,0.00013784342,0.000742676,0.00005665356,0.000118552074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050382316,0.0002255702,0.00033921338,0.00013153836,0.000042019627,0.00007287133,0.0010120863,0.000118928976,0.000021058418],"category_scores_gemma":[0.000006694986,0.0002073451,0.000082906714,0.0006305633,0.00004356552,0.00023569158,0.00022056978,0.00021226208,0.000003880189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035045392,0.00043056248,0.00021894198,0.000013306135,0.000006812456,0.000010829503,0.00019385194,0.9859664,0.000102184065,0.0029798155,0.00032269966,0.009719544],"study_design_scores_gemma":[0.0014427835,0.00020658734,0.0009607403,0.00004547338,0.0000031632321,0.0000038332687,0.00003598955,0.9966789,0.0003407441,0.000010821069,0.0000451236,0.00022584689],"about_ca_topic_score_codex":0.000043900436,"about_ca_topic_score_gemma":0.00008397595,"teacher_disagreement_score":0.77006507,"about_ca_system_score_codex":0.000082403596,"about_ca_system_score_gemma":0.00006630014,"threshold_uncertainty_score":0.8455288},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060394763,0.000007535202,0.9051631,0.00044345934,0.0001624365,0.0912921,4.916153e-7,0.00030973024,0.0025607536],"genre_scores_gemma":[0.058929477,4.756793e-7,0.49831653,0.012826714,0.00080841413,0.4275012,0.000008115124,0.00006317472,0.0015459018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981626,0.000034272627,0.00036364136,0.00051521073,0.00023690402,0.000687326],"domain_scores_gemma":[0.9983774,0.00047169783,0.00013786522,0.0007512236,0.00012901438,0.00013283324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010598024,0.00019222907,0.00017542246,0.000053051655,0.00016125097,0.00034767587,0.000976929,0.00011365445,0.000021589047],"category_scores_gemma":[0.000023879753,0.00016239873,0.00009650605,0.00062624726,0.000016177466,0.0007616943,0.0002577052,0.00016253826,0.000013874602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066183443,0.00062744203,0.0021203517,0.00033079163,0.0000684867,0.00006139955,0.00047345928,0.14804545,0.00029560612,0.13208418,0.023009209,0.6922218],"study_design_scores_gemma":[0.0011942331,0.000121371704,0.00053275644,0.00006361943,0.00000289467,0.0000033738243,0.0000121810535,0.95854384,0.00042864127,0.00037341972,0.038482126,0.00024152671],"about_ca_topic_score_codex":0.000012097036,"about_ca_topic_score_gemma":0.00029654487,"teacher_disagreement_score":0.8104984,"about_ca_system_score_codex":0.00006516605,"about_ca_system_score_gemma":0.000094322015,"threshold_uncertainty_score":0.6622428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22039536,0.000054996035,0.77613264,0.000083172905,0.00012107712,0.00014541272,2.4314315e-7,0.00013272413,0.002934394],"genre_scores_gemma":[0.8462963,0.000009458378,0.15335526,0.00016494596,0.00008734909,0.0000039254633,6.7937646e-7,0.000011321779,0.000070747265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825484,0.000057526035,0.0003560133,0.0004112419,0.00035320304,0.0005671558],"domain_scores_gemma":[0.9985329,0.00037910327,0.00012718377,0.0006583146,0.00010722137,0.00019528215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007619378,0.00016705894,0.00024817366,0.00005843199,0.00009003458,0.000054047225,0.0007520088,0.00011123981,0.000016305245],"category_scores_gemma":[0.000017102964,0.0001273379,0.000056305165,0.0005351513,0.00017832167,0.00023377237,0.00026829942,0.00037465422,0.0000065964878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013185246,0.00033791835,0.0128333,0.00002774881,0.000104090796,0.00012032446,0.0014898084,0.019872747,0.0006958856,0.20891728,0.00031332698,0.75515574],"study_design_scores_gemma":[0.00059833267,0.00022244184,0.014089587,0.000066018125,0.000007758856,0.00005087495,0.000044091597,0.9826336,0.0014454427,0.00018462565,0.00038165465,0.0002756078],"about_ca_topic_score_codex":0.000033072447,"about_ca_topic_score_gemma":0.00038519697,"teacher_disagreement_score":0.9627608,"about_ca_system_score_codex":0.000037579885,"about_ca_system_score_gemma":0.000035441604,"threshold_uncertainty_score":0.5192689},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6612206,0.014739929,0.3118409,0.002823526,0.0015020571,0.004307928,0.0000011621639,0.00056057976,0.0030033335],"genre_scores_gemma":[0.99069107,0.0005376318,0.005687792,0.002143551,0.0003115666,0.0003901039,0.000008801756,0.000023880975,0.0002055876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692917,0.00047101855,0.0006118672,0.0006522655,0.0005396408,0.00079604896],"domain_scores_gemma":[0.99783796,0.00045863717,0.0002854903,0.0012808746,0.000060395647,0.00007661817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015496754,0.00028674654,0.00028345836,0.000083697705,0.00039661923,0.00021935542,0.002318815,0.0001720257,0.000055251527],"category_scores_gemma":[0.000010995023,0.00017117256,0.000099036755,0.0011987312,0.00010066385,0.0006759002,0.00049934484,0.00068920787,0.000028582162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002262718,0.00013843151,0.033187002,0.000015935986,0.000012425176,0.00023401354,0.008702896,0.904822,0.000013318938,0.0014560933,0.0034448078,0.047950458],"study_design_scores_gemma":[0.00046448145,0.00008328446,0.0279681,0.00012602659,0.0000047256717,0.000032148888,0.001038248,0.95667046,0.000020450427,0.00066118425,0.0126558,0.00027510506],"about_ca_topic_score_codex":0.00027526123,"about_ca_topic_score_gemma":0.0030454167,"teacher_disagreement_score":0.3294705,"about_ca_system_score_codex":0.00008072937,"about_ca_system_score_gemma":0.00005807916,"threshold_uncertainty_score":0.6980215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024624586,0.00016459824,0.94306386,0.00021213951,0.00013143904,0.0001071965,0.000002776695,0.00021807969,0.031475358],"genre_scores_gemma":[0.9551879,0.000048064823,0.0421403,0.0011197433,0.00005280333,0.00003373095,0.0000056948033,0.00001941595,0.0013923509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824816,0.000085165484,0.00047816,0.00042481034,0.00037434656,0.00038934304],"domain_scores_gemma":[0.99868923,0.00021010812,0.0002033605,0.0007113632,0.00008883646,0.00009707679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002644304,0.00018041192,0.0002826302,0.00005555845,0.00015139868,0.000050392966,0.0010181277,0.00009212056,0.00010952114],"category_scores_gemma":[0.0000136738145,0.00016359525,0.000084016574,0.00034602586,0.00011510286,0.00033834597,0.00038321764,0.0001346542,0.000026081292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002621491,0.001108628,0.078647576,0.00013803651,0.000237014,0.00014264909,0.010106057,0.05876984,0.03711807,0.3465191,0.29590294,0.17128386],"study_design_scores_gemma":[0.0008289161,0.0002629681,0.0016737776,0.00014832105,0.000013592224,0.00012509323,0.00027199092,0.94410557,0.04121629,0.0012264599,0.009304245,0.0008227646],"about_ca_topic_score_codex":0.00045743774,"about_ca_topic_score_gemma":0.000039514623,"teacher_disagreement_score":0.93056333,"about_ca_system_score_codex":0.00003171689,"about_ca_system_score_gemma":0.00004633905,"threshold_uncertainty_score":0.66712207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013343609,0.0003157161,0.98354024,0.0017240556,0.00037590964,0.000268845,0.00002968556,0.00029478568,0.00010715354],"genre_scores_gemma":[0.99211925,0.003869214,0.0030573609,0.0003627961,0.00003384324,0.0004181663,0.000031792333,0.000031121963,0.000076424636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742997,0.00049964903,0.00068952015,0.00055832026,0.00029126753,0.0005312495],"domain_scores_gemma":[0.9963895,0.00062912295,0.00022820229,0.0023733226,0.00017259398,0.00020726961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040119424,0.000312806,0.00042715817,0.00019628314,0.0010760818,0.00018609625,0.0022589378,0.00023018237,0.00000709614],"category_scores_gemma":[0.0000090339845,0.00033942822,0.00012043998,0.0010692884,0.0003958305,0.0009604849,0.000068112844,0.0008366381,0.0000058183523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010265122,0.0035062658,0.0025846222,0.00003716601,0.00025895558,0.00006696859,0.0023802354,0.54401934,0.0014256297,0.04597787,0.00060173013,0.39903855],"study_design_scores_gemma":[0.0013460851,0.000044672834,0.0059153233,0.00010042971,0.000018296218,0.000053072075,0.00003253337,0.99101925,0.0007149255,0.000058807545,0.00035280385,0.00034379435],"about_ca_topic_score_codex":0.0008156553,"about_ca_topic_score_gemma":0.002560088,"teacher_disagreement_score":0.9804829,"about_ca_system_score_codex":0.00021885958,"about_ca_system_score_gemma":0.00013199939,"threshold_uncertainty_score":0.99990577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033269454,0.000010434934,0.9266531,0.00016659887,0.0015055962,0.037845638,0.0000014144437,0.00019420408,0.0003535561],"genre_scores_gemma":[0.8955466,0.0000044293965,0.08675177,0.00046655806,0.0041002044,0.012765072,0.0000010724622,0.00010044168,0.000263853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599063,0.00018375387,0.0010107456,0.00062856067,0.0006801189,0.0015061593],"domain_scores_gemma":[0.9969962,0.0006860048,0.0006033278,0.0006604246,0.0004902293,0.00056378415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030851422,0.00039668437,0.00041639755,0.0003041656,0.0008086574,0.00058873376,0.001046385,0.0002434517,0.00002095424],"category_scores_gemma":[0.000077247976,0.00034509253,0.00037886275,0.00071690686,0.00012401817,0.00027204378,0.00012014589,0.00095771044,0.00001722581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041140552,0.00055912056,0.0035037962,0.000060697344,0.00016005791,0.0007414006,0.00088221725,0.8812276,0.0018568323,0.0028069536,0.0034756768,0.10431423],"study_design_scores_gemma":[0.0023899553,0.0002120637,0.0015335977,0.0001685792,0.00001624424,0.0011756094,0.000059738137,0.9873969,0.0014902301,0.00009621816,0.0049981875,0.00046265547],"about_ca_topic_score_codex":0.000008812794,"about_ca_topic_score_gemma":0.000011452171,"teacher_disagreement_score":0.86227715,"about_ca_system_score_codex":0.00013299298,"about_ca_system_score_gemma":0.000085484324,"threshold_uncertainty_score":0.9999001},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37683,0.00002403707,0.6099504,0.000013520757,0.00019254234,0.00013271249,1.69851e-7,0.000093145594,0.012763422],"genre_scores_gemma":[0.961814,0.00001785834,0.037927903,0.000051174135,0.000034606004,0.000009548715,0.0000012817625,0.000008907914,0.00013471731],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862975,0.000050977644,0.00047907332,0.00030037906,0.00017961675,0.00036023278],"domain_scores_gemma":[0.99905586,0.000084500076,0.00018244598,0.000536691,0.000058508336,0.00008198484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003522358,0.00013550608,0.00029005547,0.00007141482,0.000046753306,0.000022829967,0.0007250092,0.00008287306,0.000053683016],"category_scores_gemma":[0.000011228245,0.00012537326,0.000038310423,0.00040349283,0.00006081674,0.0002836891,0.00027665717,0.000211076,0.000011396778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025540046,0.00030473823,0.5822995,0.00004980277,0.000020962827,0.000023343053,0.0017309908,0.007211906,0.00018733536,0.15880843,0.00028096515,0.2490565],"study_design_scores_gemma":[0.0001835854,0.00006710776,0.013992203,0.00006121156,0.0000027469703,0.000004067581,0.00006790156,0.98426634,0.001134425,0.000032808937,0.00004159044,0.00014603988],"about_ca_topic_score_codex":0.00006829511,"about_ca_topic_score_gemma":0.000032562508,"teacher_disagreement_score":0.9770544,"about_ca_system_score_codex":0.000025209698,"about_ca_system_score_gemma":0.00004192483,"threshold_uncertainty_score":0.51125735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026500155,0.00011967937,0.9153487,0.0001808529,0.00007403465,0.0002911525,1.9798702e-7,0.00020302572,0.08113231],"genre_scores_gemma":[0.95524305,0.0000039235356,0.042747114,0.00025342865,0.00020011612,0.00016118542,0.0000034532245,0.0000055454116,0.0013821725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989751,0.000095577816,0.00021085067,0.00033975317,0.000110630346,0.00026810786],"domain_scores_gemma":[0.9987698,0.00027528286,0.00003662543,0.00085648237,0.000026305375,0.000035506193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006255155,0.00008070002,0.000099343866,0.000025112671,0.000040564857,0.000050722952,0.00062751584,0.000051816784,0.000033642795],"category_scores_gemma":[0.000006498777,0.000069091584,0.000034993627,0.00059872627,0.000040345032,0.00017304365,0.0001707001,0.00011516314,0.00007459426],"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":[8.700513e-7,0.000048027054,0.010780242,0.0000018821461,6.2387943e-7,7.910037e-7,0.0000143126335,0.03675779,0.0000021569329,0.94116026,0.0021438396,0.009089182],"study_design_scores_gemma":[0.0001179593,0.00001055779,0.06464156,0.000005562041,0.0000011880151,0.000001413275,0.000003840127,0.09153082,0.000036810354,0.81161916,0.031895384,0.00013576206],"about_ca_topic_score_codex":0.000091035596,"about_ca_topic_score_gemma":0.00014706963,"teacher_disagreement_score":0.952593,"about_ca_system_score_codex":0.000041929507,"about_ca_system_score_gemma":0.000025618425,"threshold_uncertainty_score":0.2817473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093519346,0.011765321,0.9798309,0.00017038526,0.003332586,0.0011051671,0.0000050219815,0.00031226635,0.0033848304],"genre_scores_gemma":[0.5071835,0.010219785,0.46232784,0.011126365,0.0062305257,0.0005453771,0.00006883375,0.0004558882,0.0018419321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931296,0.0000965566,0.00096462126,0.0029244113,0.001328678,0.0015561279],"domain_scores_gemma":[0.9955858,0.00071500114,0.00051033584,0.0025443323,0.00030362568,0.00034092373],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010933542,0.0010252185,0.0010342472,0.0010555029,0.0002706644,0.00075015146,0.006936221,0.0008402631,0.00007441187],"category_scores_gemma":[0.000012801534,0.0009959581,0.00021521219,0.0018811089,0.0006829865,0.0012006864,0.003080199,0.0020918474,0.00008691448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011555553,0.00003375768,0.000053213585,0.000022185783,0.000008506981,0.00031037914,0.0005367506,0.41037723,0.0000022135202,0.0018025746,0.000030560186,0.58681107],"study_design_scores_gemma":[0.00041438054,0.00038763497,0.00016457083,0.0010339962,0.000007784829,0.000104534396,0.0000010815573,0.95080286,0.000023458657,0.029947663,0.016042471,0.0010695449],"about_ca_topic_score_codex":0.000031807333,"about_ca_topic_score_gemma":0.001532345,"teacher_disagreement_score":0.5857415,"about_ca_system_score_codex":0.00069341366,"about_ca_system_score_gemma":0.00047865714,"threshold_uncertainty_score":0.9992491},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027759748,0.005018553,0.96430266,0.00025617133,0.00049013883,0.0014312357,0.000008264789,0.00037867713,0.00035452642],"genre_scores_gemma":[0.9478446,0.0017429024,0.04910477,0.00041574248,0.00012363067,0.0006751461,0.000021582426,0.000042064825,0.000029540335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976495,0.00024248565,0.00063369755,0.0006358531,0.00018167359,0.0006568101],"domain_scores_gemma":[0.9952063,0.001120566,0.0003783822,0.0027242098,0.00033101247,0.00023950933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008184388,0.00032466734,0.00047459328,0.00012275211,0.0009608619,0.00034446304,0.004543667,0.00018287075,0.000005521342],"category_scores_gemma":[0.000021827133,0.00032711375,0.00013019759,0.00044261682,0.00028825845,0.0005848165,0.002564515,0.00041804137,0.00000405062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003906881,0.000436372,0.001410475,0.00006570736,0.00013065572,0.0000040090154,0.0043037934,0.0043160347,0.00012896895,0.036558114,0.00043374248,0.95217305],"study_design_scores_gemma":[0.0011943161,0.00015386625,0.0011662688,0.00011718311,0.000030092811,0.000015327087,0.00016014927,0.9920056,0.000082693514,0.0005318101,0.0041585583,0.0003841338],"about_ca_topic_score_codex":0.000054208413,"about_ca_topic_score_gemma":0.00007885248,"teacher_disagreement_score":0.98768955,"about_ca_system_score_codex":0.00004836414,"about_ca_system_score_gemma":0.00007817544,"threshold_uncertainty_score":0.9999181},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029069555,0.0000033649144,0.9419306,0.00005918605,0.00048178626,0.05405308,0.0000097648235,0.00039632723,0.00015893298],"genre_scores_gemma":[0.8540322,5.309002e-7,0.0557517,0.000695546,0.0002865239,0.089064986,0.000005581983,0.000072298135,0.00009062569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968849,0.00017030757,0.00053164025,0.0010630263,0.0004918156,0.00085834146],"domain_scores_gemma":[0.9976583,0.00048132867,0.00028146643,0.0010366604,0.00031798432,0.00022422218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005661954,0.0004852756,0.0004688173,0.00014867209,0.00069517386,0.00041818508,0.0009763142,0.00014559379,0.000023114892],"category_scores_gemma":[0.0000039372376,0.00041211228,0.00019236648,0.0008127022,0.00008088024,0.00045834153,0.000023482951,0.000617678,0.000015464771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014146596,0.00019723215,0.000011990903,0.00006210799,0.000050311704,0.000006708476,0.00015349897,0.94070077,0.000039930546,0.0002880038,0.00032896388,0.058019042],"study_design_scores_gemma":[0.0019769138,0.0012605467,0.000052124924,0.00023881771,0.000031215797,0.00007290716,0.000027744682,0.9887027,0.0025693122,0.00008824235,0.004481807,0.000497664],"about_ca_topic_score_codex":0.000021279971,"about_ca_topic_score_gemma":0.00002119062,"teacher_disagreement_score":0.8861789,"about_ca_system_score_codex":0.00016654094,"about_ca_system_score_gemma":0.00017685203,"threshold_uncertainty_score":0.99983305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06954244,0.00003659264,0.9253998,0.00026084948,0.00049346755,0.0002499875,5.699184e-7,0.00018064298,0.0038356753],"genre_scores_gemma":[0.8398548,0.0000013945236,0.15985322,0.00013454139,0.00013244525,0.0000069780394,3.5615125e-7,0.00000938129,0.0000068821887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970619,0.00013191608,0.00030474795,0.0008075488,0.0009442006,0.0007496968],"domain_scores_gemma":[0.9972668,0.00026967644,0.00014312826,0.0012581424,0.0005373114,0.00052492874],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020907852,0.00022722025,0.0003516259,0.00012330979,0.00017339746,0.00026497772,0.0024697252,0.00006714847,0.000011036702],"category_scores_gemma":[0.000036440746,0.00016685332,0.000053327673,0.0016419283,0.0034311174,0.00083484495,0.0011783656,0.00028160942,0.000015989326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000663374,0.00007679451,0.0006002411,0.00000387773,0.0000069978605,0.000022526561,0.00023355802,0.039968982,0.000046026867,0.95154285,0.00004886491,0.0073829666],"study_design_scores_gemma":[0.0008504696,0.0006584382,0.00084800314,0.00004066438,0.0000061608835,0.00008419977,0.000014012404,0.98623276,0.001363652,0.00961907,0.000035486257,0.0002470687],"about_ca_topic_score_codex":0.00001470887,"about_ca_topic_score_gemma":0.0000034176212,"teacher_disagreement_score":0.9462638,"about_ca_system_score_codex":0.00007575625,"about_ca_system_score_gemma":0.00027278118,"threshold_uncertainty_score":0.999281},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020798817,0.00009848028,0.83619386,0.007021879,0.0012647258,0.0005905353,0.000029479232,0.00036412323,0.13363811],"genre_scores_gemma":[0.9820475,0.00015021302,0.016364543,0.0003255634,0.00016652883,0.00017198874,0.00008742844,0.000019055347,0.0006671599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.00020959988,0.0006412972,0.00046920887,0.00040967728,0.00038756535],"domain_scores_gemma":[0.9969995,0.0003779068,0.00026659688,0.0019716776,0.00030795424,0.00007633473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041246042,0.00023889731,0.00022302392,0.00020655069,0.00020544346,0.00034498263,0.004181127,0.00012478993,0.00004729028],"category_scores_gemma":[0.000037970207,0.00025402242,0.00009351423,0.0004131808,0.000135978,0.00049596425,0.0006737741,0.000616309,0.00009382705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009804187,0.00047094363,0.002923332,0.0000016974778,0.00001598936,0.000009812437,0.00016317065,0.037855905,0.00041629383,0.9341258,0.0008890835,0.023118198],"study_design_scores_gemma":[0.00048726832,0.000026722137,0.010647644,0.00012377727,0.0000026506477,0.0000075272737,0.00003307204,0.98383474,0.00009158309,0.0034542342,0.0010270156,0.00026375824],"about_ca_topic_score_codex":0.0012487415,"about_ca_topic_score_gemma":0.003685801,"teacher_disagreement_score":0.9612487,"about_ca_system_score_codex":0.00024035135,"about_ca_system_score_gemma":0.00010994349,"threshold_uncertainty_score":0.9999912},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017865501,0.00019342163,0.99742305,0.00028787667,0.00048690214,0.00087660085,0.000008085019,0.00007115742,0.0004742579],"genre_scores_gemma":[0.025122788,0.00007344373,0.97444063,0.00013867799,0.00008491899,0.00007093536,0.000018636578,0.000014698103,0.000035277597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998584,0.0000214692,0.0006509428,0.00023533413,0.0002628896,0.00024537384],"domain_scores_gemma":[0.99842435,0.00021476383,0.00040364743,0.00074625853,0.00016886437,0.000042131393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006444406,0.00027263162,0.00032586118,0.00023260624,0.00051510625,0.0001926422,0.001947172,0.00028192333,0.0000010463062],"category_scores_gemma":[0.00001946948,0.0002389044,0.00013497878,0.00040527052,0.00018715467,0.000388963,0.00089821644,0.00058331445,5.558706e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010525032,0.000015868949,0.0000031252337,0.00020142726,0.000040604682,9.810728e-8,0.00047508726,0.9409951,0.0000032193202,0.02883813,0.0000067453384,0.029419528],"study_design_scores_gemma":[0.00016905738,0.00004043909,0.00006896189,0.00017466427,0.000026503276,0.00001588478,0.0000014000489,0.9891741,0.00009648412,0.002691624,0.007292426,0.00024841615],"about_ca_topic_score_codex":0.000053030664,"about_ca_topic_score_gemma":0.000557159,"teacher_disagreement_score":0.048179027,"about_ca_system_score_codex":0.00012408367,"about_ca_system_score_gemma":0.00011230459,"threshold_uncertainty_score":0.97422385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20592228,0.002731235,0.77883095,0.00017518265,0.0020279272,0.0015225159,0.00000771674,0.000381085,0.008401092],"genre_scores_gemma":[0.994883,0.00046811026,0.00034142713,0.00023501425,0.00014938782,0.00025044792,0.0004552186,0.000043698445,0.0031737112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974731,0.000102900296,0.00060986244,0.00093303726,0.00036888692,0.00051220064],"domain_scores_gemma":[0.99875563,0.00015354458,0.00026801135,0.00055789016,0.00014493169,0.00012000823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033945503,0.00045108155,0.0006350989,0.00021614034,0.000082731065,0.00030956196,0.0010966267,0.0006840306,0.000030694086],"category_scores_gemma":[0.0000039256197,0.00044021805,0.000089518726,0.00053302216,0.00003829436,0.0008473625,0.00004232391,0.00062076934,0.0000045595884],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067053264,0.00056265295,0.0457426,0.00064833526,0.00019849428,0.0006017413,0.0010791767,0.10962481,0.00018182902,0.05323287,0.005903732,0.7815532],"study_design_scores_gemma":[0.0023629558,0.00008378886,0.33663693,0.000430195,0.00006280545,0.000012500379,0.000045456098,0.6572362,0.00008169455,0.0009061086,0.0011125675,0.0010288015],"about_ca_topic_score_codex":0.00037399319,"about_ca_topic_score_gemma":0.026920594,"teacher_disagreement_score":0.7889607,"about_ca_system_score_codex":0.00007056062,"about_ca_system_score_gemma":0.00011249748,"threshold_uncertainty_score":0.999805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037248267,0.000018187073,0.9722322,0.0010398779,0.00021018709,0.00024432316,8.441316e-8,0.00006916684,0.02246115],"genre_scores_gemma":[0.98505723,5.8984654e-7,0.013556806,0.0010168676,0.00005051695,0.000014609454,4.651748e-7,0.0000032971827,0.0002996086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991011,0.00010748724,0.00024769004,0.00014914355,0.00025647477,0.00013813087],"domain_scores_gemma":[0.99483234,0.0045848815,0.00010694104,0.0003360547,0.00011138886,0.000028406263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024255605,0.00006409557,0.00013728737,0.000040562492,0.00007188424,0.00002851329,0.00038692373,0.00002811745,0.000072340954],"category_scores_gemma":[0.00030907753,0.000037677477,0.00007052354,0.00034894704,0.00006098809,0.000056671088,0.00003735304,0.000078482786,0.000023070124],"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.0005223578,0.000040434257,0.00006368058,0.0000017141682,0.000012173195,5.3447445e-7,0.00005468405,0.014399073,0.000069337955,0.9794789,0.0006850292,0.004672097],"study_design_scores_gemma":[0.014966194,0.000027663838,0.00055921334,0.000031092484,0.00000498733,0.0000010929322,0.000008356765,0.963558,0.010137065,0.010441855,0.00016463222,0.00009983884],"about_ca_topic_score_codex":0.00005051291,"about_ca_topic_score_gemma":0.000020528007,"teacher_disagreement_score":0.9813324,"about_ca_system_score_codex":0.000023013596,"about_ca_system_score_gemma":0.000054178206,"threshold_uncertainty_score":0.1536443},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05237849,0.000060412603,0.8849622,0.057938322,0.0013132865,0.0012333338,0.000012530582,0.0007374305,0.001363978],"genre_scores_gemma":[0.37093157,0.0000692487,0.6029154,0.0013925853,0.00042253375,0.000012431117,0.00002983394,0.000066441564,0.024159942],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973446,0.000121292,0.00023585682,0.000932707,0.00046107403,0.0009044519],"domain_scores_gemma":[0.99736565,0.0007299221,0.00016023306,0.001142589,0.00015677523,0.00044481843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028198597,0.00034147513,0.00040077453,0.0003670133,0.00029257158,0.00032763358,0.0023025323,0.00043470226,0.000095424024],"category_scores_gemma":[0.000101347905,0.00040437886,0.00018176492,0.0016703462,0.00009175755,0.0017938609,0.0014503186,0.0011520268,0.000054183118],"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.0002554751,0.00041326758,0.014278574,0.000062678955,0.00008449978,0.0003892029,0.0040607085,0.061263714,0.00001505559,0.2237886,0.6163077,0.07908056],"study_design_scores_gemma":[0.0008441702,0.00030437348,0.004979145,0.00012131055,0.000014591175,0.0000015442844,0.00031906238,0.04059393,0.0001842995,0.0029554686,0.9489249,0.00075719453],"about_ca_topic_score_codex":0.00011121052,"about_ca_topic_score_gemma":0.00008644391,"teacher_disagreement_score":0.33261725,"about_ca_system_score_codex":0.000079496545,"about_ca_system_score_gemma":0.00017002814,"threshold_uncertainty_score":0.9998408},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023859395,0.00016516386,0.96781546,0.00001444511,0.00029600444,0.02545255,0.0000038115572,0.0004841298,0.003382515],"genre_scores_gemma":[0.82856417,0.000037323836,0.07089364,0.0009859167,0.00022865148,0.09827713,0.000018491308,0.00006293909,0.00093174085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792284,0.00016234467,0.00035837328,0.0006717609,0.0002217782,0.0006628913],"domain_scores_gemma":[0.9980567,0.00040684998,0.00015337764,0.001077433,0.00014884629,0.00015677554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014131179,0.00023133126,0.0002569644,0.00009099556,0.00017995073,0.00015661758,0.0012933199,0.00014329674,0.00006591754],"category_scores_gemma":[0.00004626831,0.00019572812,0.0001395033,0.000563158,0.00004571439,0.00028691144,0.0002813628,0.00021404197,0.000035086185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002728544,0.00079681154,0.046012655,0.000037579208,0.00010448005,0.000017766151,0.00082936726,0.0062541584,0.000012531741,0.047747295,0.014475291,0.8834392],"study_design_scores_gemma":[0.0014284572,0.0026683107,0.1221641,0.0001437841,0.000008259495,0.000005318001,0.0000168792,0.8529665,0.000255826,0.002066495,0.017472293,0.00080379663],"about_ca_topic_score_codex":0.000060223105,"about_ca_topic_score_gemma":0.00031155147,"teacher_disagreement_score":0.8969218,"about_ca_system_score_codex":0.000024586087,"about_ca_system_score_gemma":0.000043231907,"threshold_uncertainty_score":0.7981561},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003375916,0.00012549467,0.9854235,0.000047499892,0.00028756735,0.0009420135,0.0000012845397,0.00013908949,0.009657642],"genre_scores_gemma":[0.26388478,0.0000035469475,0.73454285,0.00068304077,0.00020342522,0.00039532513,0.00001849754,0.000016772168,0.00025174615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984626,0.000066174114,0.00024536118,0.0005361324,0.0001254179,0.00056432444],"domain_scores_gemma":[0.99897754,0.00019615954,0.00006819225,0.00060518534,0.000050568146,0.00010236266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689152,0.00014518088,0.00018580511,0.000051011913,0.00011593202,0.0004123328,0.0009928243,0.000100463294,0.000008857927],"category_scores_gemma":[0.000013199949,0.00013458666,0.000050632723,0.0003958105,0.000011193108,0.0010901008,0.0000631625,0.00008933599,0.0000014921322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001911162,0.00018288352,0.004652011,0.00013507817,0.000012232538,0.000002032948,0.00054874166,0.29616326,0.00002044565,0.65394896,0.0037027623,0.040612496],"study_design_scores_gemma":[0.00051320734,0.00008076253,0.000390751,0.000010970058,0.0000030319075,0.0000040363857,0.000086837244,0.97345054,0.000071010516,0.011135941,0.014062064,0.0001908699],"about_ca_topic_score_codex":0.00004038346,"about_ca_topic_score_gemma":0.0001670842,"teacher_disagreement_score":0.6772873,"about_ca_system_score_codex":0.000030089714,"about_ca_system_score_gemma":0.000034468558,"threshold_uncertainty_score":0.5488285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5828767,0.018291593,0.38446546,0.00004813628,0.0050731613,0.0021570777,0.000008745859,0.0003722175,0.0067069023],"genre_scores_gemma":[0.98488665,0.0024741257,0.007410964,0.000038191734,0.00033867476,0.00035470905,0.00088612235,0.000057781865,0.0035527567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738264,0.00014101277,0.00086112117,0.0006127489,0.000445082,0.0005573904],"domain_scores_gemma":[0.9981701,0.00015440326,0.00060461555,0.00076081866,0.00018054163,0.00012952383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005889179,0.00036383994,0.0004952572,0.0002912658,0.000063712236,0.000107531625,0.0007880154,0.00047850702,0.00008601463],"category_scores_gemma":[0.00001711819,0.00037116645,0.00014758232,0.00075475685,0.000026415084,0.0008704831,0.000113238726,0.0005951431,0.000035868907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004698437,0.00013414687,0.0013939985,0.00022830813,0.0000432319,0.0000072385446,0.003352575,0.06036621,0.00050490844,0.0017978351,0.0004427752,0.9316818],"study_design_scores_gemma":[0.0012915434,0.00040332854,0.07577557,0.0015822712,0.000079173384,0.000008522852,0.0005152987,0.908154,0.0034789082,0.0021639578,0.004911065,0.0016363509],"about_ca_topic_score_codex":0.000028444627,"about_ca_topic_score_gemma":0.0011806446,"teacher_disagreement_score":0.9300454,"about_ca_system_score_codex":0.0001398428,"about_ca_system_score_gemma":0.00009283042,"threshold_uncertainty_score":0.99987406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013327299,0.000046750905,0.98197806,0.0008226113,0.00067739433,0.0010153586,0.0000019402996,0.00011563346,0.0020149737],"genre_scores_gemma":[0.67401206,0.000003428305,0.32558516,0.00018022202,0.00008557266,0.00010410026,9.539511e-7,0.000013723634,0.000014779396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697423,0.000101426296,0.00068214105,0.0008044607,0.00059514266,0.0008426154],"domain_scores_gemma":[0.9961613,0.0016881909,0.00021513773,0.0013168296,0.00033317576,0.00028540535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015839133,0.00029421735,0.00051589723,0.00019854285,0.00021967757,0.00035314425,0.0024969315,0.00011966636,0.00010130977],"category_scores_gemma":[0.00015964647,0.00022742455,0.00014757825,0.0013635176,0.0016791247,0.0007802539,0.0012623486,0.00027157302,0.00002595195],"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.0000028906431,0.00013687622,0.00003242069,0.000030353021,0.000006376162,0.0000023868392,0.00036114425,0.0038374336,0.00025816017,0.99000454,0.00009237778,0.0052350303],"study_design_scores_gemma":[0.00022300532,0.00013634308,0.00023753694,0.00008073454,0.0000051005704,0.0000051421453,0.0000063932453,0.6683436,0.0006803954,0.33005872,0.000024687826,0.00019831715],"about_ca_topic_score_codex":0.0000055181704,"about_ca_topic_score_gemma":0.0000019749593,"teacher_disagreement_score":0.6645062,"about_ca_system_score_codex":0.000051493553,"about_ca_system_score_gemma":0.00008304434,"threshold_uncertainty_score":0.92741036},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033034373,0.016120808,0.38482815,0.00013200271,0.00041971664,0.00034947414,0.0000011382544,0.0005511199,0.5975943],"genre_scores_gemma":[0.0020418828,0.041228734,0.34144697,0.001769024,0.0006344706,0.00014520348,0.00011526929,0.000613921,0.6120045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984028,0.00015773319,0.0002930843,0.0005057496,0.00025484155,0.00038583565],"domain_scores_gemma":[0.9974437,0.00013103122,0.00023852252,0.0020775574,0.000024798932,0.00008440226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018617726,0.00029211227,0.00034496776,0.00028029014,0.000054390788,0.00021821332,0.0027130796,0.00058251165,0.00053331297],"category_scores_gemma":[0.00002203044,0.00027802712,0.00006027191,0.00074397295,0.000062884355,0.000335011,0.0008656911,0.00087448145,0.00003951584],"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.0000010164968,0.000013048929,0.00011169329,0.0000069846333,0.000009466814,0.000015689444,0.00014113248,0.004076329,1.2302226e-7,0.0035148947,0.880444,0.11166563],"study_design_scores_gemma":[0.00022045914,0.000012833031,0.000374644,0.00022761298,0.0000022982397,0.000020282001,0.0000074079203,0.13475129,2.8147142e-7,0.00041963087,0.86365366,0.00030960725],"about_ca_topic_score_codex":0.00018112481,"about_ca_topic_score_gemma":0.0023642718,"teacher_disagreement_score":0.13067496,"about_ca_system_score_codex":0.00009934733,"about_ca_system_score_gemma":0.00008430992,"threshold_uncertainty_score":0.9999672},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023559676,0.0009329022,0.54117763,0.000037367357,0.0004452662,0.00029413123,7.940528e-7,0.0004371064,0.45667246],"genre_scores_gemma":[0.0066923955,0.0028167171,0.04577479,0.0009574998,0.0014094767,0.0001639199,0.0000055529867,0.00070834433,0.9414713],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777424,0.00023761984,0.0002606159,0.0008933339,0.00026355998,0.0005706543],"domain_scores_gemma":[0.9984754,0.00015283485,0.00016648749,0.001060511,0.000037177622,0.000107640975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024602975,0.00040512657,0.0004808662,0.00043480622,0.000047479556,0.00008348461,0.0012228355,0.0004134978,0.00043512],"category_scores_gemma":[0.000009506647,0.00037253788,0.00013836943,0.00074887904,0.0001143533,0.00011456092,0.00051437726,0.000541449,0.00009156546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030793144,0.00019916298,0.00017895363,0.000050520077,0.00022117254,0.0010462208,0.0017415561,0.017279506,0.0000029219234,0.39050016,0.5545765,0.0341725],"study_design_scores_gemma":[0.0014219229,0.00012809412,0.00021544893,0.0010427203,0.000021628906,0.0002872008,0.0005421052,0.9175663,0.0000061119686,0.0057875337,0.070763305,0.0022176458],"about_ca_topic_score_codex":0.0005745521,"about_ca_topic_score_gemma":0.0016575559,"teacher_disagreement_score":0.9002868,"about_ca_system_score_codex":0.00015303526,"about_ca_system_score_gemma":0.00006558218,"threshold_uncertainty_score":0.9998727},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004278225,0.0028109017,0.9887697,0.00037725494,0.00037745974,0.0008320642,0.0000010886436,0.00023281801,0.002320485],"genre_scores_gemma":[0.78351843,0.0002034239,0.21076718,0.0010557707,0.00034867635,0.0009441976,0.0000054430047,0.00003780923,0.003119048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982298,0.000051394003,0.00032836822,0.0005508287,0.00022481123,0.00061481725],"domain_scores_gemma":[0.99874437,0.00013267195,0.00007303597,0.0007266813,0.00009552205,0.00022770803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008725682,0.00019634384,0.00024588866,0.000098544515,0.000047887996,0.00013133809,0.0009160052,0.00016174371,0.000008831893],"category_scores_gemma":[0.00002386706,0.00018306139,0.00007962313,0.00039150444,0.000022026083,0.00044152845,0.00045812494,0.00023814056,0.00001624632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022843426,0.00004251725,0.00007937816,0.00000786095,0.0000064460523,0.000007505252,0.0008558031,0.8002702,0.0000062592558,0.0061523374,0.0063123247,0.18623652],"study_design_scores_gemma":[0.0008212777,0.000102991835,0.000018425491,0.00002475143,0.0000022815168,0.000004610494,0.000028613505,0.9847563,0.000026559404,0.0042403853,0.009736256,0.0002375715],"about_ca_topic_score_codex":0.0000062325753,"about_ca_topic_score_gemma":0.00022527447,"teacher_disagreement_score":0.77924025,"about_ca_system_score_codex":0.000112234535,"about_ca_system_score_gemma":0.00011044133,"threshold_uncertainty_score":0.7465027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013535466,0.0014638428,0.9940515,0.000097178236,0.0008538089,0.0012042086,0.0000014746155,0.00061821064,0.00035620833],"genre_scores_gemma":[0.06728051,0.00006550774,0.9309343,0.00028124312,0.00063796545,0.00061088905,0.000010818355,0.000033923603,0.00014486299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998105,0.00010359925,0.00036070807,0.0006410026,0.00026846337,0.00052125764],"domain_scores_gemma":[0.9982513,0.00015916099,0.00013479119,0.00075647037,0.0003704966,0.00032775683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086123,0.00023081711,0.00029080405,0.00011169563,0.0001974314,0.00027237847,0.00087767915,0.00021979643,0.000017850192],"category_scores_gemma":[0.00004097356,0.00021536302,0.000117960044,0.00049546105,0.00005370176,0.0008852094,0.00023022166,0.0002532356,0.0000054064662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005942131,0.00008578614,0.000035733086,0.0000053323006,0.00002182358,0.0000058840483,0.00008707237,0.95512795,0.002380974,0.0021804112,0.00039844032,0.03961114],"study_design_scores_gemma":[0.00071495026,0.0003289983,0.0000060834814,0.00003293105,0.00000925484,0.000050054823,0.00002915985,0.9914915,0.001497855,0.0012670577,0.0042764465,0.00029570892],"about_ca_topic_score_codex":0.000010605276,"about_ca_topic_score_gemma":0.0000068299164,"teacher_disagreement_score":0.06592696,"about_ca_system_score_codex":0.00013379507,"about_ca_system_score_gemma":0.00019675406,"threshold_uncertainty_score":0.87822485},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033321367,0.00025678118,0.9915412,0.00039012145,0.0011952191,0.00047180936,5.132776e-7,0.0003124188,0.0024998228],"genre_scores_gemma":[0.9412734,0.000012792817,0.056336466,0.00057251874,0.0013708626,0.000105139516,0.0000029121493,0.00001722536,0.0003086654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984165,0.00011652832,0.0002098856,0.00053369394,0.00017563447,0.0005478008],"domain_scores_gemma":[0.99836916,0.0006983849,0.00007570288,0.0003507365,0.00018021508,0.00032580557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008321759,0.00017799626,0.00024712193,0.00003352015,0.00017280711,0.00025377516,0.00031881427,0.00015550677,0.000008471776],"category_scores_gemma":[0.00020035508,0.00016244738,0.000048491547,0.00041778895,0.000053365555,0.0005035746,0.00022837226,0.00021888733,0.000010798947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010187634,0.00013195323,0.0042652637,0.000019098072,0.000058462716,0.000007732123,0.00014947147,0.1342159,0.000009069333,0.6542311,0.1249594,0.08185071],"study_design_scores_gemma":[0.0005652866,0.00025939403,0.0012657173,0.000009144707,0.00001476135,0.00004910412,0.000007688483,0.9665664,0.00001580989,0.018146066,0.012886642,0.00021399849],"about_ca_topic_score_codex":0.00003971551,"about_ca_topic_score_gemma":0.0001457734,"teacher_disagreement_score":0.93794125,"about_ca_system_score_codex":0.00009424292,"about_ca_system_score_gemma":0.00008964772,"threshold_uncertainty_score":0.6624412},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014621307,0.00015921303,0.9892532,0.00090162543,0.0032985203,0.000721493,0.0000028272373,0.00028641842,0.0052304612],"genre_scores_gemma":[0.58367366,0.000033416472,0.40835652,0.0047273897,0.0013972189,0.000039409784,0.0000044826515,0.00008730069,0.0016806005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429065,0.00009735159,0.00078701245,0.002508369,0.001174311,0.0011423263],"domain_scores_gemma":[0.9950335,0.0012691155,0.0003319484,0.0026170544,0.00027955737,0.00046884225],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016252873,0.00081392255,0.0009330642,0.00092929293,0.00030967616,0.0009531613,0.00599742,0.0003997191,0.00004167888],"category_scores_gemma":[0.00023715093,0.0007388372,0.00019946127,0.0008671286,0.000531098,0.00045852983,0.0031216757,0.0013140391,0.0003415535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027708176,0.0000159226,0.00003182682,0.000054916367,0.000014462943,0.000106895,0.0011738227,0.2363192,0.00016673299,0.028584387,0.00017401132,0.73333013],"study_design_scores_gemma":[0.0006375079,0.00030147226,0.000044147644,0.0013597773,0.000010426048,0.00012355711,1.3361962e-7,0.94316405,0.0012570559,0.047018524,0.004832023,0.0012513517],"about_ca_topic_score_codex":0.00002397327,"about_ca_topic_score_gemma":0.0001302066,"teacher_disagreement_score":0.7320788,"about_ca_system_score_codex":0.00039166887,"about_ca_system_score_gemma":0.0003544169,"threshold_uncertainty_score":0.9995063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054692933,0.01229095,0.98132104,0.00009864759,0.00017130097,0.0005186917,0.000003905558,0.000025552268,0.00010059904],"genre_scores_gemma":[0.7165076,0.0009578156,0.2822886,0.00009920173,0.0000442597,0.00007698287,0.0000062962176,0.000011850471,0.00000737028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766654,0.00046172002,0.0011431428,0.00017716367,0.0003533591,0.00019805662],"domain_scores_gemma":[0.99532425,0.0018248812,0.0010480277,0.0011541437,0.0005598682,0.000088808876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001793121,0.00014653317,0.0005057892,0.00034671574,0.00023272383,0.00008247289,0.0013953773,0.000114179835,3.8734757e-7],"category_scores_gemma":[0.00012211509,0.000139987,0.00011083926,0.00089226227,0.000053082123,0.00040485326,0.00032236165,0.00034383003,1.5208634e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004247672,0.0001415066,0.0019771336,0.0001814675,0.00002661266,0.0000017552751,0.0017912003,0.9732883,0.0000071535383,0.00017701238,0.000038185208,0.022327224],"study_design_scores_gemma":[0.00087638,0.00020870741,0.0014104554,0.00027659486,0.000010410383,0.00005895063,0.00045921872,0.99573636,0.0000015000082,0.000030092622,0.0008022248,0.00012909417],"about_ca_topic_score_codex":0.00002962878,"about_ca_topic_score_gemma":0.00012856697,"teacher_disagreement_score":0.7110383,"about_ca_system_score_codex":0.000111635134,"about_ca_system_score_gemma":0.00013239354,"threshold_uncertainty_score":0.57085043},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007240434,0.0106987795,0.9801598,0.00010456481,0.00033315463,0.0006313737,9.60166e-7,0.00016892751,0.00066197047],"genre_scores_gemma":[0.76387995,0.00019831661,0.23471981,0.00049332174,0.00013787155,0.0005178356,0.0000018330379,0.000012976661,0.000038089136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986537,0.00006216813,0.00025684247,0.00027315927,0.00024401641,0.00051009515],"domain_scores_gemma":[0.9989255,0.000114084185,0.00007394626,0.000568502,0.00007353253,0.00024442544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053804484,0.00013816779,0.00019383752,0.00015992734,0.00015286866,0.00010916746,0.0005254303,0.000073534815,0.00005326808],"category_scores_gemma":[0.000009176843,0.00013159309,0.00007829862,0.0008686763,0.00006770974,0.0008507551,0.00040429243,0.000112207286,0.000021749209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002216478,0.00047084436,0.01633437,0.00007229259,0.000079848236,0.000002715682,0.0010757803,0.044216797,0.0010298878,0.58441556,0.013189764,0.33908996],"study_design_scores_gemma":[0.0013136221,0.00090569543,0.018233022,0.00022616664,0.00007872496,0.00001718951,0.00037807916,0.7434359,0.0018628839,0.008527636,0.2235272,0.0014938891],"about_ca_topic_score_codex":0.000027439208,"about_ca_topic_score_gemma":0.00005013867,"teacher_disagreement_score":0.7566395,"about_ca_system_score_codex":0.000014534887,"about_ca_system_score_gemma":0.000016357348,"threshold_uncertainty_score":0.53662103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34639382,0.000013622919,0.5133801,0.0024037606,0.0024797686,0.0015181632,0.00010321255,0.00057652086,0.13313101],"genre_scores_gemma":[0.99618155,0.0000033595204,0.002014064,0.00088857836,0.0004485525,0.00014070843,0.000023562234,0.000016633847,0.00028302302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998411,0.000036927104,0.00020355036,0.00043516522,0.00057121966,0.00034214553],"domain_scores_gemma":[0.9987752,0.00015702494,0.00013673665,0.00048755153,0.00034068534,0.00010284352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030416436,0.00019983592,0.00015548897,0.000010853649,0.00015400117,0.0005280571,0.0019846985,0.00006755169,0.000046030793],"category_scores_gemma":[0.00003393494,0.00014622037,0.00023383596,0.00012963571,0.00010252916,0.0008052581,0.00025637884,0.00016725794,0.00005064132],"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.000031643125,0.00040482808,0.0016714387,0.000002888087,0.00015296084,0.0000010297641,0.0018241791,0.00009085506,0.00036599947,0.9568403,0.008421409,0.030192511],"study_design_scores_gemma":[0.00079390197,0.00039220523,0.0026038135,0.00009611404,0.000016764563,0.0000058664605,0.00025847388,0.82761616,0.0025789174,0.16253115,0.0025167568,0.00058985315],"about_ca_topic_score_codex":0.000014712286,"about_ca_topic_score_gemma":0.000012484381,"teacher_disagreement_score":0.8275253,"about_ca_system_score_codex":0.000073670984,"about_ca_system_score_gemma":0.00007769251,"threshold_uncertainty_score":0.59626937},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019437831,0.00006514225,0.57183295,0.00023569506,0.00009688307,0.42402393,0.000043667675,0.00093407964,0.0008238561],"genre_scores_gemma":[0.015463734,0.00005067197,0.32612777,0.0008226162,0.0010229901,0.65626174,0.00015715395,0.000085875414,0.000007472744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99319047,0.000364723,0.0011985746,0.0027189618,0.0007167448,0.0018105577],"domain_scores_gemma":[0.99498045,0.001012445,0.0010221298,0.0015130277,0.0005633691,0.00090856804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019667903,0.0012267848,0.0012909912,0.00019955661,0.0010282659,0.00075320277,0.000995146,0.0007300493,0.000058960162],"category_scores_gemma":[0.000031679672,0.0010498519,0.000495525,0.0021364847,0.0001706237,0.0013742474,0.00018684725,0.0009912798,0.000004337979],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.024739739,0.0030844798,0.0017402279,0.0016338666,0.0011689092,0.000016806827,0.0035395224,0.0023428828,0.000026853739,0.011471399,0.023586586,0.92664874],"study_design_scores_gemma":[0.040152382,0.016218819,0.0047654696,0.0012427543,0.0008783345,0.00009542557,0.00015408987,0.052269515,0.0005973954,0.7900243,0.088981,0.0046205334],"about_ca_topic_score_codex":0.0000359509,"about_ca_topic_score_gemma":0.00043887258,"teacher_disagreement_score":0.9220282,"about_ca_system_score_codex":0.00018635402,"about_ca_system_score_gemma":0.00060020824,"threshold_uncertainty_score":0.99919516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30334172,0.016185204,0.66883767,0.005648355,0.0033159994,0.00031964778,0.0000018848817,0.0000660981,0.002283431],"genre_scores_gemma":[0.988912,0.004538895,0.0059145843,0.00012616935,0.00042524983,0.0000237831,0.0000024678297,0.00001585157,0.000040985895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612767,0.0008317595,0.0011738918,0.0002059441,0.001329358,0.0003313544],"domain_scores_gemma":[0.9961443,0.00060459995,0.00079319335,0.00087917905,0.0014870323,0.00009172417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039503006,0.00013574258,0.00027303785,0.00032898202,0.00012751197,0.0006011543,0.0046835355,0.00009419179,0.0000037784087],"category_scores_gemma":[0.00013909269,0.00012691968,0.00009868852,0.00061613816,0.000100845464,0.0015050753,0.0007147636,0.00083853235,0.000024560122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010653933,0.0004252918,0.004041217,0.00000690433,0.000179744,0.00023787629,0.0069916993,0.5205305,0.00050385855,0.39653727,0.0005461789,0.069892906],"study_design_scores_gemma":[0.0075539607,0.0004897505,0.007206532,0.006022456,0.000016585356,0.0017384038,0.0034439866,0.8923588,0.0011839521,0.0437049,0.035470277,0.00081039453],"about_ca_topic_score_codex":0.00022304441,"about_ca_topic_score_gemma":0.00010713448,"teacher_disagreement_score":0.6855703,"about_ca_system_score_codex":0.0005881342,"about_ca_system_score_gemma":0.00019121583,"threshold_uncertainty_score":0.87032527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10149387,0.11302118,0.77334106,0.00054729974,0.0025359595,0.0033275571,0.00001922241,0.0004077805,0.0053060683],"genre_scores_gemma":[0.9290836,0.015354603,0.051273163,0.0021427071,0.0010084653,0.0003739689,0.000016408676,0.00010360027,0.0006434785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955305,0.00025226927,0.0013232428,0.0010077495,0.0008106394,0.0010755906],"domain_scores_gemma":[0.99562955,0.0007018367,0.0012434805,0.0014203659,0.00051160215,0.0004931383],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024348719,0.00052526145,0.0010423851,0.0004851966,0.0005220506,0.0033739118,0.008921066,0.00024225656,0.0012554869],"category_scores_gemma":[0.0002060859,0.0005053556,0.00041532278,0.0018421531,0.00009681658,0.0048724804,0.0017750242,0.0007068965,0.000021045182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002466416,0.0005843365,0.017095737,0.000059153837,0.00023122616,0.00007240596,0.00034551538,0.021560742,0.010506744,0.0034037505,0.13188715,0.8140066],"study_design_scores_gemma":[0.0043138997,0.0003557917,0.14673324,0.002054979,0.00017525649,0.0001355019,0.00011467522,0.56365716,0.0076838466,0.04258254,0.2288483,0.0033447822],"about_ca_topic_score_codex":0.00002538015,"about_ca_topic_score_gemma":0.000015624739,"teacher_disagreement_score":0.82758975,"about_ca_system_score_codex":0.00016710085,"about_ca_system_score_gemma":0.00019751112,"threshold_uncertainty_score":0.9997398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764405,0.000013817143,0.0033568768,0.00014927857,0.00009318466,0.01399194,0.0000042398183,0.000048821577,0.005901323],"genre_scores_gemma":[0.9984758,0.0000036529734,0.0011246784,0.00004348333,0.000014757758,0.00008077894,6.950343e-7,0.0000030625783,0.00025307713],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987694,0.00011296213,0.000117386044,0.0002561283,0.00057765655,0.00016643658],"domain_scores_gemma":[0.99879056,0.000016114775,0.00018584427,0.00056364294,0.00040070718,0.000043110813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054142525,0.00003142797,0.00013441662,0.000019141557,0.00016901027,0.000053396834,0.0010042322,0.000062256724,0.00007225324],"category_scores_gemma":[0.00001742092,0.00008607369,0.000077727804,0.00047777157,0.00011513999,0.0005065058,0.0001719089,0.00009990724,0.0000058121896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002597004,0.000078848876,0.003592558,0.00001646951,0.000006370593,0.0000020242287,0.00011678444,0.0006266907,0.00010547048,0.000009246163,0.0013827643,0.99406016],"study_design_scores_gemma":[0.00078753557,0.00009187699,0.9012114,0.00011146465,0.000013079054,0.0000117479485,0.00003294674,0.096934706,0.000009932438,0.00032913455,0.00038153995,0.00008466231],"about_ca_topic_score_codex":0.0031254978,"about_ca_topic_score_gemma":0.0116379745,"teacher_disagreement_score":0.9939755,"about_ca_system_score_codex":0.0000590562,"about_ca_system_score_gemma":0.00016882042,"threshold_uncertainty_score":0.6494263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020212743,0.0006559617,0.9963018,0.00062871614,0.00069452426,0.0013657609,0.000025765223,0.000060501457,0.000064870306],"genre_scores_gemma":[0.0963362,0.0001046642,0.9026792,0.00049219665,0.00020825291,0.00011847076,0.000025596548,0.000024329504,0.000011079392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984837,0.000019162504,0.00069410773,0.00021816025,0.00021333572,0.0003714975],"domain_scores_gemma":[0.9978374,0.00075054524,0.0005188843,0.00060692127,0.00019427022,0.000091926544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006695094,0.00033236164,0.00047271018,0.00019818262,0.0007301254,0.0002450889,0.0017641032,0.00031087207,3.2595358e-7],"category_scores_gemma":[0.00004263751,0.00027298712,0.00013954147,0.00025899816,0.00020805374,0.0004940075,0.00049340643,0.00048147736,1.40333e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046186406,0.00001884275,0.000012255329,0.00023010245,0.000030869604,5.4462877e-8,0.0006996911,0.937905,0.000009536128,0.01641824,0.000023988081,0.044646762],"study_design_scores_gemma":[0.00073663547,0.000056222772,0.000055396085,0.0004577171,0.00003278415,0.000003836048,0.0000020541322,0.99389714,0.000030347745,0.00015319776,0.004272753,0.0003018888],"about_ca_topic_score_codex":0.000035401245,"about_ca_topic_score_gemma":0.00020270709,"teacher_disagreement_score":0.096134074,"about_ca_system_score_codex":0.00007415921,"about_ca_system_score_gemma":0.00019056533,"threshold_uncertainty_score":0.9999722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03480248,0.000038539667,0.95998615,0.00065336114,0.0006328294,0.0004181965,5.824344e-7,0.00029719333,0.0031706856],"genre_scores_gemma":[0.45981044,0.0000013923126,0.5383592,0.0013749428,0.00017402643,0.000042418847,0.0000013408448,0.000017061122,0.00021915133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716145,0.00046761404,0.00040083614,0.00082760927,0.0004474314,0.0006950789],"domain_scores_gemma":[0.99759233,0.00030408968,0.000072756084,0.0012630771,0.0001319141,0.00063585734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016657364,0.00024449656,0.00035215492,0.00015628999,0.000048478,0.00022127973,0.0013811545,0.00017820903,0.000025718158],"category_scores_gemma":[0.000041290143,0.00021768622,0.000057042853,0.0010412909,0.000026481175,0.00023233378,0.00043296648,0.00032361783,0.00011670437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023314298,0.0001731069,0.00062168104,0.0000021433752,0.0000052898304,0.000043848184,0.00089943863,0.90848744,0.000060702478,0.016280174,0.0020461674,0.07135668],"study_design_scores_gemma":[0.00053932326,0.00014119771,0.0013438169,0.000018205335,0.0000028908332,0.000015110023,0.0001304609,0.9955593,0.0002728995,0.00018334367,0.0014848246,0.00030864295],"about_ca_topic_score_codex":0.00020166737,"about_ca_topic_score_gemma":0.00007790845,"teacher_disagreement_score":0.42500794,"about_ca_system_score_codex":0.00012862952,"about_ca_system_score_gemma":0.000095042116,"threshold_uncertainty_score":0.8876986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5064536,0.00008853639,0.4919013,0.000008246042,0.00029286684,0.00023442044,4.6460947e-8,0.000043661596,0.0009773623],"genre_scores_gemma":[0.99546254,0.000013825411,0.0043711215,0.0000452186,0.00004777003,0.000017503296,0.0000014802342,0.000009840856,0.00003068501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982835,0.00017050127,0.00033474556,0.00026415757,0.0007334013,0.00021367478],"domain_scores_gemma":[0.9986166,0.00016721067,0.00019824093,0.00043198466,0.00050469395,0.00008131277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013891476,0.00012313352,0.000222318,0.000076864315,0.00003134777,0.000018123297,0.00040199934,0.00010014706,0.0000033725662],"category_scores_gemma":[0.00007558115,0.00010755121,0.00004650921,0.00041084088,0.00002147127,0.0002904548,0.00012294561,0.00015615103,0.0000073613883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016013459,0.000040624196,0.00023370542,0.000017458324,0.000012634368,7.009584e-7,0.00021801886,0.9312656,0.00017354314,0.0012019796,0.00004471274,0.06677502],"study_design_scores_gemma":[0.00081412925,0.00018040245,0.00027780424,0.00018871693,0.000024464784,0.0000019653821,0.000014875512,0.9945457,0.0037575327,0.00008477451,0.0000015178554,0.00010809185],"about_ca_topic_score_codex":0.000028476856,"about_ca_topic_score_gemma":0.000002081395,"teacher_disagreement_score":0.489009,"about_ca_system_score_codex":0.000070188966,"about_ca_system_score_gemma":0.000094031784,"threshold_uncertainty_score":0.4385811},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033951588,0.0032672472,0.31336808,0.0004028863,0.0065845535,0.31813836,0.0000659592,0.00010569063,0.32411563],"genre_scores_gemma":[0.020429805,0.0003652715,0.8083506,0.0002882823,0.00065639825,0.09107593,0.0011964013,0.0002687482,0.07736852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734056,0.00007165956,0.0006201346,0.0010483359,0.0003688216,0.0005505022],"domain_scores_gemma":[0.9980933,0.00010752865,0.00036169728,0.0011814509,0.00011126399,0.00014473405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037043818,0.00038778764,0.00053726597,0.00014046424,0.00011458385,0.0006359086,0.0037569702,0.00049511995,0.00034091785],"category_scores_gemma":[0.000035185836,0.00039734642,0.00009174231,0.00063502014,0.000030723757,0.00063698215,0.0005076175,0.0007441362,0.0003603748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010704862,0.0003682631,0.000056004443,0.000021863778,0.000024034221,0.00016149785,0.002124681,0.0051918942,0.00010582409,0.000098252174,0.0017069732,0.9900337],"study_design_scores_gemma":[0.0037014778,0.00036011974,0.006365226,0.0022202865,0.000020184149,0.0000909999,0.00022943837,0.56821626,0.0006460358,0.000064034066,0.41628426,0.001801658],"about_ca_topic_score_codex":0.000036227975,"about_ca_topic_score_gemma":0.002194521,"teacher_disagreement_score":0.988232,"about_ca_system_score_codex":0.00011250258,"about_ca_system_score_gemma":0.0003681012,"threshold_uncertainty_score":0.9998478},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013047619,0.0007809231,0.9261413,0.00023762714,0.0005116933,0.000653623,0.000007939914,0.00012777623,0.07152606],"genre_scores_gemma":[0.23185717,0.020006647,0.7400031,0.003969416,0.00028301904,0.00041578125,0.00018992765,0.000060958886,0.0032140012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979881,0.000028541885,0.00084091164,0.0003994496,0.0003363937,0.00040658202],"domain_scores_gemma":[0.99555194,0.00036512036,0.0005335211,0.0029219398,0.00048666348,0.00014080692],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015015434,0.00028393185,0.00032462613,0.00055739185,0.00066881825,0.0007213042,0.005436168,0.0001453268,0.0000057644274],"category_scores_gemma":[0.000026171665,0.0002965568,0.00007761121,0.00029283288,0.0007348439,0.006413175,0.0034472952,0.0005191084,0.000026154585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018085955,0.000006595388,0.000003989924,0.000010013749,0.0000036457495,1.7614533e-7,0.00044883657,0.0005030939,1.6736169e-7,0.52623355,0.00033256007,0.47245553],"study_design_scores_gemma":[0.00022567209,0.00005665796,0.00009666267,0.0001842471,0.0000048928523,0.000016673474,0.000003327688,0.8646159,0.0000033611686,0.011869675,0.12261133,0.00031158328],"about_ca_topic_score_codex":0.000003869687,"about_ca_topic_score_gemma":0.00000631914,"teacher_disagreement_score":0.86411285,"about_ca_system_score_codex":0.00014490967,"about_ca_system_score_gemma":0.000255254,"threshold_uncertainty_score":0.9999487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000899255,0.00027307347,0.9637901,0.0050515714,0.0010938187,0.00078199944,0.000048430946,0.00071334327,0.028157722],"genre_scores_gemma":[0.7053251,0.00008512105,0.2926777,0.0013093369,0.00015569861,0.00013588624,0.0002337176,0.000020884032,0.000056546654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957152,0.00089005305,0.00080889935,0.00083136186,0.00092751905,0.00082697615],"domain_scores_gemma":[0.991642,0.00029416368,0.00052095146,0.0055724382,0.001434908,0.0005355298],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014643767,0.0004924685,0.0004503402,0.00008490068,0.00061219087,0.00078247767,0.006534431,0.0003005205,0.00003437663],"category_scores_gemma":[0.0002812054,0.00052843033,0.00014158334,0.0015828956,0.00021006097,0.000991397,0.0011116024,0.0004918375,0.00031659863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023723622,0.00022231007,0.0015718248,0.000005019225,0.000021733207,0.00000275282,0.00009796126,0.9160894,0.0000012162433,0.042153206,0.021923028,0.017887821],"study_design_scores_gemma":[0.000982656,0.00014837125,0.0005864771,0.00015862743,0.00002578792,0.000010557726,0.00006513591,0.98956436,0.0000057085963,0.001959869,0.005970276,0.00052215985],"about_ca_topic_score_codex":0.00036448563,"about_ca_topic_score_gemma":0.0007316347,"teacher_disagreement_score":0.7052352,"about_ca_system_score_codex":0.00091302645,"about_ca_system_score_gemma":0.0012167342,"threshold_uncertainty_score":0.9997167},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24941942,0.00017166806,0.7492951,0.00005589902,0.00032338337,0.00045521976,0.0000010130285,0.00003595396,0.00024233376],"genre_scores_gemma":[0.9975574,0.0000051648517,0.0021618018,0.000025678264,0.00005361151,0.00014275676,0.000017396464,0.000008360225,0.000027825137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761623,0.0008873878,0.00039820667,0.00036978308,0.0005200866,0.00020828201],"domain_scores_gemma":[0.9953011,0.0033215983,0.00018510492,0.00048038582,0.00064259773,0.000069190755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026584335,0.00014471119,0.00020620968,0.0000828512,0.000058132195,0.00011562185,0.0006150211,0.00009164464,0.000023466777],"category_scores_gemma":[0.0005644134,0.00011614214,0.000047859696,0.00047298011,0.000074634,0.00061161513,0.00022276577,0.00020152122,0.000008780182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106254396,0.000061336126,0.0043580565,0.000012642028,0.0000074825525,0.0000012149228,0.000755326,0.9225378,0.00015612795,0.0064892657,0.000009082878,0.06550539],"study_design_scores_gemma":[0.00047880106,0.00020645863,0.036814872,0.00017507927,0.0000059357603,0.0000019706174,0.000052925072,0.9585489,0.0002074202,0.0033334491,0.000052902637,0.00012126648],"about_ca_topic_score_codex":0.0000060968937,"about_ca_topic_score_gemma":0.000022220716,"teacher_disagreement_score":0.748138,"about_ca_system_score_codex":0.00011392282,"about_ca_system_score_gemma":0.00019961092,"threshold_uncertainty_score":0.47361392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019129485,0.0017860574,0.969466,0.0013076821,0.0003893531,0.0006858804,0.000006670384,0.0004462164,0.006782706],"genre_scores_gemma":[0.48622784,0.0019528287,0.50967366,0.00006209165,0.000044971588,0.0002120335,0.000086715205,0.000065294545,0.0016745932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927738,0.0034707838,0.00079441245,0.0015948183,0.0005771427,0.00078909553],"domain_scores_gemma":[0.99336123,0.0010006584,0.0006303809,0.0036678717,0.0010515748,0.00028827504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035337752,0.0006164369,0.00068835233,0.00031209044,0.0002712597,0.0007230642,0.0045246594,0.00046475197,0.000030180223],"category_scores_gemma":[0.00023825045,0.00061005796,0.00020599485,0.0009097814,0.00035107703,0.000402835,0.0036089104,0.001726755,0.000020379613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005474246,0.0020368842,0.008014736,0.00018306349,0.00028012408,0.0003277036,0.033802163,0.38312697,0.00017131557,0.019811966,0.0012809145,0.5509094],"study_design_scores_gemma":[0.0008834018,0.0000013466921,0.0031017517,0.0020357878,0.000013127197,0.000060607766,0.000048946644,0.9906239,0.0012119384,0.00012082819,0.001235731,0.0006626631],"about_ca_topic_score_codex":0.0012235309,"about_ca_topic_score_gemma":0.0040335516,"teacher_disagreement_score":0.6074969,"about_ca_system_score_codex":0.00028241868,"about_ca_system_score_gemma":0.00040852293,"threshold_uncertainty_score":0.9996351},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015794484,0.00021780303,0.94760543,0.0033681437,0.0008436028,0.019757858,0.00009825792,0.00042808882,0.011886359],"genre_scores_gemma":[0.9884265,0.000020103716,0.0070764953,0.0002284471,0.000050707666,0.004141644,0.000027485361,0.000012925115,0.000015707717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631685,0.001046913,0.0010335709,0.0005492768,0.0005209604,0.00053240615],"domain_scores_gemma":[0.9927905,0.00038696508,0.0006607851,0.0044593797,0.0013789448,0.00032341],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014474225,0.00030803852,0.0005277267,0.00007917212,0.0002358141,0.00030780138,0.0053818403,0.00017370336,0.000002367714],"category_scores_gemma":[0.0001416904,0.00027283275,0.000089001536,0.0013765541,0.00026002055,0.0004848643,0.0017599922,0.0004870964,0.000033137705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081386366,0.00040152614,0.00451906,0.00011293159,0.00006349813,0.000014224373,0.0025356761,0.014445959,0.000091884736,0.93124884,0.0050565624,0.04142842],"study_design_scores_gemma":[0.0006493197,0.00015257878,0.0015980662,0.00040480407,0.000014668792,0.000028259257,0.0012220355,0.9913387,0.000021595051,0.002565866,0.001701062,0.00030304768],"about_ca_topic_score_codex":0.0013080208,"about_ca_topic_score_gemma":0.0010902416,"teacher_disagreement_score":0.9768927,"about_ca_system_score_codex":0.00060834945,"about_ca_system_score_gemma":0.0007960034,"threshold_uncertainty_score":0.9999995},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043632364,0.005124483,0.003301521,0.00005176248,0.0044021923,0.13946444,0.0036766415,0.004448419,0.8390942],"genre_scores_gemma":[0.005249997,0.0006447325,0.029799463,0.0021195728,0.0017788474,0.22729127,0.0015737693,0.0013848878,0.73015743],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9899285,0.00051418203,0.0020330516,0.0035370504,0.0015747129,0.0024125047],"domain_scores_gemma":[0.9912744,0.001064625,0.0015748116,0.0043775607,0.0008879492,0.000820618],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0022919541,0.001940501,0.001985251,0.00045849106,0.0016832344,0.00067024934,0.005864144,0.0025898945,0.00013046469],"category_scores_gemma":[0.00018648778,0.0021165842,0.0012926148,0.00080087257,0.00025323432,0.001871487,0.0021762361,0.003714319,0.00036118747],"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.00015563026,0.0005271929,0.0000032999205,0.000702144,0.00031295817,0.00021356475,0.0000044848075,0.0052183107,0.000072111376,0.4367862,0.013243639,0.54276043],"study_design_scores_gemma":[0.0014347781,0.0007373638,0.00000640967,0.00074684934,0.0000943982,0.000062652805,0.000001450588,0.0069927378,0.0003122367,0.14916958,0.8385084,0.0019331253],"about_ca_topic_score_codex":0.000014805139,"about_ca_topic_score_gemma":0.00028270765,"teacher_disagreement_score":0.82526475,"about_ca_system_score_codex":0.0022681856,"about_ca_system_score_gemma":0.00035614855,"threshold_uncertainty_score":0.99961644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07038305,0.00019961137,0.9247165,0.0025414492,0.00005888531,0.00018106504,0.0000040803793,0.00007730464,0.0018380664],"genre_scores_gemma":[0.9533097,0.000015635092,0.04595195,0.000553191,0.00003314761,0.00005280283,0.0000065288186,0.0000072784505,0.000069775546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985748,0.0001939786,0.00020080313,0.00031579487,0.0005006132,0.00021401825],"domain_scores_gemma":[0.99713916,0.0020194033,0.000104381776,0.0005215944,0.0001716721,0.000043773452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073608634,0.00012160431,0.00012731682,0.000331007,0.00015648262,0.00009353401,0.0009741317,0.00004762895,0.000009743477],"category_scores_gemma":[0.00010357317,0.00006892147,0.000038877974,0.002076855,0.00009906076,0.0005266189,0.00017225753,0.00016172879,0.000032931643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023894949,0.00026395358,0.013765018,0.0000064983774,0.000027453862,0.000008727142,0.00023817318,0.3886486,0.000029348468,0.54070115,0.0011607048,0.055126477],"study_design_scores_gemma":[0.00054610585,0.000048413985,0.11997332,0.000037242866,0.0000029186556,0.00005244582,0.000013392875,0.81285304,0.000012861372,0.066131555,0.00018524757,0.00014348874],"about_ca_topic_score_codex":0.000014508187,"about_ca_topic_score_gemma":0.000021120428,"teacher_disagreement_score":0.88292664,"about_ca_system_score_codex":0.00009792098,"about_ca_system_score_gemma":0.00010741918,"threshold_uncertainty_score":0.2810536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6562112,0.000081283506,0.34260532,0.00019295816,0.00016588674,0.00034006778,2.393211e-7,0.00032074767,0.00008232226],"genre_scores_gemma":[0.9769142,0.000006295606,0.022637669,0.000055036846,0.0002781975,0.000065711996,0.000004792858,0.00002101506,0.000017044222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982542,0.00008399903,0.0002967291,0.00043088302,0.00043549592,0.000498707],"domain_scores_gemma":[0.9989782,0.000055980236,0.000086227636,0.0005521639,0.00010092776,0.00022650138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077917404,0.0001562803,0.00023526454,0.000100290534,0.00004630164,0.000118889104,0.00062947755,0.00016858724,0.0000017398306],"category_scores_gemma":[0.000060369115,0.00017074481,0.000025855554,0.00058087695,0.00001706015,0.00033895683,0.00026751874,0.0003829451,0.000013021806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000384132,0.005285298,0.0046065855,0.0001654406,0.00012724695,0.00013011607,0.010559328,0.9049979,0.01393658,0.016051501,0.00021406007,0.04388754],"study_design_scores_gemma":[0.00036878313,0.00010675372,0.00046426413,0.00025529196,0.000007577399,0.00000264504,0.000007919031,0.99668103,0.0018568216,0.000048547485,0.000007374951,0.0001929643],"about_ca_topic_score_codex":0.000023998564,"about_ca_topic_score_gemma":0.000029848114,"teacher_disagreement_score":0.32070306,"about_ca_system_score_codex":0.00015975919,"about_ca_system_score_gemma":0.0000564567,"threshold_uncertainty_score":0.69627714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33158165,0.000026854448,0.6672621,0.00006261822,0.00014151474,0.0008610664,0.0000015837119,0.00005004252,0.000012572201],"genre_scores_gemma":[0.9776237,0.0000037837845,0.022021748,0.000042859614,0.000038852606,0.00018024814,0.0000015509726,0.0000128170095,0.000074409654],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981284,0.00016143563,0.0005375675,0.0005738682,0.00020263826,0.00039605555],"domain_scores_gemma":[0.9984781,0.0006985392,0.00024792156,0.0003339636,0.0001473571,0.000094119954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007201725,0.00021184603,0.00045006137,0.000120555356,0.00011496017,0.000052870957,0.0004690725,0.00008264766,0.0000057614775],"category_scores_gemma":[0.000026794809,0.0001551994,0.00006591113,0.00028291912,0.000047637026,0.00034098586,0.00018922302,0.00013425245,0.0000012270408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010209607,0.01778292,0.49315298,0.00032036594,0.00096701406,0.00011679818,0.04774355,0.17738542,0.007629521,0.1442581,0.00061120593,0.10901117],"study_design_scores_gemma":[0.006802495,0.00025774952,0.025703836,0.0001563554,0.000008164693,0.0000017521413,0.00040956767,0.96616286,0.00020488248,0.00008249946,0.0000018311421,0.0002079824],"about_ca_topic_score_codex":0.00015579496,"about_ca_topic_score_gemma":0.0011184217,"teacher_disagreement_score":0.7887775,"about_ca_system_score_codex":0.000054710985,"about_ca_system_score_gemma":0.000054976088,"threshold_uncertainty_score":0.6328848},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050630312,0.000047025078,0.9466775,0.00011050626,0.0004317367,0.00046137618,1.2776349e-7,0.00022622664,0.0014151598],"genre_scores_gemma":[0.98869956,0.0000074024433,0.010398309,0.00043961464,0.00015582368,0.00014144044,0.0000023742082,0.00001738889,0.000138101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819756,0.00013346455,0.00029413312,0.00063101,0.00027622416,0.00046761445],"domain_scores_gemma":[0.99889153,0.00011779851,0.00006810971,0.00071036385,0.000047982645,0.00016422721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981776,0.00019422763,0.00023206894,0.0001692128,0.000065686116,0.00016250847,0.000751733,0.00012577008,0.0000074765826],"category_scores_gemma":[0.000034219316,0.00016998855,0.0000436675,0.0010475882,0.000027997632,0.00033846922,0.00043014716,0.00028791593,0.000045645964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003123006,0.000107201035,0.000024649868,0.000007253755,0.0000047369977,0.0000013198669,0.00038170425,0.37985316,0.00029213287,0.010700385,0.00013332181,0.60846287],"study_design_scores_gemma":[0.00033887298,0.0001311285,0.0011155332,0.00003502336,0.000002412964,0.000009743814,0.000019285953,0.9971943,0.00007175291,0.00047890158,0.00037815096,0.00022488533],"about_ca_topic_score_codex":0.00004165045,"about_ca_topic_score_gemma":0.00041524385,"teacher_disagreement_score":0.9380692,"about_ca_system_score_codex":0.00011468958,"about_ca_system_score_gemma":0.000018889901,"threshold_uncertainty_score":0.6931932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010777394,0.0005964115,0.9857028,0.00042090108,0.00031677668,0.00036685306,7.45435e-7,0.00017520739,0.0016428733],"genre_scores_gemma":[0.76015705,0.00022636462,0.23840927,0.0004235471,0.00018872716,0.000018226587,0.00005291141,0.000013819868,0.00051010726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891275,0.000039799972,0.00028110214,0.00035178656,0.000115581795,0.00029895888],"domain_scores_gemma":[0.99802023,0.0004920373,0.00015122445,0.001202134,0.00006604572,0.000068343754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001889055,0.00008678332,0.00011219773,0.000051416417,0.00033150142,0.00017430444,0.0008798243,0.000061506194,0.0000033582317],"category_scores_gemma":[0.000024274466,0.00008775093,0.000016286045,0.00033903058,0.000030968782,0.0005883914,0.0008252789,0.000107708314,0.000001983283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019843756,0.00002502157,0.0013412555,0.000012375199,0.000014510092,0.0000017392782,0.00038948562,0.00007160322,0.00012898303,0.010163163,0.011491153,0.9763409],"study_design_scores_gemma":[0.00029068723,0.000045027908,0.0012122218,0.000028393923,0.000006859748,0.000022755374,0.00005838689,0.95931584,0.00017255108,0.001076598,0.03763436,0.00013634011],"about_ca_topic_score_codex":0.000028128603,"about_ca_topic_score_gemma":0.00075049174,"teacher_disagreement_score":0.9762045,"about_ca_system_score_codex":0.000034646753,"about_ca_system_score_gemma":0.000030835978,"threshold_uncertainty_score":0.35783792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009799729,0.00007334621,0.9674404,0.0023677635,0.00047963543,0.028872652,0.00000514802,0.00007659493,0.00058641314],"genre_scores_gemma":[0.74817765,0.00014394108,0.020024875,0.0022478758,0.011260155,0.21789508,0.00003090943,0.000072219926,0.00014731992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99716353,0.00013859096,0.00094596134,0.00041136687,0.0007354279,0.0006050956],"domain_scores_gemma":[0.99632716,0.0005220999,0.0010494456,0.00051366375,0.0013710194,0.00021658829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012536148,0.00026186917,0.00034775006,0.00012012834,0.00020291195,0.0003165338,0.0028640681,0.00015557883,0.000034759592],"category_scores_gemma":[0.00003911088,0.00024208192,0.0003000365,0.0004296758,0.000049190425,0.0005305923,0.0002919596,0.0005786443,0.0000128624215],"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.000089642366,0.00028765938,0.00008659605,0.000017637396,0.00021639508,0.0000029081375,0.00013965114,0.021638157,0.000026130296,0.8993645,0.025634294,0.052496437],"study_design_scores_gemma":[0.0011425246,0.00020751427,0.00005186145,0.00008743014,0.000018824672,0.000089584086,0.0000053744757,0.44891387,0.000058051282,0.05750859,0.4917143,0.00020209163],"about_ca_topic_score_codex":0.0000023476553,"about_ca_topic_score_gemma":0.000025272833,"teacher_disagreement_score":0.9474156,"about_ca_system_score_codex":0.00025542083,"about_ca_system_score_gemma":0.00023441282,"threshold_uncertainty_score":0.9871815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91679245,0.0053736656,0.072957985,0.0042508757,0.000075008196,0.0002194826,0.0000038792696,0.00000874893,0.00031789741],"genre_scores_gemma":[0.99506235,0.0036190874,0.0011990205,0.00008186825,0.000024995514,0.000004777065,3.3797696e-7,0.0000032791684,0.0000042851675],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987455,0.00046653187,0.0004049884,0.00008373737,0.00016877719,0.00013044661],"domain_scores_gemma":[0.9955999,0.002822215,0.0005641843,0.00079718005,0.00015994979,0.00005655854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022110702,0.000077802746,0.00019450512,0.00012392351,0.00008343047,0.000044304637,0.00077698653,0.000078410056,0.000006998046],"category_scores_gemma":[0.00014602927,0.000041111172,0.00007423026,0.00047347028,0.0000750941,0.00020147194,0.00017636125,0.0003127395,2.4052304e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018806946,0.0013566687,0.5947182,0.00001439772,0.00027102994,0.0000053229082,0.00097297836,0.018028362,0.000075626034,0.027320223,0.0043331287,0.352716],"study_design_scores_gemma":[0.001017111,0.0006000033,0.40742972,0.00016146635,0.000023488747,0.00001574252,0.000017019014,0.58412635,0.000015434052,0.005624948,0.00085541693,0.000113286864],"about_ca_topic_score_codex":0.000029359311,"about_ca_topic_score_gemma":0.000053798234,"teacher_disagreement_score":0.56609803,"about_ca_system_score_codex":0.00013710876,"about_ca_system_score_gemma":0.000059576527,"threshold_uncertainty_score":0.1676465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4664092,0.0016026855,0.52856636,0.00071479194,0.0024626188,0.00015470751,0.0000015169621,0.00002234003,0.000065774206],"genre_scores_gemma":[0.90227586,0.0017551332,0.09506295,0.00011236041,0.00070365064,0.000013805875,0.000005019228,0.00001295133,0.000058284197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832976,0.00005559295,0.00072618766,0.00024525952,0.00046632177,0.00017688176],"domain_scores_gemma":[0.99839765,0.00004161251,0.0003408353,0.00032671454,0.0008067919,0.00008641932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004720438,0.00014632446,0.0002163963,0.00032941496,0.000109689274,0.0002534897,0.0009888351,0.00016491463,0.000025906966],"category_scores_gemma":[0.000014851146,0.00013892438,0.00007633807,0.00034279926,0.00010193638,0.00086898095,0.00029521,0.00045714455,0.0000013274791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029545365,0.0001670564,0.0002130601,0.000006831019,0.00027917404,0.00012045505,0.00018528603,0.55544484,0.0571873,0.06816177,0.00049272814,0.31771195],"study_design_scores_gemma":[0.00056378334,0.00013669174,0.00017247249,0.00009232289,0.000027243217,0.00042106363,0.000043485426,0.9919014,0.0024828895,0.0004903424,0.0035243605,0.00014397166],"about_ca_topic_score_codex":0.000003866565,"about_ca_topic_score_gemma":0.000055661814,"teacher_disagreement_score":0.43645653,"about_ca_system_score_codex":0.000056338944,"about_ca_system_score_gemma":0.0000732227,"threshold_uncertainty_score":0.5665172},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06943442,0.000048434045,0.8710405,0.0062108734,0.000009328602,0.052047268,0.0000027740132,0.000100922196,0.0011054715],"genre_scores_gemma":[0.90927815,0.000008518146,0.049942438,0.00079494,0.00008526207,0.039746813,0.0000011279409,0.0000072273583,0.00013550078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987464,0.00014327117,0.00022673151,0.00035619078,0.00028263286,0.00024476752],"domain_scores_gemma":[0.99842423,0.00022021665,0.000104805324,0.0010742809,0.00013718326,0.000039276027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076299027,0.0000968543,0.0001224514,0.00011137583,0.00050111883,0.00013601572,0.0015425663,0.000042837415,0.0000037502666],"category_scores_gemma":[0.0000011141127,0.000057197878,0.00007421342,0.0022828267,0.000104781095,0.000094902636,0.00041261368,0.0002976478,0.000013600972],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084614285,0.00024670002,0.0034795501,0.000022962193,0.000093768824,3.3728435e-7,0.0009889203,0.0029019525,0.003426114,0.06967937,0.0019957547,0.9171561],"study_design_scores_gemma":[0.00048405555,0.00030578833,0.16234556,0.00009159344,0.00005168907,0.000011064862,0.00003344655,0.55204374,0.02226982,0.003051129,0.25897825,0.0003338814],"about_ca_topic_score_codex":0.0000033680942,"about_ca_topic_score_gemma":0.000003960506,"teacher_disagreement_score":0.91682225,"about_ca_system_score_codex":0.000028096189,"about_ca_system_score_gemma":0.00003756865,"threshold_uncertainty_score":0.38542515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03679236,0.000077359335,0.9593801,0.00025592564,0.0018107194,0.0007135245,0.0000043074206,0.00051128684,0.00045441618],"genre_scores_gemma":[0.74660146,0.00001112173,0.2518302,0.0003966353,0.0007074681,0.00015401232,0.000031931682,0.000043677675,0.00022354182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782896,0.000054961387,0.00039870155,0.0007478299,0.00023943216,0.00073009526],"domain_scores_gemma":[0.9980984,0.000187041,0.00023203074,0.001018364,0.00023146911,0.0002327013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006779124,0.00028836986,0.0003044501,0.000077894,0.00037914191,0.00041837184,0.0012674852,0.00030375103,0.000027920683],"category_scores_gemma":[0.00014976732,0.00030017554,0.00015209784,0.00054838794,0.00008543957,0.0007711139,0.00037582236,0.0006359604,0.000016514095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007195808,0.00081664306,0.004988464,0.00015316815,0.00016458765,0.00005326781,0.003396038,0.6541083,0.0034892797,0.19525996,0.017243648,0.12025469],"study_design_scores_gemma":[0.00081143685,0.000040560062,0.00020896846,0.000030200616,0.000009063409,0.000014367408,0.00002239173,0.9951202,0.00082432816,0.00018585606,0.002374199,0.00035842456],"about_ca_topic_score_codex":0.000026447542,"about_ca_topic_score_gemma":0.00011394856,"teacher_disagreement_score":0.70980906,"about_ca_system_score_codex":0.000048953003,"about_ca_system_score_gemma":0.00008162245,"threshold_uncertainty_score":0.99994504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011734837,0.0012590763,0.98437613,0.00009774236,0.00009268283,0.0016426137,0.000009083497,0.00048759562,0.00030025496],"genre_scores_gemma":[0.6145034,0.00020356325,0.38286814,0.0007208952,0.00035046658,0.0011355688,0.00012985514,0.000045834175,0.000042273154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706835,0.000063614236,0.0007301521,0.0009461682,0.00023030401,0.0009613891],"domain_scores_gemma":[0.99820167,0.0002746286,0.00023632674,0.00096730836,0.0000971993,0.00022288586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079242047,0.00032912477,0.00032362304,0.0002213708,0.00031272802,0.00027763797,0.0016369229,0.0002091601,0.0000063850853],"category_scores_gemma":[0.0000011850888,0.00036821832,0.00013312585,0.0017332463,0.00004827944,0.00035075122,0.0008208324,0.00050118257,0.0000919537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064484498,0.00026712226,0.0005607688,0.000016727308,0.000030286184,0.000034593737,0.0005946776,0.034320034,0.0021141737,0.02371708,0.0012421809,0.9370959],"study_design_scores_gemma":[0.0010601425,0.00006541649,0.002347803,0.00010821449,0.000013489125,0.00006227445,0.00007823939,0.594168,0.0015482773,0.0017562177,0.39790216,0.00088977744],"about_ca_topic_score_codex":0.000003875534,"about_ca_topic_score_gemma":0.00006444976,"teacher_disagreement_score":0.9362061,"about_ca_system_score_codex":0.00029674836,"about_ca_system_score_gemma":0.00005016422,"threshold_uncertainty_score":0.999877},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042594504,0.00003076914,0.9345341,0.0004059929,0.000022778406,0.062379345,0.0000022312454,0.00089115463,0.0016910706],"genre_scores_gemma":[0.022624405,0.000003741823,0.7641776,0.0029671995,0.00079921476,0.20927763,0.000038178332,0.000033171727,0.00007883776],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757403,0.000047828693,0.0004965501,0.0010375767,0.0001871302,0.0006568545],"domain_scores_gemma":[0.99758786,0.000045002063,0.00020473116,0.0017629928,0.0001117412,0.00028768828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023023943,0.00034530973,0.0002855531,0.00011374935,0.00034798452,0.00050908595,0.0025381984,0.00018213554,0.0000141238515],"category_scores_gemma":[1.5655269e-7,0.0003481911,0.00010634353,0.0008325994,0.000051940355,0.00046139234,0.00025424248,0.00034428536,0.00010566857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010774257,0.00033695763,0.000010950086,0.00000779989,0.000011088436,0.0000013884703,0.00009633221,0.0030309283,0.005923138,0.05365562,0.0038791613,0.93303585],"study_design_scores_gemma":[0.0008912325,0.00021009208,0.000837946,0.000008955815,0.000007999945,0.000023618108,0.000003722561,0.46690786,0.0012694797,0.00837604,0.52094567,0.00051739323],"about_ca_topic_score_codex":0.0000027562162,"about_ca_topic_score_gemma":0.0000043116843,"teacher_disagreement_score":0.9325185,"about_ca_system_score_codex":0.00007964094,"about_ca_system_score_gemma":0.000070509304,"threshold_uncertainty_score":0.999897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004492231,0.0027347174,0.9927075,0.0013239542,0.000042917443,0.00060619914,0.000001331195,0.0005998447,0.0015343303],"genre_scores_gemma":[0.07272552,0.00022516113,0.9227404,0.0021032428,0.001033566,0.0007357275,0.000014102116,0.000028339522,0.00039392867],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843657,0.00003175207,0.0003159206,0.0006155733,0.0001465179,0.00045364548],"domain_scores_gemma":[0.9986593,0.00007349995,0.00009928079,0.00093900575,0.00007185107,0.00015705585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014743948,0.00019876915,0.00016550442,0.000084089996,0.0002452526,0.00025081995,0.0015747441,0.00009726036,0.00002429719],"category_scores_gemma":[1.6852657e-7,0.00021268408,0.00009468368,0.0005643264,0.000039360966,0.0004075107,0.0005803161,0.0002531304,0.0005274709],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.596945e-7,0.00009480413,0.000023392851,0.0000039042143,0.000013389678,0.0000011731347,0.00016792923,0.014487968,0.00018381147,0.020059312,0.009389464,0.9555742],"study_design_scores_gemma":[0.00015952862,0.000010292207,0.00023529264,0.0000075017574,0.0000037617021,0.000027868164,0.0000017925847,0.2419439,0.0002930643,0.00057852356,0.7565458,0.00019272062],"about_ca_topic_score_codex":0.0000011202364,"about_ca_topic_score_gemma":0.000011199738,"teacher_disagreement_score":0.95538145,"about_ca_system_score_codex":0.00008138807,"about_ca_system_score_gemma":0.0000323011,"threshold_uncertainty_score":0.86730057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036438793,0.00000886577,0.9418801,0.00004204279,0.0000082584975,0.020645717,0.000008594347,0.00017710822,0.00079053215],"genre_scores_gemma":[0.72576696,0.0000026743846,0.15761097,0.00011833781,0.00014348769,0.116064355,0.00006486729,0.000020036012,0.00020831305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998364,0.00003436759,0.00050638075,0.00054913835,0.00024063599,0.0003055041],"domain_scores_gemma":[0.99863726,0.000051736137,0.00021425619,0.0009431608,0.00008879425,0.00006479037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009431459,0.0002098103,0.00033587607,0.0002976133,0.00011387885,0.00009245253,0.0011693157,0.000077849356,0.000023155066],"category_scores_gemma":[4.512298e-8,0.00019213557,0.00018499991,0.0014741197,0.0000529054,0.0002693708,0.00027843373,0.0001223207,0.000017766652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060912153,0.000717577,0.0024716228,0.00007393915,0.00023751259,8.40426e-7,0.00014401645,0.804783,0.0013036403,0.03591065,0.003132932,0.15121818],"study_design_scores_gemma":[0.0002930488,0.000027241822,0.022389228,0.000009106479,0.000079563084,0.0000024515443,7.101257e-7,0.9560825,0.00070353586,0.0005946051,0.0196188,0.00019918018],"about_ca_topic_score_codex":0.000023182633,"about_ca_topic_score_gemma":0.000025445606,"teacher_disagreement_score":0.7842691,"about_ca_system_score_codex":0.000054368043,"about_ca_system_score_gemma":0.00002702376,"threshold_uncertainty_score":0.78350616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036154285,0.00025277724,0.95686173,0.004182231,0.000055823264,0.0015461949,0.0000023789014,0.00006840561,0.00087617675],"genre_scores_gemma":[0.94069856,0.000016836879,0.05615785,0.0018853457,0.0002766966,0.0008363217,0.0000041765916,0.000020283502,0.00010392687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985409,0.00012971068,0.00037636608,0.00039129212,0.00024459828,0.00031717407],"domain_scores_gemma":[0.9983227,0.00031191536,0.00018209507,0.0010735714,0.00008045204,0.000029223555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043290536,0.00016301313,0.00016692383,0.000052946583,0.00037614748,0.000070514005,0.0017637877,0.0000842305,0.0000033969063],"category_scores_gemma":[8.0319205e-7,0.00010282821,0.00011249473,0.0010682225,0.00006905154,0.0001222128,0.00077487633,0.00026862018,0.000019353134],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001590822,0.00044763475,0.0035700887,0.000040092298,0.000031093292,0.0000014625996,0.0010100593,0.038658552,0.003895326,0.24177767,0.038756084,0.671796],"study_design_scores_gemma":[0.0018439626,0.00011464448,0.046403076,0.0007897932,0.000041082498,0.000053980995,0.00004724392,0.35995454,0.02228138,0.04938643,0.5180441,0.0010397931],"about_ca_topic_score_codex":0.000032027507,"about_ca_topic_score_gemma":0.00027463847,"teacher_disagreement_score":0.9045443,"about_ca_system_score_codex":0.00007705153,"about_ca_system_score_gemma":0.00005585511,"threshold_uncertainty_score":0.4193213},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069025066,0.0014621372,0.9943933,0.00020434783,0.0001152875,0.0026163512,0.000048672635,0.00019393388,0.00027574852],"genre_scores_gemma":[0.01030745,0.00026644132,0.9833505,0.00032521706,0.00028825374,0.005183375,0.00012724285,0.00002232657,0.00012916159],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984863,0.000020884094,0.000413828,0.00054482336,0.00014367812,0.0003905194],"domain_scores_gemma":[0.998287,0.00012550788,0.0001910686,0.0011445432,0.00014419251,0.000107681844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023854704,0.00018692706,0.000244747,0.000054678672,0.0001706496,0.00009407615,0.001567683,0.00009281822,0.000016588887],"category_scores_gemma":[2.825503e-7,0.0001922045,0.00014953526,0.0006511524,0.000058811984,0.00014703027,0.0005697063,0.00016739233,0.000045033543],"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.000003963983,0.0002040852,0.00005332018,0.00011934977,0.000060683396,7.0856527e-7,0.00007999559,0.0018300375,0.0010633593,0.19429961,0.028549153,0.77373576],"study_design_scores_gemma":[0.00035988077,0.000041516294,0.00068969524,0.000022291357,0.000020554033,0.000006792363,0.000003008661,0.01719684,0.00053819217,0.008953845,0.9719701,0.00019732179],"about_ca_topic_score_codex":0.0000012886728,"about_ca_topic_score_gemma":0.000011233071,"teacher_disagreement_score":0.9434209,"about_ca_system_score_codex":0.00002372392,"about_ca_system_score_gemma":0.000028007427,"threshold_uncertainty_score":0.78378725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009510105,0.0000433432,0.909948,0.0008123355,0.000027554366,0.08834671,0.000011822438,0.00039950703,0.00031566154],"genre_scores_gemma":[0.0253174,0.0000021889614,0.5781307,0.0016377885,0.0003908193,0.3941225,0.000014498802,0.0000449182,0.00033913524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997807,0.0000443496,0.00041276973,0.00084547646,0.00022109276,0.00066929765],"domain_scores_gemma":[0.998099,0.00017717047,0.00021094087,0.0010410629,0.0002765878,0.00019520067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018703788,0.00031613145,0.00033932432,0.00007326304,0.00055307377,0.00013595437,0.00095994375,0.00011818862,0.0000086281],"category_scores_gemma":[5.101231e-7,0.00027976715,0.00012634094,0.00064909575,0.00011606978,0.00028067874,0.00022891273,0.00019764047,0.00007741514],"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.0005229352,0.0030738618,0.00079270586,0.0002698117,0.00078650523,0.00011095956,0.0041887225,0.15989542,0.0022984704,0.08385816,0.50925356,0.23494889],"study_design_scores_gemma":[0.0035002304,0.0003653123,0.0009798454,0.000041814146,0.000018271145,0.00034472148,0.000007854506,0.10256206,0.00028813735,0.0024292103,0.8888656,0.00059695984],"about_ca_topic_score_codex":0.000006380948,"about_ca_topic_score_gemma":0.000011098094,"teacher_disagreement_score":0.37961203,"about_ca_system_score_codex":0.00005954739,"about_ca_system_score_gemma":0.00013896782,"threshold_uncertainty_score":0.9999654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018596854,0.0011584223,0.9766969,0.00089064933,0.0007546558,0.00037752933,5.77104e-7,0.0008914983,0.0006329175],"genre_scores_gemma":[0.9549535,0.000051429262,0.0437943,0.0003484163,0.0005551297,0.000053848333,0.00000277982,0.000015219059,0.00022537337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982308,0.00002856869,0.00032575132,0.00072080555,0.0000690379,0.00062502123],"domain_scores_gemma":[0.99871385,0.00014679805,0.000105508865,0.00072917494,0.00020706218,0.000097604425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026133412,0.00024702822,0.00035089644,0.00021733643,0.00027003663,0.00021791355,0.0011293511,0.0003758562,0.0000027643646],"category_scores_gemma":[0.00001277005,0.00023851129,0.00007227597,0.00075450586,0.00012891422,0.0002553449,0.0006123879,0.00030972288,0.000014134394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003433848,0.000055652556,0.0007401146,0.000006411574,0.000013248499,0.000008658075,0.00007929427,0.000054274886,0.00004594365,0.32780507,0.0020318753,0.669156],"study_design_scores_gemma":[0.0007195571,0.0003707518,0.0010520443,0.00004575972,0.0000075805883,0.00007813125,0.000002296975,0.9701507,0.00043027085,0.01610025,0.010745088,0.00029755099],"about_ca_topic_score_codex":7.595527e-7,"about_ca_topic_score_gemma":0.000004904434,"teacher_disagreement_score":0.97009647,"about_ca_system_score_codex":0.00003521108,"about_ca_system_score_gemma":0.000044316395,"threshold_uncertainty_score":0.9726208},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072944444,0.000103538776,0.95841086,0.00039670162,0.000011980176,0.03905949,0.0000017124988,0.00040354513,0.00088273006],"genre_scores_gemma":[0.012639604,0.000004693419,0.77617663,0.0003163535,0.00031942764,0.21034172,0.0000274707,0.000038482296,0.00013559121],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786437,0.00008209318,0.00048596834,0.0008376491,0.00015508772,0.00057480746],"domain_scores_gemma":[0.9985294,0.00010817288,0.00019445567,0.0009800127,0.00007718551,0.000110774105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002595307,0.00028435222,0.00025654244,0.00020077417,0.00028112566,0.00032531185,0.0012644025,0.000113447015,0.0000032301127],"category_scores_gemma":[3.073563e-7,0.0002689611,0.000071407005,0.0012168927,0.000062561834,0.00032423597,0.00034752223,0.00042872335,0.000025951846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038394428,0.0015407694,0.0005250377,0.000051866384,0.00002882617,0.000049591334,0.00045913568,0.065647215,0.0012510523,0.07025224,0.005221955,0.8549339],"study_design_scores_gemma":[0.003001286,0.00013537439,0.00055721786,0.00013449852,0.000010540483,0.00012297567,0.000009157368,0.30090788,0.00028693295,0.0031461162,0.6911358,0.00055219856],"about_ca_topic_score_codex":0.000049348433,"about_ca_topic_score_gemma":0.00036805496,"teacher_disagreement_score":0.85438174,"about_ca_system_score_codex":0.00013161456,"about_ca_system_score_gemma":0.00007903352,"threshold_uncertainty_score":0.9999763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016977403,0.0005201358,0.97676075,0.0037959344,0.00073009136,0.00038563847,0.0000027831252,0.00065746874,0.0001697723],"genre_scores_gemma":[0.95030355,0.00018921313,0.04878726,0.00025018456,0.00005008716,0.00026383175,0.0000020262437,0.000033546414,0.00012028408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977681,0.000119999095,0.00033857746,0.00076974335,0.000394853,0.00060873054],"domain_scores_gemma":[0.9985166,0.00014277535,0.000110638204,0.00094081834,0.00013328707,0.0001558348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029317293,0.00029914983,0.00034857503,0.0005240388,0.00013562427,0.000119893324,0.0006220847,0.0004653387,0.000010910435],"category_scores_gemma":[0.00001605811,0.00026365413,0.00008609292,0.0018313213,0.00027021894,0.0008505132,0.000013527083,0.0011926229,0.000051541338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051303266,0.0021906928,0.00066961645,0.000015902417,0.00026737023,0.0018885769,0.0001971831,0.79053456,0.00047659487,0.018222418,0.0008280769,0.18419597],"study_design_scores_gemma":[0.0036084957,0.0026105917,0.00052962214,0.00017903514,0.00007009475,0.0024077306,0.0002083796,0.97227657,0.006194833,0.0024114538,0.008439493,0.0010636733],"about_ca_topic_score_codex":0.000017998873,"about_ca_topic_score_gemma":0.00040765599,"teacher_disagreement_score":0.9333262,"about_ca_system_score_codex":0.0003371,"about_ca_system_score_gemma":0.00032627647,"threshold_uncertainty_score":0.9999816},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005365641,0.001220436,0.9919891,0.0020700102,0.000099937104,0.0034726614,0.0000065101112,0.0002629695,0.00034183465],"genre_scores_gemma":[0.22830266,0.0015993767,0.7246474,0.0029894118,0.0017284609,0.040071644,0.000049965325,0.00010149706,0.0005096007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977711,0.000092263974,0.00031670395,0.00076270604,0.00032055515,0.00073667354],"domain_scores_gemma":[0.99722487,0.0007386009,0.00008833398,0.0014039729,0.00039348702,0.00015074374],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00089865143,0.00019544612,0.00015768888,0.00009280902,0.0014615114,0.0004975083,0.0024927643,0.00013633868,0.000001947705],"category_scores_gemma":[0.0000015806169,0.00015769286,0.00012655319,0.0008413273,0.00012474245,0.00014986536,0.00058407977,0.0004944395,0.00015044618],"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.0000059115523,0.00013341449,4.795246e-7,0.000005611241,0.000014784811,7.4150745e-7,0.00021477435,0.007436206,0.00012993003,0.72593576,0.0060672266,0.26005512],"study_design_scores_gemma":[0.00043231453,0.00019254026,0.0000117667005,0.000016719938,0.0000034842599,0.0000098487735,0.000024255534,0.042672083,0.0013138051,0.27032754,0.6848132,0.00018245916],"about_ca_topic_score_codex":0.0000041177573,"about_ca_topic_score_gemma":0.000034866247,"teacher_disagreement_score":0.678746,"about_ca_system_score_codex":0.00018237723,"about_ca_system_score_gemma":0.000108121654,"threshold_uncertainty_score":0.9998385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008459354,0.00022123309,0.9563773,0.00005537203,0.004488956,0.00056451204,0.0000063080197,0.0002876578,0.03791402],"genre_scores_gemma":[0.91972226,0.00015504686,0.014868571,0.0008715741,0.00049472746,0.0008094304,0.00023172832,0.0000623719,0.06278426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759984,0.00012205726,0.00049092824,0.00095485494,0.00025187913,0.00058042764],"domain_scores_gemma":[0.9981771,0.00010619844,0.0003422616,0.000991786,0.00021550996,0.00016716073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018376125,0.0004467841,0.00056188076,0.00014519147,0.00010107367,0.0001099903,0.001936145,0.00051497365,0.00070193317],"category_scores_gemma":[0.000014053135,0.00040298395,0.00015007466,0.0001897808,0.00003811266,0.00025554604,0.00015136546,0.00050992833,0.0003451734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006398651,0.00024793023,0.000003449895,0.000077240235,0.00025399693,0.000048053455,0.0028669017,0.000088185756,0.00042358565,0.045277547,0.005227325,0.9454218],"study_design_scores_gemma":[0.00508523,0.0031016443,0.0012182716,0.0010765946,0.00026511162,0.000067985784,0.0018695975,0.8452895,0.07898154,0.052628286,0.0050861295,0.0053300876],"about_ca_topic_score_codex":0.00015578791,"about_ca_topic_score_gemma":0.0003539023,"teacher_disagreement_score":0.94150877,"about_ca_system_score_codex":0.00009001702,"about_ca_system_score_gemma":0.00017580735,"threshold_uncertainty_score":0.9998422},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03391956,0.00022476254,0.95816284,0.0008860613,0.0010628124,0.00072174595,0.0000019178592,0.00048825328,0.0045320597],"genre_scores_gemma":[0.95343673,0.00006242304,0.044596113,0.0007130056,0.0001171924,0.00026621053,0.0000036896147,0.000016447088,0.0007881578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981961,0.00006622817,0.00036623393,0.00060179055,0.000175435,0.0005941866],"domain_scores_gemma":[0.99788463,0.0008709623,0.00014932772,0.0007830294,0.00019417844,0.000117883916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020968911,0.00023670302,0.00028229912,0.00006567437,0.00018601044,0.00039071272,0.0011875865,0.00015545424,0.0001501984],"category_scores_gemma":[0.00006756359,0.00018696337,0.00009680669,0.00023390663,0.00013525182,0.00042972964,0.00041027187,0.00025445016,0.000055635755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004442171,0.000040920622,0.00013949192,0.000023480367,0.000035562865,0.000006603229,0.00022230552,0.0021372163,0.0001284806,0.29878443,0.025580643,0.67285645],"study_design_scores_gemma":[0.00069070625,0.00074014737,0.00024386637,0.00017878196,0.000008009841,0.000016044844,0.0009202432,0.96722263,0.000994717,0.026129154,0.002282303,0.0005734028],"about_ca_topic_score_codex":0.000030479106,"about_ca_topic_score_gemma":0.0000908829,"teacher_disagreement_score":0.9650854,"about_ca_system_score_codex":0.000067008266,"about_ca_system_score_gemma":0.00004807793,"threshold_uncertainty_score":0.7624145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014209697,0.00008600969,0.9792432,0.00064458844,0.0008340314,0.00016773073,0.0000011670356,0.00007177767,0.0047417977],"genre_scores_gemma":[0.98260367,0.000007950847,0.016459137,0.0005991643,0.00017751177,0.000022932341,0.0000060472175,0.000008830145,0.00011476849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986575,0.000063196894,0.00026617048,0.000443099,0.0002703368,0.00029967946],"domain_scores_gemma":[0.9982685,0.0006080687,0.00017991314,0.0007757915,0.00007724595,0.000090520734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041142027,0.00015131327,0.00020842091,0.00020882112,0.00023992945,0.0004275559,0.0016973466,0.00008348332,0.000026897967],"category_scores_gemma":[0.00018598394,0.00014849033,0.00006459816,0.00029023187,0.00007903189,0.0004299404,0.00050302537,0.00032352156,0.00012785789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043509248,0.000073543444,0.003631832,0.000004459876,0.00000860912,0.000045013632,0.00007550995,0.8362833,0.000001730818,0.051443078,0.0008630151,0.10752636],"study_design_scores_gemma":[0.0011485036,0.000057902354,0.08824924,0.00006818495,0.0000012406425,0.000008037263,0.0000014057732,0.8966461,0.000006736759,0.013313837,0.00034256183,0.00015629183],"about_ca_topic_score_codex":0.00001876187,"about_ca_topic_score_gemma":0.0000158737,"teacher_disagreement_score":0.968394,"about_ca_system_score_codex":0.00006623347,"about_ca_system_score_gemma":0.00007393737,"threshold_uncertainty_score":0.605526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063343323,0.000018454513,0.98845416,0.0020911987,0.00029553726,0.0019287732,0.0000038272406,0.00010254908,0.00077114464],"genre_scores_gemma":[0.9927628,0.0000043288,0.0048954524,0.0016407045,0.00005549839,0.00032561505,7.318555e-7,0.000013715273,0.00030116082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840784,0.00022798347,0.00020826956,0.0005628917,0.00020927124,0.00038372926],"domain_scores_gemma":[0.997169,0.001919161,0.000059084345,0.00060312066,0.000141953,0.0001076738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794095,0.00020400822,0.00018318716,0.00003280406,0.00019214005,0.0001311678,0.00034374758,0.000096764976,0.000114113645],"category_scores_gemma":[0.000029086063,0.00009985961,0.00007138948,0.00022201258,0.000115052404,0.000114985116,0.000043689502,0.000115965755,0.000013365877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019575702,0.0007171028,0.00023362708,0.000023551738,0.00011885486,0.000012352259,0.0009411514,0.5054467,0.0019690266,0.042969715,0.02432056,0.42128983],"study_design_scores_gemma":[0.0009523166,0.00044015236,0.0009776427,0.000041940795,0.000008812806,0.0000017110789,0.000015075061,0.99513274,0.0011001548,0.00008044559,0.0010830369,0.00016597712],"about_ca_topic_score_codex":0.000004987465,"about_ca_topic_score_gemma":0.000008521746,"teacher_disagreement_score":0.98642844,"about_ca_system_score_codex":0.00004541749,"about_ca_system_score_gemma":0.00005731344,"threshold_uncertainty_score":0.40721565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085056886,0.0016395826,0.80364,0.0037427933,0.000279905,0.0004700461,0.000007641256,0.00070187007,0.104461245],"genre_scores_gemma":[0.9286678,0.000113087124,0.06294024,0.00023176837,0.000034122455,0.00008561905,0.000048472117,0.000030032206,0.007848871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959476,0.0020107736,0.00039539064,0.00071326125,0.0004583365,0.00047461863],"domain_scores_gemma":[0.9953228,0.0013670241,0.00026464372,0.0021852634,0.0007227742,0.00013744863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028453819,0.00023935759,0.0002181079,0.000113004055,0.00041724934,0.00047842631,0.0017858327,0.00013271839,0.000091735266],"category_scores_gemma":[0.00027021123,0.00024716562,0.00013140216,0.00072457665,0.000108015665,0.00034257243,0.0005970412,0.00035183533,0.00017898133],"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.000004407775,0.00041561964,0.00036700114,0.000013151919,0.000013265125,0.000010762723,0.002028537,0.00082423136,0.0010771224,0.8441825,0.005597494,0.14546593],"study_design_scores_gemma":[0.0023322569,0.0000063632274,0.007261313,0.0016165866,0.000033362357,0.00006857845,0.0001358726,0.5890255,0.078354634,0.06223089,0.25723192,0.0017026864],"about_ca_topic_score_codex":0.00014923382,"about_ca_topic_score_gemma":0.0005901436,"teacher_disagreement_score":0.8436109,"about_ca_system_score_codex":0.00010178184,"about_ca_system_score_gemma":0.000095559124,"threshold_uncertainty_score":0.99999803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008566472,0.017652087,0.9020839,0.0042911237,0.011375967,0.0072017293,0.0017744832,0.0018942051,0.045160037],"genre_scores_gemma":[0.8734492,0.0028594788,0.10997782,0.004106084,0.004304473,0.0012665549,0.0018042253,0.00016000512,0.0020721706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98948973,0.0004854757,0.0020867272,0.0026121133,0.0021608912,0.0031650632],"domain_scores_gemma":[0.9939254,0.000945303,0.0013635759,0.001805674,0.0008047449,0.0011552881],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0026429296,0.0014285656,0.0015252748,0.0007029448,0.0024109792,0.0017698755,0.0075181667,0.0003493933,0.0036661034],"category_scores_gemma":[0.00022358554,0.0013903591,0.0008205092,0.0017964453,0.0011288744,0.002804418,0.0018922312,0.0010170419,0.00035113064],"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.00017298422,0.0026261765,0.008137921,0.00020009476,0.00067910535,0.00012943841,0.0018749025,0.013937517,0.0006280201,0.11672565,0.34549966,0.5093885],"study_design_scores_gemma":[0.0013998054,0.0005012171,0.026732672,0.00032335587,0.000053309624,0.00019708021,0.00011432928,0.6225621,0.000019328445,0.0011571652,0.34564072,0.0012989048],"about_ca_topic_score_codex":0.00012250213,"about_ca_topic_score_gemma":0.00016843925,"teacher_disagreement_score":0.8648827,"about_ca_system_score_codex":0.00056727836,"about_ca_system_score_gemma":0.000535382,"threshold_uncertainty_score":0.99984646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024083822,0.000031381267,0.95740247,0.00005421594,0.000089538495,0.038866144,0.0000011382574,0.0001129499,0.0010337904],"genre_scores_gemma":[0.6937997,0.0000036051008,0.147196,0.00021058752,0.00005224076,0.15865704,2.1238021e-7,0.000017126458,0.00006353078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696195,0.0000499641,0.00032205047,0.0013148083,0.0004900016,0.00086122664],"domain_scores_gemma":[0.998381,0.00036759675,0.00015889767,0.000745813,0.00016452979,0.00018211444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023442227,0.00027381006,0.0002639435,0.00025210928,0.0003624842,0.00022053682,0.0013120831,0.00008708192,0.000004633206],"category_scores_gemma":[0.00004231736,0.00019292506,0.000037675753,0.0011467353,0.00025437502,0.0005770676,0.0004805649,0.00018404823,0.000009464424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001293391,0.0000973707,0.0002680421,0.00003905736,0.0000018326275,7.675847e-7,0.00030736817,0.027571894,0.014491723,0.0008584795,0.000029457746,0.95620465],"study_design_scores_gemma":[0.0015763904,0.00045649224,0.0012078598,0.00006594632,0.0000021014473,0.0000011997491,0.000005992627,0.9884429,0.0054201176,0.0012244513,0.0013052677,0.000291279],"about_ca_topic_score_codex":6.803948e-7,"about_ca_topic_score_gemma":0.000019496723,"teacher_disagreement_score":0.960871,"about_ca_system_score_codex":0.00036087848,"about_ca_system_score_gemma":0.00032954954,"threshold_uncertainty_score":0.7867256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8120416,0.00017634172,0.18377379,0.00019575497,0.0011457494,0.00021568326,5.962892e-7,0.00024735183,0.0022031835],"genre_scores_gemma":[0.99780804,0.00017994764,0.0009038536,0.00039450944,0.00017184623,0.000029691751,0.0000065575014,0.00001583008,0.00048969494],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979199,0.00017802168,0.00039926564,0.00051686895,0.0003538493,0.0006320673],"domain_scores_gemma":[0.9983979,0.0005472883,0.00012087235,0.0007342819,0.000046428548,0.00015322286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067587715,0.00020288136,0.0003760026,0.00015128306,0.0001540051,0.0000687643,0.0005607218,0.00012979316,0.00006181575],"category_scores_gemma":[0.000028121989,0.00021483132,0.00012303819,0.0007492971,0.00006901976,0.00042261218,0.00031727963,0.00025379192,0.00007885342],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005145961,0.0019195704,0.776705,0.000045544104,0.00005539237,0.0023162756,0.0009939242,0.015807608,0.0003433641,0.011156059,0.14245363,0.048152126],"study_design_scores_gemma":[0.00091307226,0.000118267875,0.24507254,0.00031959894,0.000010768936,0.00029508577,0.000037492322,0.73440075,0.003930657,0.00052974524,0.012725337,0.0016466493],"about_ca_topic_score_codex":0.000078590245,"about_ca_topic_score_gemma":0.00010059422,"teacher_disagreement_score":0.7185932,"about_ca_system_score_codex":0.00014915624,"about_ca_system_score_gemma":0.00010086671,"threshold_uncertainty_score":0.8760567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0621509,0.0010454918,0.763422,0.0002980722,0.002962424,0.0022115484,0.0000016800066,0.0009559849,0.16695186],"genre_scores_gemma":[0.9472075,0.00024088427,0.041045774,0.00020084067,0.00008509062,0.00017908959,0.0012295088,0.000059985134,0.009751314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998272,0.00011386168,0.0004330288,0.0005274697,0.00031328862,0.00034034392],"domain_scores_gemma":[0.99758816,0.00016239267,0.0003418228,0.0016343788,0.00018766936,0.00008560852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029462663,0.00030672582,0.0003305805,0.00016441304,0.00009252044,0.00014353929,0.0018873417,0.0007456546,0.00007701133],"category_scores_gemma":[0.000016724154,0.00026333527,0.000046870933,0.00068822305,0.000029705952,0.0003492121,0.000119433775,0.001688088,0.00004254039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058269047,0.000879173,0.005628144,0.00014626198,0.0002103554,0.00019317283,0.0071041784,0.2894376,0.00014210975,0.10952369,0.0072010956,0.57895154],"study_design_scores_gemma":[0.0007055014,0.00010445209,0.01777081,0.0003948487,0.000015707146,0.00001067936,0.00004830687,0.97847724,0.00007267203,0.0004707144,0.0013701475,0.0005589419],"about_ca_topic_score_codex":0.0007494616,"about_ca_topic_score_gemma":0.07343195,"teacher_disagreement_score":0.8850566,"about_ca_system_score_codex":0.00005332299,"about_ca_system_score_gemma":0.00017804801,"threshold_uncertainty_score":0.9999819},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09742297,0.00041938695,0.9001168,0.00071357144,0.000377043,0.00047156084,0.0000029478915,0.00027127727,0.00020443134],"genre_scores_gemma":[0.70833606,0.0004905544,0.28414726,0.0018525153,0.00017923194,0.0004602511,0.0000026181488,0.00003671944,0.004494782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976678,0.00040613773,0.00033998935,0.00073164346,0.00026932915,0.00058513304],"domain_scores_gemma":[0.9978866,0.0004132844,0.000045012992,0.0012667039,0.00006827733,0.00032010666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012948907,0.00019575066,0.00021024731,0.0001829047,0.00006576986,0.0001054383,0.0011902967,0.00011919807,0.00015254407],"category_scores_gemma":[0.000043496046,0.0001339048,0.00004627992,0.0007151407,0.000039891285,0.0007395646,0.00049933454,0.00013614909,0.0003457341],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015590995,0.000055791228,0.000070891234,7.028973e-7,0.0000022189474,0.00003404462,0.00046917645,0.004960235,0.0010401008,0.00027307618,0.0016168226,0.991321],"study_design_scores_gemma":[0.0014326018,0.002737976,0.009184296,0.00011569936,0.0000023124642,0.000023574923,0.00008520568,0.78292966,0.000845064,0.0014816413,0.20038667,0.0007753322],"about_ca_topic_score_codex":0.000013027323,"about_ca_topic_score_gemma":0.000107813445,"teacher_disagreement_score":0.9905457,"about_ca_system_score_codex":0.00014130793,"about_ca_system_score_gemma":0.00005663778,"threshold_uncertainty_score":0.5460479},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053991156,0.00061442406,0.018693693,0.000019886787,0.0006443224,0.033195496,0.000114441114,0.0006531815,0.94552463],"genre_scores_gemma":[0.95934325,0.000014290511,0.003384407,0.00033845578,0.0010779474,0.021205867,0.000014092503,0.00010670099,0.014515012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711454,0.00006429326,0.00068031147,0.0010104026,0.0004944964,0.00063596293],"domain_scores_gemma":[0.998068,0.000062946565,0.00033281036,0.0011906539,0.000089585774,0.00025600006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005264812,0.0005254571,0.0005545859,0.000073611016,0.00010221529,0.00020258615,0.0008068665,0.0006518858,0.00001879809],"category_scores_gemma":[0.0000101236055,0.00054140633,0.00011702794,0.00004203041,0.00011886172,0.00027242338,0.0008366543,0.0006065845,0.000048045582],"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.000023760904,0.00003962346,0.0015972295,0.0001287726,0.000030472156,0.000054519067,0.00021182731,0.000116992094,0.000004246843,0.8718994,0.00033029346,0.12556282],"study_design_scores_gemma":[0.0043207644,0.0016354555,0.013546672,0.0056575825,0.00015516211,0.00086754095,0.00003865979,0.06973739,0.000116904404,0.7311368,0.16840544,0.004381621],"about_ca_topic_score_codex":0.000074169526,"about_ca_topic_score_gemma":0.00010355638,"teacher_disagreement_score":0.9588033,"about_ca_system_score_codex":0.00046755682,"about_ca_system_score_gemma":0.0001536178,"threshold_uncertainty_score":0.99970376},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031575194,0.0015137666,0.050963625,0.000028185292,0.00081711076,0.0005125127,0.000009819501,0.0002690823,0.9455702],"genre_scores_gemma":[0.92687756,0.00026811787,0.009589631,0.0013268478,0.00086625805,0.000057677604,0.000004732782,0.00014797552,0.060861208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734783,0.000047448342,0.0005554947,0.0010291823,0.00032601538,0.000694006],"domain_scores_gemma":[0.9982713,0.00007810203,0.00031970878,0.0010161644,0.00007311867,0.0002416322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002736953,0.0005724371,0.00064574945,0.000077048244,0.00009522797,0.00020529798,0.0010122351,0.0007049449,0.000011506587],"category_scores_gemma":[0.0000064390915,0.00059876457,0.00013510509,0.00004479056,0.0001374566,0.00012142873,0.0009673632,0.00071482366,0.00005161125],"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.00001282578,0.000005145104,0.000060660357,0.000012157911,0.000027085556,0.0002496594,0.0000926258,0.000041284387,7.9169513e-7,0.8689945,0.00029667915,0.13020664],"study_design_scores_gemma":[0.0025722142,0.00055494125,0.0010714676,0.0030706169,0.0001406023,0.0008573269,0.000022182221,0.14228958,0.00002013116,0.8045778,0.040370584,0.0044524944],"about_ca_topic_score_codex":0.00006804609,"about_ca_topic_score_gemma":0.00035763314,"teacher_disagreement_score":0.9265618,"about_ca_system_score_codex":0.0002049259,"about_ca_system_score_gemma":0.00011568167,"threshold_uncertainty_score":0.99964637},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9637015,0.00001290256,0.028786637,0.0005271189,0.00016218501,0.00011165793,1.6325448e-7,0.00005437627,0.0066434583],"genre_scores_gemma":[0.985315,0.000029785306,0.014046018,0.000086280794,0.000037014204,1.0461698e-7,0.0000046486716,0.000008439188,0.000472678],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992246,0.000028896415,0.0001204905,0.00030576217,0.000084414765,0.00023581478],"domain_scores_gemma":[0.99924296,0.00020364021,0.000091876114,0.00034592403,0.0000133563735,0.00010226046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089640605,0.000106186104,0.00017446523,0.00010259617,0.00008765758,0.00005087028,0.0007415312,0.00013466766,0.000050276565],"category_scores_gemma":[0.00000680969,0.00012914524,0.000035738318,0.00041511166,0.0000935509,0.0013806603,0.00066440867,0.00036115112,0.000004527922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009990006,0.00023185102,0.59620696,0.00006437863,0.00008170671,0.00020675558,0.012922008,0.0076426324,0.0016968056,0.33780468,0.0016897058,0.041352596],"study_design_scores_gemma":[0.00045952926,0.000021511509,0.022565302,0.00005702196,0.000004191497,0.000005924834,0.00014303987,0.97581255,0.00024735238,0.0002123061,0.00031123232,0.00016002686],"about_ca_topic_score_codex":0.0006686994,"about_ca_topic_score_gemma":0.0005490805,"teacher_disagreement_score":0.9681699,"about_ca_system_score_codex":0.000005858108,"about_ca_system_score_gemma":0.000056148663,"threshold_uncertainty_score":0.526639},"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":"other","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.712447e-7,0.00005244765,0.3189191,0.000039831597,0.0009283223,0.16285782,0.000044099022,0.0005551926,0.5166025],"genre_scores_gemma":[0.0013347962,6.0869553e-7,0.15179968,0.0027090095,0.003432946,0.7801564,0.000026696569,0.0002094209,0.060330447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966466,0.000038046874,0.0007835948,0.0011788367,0.00050802086,0.00084493664],"domain_scores_gemma":[0.9968689,0.00021635473,0.00056387234,0.001638865,0.000431633,0.00028035988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044304386,0.00071387854,0.00064981496,0.000045089146,0.0004497853,0.0005486051,0.0017316149,0.00092649885,0.00006582465],"category_scores_gemma":[0.000025522066,0.0007050252,0.0003678298,0.000054213182,0.00012616096,0.00012917217,0.00039901788,0.0007230322,0.00013367372],"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.0000590523,0.000016828735,0.00000304372,0.00005781171,0.000038299277,0.000018075092,0.000019322588,0.0031833816,0.000010139786,0.94394535,0.0074750497,0.045173675],"study_design_scores_gemma":[0.0014305253,0.0005158097,0.00000152186,0.0004552194,0.000030570736,0.00001633027,6.0604617e-7,0.051473826,0.00008811243,0.12174077,0.82332826,0.0009184517],"about_ca_topic_score_codex":0.0000059807007,"about_ca_topic_score_gemma":0.00019138983,"teacher_disagreement_score":0.82220453,"about_ca_system_score_codex":0.00025636982,"about_ca_system_score_gemma":0.000915163,"threshold_uncertainty_score":0.9995401},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014581286,0.0000049695814,0.99425703,0.0013629309,0.00016953293,0.00021927911,0.0000031284917,0.00020762827,0.0023173662],"genre_scores_gemma":[0.7554045,0.0000013173216,0.24195299,0.0009783569,0.00013205044,0.000048798316,0.000004616155,0.000010905078,0.0014665289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986527,0.000049806134,0.00025617555,0.00048739393,0.0002247701,0.00032913592],"domain_scores_gemma":[0.998442,0.00048185763,0.00010551633,0.0007117022,0.00017236375,0.00008658176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048334664,0.00013381829,0.00017219997,0.0001417195,0.00013799536,0.00021266566,0.0005472099,0.000095288124,0.00032692484],"category_scores_gemma":[0.00007558843,0.000086539905,0.00017328656,0.0007201957,0.000019598961,0.00035470942,0.00009350389,0.000050649756,0.000038274233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010991682,0.000021871456,0.0029730734,0.0000018300708,0.000048657796,0.0000014010941,0.000021680964,0.95647293,0.000052834534,0.006849976,0.00033167392,0.033213075],"study_design_scores_gemma":[0.00050098257,0.00006112752,0.00061695685,0.000011668255,0.000033421587,3.126418e-7,8.392637e-7,0.9962562,0.0013683084,0.000097674354,0.000898573,0.00015395011],"about_ca_topic_score_codex":0.000012379809,"about_ca_topic_score_gemma":0.000020450485,"teacher_disagreement_score":0.7539463,"about_ca_system_score_codex":0.000060065344,"about_ca_system_score_gemma":0.000038450064,"threshold_uncertainty_score":0.35795978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093029246,0.00782886,0.8664262,0.024597965,0.0025839817,0.00038596801,0.0000028763864,0.00007103862,0.0050738226],"genre_scores_gemma":[0.98624337,0.0012614172,0.011934042,0.0001749368,0.00035541397,0.0000067569954,1.8089041e-7,0.000004038762,0.00001984887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997938,0.000417649,0.0007364218,0.00019092012,0.00047029444,0.00024674204],"domain_scores_gemma":[0.99768364,0.0009034298,0.0006287065,0.00039767224,0.00026372465,0.00012284123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033526984,0.00011067561,0.00026091578,0.00013757077,0.0002888376,0.00028670713,0.0022170783,0.000052061216,0.0000027533254],"category_scores_gemma":[0.00006128497,0.00007082847,0.000051005358,0.00034669603,0.00026135484,0.0007608786,0.0005924114,0.00016155594,0.0000014466225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002599051,0.000041743584,0.0585827,0.0000065679747,0.000060324845,0.000022030126,0.00035315673,0.0025911776,0.00017068424,0.8128786,0.000980849,0.12428615],"study_design_scores_gemma":[0.0022924736,0.00026098426,0.035032764,0.0044427575,0.000020325782,0.0011219529,0.00041213087,0.93824077,0.000019797992,0.013389356,0.004409859,0.00035681212],"about_ca_topic_score_codex":0.00001673177,"about_ca_topic_score_gemma":0.00003972008,"teacher_disagreement_score":0.93564963,"about_ca_system_score_codex":0.000083723404,"about_ca_system_score_gemma":0.00012992336,"threshold_uncertainty_score":0.411992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011454295,0.000027036143,0.9764427,0.0042474996,0.0017250115,0.0006047276,0.00003573929,0.00027512063,0.0051878584],"genre_scores_gemma":[0.9477573,0.00011117914,0.05033228,0.0007145966,0.00026428807,0.00042809706,0.00018699672,0.00002275359,0.00018248973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983781,0.00011635981,0.00041115106,0.0004577597,0.00031676007,0.00031989117],"domain_scores_gemma":[0.99612594,0.0008852362,0.00026466433,0.0021063194,0.0005035958,0.000114264934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043316264,0.00022223564,0.00018539638,0.00012732709,0.00044746016,0.00044618812,0.004215453,0.00018964404,0.00008819837],"category_scores_gemma":[0.00022827435,0.00022592468,0.0001294569,0.00020904014,0.00013339621,0.0006554284,0.0008080056,0.0008228353,0.000023800576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027754513,0.0002097973,0.0019470504,0.0000033159808,0.000049637412,0.000001036671,0.00036555875,0.0011346232,0.00550043,0.93259656,0.0013360166,0.056828238],"study_design_scores_gemma":[0.0005678062,0.000048292794,0.0026514549,0.00005956778,0.0000072801467,0.000008077465,0.000025772379,0.9828941,0.00022708818,0.0065497602,0.0067216507,0.0002391205],"about_ca_topic_score_codex":0.000109219145,"about_ca_topic_score_gemma":0.0013902942,"teacher_disagreement_score":0.9817595,"about_ca_system_score_codex":0.000090529684,"about_ca_system_score_gemma":0.000119167686,"threshold_uncertainty_score":0.92129415},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009547086,0.013469131,0.42390153,0.000021114403,0.0074069547,0.0021952365,0.00001985071,0.0006842486,0.55134726],"genre_scores_gemma":[0.06828762,0.000046091438,0.02651494,0.00071455375,0.0010681336,0.00017099445,0.00010567957,0.0003170441,0.90277493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99316543,0.00010327928,0.0013260978,0.0023676227,0.0015896235,0.0014479634],"domain_scores_gemma":[0.9957384,0.00025420604,0.00075604394,0.0025414021,0.00029314897,0.00041679465],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031284343,0.0008820926,0.0009376013,0.0021097746,0.0006787038,0.0018519631,0.0030564528,0.000600848,0.00019175606],"category_scores_gemma":[0.000010296033,0.0010222907,0.00048752993,0.0007071364,0.0008394693,0.00066501304,0.0010687675,0.001931099,0.000105827945],"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.00008855914,0.0002621248,0.00013466639,0.00051883695,0.00023230529,0.0018035739,0.0015241432,0.057503905,0.0006309108,0.7757129,0.009572661,0.15201539],"study_design_scores_gemma":[0.0005362868,0.000038244125,0.000006886037,0.0013276546,0.000039496932,0.00001543695,0.000008471139,0.2576362,0.0002294113,0.018910868,0.7200443,0.0012067744],"about_ca_topic_score_codex":0.00000596353,"about_ca_topic_score_gemma":0.007590086,"teacher_disagreement_score":0.7568021,"about_ca_system_score_codex":0.0006094929,"about_ca_system_score_gemma":0.0005996026,"threshold_uncertainty_score":0.99922276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018323952,0.0016429132,0.6839652,0.00016512458,0.0024324965,0.0010426574,0.00004449252,0.00018832413,0.31051692],"genre_scores_gemma":[0.4548384,0.0003248946,0.26151207,0.03462265,0.011093404,0.0029495992,0.00009710322,0.0008783303,0.23368356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966678,0.000045928147,0.0007399241,0.0011923786,0.00034881345,0.0010051634],"domain_scores_gemma":[0.9975697,0.00026950383,0.00034646303,0.0013510318,0.0001703375,0.00029300072],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00038332937,0.00066779094,0.00096288783,0.000100346144,0.00011791857,0.0001471071,0.001928071,0.0017203484,0.000029804327],"category_scores_gemma":[0.000015080563,0.00068713917,0.0003616522,0.00004035533,0.00035821673,0.00009540111,0.00045934014,0.001179481,0.00007063157],"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.00005145473,0.000011202159,0.000002705415,0.000009762755,0.00004762316,0.00011228874,0.000017158232,0.00051041285,0.0000014952099,0.7957009,0.0014939099,0.20204109],"study_design_scores_gemma":[0.0021029334,0.0003981604,0.000012538581,0.00011787692,0.000045668352,0.00012763488,0.0000023124828,0.17055626,0.0000056733115,0.53304726,0.29274678,0.0008369037],"about_ca_topic_score_codex":0.00003474457,"about_ca_topic_score_gemma":0.0012660022,"teacher_disagreement_score":0.45483655,"about_ca_system_score_codex":0.00032735025,"about_ca_system_score_gemma":0.00030622174,"threshold_uncertainty_score":0.9995756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021669725,0.00085609907,0.97464067,0.00042660953,0.0018881306,0.00038662492,0.000021105767,0.000036067024,0.000074967036],"genre_scores_gemma":[0.9751067,0.003091353,0.021156624,0.00015923174,0.0004021627,0.00003963049,0.000020888834,0.000011874123,0.000011535848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974167,0.00009187423,0.001384817,0.0001803581,0.0006486139,0.00027765566],"domain_scores_gemma":[0.9953336,0.00054184144,0.0015417871,0.0003276959,0.002115132,0.00013996077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013003362,0.00019966252,0.00036270596,0.00021962347,0.00007748202,0.00018451238,0.0011260305,0.00018377254,0.000035226716],"category_scores_gemma":[0.000112358975,0.00015101997,0.00016644991,0.00024580694,0.00014412262,0.003694847,0.0002824841,0.00020341185,6.592044e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016895827,0.000064698266,0.0011726281,0.000017513054,0.000095332456,0.0000018160724,0.0002082714,0.23122197,0.0000116373485,0.0028003748,0.0008003044,0.7634365],"study_design_scores_gemma":[0.001568133,0.00021378508,0.0013762998,0.00019373427,0.000015557696,0.00006640344,0.00005023637,0.99134165,0.00018978654,0.00052338035,0.0042900643,0.00017097156],"about_ca_topic_score_codex":0.0000014320722,"about_ca_topic_score_gemma":0.0000054403167,"teacher_disagreement_score":0.95348406,"about_ca_system_score_codex":0.00013935767,"about_ca_system_score_gemma":0.00012529387,"threshold_uncertainty_score":0.6158415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039595142,0.010194847,0.934609,0.0005951905,0.0011552941,0.00023362532,5.7008623e-7,0.00038024876,0.013236099],"genre_scores_gemma":[0.9770227,0.0007263685,0.020042986,0.0010403172,0.00046502103,0.000026596836,0.0000019913348,0.000016095042,0.0006579222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855804,0.000064240354,0.00018860289,0.00033902167,0.00021926881,0.0006308062],"domain_scores_gemma":[0.9989248,0.00006547425,0.000060034516,0.00059362996,0.00003969636,0.00031636455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037175644,0.00018542497,0.00019947828,0.000040382536,0.000108145476,0.00014997266,0.0005661564,0.00014008686,0.00008836272],"category_scores_gemma":[0.000005592098,0.00015449405,0.00005049803,0.00034044363,0.000054546494,0.00077154825,0.00048605134,0.0002353359,0.000034610595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056113327,0.00005049309,0.003605608,0.0000077792365,0.000021008047,0.00000672262,0.0005598547,0.00031482775,0.0000063990265,0.11602023,0.010605029,0.8687964],"study_design_scores_gemma":[0.00070158805,0.00014108382,0.022355458,0.0000355781,0.0000202782,0.00012266081,0.00006670966,0.7988975,0.000132152,0.0015009023,0.17527275,0.00075335463],"about_ca_topic_score_codex":0.0000070990077,"about_ca_topic_score_gemma":0.00002288785,"teacher_disagreement_score":0.9374276,"about_ca_system_score_codex":0.000025157195,"about_ca_system_score_gemma":0.000025865538,"threshold_uncertainty_score":0.63000846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028003647,0.0009637465,0.99249357,0.0017848245,0.00021512694,0.0009203406,0.00002890291,0.0005043551,0.00028875878],"genre_scores_gemma":[0.31976002,0.0003074985,0.6788077,0.0003558286,0.00014453664,0.00027651413,0.00004923868,0.000035728695,0.00026294088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980856,0.00012229953,0.00045807014,0.0005242215,0.00019262977,0.0006171656],"domain_scores_gemma":[0.9958042,0.0011562483,0.00021232857,0.0023674616,0.00028664508,0.0001731335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044289292,0.00022615651,0.00029413888,0.000074555945,0.00042969515,0.0003705686,0.0036746238,0.000145226,0.000039609433],"category_scores_gemma":[0.00021958505,0.00017430476,0.00013874017,0.00060857553,0.0001259526,0.0013670734,0.0015781334,0.00014846958,0.000024119192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018502447,0.00094308396,0.016275948,0.000120176606,0.0005567976,0.000022815175,0.00039528962,0.0050911466,0.07130258,0.13086018,0.02467919,0.74956775],"study_design_scores_gemma":[0.0014605277,0.000031283886,0.00044047317,0.00013990312,0.000012432571,0.000008411678,0.0000036029173,0.98778236,0.00021615464,0.0017561857,0.007818398,0.00033029314],"about_ca_topic_score_codex":0.00001863012,"about_ca_topic_score_gemma":0.000057346242,"teacher_disagreement_score":0.98269117,"about_ca_system_score_codex":0.00018151307,"about_ca_system_score_gemma":0.00012798901,"threshold_uncertainty_score":0.7107942},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5892612,0.000061306026,0.40461352,0.00035290213,0.000086400185,0.00016379941,9.973522e-7,0.00004138956,0.0054184906],"genre_scores_gemma":[0.99562126,0.000015860775,0.0038518682,0.000047605863,0.0000148261215,0.000004691567,7.7893496e-8,0.0000026982482,0.00044109754],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994852,0.000039084374,0.000117957505,0.0001735421,0.00007834206,0.000105877014],"domain_scores_gemma":[0.9996055,0.000084426734,0.000045089255,0.00019068412,0.00004568317,0.000028639273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105558516,0.000051690386,0.000083138904,0.000044406203,0.000010878486,0.000019239687,0.00013562877,0.00003566648,0.000013851168],"category_scores_gemma":[0.000013069872,0.000035251487,0.000007444843,0.00029953636,0.000059451868,0.0002537201,0.00009160372,0.000024178138,0.000016349002],"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.00005257655,0.0002494193,0.0063337083,0.00003326253,0.000023704708,0.000019943687,0.0021187128,0.0018446345,0.42943552,0.020493219,0.003743129,0.53565216],"study_design_scores_gemma":[0.0034265327,0.0015523788,0.044574767,0.0002182221,0.000007457987,0.000010007327,0.0002526077,0.21164489,0.7126533,0.0047940407,0.020205941,0.00065985916],"about_ca_topic_score_codex":0.0000132821615,"about_ca_topic_score_gemma":0.0003205619,"teacher_disagreement_score":0.53499234,"about_ca_system_score_codex":0.000024506104,"about_ca_system_score_gemma":0.000013602723,"threshold_uncertainty_score":0.1437514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012944115,0.000016311891,0.98448765,0.0014458684,0.00020510699,0.0001507415,3.2172784e-7,0.00021673123,0.0005331217],"genre_scores_gemma":[0.9931574,0.000012700316,0.005745631,0.00042728955,0.00015358401,0.000042628355,0.0000013466779,0.000009471888,0.00044994472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835443,0.00013602972,0.00030279823,0.0005568835,0.00023699705,0.00041285547],"domain_scores_gemma":[0.9986534,0.00023310023,0.000093321636,0.0008392398,0.000068206245,0.00011273077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040277213,0.00016608613,0.0002588037,0.00031935953,0.000059612983,0.00010483901,0.0007078443,0.00017107416,0.00013443513],"category_scores_gemma":[0.000012436753,0.000114596136,0.00015556302,0.002479338,0.00003445954,0.0003705548,0.00013339426,0.00015779393,0.000060412836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001758435,0.000067499,0.0135729825,0.0000051569764,0.00014025398,0.000031711705,0.00004656856,0.03845768,0.0015176809,0.013020272,0.00058844587,0.93253416],"study_design_scores_gemma":[0.0004044255,0.000041426352,0.0031491683,0.00001898077,0.000026982016,0.0000011435988,0.000002935276,0.9919413,0.0031013207,0.00023096174,0.00088001305,0.00020138064],"about_ca_topic_score_codex":0.00008817185,"about_ca_topic_score_gemma":0.0055248286,"teacher_disagreement_score":0.9802133,"about_ca_system_score_codex":0.000103569626,"about_ca_system_score_gemma":0.000035652505,"threshold_uncertainty_score":0.46730947},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.068428e-7,0.0000973158,0.187808,0.000070448936,0.0010877193,0.00013476268,0.0000013005199,0.0008337329,0.8099661],"genre_scores_gemma":[0.00085866026,0.000019604182,0.04211775,0.00041123657,0.0009469884,0.000011881742,0.000005681139,0.00016441994,0.95546377],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998945,0.000025947562,0.00012119583,0.00043665082,0.00019320802,0.00027800992],"domain_scores_gemma":[0.99870926,0.000028828557,0.0001118574,0.0010583552,0.000010772637,0.000080923906],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013499074,0.00018321953,0.00018572027,0.00006906957,0.000026305022,0.00011989554,0.001299394,0.00039197228,0.0052650417],"category_scores_gemma":[0.0000065942295,0.0001607827,0.00005114605,0.00012751884,0.000024775049,0.000055087476,0.000464288,0.0004884745,0.0008970097],"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":[8.2204124e-8,0.000008499511,0.0000139913245,0.000007061037,0.000007826129,0.0000123872305,0.00002459723,7.4486906e-7,0.0000015457155,0.10525558,0.87893957,0.01572811],"study_design_scores_gemma":[0.000058066864,0.000006948179,0.000006442601,0.000029058432,0.0000024315564,0.000009929277,8.658608e-7,0.01586652,0.0000114768945,0.0013543824,0.98244286,0.00021101798],"about_ca_topic_score_codex":0.00029016176,"about_ca_topic_score_gemma":0.0010250021,"teacher_disagreement_score":0.14569026,"about_ca_system_score_codex":0.000010289642,"about_ca_system_score_gemma":0.000032409964,"threshold_uncertainty_score":0.9998809},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000250482,0.00025408858,0.99535835,0.0005738377,0.0015787933,0.00086612644,0.0000024710143,0.00071022805,0.00040565213],"genre_scores_gemma":[0.9621895,0.00003833427,0.033127263,0.0023286988,0.0008490587,0.00010385927,0.000008668113,0.000032454365,0.0013221578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703944,0.00007287233,0.0005166274,0.00092227024,0.00034498988,0.0011037958],"domain_scores_gemma":[0.99796325,0.00035013814,0.00020721182,0.0009775899,0.00021968933,0.00028212133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075343304,0.0003755545,0.00042660144,0.00024736478,0.00033276205,0.00029362,0.0015672568,0.0002494319,0.000013163623],"category_scores_gemma":[0.00007487665,0.00034315547,0.00024766457,0.0015270046,0.000027802134,0.0006407899,0.00021050476,0.00027391754,0.00002966196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024644007,0.00048543324,0.00011286316,0.00002347623,0.00007897872,0.000043309625,0.0007275629,0.84496635,0.000024085268,0.018442804,0.042025156,0.09304532],"study_design_scores_gemma":[0.00089425634,0.0001908761,0.0004898827,0.000036357338,0.000014488459,0.000014823871,0.00003770301,0.99630433,0.00030630807,0.00086072204,0.00040501254,0.0004452654],"about_ca_topic_score_codex":0.000053335232,"about_ca_topic_score_gemma":0.000071117545,"teacher_disagreement_score":0.96223104,"about_ca_system_score_codex":0.00009699058,"about_ca_system_score_gemma":0.000053404234,"threshold_uncertainty_score":0.99990207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04294084,0.000031076124,0.94988525,0.00072275463,0.00005670919,0.00055226625,0.000012095362,0.00009785428,0.005701154],"genre_scores_gemma":[0.9524076,0.000014812947,0.044801716,0.000015086113,0.0002144796,0.0000040750615,0.00001957602,0.000018837212,0.002503819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974323,0.00023064142,0.00013991998,0.0005893231,0.0008448936,0.0007629525],"domain_scores_gemma":[0.99774987,0.0006912901,0.00012955547,0.0007324448,0.00053766667,0.00015915709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011518829,0.00014986913,0.00030973193,0.00018376128,0.0005100839,0.00009961327,0.0015474161,0.00010019379,0.0000122092215],"category_scores_gemma":[0.000026670636,0.00015408803,0.000117088406,0.0010225588,0.0003435887,0.0004280267,0.00049084553,0.0004248232,0.00001264604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008529446,0.0007765381,0.0057269633,0.00012995659,0.00014969488,0.00044480112,0.0012878845,0.052297145,0.00043362338,0.6923842,0.04096786,0.20531602],"study_design_scores_gemma":[0.0009394746,0.0004405836,0.006048794,0.000053564047,0.000011294442,0.000007762217,0.00019994257,0.98139185,0.000055213575,0.0014884344,0.009166898,0.00019618674],"about_ca_topic_score_codex":0.00024134314,"about_ca_topic_score_gemma":0.0008437061,"teacher_disagreement_score":0.92909473,"about_ca_system_score_codex":0.00012934057,"about_ca_system_score_gemma":0.00013798676,"threshold_uncertainty_score":0.62835276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017486725,0.0008362047,0.97914815,0.0015275598,0.00030359483,0.00034295162,0.000001138165,0.00018023788,0.00017341897],"genre_scores_gemma":[0.73216593,0.000046700752,0.26554722,0.0015937719,0.00035513382,0.00017243752,0.0000051196553,0.000021874626,0.00009181949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980018,0.00009486546,0.0003767455,0.0006081842,0.00023010944,0.0006882959],"domain_scores_gemma":[0.9979869,0.0006893756,0.00009253363,0.0009917988,0.00007993175,0.00015943046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283516,0.00023584116,0.00022620792,0.00008025397,0.00017651034,0.00025879344,0.0015490975,0.00014982384,0.000042110245],"category_scores_gemma":[0.000014423706,0.000177351,0.000102429614,0.00042496578,0.000075850556,0.0004551839,0.00016764516,0.00022207423,0.000007385411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003610202,0.000094660085,0.00004054227,0.0000021287676,0.000006711412,0.000003861034,0.000060854964,0.672203,0.00006111342,0.0068856315,0.00018648068,0.3204189],"study_design_scores_gemma":[0.0009553693,0.00012349639,0.00013391778,0.000022123513,0.0000062989848,0.0000036579104,0.00003750092,0.99130154,0.00075195776,0.00003037585,0.0063827364,0.00025102746],"about_ca_topic_score_codex":0.000022506407,"about_ca_topic_score_gemma":0.0006351296,"teacher_disagreement_score":0.7146792,"about_ca_system_score_codex":0.000072612194,"about_ca_system_score_gemma":0.00008734371,"threshold_uncertainty_score":0.7232164},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55339396,0.00016631797,0.38479048,0.00047948945,0.00015245062,0.000632346,4.985501e-7,0.0001272961,0.060257174],"genre_scores_gemma":[0.9777911,0.000009649906,0.020262603,0.000115333794,0.000048226506,0.0000010332079,0.000008292613,0.000012988552,0.0017508056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985867,0.00011769011,0.00024040653,0.0004626891,0.00018906679,0.00040341515],"domain_scores_gemma":[0.99896127,0.000328376,0.00013520694,0.00044488916,0.000018461398,0.00011176881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015418307,0.00016357796,0.00039023542,0.00020421541,0.0001139634,0.00006923812,0.0011236907,0.000107048785,0.000019539866],"category_scores_gemma":[0.000007738216,0.00018638806,0.00011880121,0.0008633082,0.00004674919,0.0005651595,0.0006980346,0.00018783326,0.000011306297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034418158,0.00047551372,0.0054784054,0.000021640655,0.000037203354,0.000050243663,0.004047548,0.85246915,0.000039603616,0.12882072,0.0035582592,0.004657528],"study_design_scores_gemma":[0.0024013591,0.00004118328,0.0024899542,0.000070042195,0.000008132944,0.0000030587319,0.00021208313,0.99349153,0.000029200151,0.000071620554,0.0009744287,0.00020737732],"about_ca_topic_score_codex":0.00054459024,"about_ca_topic_score_gemma":0.0001496028,"teacher_disagreement_score":0.42439714,"about_ca_system_score_codex":0.000041093972,"about_ca_system_score_gemma":0.00006552334,"threshold_uncertainty_score":0.7600684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004921358,0.001991973,0.9827457,0.000076919896,0.0007183836,0.0009919809,0.0000011213693,0.00036455804,0.012617224],"genre_scores_gemma":[0.32159486,0.0005030163,0.64026666,0.002592463,0.00031059727,0.001869359,0.000008272952,0.00006696291,0.032787807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809235,0.000057755882,0.00031000594,0.0006244896,0.00021185975,0.00070356485],"domain_scores_gemma":[0.99837935,0.00018542171,0.00008421081,0.0010376096,0.00012161441,0.00019177265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048200882,0.00022383271,0.0002571412,0.00005395907,0.00017407416,0.00019025424,0.0009253932,0.00015256755,0.00008442191],"category_scores_gemma":[0.000027473503,0.00019903306,0.00013909588,0.00038021206,0.000032091833,0.00047091566,0.00015667555,0.0001468919,0.00003781901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007408827,0.000072434246,0.000016809447,0.000007690142,0.000017212948,0.0000029832506,0.000120522345,0.77176636,0.000025378624,0.12815021,0.054960456,0.044852503],"study_design_scores_gemma":[0.0005107579,0.00010122146,0.0000032189544,0.000007309675,0.0000063166726,0.0000067279575,0.000010044204,0.90665066,0.00014876017,0.006361374,0.08594459,0.00024899273],"about_ca_topic_score_codex":0.000001088506,"about_ca_topic_score_gemma":0.000026037278,"teacher_disagreement_score":0.34247905,"about_ca_system_score_codex":0.000056620578,"about_ca_system_score_gemma":0.00010633369,"threshold_uncertainty_score":0.8116333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008289777,0.000003970604,0.9779522,0.0017122214,0.00013481153,0.0004926166,4.1170287e-7,0.00020564737,0.011208338],"genre_scores_gemma":[0.9350979,8.409293e-7,0.05895798,0.00466617,0.00021590551,0.00004089573,0.000008127368,0.000005044677,0.0010071796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913067,0.000011188809,0.00017415156,0.00027817566,0.00016600847,0.0002397979],"domain_scores_gemma":[0.9993966,0.000056795743,0.00006186217,0.00039974347,0.00003976053,0.00004522725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026548505,0.00009881746,0.00008400858,0.00003681396,0.00009867004,0.000100018566,0.00033953556,0.000043350447,0.00003334829],"category_scores_gemma":[0.000007810911,0.00008574542,0.000035211855,0.000112482056,0.000004746942,0.00024935912,0.000027334703,0.00006281777,0.00007332119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013968104,0.000048840368,0.000031144707,0.0000059778617,0.0000021444152,6.97213e-7,0.000045345776,0.028560905,0.0018609191,0.011542002,0.0025139647,0.9553741],"study_design_scores_gemma":[0.00035187515,0.00094269513,0.00054114475,0.000015208869,0.0000015396993,3.3577237e-7,9.081256e-7,0.9879317,0.008141117,0.00021081498,0.0017505066,0.00011211522],"about_ca_topic_score_codex":0.0000014690638,"about_ca_topic_score_gemma":6.681351e-7,"teacher_disagreement_score":0.95937085,"about_ca_system_score_codex":0.000046006033,"about_ca_system_score_gemma":0.000026341833,"threshold_uncertainty_score":0.34965968},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.131421e-8,0.5800666,0.41808742,0.000043251337,0.00007783063,0.001288102,0.0000012257411,0.000060796097,0.00037469604],"genre_scores_gemma":[0.0000022087645,0.96628,0.031976636,0.0008752573,0.00025484152,0.0002717019,0.000042836797,0.000034591172,0.00026195563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971805,0.00018626684,0.0011652618,0.0008246133,0.00024007111,0.0004032793],"domain_scores_gemma":[0.9970803,0.00053134986,0.00083153445,0.0011803623,0.00024786533,0.00012855948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014832256,0.00043282897,0.0018971162,0.00009383412,0.00009615199,0.00018488293,0.0012676567,0.0003731274,0.000008871231],"category_scores_gemma":[0.000085864864,0.00034701795,0.00042542367,0.00065171527,0.00006995563,0.0002751186,0.00032271337,0.0003433622,0.000003480849],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.2259896e-7,0.000014935796,2.0340103e-7,0.0557909,0.00003411387,6.8010155e-7,0.0000054649577,0.00005158816,2.0173795e-8,0.022543803,0.0022974147,0.91926],"study_design_scores_gemma":[0.000097110555,0.000050269657,3.2659554e-7,0.13727804,0.00016811628,0.000024836145,3.5100328e-7,0.063428186,3.093248e-7,0.00009002567,0.7985646,0.00029782404],"about_ca_topic_score_codex":0.000003561364,"about_ca_topic_score_gemma":0.000002149683,"teacher_disagreement_score":0.91896224,"about_ca_system_score_codex":0.000056793586,"about_ca_system_score_gemma":0.00018088733,"threshold_uncertainty_score":0.9998982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1199877,0.000019638881,0.87278485,0.0009954042,0.00037249742,0.00011788132,1.2029626e-7,0.00018071894,0.0055411803],"genre_scores_gemma":[0.9788523,0.00002188447,0.019268217,0.00079569477,0.0001392152,0.000016636477,1.742063e-7,0.000010794367,0.00089511054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987258,0.00006657267,0.00020349817,0.00041977738,0.00017915596,0.00040525215],"domain_scores_gemma":[0.9988356,0.00037812,0.000045500205,0.0006226941,0.00002739714,0.00009066247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002777104,0.00012707147,0.00014290072,0.00007340464,0.000038775983,0.00006492708,0.00062461133,0.00009116405,0.000069113106],"category_scores_gemma":[0.00002306447,0.00008132722,0.00003950706,0.00033310542,0.000027450664,0.00025899537,0.00019000033,0.00013810459,0.00021110273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015548752,0.0000787978,0.0028362684,0.0000030397987,0.000008235348,0.000074235926,0.000053296568,0.0564927,0.0005330563,0.5927343,0.0012757485,0.34589478],"study_design_scores_gemma":[0.0005684221,0.00006349024,0.0017696699,0.0001195157,7.922944e-7,0.0000072087614,0.0000041867966,0.9934473,0.0007099358,0.0026705146,0.00041745036,0.00022152938],"about_ca_topic_score_codex":0.0000146667235,"about_ca_topic_score_gemma":0.000042472908,"teacher_disagreement_score":0.93695456,"about_ca_system_score_codex":0.000060465347,"about_ca_system_score_gemma":0.0000227053,"threshold_uncertainty_score":0.33164278},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018478506,0.000015421041,0.99067354,0.0017862943,0.00033678673,0.0009224046,6.5147965e-8,0.00032278633,0.0040948787],"genre_scores_gemma":[0.8968489,0.000004161041,0.10066107,0.0017684447,0.00012730014,0.00019830251,2.5168814e-7,0.000011998436,0.00037956572],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733984,0.00022736187,0.00037808064,0.0007083503,0.0007332882,0.0006130985],"domain_scores_gemma":[0.9974927,0.00018116423,0.00004695948,0.0013784969,0.00044336464,0.00045735206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015600817,0.00020346853,0.00025399338,0.000054461176,0.00009685038,0.00030520483,0.0012837931,0.000107626314,0.00034202528],"category_scores_gemma":[0.0000961541,0.00016285745,0.00008353815,0.00065576134,0.000041667005,0.00045347272,0.0004657353,0.00020821019,0.0007120553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019218998,0.00034502175,0.001087479,0.000012888698,0.00006530522,0.000013635826,0.00019928823,0.14272904,0.00032098973,0.20459501,0.38953805,0.26107407],"study_design_scores_gemma":[0.0001280675,0.000107279055,0.004777856,0.000013125281,0.000005278038,0.0000026747502,0.000005041218,0.9916891,0.00019537809,0.0019292833,0.0009179117,0.0002290402],"about_ca_topic_score_codex":0.00013262658,"about_ca_topic_score_gemma":0.000018156288,"teacher_disagreement_score":0.89500105,"about_ca_system_score_codex":0.00020098146,"about_ca_system_score_gemma":0.000081137754,"threshold_uncertainty_score":0.9152268},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028839977,0.000010979499,0.96970135,0.000091512025,0.00049323624,0.0005418898,0.0000014772016,0.000119924865,0.0001996788],"genre_scores_gemma":[0.97039473,0.0000013816439,0.029340096,0.000029660823,0.000054793687,0.00006440622,0.000007626997,0.000008420298,0.0000989004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891776,0.0000678972,0.00036152845,0.00029165574,0.00020314945,0.00015803464],"domain_scores_gemma":[0.9990172,0.00024769182,0.00017964515,0.0003120233,0.00020215419,0.00004130898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037828006,0.00009221618,0.0001302802,0.00015064386,0.00004156359,0.0000275102,0.00023103956,0.00008471462,0.000007335004],"category_scores_gemma":[0.00004228288,0.00006743108,0.000033723547,0.0004635785,0.00002192425,0.0006141917,0.000050625204,0.00002429689,0.0000060174775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019165236,0.000011826399,0.0027311754,0.000038544487,0.0000035434116,1.2657597e-7,0.000061696664,0.94973767,0.0007050862,0.0330664,0.000041407762,0.01358336],"study_design_scores_gemma":[0.0007401523,0.000071557006,0.0022852197,0.00012423277,0.0000044366175,3.895419e-7,0.000010513374,0.9937344,0.0023760002,0.00050887803,0.000054064207,0.000090151814],"about_ca_topic_score_codex":0.000009839743,"about_ca_topic_score_gemma":0.000007642795,"teacher_disagreement_score":0.9415547,"about_ca_system_score_codex":0.00011484403,"about_ca_system_score_gemma":0.00003781074,"threshold_uncertainty_score":0.27497596},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013912723,0.00016072797,0.9938251,0.0014386551,0.00056828867,0.001542726,0.00006289289,0.000077905104,0.0023098297],"genre_scores_gemma":[0.0057903538,0.00006025509,0.99331754,0.0002085637,0.00026165726,0.00019011143,0.000026294358,0.000019308185,0.00012591408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987303,0.000010433165,0.00056502095,0.00018656415,0.00023317375,0.00027449813],"domain_scores_gemma":[0.99812514,0.0005208783,0.0004235134,0.0006724977,0.00020283683,0.000055158194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040524759,0.0002601292,0.0003337538,0.000129371,0.00069480814,0.00021491668,0.0019545779,0.00024235912,0.0000011739672],"category_scores_gemma":[0.000059135316,0.00018873464,0.00019922745,0.00012969683,0.00033968946,0.0004264119,0.0006567024,0.0002711345,9.4999626e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005775719,0.00001590552,9.876047e-7,0.00031023627,0.000084202715,8.145714e-8,0.0005790466,0.20903538,0.000011208306,0.7417684,0.00023760412,0.04795117],"study_design_scores_gemma":[0.00033058744,0.00017543395,0.000009808179,0.00036122126,0.000039370687,0.000015158432,8.329128e-7,0.86505383,0.00010212343,0.011058112,0.1225017,0.00035179904],"about_ca_topic_score_codex":0.000004890953,"about_ca_topic_score_gemma":0.000021114423,"teacher_disagreement_score":0.73071027,"about_ca_system_score_codex":0.00007219493,"about_ca_system_score_gemma":0.0001746344,"threshold_uncertainty_score":0.7696376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2996085,0.00055972626,0.6837564,0.0014553128,0.00073853316,0.00085584685,0.000010055646,0.000527738,0.0124878865],"genre_scores_gemma":[0.9691552,0.000007741194,0.029969733,0.00037602527,0.00010207576,0.000023348528,8.686229e-7,0.000014060074,0.00035094688],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829626,0.00009269242,0.00042216893,0.00052254857,0.000262624,0.00040369504],"domain_scores_gemma":[0.9983206,0.00060948555,0.00016232178,0.0006852752,0.000060974657,0.00016137671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037157827,0.00018906199,0.0002784432,0.00005078864,0.000079013684,0.00006546857,0.0004501581,0.000085112406,0.000058175658],"category_scores_gemma":[0.000040301187,0.00013364057,0.000053139695,0.00023224571,0.00016169043,0.0003151363,0.0003888282,0.00008170307,0.000010645816],"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.0011463375,0.0012369109,0.019495329,0.00016130136,0.00030378718,0.00043353206,0.0022308792,0.004370433,0.37301317,0.2201015,0.16050866,0.21699816],"study_design_scores_gemma":[0.010032008,0.0006439981,0.0029128669,0.0009270534,0.000018330882,0.00007390704,0.000075997756,0.6047077,0.3741165,0.0012536847,0.0042201793,0.0010177341],"about_ca_topic_score_codex":0.000049138718,"about_ca_topic_score_gemma":0.00004173322,"teacher_disagreement_score":0.6695467,"about_ca_system_score_codex":0.00004346651,"about_ca_system_score_gemma":0.00009949342,"threshold_uncertainty_score":0.54497045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009652119,0.00007662432,0.98749024,0.0010250268,0.00016282198,0.0006804068,0.0000012332268,0.000050068,0.00086147094],"genre_scores_gemma":[0.9823404,0.000053220174,0.017210046,0.00007477387,0.000039607206,0.00023705345,0.0000017849499,0.000008666747,0.000034438523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986172,0.00021499807,0.00033889897,0.00024977318,0.0003401778,0.00023895394],"domain_scores_gemma":[0.9975257,0.00073198363,0.00013209248,0.0012212243,0.0003424931,0.00004651461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002567918,0.0000936936,0.00016072285,0.00007659502,0.00006243915,0.000027353772,0.0010876653,0.000071167255,0.000010081464],"category_scores_gemma":[0.000115657305,0.00006902803,0.000050392704,0.00026333114,0.00003683775,0.0003923052,0.0003526214,0.00007447326,0.0000034573916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009718002,0.00018128176,0.00045063786,0.0000084322,0.000025843576,1.8897794e-7,0.0005070614,0.007292769,0.0011249232,0.26114145,0.00034716868,0.7289105],"study_design_scores_gemma":[0.0009914767,0.000031905023,0.001503751,0.00009600894,0.000011436826,9.127606e-7,0.000019152245,0.9914314,0.00034381275,0.0054331217,0.000039273575,0.00009771217],"about_ca_topic_score_codex":0.000055402474,"about_ca_topic_score_gemma":0.0005809691,"teacher_disagreement_score":0.98413867,"about_ca_system_score_codex":0.000105247964,"about_ca_system_score_gemma":0.000079244855,"threshold_uncertainty_score":0.28148812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4069706,0.00007136388,0.59173244,0.000040703824,0.00022708828,0.0006658003,3.5338866e-7,0.00005756477,0.00023412821],"genre_scores_gemma":[0.99910605,0.000014754689,0.00058366463,0.000024381532,0.000058306774,0.00006417766,6.106472e-7,0.000009972673,0.00013808724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980956,0.00021415207,0.00059243786,0.0004522934,0.00034859497,0.00029694237],"domain_scores_gemma":[0.9986037,0.00044955866,0.0002104832,0.0005822573,0.00007482826,0.000079187776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056879607,0.00016610356,0.00037790777,0.00010267349,0.00004603493,0.000081760685,0.000435144,0.00007380326,0.000010114566],"category_scores_gemma":[0.0000104430865,0.00011619807,0.000022054237,0.000339033,0.000029857176,0.0003214662,0.00032080934,0.00008671578,0.0000056724243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045022392,0.0005873453,0.10016995,0.000025484665,0.000036321075,0.000006408314,0.0012409894,0.873827,0.000080870326,0.010376362,0.00046544755,0.013138795],"study_design_scores_gemma":[0.0016216917,0.00028106524,0.010127555,0.00012252606,0.000006672197,0.0000010574611,0.00031307718,0.9872406,0.000027916769,0.000020719059,0.00008192393,0.00015519143],"about_ca_topic_score_codex":0.0003029795,"about_ca_topic_score_gemma":0.00045835855,"teacher_disagreement_score":0.5921355,"about_ca_system_score_codex":0.00007675257,"about_ca_system_score_gemma":0.00002047562,"threshold_uncertainty_score":0.47384197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017951578,0.012916855,0.96566427,0.00022925544,0.0003373214,0.001723155,0.000007150565,0.00021468133,0.0009557516],"genre_scores_gemma":[0.96968585,0.0009867869,0.02766998,0.000065262524,0.00013447437,0.000925286,0.000015808846,0.000035686717,0.00048088047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982517,0.00016316258,0.00042757165,0.0005144463,0.0002094393,0.00043367708],"domain_scores_gemma":[0.99507,0.0004577051,0.0007336367,0.0034203148,0.00020426033,0.000114092865],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008557087,0.0002510237,0.00039108272,0.000055759323,0.0011655879,0.0015047952,0.0023693612,0.00012485821,9.185047e-7],"category_scores_gemma":[0.00004723402,0.00021148231,0.00006245085,0.00013111599,0.00018290435,0.001759914,0.0008439482,0.0002652374,0.00000419784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006581642,0.00057620544,0.043808755,0.00033497676,0.0008893177,0.00001710578,0.004824118,0.022188593,0.00047876057,0.22142226,0.003175433,0.7016263],"study_design_scores_gemma":[0.0010877596,0.00046522944,0.004980304,0.00042039258,0.000026766875,0.000041146955,0.00041014055,0.95535785,0.000060961447,0.00012940315,0.036549464,0.0004705668],"about_ca_topic_score_codex":0.00007527403,"about_ca_topic_score_gemma":0.00014142453,"teacher_disagreement_score":0.95173424,"about_ca_system_score_codex":0.00007671567,"about_ca_system_score_gemma":0.000073338255,"threshold_uncertainty_score":0.99953175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006595408,0.000001155718,0.9860682,0.0014385077,0.00006417352,0.008332205,0.0000043073182,0.00036112597,0.003664397],"genre_scores_gemma":[0.6663486,0.0000015117603,0.30146605,0.0010446969,0.00018282462,0.023376474,0.0000015662825,0.000031510142,0.007546795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985657,0.000028944132,0.00027546403,0.00045619134,0.00019266477,0.0004810336],"domain_scores_gemma":[0.9986732,0.00026668486,0.00010522841,0.0007294678,0.00008208414,0.00014333994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926409,0.00014549168,0.00016507391,0.00003919572,0.0001166619,0.00014380294,0.00080998277,0.000054577627,0.00001898843],"category_scores_gemma":[0.00008912951,0.00009384213,0.00007363619,0.00011570375,0.00002856473,0.00045333582,0.00027895736,0.00005367137,0.000032283915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076061933,0.00003389077,0.00029010125,0.000018124905,0.000010293035,0.000004533832,0.00013577488,0.0002677567,0.00085337803,0.7539062,0.009681588,0.23479077],"study_design_scores_gemma":[0.00046787038,0.000048206017,0.000022776569,0.00009378003,0.0000026758794,0.000005296079,0.0000033240485,0.97468156,0.000251385,0.021820983,0.0024189176,0.0001832201],"about_ca_topic_score_codex":0.000002438968,"about_ca_topic_score_gemma":0.000004913434,"teacher_disagreement_score":0.9744138,"about_ca_system_score_codex":0.000054989607,"about_ca_system_score_gemma":0.00013024698,"threshold_uncertainty_score":0.3826771},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022632167,0.000042003147,0.9734224,0.0003385086,0.0005580308,0.00047035763,6.341775e-7,0.00041640416,0.0021195156],"genre_scores_gemma":[0.80460334,0.0000059839886,0.19398117,0.0006663643,0.00046548017,0.000025269726,0.0000029294765,0.00001863907,0.00023083619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779946,0.000045704353,0.00040092118,0.00058284233,0.00024804528,0.0009230523],"domain_scores_gemma":[0.9979104,0.0009836657,0.0000864429,0.00065419875,0.00010708637,0.00025824222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011840675,0.00019752698,0.00022335557,0.00010910552,0.00023425993,0.00016864503,0.00081475585,0.00016342322,0.000013600988],"category_scores_gemma":[0.00004271882,0.00017547843,0.0001579947,0.00052256417,0.00008824166,0.00022101395,0.00029233174,0.00031293617,0.000013586061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054184682,0.00016818974,0.010238318,0.000016914053,0.000056569785,0.00006434612,0.00023807166,0.0087151425,0.0002512514,0.45133373,0.000914904,0.5279484],"study_design_scores_gemma":[0.00048988,0.00007301148,0.005693808,0.000017287997,0.000005971988,0.00002554121,0.000020438627,0.9908062,0.00017432506,0.0005945195,0.0018479774,0.00025103646],"about_ca_topic_score_codex":0.000030532545,"about_ca_topic_score_gemma":0.00007495367,"teacher_disagreement_score":0.98209107,"about_ca_system_score_codex":0.000027611653,"about_ca_system_score_gemma":0.000022404332,"threshold_uncertainty_score":0.7155803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7535762,0.0000334894,0.23785275,0.00018592714,0.0005283164,0.0006320685,0.000003132916,0.00003968973,0.0071484176],"genre_scores_gemma":[0.9933946,0.0000142019235,0.0055506877,0.00008146899,0.00009122494,0.000082878825,0.0000034809643,0.0000062470453,0.0007752247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988214,0.000035230634,0.00019973409,0.00025660114,0.00048723945,0.00019981863],"domain_scores_gemma":[0.99829715,0.00009183513,0.00020541238,0.0011293369,0.00022533866,0.00005090927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069445535,0.00010074111,0.00014672814,0.000025851821,0.0001683475,0.00011299222,0.0010604488,0.000054339773,0.00005763082],"category_scores_gemma":[0.00005820065,0.000079430974,0.00004915294,0.000028869252,0.000040692437,0.00043871076,0.00024629897,0.000054824173,0.000016450495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006533836,0.00034033984,0.056978792,0.00016456959,0.0001010283,0.0000011257297,0.00058199634,0.013018382,0.0019068319,0.04968748,0.025716593,0.8514375],"study_design_scores_gemma":[0.0005726997,0.00007497528,0.19299741,0.000018731474,0.000015081493,7.913627e-7,0.0000012846301,0.8025366,0.0021734182,0.0006047343,0.0009183789,0.00008586797],"about_ca_topic_score_codex":0.000033078893,"about_ca_topic_score_gemma":0.00009759482,"teacher_disagreement_score":0.8513517,"about_ca_system_score_codex":0.000044379416,"about_ca_system_score_gemma":0.00004572239,"threshold_uncertainty_score":0.32391012},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051428154,0.00017248311,0.9414504,0.0005705412,0.0032230641,0.0004145132,0.0000028405793,0.00006374463,0.002674257],"genre_scores_gemma":[0.8840669,0.000009829674,0.113327846,0.0007387042,0.00033010848,0.000025058878,0.0000013737231,0.000039414215,0.0014607973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693877,0.00013052365,0.001073008,0.0005332802,0.00067915424,0.0006452771],"domain_scores_gemma":[0.9952064,0.0004007513,0.0024175022,0.0010918154,0.00061748194,0.00026606198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016930061,0.00037571357,0.00069472403,0.00026627228,0.00018773455,0.0007238921,0.0051766643,0.00017926672,0.000098738106],"category_scores_gemma":[0.00024574323,0.00033619697,0.0004894175,0.00009743543,0.00025003756,0.0021363718,0.0005220321,0.0008232166,0.000017852703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065909275,0.0021997574,0.004987285,0.001108288,0.0035124568,0.0014271609,0.05101657,0.013611084,0.05808513,0.09201496,0.2124749,0.5529715],"study_design_scores_gemma":[0.0028926157,0.0011415485,0.00011429159,0.0011017446,0.00006481889,0.00026745096,0.00004022039,0.8915987,0.091685556,0.007579787,0.0030917786,0.00042147934],"about_ca_topic_score_codex":0.0006191256,"about_ca_topic_score_gemma":0.00001758068,"teacher_disagreement_score":0.8779876,"about_ca_system_score_codex":0.00016249572,"about_ca_system_score_gemma":0.00019990522,"threshold_uncertainty_score":0.999909},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51522475,0.0013249303,0.4665879,0.00071491714,0.0005527091,0.0015498819,0.0000017132627,0.00044794445,0.013595235],"genre_scores_gemma":[0.97694504,0.00010723247,0.021959068,0.00023107798,0.00006967684,0.00025136175,0.0000013245658,0.000014890249,0.0004203271],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99756515,0.00012518292,0.00036274095,0.00097314536,0.0003244958,0.00064929825],"domain_scores_gemma":[0.9951778,0.00014428112,0.0001803576,0.004177151,0.00010058097,0.00021980345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009839229,0.00025401346,0.00034536142,0.00004908973,0.00034241885,0.00055259466,0.0026683803,0.00015708899,0.000110847715],"category_scores_gemma":[0.000051259965,0.00019672049,0.000073318035,0.00025365927,0.0003211096,0.0011547605,0.0008816847,0.00041252974,0.000042902902],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008664325,0.0006497878,0.22748923,0.00002893817,0.000022263355,0.000072993054,0.0003558657,0.028188642,0.00001605425,0.0040450227,0.0011112904,0.7379333],"study_design_scores_gemma":[0.0011498169,0.00042701737,0.56427145,0.00005955655,0.0000053629196,0.000018126615,0.000030721152,0.42060748,0.000108528635,0.001672424,0.011097825,0.0005517114],"about_ca_topic_score_codex":0.00010226615,"about_ca_topic_score_gemma":0.003679811,"teacher_disagreement_score":0.7373816,"about_ca_system_score_codex":0.00012625882,"about_ca_system_score_gemma":0.00009846344,"threshold_uncertainty_score":0.8022028},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047955018,0.000010764192,0.93113667,0.00018178215,0.00012825143,0.00009970927,3.054197e-8,0.00006574322,0.02042201],"genre_scores_gemma":[0.98319566,0.0000010084357,0.016172335,0.0003766189,0.000035758552,0.000005713103,5.85625e-7,0.0000025603458,0.00020978441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993907,0.000055743174,0.00013373463,0.00017894352,0.0000934544,0.00014742628],"domain_scores_gemma":[0.99951607,0.00014818755,0.000019868226,0.00028238088,0.0000092602795,0.00002425889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029046825,0.000047795973,0.000069209535,0.00006894218,0.000008578078,0.00003453225,0.00028307774,0.000038454145,0.00004000709],"category_scores_gemma":[0.000023449149,0.000044438657,0.00000861252,0.00029115973,0.0000064064775,0.00022102939,0.00008807846,0.00007295821,0.00008447351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013500924,0.000023479739,0.012854849,0.0000019135107,3.8223428e-7,0.0000028836405,0.00014115745,0.8051065,0.000013253126,0.038120106,0.00020095742,0.14353317],"study_design_scores_gemma":[0.00017841597,0.000015745642,0.03013733,0.0000056778586,1.2182177e-7,3.5573316e-7,0.0000011143075,0.963329,0.000018257035,0.0023554575,0.003902727,0.000055751076],"about_ca_topic_score_codex":0.000095734125,"about_ca_topic_score_gemma":0.0005434638,"teacher_disagreement_score":0.9352406,"about_ca_system_score_codex":0.000024305347,"about_ca_system_score_gemma":0.000008612393,"threshold_uncertainty_score":0.18121558},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3218811,0.0073724915,0.31312218,0.004972528,0.0046475837,0.10932078,0.00020090642,0.000067745976,0.23841469],"genre_scores_gemma":[0.114181004,0.00026261123,0.6105859,0.0003165193,0.0013611665,0.022457153,0.00070079253,0.0002446944,0.2498901],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99632937,0.00028226557,0.0006826156,0.0013024061,0.0005079446,0.0008953817],"domain_scores_gemma":[0.9976069,0.00013574224,0.00057515455,0.0011031013,0.0002568196,0.00032231282],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00075291685,0.00060915446,0.0006111126,0.00011381142,0.00045831446,0.002220746,0.004327654,0.00069253973,0.0042533004],"category_scores_gemma":[0.00007598441,0.00065302843,0.00020696245,0.00047039404,0.00010669787,0.0010236391,0.0007543933,0.00080918585,0.0027638944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100716854,0.00038349256,0.0004678713,0.0001456625,0.000077395925,0.00032689326,0.00980903,0.006066975,0.0005118446,0.003897201,0.0007822717,0.97743064],"study_design_scores_gemma":[0.0046990677,0.0012383859,0.013722744,0.008089686,0.0002895533,0.00025826736,0.0053174873,0.114989825,0.02786033,0.008144239,0.81179297,0.0035974546],"about_ca_topic_score_codex":0.0007978299,"about_ca_topic_score_gemma":0.0067964154,"teacher_disagreement_score":0.9738332,"about_ca_system_score_codex":0.0004847827,"about_ca_system_score_gemma":0.0034631924,"threshold_uncertainty_score":0.9995921},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076338515,0.001533345,0.91725194,0.0033662857,0.0002923471,0.00024553243,0.0000060442167,0.000044266446,0.00092169864],"genre_scores_gemma":[0.9544927,0.00025100887,0.04489468,0.00014510447,0.00014407367,0.000020906833,0.000005436169,0.000009500709,0.000036620273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703795,0.00036543395,0.00095382234,0.0001490863,0.001232897,0.00026082038],"domain_scores_gemma":[0.9956918,0.00051701505,0.00089916296,0.0005748932,0.002178708,0.00013843388],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002945126,0.0001404131,0.00022850253,0.0002790606,0.00026470682,0.0010491076,0.0020889202,0.00007253978,0.0000038604167],"category_scores_gemma":[0.00016285255,0.00012155799,0.00004839472,0.0004455845,0.00013605546,0.00282987,0.00042012671,0.0005834169,0.000016575694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022095011,0.00043291823,0.004735062,0.00003841629,0.0008135719,0.0001267716,0.024839437,0.08359061,0.0014111119,0.41884255,0.0021089083,0.4628397],"study_design_scores_gemma":[0.007967478,0.0006953453,0.0014423986,0.003898633,0.000028111961,0.0055649495,0.01129075,0.93843925,0.0017753479,0.0052944543,0.022795323,0.000807939],"about_ca_topic_score_codex":0.00020215243,"about_ca_topic_score_gemma":0.000016579235,"teacher_disagreement_score":0.87815416,"about_ca_system_score_codex":0.00028594537,"about_ca_system_score_gemma":0.00021083896,"threshold_uncertainty_score":0.9999879},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65357786,0.019646015,0.24962443,0.0009155495,0.0015727248,0.00097381644,0.000100602025,0.00035190306,0.07323708],"genre_scores_gemma":[0.94371,0.0042613484,0.027480664,0.00032784912,0.00024457273,0.00019197639,0.0015075319,0.00006704222,0.022208998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954098,0.0012018515,0.0006667414,0.0009901208,0.00095882034,0.00077268935],"domain_scores_gemma":[0.9971437,0.00056350173,0.0007994716,0.0006765926,0.00042794258,0.00038878166],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009808877,0.0006768351,0.00049457664,0.00032138685,0.0044031627,0.00040316142,0.00097344577,0.0008373323,0.00003382193],"category_scores_gemma":[0.00008669198,0.00085492776,0.00035238912,0.000473025,0.00048488914,0.00110244,0.0002818436,0.0008562,0.000030285253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00027531997,0.0004273649,0.010370245,0.00018158738,0.00022873601,0.0013003696,0.057055295,0.6514751,0.018187724,0.24999818,0.0016092455,0.008890877],"study_design_scores_gemma":[0.0035302546,0.0004386402,0.23611827,0.0015048594,0.00075792125,0.002356276,0.03257699,0.57581204,0.019918393,0.0038024187,0.120906584,0.0022773482],"about_ca_topic_score_codex":0.050277986,"about_ca_topic_score_gemma":0.02151493,"teacher_disagreement_score":0.29013214,"about_ca_system_score_codex":0.011974478,"about_ca_system_score_gemma":0.005898507,"threshold_uncertainty_score":0.99973714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8370222,0.0058671613,0.14857681,0.006204131,0.00028949667,0.0011384673,0.0000013230454,0.0006571898,0.00024324463],"genre_scores_gemma":[0.86754733,0.00018657216,0.13164133,0.00009825727,0.00012930235,0.00020545913,7.4878795e-7,0.000029636867,0.00016134008],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757934,0.000018920522,0.0006197129,0.000728542,0.00040969418,0.0006438064],"domain_scores_gemma":[0.9985,0.00008864073,0.00040051993,0.0006400456,0.000248662,0.00012213441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094261573,0.00033706558,0.00049973687,0.00031237587,0.0004128888,0.00017456054,0.002754172,0.00048815078,0.0000058712226],"category_scores_gemma":[0.00008891873,0.00021821326,0.00005971371,0.0019349594,0.00091470085,0.0004532576,0.0009954183,0.00086710055,0.000017925991],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009946415,0.00013486262,0.0072047887,0.00007577671,0.0002865615,0.0000070429246,0.015783273,0.0026327758,0.0020706444,0.05003819,0.0016873213,0.9199793],"study_design_scores_gemma":[0.01791325,0.004755359,0.006656517,0.0020197474,0.00046976685,0.0010721688,0.0145435175,0.096128754,0.1817023,0.28835982,0.38165775,0.004721036],"about_ca_topic_score_codex":0.000012729689,"about_ca_topic_score_gemma":0.00004412993,"teacher_disagreement_score":0.9152583,"about_ca_system_score_codex":0.00013169437,"about_ca_system_score_gemma":0.00026514672,"threshold_uncertainty_score":0.8898478},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4209739,0.000010229806,0.56384647,0.0005140916,0.00027706116,0.00031535985,6.8370707e-7,0.00012358044,0.01393866],"genre_scores_gemma":[0.9850309,0.000005843801,0.014598831,0.00024472462,0.00003325316,0.0000128155525,0.0000020190992,0.000006732327,0.00006489312],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882936,0.000046404242,0.00027046195,0.00032152937,0.00027999692,0.00025221377],"domain_scores_gemma":[0.99845374,0.00009271041,0.00023368311,0.0010886156,0.00008150067,0.000049766426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005158373,0.000119284196,0.00015716099,0.000075977645,0.00016089877,0.00014896985,0.0012213524,0.000068148394,0.00000899922],"category_scores_gemma":[0.000090877875,0.00010866952,0.00003583572,0.00015864718,0.000032082076,0.0005661233,0.00021373495,0.00012857516,0.000010634729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056919227,0.0002811947,0.39774808,0.00008034971,0.000010620033,0.000017016742,0.00051510456,0.23172414,0.0005927134,0.016912714,0.00018419082,0.35187694],"study_design_scores_gemma":[0.0004451686,0.00006597662,0.18086201,0.00017560658,0.000001077448,4.9297563e-7,0.0000062020076,0.81629056,0.0019982182,0.00002156194,0.000033815017,0.000099310164],"about_ca_topic_score_codex":0.0003151315,"about_ca_topic_score_gemma":0.00023041846,"teacher_disagreement_score":0.5845664,"about_ca_system_score_codex":0.00007170015,"about_ca_system_score_gemma":0.00006809979,"threshold_uncertainty_score":0.44314143},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2379044,0.00006583546,0.7612872,0.00020908592,0.00039387317,0.0000982331,1.3114177e-7,0.000023986677,0.000017207773],"genre_scores_gemma":[0.7555885,0.000003834754,0.24403737,0.00009446205,0.0002638803,0.0000028818617,2.7816318e-8,0.000007132848,0.0000019379586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805343,0.00003519075,0.00039556503,0.0004465669,0.00051764335,0.0005516098],"domain_scores_gemma":[0.9984287,0.000094908486,0.00021675677,0.00060499,0.00016728048,0.00048737222],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010439934,0.00018622838,0.00029490876,0.00050658773,0.00030048328,0.0013565085,0.002782599,0.00006326714,6.358608e-7],"category_scores_gemma":[0.00009171057,0.00015674827,0.00004890316,0.0006722762,0.00011449388,0.0013989803,0.00036896422,0.0005527519,0.0000011930232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042027958,0.00005500399,0.0015966716,0.0000047330786,0.000006555711,0.00027762336,0.00038661197,0.7831173,0.0014241671,0.0038056755,0.000015505208,0.20926812],"study_design_scores_gemma":[0.00042818923,0.00092249707,0.059977032,0.0000936466,0.0000018898093,0.00047145216,9.922745e-7,0.9370149,0.00066838006,0.00017489499,0.00005126156,0.00019487808],"about_ca_topic_score_codex":0.000008069031,"about_ca_topic_score_gemma":0.000001080733,"teacher_disagreement_score":0.51768404,"about_ca_system_score_codex":0.000076322925,"about_ca_system_score_gemma":0.00017838036,"threshold_uncertainty_score":0.99968016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3850614,0.004517632,0.54091305,0.0024990183,0.0010236186,0.057131927,0.000003122691,0.00006449798,0.008785728],"genre_scores_gemma":[0.99002814,0.00005327953,0.008453276,0.000012115283,0.00005045425,0.001393039,2.3150379e-7,0.0000037327472,0.000005757473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784535,0.00065669644,0.0007143329,0.00007597787,0.00059248257,0.000115134666],"domain_scores_gemma":[0.9951471,0.00063510414,0.0016524612,0.0018379606,0.00070013735,0.000027221009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009998259,0.00007093853,0.00020259674,0.00012653947,0.0004908987,0.00034019342,0.0030607034,0.00004676104,4.717376e-7],"category_scores_gemma":[0.00096597,0.000048802507,0.000045004133,0.00025006602,0.00006884242,0.0008118366,0.00039921352,0.00029632167,5.3335987e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015221009,0.0002309943,0.4132251,0.0001666773,0.00006480932,0.0000029071593,0.008557871,0.010839011,0.000049955503,0.012454143,0.00022888475,0.5541644],"study_design_scores_gemma":[0.0007045447,0.00009788017,0.09452551,0.00061924296,0.000025053007,0.000095868985,0.00043854423,0.9022513,0.000016870996,0.00020608655,0.0009402299,0.00007889475],"about_ca_topic_score_codex":0.00005529266,"about_ca_topic_score_gemma":0.00001819031,"teacher_disagreement_score":0.89141226,"about_ca_system_score_codex":0.00006100486,"about_ca_system_score_gemma":0.00015919934,"threshold_uncertainty_score":0.5687599},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05335906,0.0019469766,0.94227546,0.0003649344,0.00045284783,0.0002373486,0.0000046800687,0.0007578149,0.00060086045],"genre_scores_gemma":[0.958159,0.00003053924,0.041043986,0.0002277625,0.00041586687,0.000008733304,0.00007236127,0.000023231047,0.000018475013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971569,0.00019102803,0.0006346858,0.00072974287,0.00030078104,0.0009868474],"domain_scores_gemma":[0.99833846,0.0004067802,0.00023543631,0.00074013777,0.0000958654,0.0001833197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006440566,0.0002966346,0.00036421823,0.00013599396,0.00022837201,0.00030289553,0.0013162572,0.00016282639,0.000017500344],"category_scores_gemma":[0.0000929114,0.0003306158,0.00009936099,0.0018710241,0.000044043158,0.00039155662,0.00046174697,0.00060835935,0.00003968588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005685383,0.00006855497,0.002687123,0.0000053901904,0.000014390149,0.00005045407,0.00020263328,0.5636765,0.00004281931,0.0019032041,0.0014025504,0.42994073],"study_design_scores_gemma":[0.00061232306,0.0000308214,0.012939273,0.00011484196,0.0000044221706,0.000042137766,0.000017948827,0.97782433,0.00007412168,0.000088114604,0.007904756,0.00034692438],"about_ca_topic_score_codex":0.000015717174,"about_ca_topic_score_gemma":0.000037552647,"teacher_disagreement_score":0.9048,"about_ca_system_score_codex":0.00031816083,"about_ca_system_score_gemma":0.00006740359,"threshold_uncertainty_score":0.9999146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15406264,0.0015167433,0.8424704,0.00016997283,0.00053197105,0.00046951624,0.0000025755737,0.0001391655,0.0006369905],"genre_scores_gemma":[0.99494946,0.0027281384,0.0018572928,0.00012730174,0.00006386683,0.0000017740615,0.0000045175107,0.000026792039,0.0002408684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973538,0.00021121585,0.00030189473,0.0014555411,0.00010747229,0.00057007495],"domain_scores_gemma":[0.99749565,0.00011854489,0.0003699221,0.0016249362,0.0000988211,0.0002921099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005437389,0.00042563988,0.0006147436,0.0002252936,0.00024401245,0.0003027608,0.0018409091,0.000597557,0.000016970907],"category_scores_gemma":[0.000014572675,0.00048007225,0.000185016,0.0002358761,0.00016813846,0.0005072872,0.0013703217,0.0013008276,0.000010274004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011643193,0.000118041884,0.0025711632,0.00008276989,0.00009094107,0.0011849222,0.00040133743,0.9355986,0.000053611206,0.028959213,0.00008920524,0.030733775],"study_design_scores_gemma":[0.0013730328,0.000054335287,0.0026027204,0.0005100282,0.000033629818,0.0000072647144,0.000021169777,0.98784715,0.000010740671,0.006669859,0.00036246315,0.00050760363],"about_ca_topic_score_codex":0.000045358025,"about_ca_topic_score_gemma":0.000055856795,"teacher_disagreement_score":0.84088683,"about_ca_system_score_codex":0.0001676697,"about_ca_system_score_gemma":0.00016522598,"threshold_uncertainty_score":0.9997651},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030748544,0.000012207668,0.98977554,0.0005789159,0.0011850427,0.00042937015,0.0000016625542,0.00025405904,0.0046883556],"genre_scores_gemma":[0.9744814,0.000010334763,0.023531415,0.00026644755,0.00042326894,0.000095394375,0.000003059039,0.000019605426,0.0011690513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982978,0.000034146033,0.00030416908,0.00059958885,0.00015817046,0.0006061107],"domain_scores_gemma":[0.99747145,0.00023949219,0.00023412734,0.0017435122,0.0001525042,0.0001589367],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00039596384,0.00021155346,0.00026215875,0.000032721713,0.00071137404,0.0010479065,0.0028467725,0.00013050003,0.000042181942],"category_scores_gemma":[0.000062739164,0.00018290931,0.00012044498,0.000056567005,0.00008978083,0.0007588552,0.0011147053,0.00021475034,0.00003991511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002266872,0.000078999146,0.0040128287,0.000021987242,0.00005433931,0.000018940313,0.0004078325,0.00090683915,0.00006231939,0.37970275,0.007865679,0.60684484],"study_design_scores_gemma":[0.00044431232,0.00006705353,0.0014045939,0.000059959006,0.0000063384696,0.000007064285,0.000030363492,0.99630183,0.00025604793,0.0006640525,0.0005078666,0.0002505468],"about_ca_topic_score_codex":0.00009208779,"about_ca_topic_score_gemma":0.00019428447,"teacher_disagreement_score":0.99539495,"about_ca_system_score_codex":0.00004276486,"about_ca_system_score_gemma":0.000041697534,"threshold_uncertainty_score":0.9999891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129882125,0.001971542,0.98195654,0.0009950103,0.001685249,0.0003104757,0.0000250942,0.000037576534,0.000030325753],"genre_scores_gemma":[0.865217,0.0013860147,0.13211092,0.00036474224,0.00074630725,0.000023954168,0.00011193255,0.000026394626,0.000012771862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974542,0.00014912724,0.0009355846,0.00033806538,0.000708047,0.00041492173],"domain_scores_gemma":[0.99692255,0.00023326174,0.0013491134,0.00045448108,0.0008374107,0.00020316048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008245168,0.00026490598,0.0003620007,0.00024029352,0.000233357,0.00093303417,0.0016237899,0.00023030285,0.000016935826],"category_scores_gemma":[0.0001384854,0.00025401526,0.00014851437,0.0002056445,0.00011483461,0.0011454382,0.0003868178,0.0006136868,0.0000023804887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009134934,0.00011554803,0.00039476706,0.0000034009533,0.000048079673,0.00010377223,0.000054665423,0.9198477,0.000016537393,0.00009375282,0.00061724626,0.07861317],"study_design_scores_gemma":[0.0023569008,0.00013272441,0.0020030707,0.00022815606,0.000015016415,0.00017556698,0.000026539881,0.9931952,0.00005514507,0.00004164265,0.0015307522,0.00023929712],"about_ca_topic_score_codex":0.0000037335105,"about_ca_topic_score_gemma":0.0000113042415,"teacher_disagreement_score":0.85222876,"about_ca_system_score_codex":0.00028763709,"about_ca_system_score_gemma":0.00007035834,"threshold_uncertainty_score":0.9999912},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48685837,0.0012324561,0.50429654,0.00014643032,0.0005496535,0.0010896197,9.838101e-7,0.0003011711,0.005524784],"genre_scores_gemma":[0.98783714,0.00014786786,0.011160608,0.00011611585,0.00015332764,0.00033961952,0.0000011838262,0.000020435455,0.00022370472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974368,0.00020204525,0.0003829754,0.00095475523,0.00032040122,0.00070299825],"domain_scores_gemma":[0.9961026,0.00056046696,0.00025451535,0.0027371068,0.00016092829,0.00018441447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014902595,0.00031292043,0.00052746735,0.000066322646,0.0004345902,0.00064011285,0.0017401316,0.00011110779,0.00004586618],"category_scores_gemma":[0.0001563227,0.00024396146,0.000103545244,0.00019638067,0.00020196635,0.0012571319,0.00092487124,0.0004598528,0.000020980478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006024749,0.00079438096,0.099878654,0.00004199796,0.00009635241,0.0002162354,0.0008696424,0.4038246,0.0000971269,0.008243967,0.00058418594,0.4847504],"study_design_scores_gemma":[0.0072142803,0.00034355387,0.09085921,0.00012079965,0.000011108932,0.000025445019,0.00004925337,0.8963455,0.00069247023,0.0017168755,0.001951452,0.0006700513],"about_ca_topic_score_codex":0.0003305871,"about_ca_topic_score_gemma":0.0052011334,"teacher_disagreement_score":0.50097877,"about_ca_system_score_codex":0.00012833832,"about_ca_system_score_gemma":0.00007752776,"threshold_uncertainty_score":0.994846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016301453,0.0005725107,0.97131354,0.0070087533,0.0003672994,0.00069025264,0.000017278066,0.00029536922,0.0034335635],"genre_scores_gemma":[0.96470064,0.0007038706,0.03387885,0.0001836087,0.0001411503,0.00016225889,0.00003751586,0.000028340406,0.00016374141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975375,0.0005954803,0.0004457752,0.0005410346,0.0003154618,0.00056476984],"domain_scores_gemma":[0.99565303,0.00050291355,0.00039589638,0.0030867285,0.00018408945,0.00017736232],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010848634,0.00027537823,0.00035826946,0.000081031874,0.0020609202,0.00046130523,0.0047910064,0.00019279361,0.00001535822],"category_scores_gemma":[0.000026400383,0.0002924078,0.00012282723,0.00033181583,0.00034621896,0.0010218222,0.0011972465,0.00084225205,0.00002947388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023764318,0.0002051752,0.0023146765,0.000012045908,0.00004693755,0.000024011311,0.0029033711,0.0008707572,0.00016255153,0.13208905,0.00045775308,0.8608899],"study_design_scores_gemma":[0.0005530079,0.00004525886,0.021081597,0.00035677216,0.000012153463,0.000012211606,0.00018024427,0.97518164,0.000040441115,0.0014112784,0.00079494773,0.00033045743],"about_ca_topic_score_codex":0.00048605847,"about_ca_topic_score_gemma":0.00068529544,"teacher_disagreement_score":0.9743109,"about_ca_system_score_codex":0.00017647595,"about_ca_system_score_gemma":0.00019839613,"threshold_uncertainty_score":0.9999528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011497551,0.0002320866,0.937511,0.006398236,0.00014102494,0.043053403,0.000037697766,0.00040368133,0.0007252825],"genre_scores_gemma":[0.7422276,0.000109482455,0.111514494,0.00037208607,0.00012116491,0.14487788,0.0000709106,0.00006538309,0.00064098864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764675,0.00023469438,0.00044962828,0.0006560459,0.00041135386,0.0006015417],"domain_scores_gemma":[0.9921534,0.0004640756,0.0006260011,0.0059481054,0.00059863005,0.00020980147],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00070928095,0.00033656092,0.000358264,0.00008890669,0.002969229,0.00088680093,0.0067682774,0.00013238861,0.000009470413],"category_scores_gemma":[0.000067849876,0.0003134127,0.00014623416,0.00019817574,0.0005191636,0.0011585315,0.0016040037,0.0005833422,0.000017997756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014071082,0.002983892,0.0097197965,0.00041712468,0.00057953806,0.000056431716,0.0056657363,0.0031969391,0.0012552706,0.22896202,0.013647245,0.7321089],"study_design_scores_gemma":[0.002070583,0.00021315849,0.004969951,0.00020819067,0.000021668138,0.000029977457,0.000060222585,0.9595613,0.00011256746,0.00031592426,0.032011546,0.0004248996],"about_ca_topic_score_codex":0.000085572974,"about_ca_topic_score_gemma":0.0014012698,"teacher_disagreement_score":0.9563644,"about_ca_system_score_codex":0.00014977394,"about_ca_system_score_gemma":0.0002613993,"threshold_uncertainty_score":0.9999318},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14982915,0.000030500252,0.84593457,0.00035893868,0.000118711745,0.00061051,0.0000015769845,0.00012442555,0.0029915979],"genre_scores_gemma":[0.84051174,0.0000012133456,0.15914403,0.00019543689,0.00003418131,0.000041685937,3.9228317e-7,0.000009431201,0.00006188092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989193,0.00002013938,0.00014818064,0.000441267,0.00014347011,0.00032761478],"domain_scores_gemma":[0.9987349,0.0002787314,0.00010792599,0.0007076517,0.000065659915,0.00010515522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034120373,0.00013845906,0.00017725158,0.000036700625,0.00020313305,0.0003728868,0.0006488163,0.00006915831,0.000004074976],"category_scores_gemma":[0.0001261748,0.00011098466,0.000019588382,0.00006941587,0.000043499742,0.00044332657,0.00038288222,0.00010971262,0.0000035579676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017224145,0.00029867754,0.042026974,0.00030021946,0.00006879445,0.00045916814,0.0034596405,0.010098659,0.00049923797,0.80167323,0.001059454,0.13988373],"study_design_scores_gemma":[0.0009952325,0.00025331523,0.0039388523,0.000056504763,0.000004835255,0.000037007507,0.000018500907,0.94527847,0.0004013863,0.048589412,0.00020513016,0.00022135915],"about_ca_topic_score_codex":0.00010664055,"about_ca_topic_score_gemma":0.00032816056,"teacher_disagreement_score":0.9351798,"about_ca_system_score_codex":0.000021156342,"about_ca_system_score_gemma":0.000038976064,"threshold_uncertainty_score":0.4525823},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6365257,0.003963971,0.17792343,0.000020038466,0.0106368195,0.0022042806,0.0000018690143,0.000789664,0.16793425],"genre_scores_gemma":[0.9410649,0.005286708,0.008252432,0.00020487557,0.00018628112,0.00042308637,0.00024274738,0.00007368789,0.044265285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731123,0.000065025095,0.0006195222,0.0009117702,0.00039356822,0.00069889385],"domain_scores_gemma":[0.9983331,0.00005261399,0.00031365993,0.0010586944,0.00011688545,0.00012502748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028989435,0.00045160123,0.0004597737,0.0002121024,0.00009245969,0.00011279938,0.0019199786,0.00050009973,0.00023247703],"category_scores_gemma":[0.0000053625085,0.00044265258,0.000095938645,0.00061487115,0.000021589682,0.00061881356,0.0001901729,0.00069904083,0.00022427588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076603246,0.00018086914,0.0012605826,0.00011974931,0.000036665104,0.000025588564,0.0011498271,0.00097589067,0.0000558333,0.0019895728,0.0012093759,0.99291945],"study_design_scores_gemma":[0.000779321,0.0001845956,0.018444832,0.00066912774,0.000014135465,0.0000030988856,0.00007016155,0.9742213,0.001233929,0.0001094482,0.003253415,0.0010166208],"about_ca_topic_score_codex":0.000047449666,"about_ca_topic_score_gemma":0.0016242183,"teacher_disagreement_score":0.9919028,"about_ca_system_score_codex":0.000100554964,"about_ca_system_score_gemma":0.00011994971,"threshold_uncertainty_score":0.99980253},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002575646,0.00009848105,0.990629,0.00047036228,0.00032529628,0.0034303132,0.0000011441227,0.00023635685,0.004551464],"genre_scores_gemma":[0.90097225,0.00009254216,0.09516899,0.00017278454,0.00042936843,0.002904068,0.000007482883,0.00003285018,0.00021966017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788237,0.00023769618,0.00038308927,0.0007417695,0.00023654794,0.00051853905],"domain_scores_gemma":[0.99695086,0.00018021409,0.00052732066,0.0020025293,0.000107787615,0.00023126038],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012028005,0.00025314046,0.00032301786,0.000040521736,0.0009296874,0.0011521553,0.001730027,0.00023977779,0.0000051384204],"category_scores_gemma":[0.000053411175,0.00024377364,0.00006016034,0.000114481554,0.00016259638,0.0010610959,0.0008039437,0.00043761672,0.0000053101503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007695951,0.000028231896,0.0004450986,0.00001904297,0.000016402213,0.000014884551,0.00015086554,0.004619172,0.00004512568,0.4504369,0.00084376807,0.5433728],"study_design_scores_gemma":[0.00031176273,0.000033354016,0.0019879313,0.00014179623,0.000009864992,0.000019956635,0.00001573859,0.9851859,0.000010803598,0.010084902,0.0019198924,0.00027807264],"about_ca_topic_score_codex":0.000022596872,"about_ca_topic_score_gemma":0.000019581892,"teacher_disagreement_score":0.98056674,"about_ca_system_score_codex":0.000047017595,"about_ca_system_score_gemma":0.00007745247,"threshold_uncertainty_score":0.9998847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2615527,0.0011327511,0.731488,0.00013124802,0.00021071016,0.0021450815,0.0000040635728,0.000070846036,0.0032646104],"genre_scores_gemma":[0.9956068,0.0006252051,0.0005121236,0.00010813333,0.00023427818,0.002812384,0.000015725049,0.000013623101,0.00007174644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981993,0.00007565226,0.0004390554,0.0005450387,0.00032199617,0.00041897778],"domain_scores_gemma":[0.9976353,0.00010783959,0.00036968192,0.001544287,0.00022578047,0.00011711314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015929294,0.00018586397,0.00029837043,0.0000596404,0.0005476985,0.00018261197,0.0009930782,0.00016477668,0.000034407625],"category_scores_gemma":[0.000012635332,0.00018683959,0.00006214482,0.00028558925,0.00016075022,0.0004780879,0.00044976047,0.00028680378,0.0000060215675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008880325,0.0002041778,0.07534666,0.000012353599,0.000015086755,4.429964e-7,0.00010374965,0.31626073,0.000009346874,0.007434523,0.0005761109,0.6000279],"study_design_scores_gemma":[0.0006640615,0.000044801513,0.100916006,0.00004843605,0.00001868835,0.0000028740944,0.000029065553,0.8915699,0.000018786408,0.00029170557,0.006228388,0.00016729743],"about_ca_topic_score_codex":0.00006968349,"about_ca_topic_score_gemma":0.00051568,"teacher_disagreement_score":0.7340541,"about_ca_system_score_codex":0.000052871474,"about_ca_system_score_gemma":0.00006009122,"threshold_uncertainty_score":0.7619097},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012487969,0.000012944231,0.8806853,0.000084480576,0.0001862171,0.11663493,9.730932e-7,0.00039853167,0.00074777514],"genre_scores_gemma":[0.22765066,0.0000010307372,0.22838293,0.00092706963,0.00024493504,0.5422466,0.0000026617497,0.00004214642,0.00050198095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977288,0.00008884576,0.00040304105,0.0007170706,0.0003692778,0.00069294864],"domain_scores_gemma":[0.9979461,0.0006220711,0.00014306184,0.00095016,0.00015094467,0.0001876898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042156494,0.00027546292,0.00025751535,0.00008179491,0.00039936558,0.00010822647,0.0007605689,0.00012564308,0.00004991121],"category_scores_gemma":[0.000054234846,0.0002261519,0.00015630032,0.00040743145,0.000074872216,0.000083578074,0.000195178,0.0002022035,0.00005054734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095236086,0.0003865564,0.00014145508,0.000017169074,0.000006526295,0.00002802203,0.00014816133,0.94812626,0.000015986663,0.0014813433,0.0024532743,0.047100037],"study_design_scores_gemma":[0.0017731487,0.0006021887,0.0002616868,0.00006370744,0.000002923378,0.00001617104,0.000010026115,0.9868096,0.00022225821,0.000015761494,0.009935313,0.00028722227],"about_ca_topic_score_codex":0.0000035880362,"about_ca_topic_score_gemma":0.000008322288,"teacher_disagreement_score":0.65230244,"about_ca_system_score_codex":0.000083592546,"about_ca_system_score_gemma":0.000094962204,"threshold_uncertainty_score":0.92222065},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19871432,0.0017085496,0.292137,0.0003171862,0.0028851957,0.0022954245,0.00015223939,0.00002652665,0.5017636],"genre_scores_gemma":[0.32485333,0.0007213783,0.3409485,0.00026617557,0.0009637223,0.00043022778,0.001085887,0.00019189782,0.3305389],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959124,0.0005861507,0.0007461868,0.0013569052,0.00043318322,0.0009651851],"domain_scores_gemma":[0.99716693,0.00022359988,0.00056911644,0.0014133503,0.00024617737,0.00038081073],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010991979,0.0006578432,0.0006765429,0.00012861588,0.00047538526,0.0015621551,0.005154053,0.0008226612,0.00997069],"category_scores_gemma":[0.00007640929,0.00070587214,0.00024478542,0.00047570292,0.00015809463,0.0012142145,0.00090176944,0.00085336174,0.001850161],"study_design_candidate":"design_other","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.00011141264,0.00045449808,0.005526073,0.00011093465,0.00019996139,0.00053802185,0.0958767,0.0010255129,0.0015278094,0.015410899,0.0042341757,0.874984],"study_design_scores_gemma":[0.0019593013,0.0012501464,0.04184728,0.0032134359,0.0005940903,0.00030680123,0.012319756,0.19656056,0.062656686,0.00663061,0.66812056,0.004540767],"about_ca_topic_score_codex":0.01025285,"about_ca_topic_score_gemma":0.039232653,"teacher_disagreement_score":0.8704432,"about_ca_system_score_codex":0.00029448734,"about_ca_system_score_gemma":0.0010682842,"threshold_uncertainty_score":0.99953926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023970004,0.00020287586,0.9727288,0.0004547929,0.0015322352,0.000658513,0.0000014437877,0.00016961155,0.0002817395],"genre_scores_gemma":[0.5441463,0.00003609857,0.4540164,0.001184105,0.0005570204,0.000019160767,0.000002727517,0.0000231863,0.000015012884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724865,0.00013590654,0.00048298476,0.0009755496,0.00027410846,0.000882778],"domain_scores_gemma":[0.99749076,0.00015561609,0.00025288435,0.0016355113,0.000103293205,0.0003619508],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073380466,0.00036312934,0.0004675695,0.00011141144,0.00052643917,0.0017239773,0.002313404,0.0001955233,0.0000029743705],"category_scores_gemma":[0.00003187448,0.00037281011,0.00007440265,0.0003062492,0.00008616742,0.0007380972,0.0029272211,0.00040800238,0.000009839972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015159164,0.000030707535,0.009749159,0.0000043477717,0.000013446396,0.000076315584,0.0002622373,0.7605251,0.000005441112,0.00037694463,0.00047774668,0.22846337],"study_design_scores_gemma":[0.00096919225,0.000058776324,0.031983417,0.00026467687,0.0000075135986,0.00004040004,0.0000028681454,0.96556026,0.0000060469274,0.00009057453,0.00060765236,0.00040862706],"about_ca_topic_score_codex":0.00013719921,"about_ca_topic_score_gemma":0.00017723357,"teacher_disagreement_score":0.5201763,"about_ca_system_score_codex":0.00012459875,"about_ca_system_score_gemma":0.000051576142,"threshold_uncertainty_score":0.9998724},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062282525,0.00005084425,0.9143252,0.0047779256,0.0013962714,0.00043071972,0.00002005421,0.00012325661,0.01659324],"genre_scores_gemma":[0.9945579,0.000014679112,0.0039659766,0.0011027373,0.000112394104,0.000033917935,0.00005059333,0.000015335756,0.0001464424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980398,0.00008989097,0.00035213793,0.00065226207,0.00028946585,0.0005764603],"domain_scores_gemma":[0.99788576,0.00022866373,0.00022841677,0.00090887316,0.00030015234,0.00044812937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000254553,0.0002385294,0.00026520848,0.00061041006,0.00044215532,0.0009246489,0.0020846087,0.00016426666,0.00015485355],"category_scores_gemma":[0.00017246019,0.0002715452,0.00005065284,0.0005309239,0.00012984968,0.0006459322,0.0001880297,0.00036864865,0.000111776295],"study_design_candidate":"simulation_or_modeling","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.000013098954,0.00004950463,0.012325589,0.000009628304,0.00002148906,0.00013660762,0.00016136211,0.24762517,0.000003530604,0.61143696,0.0023017959,0.12591526],"study_design_scores_gemma":[0.00037711722,0.000052390802,0.106701806,0.0001070903,0.000001824876,0.000008602507,0.000013154719,0.88311464,0.0000063524967,0.008968961,0.00036839768,0.0002796535],"about_ca_topic_score_codex":0.0077557056,"about_ca_topic_score_gemma":0.054325704,"teacher_disagreement_score":0.9322754,"about_ca_system_score_codex":0.00029569722,"about_ca_system_score_gemma":0.0009428901,"threshold_uncertainty_score":0.99997365},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008534518,0.0018572194,0.9955265,0.00015452452,0.0009885879,0.0011902256,0.00005505901,0.00010507525,0.00003744244],"genre_scores_gemma":[0.015738891,0.00018346813,0.9836272,0.000104453386,0.00018140176,0.00006666258,0.00002161081,0.000030289966,0.00004601656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982081,0.000021114263,0.00076031813,0.00034809866,0.00024119343,0.0004211723],"domain_scores_gemma":[0.99785453,0.0003329159,0.0006195068,0.00084215956,0.00024359813,0.00010731338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071671803,0.0004281815,0.0004783512,0.00015576219,0.0012122355,0.000467872,0.0024348279,0.0003013464,6.491146e-7],"category_scores_gemma":[0.00003539401,0.000359991,0.0001787931,0.00017334116,0.00051727646,0.00038206505,0.0013908857,0.0004615495,3.6657366e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016344401,0.000027689835,2.493915e-7,0.00005978382,0.000060404243,4.105533e-8,0.0023659908,0.9250405,0.000004389171,0.0015560706,0.000025035546,0.070858255],"study_design_scores_gemma":[0.00045592472,0.00020083525,0.0000061359847,0.0003181341,0.000041273535,0.000010179238,0.000015893955,0.99382174,0.00009704434,0.00010617545,0.0045347684,0.00039190546],"about_ca_topic_score_codex":0.000008931788,"about_ca_topic_score_gemma":0.00006334313,"teacher_disagreement_score":0.070466354,"about_ca_system_score_codex":0.00011448472,"about_ca_system_score_gemma":0.000101248654,"threshold_uncertainty_score":0.9998852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017725773,7.300642e-7,0.95738447,0.0031668863,0.00011130027,0.020155726,7.5182686e-7,0.0000877701,0.0013666215],"genre_scores_gemma":[0.97279,7.6240674e-8,0.003297129,0.000773941,0.0001465336,0.022912456,0.0000014978497,0.0000116270985,0.00006676206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983911,0.000160897,0.0002633158,0.0005661361,0.00028187424,0.00033666534],"domain_scores_gemma":[0.99758905,0.00029156925,0.00022700573,0.0015728949,0.00019690294,0.00012257075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047358,0.00018724933,0.00019172202,0.000039843533,0.00035462712,0.0006907837,0.0014412401,0.000080629616,0.000019773619],"category_scores_gemma":[0.00011203291,0.00013261693,0.000024022926,0.00019974499,0.00011675444,0.00076246896,0.00044804908,0.0002511346,0.00006256942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012500305,0.00006451582,0.07361707,0.000018422714,0.000011558101,0.000010056814,0.00061073643,0.8342674,0.00008358631,0.060120717,0.00022693792,0.030844036],"study_design_scores_gemma":[0.00046028034,0.00007597528,0.14742175,0.00009139476,0.0000027442027,0.000003021269,0.0000044936337,0.84172297,0.00016667489,0.005669119,0.0042010723,0.00018053311],"about_ca_topic_score_codex":0.00012714656,"about_ca_topic_score_gemma":0.00093737623,"teacher_disagreement_score":0.9550642,"about_ca_system_score_codex":0.000054879263,"about_ca_system_score_gemma":0.00013116427,"threshold_uncertainty_score":0.66612434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018052938,0.0004282945,0.993659,0.0016976363,0.0012092202,0.0007424909,0.00001646829,0.000099744946,0.00034185636],"genre_scores_gemma":[0.047174055,0.00016126817,0.9518036,0.00028616432,0.00038584814,0.00004823523,0.000037171805,0.000025145158,0.000078514655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982263,0.00007217999,0.000739421,0.00027283956,0.00041400525,0.00027529727],"domain_scores_gemma":[0.9970918,0.0009337399,0.0006030004,0.0010793369,0.0002380561,0.00005402788],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001290943,0.00035926086,0.0003392093,0.00025174106,0.0020263318,0.00038731666,0.0027549153,0.00028722413,0.0000037044479],"category_scores_gemma":[0.00011934545,0.00024090827,0.00021421124,0.00042280174,0.000817682,0.00036993742,0.0017405899,0.000903529,0.0000017386606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028900155,0.000013243271,8.974293e-7,0.0001056581,0.0000680211,1.4946441e-7,0.007101206,0.69402426,0.00014751819,0.023093995,0.00010652698,0.27530962],"study_design_scores_gemma":[0.00016813538,0.00014401844,0.000065699416,0.00024350277,0.000024604196,0.000027795733,0.000010794822,0.9070855,0.00011246486,0.008851991,0.08295797,0.00030755822],"about_ca_topic_score_codex":0.00003311496,"about_ca_topic_score_gemma":0.00034421866,"teacher_disagreement_score":0.27500206,"about_ca_system_score_codex":0.00019459876,"about_ca_system_score_gemma":0.00016431836,"threshold_uncertainty_score":0.9992729},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019755703,0.00019136647,0.931313,0.0005113652,0.0005286281,0.059202775,0.0000012119847,0.0003999316,0.0058761886],"genre_scores_gemma":[0.39934638,0.00016155088,0.18616012,0.00289766,0.00565353,0.36925748,0.00034739092,0.00061625737,0.03555961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503636,0.00037338355,0.0009304884,0.0020255488,0.0007198991,0.0009143245],"domain_scores_gemma":[0.9956644,0.0008733232,0.00061719026,0.002152913,0.00031569705,0.00037645738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001607528,0.0007878671,0.0008465116,0.00012530563,0.00043708485,0.00054357585,0.0016838743,0.0006553219,0.000041519692],"category_scores_gemma":[0.00026707197,0.0005687883,0.00020406967,0.00052316545,0.00012497864,0.00079046324,0.00052146165,0.0016543416,0.00002678226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001948593,0.0006518805,0.000047614627,0.0006167822,0.00052360556,0.000021087963,0.010791941,0.1669304,0.0016434364,0.0704904,0.01788577,0.7284485],"study_design_scores_gemma":[0.0007352035,0.0002598463,0.00038146033,0.00029869942,0.00006429095,0.000014951448,0.00024493047,0.9866832,0.0009567562,0.0074500875,0.0022266847,0.0006839165],"about_ca_topic_score_codex":0.00017791252,"about_ca_topic_score_gemma":0.002853892,"teacher_disagreement_score":0.81975275,"about_ca_system_score_codex":0.00029572987,"about_ca_system_score_gemma":0.0006715867,"threshold_uncertainty_score":0.99967635},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38049915,0.0005055474,0.6164769,0.00006921979,0.0013262,0.0004818302,9.371827e-7,0.00040377892,0.00023642747],"genre_scores_gemma":[0.98894274,0.000033707165,0.00978413,0.0005151584,0.00063611876,0.000053178446,0.000007870832,0.000022938882,0.000004143419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970876,0.000382399,0.00048433305,0.0009856513,0.0003545986,0.0007054184],"domain_scores_gemma":[0.9980138,0.00016512543,0.00017077934,0.0012537813,0.00011851055,0.00027798733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086715794,0.00030618973,0.00032254215,0.00022484799,0.00027460026,0.00026316493,0.0014057587,0.00023120493,0.0000251477],"category_scores_gemma":[0.000015337673,0.00031817704,0.00009650179,0.0010827953,0.00025215623,0.0003528072,0.0006349586,0.0005148609,0.000042001535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008408886,0.00041687186,0.00013672742,0.0000136638655,0.000013402642,0.00005540553,0.0043194857,0.117619865,0.00028389163,0.0013511898,0.0010167467,0.8746887],"study_design_scores_gemma":[0.0006406551,0.0007329021,0.001377898,0.00006321213,0.000004136618,0.00003499701,0.000047243746,0.9799759,0.00043577846,0.0006155839,0.015728114,0.00034358262],"about_ca_topic_score_codex":0.000016831733,"about_ca_topic_score_gemma":0.0002224432,"teacher_disagreement_score":0.87434506,"about_ca_system_score_codex":0.00019791718,"about_ca_system_score_gemma":0.000053065316,"threshold_uncertainty_score":0.99992704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055008626,0.00069644995,0.99572384,0.0004212466,0.0010984147,0.0011582498,0.0000311347,0.00007853758,0.00024204752],"genre_scores_gemma":[0.031434905,0.00021037253,0.96755123,0.00017563801,0.0003847643,0.00012955295,0.00004366377,0.000025850299,0.000044012988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829626,0.0000120020095,0.0007937284,0.00026693643,0.00023788666,0.00039317968],"domain_scores_gemma":[0.9979658,0.00049894804,0.00048352292,0.00074690656,0.00023276535,0.000072027324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006830853,0.0003208643,0.0004207153,0.0003000367,0.00079669,0.00027044045,0.0022831897,0.00026523168,0.0000010214692],"category_scores_gemma":[0.00009053395,0.00028560928,0.00019665802,0.0003910793,0.00032375334,0.0005412874,0.000992897,0.00043219555,5.6036913e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036600454,0.000010845054,0.0000016802002,0.00007317417,0.000034983674,6.00628e-8,0.0018655902,0.9319565,0.000010513568,0.0071386695,0.00010563938,0.05879866],"study_design_scores_gemma":[0.00025563996,0.000119420496,0.00001625427,0.00034850778,0.000020467121,0.000014201835,0.000008035425,0.9689719,0.00006245993,0.0007744169,0.029088538,0.00032014455],"about_ca_topic_score_codex":0.000015519283,"about_ca_topic_score_gemma":0.00021680561,"teacher_disagreement_score":0.058478516,"about_ca_system_score_codex":0.00011268677,"about_ca_system_score_gemma":0.00013949447,"threshold_uncertainty_score":0.9999596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027781133,0.004699912,0.9588641,0.000102194215,0.0036852164,0.0015537415,0.0000029300509,0.0008437581,0.0024670418],"genre_scores_gemma":[0.9571693,0.0011217615,0.03752024,0.0009994817,0.00084701675,0.001515181,0.00005845358,0.00009095979,0.0006776247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956903,0.0002877963,0.00079239404,0.0017749268,0.0005320213,0.00092254736],"domain_scores_gemma":[0.9961846,0.00019840446,0.00038509583,0.0028199109,0.00017458183,0.0002373908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009087398,0.00062878075,0.00063490926,0.00047911116,0.00013425646,0.00047644202,0.0026056075,0.00094587915,0.00020717486],"category_scores_gemma":[0.000017637696,0.00063133024,0.0003033302,0.0011272073,0.00015264838,0.00031358184,0.002094711,0.001579312,0.00020904354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000332807,0.00014885988,0.00025309203,0.0000502565,0.00002796459,0.000034357603,0.000096400574,0.6991997,0.000011813628,0.000086394255,0.005570832,0.29448706],"study_design_scores_gemma":[0.0005513642,0.00025856085,0.0011789384,0.00022205431,0.0000125347815,0.0000069670027,0.0000067520623,0.9699263,0.00039280334,0.0013466607,0.02534703,0.000750023],"about_ca_topic_score_codex":0.000058799284,"about_ca_topic_score_gemma":0.0021525673,"teacher_disagreement_score":0.92938817,"about_ca_system_score_codex":0.00028607016,"about_ca_system_score_gemma":0.00019769583,"threshold_uncertainty_score":0.9996138},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018544242,0.009002923,0.9699646,0.00016726572,0.00013331092,0.0009029703,0.0000011635068,0.00017645034,0.0011070368],"genre_scores_gemma":[0.9921617,0.0017710573,0.0036033997,0.00041215154,0.0007516386,0.0011251362,0.000009206751,0.000025062027,0.00014066252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981081,0.00006837586,0.00038020147,0.00073538173,0.00012848909,0.00057946943],"domain_scores_gemma":[0.99869174,0.00024105771,0.00014195556,0.00066860154,0.00006840395,0.00018825941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004695988,0.00023177337,0.00025787426,0.000073221294,0.00043636942,0.00028572133,0.0004890134,0.00018074097,0.000011405425],"category_scores_gemma":[0.0000072502953,0.00023144153,0.00003666366,0.0008365793,0.0002075827,0.00028888255,0.00048127695,0.0003886962,0.000008405157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071930076,0.000076233344,0.0061224517,0.000008490546,0.00001681311,0.0000043834475,0.00023057981,0.1455904,0.000018579902,0.033883836,0.00084270956,0.8131983],"study_design_scores_gemma":[0.00032734667,0.000089246074,0.005980413,0.000055032426,0.000009378198,0.000024356988,0.000068435445,0.9527713,0.000006498962,0.0007410233,0.03964371,0.0002832388],"about_ca_topic_score_codex":0.000021853188,"about_ca_topic_score_gemma":0.00017558216,"teacher_disagreement_score":0.97361743,"about_ca_system_score_codex":0.00003923408,"about_ca_system_score_gemma":0.000024865198,"threshold_uncertainty_score":0.9437912},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.431609e-7,0.02556446,0.047808737,0.000072175695,0.92008764,0.0019928995,0.000032339998,0.00022828522,0.004212743],"genre_scores_gemma":[0.000011566304,0.14957981,0.00045509273,0.00009118514,0.8449912,0.0041440744,0.00027518018,0.0000750339,0.0003768299],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952629,0.0001686084,0.0008626881,0.0017928624,0.0009515423,0.00096138817],"domain_scores_gemma":[0.99601585,0.0011815752,0.0005444693,0.0016590127,0.00031430775,0.00028478456],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007655408,0.000688193,0.0007871993,0.00018829395,0.00041734983,0.00051073503,0.0017728154,0.00140215,0.00007769411],"category_scores_gemma":[0.000036831025,0.00069854676,0.000119543816,0.0012284574,0.00020995105,0.0004051596,0.0006606336,0.0017909624,0.000109762295],"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.000021583055,0.00008393409,0.0000020427321,0.000013771688,0.000009648211,0.000001745932,0.000025217549,0.023025708,7.4957676e-8,0.000258926,0.6328638,0.3436935],"study_design_scores_gemma":[0.0004866556,0.00029966698,0.0000024947701,0.00021817283,0.000020645313,9.2633275e-7,0.0000120556815,0.017933702,6.174427e-7,0.0011092382,0.9792638,0.0006520655],"about_ca_topic_score_codex":0.000008280508,"about_ca_topic_score_gemma":0.00027790203,"teacher_disagreement_score":0.3463999,"about_ca_system_score_codex":0.00024687435,"about_ca_system_score_gemma":0.00018288146,"threshold_uncertainty_score":0.99989426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003040535,0.010476994,0.9859122,0.00009767818,0.00032149028,0.0025821056,0.000013389972,0.00025957552,0.00003252637],"genre_scores_gemma":[0.8156018,0.0017977468,0.17370577,0.00037070474,0.0010612877,0.006714074,0.000021204776,0.000072625946,0.00065474975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752635,0.000064845786,0.00048125544,0.0010625067,0.0001444899,0.00072052487],"domain_scores_gemma":[0.9982651,0.00024827002,0.00023763605,0.0007827747,0.00017196393,0.000294264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046821553,0.00036975727,0.00035711506,0.00005809589,0.0007683763,0.00038269282,0.00066310953,0.00022477987,0.00000718297],"category_scores_gemma":[0.0000073166507,0.00035873658,0.00008315497,0.00037730238,0.00025771355,0.0002836825,0.0007091434,0.00031379075,0.000009096753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009858743,0.00021943696,0.000036579495,0.00001212469,0.000056487526,6.867376e-7,0.00025641875,0.16167426,0.00004963011,0.00078567624,0.0014239537,0.8354749],"study_design_scores_gemma":[0.0009483939,0.0002701468,0.00012055714,0.00006344263,0.000026787036,0.000016727117,0.0001459363,0.96024346,0.00012170949,0.000102563165,0.037562832,0.0003774696],"about_ca_topic_score_codex":0.0000094101515,"about_ca_topic_score_gemma":0.00005016283,"teacher_disagreement_score":0.83509743,"about_ca_system_score_codex":0.00006576023,"about_ca_system_score_gemma":0.000024182531,"threshold_uncertainty_score":0.99988645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35952574,0.00007705196,0.6353003,0.00014363248,0.00019550977,0.00016863494,0.0000034498305,0.000045201195,0.00454049],"genre_scores_gemma":[0.98420906,0.00007976861,0.013862942,0.00014802364,0.0000705363,0.000029855564,0.0000034792374,0.0000059701283,0.001590362],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990281,0.000012587674,0.00021139669,0.00030346328,0.00013692459,0.00030751535],"domain_scores_gemma":[0.99854094,0.00010107268,0.00017183894,0.0010236178,0.0000906339,0.00007189315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043736192,0.00011018042,0.00029828845,0.00009695858,0.00036753836,0.0001924485,0.0008460796,0.00006903435,0.00003679497],"category_scores_gemma":[0.000014855019,0.00009489805,0.00010891971,0.00019693248,0.00009997555,0.00032795896,0.00042147678,0.00006771558,0.0000017926106],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040630814,0.00011991458,0.7936043,0.0000943764,0.00086602854,0.0000022090246,0.00095893646,0.016251478,0.000048948543,0.054435782,0.0065237912,0.12705362],"study_design_scores_gemma":[0.00022160508,0.00005173011,0.14537516,0.0000107384285,0.0000818103,6.6525735e-7,0.000015542311,0.8529433,0.00012372143,0.00009898937,0.00097405084,0.000102672486],"about_ca_topic_score_codex":0.000032538985,"about_ca_topic_score_gemma":0.0003314065,"teacher_disagreement_score":0.83669186,"about_ca_system_score_codex":0.000009550033,"about_ca_system_score_gemma":0.000016677906,"threshold_uncertainty_score":0.38698304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061467257,0.00006745862,0.9892006,0.00007103023,0.00019517752,0.0018454673,0.00000861586,0.00023085803,0.0022340969],"genre_scores_gemma":[0.8173715,0.0000034252869,0.18030556,0.0015625973,0.00029381196,0.00043210332,0.0000047533913,0.00001452354,0.000011766947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699503,0.00003398387,0.00042184145,0.000716056,0.0008030612,0.001030044],"domain_scores_gemma":[0.99821633,0.00011287951,0.00012532827,0.0010723871,0.00023967345,0.0002334163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013964223,0.00027653866,0.00029049604,0.00025727277,0.0008521045,0.0006654627,0.0022354838,0.0001173654,0.000006923544],"category_scores_gemma":[0.000029447894,0.00025510284,0.00008833516,0.0017562291,0.0006342796,0.0019174698,0.00022753737,0.00016337914,0.000012986216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015122465,0.00015526249,0.00008456725,0.000066371256,0.00002286943,5.437012e-7,0.003763849,0.6343377,0.038849726,0.08661061,0.0004460526,0.23551118],"study_design_scores_gemma":[0.0012528825,0.00010815103,0.0001480113,0.000011252592,0.000009847358,0.0000023982452,0.00001584855,0.98995847,0.0018168774,0.0036898905,0.0026755969,0.00031076066],"about_ca_topic_score_codex":0.0000083291025,"about_ca_topic_score_gemma":0.0000024455178,"teacher_disagreement_score":0.81122476,"about_ca_system_score_codex":0.00019826829,"about_ca_system_score_gemma":0.0006851706,"threshold_uncertainty_score":0.9999901},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012914474,0.0000032759217,0.9776204,0.00003508107,0.00029936034,0.00040118498,4.474222e-7,0.00007478917,0.008650949],"genre_scores_gemma":[0.6848196,0.000004145113,0.31446108,0.0006064134,0.00006976789,0.000029086497,0.000002906212,0.0000014321403,0.000005560129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880743,0.000016736843,0.00028800333,0.00029291242,0.00027167873,0.0003232365],"domain_scores_gemma":[0.9992273,0.000021419708,0.00009568691,0.00040536036,0.00015304044,0.00009718231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030712,0.00009955958,0.00009934679,0.0002624992,0.0002597532,0.00063428516,0.0010166515,0.000029026463,0.0000013663511],"category_scores_gemma":[0.0000061410888,0.00009039317,0.000014634748,0.00082685705,0.00018519373,0.009514194,0.00036039206,0.000055015,0.000010448171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060935013,0.000028523324,0.00014702312,0.000031446285,0.0000020651999,2.947415e-7,0.0042943344,0.0035044826,0.00006985882,0.24650866,0.0001645213,0.7452427],"study_design_scores_gemma":[0.00031192577,0.00013129773,0.008149845,0.000014883454,7.057529e-7,0.00000525427,0.000053514268,0.9895417,0.00044252237,0.0004096932,0.0008167899,0.000121857025],"about_ca_topic_score_codex":0.0000054292714,"about_ca_topic_score_gemma":0.0000015878433,"teacher_disagreement_score":0.98603725,"about_ca_system_score_codex":0.0000405984,"about_ca_system_score_gemma":0.00003458454,"threshold_uncertainty_score":0.68975604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023805834,0.0007273496,0.9649292,0.0077949697,0.00038694212,0.0017290217,0.000013130549,0.0001846608,0.00042888403],"genre_scores_gemma":[0.976829,0.000054612494,0.017931486,0.0028304618,0.0011138876,0.00080790365,0.000008614117,0.00003471906,0.00038931533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753207,0.00008549837,0.0003863313,0.0009962502,0.00028009166,0.00071974105],"domain_scores_gemma":[0.9977015,0.0007654522,0.00013976614,0.0006291196,0.0003408753,0.00042326032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096876425,0.00030030266,0.00040561653,0.00010614896,0.0008155431,0.00032877905,0.00039576477,0.00016737136,0.0000026789428],"category_scores_gemma":[0.000043063188,0.0002900406,0.000048270158,0.00047819057,0.00022496504,0.000054130818,0.00029917547,0.0002201217,0.000010170764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030772857,0.00023063365,0.0020482703,0.00003962443,0.00016748346,0.0000063187467,0.0027843125,0.05894569,0.00028290384,0.13307032,0.018029261,0.7840874],"study_design_scores_gemma":[0.001073797,0.00035459932,0.0008961064,0.00006132335,0.000033811248,0.000028701064,0.0000678812,0.7675849,0.000018790926,0.0008374386,0.22867689,0.00036575948],"about_ca_topic_score_codex":0.000010110132,"about_ca_topic_score_gemma":0.000022863258,"teacher_disagreement_score":0.95302314,"about_ca_system_score_codex":0.000034664874,"about_ca_system_score_gemma":0.000026057676,"threshold_uncertainty_score":0.9999552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002483278,0.0031099338,0.9562506,0.0025538725,0.009921443,0.0008753747,0.000014234003,0.0011600122,0.025866184],"genre_scores_gemma":[0.94403195,0.0005203731,0.039375443,0.0068558147,0.0068381014,0.0004920876,0.00020793965,0.00019233134,0.0014859523],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954822,0.00019999343,0.00071319344,0.0019848028,0.0006215278,0.0009982924],"domain_scores_gemma":[0.9956954,0.00022798256,0.0004300718,0.0029717258,0.00016304327,0.00051175646],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00037146118,0.0007162781,0.0008062139,0.000097707416,0.00015223022,0.000877678,0.005070788,0.0010775062,0.00031442635],"category_scores_gemma":[0.00004722181,0.0007520881,0.0004324438,0.00056704716,0.000092892835,0.0003043324,0.00840181,0.0028078947,0.000492263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023911174,0.00010234526,0.00021817519,0.000083165905,0.0001861237,0.00033853823,0.0008150023,0.15527701,0.0000066121675,0.018467933,0.7818902,0.042590946],"study_design_scores_gemma":[0.00027106467,0.00007632861,0.00047913654,0.00024402117,0.000029147519,0.000015542335,0.00000492629,0.89589894,0.000010240231,0.0071532167,0.09499224,0.0008251973],"about_ca_topic_score_codex":0.000017463086,"about_ca_topic_score_gemma":0.000019031522,"teacher_disagreement_score":0.94378364,"about_ca_system_score_codex":0.00014746597,"about_ca_system_score_gemma":0.00026957114,"threshold_uncertainty_score":0.99961805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33596164,0.00019694558,0.6296568,0.012830486,0.002617755,0.0009540938,0.0000071325694,0.00023359362,0.017541565],"genre_scores_gemma":[0.9882422,0.00031723626,0.0106518315,0.00033163629,0.00019473504,0.00007720865,0.000004560382,0.00001413567,0.00016645704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985715,0.00003036989,0.00048230932,0.00035879583,0.00027919104,0.0002777939],"domain_scores_gemma":[0.9978312,0.00009475067,0.00041292008,0.00044106704,0.001162292,0.0000577433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047544466,0.00019102413,0.00022825014,0.00015259536,0.00030938972,0.00025009306,0.0018934017,0.000104030725,0.00003068617],"category_scores_gemma":[0.00011208571,0.00015686682,0.00005597122,0.0008416549,0.0002620899,0.00061345793,0.0010904648,0.00037581276,0.0000062881677],"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.000056953704,0.00029404793,0.009605067,0.000014133649,0.000065440276,2.6528207e-7,0.0005671903,0.007108712,0.001024423,0.92974365,0.0008525138,0.05066758],"study_design_scores_gemma":[0.0005031495,0.00007635543,0.10552937,0.00044837905,0.000010059202,0.0000096998765,0.0001150414,0.8883333,0.0001802484,0.0038891314,0.00070087065,0.00020436819],"about_ca_topic_score_codex":0.00007914943,"about_ca_topic_score_gemma":0.00013086574,"teacher_disagreement_score":0.92585456,"about_ca_system_score_codex":0.00006978561,"about_ca_system_score_gemma":0.00006365297,"threshold_uncertainty_score":0.6396843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07343684,0.000070927876,0.89843994,0.0013555492,0.00082871807,0.00036229572,3.6673242e-7,0.0003407688,0.025164586],"genre_scores_gemma":[0.92085874,0.0000026882963,0.07730071,0.0010671716,0.00013458023,0.000011924201,6.8594517e-7,0.000006510692,0.00061696063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989332,0.000055271314,0.00018286268,0.0003483529,0.00017159157,0.00030870712],"domain_scores_gemma":[0.99917847,0.00007792422,0.000030660718,0.0005635014,0.0000622965,0.00008713814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001462403,0.00010162062,0.00011324043,0.000065758904,0.000053471565,0.00006483551,0.0006311864,0.00006521088,0.00019671512],"category_scores_gemma":[0.000017076885,0.000082866565,0.000022440612,0.0002608668,0.00006832838,0.00027998866,0.0003527378,0.00012027644,0.00059933856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052257303,0.00088186207,0.016291035,0.00003323062,0.00002223646,0.00020463551,0.0047989027,0.0022915157,0.009182008,0.057651855,0.07528947,0.833301],"study_design_scores_gemma":[0.0005204606,0.000058598896,0.015129505,0.000033860328,5.9345655e-7,0.000010090366,0.000023220524,0.9714197,0.0024243537,0.0003118259,0.009920209,0.00014758624],"about_ca_topic_score_codex":0.00013425027,"about_ca_topic_score_gemma":0.00029817031,"teacher_disagreement_score":0.9691282,"about_ca_system_score_codex":0.000024750858,"about_ca_system_score_gemma":0.000014100578,"threshold_uncertainty_score":0.7703484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49911612,0.010634488,0.34052104,0.0119689945,0.008936312,0.0005287249,0.0000061061905,0.00013700499,0.12815121],"genre_scores_gemma":[0.966531,0.000610046,0.032215867,0.00015533702,0.00043796838,0.000004598025,5.440494e-7,0.000003072515,0.000041572534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983521,0.00018829487,0.0005594733,0.00015509906,0.00052119646,0.00022384258],"domain_scores_gemma":[0.99838334,0.00023117784,0.0004151026,0.00051038794,0.00038993763,0.00007005913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023066576,0.00008842666,0.00017015093,0.00019229011,0.00030925195,0.00027520797,0.004088681,0.000041695614,0.0000071372256],"category_scores_gemma":[0.000017770324,0.000072220086,0.000043013628,0.0005316117,0.0003152554,0.00088597886,0.00070041564,0.00018491136,0.000011142331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055459877,0.00028469085,0.29380864,0.0000251992,0.00011095345,0.00003373991,0.005060749,0.013636958,0.000040354906,0.58191025,0.004297302,0.10073571],"study_design_scores_gemma":[0.000558117,0.00026575377,0.07355817,0.00064241,0.000005853239,0.00060720736,0.00053404004,0.88584876,0.000018830931,0.0013356201,0.03645192,0.00017334237],"about_ca_topic_score_codex":0.000009695837,"about_ca_topic_score_gemma":0.00013055399,"teacher_disagreement_score":0.87221175,"about_ca_system_score_codex":0.00007071711,"about_ca_system_score_gemma":0.00010947212,"threshold_uncertainty_score":0.7597855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008050188,0.000013534254,0.9886779,0.0010502485,0.0005450609,0.00083004497,0.000010467154,0.0007966626,0.000025902198],"genre_scores_gemma":[0.8926473,0.000014685084,0.106088966,0.00042993782,0.00003716025,0.00061957666,0.00000353651,0.000043901604,0.000114918235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975598,0.000073469695,0.00050245895,0.0008669652,0.00020434655,0.0007930023],"domain_scores_gemma":[0.9982014,0.00016799127,0.00014685505,0.0011795908,0.00018936084,0.00011482964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004472955,0.00032477,0.00040196284,0.00058068737,0.00031991044,0.00006339596,0.0011719104,0.0006305973,0.000010565891],"category_scores_gemma":[0.00001510307,0.00034943753,0.00016429217,0.0012436608,0.00030796303,0.00018400855,0.000012540562,0.0006775768,0.000015167814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010538033,0.00080283865,0.000058973732,0.000036597237,0.00008446042,0.00009045292,0.00018178807,0.59129596,0.0023601502,0.025188597,0.0001732409,0.37962154],"study_design_scores_gemma":[0.0013237577,0.00024923438,0.000009040816,0.00008738261,0.000024777719,0.00001861174,0.00002036848,0.99355614,0.0037444024,0.0005601968,0.000057438083,0.00034867486],"about_ca_topic_score_codex":0.00002280344,"about_ca_topic_score_gemma":0.0004464331,"teacher_disagreement_score":0.8845971,"about_ca_system_score_codex":0.0001942729,"about_ca_system_score_gemma":0.00019216114,"threshold_uncertainty_score":0.99989575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049115043,0.00046492674,0.94406605,0.00066634355,0.0018155313,0.0024582746,0.0000106115085,0.0005201318,0.0008830587],"genre_scores_gemma":[0.7624909,0.0009992977,0.22931352,0.0028886502,0.0013809045,0.0018024329,0.00017030713,0.00017888518,0.0007750955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939508,0.00056998525,0.0010641379,0.0025937872,0.0006414136,0.0011798681],"domain_scores_gemma":[0.99513143,0.00021557277,0.0004581661,0.0033767,0.00039813857,0.0004199637],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019083073,0.0006980612,0.0008537382,0.00040617242,0.00016134944,0.0002231756,0.0033362086,0.00082678517,0.00034381245],"category_scores_gemma":[0.0001901604,0.0007824056,0.00021992122,0.0012052051,0.00009537706,0.0003658446,0.010143036,0.0015173896,0.00070972455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049309336,0.00017380224,0.02024842,0.00003949036,0.00005749293,0.000035100125,0.0008665474,0.95541996,0.000017220591,0.00005357127,0.0019556808,0.021083402],"study_design_scores_gemma":[0.0005420235,0.000110775625,0.024373094,0.00024010584,0.000018896704,0.000017339193,0.000006841857,0.9651094,0.00030687242,0.00077344716,0.007714188,0.0007870377],"about_ca_topic_score_codex":0.00013740988,"about_ca_topic_score_gemma":0.00024783626,"teacher_disagreement_score":0.71475255,"about_ca_system_score_codex":0.00068353576,"about_ca_system_score_gemma":0.00039472542,"threshold_uncertainty_score":0.99946266},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75688714,0.00040118015,0.1623293,0.02704392,0.0008455443,0.0021297147,0.00005465117,0.0003177291,0.049990848],"genre_scores_gemma":[0.99197125,0.0016449089,0.004093451,0.0009835574,0.000027673697,0.0009586227,0.000035353984,0.00000845856,0.00027673697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892783,0.00007785421,0.00029343957,0.0002939497,0.00021951117,0.00018741365],"domain_scores_gemma":[0.9983083,0.00012418436,0.00009642962,0.0012109011,0.00017779238,0.0000823719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012780527,0.00013432512,0.00013356362,0.0001214378,0.00009091801,0.00021088692,0.0021039331,0.00005822872,0.00022157213],"category_scores_gemma":[0.000008248175,0.00013078752,0.00003072639,0.00011218707,0.000070844166,0.0003683785,0.0008808935,0.00025894266,0.00010126789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003759594,0.00040420677,0.010731928,0.000007809345,0.000027724745,0.0000038835956,0.00073772675,0.00063750724,0.000740339,0.80774564,0.0003657882,0.17859367],"study_design_scores_gemma":[0.00045040937,0.00007676709,0.026770927,0.00014897627,0.0000019871359,0.0000038250137,0.00016016919,0.95960075,0.00017264493,0.008213676,0.0041638864,0.00023599234],"about_ca_topic_score_codex":0.00060551806,"about_ca_topic_score_gemma":0.00029158223,"teacher_disagreement_score":0.9589632,"about_ca_system_score_codex":0.00006049041,"about_ca_system_score_gemma":0.000039190683,"threshold_uncertainty_score":0.53333604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071464046,0.00012344055,0.98407453,0.0010420666,0.0006697054,0.0007953933,0.0000058789647,0.0006313078,0.005511258],"genre_scores_gemma":[0.7412592,0.00006837982,0.25608698,0.0008833096,0.00080258586,0.00008035984,0.0000068691647,0.0000641153,0.0007481737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966687,0.0005441206,0.00053056394,0.001007145,0.00039528232,0.0008542209],"domain_scores_gemma":[0.9971786,0.00059758587,0.00026367107,0.0014372176,0.00022915096,0.00029377147],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092940935,0.00041626566,0.0003920493,0.00009771084,0.00026407026,0.0005694453,0.0028583286,0.000120355355,0.00010810556],"category_scores_gemma":[0.000057259487,0.00040972326,0.000117460455,0.00036970567,0.00013082327,0.0005907887,0.0005208657,0.00045365118,0.0008532992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042391748,0.00013538939,0.000040344366,0.000035960806,0.000037993683,0.00007189465,0.00153924,0.0024797628,0.0016966212,0.48750514,0.0066122687,0.499803],"study_design_scores_gemma":[0.0012165015,0.00039442987,0.00064120546,0.00042329854,0.000026621983,0.00006153895,0.000052287076,0.9130888,0.010279037,0.007975171,0.06450909,0.0013319991],"about_ca_topic_score_codex":0.0000044951253,"about_ca_topic_score_gemma":0.000006937107,"teacher_disagreement_score":0.91060907,"about_ca_system_score_codex":0.000066836175,"about_ca_system_score_gemma":0.00014159872,"threshold_uncertainty_score":0.99992466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105886914,0.00064308447,0.89257187,0.0003777625,0.00005170657,0.00013217481,0.0000012696423,0.00001147073,0.00032373954],"genre_scores_gemma":[0.97903305,0.00013427014,0.020622568,0.00007882484,0.00009656652,0.000007698536,4.2760715e-7,0.000007261302,0.000019315668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869645,0.00003638894,0.00055018754,0.00020763425,0.0002393538,0.00026996763],"domain_scores_gemma":[0.9983306,0.0003466122,0.00044901454,0.0003960605,0.00035266735,0.00012502383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007762533,0.00009311582,0.00019274815,0.000053116208,0.00016217383,0.000070745606,0.00048232358,0.0000644217,0.00000962638],"category_scores_gemma":[0.00011680422,0.00008038503,0.000066653105,0.0002946525,0.00007927412,0.00026763053,0.00013430016,0.00031469853,0.0000025618033],"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.00007152252,0.0012815808,0.0022479915,0.000057985715,0.00014522986,0.000006821641,0.0011771964,0.00029282298,0.33725488,0.3891021,0.0044173165,0.26394457],"study_design_scores_gemma":[0.003956378,0.0069676316,0.007778149,0.00069001544,0.00029448632,0.0013967209,0.0004908086,0.2117673,0.39837742,0.1299881,0.23631245,0.001980526],"about_ca_topic_score_codex":0.000003602911,"about_ca_topic_score_gemma":0.0000070216943,"teacher_disagreement_score":0.8731462,"about_ca_system_score_codex":0.000068679416,"about_ca_system_score_gemma":0.00019281542,"threshold_uncertainty_score":0.32780063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41391173,0.0007065868,0.5840745,0.00006154037,0.000101252415,0.00039880595,0.000008194873,0.00003093084,0.0007064431],"genre_scores_gemma":[0.9864887,0.00016648496,0.013143561,0.00014421543,0.000035934,0.00001015755,0.0000018238475,0.0000071454856,0.000001984675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763983,0.00004478354,0.0004041893,0.0008818643,0.000572933,0.0004564191],"domain_scores_gemma":[0.9977288,0.000117481984,0.00010198652,0.0018023265,0.00013709965,0.000112254034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000858019,0.00016048145,0.0003669263,0.00009315541,0.00011026126,0.000056726964,0.0035173816,0.00006164094,0.0000054725265],"category_scores_gemma":[0.000007775291,0.00015198333,0.000020330423,0.0014200878,0.0012513717,0.00068031606,0.0019117271,0.00016008693,0.0000028335696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016377469,0.00058586994,0.0032212676,0.00065617845,0.00004124432,0.0000136783065,0.028627966,0.0022318813,0.26276162,0.21641405,0.00044681874,0.48483565],"study_design_scores_gemma":[0.00044214618,0.00006752118,0.005394181,0.00009969424,0.000004892774,0.0000043667305,0.000026961183,0.97155,0.004969319,0.016906744,0.0003408907,0.00019329306],"about_ca_topic_score_codex":0.000035479978,"about_ca_topic_score_gemma":0.00007692853,"teacher_disagreement_score":0.9693181,"about_ca_system_score_codex":0.000025041583,"about_ca_system_score_gemma":0.00017635456,"threshold_uncertainty_score":0.65362287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033728376,0.00002115736,0.9420514,0.00020519088,0.00036708362,0.00011562413,2.5976937e-7,0.00011392678,0.023396967],"genre_scores_gemma":[0.9902437,0.0000030888962,0.008846639,0.0003996679,0.00030365327,0.0000032368741,6.4572635e-7,0.000006800746,0.00019256663],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900496,0.000062662686,0.00017860522,0.00026551128,0.00021003651,0.00027821225],"domain_scores_gemma":[0.9988682,0.0001626077,0.00006129057,0.0006724055,0.00011489781,0.000120583136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014026443,0.000108956694,0.00015319648,0.000040465235,0.000054495704,0.000041880834,0.0005447417,0.00008367643,0.00035371853],"category_scores_gemma":[0.000019821115,0.000072896946,0.00008969015,0.0002591812,0.000093282084,0.0001909726,0.00020406763,0.00014817547,0.00009663947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028725513,0.0012436436,0.017272204,0.00001293595,0.00016735093,0.000029206138,0.0005582192,0.054216817,0.0017649205,0.25712916,0.3968055,0.2705128],"study_design_scores_gemma":[0.0002481257,0.00095140917,0.026745504,0.00003050313,0.0000022828078,0.000007756983,0.0000017881378,0.96993315,0.00079205574,0.0005116633,0.00066083745,0.00011490608],"about_ca_topic_score_codex":0.000042792573,"about_ca_topic_score_gemma":0.0000045723027,"teacher_disagreement_score":0.9565153,"about_ca_system_score_codex":0.000032227228,"about_ca_system_score_gemma":0.000032167784,"threshold_uncertainty_score":0.387297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027428858,0.00002852298,0.99329245,0.00060143066,0.00011279549,0.00045301713,2.2572517e-7,0.0002484087,0.0049888752],"genre_scores_gemma":[0.6927662,0.0000010520316,0.30645105,0.00045347607,0.00006882595,0.00005631592,8.06718e-7,0.0000081886665,0.00019410672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886155,0.00018637936,0.00021425393,0.00031215063,0.00016363132,0.00026204812],"domain_scores_gemma":[0.9983775,0.00010881195,0.000056981804,0.001223232,0.00010704574,0.00012644276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047116043,0.0001275376,0.00015766021,0.00007568787,0.00006662354,0.00012702175,0.0013781688,0.000053318847,0.0000065100066],"category_scores_gemma":[0.000006422705,0.00011077713,0.000030326477,0.000698864,0.000020305954,0.0004115375,0.00024055889,0.000110280336,0.00020054718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030280165,0.000064283704,0.000006564809,0.000014449625,0.000008505924,0.000003197351,0.0023187886,0.4495381,0.0003284114,0.439844,0.010347283,0.09749613],"study_design_scores_gemma":[0.00023816765,0.00010123109,0.000020355283,0.00012604575,0.0000013439009,9.203914e-7,0.00003989332,0.9848817,0.0039888313,0.010398471,0.000071674025,0.00013138786],"about_ca_topic_score_codex":0.0006867976,"about_ca_topic_score_gemma":0.00027591866,"teacher_disagreement_score":0.6924919,"about_ca_system_score_codex":0.00014010585,"about_ca_system_score_gemma":0.000094866205,"threshold_uncertainty_score":0.45173603},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3156402e-8,0.43779188,0.55182743,0.000037520433,0.0003479754,0.009400459,0.0000049346954,0.000108412234,0.00048134945],"genre_scores_gemma":[4.837148e-7,0.90100324,0.09438915,0.002624907,0.00008385097,0.0018161874,0.00006491885,0.00000999302,0.0000072690946],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996583,0.00017424219,0.0012538616,0.0006388165,0.0008408385,0.0005092736],"domain_scores_gemma":[0.9966224,0.00025354722,0.001161608,0.0011549928,0.0006039977,0.00020347642],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001296699,0.00045041522,0.0012100146,0.0004618405,0.00035126152,0.0013387077,0.0023559595,0.00015336821,0.000013489414],"category_scores_gemma":[0.000057698227,0.00036234426,0.00016651211,0.0023731857,0.00022651807,0.00805176,0.0011578717,0.00036386258,0.00015897487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.777935e-7,0.000009539403,5.143585e-7,0.019799119,0.000005888777,0.0000011786967,0.000055966346,0.0058345734,9.95352e-9,0.0025187538,0.0015486295,0.9702253],"study_design_scores_gemma":[0.00010516296,0.000060861046,0.000002222612,0.018530244,0.000020743011,0.000039306207,6.522935e-7,0.47029302,8.928674e-8,0.0000027104104,0.51071763,0.00022735991],"about_ca_topic_score_codex":0.0000024799137,"about_ca_topic_score_gemma":4.479874e-8,"teacher_disagreement_score":0.9699979,"about_ca_system_score_codex":0.00017554553,"about_ca_system_score_gemma":0.001071798,"threshold_uncertainty_score":0.9998829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8777704,0.000044696328,0.042436324,0.0012784246,0.00487077,0.0006178017,0.0000015746135,0.00016515305,0.07281482],"genre_scores_gemma":[0.9941428,0.000049264636,0.00357896,0.00022576067,0.00008157736,0.000035876394,2.8573524e-7,0.000005640294,0.0018798448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992072,0.000005865035,0.0001493683,0.00026458802,0.00022269088,0.00015028435],"domain_scores_gemma":[0.999413,0.000045572742,0.000099138735,0.00023550689,0.00015272827,0.000054065273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017534924,0.000095445896,0.00009934677,0.000024501522,0.00005479193,0.00012403846,0.001059136,0.00007485081,0.00008368867],"category_scores_gemma":[0.000008720071,0.0000623498,0.00003069713,0.00015109475,0.00011282111,0.00021915036,0.00042957018,0.00029580537,0.0000040236473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010521801,0.00007133624,0.0020174403,0.000006433162,0.000015327269,6.4382147e-7,0.00031885706,0.00017890052,0.0076879626,0.88259166,0.0043677557,0.10273318],"study_design_scores_gemma":[0.0003018819,0.00011213102,0.0049421224,0.000043616445,0.0000034973793,0.000022142633,0.000057227087,0.98065376,0.00320921,0.0027377282,0.0077516115,0.00016507899],"about_ca_topic_score_codex":0.0000043524915,"about_ca_topic_score_gemma":0.000021788324,"teacher_disagreement_score":0.9804748,"about_ca_system_score_codex":0.000008081883,"about_ca_system_score_gemma":0.000025272162,"threshold_uncertainty_score":0.25425512},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014220415,0.0010501347,0.96011764,0.0032077574,0.0004756406,0.0006157058,0.0000045599027,0.0003908445,0.019917328],"genre_scores_gemma":[0.85986465,0.00038083157,0.137438,0.00015241341,0.00008221217,0.00017554904,0.00007456794,0.000052243715,0.0017795601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919635,0.004693656,0.0006915838,0.0014982682,0.00044357203,0.0007094002],"domain_scores_gemma":[0.9922961,0.0012249969,0.000639085,0.004299635,0.0012989253,0.00024128267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0062830127,0.00050093216,0.0005570264,0.0002911216,0.0002489409,0.0009946465,0.0046747797,0.00041557525,0.000054932978],"category_scores_gemma":[0.0004055319,0.00049713685,0.00013949502,0.00096476736,0.00036976105,0.00035330377,0.004305711,0.0014002857,0.00003356225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008776001,0.0015981683,0.020157903,0.000453608,0.00029733154,0.00015847493,0.040365607,0.030886825,0.00025731072,0.45330042,0.0055300863,0.4469065],"study_design_scores_gemma":[0.00059041026,0.0000014666313,0.004061322,0.005405427,0.000014444175,0.000027832135,0.000032440945,0.98150665,0.0016290506,0.0040190336,0.0019751927,0.0007367454],"about_ca_topic_score_codex":0.00077560975,"about_ca_topic_score_gemma":0.0044052526,"teacher_disagreement_score":0.9506198,"about_ca_system_score_codex":0.00026576445,"about_ca_system_score_gemma":0.00040743704,"threshold_uncertainty_score":0.99974805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3956447,0.0010736502,0.5960562,0.00008274367,0.00031204286,0.0010217149,6.9192026e-7,0.00020566661,0.005602589],"genre_scores_gemma":[0.98573613,0.00007417747,0.013567661,0.00029647502,0.000057028286,0.000113133516,0.000001000309,0.000019444471,0.00013492278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996613,0.000031358384,0.00035320898,0.0013492666,0.0006502593,0.0010028591],"domain_scores_gemma":[0.9983702,0.00010738823,0.00014760686,0.0010932843,0.000051193074,0.00023034604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013854547,0.00027274922,0.00031966812,0.00021156519,0.0002534403,0.00049822405,0.0020158843,0.000111624366,0.000020939331],"category_scores_gemma":[0.0000083422565,0.00026547204,0.000031941312,0.0016052761,0.00031816366,0.0008341587,0.0012136607,0.0004313085,0.0000741502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048803446,0.00014504221,0.0037066313,0.00003241307,0.000008384729,0.000023561346,0.006324278,0.17089014,0.073504105,0.042950977,0.000097008495,0.70226866],"study_design_scores_gemma":[0.00049002626,0.00007396281,0.00246204,0.000029504052,0.0000018431666,0.000010378554,0.00011406037,0.9923614,0.00024847433,0.0028589673,0.0010004871,0.0003488247],"about_ca_topic_score_codex":0.000006399568,"about_ca_topic_score_gemma":0.00006496274,"teacher_disagreement_score":0.8214713,"about_ca_system_score_codex":0.00016058273,"about_ca_system_score_gemma":0.00013146528,"threshold_uncertainty_score":0.99997973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002699052,0.0011829375,0.96534646,0.00059274,0.00036461357,0.029365713,0.0000012889197,0.0001665861,0.0002806333],"genre_scores_gemma":[0.88367486,0.00046128384,0.06905596,0.00082876236,0.00035508318,0.045394413,0.000016019447,0.00008163007,0.00013197014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756575,0.00029221093,0.0007657974,0.00047665887,0.00031196207,0.0005876302],"domain_scores_gemma":[0.9952508,0.001701325,0.00083762285,0.0017703188,0.00024309989,0.00019683405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001425749,0.00031158453,0.00037507206,0.00015303183,0.0011949803,0.00076866103,0.0019743429,0.00013008685,0.0000058886394],"category_scores_gemma":[0.000014569785,0.0002926514,0.00017682704,0.0005740632,0.00009236937,0.00042349583,0.00046680678,0.00093680667,0.0000051127377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007611747,0.00020071649,0.0011297406,0.000025990346,0.00004300213,0.0000019040947,0.00037065166,0.21213447,0.00009677014,0.0015214673,0.00008382029,0.78431535],"study_design_scores_gemma":[0.0017124697,0.0004030361,0.00034528438,0.0006668732,0.0000114223485,0.00007014461,0.00004899444,0.91069555,0.000005215497,0.00017132261,0.08556052,0.00030916877],"about_ca_topic_score_codex":0.0000011485577,"about_ca_topic_score_gemma":0.000013231719,"teacher_disagreement_score":0.8962905,"about_ca_system_score_codex":0.00015024975,"about_ca_system_score_gemma":0.000120209894,"threshold_uncertainty_score":0.99995255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67788136,0.0002658791,0.31181446,0.000057813162,0.008160071,0.0012209124,0.000054395903,0.00012910643,0.00041600282],"genre_scores_gemma":[0.99639004,0.0004422955,0.0021928893,0.000020047333,0.0004967555,0.000106450076,0.00016343001,0.00002562643,0.0001624629],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524957,0.0022574777,0.001234832,0.0004303259,0.0004853927,0.0003424258],"domain_scores_gemma":[0.9920554,0.0010065173,0.00097251165,0.005290705,0.0005867426,0.00008808782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050652823,0.00024726032,0.0006667969,0.00014179452,0.00014670583,0.000078668396,0.0036295122,0.00020051975,0.00006241788],"category_scores_gemma":[0.000075909236,0.00026113383,0.00015612082,0.00096575625,0.00024275857,0.0008746067,0.0007859696,0.00026093255,0.000048039135],"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.00010879503,0.0021145607,0.05480215,0.00044106663,0.00034353387,0.0000011094232,0.0024046667,0.013104133,0.8614878,0.033891674,0.00046426637,0.030836232],"study_design_scores_gemma":[0.0042705904,0.0012557791,0.11127927,0.00089325465,0.00014016198,0.000008832815,0.00010775614,0.62486905,0.22352697,0.0007415022,0.03103607,0.0018707971],"about_ca_topic_score_codex":0.00012490436,"about_ca_topic_score_gemma":0.000012979214,"teacher_disagreement_score":0.63796085,"about_ca_system_score_codex":0.000113516246,"about_ca_system_score_gemma":0.00020848052,"threshold_uncertainty_score":0.9999841},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1757167,0.00006850935,0.818103,0.00003861539,0.002760347,0.0024914693,0.000011154675,0.0006424316,0.0001677801],"genre_scores_gemma":[0.97373325,0.000007164858,0.024558978,0.00047251803,0.00021425284,0.0006763904,0.0000072622547,0.00006579066,0.00026437783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966265,0.00016531421,0.00067700783,0.0012345472,0.00039678608,0.00089982484],"domain_scores_gemma":[0.99662656,0.001134198,0.00023323885,0.0016079308,0.00016947064,0.0002286305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007426222,0.00044026307,0.0005246617,0.0001581399,0.0005029939,0.00028390271,0.0012970913,0.00026143313,0.000083543135],"category_scores_gemma":[0.0000029070022,0.00045761798,0.0004308692,0.00083729276,0.00008008888,0.00036343408,0.000013467103,0.0006274695,0.000113975104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038673672,0.00027046524,0.00012454025,0.00004852209,0.000028781493,0.000002612422,0.00011312708,0.8223516,0.00018246644,0.0003379655,0.00008990724,0.17641136],"study_design_scores_gemma":[0.0013130674,0.0008054531,0.000074913354,0.000111982925,0.000020907188,0.000008986935,0.000039246617,0.9910096,0.004630786,0.0001041874,0.0013885475,0.00049235235],"about_ca_topic_score_codex":0.00002133706,"about_ca_topic_score_gemma":0.000012896497,"teacher_disagreement_score":0.79801655,"about_ca_system_score_codex":0.00021232135,"about_ca_system_score_gemma":0.00016060336,"threshold_uncertainty_score":0.99978757},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3218539,0.00020503724,0.6767858,0.00007436186,0.0006324694,0.00022438307,0.0000037576917,0.00011259948,0.00010764686],"genre_scores_gemma":[0.9838883,0.00036547205,0.01523447,0.00021986691,0.00010121811,0.000031112413,0.0000028562542,0.000045719946,0.00011095126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968678,0.0002839874,0.0007095678,0.00095197407,0.0003766889,0.0008100316],"domain_scores_gemma":[0.9969629,0.0008816048,0.00021173914,0.0016093376,0.000111235444,0.00022316484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037306704,0.0004100306,0.00060740684,0.0002541006,0.00016337639,0.000104129074,0.0009157692,0.00038127555,0.00003620569],"category_scores_gemma":[0.000013759187,0.00041650698,0.00017895018,0.0009848833,0.00017594316,0.0002670134,0.000063663705,0.0006910207,0.000010000659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047578193,0.00018814235,0.0005960978,0.000016310163,0.00003543541,0.00002396575,0.00018564767,0.9112164,0.00022035725,0.00032814575,0.000005110023,0.08713681],"study_design_scores_gemma":[0.0008632547,0.00017739837,0.00054083037,0.00015044387,0.00002041376,0.00009876834,0.00005433875,0.9966232,0.0008724752,0.000056444318,0.00013650287,0.00040590242],"about_ca_topic_score_codex":0.00020486572,"about_ca_topic_score_gemma":0.00015305288,"teacher_disagreement_score":0.66203445,"about_ca_system_score_codex":0.000087148306,"about_ca_system_score_gemma":0.000027663675,"threshold_uncertainty_score":0.9998287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18323705,0.000018661667,0.8154365,0.000036271293,0.0006386506,0.00018190533,8.489445e-7,0.00011756913,0.000332577],"genre_scores_gemma":[0.98037803,0.0000069945577,0.019234544,0.00006230431,0.00022370824,0.000025564852,0.000005740269,0.0000122181245,0.000050918043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998425,0.00009646508,0.00046488238,0.00039622595,0.0002581755,0.00035923716],"domain_scores_gemma":[0.99869484,0.00033952502,0.00016141748,0.0005234308,0.00018287424,0.00009789701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004061309,0.00014409033,0.00023103872,0.00009488355,0.00007198753,0.000050797942,0.0005950861,0.00011396012,0.000040151506],"category_scores_gemma":[0.00011156987,0.00013584366,0.000049468097,0.000574219,0.00013050814,0.00046634336,0.00024592542,0.00016219099,0.000015915622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001687014,0.0009443658,0.32784253,0.00010587521,0.00007571426,0.00006608191,0.010629679,0.019309716,0.00692445,0.086458065,0.0047593066,0.5427155],"study_design_scores_gemma":[0.00047725637,0.00004507164,0.01852455,0.0000687058,0.000002993503,0.00000400649,0.000057643272,0.9791133,0.0013693282,0.00015614953,0.0000327699,0.00014827316],"about_ca_topic_score_codex":0.00021884948,"about_ca_topic_score_gemma":0.0034264473,"teacher_disagreement_score":0.9598035,"about_ca_system_score_codex":0.000081895785,"about_ca_system_score_gemma":0.00003459603,"threshold_uncertainty_score":0.55395436},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64446825,0.003216619,0.23946941,0.0019880948,0.00035512057,0.0035174654,0.0000047237113,0.0003654661,0.10661482],"genre_scores_gemma":[0.97466874,0.00009805954,0.02478895,0.0003339478,0.000010855617,0.000090593596,5.9209333e-7,0.000004022272,0.0000042679408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985864,0.000078448495,0.00031996035,0.00050937163,0.0002367598,0.00026906322],"domain_scores_gemma":[0.99836993,0.00046795374,0.00012495687,0.00095708383,0.000031702857,0.00004837704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053093047,0.00015609014,0.000222277,0.000044364326,0.00006441848,0.000028116268,0.00071604736,0.000061550425,0.000010183845],"category_scores_gemma":[0.00006827137,0.00011061026,0.000035838708,0.0005726695,0.00020949016,0.00019123568,0.00012943696,0.0002242697,0.0000026441915],"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.000036451092,0.00010923428,0.0005583075,0.000012369931,0.000002020154,9.502599e-7,0.00020969471,0.00079124,0.0001398048,0.7588607,0.000033320404,0.23924588],"study_design_scores_gemma":[0.00026843837,0.000113891554,0.009904809,0.000019646493,0.0000016789407,0.0000015052545,0.00001601647,0.002328184,0.0012626494,0.9854635,0.00049315556,0.00012653106],"about_ca_topic_score_codex":0.000004780169,"about_ca_topic_score_gemma":0.000038704562,"teacher_disagreement_score":0.33020043,"about_ca_system_score_codex":0.000032641536,"about_ca_system_score_gemma":0.000023015951,"threshold_uncertainty_score":0.45105553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05764345,0.00010733766,0.9322889,0.00014723121,0.00062468305,0.00039945627,0.00000831234,0.0004987137,0.008281953],"genre_scores_gemma":[0.9928042,0.00010493448,0.005731405,0.00008902381,0.00025179912,0.0000027742312,0.0000050245644,0.000037325506,0.00097347924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971491,0.00014881013,0.00022782119,0.0016549366,0.00016396567,0.0006553634],"domain_scores_gemma":[0.99690145,0.00017564949,0.0003802726,0.0020799006,0.0001857004,0.0002770242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024213706,0.00046111224,0.00041770414,0.00020454302,0.000179239,0.00017043426,0.0027150225,0.00030949633,0.00005767463],"category_scores_gemma":[0.000016982489,0.0004128028,0.00017745001,0.0005163385,0.00016766811,0.00044692768,0.0032855074,0.00066619064,0.00021617496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100088524,0.00025442173,0.010368132,0.00022798819,0.00044212356,0.0034449429,0.00060237694,0.48963663,0.0000575634,0.46349877,0.0011508812,0.030216098],"study_design_scores_gemma":[0.0017468735,0.00035631345,0.0024535207,0.0012259834,0.00016786845,0.000084439765,0.000060258026,0.93274444,0.0002609066,0.056482546,0.0024889768,0.001927862],"about_ca_topic_score_codex":0.000054365693,"about_ca_topic_score_gemma":0.00003743078,"teacher_disagreement_score":0.93516076,"about_ca_system_score_codex":0.00040608627,"about_ca_system_score_gemma":0.00034493842,"threshold_uncertainty_score":0.9998324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26455933,0.00021055478,0.7321519,0.000032721116,0.0012543371,0.0002599046,0.000004984563,0.00025932273,0.0012669564],"genre_scores_gemma":[0.99683076,0.000057010206,0.002215979,0.00017430932,0.00037633927,0.000004141249,0.000032841534,0.000040268107,0.0002683708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596816,0.00040347682,0.0004787117,0.0017750212,0.00024093359,0.0011336885],"domain_scores_gemma":[0.99682754,0.00028757734,0.00047369226,0.0018321009,0.000177571,0.0004015027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066651206,0.00057770574,0.0006533561,0.00034194367,0.00022790408,0.00014957284,0.0026536258,0.00060317304,0.00006451494],"category_scores_gemma":[0.000017532135,0.00072819414,0.00027453268,0.001186944,0.00023698615,0.00033777373,0.0056638857,0.0014056002,0.000050261464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002231324,0.00030797347,0.0009961925,0.000033304645,0.0000297761,0.00018868534,0.00007353572,0.7632787,0.0000147157625,0.23234513,0.00008235699,0.0026272913],"study_design_scores_gemma":[0.00050001126,0.00001973679,0.0019492245,0.00034212304,0.000031241303,0.000008437281,0.000010709189,0.98912686,0.00007391733,0.007154117,0.000064639324,0.00071901054],"about_ca_topic_score_codex":0.0005819318,"about_ca_topic_score_gemma":0.00029528973,"teacher_disagreement_score":0.73227143,"about_ca_system_score_codex":0.0006144618,"about_ca_system_score_gemma":0.0002453195,"threshold_uncertainty_score":0.9995169},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5317457,0.011170135,0.450335,0.0010212958,0.0033655479,0.0008494932,0.000008668955,0.0002692384,0.0012349851],"genre_scores_gemma":[0.97967726,0.016567992,0.0022047784,0.0004242911,0.00054417626,0.00012534455,0.00001255786,0.00004325993,0.00040036035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656063,0.00042816004,0.00077000004,0.0009680439,0.0005500284,0.0007231161],"domain_scores_gemma":[0.99468535,0.0011210468,0.0006844944,0.003059186,0.00027397336,0.00017595167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084415893,0.0004989235,0.0007265339,0.000067414905,0.00037459662,0.0001680678,0.0033262428,0.00052039104,0.000018454013],"category_scores_gemma":[0.00011423576,0.000369229,0.00040576034,0.0003969339,0.0005643093,0.00020815838,0.0025767612,0.0014433414,0.000055594937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056338916,0.00079995446,0.1435127,0.0003913129,0.0018537018,0.00024525987,0.0035833027,0.6297002,0.00015999148,0.017445548,0.084672265,0.11707238],"study_design_scores_gemma":[0.007650123,0.0005171824,0.33815205,0.0015503346,0.0003258248,0.00024403751,0.0001680621,0.51601297,0.0021719825,0.037045334,0.09195684,0.004205264],"about_ca_topic_score_codex":0.00006364656,"about_ca_topic_score_gemma":0.00014572154,"teacher_disagreement_score":0.44813022,"about_ca_system_score_codex":0.00010660262,"about_ca_system_score_gemma":0.00025869207,"threshold_uncertainty_score":0.99987596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024398968,0.0017111602,0.9833298,0.00023889689,0.010969501,0.00079494296,0.000006311163,0.00021858445,0.00029095128],"genre_scores_gemma":[0.9817956,0.0024678416,0.013860025,0.00017150487,0.000949623,0.00027966517,0.000016414577,0.000089648565,0.00036965345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508464,0.0006748501,0.0012529986,0.0012421296,0.0006987165,0.0010466819],"domain_scores_gemma":[0.9937525,0.0017533198,0.0008128163,0.0033766292,0.00017305161,0.00013168261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001257359,0.00064441195,0.00078999734,0.00026523645,0.00043854723,0.00035810552,0.003412876,0.0007259891,0.000008479665],"category_scores_gemma":[0.000011857854,0.00059533573,0.00042817948,0.0012462632,0.00013130499,0.00027014047,0.00021813004,0.0018314719,0.000012312813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035227822,0.00008951811,0.00022758506,0.000028320148,0.000066573186,0.000006362194,0.00017962443,0.69517106,0.000013328588,0.00057857315,0.00013807022,0.30346578],"study_design_scores_gemma":[0.00062435033,0.000060753035,0.00054507033,0.0010721285,0.00003454371,0.0000065989966,0.000016557933,0.98993576,0.00018124802,0.0023825213,0.004589329,0.00055114756],"about_ca_topic_score_codex":0.00032970583,"about_ca_topic_score_gemma":0.0016159401,"teacher_disagreement_score":0.97935575,"about_ca_system_score_codex":0.00033599904,"about_ca_system_score_gemma":0.0002729756,"threshold_uncertainty_score":0.9996498},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036312651,0.00007875291,0.9821203,0.009566724,0.00022081374,0.0026379118,0.000074690564,0.0002461786,0.0014234047],"genre_scores_gemma":[0.8472757,0.000015454441,0.14457375,0.0012309956,0.0004016103,0.0027932627,0.00038937188,0.000036041976,0.0032838378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790215,0.000028997121,0.00027235426,0.0009036712,0.0003949675,0.0004978644],"domain_scores_gemma":[0.9983308,0.00013876027,0.00009618548,0.00095817517,0.00021348013,0.00026263107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019091,0.0002171669,0.00021332498,0.00010143378,0.00039306967,0.00029241844,0.00047997513,0.00010716966,0.0000066821794],"category_scores_gemma":[0.000009448201,0.00022704914,0.000044544104,0.00071007985,0.00001691065,0.00009720035,0.00023238118,0.00017090747,0.000056457608],"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.00021712903,0.0011193028,0.013946164,0.00053617253,0.00014054535,0.0000064411424,0.0012642015,0.13498372,0.0005127501,0.32865122,0.25124094,0.2673814],"study_design_scores_gemma":[0.00032691046,0.00006378992,0.0024373375,0.000043999575,0.000013999779,0.0000017814807,0.000021074758,0.49230775,0.000029225062,0.0012437378,0.50331324,0.00019717493],"about_ca_topic_score_codex":0.000007906017,"about_ca_topic_score_gemma":0.000010937446,"teacher_disagreement_score":0.84364444,"about_ca_system_score_codex":0.000060774022,"about_ca_system_score_gemma":0.000019065666,"threshold_uncertainty_score":0.9258795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47064972,0.000022888842,0.5279896,0.00029334755,0.00031977636,0.00034593986,3.6713504e-7,0.00035832965,0.000020010635],"genre_scores_gemma":[0.9985207,0.000049140643,0.0010822621,0.00015374437,0.00002223798,0.00012026246,0.0000019278311,0.000023157487,0.00002661797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816954,0.00012411742,0.0003831443,0.0007021725,0.00020132597,0.00041972633],"domain_scores_gemma":[0.99897647,0.00009977139,0.00013387101,0.0006715105,0.000059802333,0.00005854852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033781162,0.0002412423,0.00033471655,0.0005437191,0.00014416217,0.00006316357,0.00034025408,0.00054170063,0.00001652934],"category_scores_gemma":[0.0000056423905,0.0002553545,0.000079746496,0.0012215612,0.00008320653,0.00041108328,0.000011197992,0.00092923513,0.0000277655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000846309,0.00036152848,0.00027239585,0.00002688373,0.00006852401,0.0000141198225,0.00035537372,0.6711004,0.015094674,0.011327387,0.000012546357,0.30128154],"study_design_scores_gemma":[0.0012915818,0.00024520108,0.000407147,0.0000942433,0.00001109152,0.000021864515,0.00009962191,0.9857079,0.011212065,0.00054813374,0.00009186355,0.00026930182],"about_ca_topic_score_codex":0.000027630173,"about_ca_topic_score_gemma":0.00008050579,"teacher_disagreement_score":0.5278709,"about_ca_system_score_codex":0.0001524447,"about_ca_system_score_gemma":0.000035057234,"threshold_uncertainty_score":0.99998987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034413652,0.000082828796,0.985537,0.00138322,0.0015559033,0.0006656086,7.3423155e-7,0.0001856785,0.0071476516],"genre_scores_gemma":[0.9351351,0.000019444213,0.059321333,0.0018625401,0.0003583221,0.000068992325,0.000006507733,0.000019006393,0.0032087346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998193,0.000050861057,0.00028572322,0.0005867219,0.00030326284,0.0005804118],"domain_scores_gemma":[0.9982943,0.0005040284,0.000044428845,0.0008444031,0.00009045987,0.00022239008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040034682,0.00017818701,0.00022816488,0.00003785691,0.00009979177,0.0001779669,0.0010059059,0.0001221572,0.00039277103],"category_scores_gemma":[0.000020336496,0.00014736188,0.00011726125,0.00020804268,0.00003459293,0.0003444732,0.0003927295,0.00015293571,0.00021572373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012071713,0.00008810478,0.00034403978,0.000022438384,0.000014392087,0.000004439807,0.000051649564,0.0005775446,0.00015400942,0.9246538,0.028778458,0.045299027],"study_design_scores_gemma":[0.00047395454,0.0002027783,0.00020632392,0.000041139567,0.0000056789563,0.0000060994794,0.000013905505,0.97727185,0.00015810055,0.0043842588,0.01698884,0.00024708928],"about_ca_topic_score_codex":0.000011179086,"about_ca_topic_score_gemma":0.000008229257,"teacher_disagreement_score":0.9766943,"about_ca_system_score_codex":0.000045971417,"about_ca_system_score_gemma":0.000031225467,"threshold_uncertainty_score":0.60092425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076178224,0.000048665195,0.98090005,0.0032763504,0.0001229686,0.00015455583,2.5267016e-7,0.00020093916,0.0076784235],"genre_scores_gemma":[0.6294695,0.0000012809945,0.36748177,0.0027773867,0.000084066894,0.000016754138,4.5813533e-7,0.000004774202,0.00016398243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989944,0.00003981457,0.00018023317,0.00030721934,0.00017251587,0.00030578367],"domain_scores_gemma":[0.9990454,0.0002147658,0.000027719952,0.00061133626,0.000017237347,0.000083582614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017027193,0.00009965607,0.00010941899,0.00006973367,0.000025603487,0.00008138641,0.00066902564,0.000088348344,0.00028341918],"category_scores_gemma":[0.00002918077,0.000090147696,0.000031638083,0.00037740212,0.000022824972,0.00020605868,0.00012318509,0.0002108314,0.0004896521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015210239,0.0005179842,0.0069835545,0.00001386053,0.000009187213,0.00011816432,0.00061822165,0.14929888,0.000099787045,0.39212507,0.010617409,0.43958265],"study_design_scores_gemma":[0.0002673497,0.000025257546,0.0029174013,0.000022587274,6.9267185e-7,0.000002799256,0.000003779471,0.97715366,0.00027551642,0.001323808,0.01787316,0.00013398942],"about_ca_topic_score_codex":0.000026805104,"about_ca_topic_score_gemma":0.000161269,"teacher_disagreement_score":0.82785475,"about_ca_system_score_codex":0.000046462166,"about_ca_system_score_gemma":0.000031890733,"threshold_uncertainty_score":0.629365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20529154,0.09262197,0.6867491,0.0006163101,0.0062952223,0.0051547396,0.000011733444,0.0004794448,0.0027799632],"genre_scores_gemma":[0.989502,0.0033249485,0.0015072827,0.00015420276,0.00062776305,0.0001025271,0.000022010187,0.000079289784,0.004679934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487185,0.00064162764,0.0010491888,0.0010044085,0.0009962374,0.0014366662],"domain_scores_gemma":[0.9960824,0.00039883264,0.0005220787,0.0021868364,0.00031069393,0.0004991041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026579374,0.0004526118,0.000770853,0.00041484518,0.00025699343,0.00092436676,0.0039631496,0.0003778241,0.00005832045],"category_scores_gemma":[0.000021168105,0.00038147747,0.00012688948,0.0011549467,0.000043768032,0.0019943437,0.0006472128,0.0015526188,0.00010637818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024229332,0.0005011804,0.0014276872,0.0005494402,0.00008776171,0.003789515,0.0022806514,0.6541812,0.00010715996,0.0061383136,0.010032996,0.32066184],"study_design_scores_gemma":[0.0014012661,0.00034000483,0.00015023982,0.0005818352,0.000007803931,0.00032635598,0.0014244036,0.73472345,0.000009244928,0.000085033,0.26057082,0.0003795204],"about_ca_topic_score_codex":0.000033791977,"about_ca_topic_score_gemma":0.0000072586813,"teacher_disagreement_score":0.7842105,"about_ca_system_score_codex":0.0005815932,"about_ca_system_score_gemma":0.00035562663,"threshold_uncertainty_score":0.99986374},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040978024,0.003460162,0.9900112,0.00018674257,0.004029443,0.0007848167,0.0000023306502,0.00030375412,0.0008117461],"genre_scores_gemma":[0.20279731,0.0017374266,0.7827668,0.0056423782,0.004270752,0.00030566996,0.000028113824,0.00021781337,0.0022337164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99465257,0.00008571918,0.0006100098,0.0024296877,0.0009948711,0.0012271395],"domain_scores_gemma":[0.99569505,0.0009037815,0.00035382208,0.0024255286,0.00022861965,0.00039321728],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012663051,0.00074489985,0.000781135,0.0005411343,0.00036499673,0.0011355833,0.005241395,0.00093480846,0.000018614182],"category_scores_gemma":[0.00004185826,0.0006940183,0.00012508985,0.0013648021,0.0013650899,0.00079108577,0.0033439714,0.002738614,0.000025410784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035307469,0.00002823312,0.000025733056,0.000028301338,0.000007259441,0.00008257497,0.00037460652,0.049239114,0.00005422097,0.0012320734,0.00030984325,0.9486145],"study_design_scores_gemma":[0.00026997912,0.0002126782,0.00011205258,0.0002684377,0.000007736345,0.00014206473,9.223657e-8,0.9603847,0.0001230141,0.024749164,0.012906986,0.00082303915],"about_ca_topic_score_codex":0.0000079643,"about_ca_topic_score_gemma":0.00018706624,"teacher_disagreement_score":0.94779146,"about_ca_system_score_codex":0.00029866898,"about_ca_system_score_gemma":0.0010291998,"threshold_uncertainty_score":0.99990135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027932602,0.0000851959,0.9906881,0.00017648036,0.0011676801,0.00027237044,0.0000031849245,0.00028459617,0.0045291437],"genre_scores_gemma":[0.9384727,0.0000031315478,0.047898345,0.0004891466,0.00011932951,0.00023343587,0.0000065125973,0.000018166045,0.012759237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987539,0.000035544384,0.00021064971,0.00044433097,0.00026212353,0.0002934437],"domain_scores_gemma":[0.998951,0.0001925214,0.00007366152,0.00058371696,0.000111172005,0.000087919725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020693964,0.00013404783,0.00017545096,0.0000826419,0.00007781325,0.00010963805,0.00058594154,0.00009479004,0.000014911088],"category_scores_gemma":[0.0000034219026,0.00011670063,0.00010848985,0.00025214322,0.000017788445,0.00014609165,0.00007388257,0.000067808614,0.000026745145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057060934,0.000024282226,0.00008294817,0.000010874681,0.000008667731,3.8698658e-7,0.0000089540345,0.581,0.00017912178,0.4133129,0.0037391884,0.0016269897],"study_design_scores_gemma":[0.00037309524,0.00005065901,0.000017824706,0.000018620976,0.0000027948827,0.0000031279599,0.0000020616637,0.9931786,0.00045081743,0.0017179126,0.0040167533,0.00016772786],"about_ca_topic_score_codex":0.000096448566,"about_ca_topic_score_gemma":0.00004118456,"teacher_disagreement_score":0.94278973,"about_ca_system_score_codex":0.000048271395,"about_ca_system_score_gemma":0.00013064554,"threshold_uncertainty_score":0.47589135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020825747,0.000006087678,0.96510744,0.000031871197,0.000077899036,0.00060145,9.706004e-8,0.00022682286,0.013122559],"genre_scores_gemma":[0.91378206,0.000001275151,0.085029446,0.00015131284,0.000012953175,0.00004257877,0.0000013297188,0.000007673354,0.0009713678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988593,0.000080438156,0.00028476282,0.0002787736,0.00023742735,0.00025932887],"domain_scores_gemma":[0.9990488,0.00020386766,0.00009912074,0.0004622912,0.00011814033,0.00006775287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010626041,0.00009637808,0.00017149045,0.0000719978,0.000041180283,0.000058038666,0.0005589366,0.00004048577,0.00005631441],"category_scores_gemma":[0.00009669624,0.000087782646,0.000030154524,0.00041726924,0.00000889353,0.00018443879,0.00058115425,0.00013122267,0.00010186009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026732296,0.00007517236,0.19197327,0.00007400038,0.00004983519,0.0000055709056,0.0021857945,0.13365011,0.022007054,0.051749624,0.00058851106,0.59761435],"study_design_scores_gemma":[0.00013962867,0.00020230305,0.014389256,0.00008188186,0.0000014214228,0.0000017976381,0.000041248084,0.9629027,0.020482132,0.000015029679,0.0015386264,0.00020396255],"about_ca_topic_score_codex":0.00081325957,"about_ca_topic_score_gemma":0.000044506636,"teacher_disagreement_score":0.8929563,"about_ca_system_score_codex":0.00003441048,"about_ca_system_score_gemma":0.000026406646,"threshold_uncertainty_score":0.35796723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14637491,0.0010150771,0.8394855,0.000049644153,0.0015105064,0.011501049,0.000004021981,0.000046785768,0.000012464156],"genre_scores_gemma":[0.9866852,0.00003219502,0.008180783,0.00006719874,0.003959869,0.0009511492,3.982752e-7,0.000043220167,0.00007994332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587864,0.0006025002,0.0015287088,0.00057679584,0.0005265352,0.00088682346],"domain_scores_gemma":[0.99487215,0.0012030014,0.0018818979,0.0005668225,0.0011150294,0.00036109262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024068416,0.00044994793,0.0012540882,0.0001182282,0.00050271524,0.0005119226,0.000978225,0.00023057983,0.0000027315702],"category_scores_gemma":[0.000060014812,0.00029364225,0.00025951164,0.000383858,0.00008962243,0.0008505242,0.0003307566,0.00039047317,0.0000011595132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045817555,0.00065056107,0.028308349,0.00014665931,0.00074207963,0.00015468948,0.004262175,0.94206786,0.0009706158,0.0016610151,0.0026664794,0.017911317],"study_design_scores_gemma":[0.0043162005,0.0017180819,0.0013992513,0.0018085771,0.000076502154,0.00034290354,0.0008123269,0.98764175,0.000021316315,0.00004649863,0.0013809602,0.0004356067],"about_ca_topic_score_codex":0.00004654774,"about_ca_topic_score_gemma":0.00006338591,"teacher_disagreement_score":0.84031034,"about_ca_system_score_codex":0.00019597326,"about_ca_system_score_gemma":0.00021470604,"threshold_uncertainty_score":0.99995154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018045273,0.00077504833,0.97172874,0.00013151072,0.00050758803,0.0005317816,3.6836641e-7,0.00027187075,0.0080078],"genre_scores_gemma":[0.9939584,0.00004937573,0.005500231,0.00015970804,0.00003445326,0.00021932702,0.0000047142726,0.000018825096,0.000054981356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973475,0.0012233291,0.0004925672,0.00036021334,0.00020039178,0.0003760257],"domain_scores_gemma":[0.99669766,0.000597503,0.00022769353,0.002304463,0.00008695541,0.00008573985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018281828,0.00017072805,0.00029781583,0.0001291826,0.0001446936,0.00021155279,0.0014966514,0.00013733089,0.0000089202795],"category_scores_gemma":[0.000056594767,0.00018450816,0.00005105522,0.0008197335,0.000036081718,0.00039009302,0.0002092761,0.00036259613,0.000029183964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010966499,0.00026363623,0.013927807,0.00006260701,0.000022562273,0.0000097317225,0.00044342742,0.8098402,0.00027736946,0.15066774,0.00058091735,0.023893028],"study_design_scores_gemma":[0.0004574725,0.000021504968,0.0017796889,0.00008890291,0.0000015848419,0.000014384982,0.000040578398,0.9930007,0.000076480035,0.00007201241,0.00424111,0.00020561332],"about_ca_topic_score_codex":0.00022326793,"about_ca_topic_score_gemma":0.00039071456,"teacher_disagreement_score":0.9759131,"about_ca_system_score_codex":0.00019872707,"about_ca_system_score_gemma":0.00007887458,"threshold_uncertainty_score":0.7524024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037881464,0.00032869543,0.964727,0.033035964,0.00012981685,0.00033326523,0.000045043376,0.000712343,0.0003090918],"genre_scores_gemma":[0.4864704,0.00004856128,0.50896853,0.0038387852,0.00030764606,0.000029381692,0.00031453924,0.000017719087,0.000004437651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975961,0.0005156936,0.00041183757,0.0008168177,0.00028721703,0.0003723767],"domain_scores_gemma":[0.98957735,0.00041497825,0.00019380917,0.009221524,0.00022422906,0.0003681083],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003642046,0.00024391043,0.0002460753,0.00012774681,0.00049311377,0.00039436424,0.013844259,0.00010657359,0.000011628698],"category_scores_gemma":[0.00007828472,0.00027312888,0.000059256945,0.001242577,0.00016496914,0.0018062119,0.006093603,0.00052825495,0.00011765515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022422695,0.00042656573,0.00070196576,0.00003967318,0.00007602043,0.000021603593,0.0013178531,0.15739413,0.00030741456,0.32006174,0.005103218,0.5145274],"study_design_scores_gemma":[0.0002712901,0.00014115585,0.0007762976,0.000052762545,0.0000099891195,0.000009606422,0.000012041311,0.984006,0.00002086668,0.0008342476,0.013582903,0.00028283696],"about_ca_topic_score_codex":0.000119683216,"about_ca_topic_score_gemma":0.00007245838,"teacher_disagreement_score":0.8266119,"about_ca_system_score_codex":0.00010452907,"about_ca_system_score_gemma":0.0004911506,"threshold_uncertainty_score":0.9999721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026758116,0.00007706673,0.9680324,0.0010109069,0.000102578204,0.00019240328,5.2030606e-7,0.00027324038,0.0035527414],"genre_scores_gemma":[0.6979245,0.0000036694269,0.30098984,0.00095119094,0.00005456516,0.00001300283,9.3480025e-7,0.000011817756,0.00005047149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986821,0.0000414981,0.00019928723,0.000462509,0.0002422526,0.0003723665],"domain_scores_gemma":[0.9993314,0.00009366346,0.000051336698,0.00030441125,0.00003425084,0.00018493355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113759226,0.0001453181,0.00017317255,0.00003587916,0.0000678296,0.00019818393,0.0006280905,0.00004359279,0.000051574432],"category_scores_gemma":[0.000027792394,0.00011877479,0.000030256362,0.0008230644,0.00004956396,0.00030346352,0.00023779979,0.0002423562,0.00006846097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009297996,0.00022159853,0.016037032,0.000084488245,0.000070169575,0.002519404,0.0074362406,0.5246452,0.00016833177,0.048511554,0.006227501,0.39398548],"study_design_scores_gemma":[0.00038725144,0.00020168062,0.001360899,0.000017232966,0.0000024725634,0.000030859843,0.000028469136,0.99655616,0.00007816216,0.00012218521,0.0010326655,0.00018195156],"about_ca_topic_score_codex":0.00011903069,"about_ca_topic_score_gemma":0.000024624916,"teacher_disagreement_score":0.67116636,"about_ca_system_score_codex":0.00002012367,"about_ca_system_score_gemma":0.00007078829,"threshold_uncertainty_score":0.48434955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44762272,0.00003249104,0.5517577,0.00024867462,0.00005867206,0.000117223055,0.0000014036958,0.000036922356,0.00012420423],"genre_scores_gemma":[0.9785584,0.00002805105,0.020074857,0.0013110328,0.00001800786,0.0000040620666,0.0000034333925,0.0000013026958,8.48377e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988193,0.000028904999,0.00039145944,0.00023580922,0.0003078431,0.00021671678],"domain_scores_gemma":[0.99929625,0.000048226135,0.00014270362,0.0002177442,0.00014406217,0.00015104188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051019446,0.000097206896,0.00023134776,0.00030538067,0.00007749946,0.00027708485,0.0005075626,0.00003882427,0.0000020600696],"category_scores_gemma":[0.000015405005,0.000090178226,0.000030542782,0.003971177,0.00019688057,0.005165755,0.00042462096,0.000089920584,0.0000015007465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005314601,0.000005017814,0.0010015687,0.0000130269245,0.00001560547,5.971778e-7,0.0033235445,0.9522214,0.000010527798,0.00891001,0.00005094096,0.034442432],"study_design_scores_gemma":[0.00029160845,0.00004917788,0.020973757,0.000011590889,0.000016288837,0.0000024047627,0.000014005823,0.9784096,0.000011030022,0.00004084592,0.00008406262,0.000095667594],"about_ca_topic_score_codex":0.0000050248423,"about_ca_topic_score_gemma":0.000009986449,"teacher_disagreement_score":0.53168285,"about_ca_system_score_codex":0.00001711167,"about_ca_system_score_gemma":0.00010673363,"threshold_uncertainty_score":0.37450475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016697628,0.0005424406,0.98933303,0.00021163387,0.005003152,0.002278653,0.00016278264,0.00065153226,0.00014702238],"genre_scores_gemma":[0.9628554,0.00007716973,0.034250423,0.00027386186,0.00024127703,0.0014807777,0.000027232889,0.00007847571,0.00071539584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960121,0.00031531317,0.0014501594,0.0010626676,0.0005642015,0.0005955909],"domain_scores_gemma":[0.99723965,0.00070471223,0.0003628188,0.00076455384,0.00048156886,0.00044670023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086964516,0.0004690295,0.0006281632,0.00020288672,0.00039513793,0.00056566764,0.00091438997,0.0002753561,0.000038911483],"category_scores_gemma":[0.000012264043,0.00046450022,0.00045709728,0.0008459444,0.00007264954,0.00059329276,9.89384e-7,0.00037942754,0.00012519678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034888898,0.00019071029,0.00003299811,0.00060440396,0.000274297,0.0000210597,0.004330783,0.9415486,0.0037961444,0.01692004,0.00035487715,0.03157722],"study_design_scores_gemma":[0.0009920101,0.00081970653,0.000054912973,0.0002305128,0.00014149031,0.00001405075,0.0006269556,0.8999402,0.034213126,0.00006978011,0.062084515,0.00081275613],"about_ca_topic_score_codex":0.00019600641,"about_ca_topic_score_gemma":0.000038717008,"teacher_disagreement_score":0.96118563,"about_ca_system_score_codex":0.00015247664,"about_ca_system_score_gemma":0.00012442828,"threshold_uncertainty_score":0.99978065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95933753,0.0010506432,0.00994277,0.0062699337,0.00015206636,0.00090898864,0.000013127486,0.000042226948,0.02228274],"genre_scores_gemma":[0.99327064,0.004623712,0.0015417917,0.000072116374,0.000004773656,0.00041298172,0.000008402725,0.0000037238126,0.00006185852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921405,0.000080378086,0.00030585987,0.00014442649,0.0001292869,0.0001259683],"domain_scores_gemma":[0.99864364,0.00044147836,0.00011185994,0.000651495,0.000116018826,0.00003552139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020353489,0.00008211081,0.00010540753,0.00011133153,0.000111691465,0.00016052213,0.0011820626,0.000037288846,0.00001403642],"category_scores_gemma":[0.000022390721,0.00006726342,0.000014475808,0.00012764518,0.00015843757,0.0004581054,0.00057358027,0.00018577393,0.0000059721606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029961088,0.00008676309,0.0068244627,0.000005869953,0.0000072262874,5.777646e-7,0.0010969599,0.00031943747,0.00036956574,0.84034693,0.000028798251,0.15091038],"study_design_scores_gemma":[0.00032830352,0.00003878094,0.050412282,0.00014840375,0.0000011960652,0.000006258179,0.000795641,0.93425196,0.00006994125,0.012642196,0.0011946504,0.000110400564],"about_ca_topic_score_codex":0.00031221416,"about_ca_topic_score_gemma":0.00092341664,"teacher_disagreement_score":0.9339325,"about_ca_system_score_codex":0.000027219425,"about_ca_system_score_gemma":0.00003276762,"threshold_uncertainty_score":0.27429226},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.493078e-8,0.000033032517,0.34095034,0.00010136702,0.00069982966,0.00018671105,0.000001928189,0.00023064074,0.6577961],"genre_scores_gemma":[0.00090976286,0.000060174505,0.010184036,0.00093966315,0.0003067761,0.0000038091068,0.000012460357,0.00004489292,0.9875384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998285,0.00001012952,0.0003528857,0.00066245615,0.0003601829,0.0003293262],"domain_scores_gemma":[0.99792457,0.0001925452,0.0002216221,0.0014565856,0.00006571564,0.00013899042],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020670335,0.00032017002,0.0003714085,0.00007703184,0.000058014142,0.00017877828,0.0014468405,0.00030765415,0.0023008254],"category_scores_gemma":[0.0000130023855,0.00025434178,0.00012704049,0.000030578987,0.00003380222,0.0001666485,0.0007881702,0.00040390482,0.0029897494],"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.0000012808176,0.0000025775412,0.0000013248799,0.00001183463,0.000019026305,0.00009666484,0.000012786024,0.000012689493,7.3514445e-7,0.9383385,0.015192757,0.046309825],"study_design_scores_gemma":[0.00016700092,0.000112540954,0.0000044116314,0.00022884684,0.000022952754,0.00008634819,0.0000015516906,0.07613684,0.000002871946,0.030968988,0.8915536,0.0007140415],"about_ca_topic_score_codex":0.0000062616714,"about_ca_topic_score_gemma":0.000016180173,"teacher_disagreement_score":0.9073695,"about_ca_system_score_codex":0.0000708257,"about_ca_system_score_gemma":0.00037360712,"threshold_uncertainty_score":0.9999909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25936127,0.0004947438,0.73847884,0.00003233529,0.00014908408,0.0007319738,0.0000010550114,0.0000835548,0.0006671426],"genre_scores_gemma":[0.97600365,0.00009446364,0.023070022,0.0005783458,0.000061542356,0.0000737617,0.0000029550715,0.000017381672,0.00009785418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830246,0.000056321885,0.0003668888,0.00052333815,0.000337573,0.0004134275],"domain_scores_gemma":[0.99880475,0.00009040894,0.00019645758,0.0006421411,0.00008488492,0.0001813352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028650762,0.00023053368,0.00032066528,0.0000977068,0.00019205837,0.000041151055,0.00041900185,0.000119289834,0.000011265118],"category_scores_gemma":[0.0000080486825,0.0001896923,0.0000667153,0.00030345717,0.00007936212,0.00028381826,0.00017990656,0.00016568654,0.0000011487602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018585504,0.00056651625,0.00034137597,0.000061841565,0.000020676063,0.0000072245166,0.00028956766,0.8859405,0.0033300703,0.000038831822,0.00024348882,0.108974054],"study_design_scores_gemma":[0.0017634084,0.0014026455,0.00033338883,0.00007098744,0.000008126558,0.000017526396,0.000017555822,0.9942648,0.0017071927,0.0000047870653,0.0001988461,0.00021073999],"about_ca_topic_score_codex":0.0000062257473,"about_ca_topic_score_gemma":0.0000012845962,"teacher_disagreement_score":0.7166424,"about_ca_system_score_codex":0.000069906564,"about_ca_system_score_gemma":0.000070487804,"threshold_uncertainty_score":0.77354276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030482567,0.00019626574,0.9879013,0.007638131,0.00025218955,0.00023202236,0.000010768008,0.00004583489,0.0006752418],"genre_scores_gemma":[0.9331058,0.000024026096,0.06425724,0.0020030455,0.0005299662,0.000037407808,0.000018230734,0.000012081224,0.000012160238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747723,0.00007188551,0.00092309405,0.0002972432,0.0010194993,0.0002110682],"domain_scores_gemma":[0.99745494,0.0006016161,0.0005506903,0.00017183364,0.0009891969,0.0002317165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004179098,0.00015262538,0.0002571011,0.00041829364,0.00007249403,0.00018451142,0.0019873152,0.00006860794,0.00007212699],"category_scores_gemma":[0.000085264044,0.00015837929,0.00015252494,0.0012420268,0.00008068502,0.0006423415,0.00031268294,0.00043245428,0.00010278618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028708137,0.0002495845,0.0033581154,0.000008170405,0.00012371312,0.000071682225,0.00033815863,0.5313986,0.00007051356,0.30783704,0.0011440956,0.15537159],"study_design_scores_gemma":[0.0016989802,0.00014992095,0.016792152,0.00007250684,0.000016988171,0.00032780357,0.00017312683,0.8627636,0.00017175204,0.06325974,0.054203223,0.00037021685],"about_ca_topic_score_codex":0.00000556034,"about_ca_topic_score_gemma":0.0000017312412,"teacher_disagreement_score":0.9300576,"about_ca_system_score_codex":0.00015557616,"about_ca_system_score_gemma":0.00027992853,"threshold_uncertainty_score":0.64585197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013475804,0.0017052594,0.9817249,0.00058679696,0.00053277746,0.00074199267,0.0000012055939,0.00032876054,0.0009024955],"genre_scores_gemma":[0.664723,0.0004001086,0.32814872,0.0030881746,0.0005164167,0.0013664116,0.000045466903,0.000052403477,0.0016592972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985936,0.000022551772,0.00025178655,0.0005020725,0.00019963333,0.00043030904],"domain_scores_gemma":[0.99879354,0.00015044828,0.00008964568,0.00067139405,0.00016941282,0.00012553771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023995033,0.00017843726,0.00016473749,0.00005068938,0.00014977308,0.00021968265,0.0008490663,0.0001137933,0.000039833456],"category_scores_gemma":[0.0000057339107,0.00016463899,0.00007836371,0.0007302067,0.000017600074,0.0005948583,0.00021389732,0.00010380528,0.00006131938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025034955,0.00024483335,0.0000225612,0.000048916023,0.00003754566,0.000009491695,0.00067361275,0.3853849,0.000549235,0.07144724,0.009275219,0.53228146],"study_design_scores_gemma":[0.00080814055,0.00028903305,0.00037682493,0.00004583206,0.000012812082,0.000023390894,0.000087661014,0.9397627,0.0005347072,0.004641692,0.052998457,0.0004187187],"about_ca_topic_score_codex":0.000008732296,"about_ca_topic_score_gemma":0.00015478695,"teacher_disagreement_score":0.6535762,"about_ca_system_score_codex":0.0001244816,"about_ca_system_score_gemma":0.000055348304,"threshold_uncertainty_score":0.6713783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120223425,0.00029322796,0.9570148,0.00005114133,0.00039361013,0.029923005,0.0000012539119,0.00023306842,0.00006754612],"genre_scores_gemma":[0.49523255,0.0000631326,0.39839104,0.0025163316,0.001756708,0.10189786,0.0000029766934,0.000116907,0.000022484148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750704,0.00015767712,0.00053034985,0.00080159446,0.00033323164,0.00067012256],"domain_scores_gemma":[0.9987564,0.000098308934,0.00022434501,0.0006251389,0.000070933434,0.00022487373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025135523,0.0002690972,0.0003215168,0.000075243996,0.0001233028,0.00054640544,0.0022449247,0.00014495995,0.00002122433],"category_scores_gemma":[0.000020043759,0.00027255403,0.000077806406,0.0012005074,0.000040917927,0.0010035738,0.00075099553,0.0004367825,0.000018292652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008525453,0.000046899288,0.001788106,0.00002018858,0.000006630396,0.000115059825,0.00039941052,0.49771145,0.000078343546,0.000008535344,0.0001488263,0.49966803],"study_design_scores_gemma":[0.0007931173,0.00009254974,0.0013864953,0.000074051,0.000003932042,0.000011552122,0.000011503236,0.99412215,0.0004926702,0.00006003845,0.0026339435,0.00031797957],"about_ca_topic_score_codex":0.000032628825,"about_ca_topic_score_gemma":0.000017004668,"teacher_disagreement_score":0.55862373,"about_ca_system_score_codex":0.000098514894,"about_ca_system_score_gemma":0.00010152854,"threshold_uncertainty_score":0.99997264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05434356,0.00004718899,0.9115037,0.00048267096,0.000434427,0.017108044,0.000032758275,0.00022239929,0.015825262],"genre_scores_gemma":[0.98134416,0.000024368623,0.011087642,0.00010291234,0.00017802803,0.00597296,0.000004105101,0.00004332136,0.0012424807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953859,0.00026657016,0.001185009,0.0016446898,0.00065766665,0.00086019747],"domain_scores_gemma":[0.99617136,0.00045591005,0.0011989678,0.0017783036,0.0002613114,0.0001341698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016424663,0.000581289,0.0010641739,0.00014928768,0.000074882184,0.00045148376,0.0019586717,0.00043573944,0.000004063398],"category_scores_gemma":[0.00018340416,0.00045263817,0.00017368598,0.00033722923,0.00017149853,0.0012904258,0.005818389,0.0010079326,0.0000052595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002885122,0.0004413503,0.12922813,0.0010356794,0.00028713312,0.00027417854,0.0054767616,0.0021519265,0.0038121836,0.65610933,0.00043372205,0.2004611],"study_design_scores_gemma":[0.006244003,0.00043171024,0.092914455,0.037750237,0.00006380773,0.00011942634,0.00046709584,0.75172323,0.020294916,0.084803,0.00073914335,0.0044489503],"about_ca_topic_score_codex":0.0011595341,"about_ca_topic_score_gemma":0.00043572506,"teacher_disagreement_score":0.92700064,"about_ca_system_score_codex":0.00072261086,"about_ca_system_score_gemma":0.0007916212,"threshold_uncertainty_score":0.9997925},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030414746,0.004536637,0.9769303,0.000017494773,0.008691051,0.0034513928,0.000026610824,0.0009896316,0.0023154167],"genre_scores_gemma":[0.11936985,0.0015574989,0.8461119,0.0012010423,0.0068059755,0.004618744,0.005734971,0.00041285256,0.014187158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940073,0.00017475907,0.0012962205,0.002210129,0.00070412614,0.0016074541],"domain_scores_gemma":[0.9939187,0.0009281685,0.0008880941,0.002813985,0.001080505,0.00037051583],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010947076,0.0009670915,0.0009793617,0.0001323051,0.000849252,0.0011477829,0.0027218177,0.0021006323,0.0009939355],"category_scores_gemma":[0.00021320897,0.00096469914,0.00055625755,0.0011549039,0.00011945634,0.00082444045,0.00036472798,0.001000738,0.0001387606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067971123,0.00030277987,0.001955542,0.0003583795,0.00030792312,0.000010882406,0.00083075254,0.21433139,0.000004409056,0.025305644,0.12594773,0.6299648],"study_design_scores_gemma":[0.0005328594,0.00030030875,0.0034731985,0.00018726295,0.000058277983,0.0000023459802,0.00003775797,0.84993696,0.00008353624,0.03646718,0.10790761,0.0010126733],"about_ca_topic_score_codex":0.000014390351,"about_ca_topic_score_gemma":0.0006227421,"teacher_disagreement_score":0.6356056,"about_ca_system_score_codex":0.00016751976,"about_ca_system_score_gemma":0.00026935068,"threshold_uncertainty_score":0.9999193},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049012294,0.0046914527,0.9893704,0.00011975433,0.00023929725,0.0003445243,0.0000119293745,0.000021438078,0.0002999518],"genre_scores_gemma":[0.23040026,0.0038737832,0.76550865,0.000079585356,0.000043057516,0.000034833378,0.00002351889,0.000008849237,0.000027462658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998797,0.000015047156,0.0006422469,0.00017353513,0.00016527838,0.00020690271],"domain_scores_gemma":[0.9982439,0.00051078765,0.00043981528,0.0006300063,0.00013978755,0.000035695808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035478064,0.00021163038,0.00051303144,0.00030181385,0.00027711818,0.000098049895,0.0014579132,0.00021653532,0.00000105846],"category_scores_gemma":[0.00003357797,0.00018229541,0.00014658003,0.0006289373,0.0004462632,0.00029199925,0.001116136,0.00039285095,5.6257544e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010418055,0.0000074823924,0.00011058885,0.00009103766,0.000086848864,7.2786044e-8,0.00066210295,0.9162405,0.0000010775502,0.011815678,0.0000017420253,0.07098179],"study_design_scores_gemma":[0.00011588376,0.00008993443,0.0004853368,0.00015198834,0.00006389297,0.0000035281616,0.0000028548627,0.9960577,0.000020443378,0.00016454731,0.0026616897,0.00018218362],"about_ca_topic_score_codex":0.000012934541,"about_ca_topic_score_gemma":0.00029249646,"teacher_disagreement_score":0.22549903,"about_ca_system_score_codex":0.000038094167,"about_ca_system_score_gemma":0.00012713709,"threshold_uncertainty_score":0.7433791},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44697174,0.00026933482,0.2050818,0.0032464974,0.0029353627,0.334114,0.00013239658,0.0030840188,0.004164884],"genre_scores_gemma":[0.8768798,0.0000032085668,0.046713296,0.0019267027,0.0015101426,0.070795596,0.000045872162,0.00013601007,0.0019893488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980448,0.00010617127,0.00032011597,0.0007077973,0.0003029923,0.0005181155],"domain_scores_gemma":[0.9987672,0.00032017098,0.00019950073,0.0004264393,0.0001891561,0.00009752308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023549207,0.0002413776,0.0002793462,0.00010952969,0.00036546544,0.00034870324,0.00040429048,0.00012843736,0.000028384804],"category_scores_gemma":[0.00003002364,0.00024336035,0.00009778863,0.00064451125,0.000032092466,0.0003301342,0.0004240519,0.00017521111,0.00001352589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026731813,0.0011683966,0.05656981,0.008416427,0.0007741628,0.0019625297,0.028569864,0.021789659,0.0032156392,0.014377858,0.015777,0.84711134],"study_design_scores_gemma":[0.0016854863,0.000062099214,0.009030099,0.00018522528,0.000018312023,0.000050160335,0.00049822836,0.96251374,0.0017156291,0.00022002612,0.023542652,0.00047832722],"about_ca_topic_score_codex":0.00007422337,"about_ca_topic_score_gemma":0.00009156848,"teacher_disagreement_score":0.9407241,"about_ca_system_score_codex":0.00006205207,"about_ca_system_score_gemma":0.00006189655,"threshold_uncertainty_score":0.99239475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044037082,0.00046498518,0.9948029,0.0008194272,0.0005552052,0.00045342304,0.00001406025,0.00005189075,0.0023977233],"genre_scores_gemma":[0.04218388,0.00006999237,0.95730126,0.0001921483,0.00013631856,0.00002234065,0.000021506852,0.000015769016,0.00005675885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984345,0.000018272109,0.00072281586,0.00021589996,0.00030141478,0.00030712376],"domain_scores_gemma":[0.9983048,0.00042759362,0.00036050536,0.00074291887,0.000111435336,0.000052739168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051160326,0.00026983704,0.0004115459,0.00019827815,0.00051343534,0.0002348265,0.002159832,0.00022943458,0.0000011644626],"category_scores_gemma":[0.0000565684,0.00023148781,0.00017696162,0.0003515785,0.00031674802,0.00014824847,0.0015683542,0.0006516892,5.533963e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.726767e-7,0.000010851563,0.0000024063502,0.000066225584,0.000020059737,3.1124046e-7,0.00074082555,0.81910336,0.0000027491642,0.16542885,0.000012979927,0.014610937],"study_design_scores_gemma":[0.00017569315,0.000027578713,0.000060720933,0.00034066744,0.000012921663,0.000016374868,0.0000020790642,0.993301,0.000020862504,0.0007411341,0.0050534867,0.00024752587],"about_ca_topic_score_codex":0.000021200089,"about_ca_topic_score_gemma":0.000095592455,"teacher_disagreement_score":0.17419761,"about_ca_system_score_codex":0.00009323546,"about_ca_system_score_gemma":0.00020831435,"threshold_uncertainty_score":0.9439799},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019527825,0.0011155156,0.7593899,0.00035041888,0.005959264,0.0028774696,0.0000087882545,0.001064526,0.2097063],"genre_scores_gemma":[0.98044574,0.000090205824,0.010414391,0.00029653445,0.00019897064,0.0003758613,0.00057141413,0.00010218964,0.00750471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574167,0.00026676105,0.000850775,0.0014164788,0.00078713713,0.00093718234],"domain_scores_gemma":[0.99744666,0.0005014625,0.0005575426,0.0009098571,0.00034722,0.00023725245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007749738,0.00067351764,0.0007444327,0.00039700614,0.00018698044,0.00020308283,0.0017130912,0.00097340177,0.00021798321],"category_scores_gemma":[0.00009095531,0.00069310755,0.00022302096,0.0008536868,0.000050537456,0.00085227605,0.00033746226,0.0016320113,0.00012240474],"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.00013829411,0.00050171127,0.00006030997,0.000026795322,0.00012181321,0.00011299063,0.0019682788,0.0003422819,0.00011106447,0.9283529,0.00042345235,0.06784011],"study_design_scores_gemma":[0.0022909956,0.0005773642,0.013754561,0.00072737684,0.00008499211,0.00004406194,0.00065114413,0.84464943,0.0012515131,0.13335158,0.00061464217,0.0020023377],"about_ca_topic_score_codex":0.00014300122,"about_ca_topic_score_gemma":0.0012832773,"teacher_disagreement_score":0.9609179,"about_ca_system_score_codex":0.00041386147,"about_ca_system_score_gemma":0.00036435504,"threshold_uncertainty_score":0.999552},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073691485,0.008648185,0.007380612,0.00089260633,0.98080194,0.00049259607,0.000031451615,0.00022791114,0.0015173148],"genre_scores_gemma":[0.00004623251,0.04912062,0.017613882,0.000058135065,0.9310293,0.00017854907,0.000291017,0.000054173735,0.0016080559],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967068,0.00047179704,0.0007955707,0.00075945386,0.00070817495,0.00055820914],"domain_scores_gemma":[0.9909719,0.0018937213,0.00038619837,0.0061186613,0.00044680567,0.0001827073],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0006193532,0.0004744617,0.00066396757,0.00025154473,0.0003170626,0.00027747525,0.0051407753,0.0013026962,0.0000036413742],"category_scores_gemma":[0.0003840238,0.0005248174,0.00010726799,0.00077767484,0.00035353636,0.0004194713,0.0020117732,0.0028288055,0.000084540494],"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.000010188868,0.000111600195,0.000012956944,0.000016017668,0.000020849844,0.000015612846,0.00013788455,0.0003083135,0.0000023240118,0.00012230487,0.9950267,0.00421524],"study_design_scores_gemma":[0.00070533395,0.00008388977,0.00005066983,0.00013400376,0.000017892751,0.000010631884,0.0000024846001,0.020632433,7.9886433e-7,0.00009808757,0.9777963,0.0004674363],"about_ca_topic_score_codex":0.000043250748,"about_ca_topic_score_gemma":0.0008124951,"teacher_disagreement_score":0.049772616,"about_ca_system_score_codex":0.0002245052,"about_ca_system_score_gemma":0.00036735396,"threshold_uncertainty_score":0.9999938},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7528662,0.005212556,0.22729775,0.0021271256,0.00024337292,0.009149053,0.00019483146,0.00032376676,0.0025853517],"genre_scores_gemma":[0.9830995,0.0014987284,0.0026586372,0.00009711848,0.00006686318,0.012267958,0.00006661647,0.00002167796,0.00022288384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971914,0.00020993222,0.00084473763,0.0008589671,0.00047654533,0.00041838473],"domain_scores_gemma":[0.9952168,0.00038411363,0.0006473741,0.002114496,0.001528417,0.000108828535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019709987,0.00036355876,0.00047168753,0.00024366908,0.0004075531,0.00030286593,0.0021427816,0.00029450998,0.00008931821],"category_scores_gemma":[0.00003697553,0.0002857495,0.00006712269,0.00036711633,0.000990503,0.00047807873,0.0004955957,0.0005274716,0.000006193839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010034046,0.00069007394,0.0031518594,0.00012487064,0.00032485262,3.3213115e-7,0.0006535433,0.023676874,0.0019933947,0.28121492,0.0002656656,0.68780327],"study_design_scores_gemma":[0.0009572871,0.0003210886,0.0012446042,0.00018189041,0.00005122432,0.000031106756,0.0008599474,0.96753466,0.0003009863,0.00092265394,0.027284892,0.00030964197],"about_ca_topic_score_codex":0.000017268241,"about_ca_topic_score_gemma":0.00039264807,"teacher_disagreement_score":0.9438578,"about_ca_system_score_codex":0.00018585613,"about_ca_system_score_gemma":0.00024140581,"threshold_uncertainty_score":0.99995947},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021339776,0.0000115307685,0.8817868,0.00015614675,0.00016055365,0.11424224,6.9966114e-7,0.00024070295,0.0012673266],"genre_scores_gemma":[0.16929121,0.0000057621746,0.2552486,0.003031784,0.0012833036,0.56795985,0.000005770096,0.00011117212,0.0030625493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809325,0.000032853804,0.00035493606,0.00059253076,0.00023451087,0.0006919239],"domain_scores_gemma":[0.99859107,0.00035804874,0.00011286217,0.00058950495,0.000116994874,0.00023152724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696791,0.000211064,0.0002117942,0.0000650719,0.00016665363,0.0001896742,0.0005129264,0.00013097517,0.000020352067],"category_scores_gemma":[0.000015135409,0.00017453496,0.00006735026,0.00034801426,0.000053307514,0.00012078894,0.00028048927,0.00016624498,0.00001622998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022417986,0.00021616706,0.00035855014,0.00010620901,0.000021564128,0.00003834391,0.0003149503,0.018419497,0.00016652285,0.015500311,0.008529895,0.9561038],"study_design_scores_gemma":[0.001402249,0.0001309957,0.00058701745,0.000060495873,0.0000030189706,0.00002171385,0.00001952339,0.9513148,0.0009878502,0.000072405535,0.045131266,0.00026863004],"about_ca_topic_score_codex":0.0000035216142,"about_ca_topic_score_gemma":0.00003404676,"teacher_disagreement_score":0.95583516,"about_ca_system_score_codex":0.000048038928,"about_ca_system_score_gemma":0.000037911886,"threshold_uncertainty_score":0.7117329},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10509276,0.0098481905,0.8758854,0.0017943342,0.006120353,0.0003811345,0.000013717578,0.00015902439,0.0007050764],"genre_scores_gemma":[0.736705,0.00085564196,0.25619864,0.0018056738,0.0039517037,0.00001236784,0.00002566766,0.000078665485,0.00036663652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579865,0.0002437668,0.0014668505,0.00065391196,0.0010900347,0.00074680214],"domain_scores_gemma":[0.99413276,0.0015051579,0.0012955371,0.00057371444,0.0021647098,0.00032813597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010960535,0.00039930883,0.0006385427,0.00030544234,0.00024989154,0.0007147032,0.0023691214,0.00021607378,0.000051622617],"category_scores_gemma":[0.00031030187,0.00040550088,0.0006075243,0.00047766295,0.000114778835,0.00053551106,0.0006956501,0.0007717563,0.0000106241805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020706098,0.00023026946,0.00011218473,0.000017659455,0.0005031482,0.0013130115,0.0010241325,0.39414713,0.001310824,0.0018889057,0.004453362,0.5947923],"study_design_scores_gemma":[0.002950424,0.0007302438,0.00037928758,0.00051104807,0.00006396939,0.0043079983,0.000553212,0.8622962,0.001729009,0.00087963155,0.12497135,0.0006276151],"about_ca_topic_score_codex":0.0000011222667,"about_ca_topic_score_gemma":0.000006749413,"teacher_disagreement_score":0.63161224,"about_ca_system_score_codex":0.00031767518,"about_ca_system_score_gemma":0.0003553657,"threshold_uncertainty_score":0.99983966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031775367,0.000103082646,0.991432,0.00072150346,0.00022403187,0.00033162953,1.9129642e-7,0.00018663432,0.0038233933],"genre_scores_gemma":[0.9764864,0.000016260583,0.01966988,0.001256387,0.00017322734,0.00012701088,0.00001928992,0.000020047724,0.0022315164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998081,0.00009933166,0.00030559668,0.0005870515,0.00028254313,0.00064445793],"domain_scores_gemma":[0.99837804,0.00074371684,0.0000981435,0.00055744324,0.000121858364,0.0001007963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004924941,0.00019305931,0.0002710058,0.000058306898,0.00016755979,0.00021581276,0.00044310887,0.00008121425,0.000058102232],"category_scores_gemma":[0.0001236827,0.00018321023,0.00012091922,0.0006974501,0.000016400565,0.00026340553,0.00026858665,0.0003322337,0.000027532084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012579344,0.00006945456,0.0005358561,0.000008786344,0.000006708715,0.000011295772,0.000064391235,0.95332885,0.00009840985,0.01296445,0.0010618308,0.031837393],"study_design_scores_gemma":[0.0007798206,0.00018596249,0.00031037512,0.00009586173,0.0000040683685,9.3607633e-7,0.000022431912,0.98983413,0.0023383263,0.00021958198,0.0059869,0.00022161214],"about_ca_topic_score_codex":0.000006641714,"about_ca_topic_score_gemma":0.000022234597,"teacher_disagreement_score":0.97330886,"about_ca_system_score_codex":0.00012556373,"about_ca_system_score_gemma":0.00009670394,"threshold_uncertainty_score":0.7471096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007905694,0.0034588291,0.9858211,0.00011300182,0.0014945485,0.00016857343,8.441417e-7,0.00035398768,0.008510001],"genre_scores_gemma":[0.05564008,0.00236935,0.8799353,0.0020897177,0.014647825,0.00014441478,0.000029434135,0.00046887435,0.044674966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975471,0.000017705786,0.00048348057,0.00096408033,0.0003846575,0.00060298643],"domain_scores_gemma":[0.99875504,0.00037711597,0.000100797246,0.0005256131,0.000060296657,0.00018115017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019677037,0.0004727247,0.0005647963,0.00025905107,0.00007155589,0.00028336386,0.0006043395,0.0004639883,0.00002579279],"category_scores_gemma":[0.000028101354,0.0005363624,0.0001530942,0.0002806771,0.00002431693,0.00017099633,0.0007637811,0.001589691,0.00001355423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022031481,0.000019955776,0.000067476336,0.000035774927,0.00006400159,0.0002424096,0.000047335798,0.011093257,0.00001109036,0.87169784,0.00019710897,0.11652155],"study_design_scores_gemma":[0.00020026059,0.00006578644,0.00095339963,0.00074973155,0.000013831192,0.00016591829,1.3909457e-7,0.92054826,0.000050361487,0.0067033125,0.06969501,0.0008539578],"about_ca_topic_score_codex":0.000008329516,"about_ca_topic_score_gemma":0.0000022838622,"teacher_disagreement_score":0.909455,"about_ca_system_score_codex":0.00017773523,"about_ca_system_score_gemma":0.00007283881,"threshold_uncertainty_score":0.9997088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019554235,0.00046938902,0.97880673,0.00027180783,0.00010157788,0.00059234013,0.000059206377,0.00013960393,0.000005107148],"genre_scores_gemma":[0.8972386,0.000021955031,0.10146005,0.00010350906,0.00024628008,0.0002810085,0.00054336654,0.000028228898,0.00007700799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974162,0.00013512175,0.00057565945,0.0011273817,0.00033120663,0.00041441774],"domain_scores_gemma":[0.99867195,0.0000927654,0.00027470142,0.0004946938,0.0002957222,0.00017016637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001196944,0.00024077039,0.00022128725,0.000101311976,0.0004975194,0.0005513332,0.00059903733,0.000110512694,0.000023968572],"category_scores_gemma":[0.0000053848253,0.00025045077,0.00006226585,0.00018337737,0.00005864494,0.0010385385,0.00011094385,0.000096470816,6.4509186e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009600855,0.00019394943,0.000003090685,0.00016136686,0.000014007662,0.0000017443276,0.00044431674,0.20131062,0.2912554,0.0023858568,0.000118658994,0.50401497],"study_design_scores_gemma":[0.0011268604,0.00016424888,0.00006271562,0.00006352083,0.00007354616,0.00002633953,0.000045367924,0.9630712,0.033944476,0.00085468893,0.00028274112,0.00028427684],"about_ca_topic_score_codex":0.000007397983,"about_ca_topic_score_gemma":0.000006040089,"teacher_disagreement_score":0.87768435,"about_ca_system_score_codex":0.00008216263,"about_ca_system_score_gemma":0.00023332622,"threshold_uncertainty_score":0.99999475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50343066,0.016756618,0.477143,0.00036320384,0.0021921876,0.00006236988,0.000001324623,0.0000069489656,0.00004369707],"genre_scores_gemma":[0.98854226,0.007353899,0.0034091463,0.000077318466,0.00059376634,0.0000010917762,9.852007e-7,0.000013178955,0.000008366544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997381,0.000081157996,0.0011645922,0.00022184153,0.00086053985,0.00029088082],"domain_scores_gemma":[0.9968924,0.0004104569,0.0008247918,0.00010408634,0.0015954516,0.00017283809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007327913,0.0002066723,0.00052405056,0.0011135804,0.000024129798,0.00025733773,0.00079813896,0.00014940003,0.0000015386239],"category_scores_gemma":[0.00007888143,0.00018467414,0.0001284111,0.0006716774,0.000028651266,0.000577426,0.00026468732,0.0008876041,1.5309568e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051120785,0.00089712406,0.057198405,0.0001339182,0.003260785,0.002990786,0.000700817,0.28249067,0.002948102,0.26309425,0.00043867456,0.38533527],"study_design_scores_gemma":[0.0014797434,0.00074676087,0.016593507,0.00040191738,0.000022718315,0.006253851,0.000008031909,0.9728411,0.00036270326,0.00018381301,0.0009172453,0.00018861741],"about_ca_topic_score_codex":0.000005147816,"about_ca_topic_score_gemma":0.0000012667995,"teacher_disagreement_score":0.6903504,"about_ca_system_score_codex":0.00020084254,"about_ca_system_score_gemma":0.00020764577,"threshold_uncertainty_score":0.75307924},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023788251,0.00064296735,0.9301492,0.00018997109,0.0018237757,0.0004456404,6.993108e-7,0.00039545857,0.04256404],"genre_scores_gemma":[0.89312834,0.000019026967,0.10593797,0.00016022421,0.00016327624,0.00011600821,0.000007627222,0.000013256224,0.00045428582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802893,0.00015816471,0.00042004127,0.00083132857,0.00025889053,0.00030261115],"domain_scores_gemma":[0.99835145,0.00006378397,0.000094484254,0.0013397306,0.00007560444,0.00007491226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048402973,0.00021012123,0.0003702859,0.00008310743,0.000041139807,0.00081015547,0.0014262008,0.00024016258,0.000030222358],"category_scores_gemma":[0.00002018504,0.00020185056,0.00008020034,0.0002830043,0.000010403197,0.00019484587,0.003950947,0.0006684073,0.000028077888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025132495,0.00020850042,0.005627224,0.0019110446,0.000114182556,0.0027498445,0.0044510695,0.57047147,0.0004267483,0.3107462,0.0035269181,0.09976429],"study_design_scores_gemma":[0.00012735941,0.0000084077665,0.0005619531,0.0007204327,0.0000021286498,0.00004156526,0.00012527182,0.9976347,0.0002933107,0.0000808777,0.00013045607,0.0002735417],"about_ca_topic_score_codex":0.00027843833,"about_ca_topic_score_gemma":0.00017497122,"teacher_disagreement_score":0.86934006,"about_ca_system_score_codex":0.00018881077,"about_ca_system_score_gemma":0.00023983662,"threshold_uncertainty_score":0.8231227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022447167,0.01974914,0.9459864,0.00029798225,0.0024490324,0.0025422939,0.000007981783,0.0006161373,0.0059038596],"genre_scores_gemma":[0.7731162,0.0013639624,0.21811101,0.0012816769,0.00047478627,0.0030317132,0.00021162567,0.00011895221,0.0022900791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946963,0.0006154371,0.0010405987,0.002034716,0.000619034,0.0009938781],"domain_scores_gemma":[0.99571306,0.0004693262,0.00055952376,0.0025789368,0.00044274045,0.00023639572],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001135891,0.00068220607,0.0009418682,0.000252665,0.00013768296,0.0011181162,0.0026038466,0.0007928836,0.00028620707],"category_scores_gemma":[0.00005828139,0.00071742217,0.0002866063,0.0019807066,0.00008725017,0.00046342614,0.0042781252,0.0019845325,0.000032446653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014030887,0.00024663992,0.0008239673,0.000088632696,0.000053506516,0.00017546564,0.00068582484,0.90654325,0.000012224184,0.0003876232,0.0026091842,0.08835963],"study_design_scores_gemma":[0.0006986316,0.00009629228,0.00071746286,0.00088929175,0.000017138116,0.0000037544517,0.00020926612,0.98640716,0.00032252187,0.00033685437,0.009423419,0.00087821274],"about_ca_topic_score_codex":0.000030359939,"about_ca_topic_score_gemma":0.0010196101,"teacher_disagreement_score":0.750669,"about_ca_system_score_codex":0.00038874158,"about_ca_system_score_gemma":0.0012070942,"threshold_uncertainty_score":0.9999188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062009094,0.003362404,0.99147785,0.00020004934,0.0025135938,0.0011481134,0.0000114186805,0.000611706,0.0006128746],"genre_scores_gemma":[0.30236548,0.00091545086,0.68939716,0.0017624723,0.0007290623,0.0028352544,0.0009455185,0.00010119471,0.0009484015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644154,0.00019627354,0.00068356364,0.0015627486,0.00039059776,0.00072529423],"domain_scores_gemma":[0.9964954,0.0004931981,0.00047188194,0.0018197083,0.0005184658,0.00020130842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005599208,0.00050964893,0.0006298333,0.000116120405,0.00024112544,0.0009483627,0.001725494,0.00070284563,0.00013823352],"category_scores_gemma":[0.000026931762,0.00052795344,0.0003634977,0.0004679344,0.00003968038,0.00027857724,0.0022186788,0.00053134415,0.0000017040308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010291253,0.00007224292,0.000016156779,0.000047788726,0.00003800519,0.000015218611,0.00005925847,0.92804676,0.000001822862,0.00070569455,0.002706376,0.068280384],"study_design_scores_gemma":[0.0004428735,0.00011465186,0.00000545905,0.0002550995,0.00003111037,0.0000042184233,0.000030259005,0.9934707,0.0001082354,0.000109981294,0.004842196,0.00058517884],"about_ca_topic_score_codex":0.000032408698,"about_ca_topic_score_gemma":0.00012366264,"teacher_disagreement_score":0.30230346,"about_ca_system_score_codex":0.00025770543,"about_ca_system_score_gemma":0.00059916696,"threshold_uncertainty_score":0.9997172},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018985694,0.00039227348,0.9758546,0.0023574675,0.0006018356,0.00066200754,0.000013278387,0.0011058198,0.00002702049],"genre_scores_gemma":[0.7755537,0.000037356232,0.22312069,0.00045950836,0.000032595315,0.0004529207,0.0000128263,0.00006307611,0.00026733632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719566,0.000119357435,0.0004134754,0.0011627704,0.00023165831,0.00087709614],"domain_scores_gemma":[0.99773425,0.0002470119,0.0001545921,0.0014505846,0.0003000135,0.00011357762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016412733,0.00042365608,0.00054431846,0.00034631108,0.000489834,0.000094742296,0.0009623459,0.00075412256,0.000047427187],"category_scores_gemma":[0.0000075367248,0.00042085256,0.00022190245,0.0015179707,0.00038032542,0.00023747778,0.000016740973,0.00089387904,0.000044008604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006755881,0.0004756993,0.000007412973,0.00002154365,0.00014979343,0.00024758594,0.000037255795,0.84630984,0.005640885,0.0010911165,0.00005283894,0.14589849],"study_design_scores_gemma":[0.0019776523,0.0006653914,0.000005527469,0.0000755075,0.00006994638,0.0003173359,0.000033266922,0.95681286,0.03839198,0.000102944956,0.0010950638,0.00045251223],"about_ca_topic_score_codex":0.000011091862,"about_ca_topic_score_gemma":0.00010104312,"teacher_disagreement_score":0.756568,"about_ca_system_score_codex":0.0001960437,"about_ca_system_score_gemma":0.00026201276,"threshold_uncertainty_score":0.99982435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070677407,0.00021022576,0.65281796,0.093656205,0.0002775113,0.17934214,0.00016469375,0.0014173419,0.07140712],"genre_scores_gemma":[0.54459745,0.0000094651405,0.15072963,0.0010265667,0.000060522456,0.30312544,0.00013441092,0.00003547175,0.00028106364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975582,0.0005827283,0.00048578976,0.0005306001,0.00038522706,0.00045748282],"domain_scores_gemma":[0.98969424,0.0025982328,0.00027734204,0.006656201,0.00061315164,0.00016082171],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006338281,0.00026309962,0.00029904253,0.00009623707,0.0013957086,0.00041935916,0.00511403,0.00012665396,0.00001884516],"category_scores_gemma":[0.00020705172,0.000274747,0.00020074227,0.00083384104,0.00035586196,0.00030869097,0.0015327906,0.0005571281,0.00003726605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054888642,0.0022276782,0.00083978724,0.00020299296,0.00007926368,0.000004422041,0.0028125218,0.0014568145,0.000610955,0.935266,0.0036161272,0.052828524],"study_design_scores_gemma":[0.0010113878,0.00010277782,0.0003379425,0.00025353508,0.000016970378,0.000008761978,0.00022475408,0.9575814,0.00013540963,0.0033309923,0.036667287,0.00032877224],"about_ca_topic_score_codex":0.000034773224,"about_ca_topic_score_gemma":0.000509562,"teacher_disagreement_score":0.9561246,"about_ca_system_score_codex":0.00021078678,"about_ca_system_score_gemma":0.0007404489,"threshold_uncertainty_score":0.9999705},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063210186,0.0009487222,0.8413709,0.00013516693,0.002031507,0.14595735,0.000026435655,0.0012540383,0.0019548787],"genre_scores_gemma":[0.19555819,0.00021998385,0.06037513,0.0014259128,0.0015032766,0.7396003,0.00026462277,0.0002544866,0.0007981076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911032,0.00034780003,0.001766961,0.0037465726,0.0011696008,0.0018658922],"domain_scores_gemma":[0.99248457,0.00064631295,0.0012272077,0.0044137025,0.00059038977,0.0006378457],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017373287,0.0013839417,0.001400053,0.00029317042,0.00059630896,0.0020463022,0.004248052,0.001321438,0.00013646217],"category_scores_gemma":[0.00007559688,0.001289809,0.00076609466,0.0006754897,0.0001408332,0.0004990214,0.0040349513,0.0017545999,0.000018964609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013650345,0.0009677977,0.000015479656,0.00021744527,0.0001079117,0.00007746777,0.0005392727,0.7256033,0.00004327014,0.0011437291,0.0019793815,0.26916844],"study_design_scores_gemma":[0.0018973459,0.0009734477,0.00032943903,0.0011070558,0.000034109824,0.000018418279,0.000119967466,0.9535587,0.0008135975,0.00029548537,0.039287776,0.0015646695],"about_ca_topic_score_codex":0.00003885569,"about_ca_topic_score_gemma":0.00017145005,"teacher_disagreement_score":0.7809957,"about_ca_system_score_codex":0.0005020812,"about_ca_system_score_gemma":0.00091441517,"threshold_uncertainty_score":0.9999751},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018713966,0.0045441426,0.9691196,0.00006976697,0.0023900513,0.00093325856,0.0000028707682,0.00037363777,0.003852709],"genre_scores_gemma":[0.52697086,0.0024127548,0.46619228,0.00125358,0.0006338255,0.000549344,0.00009565887,0.000117947835,0.0017737802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956171,0.00017431627,0.0008813247,0.0018086982,0.00055935915,0.000959215],"domain_scores_gemma":[0.9963739,0.00009188641,0.0002885983,0.002815708,0.00017261757,0.0002573155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072617084,0.00057933497,0.00080516847,0.00022434312,0.00008866045,0.00072234485,0.0026542447,0.0007641787,0.00023567924],"category_scores_gemma":[0.000012685286,0.0006196734,0.00029608203,0.0006414715,0.00006117909,0.0004921119,0.007123407,0.0017371023,0.000017783756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035709338,0.000091619615,0.000103699946,0.0000357063,0.00002290943,0.00016500967,0.00040980207,0.95550895,0.000016262313,0.00075959746,0.0013143047,0.041568592],"study_design_scores_gemma":[0.00023196689,0.00003263684,0.000043681397,0.00018391426,0.000010761365,0.000027698046,0.00004462432,0.9961795,0.000047474918,0.0009752368,0.0015743239,0.0006481723],"about_ca_topic_score_codex":0.000056456935,"about_ca_topic_score_gemma":0.00044099308,"teacher_disagreement_score":0.50825685,"about_ca_system_score_codex":0.00038133046,"about_ca_system_score_gemma":0.0010415824,"threshold_uncertainty_score":0.99962544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39644745,0.000027846443,0.6021266,0.0005198843,0.0003153622,0.00016787458,0.0000010911358,0.00011979807,0.0002740825],"genre_scores_gemma":[0.95741224,0.0000059957883,0.042096596,0.00029866255,0.00015964657,0.000011940533,5.5963017e-7,0.000011310784,0.000003031901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699694,0.00022549408,0.00026379107,0.0010131965,0.0007576913,0.00074289466],"domain_scores_gemma":[0.99813974,0.0004808903,0.00007645991,0.00062389084,0.00013112836,0.0005478823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012391097,0.0002622572,0.00032864293,0.0001574666,0.00019696742,0.00044390312,0.0011902688,0.00009047477,0.000010046864],"category_scores_gemma":[0.000046506488,0.00020168457,0.00003136032,0.0014665693,0.00255028,0.0008427685,0.00069695606,0.0004192594,0.000005076213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006987541,0.00016452318,0.013466007,0.000006817903,0.000009030623,0.00010402548,0.00089997065,0.006222201,0.0001206658,0.8969265,0.000037108868,0.08197326],"study_design_scores_gemma":[0.00057590904,0.00034879183,0.037473574,0.00004434197,0.0000024717187,0.00016571379,0.000014362519,0.9532989,0.00025940654,0.007498534,0.000018608065,0.00029934788],"about_ca_topic_score_codex":0.000017309354,"about_ca_topic_score_gemma":0.00001861186,"teacher_disagreement_score":0.94707674,"about_ca_system_score_codex":0.00012408427,"about_ca_system_score_gemma":0.0002025377,"threshold_uncertainty_score":0.9396613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018212985,0.000039436687,0.9790517,0.0011081637,0.0001261685,0.00060771155,0.000009547302,0.000299489,0.0005447877],"genre_scores_gemma":[0.71287507,0.0000036299177,0.28511018,0.0010392757,0.0006552788,0.00014635161,0.00004118668,0.000028333241,0.00010072347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779147,0.00008665262,0.00031741045,0.00070028956,0.0004426584,0.0006615494],"domain_scores_gemma":[0.9983429,0.00038378485,0.00017474886,0.00070474873,0.00021560575,0.00017822013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004420593,0.00029085134,0.00034056813,0.00004891443,0.0002130221,0.0003256075,0.00062521495,0.00010960725,0.000016569487],"category_scores_gemma":[0.0000107185615,0.0002292687,0.00011718338,0.0003708276,0.00006270016,0.0004989161,0.00011398995,0.00023558502,0.00001555689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016905996,0.00035917826,0.000058571233,0.000018313254,0.00005342867,0.000029636545,0.0003373925,0.77872294,0.000120289595,0.03471861,0.006086925,0.17932567],"study_design_scores_gemma":[0.0010586733,0.0004397344,0.000184917,0.000059697628,0.000026943811,0.000021493212,0.000018516846,0.9966835,0.00025822766,0.00010106739,0.0007987339,0.00034851668],"about_ca_topic_score_codex":0.000019156087,"about_ca_topic_score_gemma":0.00006623622,"teacher_disagreement_score":0.69466203,"about_ca_system_score_codex":0.00016159784,"about_ca_system_score_gemma":0.00010534234,"threshold_uncertainty_score":0.9349306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01767639,0.00023184813,0.9705524,0.0004740225,0.0033183747,0.0005401897,0.0000020730465,0.0003692686,0.0068354355],"genre_scores_gemma":[0.96014017,0.00017552181,0.037921507,0.00048386081,0.0004255083,0.00018674076,0.000033859797,0.000029860694,0.00060295453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648076,0.00027559846,0.00066821283,0.0014497121,0.00036493895,0.0007607624],"domain_scores_gemma":[0.9970137,0.00022505198,0.00019469434,0.0022280784,0.00015513466,0.0001833721],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00045150332,0.00046112755,0.0006973143,0.00011519565,0.000054513355,0.0007409265,0.0030815012,0.00052367017,0.00033323752],"category_scores_gemma":[0.000019472733,0.00045403,0.00018875144,0.0005046895,0.000060523773,0.00025968818,0.008852773,0.0015916643,0.00007842577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004069697,0.0009177244,0.019494634,0.0006967368,0.00035969872,0.0025434236,0.0052587325,0.21114758,0.000052937175,0.22578612,0.03217013,0.5015316],"study_design_scores_gemma":[0.0002316743,0.000024149265,0.0019782267,0.0007873825,0.0000069182784,0.000014806661,0.00006863931,0.9940256,0.00007294548,0.0019982618,0.0002173252,0.00057410233],"about_ca_topic_score_codex":0.00032530393,"about_ca_topic_score_gemma":0.0020469064,"teacher_disagreement_score":0.9424638,"about_ca_system_score_codex":0.00018121586,"about_ca_system_score_gemma":0.00035884752,"threshold_uncertainty_score":0.99979115},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016298126,0.020602796,0.9252189,0.00033675777,0.0047712675,0.00255924,0.000011830768,0.00096343947,0.029237667],"genre_scores_gemma":[0.7091076,0.011318414,0.24445458,0.0036503756,0.0024296134,0.0037194975,0.000393267,0.0002762881,0.024650404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518394,0.0004805674,0.0007381921,0.0020619899,0.0006886104,0.0008467167],"domain_scores_gemma":[0.99534804,0.00039071622,0.00053710816,0.0029509475,0.0005109219,0.00026224973],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071459083,0.00068357063,0.00080354034,0.00013138182,0.00021816771,0.0013756115,0.0026026515,0.00072532165,0.0003146516],"category_scores_gemma":[0.00004935026,0.000675566,0.00032533138,0.0010056199,0.00008344707,0.00036947537,0.0057840357,0.0018304529,0.00011061359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015610132,0.00030501306,0.00008773615,0.00008425273,0.0002089628,0.00016969188,0.001274693,0.75823396,0.000014495031,0.002862144,0.027907291,0.20883615],"study_design_scores_gemma":[0.0005705806,0.00037183467,0.00027046193,0.0010278147,0.000047983383,0.000012790968,0.0003328825,0.9353507,0.00067325716,0.0009508072,0.058963187,0.0014276583],"about_ca_topic_score_codex":0.0000064884157,"about_ca_topic_score_gemma":0.00009643414,"teacher_disagreement_score":0.6928094,"about_ca_system_score_codex":0.00024315187,"about_ca_system_score_gemma":0.00057185604,"threshold_uncertainty_score":0.999661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46283066,0.0013497408,0.5332105,0.000022931848,0.0014353669,0.00042175173,0.000048008016,0.00016670648,0.0005142797],"genre_scores_gemma":[0.9726358,0.000067229805,0.026811061,0.000064348285,0.000103087295,0.000018194944,0.00019683946,0.000015934505,0.000087485416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971731,0.00025387693,0.00058868167,0.0011820192,0.0005138067,0.00028853965],"domain_scores_gemma":[0.99648196,0.00007394077,0.00042440146,0.0026526663,0.00018233548,0.00018472542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025371776,0.0003601389,0.0010436003,0.0003999203,0.000043613985,0.00065896893,0.0014921036,0.0004622391,0.00016227373],"category_scores_gemma":[0.000009776558,0.00031690695,0.00021213891,0.0008945708,0.00007160881,0.00023000695,0.0016003958,0.0004195287,3.299314e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011595504,0.00005545256,0.01757834,0.00044223617,0.0043225856,0.0000875684,0.0014346944,0.9088499,0.00096093846,0.05311955,0.00043189724,0.012705231],"study_design_scores_gemma":[0.000136646,0.00002292684,0.07813974,0.000041773692,0.0005052397,0.0000109755565,0.000067752844,0.91996765,0.0001575823,0.0005595292,0.00006650618,0.00032366236],"about_ca_topic_score_codex":0.0012573111,"about_ca_topic_score_gemma":0.0007401072,"teacher_disagreement_score":0.50980514,"about_ca_system_score_codex":0.000054046996,"about_ca_system_score_gemma":0.00012706281,"threshold_uncertainty_score":0.9999283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011680377,0.003919518,0.9820989,0.00040003014,0.0006872667,0.00094363396,0.000003244735,0.00010171066,0.0001653605],"genre_scores_gemma":[0.50128067,0.00019166821,0.49798542,0.00019712398,0.00026218,0.000019885605,0.000002258397,0.00003730227,0.000023520513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959041,0.00006811281,0.00063598086,0.0019703312,0.00047269865,0.00094880175],"domain_scores_gemma":[0.9963224,0.0023318052,0.00034771505,0.00065723795,0.00010335011,0.00023750108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001339069,0.0006190456,0.0007902657,0.00062040845,0.0003866115,0.0006615256,0.0012422645,0.00048934267,0.000004720197],"category_scores_gemma":[0.00013657517,0.00061280496,0.00009595147,0.00047397232,0.0007288834,0.0007973853,0.0009976728,0.0009782616,2.9769942e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030787636,0.000018787445,0.00079213746,0.00010716625,0.00000991167,0.00008914226,0.0018683162,0.15914589,0.0003001627,0.0028749595,0.0000023991129,0.8347603],"study_design_scores_gemma":[0.0010501439,0.0002579681,0.0008812561,0.0019036195,0.00001184358,0.00021173368,0.0000027469819,0.96917564,0.00022784213,0.025434066,0.00015315205,0.0006899905],"about_ca_topic_score_codex":0.000017790875,"about_ca_topic_score_gemma":0.00010673334,"teacher_disagreement_score":0.8340703,"about_ca_system_score_codex":0.00024337687,"about_ca_system_score_gemma":0.00030353744,"threshold_uncertainty_score":0.99963236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42779306,0.00001599219,0.115996,0.010132441,0.0013619463,0.42406437,0.0000070056085,0.00016857687,0.020460593],"genre_scores_gemma":[0.94480866,2.2058947e-7,0.0022861103,0.00008303367,0.0000328542,0.052068982,6.362497e-8,0.000007036648,0.0007130161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838376,0.000055416727,0.00020776225,0.00035640178,0.00061995315,0.00037668398],"domain_scores_gemma":[0.9984559,0.00010618785,0.00017476304,0.0011848607,0.00001529665,0.000063022715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092756713,0.0001249386,0.00010734648,0.000023281988,0.00045679306,0.00011498964,0.0024401932,0.00002586599,0.00007030316],"category_scores_gemma":[0.000028418923,0.000062599145,0.00007054309,0.00019680275,0.00060059567,0.00029390617,0.0009748012,0.000096394084,0.00007388302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051194504,0.0005626113,0.0001545357,0.000045689154,0.00003291421,0.0000010774627,0.0023691733,0.773234,0.055659223,0.14771472,0.002480289,0.017694544],"study_design_scores_gemma":[0.0011054847,0.00071110175,0.026288386,0.00013984788,0.000009867501,0.000023100183,0.00012698049,0.851835,0.1001749,0.018080821,0.0010443325,0.00046018008],"about_ca_topic_score_codex":0.000015430507,"about_ca_topic_score_gemma":1.076227e-7,"teacher_disagreement_score":0.51701564,"about_ca_system_score_codex":0.000084290485,"about_ca_system_score_gemma":0.000048583337,"threshold_uncertainty_score":0.45345268},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17556293,0.034296792,0.7146499,0.021525951,0.0037723996,0.0085555045,0.001252671,0.003314053,0.037069786],"genre_scores_gemma":[0.99206716,0.00022270188,0.0064403354,0.00059671985,0.00013226154,0.00019453153,0.00018415619,0.000025754636,0.0001363977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813664,0.0002689734,0.00024425721,0.0005965324,0.00042718893,0.00032641614],"domain_scores_gemma":[0.994867,0.0008551421,0.00014891037,0.0036764103,0.00020311966,0.00024936703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004579197,0.000245639,0.00021891837,0.0000809229,0.0004728901,0.00036594862,0.003010692,0.00013916208,0.0000073699043],"category_scores_gemma":[0.000091376955,0.00023450874,0.000050777573,0.00054053334,0.00021780969,0.00069518806,0.0016696957,0.00067667756,0.00008694158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028665765,0.0013397749,0.0004215197,0.000026407548,0.00012429919,0.00001123133,0.0046194713,0.02095315,0.00010139285,0.01192906,0.022606837,0.9375802],"study_design_scores_gemma":[0.0006459536,0.0005026385,0.00038216673,0.00011621853,0.0000129407545,0.0000048092684,0.00029541264,0.9444305,0.000046842706,0.00070312497,0.05257257,0.00028684235],"about_ca_topic_score_codex":0.0000072252797,"about_ca_topic_score_gemma":0.000270047,"teacher_disagreement_score":0.93729335,"about_ca_system_score_codex":0.00017565908,"about_ca_system_score_gemma":0.00016487278,"threshold_uncertainty_score":0.9562989},"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":"protocol","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003664683,0.00011177418,0.0016322982,0.0003161141,0.00005308158,0.9818342,0.000011341292,0.00022445164,0.01215208],"genre_scores_gemma":[0.0033019143,0.000005293096,0.0010127098,0.000016075322,0.00020479369,0.9649835,0.00023029314,0.00004891403,0.030196477],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953285,0.00063765055,0.00061181723,0.0011169254,0.0013731102,0.0009320195],"domain_scores_gemma":[0.99751437,0.00029183077,0.0002111996,0.0013405505,0.00044364488,0.00019838745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018651745,0.0003375,0.00041730326,0.0006428835,0.00024115916,0.00095943763,0.0015488154,0.00051929953,0.00006410002],"category_scores_gemma":[0.00010351007,0.00032208016,0.00006570329,0.001160911,0.00011531157,0.00049706595,0.0003797351,0.0014963626,0.00008732873],"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.0023883334,0.00414032,0.010421321,0.012432552,0.00013832074,0.0006647946,0.014515027,0.00025529138,0.0053767404,0.13621797,0.4596536,0.35379577],"study_design_scores_gemma":[0.0097226035,0.0020922634,0.21537104,0.018429497,0.0000087373,0.00004471602,0.000224674,0.03903714,0.0059972177,0.069914,0.63680136,0.0023567453],"about_ca_topic_score_codex":0.0001078656,"about_ca_topic_score_gemma":0.0009842126,"teacher_disagreement_score":0.351439,"about_ca_system_score_codex":0.00015404752,"about_ca_system_score_gemma":0.0004546419,"threshold_uncertainty_score":0.9999231},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6936803,0.000019275021,0.22411157,0.0007378283,0.0008264784,0.00041591868,0.0000012507305,0.00010153613,0.080105856],"genre_scores_gemma":[0.984699,0.000006233595,0.014322965,0.00013282384,0.000059692637,0.000008169282,4.6393262e-7,0.000003831251,0.0007667884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.0000067205387,0.00023658761,0.00016490814,0.00029300625,0.00010350259],"domain_scores_gemma":[0.9992907,0.00012921613,0.0001696351,0.00019989347,0.0001883625,0.00002217373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012677733,0.00006346635,0.000095166455,0.000046797908,0.00008316433,0.000020713189,0.0009813092,0.00002962681,0.000051384177],"category_scores_gemma":[0.000037410195,0.000044591972,0.00006130687,0.0003788809,0.00008266873,0.00017700915,0.00032600726,0.000096145806,0.0000072216153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014553269,0.0005950666,0.024868576,0.000027802316,0.00009124312,0.0000016670456,0.0072638374,0.0366666,0.002071703,0.83543473,0.020876614,0.07208758],"study_design_scores_gemma":[0.0007115615,0.0001725832,0.052053377,0.00027152387,0.000008355076,0.000049014576,0.00027868288,0.9146951,0.012371224,0.0030123189,0.016079348,0.00029691702],"about_ca_topic_score_codex":0.000008348973,"about_ca_topic_score_gemma":0.000002094907,"teacher_disagreement_score":0.8780285,"about_ca_system_score_codex":0.000022648761,"about_ca_system_score_gemma":0.00003595019,"threshold_uncertainty_score":0.1823533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018853221,0.00067975017,0.9777485,0.00016961152,0.0009802863,0.0005971761,0.00013340909,0.0001858653,0.00065218593],"genre_scores_gemma":[0.99116826,0.000062081635,0.00802756,0.00014789589,0.00020902544,0.00006280831,0.00022219,0.000014265931,0.00008591576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977863,0.00012585576,0.0005245998,0.00064742327,0.00036359546,0.00055224745],"domain_scores_gemma":[0.9981322,0.00063007954,0.00035754757,0.0002567226,0.0004181725,0.00020527381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009665117,0.00028310798,0.00038315728,0.00011495415,0.00032941747,0.00047529826,0.00047692773,0.00019170734,0.0000040597033],"category_scores_gemma":[0.000031589938,0.00027174878,0.0000798434,0.00021224766,0.000046898596,0.00017940479,0.00021788359,0.00028023357,0.0000027065466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012527563,0.0008883657,0.005400527,0.0001766726,0.00063448324,0.00008769973,0.0028197155,0.5934231,0.00019398914,0.24798292,0.0028125683,0.14432718],"study_design_scores_gemma":[0.0016247984,0.00035579602,0.001625146,0.00023990538,0.000010300612,0.000015134166,0.00053755456,0.99266136,0.0000071961067,0.00029338448,0.0023287584,0.00030067572],"about_ca_topic_score_codex":0.000012713247,"about_ca_topic_score_gemma":0.000046907964,"teacher_disagreement_score":0.972315,"about_ca_system_score_codex":0.00010728198,"about_ca_system_score_gemma":0.00004514679,"threshold_uncertainty_score":0.9999735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021183925,0.0003235824,0.9750139,0.0000938497,0.0011161948,0.000887412,0.000039083603,0.00041712046,0.0009248976],"genre_scores_gemma":[0.9566085,0.000058707257,0.041239712,0.0007996966,0.00031565144,0.00046162365,0.00043036192,0.000028173814,0.000057625304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738246,0.00021019348,0.00096281216,0.0003878392,0.0004173267,0.00063939305],"domain_scores_gemma":[0.9969059,0.0006661695,0.0005177176,0.0009322998,0.00080384396,0.00017406183],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007460955,0.00033394297,0.0004118102,0.000108478875,0.00052219897,0.00170991,0.00087996764,0.00031598762,0.00005405582],"category_scores_gemma":[0.00021506185,0.00034756932,0.00016506722,0.00069770566,0.00010699201,0.005894603,0.0003393863,0.0002905026,0.00008173114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015304696,0.00019839294,0.0030121247,0.0010205114,0.0003962323,0.00006193779,0.025032843,0.49229863,0.00015692534,0.043098018,0.023935378,0.41063595],"study_design_scores_gemma":[0.00076484226,0.000069890695,0.0008552911,0.00026643553,0.000017352342,0.00003769265,0.0002167653,0.9745658,0.0013392081,0.01631821,0.0051222756,0.0004262248],"about_ca_topic_score_codex":0.000038031845,"about_ca_topic_score_gemma":0.00002607976,"teacher_disagreement_score":0.9354245,"about_ca_system_score_codex":0.00030518213,"about_ca_system_score_gemma":0.00029812148,"threshold_uncertainty_score":0.99989766},"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":"other","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1064727e-7,0.00007300711,0.30841205,0.0000132833675,0.00049809937,0.12611651,0.000029824985,0.00043706264,0.56442],"genre_scores_gemma":[0.0018190957,0.0000011339841,0.07951788,0.0024288488,0.002325036,0.83191526,0.000021773882,0.00021713892,0.08175385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99670684,0.000046168858,0.0007999911,0.0011652462,0.00043788753,0.00084386393],"domain_scores_gemma":[0.9970746,0.0001531633,0.0005779599,0.0015299249,0.0003995136,0.0002648476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003985596,0.00071448536,0.00065694645,0.000045678295,0.0003515074,0.00036412806,0.001686117,0.00065979885,0.00008376717],"category_scores_gemma":[0.000016708414,0.00070544373,0.000370396,0.000052957967,0.000105081104,0.00013601065,0.0004059899,0.00040519208,0.00017433087],"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.000075301556,0.000017789855,0.0000034200377,0.000059193506,0.000047553596,0.000018713265,0.00003097458,0.0023514018,9.592184e-7,0.9288537,0.01448676,0.05405425],"study_design_scores_gemma":[0.0015305548,0.00079866126,0.000002173189,0.0006922914,0.000041131887,0.000015407553,7.654561e-7,0.037279725,0.000036495665,0.22224113,0.7363062,0.0010554848],"about_ca_topic_score_codex":0.000009699395,"about_ca_topic_score_gemma":0.00009786988,"teacher_disagreement_score":0.7218194,"about_ca_system_score_codex":0.00031569359,"about_ca_system_score_gemma":0.0007954674,"threshold_uncertainty_score":0.9995397},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46283066,0.0013497408,0.5332105,0.000022931848,0.0014353669,0.00042175173,0.000048008016,0.00016670648,0.0005142797],"genre_scores_gemma":[0.9726358,0.000067229805,0.026811061,0.000064348285,0.000103087295,0.000018194944,0.00019683946,0.000015934505,0.000087485416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971731,0.00025387693,0.00058868167,0.0011820192,0.0005138067,0.00028853965],"domain_scores_gemma":[0.99648196,0.00007394077,0.00042440146,0.0026526663,0.00018233548,0.00018472542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025371776,0.0003601389,0.0010436003,0.0003999203,0.000043613985,0.00065896893,0.0014921036,0.0004622391,0.00016227373],"category_scores_gemma":[0.000009776558,0.00031690695,0.00021213891,0.0008945708,0.00007160881,0.00023000695,0.0016003958,0.0004195287,3.299314e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011595504,0.00005545256,0.01757834,0.00044223617,0.0043225856,0.0000875684,0.0014346944,0.9088499,0.00096093846,0.05311955,0.00043189724,0.012705231],"study_design_scores_gemma":[0.000136646,0.00002292684,0.07813974,0.000041773692,0.0005052397,0.0000109755565,0.000067752844,0.91996765,0.0001575823,0.0005595292,0.00006650618,0.00032366236],"about_ca_topic_score_codex":0.0012573111,"about_ca_topic_score_gemma":0.0007401072,"teacher_disagreement_score":0.50980514,"about_ca_system_score_codex":0.000054046996,"about_ca_system_score_gemma":0.00012706281,"threshold_uncertainty_score":0.9999283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004836831,0.007992947,0.7966075,0.00036969004,0.006682605,0.0013350972,0.0000016132033,0.0007732807,0.18140046],"genre_scores_gemma":[0.65408885,0.01138108,0.14427486,0.0033063143,0.003993156,0.0013474427,0.001096101,0.000386635,0.18012556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976667,0.00007133121,0.0005254321,0.0008075036,0.00033241886,0.0005966108],"domain_scores_gemma":[0.9985768,0.00011325745,0.00024487486,0.00086360174,0.00007944361,0.00012199872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018127427,0.0003821296,0.00041735912,0.00021814273,0.00006994336,0.00024482625,0.0014278347,0.0005301853,0.00015210925],"category_scores_gemma":[0.000014191272,0.00038399265,0.00012231154,0.0005965977,0.000012682339,0.00043648327,0.00021224032,0.0007655225,0.00009869282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023084962,0.00004707625,0.000034988847,0.00003325284,0.000021754773,0.00007663662,0.0007443908,0.057849932,0.0000055046626,0.003470534,0.007698322,0.9299945],"study_design_scores_gemma":[0.0004628241,0.0000591866,0.003926456,0.00032592987,0.000009667905,0.0000095185615,0.00019289358,0.9712189,0.000026500475,0.00027517945,0.022800487,0.00069249934],"about_ca_topic_score_codex":0.000021271062,"about_ca_topic_score_gemma":0.013665976,"teacher_disagreement_score":0.92930204,"about_ca_system_score_codex":0.00017818931,"about_ca_system_score_gemma":0.00011073521,"threshold_uncertainty_score":0.9998612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014342701,0.005523283,0.97699517,0.000002465256,0.00043278994,0.0011169618,0.000036048645,0.00008486978,0.001465707],"genre_scores_gemma":[0.84800535,0.0060942043,0.1265503,0.00011936592,0.00028081733,0.0028097143,0.008360894,0.00008374763,0.0076956116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979511,0.000072199,0.0006335836,0.0008393395,0.00023127242,0.0002725127],"domain_scores_gemma":[0.99784106,0.00017004313,0.00044387562,0.0010369713,0.00040579337,0.000102262544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004718846,0.00028578675,0.0006969467,0.0002894785,0.00009085146,0.00008733556,0.0005769551,0.00035919022,0.00003583794],"category_scores_gemma":[0.00001860009,0.0002689514,0.00026445452,0.0008011891,0.000033498276,0.00034181908,0.00007259621,0.00013979278,5.278628e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009084948,0.0002192639,0.000060791426,0.00021629062,0.0012609607,0.0000012393897,0.0014037456,0.64653754,0.000090125934,0.06152303,0.0016906185,0.28690553],"study_design_scores_gemma":[0.00013556157,0.00013890873,0.0006554154,0.000016973101,0.0007884867,2.9839975e-7,0.000029245992,0.99421626,0.000094156,0.003533214,0.00014004172,0.00025145448],"about_ca_topic_score_codex":0.000095641364,"about_ca_topic_score_gemma":0.0028851284,"teacher_disagreement_score":0.85044485,"about_ca_system_score_codex":0.000037740618,"about_ca_system_score_gemma":0.000080426005,"threshold_uncertainty_score":0.9999763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001803636,0.00017052477,0.97015405,0.002141544,0.00025650466,0.023323229,0.000002704395,0.00056507456,0.003206003],"genre_scores_gemma":[0.3735409,0.00001720344,0.460764,0.012015025,0.0022874149,0.1407384,0.000021684325,0.00010774832,0.010507641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977654,0.00007094565,0.00042210612,0.0006590844,0.0002961711,0.00078625645],"domain_scores_gemma":[0.9980665,0.0003393364,0.00015487781,0.0010481878,0.00018394917,0.00020717939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000530319,0.00026772442,0.0003691994,0.000061256265,0.00018333214,0.00033517505,0.0013455698,0.00016926002,0.00013116405],"category_scores_gemma":[0.0000170918,0.00023158515,0.00016163685,0.0003854155,0.000049796337,0.000495335,0.00016208994,0.00018551666,0.00008045507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022514997,0.0002990964,0.00017417985,0.00004626813,0.000043825563,0.0000079496895,0.00004963122,0.24084896,0.00020212245,0.04784369,0.12515852,0.5851006],"study_design_scores_gemma":[0.0021462853,0.00021117338,0.000027094015,0.00003271557,0.000004390435,0.0000018459896,0.0000023294367,0.7329591,0.0008870158,0.00023879924,0.26325443,0.00023479486],"about_ca_topic_score_codex":0.0000051460734,"about_ca_topic_score_gemma":0.00011193718,"teacher_disagreement_score":0.5848658,"about_ca_system_score_codex":0.00009796825,"about_ca_system_score_gemma":0.00015390913,"threshold_uncertainty_score":0.94437677},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014442925,0.00078501005,0.24497929,0.0002627673,0.006134445,0.0020604767,0.0000030050387,0.0010441799,0.7302879],"genre_scores_gemma":[0.8934218,0.00042378195,0.016923008,0.0009908619,0.0009737771,0.0004481445,0.0007310892,0.000079019075,0.08600851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997471,0.00008261378,0.00061041984,0.0009058266,0.00037197783,0.0005582164],"domain_scores_gemma":[0.99824136,0.000102389495,0.00018441366,0.0012547913,0.00008717746,0.00012987094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005680176,0.00034225584,0.0004356714,0.00015453977,0.00004658066,0.00015342917,0.0015727306,0.00055209384,0.0008163773],"category_scores_gemma":[0.000018132649,0.00033779838,0.0001395084,0.00059547153,0.000017149896,0.00041285894,0.0001355203,0.0007192999,0.00015472498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006548549,0.00075060374,0.0026946396,0.00013742203,0.00006915823,0.00017405549,0.0015879498,0.022187827,0.000011935384,0.20131445,0.07934696,0.6916595],"study_design_scores_gemma":[0.0007530235,0.00016193096,0.049593724,0.00014746902,0.000022126591,0.000015652367,0.00017107632,0.9194939,0.00016703262,0.0026926103,0.025291879,0.0014895559],"about_ca_topic_score_codex":0.00009166227,"about_ca_topic_score_gemma":0.007364662,"teacher_disagreement_score":0.8973061,"about_ca_system_score_codex":0.00015361581,"about_ca_system_score_gemma":0.00022078662,"threshold_uncertainty_score":0.99990743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017836124,0.0000014430664,0.9521161,0.00331073,0.00020357032,0.023496317,0.0000017088609,0.00011505019,0.0029190101],"genre_scores_gemma":[0.97364646,2.2398768e-7,0.003068712,0.0007357885,0.0002430495,0.022150358,0.0000032213936,0.000017444881,0.0001347635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978542,0.00020856594,0.0003476942,0.0007401716,0.00037718494,0.00047222152],"domain_scores_gemma":[0.99663967,0.00033495223,0.00036304787,0.0022057574,0.00027631546,0.00018027682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067037466,0.00026779447,0.00027942,0.000060904265,0.0005402861,0.0009926213,0.0019743952,0.00012978858,0.000030588268],"category_scores_gemma":[0.00015973336,0.00019238782,0.000039039314,0.00019604994,0.00017281855,0.0011513921,0.0005765357,0.00034749863,0.00013602142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023766774,0.00012819094,0.09959045,0.000034797922,0.000028969815,0.00002366261,0.0010378595,0.80054337,0.000131534,0.058775228,0.00118047,0.038287807],"study_design_scores_gemma":[0.00065170013,0.00010527082,0.15622976,0.00012780496,0.000005321776,0.000005372759,0.000007412341,0.8293443,0.00015038426,0.004589589,0.008518628,0.0002644841],"about_ca_topic_score_codex":0.00022245625,"about_ca_topic_score_gemma":0.0014572226,"teacher_disagreement_score":0.9558103,"about_ca_system_score_codex":0.000060546354,"about_ca_system_score_gemma":0.00019996364,"threshold_uncertainty_score":0.957187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013851088,0.0010774577,0.92340124,0.000345373,0.00006308912,0.06048374,0.0000020217547,0.0005466818,0.00022930383],"genre_scores_gemma":[0.8072561,0.00015453155,0.11500567,0.00017944971,0.00010370699,0.07721703,0.000013727427,0.000032890694,0.000036900943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975657,0.00021401384,0.00060517684,0.00072034023,0.00023549455,0.0006592959],"domain_scores_gemma":[0.9963097,0.00030808896,0.00047048336,0.0024189153,0.00032144992,0.00017136672],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00079728913,0.00036115389,0.00041366558,0.000113964015,0.001437227,0.0005326291,0.0019500488,0.0001663309,0.0000017130219],"category_scores_gemma":[0.000015551013,0.00032807468,0.0000940061,0.0007939388,0.00014879064,0.0005442894,0.0009712509,0.00060613605,0.0000020854516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043075484,0.00032437049,0.0001174908,0.00005778367,0.000029142873,0.0000015493838,0.0014772795,0.022626894,0.00025575823,0.0060556456,0.000106721585,0.9689043],"study_design_scores_gemma":[0.0013022817,0.001006484,0.00021349861,0.00037365215,0.00001643013,0.000055398257,0.00014048438,0.95104384,0.00014205104,0.00035809263,0.044936582,0.0004111879],"about_ca_topic_score_codex":0.000008381431,"about_ca_topic_score_gemma":0.0000139113845,"teacher_disagreement_score":0.9684931,"about_ca_system_score_codex":0.00010087339,"about_ca_system_score_gemma":0.000108547516,"threshold_uncertainty_score":0.99991715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011016153,0.0043893084,0.98433876,0.00006084186,0.004465263,0.0010204815,0.0000019428637,0.0003451885,0.0042765946],"genre_scores_gemma":[0.91431916,0.0047916817,0.01453006,0.0014567901,0.00091371825,0.0009653733,0.0009845067,0.00028265678,0.061756067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958607,0.00011678506,0.00086279743,0.0013270361,0.0007090124,0.0011236704],"domain_scores_gemma":[0.99783033,0.00017264008,0.00040600437,0.0011668275,0.00015007747,0.0002741307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081680034,0.0006753173,0.00069273537,0.00044834,0.0001238495,0.00023278168,0.0019239052,0.0010020892,0.00005290926],"category_scores_gemma":[0.000013963518,0.0006710778,0.00020077084,0.00095940824,0.000029651444,0.00038254829,0.00025002786,0.001116321,0.00009470191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002281453,0.001580358,0.0000535422,0.0002954306,0.00021607892,0.0008111212,0.0067298366,0.4410467,0.000047076683,0.005140364,0.013485423,0.53036594],"study_design_scores_gemma":[0.0008899617,0.00010638487,0.0014025862,0.00038627707,0.000013163634,0.0000064883534,0.00039339415,0.99425936,0.00021302386,0.0002844371,0.0011625681,0.0008823506],"about_ca_topic_score_codex":0.000086826636,"about_ca_topic_score_gemma":0.0049256305,"teacher_disagreement_score":0.9698087,"about_ca_system_score_codex":0.0003208801,"about_ca_system_score_gemma":0.00014968238,"threshold_uncertainty_score":0.99957407},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046233344,0.00005821311,0.98312646,0.00032013,0.005548625,0.0013763197,0.000005302853,0.00016862196,0.004772975],"genre_scores_gemma":[0.994145,0.000007030068,0.0008939756,0.0036438385,0.000264178,0.000167272,0.00007633172,0.000061443105,0.0007409754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996339,0.00034807407,0.0007275033,0.0011133284,0.0005523632,0.0009197137],"domain_scores_gemma":[0.99743026,0.00057082286,0.00046859554,0.0011720934,0.00015468302,0.0002035245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007393304,0.00060995057,0.0009312783,0.00035650947,0.00013372044,0.00018862182,0.0013444227,0.0012648265,0.00026304342],"category_scores_gemma":[0.000029655548,0.00056862575,0.00021087217,0.00038002673,0.000053033793,0.00019093577,0.000048047863,0.0015274445,0.000022222956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014337649,0.0014102827,0.0009104447,0.00009920214,0.00031047864,0.0005508542,0.0009369105,0.8848237,0.0013603223,0.08409618,0.003499993,0.020567873],"study_design_scores_gemma":[0.0028412475,0.00022272287,0.0008248006,0.00014083921,0.000028895003,0.000003846733,0.0000426366,0.99485624,0.000098050994,0.0002707937,0.000110063076,0.0005598465],"about_ca_topic_score_codex":0.0002227729,"about_ca_topic_score_gemma":0.0014869052,"teacher_disagreement_score":0.9895216,"about_ca_system_score_codex":0.0002295085,"about_ca_system_score_gemma":0.0002908115,"threshold_uncertainty_score":0.9996765},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070787314,0.00458173,0.91425115,0.000050393042,0.0020240261,0.0015719036,0.0000033738265,0.0011352608,0.075674295],"genre_scores_gemma":[0.016112449,0.00883809,0.35162377,0.0010020483,0.000834788,0.004429975,0.00078043307,0.00035932902,0.6160191],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683744,0.00005861902,0.00046747594,0.0012324076,0.0006480084,0.0007560263],"domain_scores_gemma":[0.99739325,0.00012555254,0.00033846466,0.0017850049,0.00015616631,0.00020156453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021798293,0.00060186174,0.0005093989,0.0001936262,0.00019351189,0.00031043563,0.0019655556,0.00038561056,0.00043880445],"category_scores_gemma":[0.000004781361,0.00041303024,0.00015304708,0.00055144285,0.000037259655,0.00038924228,0.00024195533,0.0003703995,0.000320752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001058977,0.00008547101,0.00006126755,0.00010727158,0.0002079394,0.00011769282,0.00014437175,0.0019723529,0.0000016521025,0.010384186,0.018446483,0.96836543],"study_design_scores_gemma":[0.007139308,0.0030926468,0.007663389,0.003935871,0.0006182499,0.000093391696,0.00060887804,0.059916776,0.00034382925,0.0063521224,0.90271205,0.0075234915],"about_ca_topic_score_codex":0.0000047638378,"about_ca_topic_score_gemma":0.0001755071,"teacher_disagreement_score":0.9608419,"about_ca_system_score_codex":0.00012534294,"about_ca_system_score_gemma":0.00009278577,"threshold_uncertainty_score":0.99983215},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1167314e-8,0.00032044115,0.5029472,0.00007295735,0.00047750847,0.00011989171,5.194686e-7,0.00025768427,0.49580374],"genre_scores_gemma":[0.0011021687,0.00022886292,0.0124544045,0.0012472451,0.0007294753,0.000013522695,0.000020430538,0.000059808426,0.9841441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981391,0.000010493664,0.00038259628,0.0007263696,0.00032425922,0.0004172084],"domain_scores_gemma":[0.9979972,0.00008430803,0.00016405086,0.0015108627,0.00006511845,0.00017841569],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023311307,0.0003861432,0.00045295293,0.00007278784,0.0000728846,0.00012992223,0.0015570474,0.00051442307,0.001554832],"category_scores_gemma":[0.0000013403522,0.00035424018,0.00021454133,0.000041275387,0.00004951221,0.00012874973,0.0001574755,0.00053560664,0.0006157846],"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":[8.9544324e-7,0.0000024063147,0.0000015902797,0.0000066237017,0.00002268485,0.000021657053,0.000006441096,0.0026924242,1.1378321e-7,0.89631927,0.04628185,0.05464406],"study_design_scores_gemma":[0.00009977549,0.00003962899,0.0000040242717,0.000060412796,0.000015593274,0.000011098623,8.3641844e-8,0.13433957,0.0000016659703,0.02472524,0.8402956,0.0004072701],"about_ca_topic_score_codex":0.000009928373,"about_ca_topic_score_gemma":0.000054148048,"teacher_disagreement_score":0.871594,"about_ca_system_score_codex":0.000036089194,"about_ca_system_score_gemma":0.00005243892,"threshold_uncertainty_score":0.999891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04933813,0.0005166032,0.9489663,0.0000039023416,0.00014766789,0.00070078427,0.000004507602,0.00005965071,0.00026245846],"genre_scores_gemma":[0.088526666,0.000028352266,0.90899205,0.000019134399,0.000040594965,0.00023473731,0.00073082856,0.0000127052535,0.0014149237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834794,0.000027175302,0.00059420004,0.00055608776,0.00028692654,0.0001876778],"domain_scores_gemma":[0.9986956,0.00015034057,0.00027386582,0.00041483474,0.000399092,0.00006625865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076703023,0.00019826379,0.00046992212,0.00024791746,0.00010110646,0.00006629538,0.00032604852,0.00022891922,0.00001075588],"category_scores_gemma":[0.000033188586,0.00018169469,0.00014272766,0.00064655824,0.000011753296,0.0002339083,0.00003486453,0.00008923899,3.9328052e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002352431,0.00023109237,0.00008984284,0.00042978657,0.0011639033,0.0000010608551,0.00902971,0.057199724,0.0006181781,0.008052412,0.00043564467,0.9225134],"study_design_scores_gemma":[0.000620085,0.000020140675,0.00067071966,0.000015489937,0.00021077097,2.8304152e-7,0.00006908819,0.99312896,0.0041895257,0.00065438077,0.00019403172,0.00022654497],"about_ca_topic_score_codex":0.000017104641,"about_ca_topic_score_gemma":0.0028539482,"teacher_disagreement_score":0.93592924,"about_ca_system_score_codex":0.00005055836,"about_ca_system_score_gemma":0.00021104823,"threshold_uncertainty_score":0.7409294},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007859325,0.0006032042,0.85851085,0.000016205258,0.00064597983,0.12525211,0.0000031426066,0.00047256262,0.014488076],"genre_scores_gemma":[0.0013133275,0.00014671484,0.08179073,0.0002696,0.0007464414,0.88411653,0.00024298039,0.00011529182,0.031258404],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99642915,0.000084663465,0.0008384454,0.0012811515,0.00053901307,0.00082755485],"domain_scores_gemma":[0.99725616,0.00026162426,0.0005816421,0.0014021463,0.00030393488,0.00019446398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004807419,0.00064852164,0.0006036369,0.0002525357,0.00024493932,0.0004104318,0.002271082,0.001067632,0.00024047423],"category_scores_gemma":[0.000022367718,0.00061562186,0.00032527186,0.00047904378,0.000024134513,0.0005135844,0.0002611217,0.0006006854,0.000014137052],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016525731,0.00030282946,0.00000805019,0.00033921524,0.0001074958,0.0000138680325,0.00038397865,0.014094137,0.0005044415,0.02871148,0.027688151,0.9276811],"study_design_scores_gemma":[0.0010068195,0.0007586888,0.000059056736,0.0006268482,0.000034032426,0.000023379831,0.00015629349,0.11705753,0.0061311824,0.0017115487,0.87091166,0.0015229394],"about_ca_topic_score_codex":0.000017976008,"about_ca_topic_score_gemma":0.0021118475,"teacher_disagreement_score":0.92615813,"about_ca_system_score_codex":0.0002701562,"about_ca_system_score_gemma":0.00033382702,"threshold_uncertainty_score":0.9996295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012858555,0.009037975,0.95095634,0.00009151223,0.00064039405,0.00042870434,1.03608166e-7,0.00022724296,0.025759166],"genre_scores_gemma":[0.9469922,0.0016635624,0.047949385,0.0008522704,0.00006680232,0.0001966056,0.0000025038037,0.000016378834,0.0022602647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987867,0.000104031766,0.00022830963,0.00036853857,0.00016794426,0.00034446112],"domain_scores_gemma":[0.99916273,0.00009153357,0.000053150536,0.0005794877,0.000033577075,0.00007953175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003634883,0.000119149045,0.00013061914,0.000069774265,0.000044773973,0.0000921832,0.00046474478,0.000093678784,0.00014576],"category_scores_gemma":[0.000018833205,0.00011140084,0.000039988267,0.00065249385,0.00002132813,0.0004154632,0.00008348283,0.00016574007,0.000090972055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031128636,0.00009194682,0.0019609001,0.0000034161112,0.000005845592,0.00002568216,0.00021355494,0.0608323,0.000016242548,0.06339745,0.0057208315,0.8677287],"study_design_scores_gemma":[0.0006320151,0.00012901657,0.0019196849,0.000036280253,0.0000021503397,0.000024974268,0.00003087524,0.7298331,0.00046668973,0.0039708572,0.26259485,0.00035950466],"about_ca_topic_score_codex":0.0000038599405,"about_ca_topic_score_gemma":0.00011873641,"teacher_disagreement_score":0.93413365,"about_ca_system_score_codex":0.00005766022,"about_ca_system_score_gemma":0.00003803475,"threshold_uncertainty_score":0.45427945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5377593,0.0028927913,0.45815164,0.00020355496,0.00007111482,0.00041481457,0.0000012139832,0.0001589989,0.0003465771],"genre_scores_gemma":[0.97985595,0.00046180587,0.019324187,0.00014457844,0.00007838249,0.00008066958,0.000018059502,0.000026241465,0.0000101092855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997789,0.00031093703,0.0006108308,0.00060330075,0.00014479106,0.0005410972],"domain_scores_gemma":[0.99704075,0.0012260355,0.00027490823,0.0012485143,0.00008480069,0.00012497077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009331596,0.00028202587,0.00040984823,0.00013656725,0.0007340736,0.0004401796,0.00088966487,0.00012420602,0.0000011104942],"category_scores_gemma":[0.000016705999,0.0003076986,0.000037667764,0.00049383927,0.00032214902,0.0003046616,0.0018977078,0.000525152,6.726264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004504564,0.00016144363,0.08364216,0.000054316257,0.000013048809,0.0000113985,0.0006310416,0.020591917,0.00016144218,0.054642748,0.000027913517,0.8400581],"study_design_scores_gemma":[0.0006197505,0.00004863631,0.018577175,0.0002529984,0.000008348317,0.000029952469,0.000116942436,0.979499,0.000022379048,0.00018735862,0.0003172741,0.0003201787],"about_ca_topic_score_codex":0.0007591742,"about_ca_topic_score_gemma":0.0004060897,"teacher_disagreement_score":0.95890707,"about_ca_system_score_codex":0.000049563376,"about_ca_system_score_gemma":0.000045347082,"threshold_uncertainty_score":0.99993753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005729093,0.00047928398,0.9919487,0.00027765144,0.0002816639,0.0005523323,7.5727326e-7,0.00012153196,0.000608972],"genre_scores_gemma":[0.820553,0.00022145896,0.17804714,0.0007652073,0.00029502317,0.000042177322,0.000010762318,0.000012768225,0.000052469128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986473,0.00004087725,0.00028723167,0.0004283116,0.00014141551,0.00045488524],"domain_scores_gemma":[0.99930394,0.0001301372,0.000081037266,0.00035633962,0.00004703954,0.00008150593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034561637,0.00017536666,0.00021849772,0.000085235435,0.00010118092,0.00013210141,0.00037215225,0.00015049336,0.0000075564926],"category_scores_gemma":[0.000015701964,0.0001706353,0.000036730322,0.000353446,0.000031464515,0.00039359412,0.00007121891,0.00019676914,0.0000030194653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002735575,0.000042461455,0.00044853135,0.0000049917976,0.0000038238754,0.0000046289706,0.00010586503,0.67176276,0.0000023365535,0.0005037007,0.00048332682,0.32661024],"study_design_scores_gemma":[0.0008855882,0.00028211472,0.004481792,0.000055683056,0.000004522344,0.000017126342,0.0000045507622,0.9933229,0.000012686755,0.000075636286,0.000662093,0.00019529006],"about_ca_topic_score_codex":0.00000646458,"about_ca_topic_score_gemma":0.0000051962043,"teacher_disagreement_score":0.8148239,"about_ca_system_score_codex":0.000050685812,"about_ca_system_score_gemma":0.000020531254,"threshold_uncertainty_score":0.6958306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010823491,0.000008849141,0.96032435,0.00039319447,0.00010553225,0.009428483,1.8575403e-7,0.00034659286,0.029382007],"genre_scores_gemma":[0.028536972,0.000003093766,0.82835114,0.0032116852,0.0010515557,0.12676407,0.0000011633279,0.000028315515,0.012051975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861,0.0000427231,0.00024014169,0.00039745553,0.00035372688,0.0003559373],"domain_scores_gemma":[0.99906874,0.000045999102,0.00006577192,0.0006472302,0.00005130571,0.00012094262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020191952,0.00013840816,0.00012158618,0.000060200447,0.000088534565,0.00019339562,0.0009697861,0.00007402361,0.0003111802],"category_scores_gemma":[0.0000057405073,0.00011786823,0.000052159055,0.00025381788,0.000020344727,0.0006013843,0.00046979552,0.000121439625,0.00015176812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.281872e-7,0.000054086573,0.000028563798,0.0000021962783,0.0000063077914,0.00000857437,0.000082793464,0.00078646006,0.000040659335,0.05496534,0.005880349,0.93814373],"study_design_scores_gemma":[0.00035054778,0.000049976978,0.0001613207,0.000011062055,9.826045e-7,0.000023401239,0.0000072088965,0.5546351,0.0017192008,0.0012640464,0.44158858,0.0001885682],"about_ca_topic_score_codex":0.00006832722,"about_ca_topic_score_gemma":0.00012419766,"teacher_disagreement_score":0.9379552,"about_ca_system_score_codex":0.00008251272,"about_ca_system_score_gemma":0.00006165864,"threshold_uncertainty_score":0.4806527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32792556,0.005089348,0.4961905,0.00031955735,0.019340886,0.012045803,0.00012554125,0.0018373965,0.13712542],"genre_scores_gemma":[0.95759904,0.000029111101,0.031621736,0.00022250447,0.0009411456,0.0009772157,0.00093927025,0.00007419664,0.0075957826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980785,0.000046673114,0.0003805732,0.0006561394,0.00027982306,0.00055824086],"domain_scores_gemma":[0.9986641,0.00021815371,0.00023128044,0.0006224441,0.00014526681,0.000118756674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002778026,0.00032557145,0.00036540942,0.00016886667,0.00007478576,0.00011056954,0.00093826454,0.00033870252,0.00009822934],"category_scores_gemma":[0.000034229077,0.000326729,0.00012038519,0.00029338716,0.000011244802,0.0005646527,0.00011724336,0.00039320512,0.00005050456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004717601,0.0018178022,0.010292767,0.0039961245,0.000572223,0.00019290634,0.04091667,0.00074156304,0.0010619697,0.4100001,0.092960626,0.4369755],"study_design_scores_gemma":[0.004241073,0.00057655317,0.06019686,0.0026219422,0.00013314084,0.000031101434,0.0049683587,0.83616555,0.009286158,0.02123018,0.05540241,0.0051466725],"about_ca_topic_score_codex":0.00020326274,"about_ca_topic_score_gemma":0.0043145427,"teacher_disagreement_score":0.835424,"about_ca_system_score_codex":0.00012910398,"about_ca_system_score_gemma":0.00012669887,"threshold_uncertainty_score":0.99991846},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.6578053e-7,0.0011506543,0.5252523,0.000046849935,0.0014190313,0.0003122122,0.0000053388785,0.0005324019,0.47128054],"genre_scores_gemma":[0.1039207,0.00081630197,0.006428647,0.00031608742,0.003276456,0.000114272305,0.000053560583,0.00028229406,0.8847917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650466,0.000032128475,0.0006427835,0.0013480636,0.0006535614,0.0008187795],"domain_scores_gemma":[0.993991,0.00010294487,0.000888847,0.0045053624,0.00017897152,0.0003328856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040034545,0.0007964105,0.0009918599,0.000121632846,0.0005072207,0.00067551393,0.0047079166,0.00128048,0.000025492742],"category_scores_gemma":[0.0000036469326,0.0008046304,0.00039531017,0.000027840204,0.00017275543,0.00042184922,0.0014517972,0.0013525079,0.0003393545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004925309,0.000005986628,9.596059e-7,0.000052230742,0.0000678424,0.00015318587,0.000025264282,0.11958776,2.621313e-7,0.78549004,0.018304069,0.076307505],"study_design_scores_gemma":[0.00022613854,0.000026370306,0.0000013232158,0.00097414484,0.0000425047,0.000055119763,7.273099e-7,0.94378525,8.568136e-7,0.0073005585,0.04681638,0.000770628],"about_ca_topic_score_codex":0.000010272969,"about_ca_topic_score_gemma":0.0000320379,"teacher_disagreement_score":0.8241975,"about_ca_system_score_codex":0.0002746386,"about_ca_system_score_gemma":0.0002083389,"threshold_uncertainty_score":0.99944043},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012448459,0.000135433,0.9480993,0.000011951131,0.000093006616,0.050200164,0.0000027474357,0.000060820912,0.00015169547],"genre_scores_gemma":[0.38577902,0.00032668965,0.2371536,0.00028185642,0.00038530465,0.36944354,0.00030014466,0.00017509604,0.0061547467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788135,0.00015898072,0.00062378065,0.0007647049,0.00022396173,0.00034723923],"domain_scores_gemma":[0.9979338,0.0006088439,0.0005601607,0.00048008337,0.00027482532,0.00014226427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008405898,0.00032036443,0.0008052696,0.0002697368,0.00012326542,0.00019149727,0.00051368546,0.00031323484,0.000015125002],"category_scores_gemma":[0.000023072622,0.00023424395,0.00013911127,0.00044857114,0.00003991922,0.0002746281,0.00008085663,0.0001407425,3.4872602e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005071749,0.000065126835,0.00010325696,0.00010652492,0.00090439076,0.0000017351099,0.00061933126,0.0056262137,0.00014290017,0.0058353753,0.00008555191,0.98600245],"study_design_scores_gemma":[0.0008390935,0.00032356568,0.00047831298,0.0001406566,0.00033720434,8.2804485e-7,0.000057367404,0.9962687,0.00057895,0.0005395047,0.00014132503,0.00029450454],"about_ca_topic_score_codex":0.000012787492,"about_ca_topic_score_gemma":0.00012622759,"teacher_disagreement_score":0.9906425,"about_ca_system_score_codex":0.000030397485,"about_ca_system_score_gemma":0.00006812836,"threshold_uncertainty_score":0.9552191},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33596164,0.00019694558,0.6296568,0.012830486,0.002617755,0.0009540938,0.0000071325694,0.00023359362,0.017541565],"genre_scores_gemma":[0.9882422,0.00031723626,0.0106518315,0.00033163629,0.00019473504,0.00007720865,0.000004560382,0.00001413567,0.00016645704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985715,0.00003036989,0.00048230932,0.00035879583,0.00027919104,0.0002777939],"domain_scores_gemma":[0.9978312,0.00009475067,0.00041292008,0.00044106704,0.001162292,0.0000577433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047544466,0.00019102413,0.00022825014,0.00015259536,0.00030938972,0.00025009306,0.0018934017,0.000104030725,0.00003068617],"category_scores_gemma":[0.00011208571,0.00015686682,0.00005597122,0.0008416549,0.0002620899,0.00061345793,0.0010904648,0.00037581276,0.0000062881677],"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.000056953704,0.00029404793,0.009605067,0.000014133649,0.000065440276,2.6528207e-7,0.0005671903,0.007108712,0.001024423,0.92974365,0.0008525138,0.05066758],"study_design_scores_gemma":[0.0005031495,0.00007635543,0.10552937,0.00044837905,0.000010059202,0.0000096998765,0.0001150414,0.8883333,0.0001802484,0.0038891314,0.00070087065,0.00020436819],"about_ca_topic_score_codex":0.00007914943,"about_ca_topic_score_gemma":0.00013086574,"teacher_disagreement_score":0.92585456,"about_ca_system_score_codex":0.00006978561,"about_ca_system_score_gemma":0.00006365297,"threshold_uncertainty_score":0.6396843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7739763,0.0011366102,0.21243246,0.00007430715,0.002353398,0.0010727732,6.0418444e-7,0.0002604396,0.008693084],"genre_scores_gemma":[0.98973924,0.0006670398,0.0081062075,0.00022130426,0.00015760312,0.00015287974,0.000006315774,0.00002234036,0.0009270435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972211,0.00017651914,0.0005564283,0.0010670092,0.0005936099,0.00038530127],"domain_scores_gemma":[0.9964027,0.00013067696,0.00031732486,0.0028517174,0.00018747208,0.00011014258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042589646,0.00035395226,0.0005846778,0.000111060566,0.000067882494,0.0002053757,0.0023595572,0.00027482043,0.00009495849],"category_scores_gemma":[0.000012396936,0.0003193549,0.00014300963,0.00043316142,0.000030990617,0.00015823184,0.004273613,0.0010184454,0.00001684452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023711496,0.0012312831,0.0022461882,0.00009116261,0.00014985482,0.00005603635,0.0019931553,0.7292905,0.0000032283483,0.0005268962,0.002114723,0.26227328],"study_design_scores_gemma":[0.00042993177,0.00080073875,0.013235945,0.00027419082,0.000019634457,0.000004752742,0.0001774389,0.9841752,0.000042080857,0.000030989213,0.0004243631,0.0003847457],"about_ca_topic_score_codex":0.000023568655,"about_ca_topic_score_gemma":0.000084505125,"teacher_disagreement_score":0.26188853,"about_ca_system_score_codex":0.000066680805,"about_ca_system_score_gemma":0.00015027048,"threshold_uncertainty_score":0.99992585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5298644,0.00093010097,0.02766564,0.0016624551,0.028934907,0.004062302,0.00004419261,0.00019073585,0.40664527],"genre_scores_gemma":[0.8987839,0.0022330335,0.0072842008,0.00052672625,0.0027300688,0.00027803707,0.000090149806,0.000098712466,0.08797516],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591196,0.000091850845,0.0007689353,0.0007961252,0.0020307107,0.00040041254],"domain_scores_gemma":[0.9948918,0.00015053581,0.0012094623,0.001360404,0.0023148772,0.000072904564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014859987,0.00041700897,0.000503583,0.00012998031,0.000113135546,0.0001344311,0.0048088576,0.00047624696,0.00054262124],"category_scores_gemma":[0.000068212925,0.00030036765,0.00020165989,0.0005964972,0.0002199221,0.0003661109,0.0014517469,0.00059107126,0.0003075052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017970262,0.00039327514,0.0003622283,0.00032341003,0.00041243102,3.067329e-7,0.0014309391,0.096687034,0.0014869346,0.0026231895,0.78773594,0.108364604],"study_design_scores_gemma":[0.00068402773,0.0003161286,0.0006922272,0.0011254962,0.00008836497,0.000015811058,0.000021719557,0.94664127,0.0054029976,0.00007733025,0.044444356,0.0004902622],"about_ca_topic_score_codex":0.000012806435,"about_ca_topic_score_gemma":0.000019076888,"teacher_disagreement_score":0.84995425,"about_ca_system_score_codex":0.00026837937,"about_ca_system_score_gemma":0.00026464657,"threshold_uncertainty_score":0.99994487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002249044,0.00057808,0.9918157,0.0004289702,0.0017120439,0.00093899743,0.0000016960553,0.00085606624,0.0014194396],"genre_scores_gemma":[0.74332756,0.0003960409,0.25015548,0.0007684036,0.00055921305,0.0006465948,0.00005521495,0.00008753617,0.004003975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619424,0.00018452053,0.00049792655,0.00175196,0.00058552984,0.0007857941],"domain_scores_gemma":[0.996265,0.00012174395,0.00032161135,0.0026555466,0.0003755099,0.0002606091],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037076406,0.0006501224,0.00074998493,0.00010608035,0.00015222216,0.0011374957,0.0027093447,0.000586718,0.000065845146],"category_scores_gemma":[0.000011419646,0.00052535464,0.00020139165,0.00048873114,0.00012256127,0.00037318925,0.0053620157,0.0014387117,0.0000191517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034115907,0.0006724758,0.0006097894,0.00039146005,0.000651827,0.0008679434,0.0025609573,0.929419,0.00002250688,0.017568028,0.009630209,0.03757172],"study_design_scores_gemma":[0.0003934385,0.00005351146,0.0004592805,0.00041870584,0.000024294857,0.00004622299,0.000087375745,0.9972368,0.0001786993,0.00015247388,0.00020023236,0.0007489922],"about_ca_topic_score_codex":0.00019002048,"about_ca_topic_score_gemma":0.00062807574,"teacher_disagreement_score":0.7416602,"about_ca_system_score_codex":0.000100999176,"about_ca_system_score_gemma":0.00040365674,"threshold_uncertainty_score":0.99989945},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3225385e-7,0.00036633783,0.47357637,0.00004895109,0.0006430564,0.00013714397,0.000001010854,0.00027098137,0.524956],"genre_scores_gemma":[0.000309769,0.00024945685,0.016553162,0.00087571034,0.0011588944,0.000011987717,0.000019199597,0.0000577891,0.98076403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99810106,0.0000075605944,0.00036876948,0.0007631117,0.00032615216,0.00043336523],"domain_scores_gemma":[0.9980048,0.00005250053,0.00015410967,0.0015144225,0.00010197939,0.0001721915],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019348405,0.00038070235,0.00038778066,0.000074366195,0.000084304695,0.00013979638,0.001619209,0.00052563037,0.007984064],"category_scores_gemma":[0.0000011402341,0.00034793545,0.00019476633,0.00005232374,0.00009259939,0.00024296145,0.00019482445,0.0004351246,0.0013737233],"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.0000016182964,0.0000048645347,0.0000014719997,0.0000055427427,0.00003499296,0.000041495496,0.000024113826,0.00036517263,1.6008096e-7,0.8249816,0.15718652,0.017352467],"study_design_scores_gemma":[0.00009962,0.00006834765,0.00000364127,0.00007190823,0.000017579889,0.000014681999,2.8437162e-7,0.06235222,0.0000039385536,0.04742683,0.889495,0.00044591888],"about_ca_topic_score_codex":0.000008092906,"about_ca_topic_score_gemma":0.00007363744,"teacher_disagreement_score":0.77755475,"about_ca_system_score_codex":0.00004279695,"about_ca_system_score_gemma":0.000075092576,"threshold_uncertainty_score":0.99989724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027289155,0.0030356762,0.9896163,0.00009348436,0.0022211806,0.0010414284,0.000018616294,0.0009250109,0.00031942848],"genre_scores_gemma":[0.5718036,0.0002303008,0.4226458,0.00115682,0.00085916865,0.0021940703,0.0005697425,0.00010243008,0.00043800296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496603,0.00025601918,0.0008119294,0.0023762735,0.0004947635,0.0010949548],"domain_scores_gemma":[0.99462354,0.0004095266,0.00046697198,0.0035988453,0.0004795112,0.00042158476],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073830195,0.0007427855,0.0008449368,0.0001401123,0.00029825963,0.0012257226,0.0032720151,0.0009190147,0.00014473009],"category_scores_gemma":[0.000034693698,0.00075950334,0.00052361,0.00044115863,0.000059041264,0.00047144282,0.0023872189,0.0008940946,0.0000035608505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019376106,0.0002490569,0.00023898156,0.00008613999,0.000069819565,0.00004312765,0.00017557126,0.687431,0.000048807764,0.0020935081,0.0012714803,0.30827314],"study_design_scores_gemma":[0.0006699047,0.00017140638,0.00005844862,0.0002407212,0.000023145965,0.0000049298037,0.00009242473,0.98824793,0.00045761792,0.00014474336,0.009008338,0.0008803878],"about_ca_topic_score_codex":0.00009571057,"about_ca_topic_score_gemma":0.00035488093,"teacher_disagreement_score":0.56907475,"about_ca_system_score_codex":0.00022388592,"about_ca_system_score_gemma":0.000649878,"threshold_uncertainty_score":0.9998111},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029670383,0.0014266131,0.034336463,0.0000034151913,0.00043189863,0.014679521,0.0000065008617,0.00014385076,0.94867504],"genre_scores_gemma":[0.830085,0.0005871632,0.027935363,0.00069347816,0.000938286,0.04157782,0.000012552131,0.00026290125,0.097907424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967307,0.00004102242,0.0010429677,0.00090666173,0.0005548803,0.00072380004],"domain_scores_gemma":[0.9973744,0.000040707175,0.0007778652,0.0014997358,0.00015054828,0.00015672541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004455659,0.0005847242,0.00080141594,0.00009117561,0.000070753136,0.000075510434,0.0018799307,0.00053153624,0.000053744876],"category_scores_gemma":[0.000004989572,0.0005949291,0.00020720309,0.00007350299,0.0001273206,0.00017167968,0.00096960604,0.0005924311,0.00006782422],"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.00005876845,0.000045962657,0.000121203906,0.00011288868,0.000047871876,0.000039183196,0.00020931031,0.0005719573,0.000008184303,0.56873184,0.0003323705,0.42972043],"study_design_scores_gemma":[0.0075910245,0.0097214915,0.0010046908,0.026794363,0.00021521907,0.0002411838,0.00002921388,0.22694345,0.0030398443,0.2734905,0.4420892,0.008839851],"about_ca_topic_score_codex":0.000011680608,"about_ca_topic_score_gemma":0.000053410182,"teacher_disagreement_score":0.8507676,"about_ca_system_score_codex":0.00036410554,"about_ca_system_score_gemma":0.0002658293,"threshold_uncertainty_score":0.99965024},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.540119e-8,0.00032929785,0.45844853,0.00005682543,0.0007816483,0.0001296226,5.0199304e-7,0.0002731892,0.53998035],"genre_scores_gemma":[0.00012015812,0.00017895023,0.021741064,0.0013775147,0.0015267045,0.000010999748,0.000008074828,0.000053690048,0.97498286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981497,0.0000104673645,0.00031714095,0.00076142064,0.0003302914,0.00043101382],"domain_scores_gemma":[0.99770385,0.00007815412,0.00017109796,0.0017596146,0.00012232334,0.0001649886],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002033991,0.00036866625,0.00035124723,0.000079212376,0.00009036198,0.0002237107,0.0018021665,0.00051831617,0.005838043],"category_scores_gemma":[0.0000035307728,0.00033415318,0.00016086697,0.000051420084,0.00009206047,0.00023974161,0.00088859285,0.00043489263,0.0031678798],"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":[9.160398e-7,0.0000032833052,5.9161823e-7,0.0000029499215,0.000024501625,0.000019187373,0.000010561858,0.00033963108,1.2804448e-7,0.73207057,0.25078815,0.016739523],"study_design_scores_gemma":[0.00007303911,0.000059121714,0.0000016419408,0.00005469161,0.000008277425,0.0000152046805,2.2642108e-7,0.17877376,0.0000031548611,0.09204734,0.7285922,0.0003713051],"about_ca_topic_score_codex":0.0000066960533,"about_ca_topic_score_gemma":0.000022105629,"teacher_disagreement_score":0.64002323,"about_ca_system_score_codex":0.00006428179,"about_ca_system_score_gemma":0.00006869235,"threshold_uncertainty_score":0.99991107},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016298126,0.020602796,0.9252189,0.00033675777,0.0047712675,0.00255924,0.000011830768,0.00096343947,0.029237667],"genre_scores_gemma":[0.7091076,0.011318414,0.24445458,0.0036503756,0.0024296134,0.0037194975,0.000393267,0.0002762881,0.024650404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518394,0.0004805674,0.0007381921,0.0020619899,0.0006886104,0.0008467167],"domain_scores_gemma":[0.99534804,0.00039071622,0.00053710816,0.0029509475,0.0005109219,0.00026224973],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071459083,0.00068357063,0.00080354034,0.00013138182,0.00021816771,0.0013756115,0.0026026515,0.00072532165,0.0003146516],"category_scores_gemma":[0.00004935026,0.000675566,0.00032533138,0.0010056199,0.00008344707,0.00036947537,0.0057840357,0.0018304529,0.00011061359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015610132,0.00030501306,0.00008773615,0.00008425273,0.0002089628,0.00016969188,0.001274693,0.75823396,0.000014495031,0.002862144,0.027907291,0.20883615],"study_design_scores_gemma":[0.0005705806,0.00037183467,0.00027046193,0.0010278147,0.000047983383,0.000012790968,0.0003328825,0.9353507,0.00067325716,0.0009508072,0.058963187,0.0014276583],"about_ca_topic_score_codex":0.0000064884157,"about_ca_topic_score_gemma":0.00009643414,"teacher_disagreement_score":0.6928094,"about_ca_system_score_codex":0.00024315187,"about_ca_system_score_gemma":0.00057185604,"threshold_uncertainty_score":0.999661},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009366515,0.00006209886,0.9687222,0.0019797024,0.00043299902,0.011306636,0.00004327492,0.00026508313,0.007821487],"genre_scores_gemma":[0.9888372,0.000020607253,0.006809115,0.00028704636,0.00005437145,0.003943579,0.000023159208,0.000012714868,0.00001223221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625087,0.0012299658,0.0010129644,0.00056191353,0.0004198009,0.0005244738],"domain_scores_gemma":[0.99292296,0.0006331974,0.00067041424,0.00469362,0.0008741754,0.00020565795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013924324,0.00030255018,0.00052903127,0.00007446389,0.00032577437,0.00029527667,0.0053380723,0.00016855997,0.0000036698727],"category_scores_gemma":[0.0001315141,0.00026817207,0.00009822115,0.0011578337,0.00025312536,0.00038252442,0.0015200723,0.00047983232,0.0000286308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029822157,0.00019994254,0.0023615535,0.000098610544,0.000033315144,0.0000026974174,0.0007587559,0.0067801974,0.0001228084,0.9346971,0.001186924,0.053728297],"study_design_scores_gemma":[0.00045174174,0.00012626467,0.0031966972,0.00043920256,0.000013165213,0.000016030359,0.00035936592,0.9908639,0.000025862186,0.0024191118,0.0018113344,0.00027730755],"about_ca_topic_score_codex":0.000893841,"about_ca_topic_score_gemma":0.0009896039,"teacher_disagreement_score":0.9840837,"about_ca_system_score_codex":0.00035954328,"about_ca_system_score_gemma":0.00033303496,"threshold_uncertainty_score":0.99997705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007425005,0.00028373758,0.8506214,0.0005379044,0.00045824135,0.0004424269,0.00001900718,0.00019975341,0.14669505],"genre_scores_gemma":[0.95973927,0.0000853538,0.014479902,0.0007805185,0.00020845201,0.000024478346,0.00010396051,0.00007004192,0.024508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969494,0.000057514662,0.0008803504,0.0011213762,0.0005917802,0.00039960074],"domain_scores_gemma":[0.99739003,0.0003588076,0.0005346826,0.0012949476,0.00021122936,0.00021028057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029598686,0.00053637044,0.0013981026,0.00070277834,0.000038317525,0.00007308396,0.0016806525,0.00058101286,0.0005046428],"category_scores_gemma":[0.000014025954,0.00050413323,0.0005016552,0.0010167487,0.00017089238,0.00019556003,0.0010873682,0.0010344603,0.000033414388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030928477,0.000044293363,0.0007854439,0.000023966277,0.0012790825,0.00007367217,0.00009672111,0.08782598,0.000011673512,0.8965547,0.0015062529,0.011767309],"study_design_scores_gemma":[0.00019144725,0.00008966435,0.0009428176,0.00018396729,0.00028120851,0.0000027794392,0.0000011947963,0.98991334,0.000016557828,0.0073022605,0.0005940402,0.00048074475],"about_ca_topic_score_codex":0.00030520867,"about_ca_topic_score_gemma":0.0059726182,"teacher_disagreement_score":0.9589968,"about_ca_system_score_codex":0.00013106488,"about_ca_system_score_gemma":0.00011616792,"threshold_uncertainty_score":0.999741},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020499264,0.000007404696,0.79569864,0.00014842773,0.00085510727,0.19889489,0.0000021772635,0.0005943291,0.0035940576],"genre_scores_gemma":[0.20700477,0.000003717179,0.06100072,0.0004562663,0.00095579773,0.7300728,0.000030531148,0.000056230463,0.00041918326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550277,0.00023136206,0.0008575901,0.0019501591,0.00048117046,0.0009769608],"domain_scores_gemma":[0.995914,0.00036496346,0.00058099185,0.0024250022,0.00048259835,0.0002324424],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096127635,0.00061688403,0.000830848,0.00007116743,0.00022312603,0.0012493427,0.0028660304,0.0007786274,0.00009965812],"category_scores_gemma":[0.00006023211,0.000602111,0.0004667544,0.00039554248,0.000053648277,0.00034591072,0.005647056,0.0013085653,0.0000065032273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022577937,0.0013713292,0.00021702469,0.00372835,0.0008115363,0.0001553437,0.007037935,0.16192661,0.00038442406,0.4312531,0.03373911,0.35914946],"study_design_scores_gemma":[0.00078606326,0.00006085926,0.000021240981,0.00065190747,0.000013181313,0.000006142176,0.000033238488,0.9897024,0.002494504,0.0043881484,0.0011291465,0.0007131865],"about_ca_topic_score_codex":0.000082711034,"about_ca_topic_score_gemma":0.00020985314,"teacher_disagreement_score":0.8277758,"about_ca_system_score_codex":0.00018866909,"about_ca_system_score_gemma":0.0005549146,"threshold_uncertainty_score":0.99978745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01767639,0.00023184813,0.9705524,0.0004740225,0.0033183747,0.0005401897,0.0000020730465,0.0003692686,0.0068354355],"genre_scores_gemma":[0.96014017,0.00017552181,0.037921507,0.00048386081,0.0004255083,0.00018674076,0.000033859797,0.000029860694,0.00060295453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648076,0.00027559846,0.00066821283,0.0014497121,0.00036493895,0.0007607624],"domain_scores_gemma":[0.9970137,0.00022505198,0.00019469434,0.0022280784,0.00015513466,0.0001833721],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00045150332,0.00046112755,0.0006973143,0.00011519565,0.000054513355,0.0007409265,0.0030815012,0.00052367017,0.00033323752],"category_scores_gemma":[0.000019472733,0.00045403,0.00018875144,0.0005046895,0.000060523773,0.00025968818,0.008852773,0.0015916643,0.00007842577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004069697,0.0009177244,0.019494634,0.0006967368,0.00035969872,0.0025434236,0.0052587325,0.21114758,0.000052937175,0.22578612,0.03217013,0.5015316],"study_design_scores_gemma":[0.0002316743,0.000024149265,0.0019782267,0.0007873825,0.0000069182784,0.000014806661,0.00006863931,0.9940256,0.00007294548,0.0019982618,0.0002173252,0.00057410233],"about_ca_topic_score_codex":0.00032530393,"about_ca_topic_score_gemma":0.0020469064,"teacher_disagreement_score":0.9424638,"about_ca_system_score_codex":0.00018121586,"about_ca_system_score_gemma":0.00035884752,"threshold_uncertainty_score":0.99979115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008007178,0.0021144117,0.82824045,0.018959224,0.028796691,0.0006139095,0.0000045605448,0.00018965962,0.113073915],"genre_scores_gemma":[0.9815137,0.0007614684,0.0013441353,0.0008363327,0.015179616,0.000004504537,0.000004028261,0.0000091279735,0.0003471022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99753857,0.00034597277,0.0008543873,0.00015198527,0.00093266874,0.0001764048],"domain_scores_gemma":[0.9968057,0.0002941735,0.0009796286,0.0008627973,0.0009454084,0.000112273236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009728098,0.0001468408,0.00027367639,0.00022407447,0.000090511756,0.0004770109,0.004497953,0.00009947441,0.000030686453],"category_scores_gemma":[0.000043322212,0.00013288147,0.00013533651,0.00022291715,0.000035845034,0.0006607296,0.00017815984,0.00045651986,0.000053776243],"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.00012270223,0.00033186958,0.00014091589,0.0000012202677,0.00016941105,0.00008399459,0.00077739544,0.09613597,0.000052567473,0.4282741,0.14569268,0.32821718],"study_design_scores_gemma":[0.0013289666,0.00050672475,0.0020474687,0.00061719684,0.000014505774,0.00059049216,0.00012441387,0.41229865,0.00014191966,0.0020015289,0.57999027,0.0003378729],"about_ca_topic_score_codex":0.000010323471,"about_ca_topic_score_gemma":0.0000032809003,"teacher_disagreement_score":0.9735065,"about_ca_system_score_codex":0.00020684439,"about_ca_system_score_gemma":0.00007501638,"threshold_uncertainty_score":0.83583915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012036856,0.0017563191,0.98207504,0.00094671466,0.0008958082,0.00054976513,0.0000012751711,0.00041708897,0.0013211081],"genre_scores_gemma":[0.9142409,0.00009196912,0.08125109,0.0029772809,0.0002046999,0.00010414345,0.0000028709987,0.000027520084,0.0010995251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973626,0.000087645094,0.00053190574,0.000805204,0.0003340635,0.0008785917],"domain_scores_gemma":[0.99832034,0.0001450719,0.00010674319,0.0010841549,0.00010501681,0.00023867679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000458411,0.0003144405,0.0003836173,0.00012133955,0.0001259094,0.0004083746,0.0014119698,0.00026890554,0.00013995823],"category_scores_gemma":[0.000033272416,0.00027581345,0.00013549268,0.00073638407,0.0000855475,0.00077557197,0.00030199176,0.00048132683,0.00029777267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047450027,0.00033226336,0.002485901,0.000007069559,0.00003299319,0.00020232555,0.00044213535,0.9203019,0.00052689406,0.0072358903,0.0011366939,0.06724847],"study_design_scores_gemma":[0.005860466,0.000099540615,0.007261704,0.00004209628,0.0000045854554,0.000018790211,0.000007129126,0.97992307,0.0006570715,0.00059664476,0.0051065045,0.00042240846],"about_ca_topic_score_codex":0.00006008211,"about_ca_topic_score_gemma":0.00053849886,"teacher_disagreement_score":0.90220404,"about_ca_system_score_codex":0.00017190634,"about_ca_system_score_gemma":0.000104955805,"threshold_uncertainty_score":0.9999694},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6595921,0.006355283,0.018964434,0.0025299566,0.01155665,0.0039094174,0.000024681634,0.00013876743,0.29692873],"genre_scores_gemma":[0.955526,0.0048112716,0.0042259423,0.00031623954,0.0010889802,0.000121776386,0.000019759671,0.000044951998,0.033845097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969723,0.000059234128,0.0006130049,0.0006505933,0.0013923239,0.0003124964],"domain_scores_gemma":[0.9971563,0.00020813524,0.00081589946,0.0007769943,0.000976894,0.0000657828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010643366,0.00034509078,0.00043544476,0.00014707186,0.00008632463,0.00012626164,0.0025321592,0.00041557415,0.00029202065],"category_scores_gemma":[0.000071813236,0.00025204537,0.000114354385,0.00047440597,0.00015850543,0.0003634823,0.0011034725,0.00062380714,0.00003093029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072527764,0.00013797563,0.00018267434,0.00010627189,0.00015049336,2.506369e-7,0.0005632481,0.09358712,0.00013642425,0.0017202552,0.10896531,0.79437745],"study_design_scores_gemma":[0.0005715727,0.000096460244,0.0017517206,0.0009151954,0.00005152869,0.000012991722,0.000044959404,0.9843052,0.0010558882,0.00005143264,0.010838229,0.00030479266],"about_ca_topic_score_codex":0.0000054777283,"about_ca_topic_score_gemma":0.000014782217,"teacher_disagreement_score":0.8907181,"about_ca_system_score_codex":0.0001609212,"about_ca_system_score_gemma":0.00016071582,"threshold_uncertainty_score":0.9999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18016961,0.00019494444,0.81617904,0.00019155153,0.0018652716,0.0006381183,4.6305672e-7,0.0005998844,0.00016111591],"genre_scores_gemma":[0.9508272,0.000045966204,0.04828339,0.00009386722,0.00043716587,0.00018617125,0.000047173715,0.00004558424,0.000033529104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996254,0.00020731823,0.00073614245,0.0014825276,0.0004767203,0.0008432629],"domain_scores_gemma":[0.9976021,0.00011555616,0.00023860492,0.001675603,0.00014635875,0.00022176855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011504751,0.0004705062,0.0005745406,0.00021158982,0.00008175506,0.00072211144,0.0017656416,0.000938485,0.000015240488],"category_scores_gemma":[0.000038185368,0.0005156931,0.00015354677,0.00071550376,0.000024456956,0.0002929759,0.0034178386,0.0019485601,0.0000035502362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018875452,0.00014802939,0.00012744164,0.00009108338,0.000020066616,0.00008289829,0.001303197,0.9603406,0.00017194447,0.0041718804,0.000035329223,0.033505637],"study_design_scores_gemma":[0.00020623194,0.000029310244,0.00072925736,0.0007132505,0.0000074037057,0.000014142645,0.00002004244,0.9973831,0.00030613248,0.00004433467,0.00001921641,0.0005275415],"about_ca_topic_score_codex":0.00016196264,"about_ca_topic_score_gemma":0.00025216574,"teacher_disagreement_score":0.77065754,"about_ca_system_score_codex":0.00032714813,"about_ca_system_score_gemma":0.00023367286,"threshold_uncertainty_score":0.99972945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008739344,0.00040268217,0.98493516,0.00009570418,0.0010108672,0.00228762,0.000024074256,0.0005472398,0.0019572808],"genre_scores_gemma":[0.7544391,0.000026419839,0.24448854,0.000032385757,0.00033301188,0.00023906486,0.00033057696,0.00006328553,0.000047574726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990324,0.002176963,0.00076114055,0.0020813714,0.0031993974,0.0014571077],"domain_scores_gemma":[0.9942045,0.0002816137,0.00030299576,0.0036659092,0.0010819667,0.00046297707],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0050338674,0.00048379408,0.0005706211,0.0007905278,0.00073386484,0.0027386863,0.0030123864,0.00046349276,0.00005646064],"category_scores_gemma":[0.00006943016,0.00051944423,0.00018366236,0.0017598406,0.000100116995,0.00032104124,0.0052330173,0.0017043153,0.000033333272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001177946,0.00019682964,0.00015153184,0.001720295,0.00005406995,0.00046945427,0.00032174087,0.985781,0.000022432085,0.005056077,0.00006584787,0.006148928],"study_design_scores_gemma":[0.00037638648,0.00007996117,0.00027773366,0.0031376495,0.000024974666,0.000011950611,0.0007854646,0.9945724,0.00008596918,0.000012722556,0.00016511539,0.00046968833],"about_ca_topic_score_codex":0.00043760584,"about_ca_topic_score_gemma":0.000022689703,"teacher_disagreement_score":0.7456998,"about_ca_system_score_codex":0.0021866693,"about_ca_system_score_gemma":0.0008763529,"threshold_uncertainty_score":0.9997257},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062009094,0.003362404,0.99147785,0.00020004934,0.0025135938,0.0011481134,0.0000114186805,0.000611706,0.0006128746],"genre_scores_gemma":[0.30236548,0.00091545086,0.68939716,0.0017624723,0.0007290623,0.0028352544,0.0009455185,0.00010119471,0.0009484015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644154,0.00019627354,0.00068356364,0.0015627486,0.00039059776,0.00072529423],"domain_scores_gemma":[0.9964954,0.0004931981,0.00047188194,0.0018197083,0.0005184658,0.00020130842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005599208,0.00050964893,0.0006298333,0.000116120405,0.00024112544,0.0009483627,0.001725494,0.00070284563,0.00013823352],"category_scores_gemma":[0.000026931762,0.00052795344,0.0003634977,0.0004679344,0.00003968038,0.00027857724,0.0022186788,0.00053134415,0.0000017040308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010291253,0.00007224292,0.000016156779,0.000047788726,0.00003800519,0.000015218611,0.00005925847,0.92804676,0.000001822862,0.00070569455,0.002706376,0.068280384],"study_design_scores_gemma":[0.0004428735,0.00011465186,0.00000545905,0.0002550995,0.00003111037,0.0000042184233,0.000030259005,0.9934707,0.0001082354,0.000109981294,0.004842196,0.00058517884],"about_ca_topic_score_codex":0.000032408698,"about_ca_topic_score_gemma":0.00012366264,"teacher_disagreement_score":0.30230346,"about_ca_system_score_codex":0.00025770543,"about_ca_system_score_gemma":0.00059916696,"threshold_uncertainty_score":0.9997172},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008452041,0.0026692387,0.98528785,0.00018739191,0.00037643538,0.0026575914,0.000005942863,0.00022591403,0.00013760618],"genre_scores_gemma":[0.95857966,0.00091734703,0.027471501,0.00040898862,0.0017576892,0.010565299,0.00004211114,0.000047390033,0.00020999006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975783,0.00005220765,0.0005236976,0.00096282375,0.00015415439,0.00072879135],"domain_scores_gemma":[0.9983238,0.00021314253,0.00017544905,0.00084774726,0.00018655241,0.00025333036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056091824,0.00027840494,0.00030085343,0.00014166563,0.0005154472,0.00023361275,0.0006669629,0.00019994543,0.000015289299],"category_scores_gemma":[0.000011487974,0.00028972764,0.00008253149,0.0011286582,0.00015627242,0.00036212162,0.00032037008,0.00029195865,0.000016061831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023368362,0.00017992641,0.00020708637,0.000010770883,0.000018831968,0.0000013064239,0.00021699621,0.3267945,0.00024964882,0.005232298,0.0022428695,0.6648224],"study_design_scores_gemma":[0.00056310894,0.00022183638,0.00070538715,0.00006177487,0.000013272195,0.00002707871,0.00012868925,0.9053675,0.000085280015,0.00040156406,0.09206137,0.0003631213],"about_ca_topic_score_codex":0.000016293363,"about_ca_topic_score_gemma":0.00014277133,"teacher_disagreement_score":0.95781636,"about_ca_system_score_codex":0.00007802643,"about_ca_system_score_gemma":0.000036844816,"threshold_uncertainty_score":0.9999555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006478888,0.0072134854,0.98350745,0.0009836141,0.0015037226,0.0001927826,0.000007263455,0.000037287602,0.00007547926],"genre_scores_gemma":[0.96052027,0.0022880537,0.036259465,0.00042681335,0.0003814131,0.0000391555,0.000009490499,0.000014925565,0.00006043636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777997,0.0005073252,0.0008393349,0.00019213412,0.0004817069,0.0001995443],"domain_scores_gemma":[0.9963141,0.00065263605,0.00089331344,0.00065850734,0.001330464,0.00015097373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355082,0.00015011728,0.00035879004,0.00017725052,0.00017824529,0.00017593116,0.0021077448,0.000118231896,0.0000030563065],"category_scores_gemma":[0.000028722414,0.00013564924,0.00011632613,0.0001232616,0.00015177215,0.00036511628,0.00014351399,0.00021486216,0.0000013866802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025177267,0.00047322357,0.00042209058,0.000003861125,0.00054922694,0.000081414015,0.0012413309,0.67999107,0.00029870792,0.07664095,0.002114741,0.23793162],"study_design_scores_gemma":[0.0019378216,0.00017799526,0.00013411026,0.000060506496,0.000011778681,0.0010743911,0.00007099873,0.963018,0.000035474888,0.00017521369,0.03317745,0.00012625688],"about_ca_topic_score_codex":0.000035815545,"about_ca_topic_score_gemma":0.0000063135385,"teacher_disagreement_score":0.95404136,"about_ca_system_score_codex":0.00011254975,"about_ca_system_score_gemma":0.00010109266,"threshold_uncertainty_score":0.55316156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046532396,0.001929483,0.948976,0.00022655142,0.00032237777,0.0017037292,0.00000799555,0.00026516902,0.00003631335],"genre_scores_gemma":[0.92291915,0.002008337,0.07383341,0.00014963832,0.00009048,0.000844906,0.00003756853,0.00005149321,0.00006502968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996916,0.0003200091,0.00084926013,0.0008360658,0.00023200974,0.0008466798],"domain_scores_gemma":[0.9957306,0.0010026029,0.00034272333,0.0024658965,0.00020553527,0.00025268353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083522336,0.00041670323,0.00059951213,0.00020895718,0.0011760327,0.0001636532,0.0025262767,0.00022618861,0.0000013675659],"category_scores_gemma":[0.000027329072,0.00044519396,0.00014493638,0.0006354292,0.00034525726,0.0003700049,0.0021230066,0.00060015183,0.0000043080463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000640325,0.004702996,0.0052978555,0.00022014424,0.0002534698,0.00006894005,0.025103115,0.49430722,0.0005629301,0.024574859,0.0007978234,0.44404662],"study_design_scores_gemma":[0.0020041955,0.00010643588,0.002144382,0.00019725211,0.000010391763,0.000057500292,0.0003225827,0.99395955,0.000059167924,0.000038320217,0.0006142116,0.00048601968],"about_ca_topic_score_codex":0.00014988254,"about_ca_topic_score_gemma":0.0001690089,"teacher_disagreement_score":0.87638676,"about_ca_system_score_codex":0.00016272058,"about_ca_system_score_gemma":0.00008971538,"threshold_uncertainty_score":0.99979997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023788251,0.00064296735,0.9301492,0.00018997109,0.0018237757,0.0004456404,6.993108e-7,0.00039545857,0.04256404],"genre_scores_gemma":[0.89312834,0.000019026967,0.10593797,0.00016022421,0.00016327624,0.00011600821,0.000007627222,0.000013256224,0.00045428582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802893,0.00015816471,0.00042004127,0.00083132857,0.00025889053,0.00030261115],"domain_scores_gemma":[0.99835145,0.00006378397,0.000094484254,0.0013397306,0.00007560444,0.00007491226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048402973,0.00021012123,0.0003702859,0.00008310743,0.000041139807,0.00081015547,0.0014262008,0.00024016258,0.000030222358],"category_scores_gemma":[0.00002018504,0.00020185056,0.00008020034,0.0002830043,0.000010403197,0.00019484587,0.003950947,0.0006684073,0.000028077888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025132495,0.00020850042,0.005627224,0.0019110446,0.000114182556,0.0027498445,0.0044510695,0.57047147,0.0004267483,0.3107462,0.0035269181,0.09976429],"study_design_scores_gemma":[0.00012735941,0.0000084077665,0.0005619531,0.0007204327,0.0000021286498,0.00004156526,0.00012527182,0.9976347,0.0002933107,0.0000808777,0.00013045607,0.0002735417],"about_ca_topic_score_codex":0.00027843833,"about_ca_topic_score_gemma":0.00017497122,"teacher_disagreement_score":0.86934006,"about_ca_system_score_codex":0.00018881077,"about_ca_system_score_gemma":0.00023983662,"threshold_uncertainty_score":0.8231227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034484142,0.0037106525,0.96054304,0.000016818596,0.0012658247,0.0025719886,0.0000021645167,0.00019339353,0.028247733],"genre_scores_gemma":[0.9479661,0.0016401344,0.03379854,0.00086015824,0.0004924912,0.005822079,0.0009775402,0.000103623584,0.008339356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698555,0.0001476195,0.00063650863,0.0011346686,0.00037997222,0.0007156846],"domain_scores_gemma":[0.99784195,0.00039572775,0.0003153086,0.0011840906,0.00013019374,0.00013273211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075058674,0.0004678623,0.0006117259,0.00016415538,0.00007621684,0.00020784463,0.0017512977,0.00064324954,0.00011753891],"category_scores_gemma":[0.000037642654,0.00043859924,0.00021488157,0.00041317684,0.000026485017,0.00022333484,0.00015956524,0.000628025,0.000014500543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004349571,0.0008216188,0.00006315506,0.0011135238,0.00015768695,0.000009714259,0.0093672145,0.018454643,0.000025441639,0.22068532,0.014173539,0.73469317],"study_design_scores_gemma":[0.0008883543,0.0005589386,0.000034414854,0.00019342537,0.0000291717,0.000001808249,0.0002588925,0.969696,0.00041725612,0.01540779,0.011761777,0.00075218786],"about_ca_topic_score_codex":0.000013874344,"about_ca_topic_score_gemma":0.00059044664,"teacher_disagreement_score":0.9512413,"about_ca_system_score_codex":0.00008697044,"about_ca_system_score_gemma":0.00008600167,"threshold_uncertainty_score":0.9998066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013341703,0.0018155484,0.976456,0.00022786866,0.00077907834,0.0014588105,0.000002063766,0.00080987264,0.005109039],"genre_scores_gemma":[0.5356349,0.0000733508,0.46128348,0.0005436448,0.00026940487,0.00076133263,0.0000040264213,0.000050889386,0.001379012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698716,0.00010585793,0.0007304128,0.0008818361,0.0003047444,0.0009900025],"domain_scores_gemma":[0.9963641,0.0020527034,0.0003110514,0.0009202339,0.000146708,0.0002051841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006957649,0.0003597256,0.00043780723,0.000074373966,0.00039004674,0.00041872583,0.0012233704,0.0002019444,0.0002257353],"category_scores_gemma":[0.00028364646,0.0003464212,0.00017945922,0.0006223216,0.000048542384,0.0006866115,0.0006601288,0.00030227556,0.000036540718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015242222,0.0001289372,0.00003790931,0.000094173665,0.000049265735,0.00001523023,0.001441944,0.06007415,0.0008334674,0.0013885194,0.0059698136,0.92995137],"study_design_scores_gemma":[0.0008879297,0.00019757128,0.000028317547,0.00008647636,0.000010840131,0.00002976882,0.00012968328,0.99393463,0.00031583916,0.0003272311,0.00360497,0.00044675986],"about_ca_topic_score_codex":0.0000024204123,"about_ca_topic_score_gemma":0.00002906833,"teacher_disagreement_score":0.9338605,"about_ca_system_score_codex":0.000090766574,"about_ca_system_score_gemma":0.000015355174,"threshold_uncertainty_score":0.9998988},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017725968,0.0033541902,0.9919503,0.0005895899,0.0011911443,0.00059026876,0.00002236408,0.000112785405,0.0021716398],"genre_scores_gemma":[0.0010986134,0.00037224585,0.9975926,0.0003040178,0.00031270183,0.000047870966,0.00004842907,0.000020551515,0.00020296048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839026,0.000023524331,0.0006744356,0.0002024064,0.00035713697,0.00035226566],"domain_scores_gemma":[0.9976915,0.00037616497,0.000549689,0.0010360607,0.00025997564,0.0000865796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006606268,0.00032536156,0.00044786427,0.00016497326,0.0007496539,0.00035136327,0.004035888,0.00031658763,4.4721705e-7],"category_scores_gemma":[0.000060404647,0.00026243494,0.00020769163,0.000525193,0.00043464982,0.0005033896,0.001759021,0.00061934034,8.060609e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.591337e-7,0.000009286991,6.4622026e-7,0.00007518113,0.00004447378,7.208448e-8,0.00078781584,0.93766874,3.2677363e-7,0.013139896,0.002447617,0.045825172],"study_design_scores_gemma":[0.00015735015,0.000058513346,0.0000078881085,0.00014912608,0.000025704498,0.000010349059,0.0000013642494,0.83854043,0.000004118668,0.0011781935,0.15960926,0.0002576918],"about_ca_topic_score_codex":0.000005710373,"about_ca_topic_score_gemma":0.000053568412,"teacher_disagreement_score":0.15716164,"about_ca_system_score_codex":0.0001513891,"about_ca_system_score_gemma":0.0005426593,"threshold_uncertainty_score":0.9999828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027289155,0.0030356762,0.9896163,0.00009348436,0.0022211806,0.0010414284,0.000018616294,0.0009250109,0.00031942848],"genre_scores_gemma":[0.5718036,0.0002303008,0.4226458,0.00115682,0.00085916865,0.0021940703,0.0005697425,0.00010243008,0.00043800296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496603,0.00025601918,0.0008119294,0.0023762735,0.0004947635,0.0010949548],"domain_scores_gemma":[0.99462354,0.0004095266,0.00046697198,0.0035988453,0.0004795112,0.00042158476],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073830195,0.0007427855,0.0008449368,0.0001401123,0.00029825963,0.0012257226,0.0032720151,0.0009190147,0.00014473009],"category_scores_gemma":[0.000034693698,0.00075950334,0.00052361,0.00044115863,0.000059041264,0.00047144282,0.0023872189,0.0008940946,0.0000035608505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019376106,0.0002490569,0.00023898156,0.00008613999,0.000069819565,0.00004312765,0.00017557126,0.687431,0.000048807764,0.0020935081,0.0012714803,0.30827314],"study_design_scores_gemma":[0.0006699047,0.00017140638,0.00005844862,0.0002407212,0.000023145965,0.0000049298037,0.00009242473,0.98824793,0.00045761792,0.00014474336,0.009008338,0.0008803878],"about_ca_topic_score_codex":0.00009571057,"about_ca_topic_score_gemma":0.00035488093,"teacher_disagreement_score":0.56907475,"about_ca_system_score_codex":0.00022388592,"about_ca_system_score_gemma":0.000649878,"threshold_uncertainty_score":0.9998111},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21779564,0.0002820301,0.7802151,0.000105184896,0.0005401078,0.0006749328,0.0000022372747,0.000053248103,0.0003315579],"genre_scores_gemma":[0.9973535,0.000008522948,0.0022177473,0.00003385811,0.00009522194,0.00018581048,0.000034945417,0.00001374126,0.000056658373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968595,0.0011153565,0.00052701886,0.00048346474,0.0007167308,0.0002979291],"domain_scores_gemma":[0.99476314,0.0032643816,0.00026721135,0.0006362999,0.0009574555,0.000111528694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035939591,0.00020835108,0.0002946514,0.00012321257,0.00007718402,0.00016345264,0.0007816459,0.0001433575,0.000044233206],"category_scores_gemma":[0.00069717434,0.00016803783,0.00006900698,0.0005552431,0.00010282233,0.00089212984,0.00028939403,0.00027824703,0.000021110927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015619656,0.000096850825,0.0048147016,0.0000173917,0.000013772508,0.0000018247123,0.0009875167,0.93326956,0.00018192311,0.0041980566,0.000061417755,0.05620077],"study_design_scores_gemma":[0.00069475995,0.00028767766,0.030044194,0.00021022417,0.00001051978,0.0000028020554,0.00008977819,0.9646026,0.0002023786,0.0035400747,0.0001351984,0.00017978885],"about_ca_topic_score_codex":0.0000128243155,"about_ca_topic_score_gemma":0.000044374512,"teacher_disagreement_score":0.7795579,"about_ca_system_score_codex":0.00017602573,"about_ca_system_score_gemma":0.00031329956,"threshold_uncertainty_score":0.6852384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008596134,0.00023699822,0.91861457,0.00006225083,0.0017129127,0.06846627,0.000001998933,0.0003307675,0.00197812],"genre_scores_gemma":[0.53574514,0.00012263865,0.22041322,0.0008905651,0.0049703596,0.22569807,0.0009062602,0.00042679763,0.010826935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606824,0.00052014366,0.0009208832,0.00091712736,0.0006068856,0.00096670137],"domain_scores_gemma":[0.99726427,0.00022173248,0.00080767804,0.0013666278,0.00017204304,0.00016765647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018245212,0.0005187736,0.00079110597,0.0004296616,0.00031033577,0.00079705485,0.0018624095,0.00034299504,0.0000736787],"category_scores_gemma":[0.000019319883,0.0003900057,0.00030069842,0.00263387,0.000023845012,0.00096679735,0.00026635156,0.00080899545,0.0000074710097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010822189,0.00007322085,0.00052173925,0.00004270172,0.00029752078,0.000013366461,0.0063780053,0.86573756,0.0000278498,0.00027477476,0.000028712806,0.12649632],"study_design_scores_gemma":[0.00051774667,0.000038670743,0.0006462561,0.00016915453,0.00015246657,0.0000019579395,0.00029022695,0.99676836,0.000069913534,0.00016919948,0.0006807806,0.00049529824],"about_ca_topic_score_codex":0.00035401172,"about_ca_topic_score_gemma":0.0021666728,"teacher_disagreement_score":0.6982013,"about_ca_system_score_codex":0.00022433425,"about_ca_system_score_gemma":0.00021184506,"threshold_uncertainty_score":0.99985516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019994474,0.000099336874,0.9005174,0.0005480047,0.00019657688,0.000043740787,7.8500726e-8,0.0002002002,0.09639521],"genre_scores_gemma":[0.98967123,0.00001481047,0.0059696743,0.00075197074,0.000055371078,0.000008083871,2.928357e-7,0.0000046539085,0.003523901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999222,0.000028409475,0.00013649296,0.00023998586,0.00012362814,0.00024951273],"domain_scores_gemma":[0.9995069,0.000044754026,0.000024790723,0.0003643342,0.000011259364,0.00004798863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008614199,0.00007071589,0.00007741983,0.000045977657,0.00002878276,0.00006509736,0.0005090381,0.000040655785,0.00030350368],"category_scores_gemma":[0.00000243195,0.00006524306,0.000020963422,0.0002998742,0.0000083160185,0.00022893194,0.00018875719,0.00007355637,0.00012733456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.510559e-7,0.00006453836,0.002910751,0.0000026982134,0.0000036142828,0.00011810048,0.0003502066,0.0010069947,0.000024220806,0.28775653,0.01611411,0.69164777],"study_design_scores_gemma":[0.00011318241,0.000011729412,0.000501596,0.000008712997,2.8478811e-7,0.000009679314,0.000005503332,0.99358445,0.00011732807,0.0008266934,0.0047280528,0.00009278992],"about_ca_topic_score_codex":0.000098164586,"about_ca_topic_score_gemma":0.00016182954,"teacher_disagreement_score":0.99257743,"about_ca_system_score_codex":0.000026380765,"about_ca_system_score_gemma":0.000003928629,"threshold_uncertainty_score":0.33231527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014520796,0.0025521426,0.97156554,0.00014213164,0.000980277,0.0005635384,0.000003568908,0.00031570997,0.009356306],"genre_scores_gemma":[0.99077034,0.00013711132,0.0068289815,0.00050203234,0.0008083415,0.00009072202,0.000057416277,0.000047787493,0.0007572899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964519,0.00017265457,0.0006420867,0.00097270275,0.0005472703,0.0012133954],"domain_scores_gemma":[0.997871,0.0004119011,0.00026980546,0.0011905507,0.00008636413,0.00017039652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057835714,0.00043855605,0.0005282738,0.00039665413,0.00016323933,0.00037429915,0.0011129988,0.00028736924,0.00001729617],"category_scores_gemma":[0.000013801675,0.00037327487,0.00009986877,0.00429887,0.00016438031,0.0010458739,0.00026682916,0.0008067452,0.000014457053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007359953,0.00014794097,0.027034078,0.0000066915977,0.000027882736,0.00044855618,0.000027685479,0.9170507,0.0000019477525,0.032954875,0.008396235,0.013829812],"study_design_scores_gemma":[0.0016077282,0.00018882898,0.022543743,0.00015931285,0.000018465678,0.000089803034,0.00002071832,0.97038734,0.000011970158,0.0004991574,0.0038312566,0.00064167014],"about_ca_topic_score_codex":0.0005195273,"about_ca_topic_score_gemma":0.0013623127,"teacher_disagreement_score":0.9762495,"about_ca_system_score_codex":0.00023950606,"about_ca_system_score_gemma":0.00012131916,"threshold_uncertainty_score":0.9998719},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022447167,0.01974914,0.9459864,0.00029798225,0.0024490324,0.0025422939,0.000007981783,0.0006161373,0.0059038596],"genre_scores_gemma":[0.7731162,0.0013639624,0.21811101,0.0012816769,0.00047478627,0.0030317132,0.00021162567,0.00011895221,0.0022900791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946963,0.0006154371,0.0010405987,0.002034716,0.000619034,0.0009938781],"domain_scores_gemma":[0.99571306,0.0004693262,0.00055952376,0.0025789368,0.00044274045,0.00023639572],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001135891,0.00068220607,0.0009418682,0.000252665,0.00013768296,0.0011181162,0.0026038466,0.0007928836,0.00028620707],"category_scores_gemma":[0.00005828139,0.00071742217,0.0002866063,0.0019807066,0.00008725017,0.00046342614,0.0042781252,0.0019845325,0.000032446653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014030887,0.00024663992,0.0008239673,0.000088632696,0.000053506516,0.00017546564,0.00068582484,0.90654325,0.000012224184,0.0003876232,0.0026091842,0.08835963],"study_design_scores_gemma":[0.0006986316,0.00009629228,0.00071746286,0.00088929175,0.000017138116,0.0000037544517,0.00020926612,0.98640716,0.00032252187,0.00033685437,0.009423419,0.00087821274],"about_ca_topic_score_codex":0.000030359939,"about_ca_topic_score_gemma":0.0010196101,"teacher_disagreement_score":0.750669,"about_ca_system_score_codex":0.00038874158,"about_ca_system_score_gemma":0.0012070942,"threshold_uncertainty_score":0.9999188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48012823,0.01668217,0.495259,0.00012231538,0.0004253575,0.006152874,2.5987515e-7,0.00010938803,0.0011204008],"genre_scores_gemma":[0.9962165,0.00087714434,0.0018072176,0.000024146742,0.00016806844,0.00077853724,6.874908e-7,0.000017025584,0.000110701556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962397,0.00017328556,0.00068519986,0.00028080473,0.00045250845,0.0021684752],"domain_scores_gemma":[0.99875623,0.000059982507,0.00045411428,0.00043292352,0.0001534556,0.00014330473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034679407,0.00018313783,0.00037569457,0.00012713167,0.000092283066,0.00008812118,0.0012708805,0.000111321766,0.0000032995385],"category_scores_gemma":[0.000033106422,0.00016777444,0.0000775846,0.00064675964,0.0000440958,0.00061944366,0.00021397964,0.0022090017,0.0000099003155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009071568,0.00022246862,0.0512968,0.000010912436,0.000033362376,0.000004371324,0.0011153015,0.16924608,0.00002922968,0.013218077,0.00017266023,0.76456004],"study_design_scores_gemma":[0.001702221,0.0020402716,0.0011043152,0.00018673572,0.00000615214,0.0002056508,0.000682171,0.9833523,0.00016051842,0.006905738,0.0033654387,0.00028845892],"about_ca_topic_score_codex":0.0000053006756,"about_ca_topic_score_gemma":0.00023925808,"teacher_disagreement_score":0.8141062,"about_ca_system_score_codex":0.0008616364,"about_ca_system_score_gemma":0.0018246465,"threshold_uncertainty_score":0.9597136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016858218,0.00066461746,0.9921384,0.00074738666,0.0005911082,0.0011295867,0.0000015587754,0.00050449715,0.0040542884],"genre_scores_gemma":[0.32499906,0.000013032085,0.67089164,0.0017295271,0.00065844465,0.00049024035,0.000045034052,0.000031240674,0.0011417953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980759,0.00015092484,0.00048800613,0.0005084756,0.00023653751,0.00054017873],"domain_scores_gemma":[0.99766886,0.001386247,0.00016937373,0.00054987916,0.00014070922,0.000084927575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077306,0.00021370867,0.00043331485,0.00006608169,0.00022551371,0.00027554735,0.00063589495,0.00012391448,0.000043785814],"category_scores_gemma":[0.000036133715,0.00018101618,0.00026559492,0.00033168413,0.00006181921,0.00026600398,0.00009628192,0.00013573901,0.000017735027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043889764,0.00021248232,0.000045332883,0.000018477927,0.000068520996,0.000019918825,0.00005616661,0.60845166,0.000038919403,0.1628289,0.016721522,0.20714912],"study_design_scores_gemma":[0.05904287,0.00004273087,0.000018391422,0.000021892736,0.00001753981,0.000003893436,0.0000018271409,0.9360369,0.00012364815,0.0026340582,0.0018269871,0.00022924872],"about_ca_topic_score_codex":0.000046376983,"about_ca_topic_score_gemma":0.000032353968,"teacher_disagreement_score":0.32758525,"about_ca_system_score_codex":0.00006227598,"about_ca_system_score_gemma":0.00006418904,"threshold_uncertainty_score":0.7381625},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018713966,0.0045441426,0.9691196,0.00006976697,0.0023900513,0.00093325856,0.0000028707682,0.00037363777,0.003852709],"genre_scores_gemma":[0.52697086,0.0024127548,0.46619228,0.00125358,0.0006338255,0.000549344,0.00009565887,0.000117947835,0.0017737802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956171,0.00017431627,0.0008813247,0.0018086982,0.00055935915,0.000959215],"domain_scores_gemma":[0.9963739,0.00009188641,0.0002885983,0.002815708,0.00017261757,0.0002573155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072617084,0.00057933497,0.00080516847,0.00022434312,0.00008866045,0.00072234485,0.0026542447,0.0007641787,0.00023567924],"category_scores_gemma":[0.000012685286,0.0006196734,0.00029608203,0.0006414715,0.00006117909,0.0004921119,0.007123407,0.0017371023,0.000017783756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035709338,0.000091619615,0.000103699946,0.0000357063,0.00002290943,0.00016500967,0.00040980207,0.95550895,0.000016262313,0.00075959746,0.0013143047,0.041568592],"study_design_scores_gemma":[0.00023196689,0.00003263684,0.000043681397,0.00018391426,0.000010761365,0.000027698046,0.00004462432,0.9961795,0.000047474918,0.0009752368,0.0015743239,0.0006481723],"about_ca_topic_score_codex":0.000056456935,"about_ca_topic_score_gemma":0.00044099308,"teacher_disagreement_score":0.50825685,"about_ca_system_score_codex":0.00038133046,"about_ca_system_score_gemma":0.0010415824,"threshold_uncertainty_score":0.99962544},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031395635,0.001379402,0.9139697,0.00005359894,0.0022339784,0.061583545,0.0000053758436,0.001045721,0.019414712],"genre_scores_gemma":[0.026726719,0.00040458972,0.16493545,0.00095301395,0.0049701203,0.6946236,0.0012993951,0.00034491712,0.105742194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716496,0.000064514075,0.0006903515,0.0010365739,0.00034972242,0.00069386006],"domain_scores_gemma":[0.9976714,0.00031044052,0.00050537335,0.0010123947,0.000351766,0.00014857962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049354084,0.0004616061,0.000528328,0.00012040668,0.00032057345,0.0005063553,0.0014576664,0.0005594281,0.00013442236],"category_scores_gemma":[0.000035807305,0.00045128932,0.0002722749,0.0004368281,0.000016962338,0.00048509217,0.000109037406,0.00045056897,0.000048878956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008606998,0.0001427051,0.000016715665,0.00017332083,0.00007342929,0.000003808277,0.00051157863,0.023918081,0.000022210777,0.038356062,0.016810754,0.9198853],"study_design_scores_gemma":[0.00090760965,0.00039986818,0.000115936695,0.00043653083,0.000028416436,0.000009043508,0.00028659936,0.64769703,0.00047879142,0.00071044755,0.34800744,0.0009222568],"about_ca_topic_score_codex":0.000003904707,"about_ca_topic_score_gemma":0.00062637817,"teacher_disagreement_score":0.918963,"about_ca_system_score_codex":0.00015308935,"about_ca_system_score_gemma":0.00022171847,"threshold_uncertainty_score":0.9997939},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020499264,0.000007404696,0.79569864,0.00014842773,0.00085510727,0.19889489,0.0000021772635,0.0005943291,0.0035940576],"genre_scores_gemma":[0.20700477,0.000003717179,0.06100072,0.0004562663,0.00095579773,0.7300728,0.000030531148,0.000056230463,0.00041918326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99550277,0.00023136206,0.0008575901,0.0019501591,0.00048117046,0.0009769608],"domain_scores_gemma":[0.995914,0.00036496346,0.00058099185,0.0024250022,0.00048259835,0.0002324424],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096127635,0.00061688403,0.000830848,0.00007116743,0.00022312603,0.0012493427,0.0028660304,0.0007786274,0.00009965812],"category_scores_gemma":[0.00006023211,0.000602111,0.0004667544,0.00039554248,0.000053648277,0.00034591072,0.005647056,0.0013085653,0.0000065032273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022577937,0.0013713292,0.00021702469,0.00372835,0.0008115363,0.0001553437,0.007037935,0.16192661,0.00038442406,0.4312531,0.03373911,0.35914946],"study_design_scores_gemma":[0.00078606326,0.00006085926,0.000021240981,0.00065190747,0.000013181313,0.000006142176,0.000033238488,0.9897024,0.002494504,0.0043881484,0.0011291465,0.0007131865],"about_ca_topic_score_codex":0.000082711034,"about_ca_topic_score_gemma":0.00020985314,"teacher_disagreement_score":0.8277758,"about_ca_system_score_codex":0.00018866909,"about_ca_system_score_gemma":0.0005549146,"threshold_uncertainty_score":0.99978745},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063210186,0.0009487222,0.8413709,0.00013516693,0.002031507,0.14595735,0.000026435655,0.0012540383,0.0019548787],"genre_scores_gemma":[0.19555819,0.00021998385,0.06037513,0.0014259128,0.0015032766,0.7396003,0.00026462277,0.0002544866,0.0007981076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911032,0.00034780003,0.001766961,0.0037465726,0.0011696008,0.0018658922],"domain_scores_gemma":[0.99248457,0.00064631295,0.0012272077,0.0044137025,0.00059038977,0.0006378457],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017373287,0.0013839417,0.001400053,0.00029317042,0.00059630896,0.0020463022,0.004248052,0.001321438,0.00013646217],"category_scores_gemma":[0.00007559688,0.001289809,0.00076609466,0.0006754897,0.0001408332,0.0004990214,0.0040349513,0.0017545999,0.000018964609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013650345,0.0009677977,0.000015479656,0.00021744527,0.0001079117,0.00007746777,0.0005392727,0.7256033,0.00004327014,0.0011437291,0.0019793815,0.26916844],"study_design_scores_gemma":[0.0018973459,0.0009734477,0.00032943903,0.0011070558,0.000034109824,0.000018418279,0.000119967466,0.9535587,0.0008135975,0.00029548537,0.039287776,0.0015646695],"about_ca_topic_score_codex":0.00003885569,"about_ca_topic_score_gemma":0.00017145005,"teacher_disagreement_score":0.7809957,"about_ca_system_score_codex":0.0005020812,"about_ca_system_score_gemma":0.00091441517,"threshold_uncertainty_score":0.9999751},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011589079,0.000777572,0.98270494,0.00092966825,0.005027647,0.0010145195,0.000004142059,0.00049542554,0.007887159],"genre_scores_gemma":[0.17907485,0.0004286182,0.80464983,0.0026127438,0.0035933538,0.0012147843,0.00016912694,0.0000976836,0.008158991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968374,0.00010926852,0.0005187543,0.0013926835,0.0003768605,0.00076503895],"domain_scores_gemma":[0.9965123,0.00032869919,0.00023343934,0.0024486203,0.0002799236,0.00019701227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006080052,0.000420195,0.00066443725,0.00004411105,0.00013364156,0.0007879304,0.0025939185,0.00051129016,0.00016842],"category_scores_gemma":[0.00002087345,0.0004163237,0.00038279025,0.00034067055,0.0000422642,0.0002078923,0.0049577365,0.0006652465,0.00003629159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137322495,0.00015325853,0.00019877925,0.0003485677,0.0003042237,0.000076108714,0.00035436425,0.064515844,0.000033343003,0.5061359,0.25816616,0.16969974],"study_design_scores_gemma":[0.00035805017,0.000047378315,0.00016175343,0.00028943236,0.000032127005,0.000013646898,0.000016026159,0.9597926,0.00028830656,0.02024239,0.017975334,0.00078291184],"about_ca_topic_score_codex":0.000052188785,"about_ca_topic_score_gemma":0.00015274774,"teacher_disagreement_score":0.8952768,"about_ca_system_score_codex":0.0000932147,"about_ca_system_score_gemma":0.0003750229,"threshold_uncertainty_score":0.9998289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18016961,0.00019494444,0.81617904,0.00019155153,0.0018652716,0.0006381183,4.6305672e-7,0.0005998844,0.00016111591],"genre_scores_gemma":[0.9508272,0.000045966204,0.04828339,0.00009386722,0.00043716587,0.00018617125,0.000047173715,0.00004558424,0.000033529104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996254,0.00020731823,0.00073614245,0.0014825276,0.0004767203,0.0008432629],"domain_scores_gemma":[0.9976021,0.00011555616,0.00023860492,0.001675603,0.00014635875,0.00022176855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011504751,0.0004705062,0.0005745406,0.00021158982,0.00008175506,0.00072211144,0.0017656416,0.000938485,0.000015240488],"category_scores_gemma":[0.000038185368,0.0005156931,0.00015354677,0.00071550376,0.000024456956,0.0002929759,0.0034178386,0.0019485601,0.0000035502362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018875452,0.00014802939,0.00012744164,0.00009108338,0.000020066616,0.00008289829,0.001303197,0.9603406,0.00017194447,0.0041718804,0.000035329223,0.033505637],"study_design_scores_gemma":[0.00020623194,0.000029310244,0.00072925736,0.0007132505,0.0000074037057,0.000014142645,0.00002004244,0.9973831,0.00030613248,0.00004433467,0.00001921641,0.0005275415],"about_ca_topic_score_codex":0.00016196264,"about_ca_topic_score_gemma":0.00025216574,"teacher_disagreement_score":0.77065754,"about_ca_system_score_codex":0.00032714813,"about_ca_system_score_gemma":0.00023367286,"threshold_uncertainty_score":0.99972945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010663914,0.00028449038,0.93225276,0.00022725922,0.008162558,0.0014344824,0.000011614503,0.0004908102,0.05606965],"genre_scores_gemma":[0.74219906,0.00046884094,0.051278364,0.0011653726,0.0045063454,0.0022890517,0.0036698317,0.00036817614,0.19405493],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969209,0.00006467757,0.0006411769,0.0010527679,0.0005556801,0.00076483504],"domain_scores_gemma":[0.9968057,0.00012400802,0.00042153307,0.0020581258,0.00033806154,0.00025256822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005554377,0.00051484804,0.0005884112,0.00015850767,0.00012661595,0.00041945747,0.004273658,0.0005244374,0.00009746605],"category_scores_gemma":[0.00005194361,0.00048244765,0.00020949039,0.00039185214,0.000026405874,0.0005092286,0.00044642383,0.00044977246,0.000050700575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015454074,0.0001295877,0.0000482257,0.00014009765,0.00019573398,0.000015333444,0.00064555916,0.0002872534,0.000021728596,0.32158425,0.54482466,0.13195305],"study_design_scores_gemma":[0.0017652775,0.00065073336,0.00017212523,0.0005240872,0.000085508844,0.000007679539,0.0002041158,0.86814624,0.00059015275,0.118891664,0.0075422656,0.0014201244],"about_ca_topic_score_codex":0.00006501303,"about_ca_topic_score_gemma":0.00268237,"teacher_disagreement_score":0.88097435,"about_ca_system_score_codex":0.00021152436,"about_ca_system_score_gemma":0.00031176972,"threshold_uncertainty_score":0.9997627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002249044,0.00057808,0.9918157,0.0004289702,0.0017120439,0.00093899743,0.0000016960553,0.00085606624,0.0014194396],"genre_scores_gemma":[0.74332756,0.0003960409,0.25015548,0.0007684036,0.00055921305,0.0006465948,0.00005521495,0.00008753617,0.004003975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619424,0.00018452053,0.00049792655,0.00175196,0.00058552984,0.0007857941],"domain_scores_gemma":[0.996265,0.00012174395,0.00032161135,0.0026555466,0.0003755099,0.0002606091],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037076406,0.0006501224,0.00074998493,0.00010608035,0.00015222216,0.0011374957,0.0027093447,0.000586718,0.000065845146],"category_scores_gemma":[0.000011419646,0.00052535464,0.00020139165,0.00048873114,0.00012256127,0.00037318925,0.0053620157,0.0014387117,0.0000191517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034115907,0.0006724758,0.0006097894,0.00039146005,0.000651827,0.0008679434,0.0025609573,0.929419,0.00002250688,0.017568028,0.009630209,0.03757172],"study_design_scores_gemma":[0.0003934385,0.00005351146,0.0004592805,0.00041870584,0.000024294857,0.00004622299,0.000087375745,0.9972368,0.0001786993,0.00015247388,0.00020023236,0.0007489922],"about_ca_topic_score_codex":0.00019002048,"about_ca_topic_score_gemma":0.00062807574,"teacher_disagreement_score":0.7416602,"about_ca_system_score_codex":0.000100999176,"about_ca_system_score_gemma":0.00040365674,"threshold_uncertainty_score":0.99989945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14075604,0.0073379413,0.849675,0.00024202348,0.00032514165,0.00091406074,0.000005512984,0.0004494645,0.0002948317],"genre_scores_gemma":[0.94671875,0.0050352043,0.04740881,0.000313191,0.00009724871,0.0002700649,0.00003682423,0.000050688395,0.000069243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733126,0.0002513836,0.0007321113,0.0007134282,0.00023825892,0.00073354814],"domain_scores_gemma":[0.99523324,0.0010354292,0.0004179445,0.0028020185,0.0002856993,0.00022568784],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006806943,0.00035920675,0.00051999633,0.000112984555,0.0018693199,0.00025163626,0.0029892588,0.00017282028,0.000003419856],"category_scores_gemma":[0.000017923127,0.00037847518,0.00016577372,0.0005400715,0.00033333368,0.00037663916,0.0025890898,0.0005047015,0.0000054893794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002634439,0.00028561288,0.0019029354,0.000046588946,0.00010877795,0.0000165089,0.0036705371,0.020049157,0.00016771792,0.038340937,0.00059240655,0.93479246],"study_design_scores_gemma":[0.00092430896,0.00015031465,0.00024465958,0.00017179018,0.000012627636,0.00012244018,0.00016519235,0.9817837,0.000048104524,0.00018121906,0.015766243,0.00042939244],"about_ca_topic_score_codex":0.000030706928,"about_ca_topic_score_gemma":0.000024905392,"teacher_disagreement_score":0.96173453,"about_ca_system_score_codex":0.000084532076,"about_ca_system_score_gemma":0.00009862074,"threshold_uncertainty_score":0.9998667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011589079,0.000777572,0.98270494,0.00092966825,0.005027647,0.0010145195,0.000004142059,0.00049542554,0.007887159],"genre_scores_gemma":[0.17907485,0.0004286182,0.80464983,0.0026127438,0.0035933538,0.0012147843,0.00016912694,0.0000976836,0.008158991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968374,0.00010926852,0.0005187543,0.0013926835,0.0003768605,0.00076503895],"domain_scores_gemma":[0.9965123,0.00032869919,0.00023343934,0.0024486203,0.0002799236,0.00019701227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006080052,0.000420195,0.00066443725,0.00004411105,0.00013364156,0.0007879304,0.0025939185,0.00051129016,0.00016842],"category_scores_gemma":[0.00002087345,0.0004163237,0.00038279025,0.00034067055,0.0000422642,0.0002078923,0.0049577365,0.0006652465,0.00003629159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137322495,0.00015325853,0.00019877925,0.0003485677,0.0003042237,0.000076108714,0.00035436425,0.064515844,0.000033343003,0.5061359,0.25816616,0.16969974],"study_design_scores_gemma":[0.00035805017,0.000047378315,0.00016175343,0.00028943236,0.000032127005,0.000013646898,0.000016026159,0.9597926,0.00028830656,0.02024239,0.017975334,0.00078291184],"about_ca_topic_score_codex":0.000052188785,"about_ca_topic_score_gemma":0.00015274774,"teacher_disagreement_score":0.8952768,"about_ca_system_score_codex":0.0000932147,"about_ca_system_score_gemma":0.0003750229,"threshold_uncertainty_score":0.9998289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7739763,0.0011366102,0.21243246,0.00007430715,0.002353398,0.0010727732,6.0418444e-7,0.0002604396,0.008693084],"genre_scores_gemma":[0.98973924,0.0006670398,0.0081062075,0.00022130426,0.00015760312,0.00015287974,0.000006315774,0.00002234036,0.0009270435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972211,0.00017651914,0.0005564283,0.0010670092,0.0005936099,0.00038530127],"domain_scores_gemma":[0.9964027,0.00013067696,0.00031732486,0.0028517174,0.00018747208,0.00011014258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042589646,0.00035395226,0.0005846778,0.000111060566,0.000067882494,0.0002053757,0.0023595572,0.00027482043,0.00009495849],"category_scores_gemma":[0.000012396936,0.0003193549,0.00014300963,0.00043316142,0.000030990617,0.00015823184,0.004273613,0.0010184454,0.00001684452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023711496,0.0012312831,0.0022461882,0.00009116261,0.00014985482,0.00005603635,0.0019931553,0.7292905,0.0000032283483,0.0005268962,0.002114723,0.26227328],"study_design_scores_gemma":[0.00042993177,0.00080073875,0.013235945,0.00027419082,0.000019634457,0.000004752742,0.0001774389,0.9841752,0.000042080857,0.000030989213,0.0004243631,0.0003847457],"about_ca_topic_score_codex":0.000023568655,"about_ca_topic_score_gemma":0.000084505125,"teacher_disagreement_score":0.26188853,"about_ca_system_score_codex":0.000066680805,"about_ca_system_score_gemma":0.00015027048,"threshold_uncertainty_score":0.99992585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06502437,0.0020550014,0.927274,0.0011158913,0.001444048,0.0024387548,0.000022182165,0.0004147708,0.00021100184],"genre_scores_gemma":[0.9873699,0.0014792248,0.007055927,0.0002384553,0.00010895726,0.003240981,0.0003247446,0.000052794567,0.00012904705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616295,0.0009137208,0.00086439616,0.00087279937,0.00035202364,0.0008341162],"domain_scores_gemma":[0.99590147,0.0010057816,0.0005593337,0.0020541565,0.00031596926,0.00016331648],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015785279,0.00040286942,0.00059920707,0.00022949984,0.0015617189,0.00047706268,0.0030145112,0.00017430069,0.000017223134],"category_scores_gemma":[0.000017682776,0.00045782016,0.00014796384,0.0013301553,0.0002689811,0.000446106,0.0020940446,0.0012293555,0.0000013189881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006525814,0.000607893,0.005644858,0.000049894697,0.00008597825,0.000014488857,0.0019422036,0.0042510717,0.0003112719,0.030196538,0.000433863,0.9563967],"study_design_scores_gemma":[0.0015955416,0.00017261931,0.00044866366,0.00027213388,0.000023033856,0.00003016036,0.0009644371,0.9913146,0.000015850146,0.0005399631,0.004101382,0.00052164943],"about_ca_topic_score_codex":0.00021492237,"about_ca_topic_score_gemma":0.0022280656,"teacher_disagreement_score":0.98706347,"about_ca_system_score_codex":0.00023103169,"about_ca_system_score_gemma":0.00015581441,"threshold_uncertainty_score":0.99978733},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056842844,0.00046326738,0.91559696,0.0003379659,0.0026152362,0.0799207,0.000008027253,0.00094228535,0.00005870578],"genre_scores_gemma":[0.15256685,0.000017242872,0.33774406,0.003357264,0.0051601776,0.50045633,0.0001613403,0.00029327723,0.00024342521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930529,0.0007701484,0.0011802923,0.0019832565,0.000965554,0.0020478743],"domain_scores_gemma":[0.9948889,0.0016216689,0.00056093035,0.0020602539,0.00029031432,0.00057795376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018625455,0.00081315474,0.0008952082,0.0003504139,0.0010074714,0.0006247807,0.003819934,0.00038456992,0.00022925693],"category_scores_gemma":[0.000049186998,0.00083802047,0.00058942544,0.0021667387,0.0002599997,0.00045551013,0.004179204,0.001743853,0.00003317186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111763606,0.0002581139,0.00015320643,0.000034336263,0.00007546998,0.00009695553,0.00020155717,0.6632138,8.4872255e-7,0.006395322,0.024100455,0.3053582],"study_design_scores_gemma":[0.0032895452,0.000747059,0.00019146375,0.00009665988,0.000029018816,0.00008043825,0.000011613128,0.907642,0.0000047622816,0.0008271391,0.08619507,0.00088521844],"about_ca_topic_score_codex":0.000003584266,"about_ca_topic_score_gemma":0.0000023981618,"teacher_disagreement_score":0.5778529,"about_ca_system_score_codex":0.0003828646,"about_ca_system_score_gemma":0.00015229739,"threshold_uncertainty_score":0.99940705},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031142037,0.000028800328,0.9555252,0.00077384774,0.00013721915,0.012218317,0.0000065509357,0.000055150413,0.000112863025],"genre_scores_gemma":[0.94937426,0.000013180005,0.015946934,0.00019253408,0.00009269996,0.034302525,0.000007160124,0.0000116501615,0.000059048318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981578,0.0002782402,0.00028745402,0.000566532,0.00048030136,0.00022969057],"domain_scores_gemma":[0.9990211,0.00009013542,0.0001564613,0.00053829816,0.00014380057,0.000050201543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021880402,0.00014615034,0.00023247066,0.00015138637,0.0004832979,0.000059073485,0.00022755312,0.000027287477,0.0000476268],"category_scores_gemma":[6.1311533e-7,0.00014190521,0.000060322833,0.0014977824,0.000023670844,0.00011066598,0.000021887805,0.00013117284,2.4499369e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010658928,0.00012394988,0.0000914373,0.000090065645,0.00028893273,2.751591e-7,0.00030271395,0.82052284,0.000003707454,0.00045592533,0.000059042355,0.1779545],"study_design_scores_gemma":[0.00088083086,0.00047889393,0.0013005309,0.000016436265,0.0005962237,0.0000021536766,0.0002941846,0.99422663,0.000030663003,0.00023732905,0.0017875751,0.00014853207],"about_ca_topic_score_codex":0.00003410605,"about_ca_topic_score_gemma":0.00023251737,"teacher_disagreement_score":0.9395783,"about_ca_system_score_codex":0.000102117345,"about_ca_system_score_gemma":0.00002195159,"threshold_uncertainty_score":0.57867265},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016793983,0.12275598,0.8638611,0.00017583913,0.0020263374,0.0034445159,0.000032429845,0.004611647,0.0030753966],"genre_scores_gemma":[0.119474605,0.19295812,0.23956038,0.004048025,0.025426008,0.011934896,0.0010630538,0.016304662,0.38923025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9792887,0.00023279773,0.0045364597,0.0049386797,0.003399968,0.0076034204],"domain_scores_gemma":[0.98806095,0.0037878745,0.001101034,0.0040218933,0.00062775705,0.0024005],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0016366763,0.005448415,0.005186369,0.0034377116,0.0007714427,0.0013884745,0.0063307523,0.00414812,0.00022452566],"category_scores_gemma":[0.00088036986,0.0053940215,0.0021057548,0.0050311163,0.0002896949,0.0015621765,0.0016009612,0.013229846,0.00036763074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044462824,0.0003990444,0.0000064792684,0.00029685785,0.0013988912,0.0018727139,0.0003306646,0.84853745,0.0018977199,0.08397529,0.006994903,0.05384538],"study_design_scores_gemma":[0.0026763547,0.0018760549,0.000027476712,0.0026635318,0.000373269,0.00086569466,0.0000012191113,0.8884592,0.00078322156,0.000503271,0.09654688,0.005223819],"about_ca_topic_score_codex":0.00003603957,"about_ca_topic_score_gemma":0.000022714108,"teacher_disagreement_score":0.62430066,"about_ca_system_score_codex":0.0048393374,"about_ca_system_score_gemma":0.0007674562,"threshold_uncertainty_score":0.99964815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49268517,0.00012842058,0.5059935,0.000029137758,0.00033574153,0.0002477672,0.0000035428284,0.00006814615,0.00050859334],"genre_scores_gemma":[0.995506,0.0006624313,0.00320919,0.00012885075,0.00009489328,0.000004784516,0.000025729585,0.000020784366,0.00034733914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976446,0.0002619827,0.0002270411,0.0013519117,0.00007305791,0.00044139146],"domain_scores_gemma":[0.99825895,0.0004372426,0.00013919991,0.0009422439,0.000082096245,0.0001402865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022380553,0.00033212628,0.0004720482,0.00013227276,0.00008624653,0.00026296335,0.00080493523,0.00038734253,0.000019299207],"category_scores_gemma":[0.000034749937,0.00037005523,0.00007828269,0.0005716414,0.00020194164,0.0005966118,0.0015357459,0.0008033806,0.0000030671956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021993436,0.00031688498,0.057076667,0.00020845007,0.00026181157,0.01299791,0.000583273,0.8944406,0.000027757762,0.017372439,0.00012623267,0.016368026],"study_design_scores_gemma":[0.00088005577,0.00020568454,0.02219188,0.00049646315,0.00012169934,0.00013656158,0.00012371973,0.9669736,0.000034207405,0.007891961,0.000043888696,0.00090030255],"about_ca_topic_score_codex":0.00012744933,"about_ca_topic_score_gemma":0.0008707988,"teacher_disagreement_score":0.5028208,"about_ca_system_score_codex":0.00017611118,"about_ca_system_score_gemma":0.00019784359,"threshold_uncertainty_score":0.9998751},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05919794,0.0044289986,0.93304545,0.0007565117,0.0015053048,0.0005783967,0.0000037852399,0.0000608304,0.00042280767],"genre_scores_gemma":[0.99152213,0.0007005323,0.006161025,0.00040677213,0.0010425613,0.000053058386,7.345615e-7,0.000031739288,0.000081420185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997122,0.00036785973,0.0010613397,0.00040100256,0.00045916453,0.00058864424],"domain_scores_gemma":[0.9975215,0.00056522683,0.0008044025,0.00053759,0.0003198156,0.00025142333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016657488,0.00031281036,0.0006732892,0.00028782597,0.000115387054,0.0002549394,0.00091674604,0.00029735567,0.0000075923203],"category_scores_gemma":[0.000059577156,0.00021023005,0.00016887033,0.00037339522,0.00007871518,0.00060011103,0.00018279694,0.0004898095,0.0000028913903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005547866,0.0008860197,0.15531367,0.0008351011,0.0003937507,0.008006205,0.0021725586,0.43733585,0.03824724,0.0067784716,0.03268819,0.31678817],"study_design_scores_gemma":[0.00823452,0.0019022134,0.025211174,0.018889394,0.00011969072,0.0050229845,0.00044037247,0.9014793,0.0015703855,0.00065974175,0.034088336,0.0023818875],"about_ca_topic_score_codex":0.00006841626,"about_ca_topic_score_gemma":0.000060559458,"teacher_disagreement_score":0.93232423,"about_ca_system_score_codex":0.00019257746,"about_ca_system_score_gemma":0.00016357447,"threshold_uncertainty_score":0.85729325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002928078,0.00042135254,0.9884153,0.00043152028,0.0053083547,0.0012664197,0.0003159406,0.0008487918,0.00006422402],"genre_scores_gemma":[0.9723388,0.000032714575,0.02480189,0.00067703763,0.00062875444,0.0011648539,0.00013944435,0.00007628693,0.00014024966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561256,0.00036479547,0.0006874741,0.0012273357,0.0007139315,0.0013939204],"domain_scores_gemma":[0.9965301,0.0009380704,0.00031642892,0.0017831331,0.00011202226,0.00032023015],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00067344774,0.00053704996,0.0005201254,0.00013282691,0.0022889907,0.0003596283,0.0023480374,0.00020117972,0.00006522343],"category_scores_gemma":[0.000010015316,0.00063374476,0.000420098,0.0018845183,0.00009486493,0.00033902985,0.000081170074,0.0009263561,0.000008580807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012207423,0.00030863407,0.00014406118,0.000010161854,0.000057461144,0.000018677343,0.00005265028,0.72167885,0.000025320027,0.00017418624,0.0009451789,0.27646273],"study_design_scores_gemma":[0.0018867056,0.00037167888,0.000083740575,0.000059274433,0.00005350211,0.000030186744,0.0000488583,0.93722016,0.00010711729,0.0002574549,0.059261598,0.00061974366],"about_ca_topic_score_codex":0.0000764436,"about_ca_topic_score_gemma":0.00010043852,"teacher_disagreement_score":0.9694107,"about_ca_system_score_codex":0.0008398032,"about_ca_system_score_gemma":0.00018700567,"threshold_uncertainty_score":0.9996114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073600315,0.00026847134,0.9111658,0.0002791715,0.0005324705,0.00042101587,6.412048e-7,0.00029506296,0.013437064],"genre_scores_gemma":[0.9064206,0.00002459698,0.092644334,0.00012811091,0.00016951517,0.000104621075,0.0000015160134,0.000019800083,0.00048690548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788064,0.00006739228,0.00035300088,0.000941309,0.00030517884,0.00045247716],"domain_scores_gemma":[0.9982281,0.000068399226,0.00012819703,0.0014188613,0.00004836657,0.00010807427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003433375,0.00032577754,0.00035481495,0.00016331414,0.000028813287,0.00024593723,0.002170389,0.00018364607,0.0000674755],"category_scores_gemma":[0.0000075179587,0.00025896574,0.00006320899,0.00030906097,0.0000511788,0.00006553234,0.0025043457,0.00090091175,0.000054828724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008725005,0.00008730406,0.0006246493,0.000032553042,0.0000151225195,0.000054152493,0.00092726573,0.9415381,0.000015744527,0.009744908,0.00014513789,0.04680635],"study_design_scores_gemma":[0.00023318388,0.000057445923,0.0017847817,0.00043131513,0.000003171534,0.000023396728,0.000012499801,0.99621373,0.00016097561,0.00030791748,0.00038268062,0.00038892403],"about_ca_topic_score_codex":0.00012743626,"about_ca_topic_score_gemma":0.00033386284,"teacher_disagreement_score":0.8328203,"about_ca_system_score_codex":0.00024031248,"about_ca_system_score_gemma":0.00017424343,"threshold_uncertainty_score":0.99998623},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08373097,0.00003626787,0.91177607,0.0012722255,0.0003262124,0.00067274144,0.000008367972,0.00018726605,0.001989887],"genre_scores_gemma":[0.9141698,0.000042572858,0.08435833,0.00015345671,0.000016684382,0.00015861966,0.00004574743,0.00002869523,0.0010261184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963467,0.0016993012,0.00042006423,0.0007169365,0.00031255238,0.00050441775],"domain_scores_gemma":[0.9953784,0.0019904317,0.0002092326,0.0014651367,0.0007981613,0.00015864985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032082791,0.00021524442,0.00027492165,0.00013601535,0.00017142249,0.00029800314,0.0012312224,0.00018103684,0.00004302565],"category_scores_gemma":[0.00033845843,0.00023773489,0.00009671617,0.0005606655,0.00006604418,0.00032368704,0.00037422782,0.00033087737,0.000035460576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012330187,0.00022189153,0.0021134731,0.000022273829,0.000011195731,0.0000036000065,0.00085593073,0.0001744549,0.0023426558,0.91801333,0.00015135173,0.07607752],"study_design_scores_gemma":[0.000932604,0.0000016666352,0.00416915,0.00024192894,0.0000102818985,0.00001109377,0.000030617088,0.96852803,0.017552517,0.007806691,0.0004036531,0.00031179131],"about_ca_topic_score_codex":0.0004012269,"about_ca_topic_score_gemma":0.0019731522,"teacher_disagreement_score":0.96835357,"about_ca_system_score_codex":0.00013327181,"about_ca_system_score_gemma":0.00009273518,"threshold_uncertainty_score":0.96945477},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007296905,0.0012910897,0.9761201,0.002221622,0.00024172134,0.00057091843,0.000013175576,0.00022976346,0.012014699],"genre_scores_gemma":[0.8105047,0.00071549806,0.1870886,0.00018882242,0.00003176817,0.00010134911,0.00007966422,0.000046735666,0.0012428716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410236,0.0032515884,0.00065377116,0.0010123532,0.00050534646,0.00047460583],"domain_scores_gemma":[0.9924451,0.0012616899,0.0010078646,0.0027432356,0.002341335,0.00020078836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024661655,0.00042679152,0.0006963096,0.000111594716,0.00022071037,0.0005588208,0.0019078326,0.0003583379,0.000064580745],"category_scores_gemma":[0.00012591093,0.00040235338,0.00012508468,0.0004553909,0.00035638892,0.00034761106,0.0017641257,0.0004265383,0.000003254352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034300705,0.0004812643,0.0021680119,0.00014243528,0.00033370173,0.000011337638,0.0049450635,0.07842195,0.0001389551,0.85095686,0.0037695176,0.058596596],"study_design_scores_gemma":[0.0009659891,0.0000024506157,0.00053648883,0.0014413733,0.000050361687,0.00001851612,0.000029492743,0.98918915,0.0013221698,0.0041266964,0.0017991227,0.0005181952],"about_ca_topic_score_codex":0.0008971981,"about_ca_topic_score_gemma":0.00047538485,"teacher_disagreement_score":0.9107672,"about_ca_system_score_codex":0.0000620924,"about_ca_system_score_gemma":0.00025021858,"threshold_uncertainty_score":0.9998428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79904884,0.0009266084,0.19596449,0.000091403446,0.00017547025,0.0037385854,0.000002595392,0.000020280364,0.000031710588],"genre_scores_gemma":[0.99819934,0.00008324723,0.0006632974,0.000024839448,0.000728913,0.00024817736,4.5290915e-7,0.000018183746,0.000033521257],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9969849,0.00050158845,0.0010924643,0.000483506,0.00047188211,0.0004656894],"domain_scores_gemma":[0.99733174,0.00069210905,0.0010474782,0.00038566135,0.00025314567,0.00028989176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018916196,0.00030625326,0.0012252374,0.00030425887,0.0001641725,0.00043832112,0.00044212854,0.00015775466,0.0000017158806],"category_scores_gemma":[0.000023652727,0.00018417106,0.00007347834,0.0006724748,0.00009178358,0.00057377457,0.00018326179,0.0003800498,2.8336933e-7],"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.00005096056,0.00008499341,0.97766954,0.000033565386,0.00035749993,0.000121818026,0.0014274011,0.0097911265,0.000014972276,0.00007219525,0.00019868882,0.010177237],"study_design_scores_gemma":[0.003996177,0.0034111831,0.8488685,0.0017796393,0.0004930825,0.00044087708,0.00134594,0.13851044,0.000010850437,0.000038208247,0.00053908775,0.00056605326],"about_ca_topic_score_codex":0.00022551912,"about_ca_topic_score_gemma":0.0007925381,"teacher_disagreement_score":0.1991505,"about_ca_system_score_codex":0.00006870259,"about_ca_system_score_gemma":0.00006350897,"threshold_uncertainty_score":0.75102776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25100207,0.0068433443,0.69662356,0.038502198,0.00012946651,0.00061335403,0.0000036208464,0.00041492988,0.0058674514],"genre_scores_gemma":[0.90626156,0.0017829377,0.09023293,0.00029253334,0.000015658417,0.00005249328,0.0000096582535,0.000016728605,0.0013355183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973463,0.0011536609,0.00032054077,0.00057009386,0.00025143963,0.00035799496],"domain_scores_gemma":[0.99667126,0.00038089833,0.000105708314,0.0020866175,0.00065065577,0.00010483594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022725305,0.00018965793,0.00018290673,0.00016016002,0.0009397814,0.00059823797,0.001664632,0.00012515672,0.0000098234195],"category_scores_gemma":[0.00017623951,0.00016555624,0.00005606741,0.0010185264,0.00027034042,0.00043844493,0.00069859985,0.00037271087,0.000016841572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002537185,0.00023502682,0.00018147414,0.0000092696155,0.000019526891,0.000007146653,0.0037228086,0.0016112336,0.0062326645,0.34364274,0.00020245842,0.64413315],"study_design_scores_gemma":[0.0004631122,0.0000033821818,0.0006534903,0.0005927995,0.000028031533,0.000091116526,0.0004103621,0.95539844,0.017174503,0.008587022,0.016186891,0.00041085907],"about_ca_topic_score_codex":0.00012532633,"about_ca_topic_score_gemma":0.0007115752,"teacher_disagreement_score":0.9537872,"about_ca_system_score_codex":0.000066762004,"about_ca_system_score_gemma":0.00008063663,"threshold_uncertainty_score":0.7228134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09084766,0.0022913858,0.8963561,0.0012031207,0.00038642337,0.00051492365,0.000002469808,0.00041725597,0.007980648],"genre_scores_gemma":[0.9581906,0.00039387125,0.03970689,0.0002996726,0.000048869584,0.00017242778,0.00003129666,0.000033659904,0.001122694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949005,0.002736501,0.00050848786,0.00085206487,0.00039816904,0.0006042552],"domain_scores_gemma":[0.9952324,0.0009171607,0.00028774785,0.002394191,0.0009598639,0.000208616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003986406,0.0002775394,0.00027276773,0.00027808239,0.0003885576,0.00040403302,0.0018246528,0.00020798846,0.000100296274],"category_scores_gemma":[0.00022640683,0.0003031341,0.00013518785,0.0018351992,0.0003014077,0.00048100614,0.0005112049,0.00043944316,0.000119716795],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003228562,0.00066571083,0.0017048337,0.000025194337,0.000025349114,0.0000132268,0.0031913794,0.0059451666,0.001587713,0.009572121,0.0016275432,0.9756095],"study_design_scores_gemma":[0.0010458891,0.0000053898857,0.0053306813,0.00043285263,0.000009443358,0.000012170129,0.000034285957,0.89280325,0.028289525,0.00090704946,0.070629925,0.00049952755],"about_ca_topic_score_codex":0.00010891388,"about_ca_topic_score_gemma":0.0069180643,"teacher_disagreement_score":0.97510993,"about_ca_system_score_codex":0.000136015,"about_ca_system_score_gemma":0.00011473541,"threshold_uncertainty_score":0.99994206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50680614,0.0045542573,0.4861721,0.000086382846,0.00120299,0.00085275894,0.000009843651,0.00006156401,0.00025394626],"genre_scores_gemma":[0.9866375,0.0019166314,0.010761307,0.00014460874,0.00025181772,0.0001884779,0.000013850416,0.00005677675,0.000029063995],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961375,0.0003341093,0.0012603794,0.0008186224,0.00069386367,0.0007555213],"domain_scores_gemma":[0.99599844,0.0006078643,0.0013333131,0.0012389355,0.000498276,0.00032314987],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026764306,0.00041622156,0.000982185,0.00077766326,0.00025851504,0.0011904535,0.006334957,0.0002948542,0.00045161776],"category_scores_gemma":[0.00015564678,0.00041707506,0.00023828003,0.0016016952,0.00018074833,0.0042381044,0.00069190544,0.0008225948,0.0000020093673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031350664,0.000632643,0.02187361,0.00013717296,0.00007912135,0.00001681042,0.00030238263,0.05599281,0.5079304,0.000547472,0.0029369176,0.40923712],"study_design_scores_gemma":[0.0021996666,0.00009057459,0.10115531,0.0009296257,0.00004974524,0.000008948533,0.000033567,0.7042512,0.18646227,0.0027417673,0.0011898383,0.00088748866],"about_ca_topic_score_codex":0.00016963482,"about_ca_topic_score_gemma":0.00041807521,"teacher_disagreement_score":0.6482584,"about_ca_system_score_codex":0.000093185045,"about_ca_system_score_gemma":0.00025669776,"threshold_uncertainty_score":0.9998464},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031965706,0.022090664,0.754201,0.0008504064,0.0009948101,0.1856475,0.0000051951956,0.0013783933,0.0028663152],"genre_scores_gemma":[0.29275972,0.00028814713,0.0177695,0.003363608,0.0003976203,0.68390733,0.000011669566,0.00014609574,0.0013563163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966974,0.0002877156,0.0004462187,0.0007902086,0.0004853663,0.0012930381],"domain_scores_gemma":[0.9985273,0.00012181964,0.00014490036,0.0010070396,0.000042209114,0.00015672023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103816,0.00025744626,0.0002840021,0.00014999456,0.0003311377,0.00015759248,0.0017847575,0.00008497058,0.00010146201],"category_scores_gemma":[0.000022682058,0.00029343064,0.00009612798,0.001748222,0.00001870021,0.00023415103,0.0013898544,0.0011480977,0.000045245524],"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.000051491,0.00008446483,0.00021699532,0.0000070953897,0.000009731197,0.000038123453,0.00046764247,0.43602937,0.00014881842,0.0012500442,0.0055738837,0.55612236],"study_design_scores_gemma":[0.000609753,0.0010886801,0.000118288226,0.0000136428125,0.0000025403037,0.00002542362,0.000021647566,0.28137624,0.00033546932,0.0006602538,0.7154051,0.00034293297],"about_ca_topic_score_codex":0.0000025397446,"about_ca_topic_score_gemma":0.00023897823,"teacher_disagreement_score":0.7364315,"about_ca_system_score_codex":0.0008818049,"about_ca_system_score_gemma":0.00031828476,"threshold_uncertainty_score":0.9999518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058010843,0.0000469125,0.93946236,0.00010253393,0.00032650254,0.0014987789,0.00036153354,0.000105064006,0.000085440704],"genre_scores_gemma":[0.91487694,0.000001053578,0.08244778,0.00034753175,0.000028928907,0.001542441,0.00074377126,0.000009363129,0.0000021972442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805903,0.000119974764,0.0009427935,0.0002121062,0.00030691826,0.00035917552],"domain_scores_gemma":[0.9982111,0.0002625129,0.0007037682,0.00041056014,0.00035486734,0.00005718218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014210844,0.00016821193,0.00027298406,0.00023421212,0.0003168731,0.00012542587,0.0006093356,0.0000797092,0.000010328844],"category_scores_gemma":[0.00017408594,0.00018514466,0.00013605886,0.0010234535,0.000036668313,0.0019807206,0.00017940799,0.00012789507,0.0000012552254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012415138,0.0005830384,0.014082082,0.0073483936,0.00009112094,0.0000016045749,0.015632637,0.104610264,0.00156705,0.47556603,0.0009657191,0.37831056],"study_design_scores_gemma":[0.0019373742,0.00018524067,0.014544393,0.000039538932,0.00000813594,0.000002083533,0.0002781282,0.97697264,0.0008228158,0.0027445273,0.0022417386,0.00022340086],"about_ca_topic_score_codex":0.000254454,"about_ca_topic_score_gemma":0.00009484496,"teacher_disagreement_score":0.8723624,"about_ca_system_score_codex":0.00035525774,"about_ca_system_score_gemma":0.00015056775,"threshold_uncertainty_score":0.754998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00703257,0.0003978571,0.9557614,0.000014994225,0.00085903885,0.03555574,0.0000028433592,0.00018605006,0.00018954692],"genre_scores_gemma":[0.4492655,0.000024673343,0.17863117,0.0008243868,0.0007598966,0.37026876,0.0000034624243,0.00010772646,0.00011440277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971726,0.00034603398,0.00049770874,0.00077182567,0.0004994978,0.0007123506],"domain_scores_gemma":[0.9986391,0.00012776916,0.00026880487,0.00078976655,0.000062064806,0.00011249654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005497049,0.00024668156,0.00028769468,0.00016661825,0.00038256458,0.0003566405,0.002647799,0.00007678695,0.00008888753],"category_scores_gemma":[0.0000058989217,0.00027326454,0.0000798624,0.0015620067,0.000042801363,0.00083001354,0.0017595195,0.00063767174,0.0000060867874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011446229,0.00007002068,0.0004185613,0.000004102642,0.000007212749,0.000104871644,0.00020979856,0.668448,0.000011934829,0.000036808593,0.00017082706,0.33050644],"study_design_scores_gemma":[0.00063234416,0.00017904222,0.0008014775,0.000031379932,0.0000041114627,0.000044693108,0.000048651036,0.9933096,0.00009850027,0.00042977522,0.004097405,0.0003230311],"about_ca_topic_score_codex":0.00007081264,"about_ca_topic_score_gemma":0.000027291188,"teacher_disagreement_score":0.7771302,"about_ca_system_score_codex":0.0003697971,"about_ca_system_score_gemma":0.00016676355,"threshold_uncertainty_score":0.9999719},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014330411,0.026588859,0.21026611,0.21992718,0.0023228172,0.0020410733,0.00009005298,0.0012880448,0.52314544],"genre_scores_gemma":[0.891507,0.017772367,0.084205106,0.0022600135,0.000087672975,0.00039339653,0.000077140445,0.000041207597,0.0036560784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975831,0.00029149462,0.00078200933,0.0005002339,0.0004182739,0.00042486924],"domain_scores_gemma":[0.99382573,0.00059315364,0.0002772575,0.004851707,0.00034013548,0.000112010544],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043046597,0.00025915395,0.00024939788,0.0004327197,0.00035065637,0.00061619596,0.00888942,0.00013339437,0.0003755093],"category_scores_gemma":[0.000077991426,0.00029497428,0.00011753665,0.0014592735,0.000112995345,0.002272495,0.0022591914,0.0006186284,0.0008271512],"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.000033386234,0.007942951,0.009618374,0.00008283649,0.0006751314,0.00004665285,0.019707879,0.013116675,0.013337194,0.75938773,0.059867356,0.11618385],"study_design_scores_gemma":[0.0011254657,0.000086668675,0.004566008,0.00027896464,0.000021891512,0.00008614477,0.0002812007,0.5790578,0.0006621272,0.0022985453,0.4106418,0.0008933857],"about_ca_topic_score_codex":0.00014069016,"about_ca_topic_score_gemma":0.0030278072,"teacher_disagreement_score":0.8771766,"about_ca_system_score_codex":0.00034016962,"about_ca_system_score_gemma":0.000053085707,"threshold_uncertainty_score":0.9999508},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002814938,0.0010028566,0.9940011,0.00019262164,0.00088247214,0.00027089054,4.818388e-7,0.00021094302,0.0006236881],"genre_scores_gemma":[0.06275241,0.000027522201,0.9357023,0.0007355179,0.00020790659,0.000029043747,0.0000018190724,0.000024601126,0.0005188664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976943,0.0003276285,0.00039048193,0.0005960765,0.0003527846,0.0006387295],"domain_scores_gemma":[0.99887615,0.0002637716,0.00012881175,0.00056852703,0.000022253393,0.00014047422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821325,0.00018327624,0.0002790988,0.00012904506,0.00028567002,0.00015866825,0.001057957,0.000059875012,0.000136762],"category_scores_gemma":[0.000017612907,0.00019884722,0.000072948234,0.0012632482,0.000012647055,0.0003435592,0.0019219958,0.0005510496,0.0000034471273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030328022,0.000021285712,0.00017036663,0.0000012662683,0.00000721981,0.00006863934,0.00033506012,0.48817015,0.000074981035,0.0018294463,0.0003849287,0.5089336],"study_design_scores_gemma":[0.0003656243,0.000067848385,0.0003121031,0.000015530839,0.000004060646,0.000081494996,0.000088821376,0.9933975,0.00005601532,0.0004561186,0.0049156765,0.00023925045],"about_ca_topic_score_codex":0.00037048865,"about_ca_topic_score_gemma":0.000087636654,"teacher_disagreement_score":0.50869435,"about_ca_system_score_codex":0.00034663352,"about_ca_system_score_gemma":0.0001693433,"threshold_uncertainty_score":0.8108754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98527795,0.0003751011,0.011791239,0.00015827981,0.00045460855,0.00021317168,0.0000012207269,0.0007023531,0.0010260858],"genre_scores_gemma":[0.9979508,0.00034419636,0.0008377925,0.00025889155,0.000048529535,0.000020988819,0.000016636024,0.000018237399,0.0005039376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984104,0.00013149,0.0001368081,0.0003730012,0.0002541441,0.00069414853],"domain_scores_gemma":[0.9988359,0.00043513792,0.000059278213,0.00058077584,0.000024931349,0.000063951804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009779067,0.00013368108,0.00013092732,0.00009018945,0.00013576976,0.00010246451,0.00069666456,0.000059563674,0.0000047158755],"category_scores_gemma":[0.00006113769,0.00013150305,0.000039365827,0.0010750776,0.000015699552,0.0001666053,0.00015128769,0.00033384634,0.00056573824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044826847,0.00009084639,0.01585337,0.000035712714,0.00007565794,0.00005257368,0.00061655446,0.09795241,0.00023310093,0.010890741,0.04493354,0.82922065],"study_design_scores_gemma":[0.00030687038,0.0007263663,0.097409144,0.000029872936,0.0000032904024,0.000009746861,0.000003591749,0.88752,0.0020384742,0.0005256432,0.011074512,0.00035249247],"about_ca_topic_score_codex":0.000010443788,"about_ca_topic_score_gemma":0.00010587404,"teacher_disagreement_score":0.82886815,"about_ca_system_score_codex":0.00010621874,"about_ca_system_score_gemma":0.00007492988,"threshold_uncertainty_score":0.7271609},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075221914,0.00087931997,0.9888142,0.000108883156,0.0007679151,0.0007161125,6.932771e-7,0.0004813393,0.00070939376],"genre_scores_gemma":[0.90568775,0.000030406654,0.0918828,0.00044133078,0.0004344797,0.00052300387,0.0000115525945,0.000020809335,0.0009678421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987047,0.000039819566,0.00025168134,0.0004452187,0.00017839823,0.00038023602],"domain_scores_gemma":[0.99901515,0.00017123639,0.00008898468,0.0005675631,0.00009043405,0.00006661548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002642466,0.00015375306,0.00014645958,0.00007272218,0.00017784646,0.00014813677,0.00047778973,0.00012080679,0.00003733524],"category_scores_gemma":[0.0000064346755,0.00013898395,0.00010129905,0.00040826303,0.000026837732,0.0002836701,0.00011102562,0.00010851741,0.000028806158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026887019,0.000076215125,0.000044690893,0.000007999498,0.0000037895609,0.0000023511175,0.000009266306,0.19880722,0.0007615094,0.003436514,0.0056351344,0.7911884],"study_design_scores_gemma":[0.0005180297,0.00025119242,0.00023674296,0.000008970301,0.0000044108065,0.0000030852461,0.000002452009,0.89482486,0.0052776514,0.0008941158,0.09780078,0.00017772311],"about_ca_topic_score_codex":0.000025048863,"about_ca_topic_score_gemma":0.00036390702,"teacher_disagreement_score":0.8981656,"about_ca_system_score_codex":0.00007522551,"about_ca_system_score_gemma":0.000032415915,"threshold_uncertainty_score":0.56676006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033780495,0.0000068662494,0.9234576,0.00027032045,0.0007031144,0.070864655,0.00003900587,0.0005935874,0.00068678026],"genre_scores_gemma":[0.6557329,5.568595e-7,0.010242659,0.0007494307,0.00043911044,0.33232728,0.0000072243333,0.00006016583,0.00044066206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974262,0.000048857728,0.0003995155,0.0009070922,0.0004691879,0.0007491605],"domain_scores_gemma":[0.99792194,0.00055955444,0.0002698408,0.0009168487,0.00018176874,0.00015006552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049202284,0.00030488975,0.0002925184,0.000109845234,0.00032662382,0.00085683947,0.0021165856,0.00012743396,0.000010345264],"category_scores_gemma":[0.00006277572,0.00027811065,0.00012921014,0.00092358695,0.00007626519,0.00084805576,0.00026262132,0.00023226987,0.00008847135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048024794,0.0021648186,0.008406934,0.0015746847,0.00037130355,0.00052220153,0.0022446837,0.6369644,0.009492874,0.1103673,0.08847649,0.13461183],"study_design_scores_gemma":[0.004678746,0.00053294736,0.012429583,0.00041062143,0.000008977598,0.0000044673407,0.000006970602,0.94963646,0.011795035,0.002773004,0.016976861,0.00074632966],"about_ca_topic_score_codex":0.000013620843,"about_ca_topic_score_gemma":0.00005857468,"teacher_disagreement_score":0.913215,"about_ca_system_score_codex":0.00011308649,"about_ca_system_score_gemma":0.00018893786,"threshold_uncertainty_score":0.9999671},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33037382,0.000020556474,0.66480356,0.0018477901,0.0007786467,0.00039446878,0.000009221992,0.0017553826,0.000016525415],"genre_scores_gemma":[0.9950188,0.000085426305,0.003908352,0.00016532726,0.000055949917,0.0004637269,0.0000073655633,0.000036038095,0.00025904382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982053,0.000053130698,0.00031113252,0.000649254,0.00023514303,0.00054603716],"domain_scores_gemma":[0.9987218,0.00013902609,0.00008330199,0.0008790339,0.000107288804,0.00006956378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025551117,0.00023496976,0.00029311093,0.00067714055,0.0003547861,0.00008686612,0.0007761769,0.0004278946,0.000012752091],"category_scores_gemma":[0.000004770762,0.00024401615,0.0001804464,0.0016312606,0.00017423386,0.0002789926,0.000012653997,0.00043725516,0.00031468685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047340025,0.00052905973,0.00005688824,0.000082085906,0.0002367349,0.00015377351,0.00036565884,0.05241771,0.09678989,0.043691345,0.0029021439,0.80272734],"study_design_scores_gemma":[0.0016926926,0.00080690713,0.0005731836,0.00010264048,0.00005912108,0.0001808848,0.0002248634,0.853033,0.12469906,0.010911385,0.007020777,0.00069549534],"about_ca_topic_score_codex":0.000012613296,"about_ca_topic_score_gemma":0.00003631894,"teacher_disagreement_score":0.8020319,"about_ca_system_score_codex":0.00009924161,"about_ca_system_score_gemma":0.000040245708,"threshold_uncertainty_score":0.99506897},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.839503e-11,0.86864185,0.09079609,0.000061494706,0.00009595242,0.038144447,0.0000045484007,0.0003333732,0.0019222231],"genre_scores_gemma":[1.9457758e-9,0.94711685,0.00911391,0.0010595707,0.00010163732,0.04193257,0.000024406449,0.000046276535,0.0006048014],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99673456,0.0003680164,0.0013666267,0.0006998526,0.00042445224,0.00040650772],"domain_scores_gemma":[0.99657315,0.0004372692,0.0008302291,0.0019408914,0.000118454445,0.000100014964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014421432,0.0004134231,0.0023279993,0.0001348488,0.000037215934,0.00008109007,0.0026334713,0.00020816557,0.000116777184],"category_scores_gemma":[0.00012836308,0.00030196732,0.0006511328,0.001647945,0.000030652227,0.000118738724,0.0006307532,0.0004969451,0.00047972234],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.992023e-8,0.000011595463,9.023797e-8,0.30579713,0.000018947258,0.000008896434,9.258071e-7,0.0000020162518,1.7572228e-9,0.0051385392,0.014870621,0.6741512],"study_design_scores_gemma":[0.00003392236,0.00002653171,2.219205e-8,0.3966082,0.000050012608,0.0000066376115,4.846409e-8,0.001774589,1.6404977e-7,0.00004166471,0.60128343,0.00017479426],"about_ca_topic_score_codex":0.000011523551,"about_ca_topic_score_gemma":0.000002708835,"teacher_disagreement_score":0.67397636,"about_ca_system_score_codex":0.00007008766,"about_ca_system_score_gemma":0.0008237723,"threshold_uncertainty_score":0.99994326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012752078,0.000035900408,0.96095926,0.00018506493,0.00035165413,0.030501043,5.439257e-7,0.0013078102,0.0053835474],"genre_scores_gemma":[0.64526993,0.00004185057,0.008946378,0.0019907579,0.00020680882,0.34210777,0.000016562744,0.000045773162,0.0013741354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998244,0.00014517878,0.00031257363,0.000520659,0.00027735354,0.0005002416],"domain_scores_gemma":[0.99884665,0.00029218823,0.00008590043,0.0006553188,0.00003090578,0.000089009314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055291434,0.00016602395,0.0001666432,0.00018469169,0.00008191626,0.00013100004,0.00058990635,0.000118134085,0.0001293773],"category_scores_gemma":[0.000016158094,0.00015229301,0.000054701293,0.0010490409,0.00002610989,0.00021726104,0.00021867063,0.00019552,0.00016018178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023684664,0.00007348102,0.0014986641,0.000010923263,0.0000027144508,0.000040664276,0.000044149107,0.5989679,0.000021484757,0.008301068,0.0035185332,0.3874967],"study_design_scores_gemma":[0.00067507563,0.0001537153,0.002113346,0.000070512724,6.761164e-7,0.0000012088937,0.000004963221,0.9764175,0.00013190259,0.00017309815,0.020081623,0.00017641441],"about_ca_topic_score_codex":0.000010361857,"about_ca_topic_score_gemma":0.00010566286,"teacher_disagreement_score":0.95201284,"about_ca_system_score_codex":0.000087888926,"about_ca_system_score_gemma":0.000051558767,"threshold_uncertainty_score":0.62103283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009490726,1.4021418e-7,0.88861305,0.00048704245,0.00013030192,0.027488207,4.0452957e-8,0.0014371744,0.08174912],"genre_scores_gemma":[0.8241153,3.1305248e-7,0.04287748,0.0013890659,0.00016858785,0.10865665,0.0000055502514,0.000036200632,0.02275085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852914,0.00004629758,0.0002374469,0.0003747627,0.00037202463,0.00044034093],"domain_scores_gemma":[0.9990781,0.00016325327,0.0000744837,0.0005493451,0.000045678793,0.000089128196],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061115075,0.0001244978,0.000108762426,0.00009542757,0.00020114552,0.00016476467,0.0005123698,0.000048029287,0.00015652287],"category_scores_gemma":[0.00008379451,0.000106197214,0.00004665299,0.0007210623,0.000013349134,0.00018904434,0.00028192054,0.00022695347,0.0011296879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000773844,0.00001715161,0.00050427235,0.000012766012,0.0000025680679,0.000016138525,0.00007227214,0.97002244,0.00006012581,0.014305514,0.004221565,0.010757456],"study_design_scores_gemma":[0.00050047965,0.00018089564,0.00024879712,0.000054826734,7.510836e-7,5.860946e-7,0.000012915917,0.97111857,0.0007903899,0.000051025592,0.026908848,0.00013188565],"about_ca_topic_score_codex":0.000032106633,"about_ca_topic_score_gemma":0.0000021096362,"teacher_disagreement_score":0.8457356,"about_ca_system_score_codex":0.000058286987,"about_ca_system_score_gemma":0.00005013718,"threshold_uncertainty_score":0.99964803},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022953236,0.000016693162,0.9734802,0.0010662071,0.000083227846,0.0009290366,0.000007657339,0.00020271433,0.0012609772],"genre_scores_gemma":[0.72662187,0.0000056343442,0.2722485,0.0005994947,0.00009747599,0.00015954411,0.000025303589,0.000024839454,0.00021732379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767065,0.00021561641,0.0004766261,0.00053993956,0.0004597147,0.00063743914],"domain_scores_gemma":[0.9973714,0.00146704,0.000118382355,0.0008018583,0.0001639456,0.000077377845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037533683,0.00016570263,0.00027441722,0.000103023325,0.00016767153,0.00013218888,0.0012784745,0.000049865514,0.0000060635334],"category_scores_gemma":[0.000059532245,0.00011063796,0.000054755812,0.0010382014,0.000056740344,0.00024195871,0.000665144,0.0002793738,0.00001548495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014676606,0.0007121472,0.012921156,0.0009075338,0.00021128028,0.0000746303,0.015320204,0.2019373,0.0009095223,0.18692884,0.0029725893,0.576958],"study_design_scores_gemma":[0.0005748104,0.00006285708,0.002975988,0.00003135878,0.00000347276,0.000009973716,0.0007129427,0.99485636,0.000318144,0.00021041447,0.00007766291,0.00016601138],"about_ca_topic_score_codex":0.00092548516,"about_ca_topic_score_gemma":0.00022551209,"teacher_disagreement_score":0.79291904,"about_ca_system_score_codex":0.000041629828,"about_ca_system_score_gemma":0.00007069533,"threshold_uncertainty_score":0.4511685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008369076,0.000054309137,0.9844954,0.0024019447,0.00068347674,0.0009895717,0.000004543537,0.0009158048,0.0020858846],"genre_scores_gemma":[0.77553755,0.000034109617,0.21392667,0.000886753,0.00081238186,0.00046763266,0.000021103368,0.000065247135,0.008248543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793,0.00003919755,0.00030998755,0.00064438616,0.00035987745,0.00071656296],"domain_scores_gemma":[0.998526,0.0003570888,0.00009778116,0.00071736303,0.00012768319,0.00017410258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004566352,0.0002155033,0.00021114315,0.00010216967,0.00017736449,0.00015576759,0.0007170357,0.000062628715,0.000021977],"category_scores_gemma":[0.000026537371,0.00015645548,0.00008125085,0.0007475178,0.000039459566,0.00012592875,0.00043071713,0.00015314226,0.0002812389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005828451,0.00014509316,0.00045558103,0.00007107793,0.0001027427,0.000087751316,0.001917718,0.24265516,0.00022848527,0.05842326,0.008998199,0.6868567],"study_design_scores_gemma":[0.0008006634,0.00019433963,0.001932132,0.00004938735,0.000009605932,0.00000747603,0.000028041813,0.988568,0.0007630806,0.0002626502,0.007135276,0.00024934247],"about_ca_topic_score_codex":0.00002132387,"about_ca_topic_score_gemma":0.000032183918,"teacher_disagreement_score":0.7705687,"about_ca_system_score_codex":0.00007390995,"about_ca_system_score_gemma":0.00006632081,"threshold_uncertainty_score":0.6380069},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000072509305,0.0011554193,0.68122226,0.00037167597,0.0008376242,0.00037669804,0.000004490175,0.00018884613,0.31577048],"genre_scores_gemma":[0.40144587,0.002303504,0.5890392,0.0023831164,0.0003200982,0.0000302532,0.0000636442,0.000058865833,0.0043554185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764955,0.00003156307,0.0008905649,0.00046337198,0.0005871568,0.00037779193],"domain_scores_gemma":[0.9962827,0.00024330943,0.00034075757,0.002660268,0.00032993685,0.00014305761],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012799095,0.00030811352,0.00031287005,0.0010458159,0.00058427785,0.0016146069,0.004248557,0.00013290512,0.0000058445125],"category_scores_gemma":[0.000026772808,0.0003120917,0.00006847741,0.0007127255,0.00078918476,0.004537182,0.0072462563,0.00070044637,0.00009106814],"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":[4.7474526e-7,0.0000065867534,0.000012045178,0.00004025476,0.000005850005,0.0000010311358,0.0014118167,0.0046641105,0.0000018821924,0.882499,0.0001526136,0.111204326],"study_design_scores_gemma":[0.00010012816,0.000017382614,0.000082728155,0.0005391801,0.0000074340373,0.000033731714,0.000019207448,0.8676025,0.0000030355252,0.012857349,0.118437365,0.00029990575],"about_ca_topic_score_codex":0.000013909707,"about_ca_topic_score_gemma":0.000008895105,"teacher_disagreement_score":0.86964166,"about_ca_system_score_codex":0.00030544735,"about_ca_system_score_gemma":0.00029713823,"threshold_uncertainty_score":0.9999331},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033450618,0.000497722,0.99321586,0.0005501098,0.0008918515,0.00047922818,0.0000073168217,0.0004535398,0.0005593211],"genre_scores_gemma":[0.95745796,0.00005438496,0.04124934,0.00030419568,0.00011473388,0.000079560814,0.000021223066,0.0000717849,0.0006467996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661875,0.00020098904,0.0006766572,0.0011762108,0.00049698725,0.0008303964],"domain_scores_gemma":[0.9977886,0.00060639257,0.00020243188,0.00096844067,0.00016360494,0.00027053955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063366856,0.00042633244,0.0003884545,0.00021641022,0.00055562635,0.00042393588,0.0007726538,0.00018318632,0.000085077474],"category_scores_gemma":[0.000020166588,0.00037701352,0.00017838515,0.001795688,0.00008809967,0.00023687848,0.00013783995,0.00044926,0.000073200215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057679732,0.00013148673,9.676278e-7,0.000046369856,0.000030386183,0.00011406128,0.00043337015,0.84150213,0.0011642501,0.10106296,0.0000859354,0.05537039],"study_design_scores_gemma":[0.000083787265,0.00044546236,0.0000043459518,0.0018811638,0.00005440546,0.000055718647,0.000116346586,0.99179506,0.0028696007,0.001027732,0.001200377,0.00046602666],"about_ca_topic_score_codex":0.000037281185,"about_ca_topic_score_gemma":0.00003461966,"teacher_disagreement_score":0.9541129,"about_ca_system_score_codex":0.000394208,"about_ca_system_score_gemma":0.00038605786,"threshold_uncertainty_score":0.99986815},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.038302e-8,0.76898587,0.22467168,0.000022985245,0.0015690838,0.0031924972,0.000022013184,0.00026531695,0.0012705508],"genre_scores_gemma":[9.995795e-7,0.94670564,0.050057188,0.00014329789,0.00034891668,0.0011880703,0.000022073484,0.00018940635,0.0013443882],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936618,0.00078823406,0.002868394,0.0010004188,0.0007763238,0.0009048031],"domain_scores_gemma":[0.99511003,0.000388073,0.0022703449,0.0016532498,0.00025085724,0.00032746323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002678991,0.0009993073,0.0034717384,0.0005128143,0.00022403814,0.00068176235,0.003426234,0.00033541524,0.00005934246],"category_scores_gemma":[0.00006652692,0.00071677717,0.0022202341,0.0016680987,0.00013527018,0.00047711574,0.0011877748,0.0010737225,0.00012681786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013126086,0.000052828193,3.132726e-8,0.22524229,0.00067718845,0.000115514726,0.00004180093,0.00010728867,3.2513552e-9,0.0030379689,0.040476974,0.7302468],"study_design_scores_gemma":[0.000112783106,0.00022885695,0.000002439944,0.29868084,0.0014891144,0.0012129246,0.0000050531207,0.012037816,1.5607085e-8,0.00087790255,0.68490136,0.00045090987],"about_ca_topic_score_codex":2.1724982e-7,"about_ca_topic_score_gemma":5.606032e-7,"teacher_disagreement_score":0.7297959,"about_ca_system_score_codex":0.00045820372,"about_ca_system_score_gemma":0.00033433212,"threshold_uncertainty_score":0.99952835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029511668,0.00064284314,0.99550223,0.00008296782,0.00013571273,0.00025209752,9.988245e-7,0.000418424,0.000013579336],"genre_scores_gemma":[0.3470203,0.000058682977,0.65245956,0.000019952753,0.00020069687,0.00014479409,0.0000054053276,0.00003733865,0.00005328987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986681,0.000021974707,0.00029625214,0.0004699111,0.00012291237,0.00042087364],"domain_scores_gemma":[0.9995462,0.00015834118,0.000023832878,0.00012701513,0.000025614781,0.00011905405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043587547,0.0002046931,0.00022922094,0.00011171827,0.00008301372,0.0003988683,0.00012593449,0.00013545365,0.0000014298749],"category_scores_gemma":[0.0000028397712,0.00019845902,0.000034448643,0.0002981683,0.000010282144,0.0004047954,0.000056283207,0.00021643317,0.0000012080422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023435064,0.0000188807,0.0000034155014,0.00026812364,0.000014362046,0.0000016984338,0.00023631116,0.9531006,0.00003022047,0.01631406,0.0000147221,0.029995263],"study_design_scores_gemma":[0.00016656057,0.00011625027,0.0000021963347,0.0005030755,0.000012160501,0.0000677463,0.0000024210049,0.9882034,0.00002575448,0.010353542,0.00032111647,0.00022574617],"about_ca_topic_score_codex":0.000018131215,"about_ca_topic_score_gemma":0.000005575813,"teacher_disagreement_score":0.34406912,"about_ca_system_score_codex":0.000048477716,"about_ca_system_score_gemma":0.000014680543,"threshold_uncertainty_score":0.8092924},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016167329,0.0000037753846,0.6235465,0.000056612804,0.00074385945,0.06860656,2.9094429e-7,0.00079857005,0.30622765],"genre_scores_gemma":[0.37743038,7.9383693e-7,0.041470807,0.0005797031,0.00059952604,0.41926783,0.00023348579,0.00016812659,0.16024937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763685,0.0000853859,0.00043766902,0.00080160657,0.00063102564,0.00040747647],"domain_scores_gemma":[0.9988023,0.0001742014,0.00022748808,0.00057266,0.00012273696,0.000100634585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034506866,0.00037218168,0.00026790274,0.00018906915,0.00015642979,0.00038902438,0.00071466697,0.00023529722,0.0002112342],"category_scores_gemma":[0.00005469916,0.00031953977,0.00014794311,0.00038736223,0.000010470991,0.00016235518,0.000115847724,0.00097511016,0.0005711284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018313288,0.00009360534,0.000012271942,0.00042189404,0.000076036,0.00011163254,0.0022067958,0.7734646,0.000045412526,0.09051842,0.0031545816,0.12971157],"study_design_scores_gemma":[0.0003105059,0.0004104899,0.00003143058,0.00088033703,0.000011709394,7.0179243e-7,0.00017987074,0.99186707,0.00050127355,0.00009081156,0.0053682346,0.00034755393],"about_ca_topic_score_codex":0.000054428227,"about_ca_topic_score_gemma":0.000050564668,"teacher_disagreement_score":0.5820757,"about_ca_system_score_codex":0.00018455504,"about_ca_system_score_gemma":0.00023451091,"threshold_uncertainty_score":0.9999257},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002842459,0.104350984,0.049393922,0.0012722362,0.008630077,0.00047857556,0.000015425758,0.001150488,0.8347055],"genre_scores_gemma":[0.0010593348,0.06576016,0.0014333227,0.00067506824,0.013701256,0.00008696152,0.00007092632,0.00022034861,0.9169926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976376,0.000022813176,0.00040002124,0.0011207456,0.0003275862,0.0004911947],"domain_scores_gemma":[0.99825436,0.00014188902,0.0001572238,0.0011333225,0.000070155394,0.00024305531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018478907,0.0005772349,0.0005419816,0.00017000327,0.00021100366,0.00045181718,0.00085573655,0.0009079532,0.00009266693],"category_scores_gemma":[9.3242306e-7,0.000556514,0.00020973879,0.00016293474,0.00013795146,0.00023384352,0.0008838351,0.0015411646,0.00013698821],"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.0000024323879,0.0000049225414,0.000001575781,0.00003163332,0.000083078456,0.00011754394,0.000048750186,0.00019229215,1.5253134e-7,0.6231943,0.03839592,0.33792746],"study_design_scores_gemma":[0.000082916384,0.000031598338,0.000009188411,0.0003604877,0.00005567639,0.000083384526,0.0000021803562,0.14291699,2.5630183e-7,0.02232641,0.83363706,0.0004938445],"about_ca_topic_score_codex":0.000008233287,"about_ca_topic_score_gemma":0.00007030657,"teacher_disagreement_score":0.7952412,"about_ca_system_score_codex":0.00009157113,"about_ca_system_score_gemma":0.000066749,"threshold_uncertainty_score":0.9996886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03270197,0.0003059129,0.9371279,0.0012414858,0.0007562444,0.0007932572,0.0000044302283,0.00009780102,0.026970992],"genre_scores_gemma":[0.99079514,0.0000411855,0.0078571625,0.0002354398,0.00006363813,0.00012986388,0.000007186986,0.000008900869,0.0008615136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858385,0.00012525337,0.00034925563,0.00040860628,0.00038517517,0.00014785938],"domain_scores_gemma":[0.99871176,0.000094811825,0.00011105855,0.0010179493,0.000044115197,0.00002029973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087531534,0.00013484152,0.00021743782,0.00011051007,0.000013587969,0.00012545846,0.0017976182,0.00015643288,0.000016203401],"category_scores_gemma":[0.000011535582,0.00009078336,0.00010602745,0.0003046679,0.000017276736,0.00006351558,0.0018006967,0.00047431744,0.000029508652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048293637,0.00010992822,0.000029580022,0.00018029356,0.000029621102,0.000014986212,0.0033223305,0.6290009,0.000025216206,0.27852073,0.018510867,0.07025072],"study_design_scores_gemma":[0.00008744119,0.0000082421575,0.000086239306,0.00009008537,0.0000069144044,8.205816e-7,0.000010983208,0.8832766,0.000073819014,0.11621767,0.000061541985,0.00007967382],"about_ca_topic_score_codex":0.000094812596,"about_ca_topic_score_gemma":0.00007389373,"teacher_disagreement_score":0.95809317,"about_ca_system_score_codex":0.000053717704,"about_ca_system_score_gemma":0.00017008661,"threshold_uncertainty_score":0.3702038},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03270197,0.0003059129,0.9371279,0.0012414858,0.0007562444,0.0007932572,0.0000044302283,0.00009780102,0.026970992],"genre_scores_gemma":[0.99079514,0.0000411855,0.0078571625,0.0002354398,0.00006363813,0.00012986388,0.000007186986,0.000008900869,0.0008615136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858385,0.00012525337,0.00034925563,0.00040860628,0.00038517517,0.00014785938],"domain_scores_gemma":[0.99871176,0.000094811825,0.00011105855,0.0010179493,0.000044115197,0.00002029973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087531534,0.00013484152,0.00021743782,0.00011051007,0.000013587969,0.00012545846,0.0017976182,0.00015643288,0.000016203401],"category_scores_gemma":[0.000011535582,0.00009078336,0.00010602745,0.0003046679,0.000017276736,0.00006351558,0.0018006967,0.00047431744,0.000029508652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048293637,0.00010992822,0.000029580022,0.00018029356,0.000029621102,0.000014986212,0.0033223305,0.6290009,0.000025216206,0.27852073,0.018510867,0.07025072],"study_design_scores_gemma":[0.00008744119,0.0000082421575,0.000086239306,0.00009008537,0.0000069144044,8.205816e-7,0.000010983208,0.8832766,0.000073819014,0.11621767,0.000061541985,0.00007967382],"about_ca_topic_score_codex":0.000094812596,"about_ca_topic_score_gemma":0.00007389373,"teacher_disagreement_score":0.95809317,"about_ca_system_score_codex":0.000053717704,"about_ca_system_score_gemma":0.00017008661,"threshold_uncertainty_score":0.3702038},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007463952,0.00032587996,0.9860931,0.0012774181,0.0011127153,0.000484157,0.000006788287,0.00094288005,0.0022930917],"genre_scores_gemma":[0.82116485,0.0000011968006,0.1778579,0.00041856887,0.0002322874,0.0000514555,0.000006899796,0.00002548954,0.00024132224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982204,0.000029010966,0.00032915763,0.00063210324,0.00031156247,0.00047778242],"domain_scores_gemma":[0.99851656,0.0005429016,0.000051579613,0.00071747607,0.00008936584,0.00008209182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675154,0.00018856584,0.0001738245,0.000115716015,0.00030139263,0.0008317599,0.00095446483,0.00006359726,0.0000149081425],"category_scores_gemma":[0.00007475932,0.00017017963,0.00012371923,0.0006736329,0.000041808726,0.00024377403,0.0006444309,0.00017681465,0.000019954203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019826646,0.00006525548,0.00011854443,0.000044873166,0.000033251603,0.000046197183,0.0012948865,0.5203357,0.00016793239,0.37828854,0.005166248,0.09443662],"study_design_scores_gemma":[0.00016586568,0.000030739993,0.0003003864,0.00020348195,0.00001564991,0.000029580135,0.0000776156,0.99543566,0.00005680424,0.0024443404,0.0010244653,0.00021540021],"about_ca_topic_score_codex":0.0000106164935,"about_ca_topic_score_gemma":0.00000882714,"teacher_disagreement_score":0.8137009,"about_ca_system_score_codex":0.00010967979,"about_ca_system_score_gemma":0.00010436576,"threshold_uncertainty_score":0.802068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011330953,0.0010853497,0.9539117,0.0025999648,0.00037532824,0.00016167147,1.5281739e-7,0.00059592124,0.02993896],"genre_scores_gemma":[0.99138427,0.000010785218,0.006281727,0.00049286574,0.00006867359,0.000019577377,0.0000010495024,0.0000063044126,0.0017347261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993163,0.000030867162,0.000117500014,0.00026750375,0.00011528622,0.00015256814],"domain_scores_gemma":[0.9995572,0.000060475406,0.000007710229,0.00033181967,0.000007994319,0.000034778463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016961619,0.000057630914,0.000051673105,0.00007091164,0.000015125635,0.00015970573,0.000377218,0.0000361075,0.000040638835],"category_scores_gemma":[0.0000051234633,0.000051129035,0.000023181343,0.00039133668,0.000008807474,0.00017701808,0.00012395244,0.000085606465,0.00024439953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022686088,0.000039806757,0.00015910313,0.000026449823,0.000011329159,0.00024977868,0.0007985504,0.031559777,0.0004659706,0.41461414,0.017745936,0.5343269],"study_design_scores_gemma":[0.000040331306,0.000019227724,0.00012487857,0.00002417543,6.8577043e-7,0.000029729434,0.0000036843,0.8961618,0.0008927152,0.0022205042,0.100401975,0.00008031235],"about_ca_topic_score_codex":0.000022661901,"about_ca_topic_score_gemma":0.000062921885,"teacher_disagreement_score":0.98005337,"about_ca_system_score_codex":0.000041257703,"about_ca_system_score_gemma":0.000023736206,"threshold_uncertainty_score":0.3141343},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009746772,0.000007229188,0.90010583,0.0012491161,0.00021712777,0.0934467,0.0000016638305,0.0009376163,0.0039372183],"genre_scores_gemma":[0.048496764,2.2903974e-7,0.3027079,0.0035188743,0.0006308778,0.64298207,0.000003199314,0.000052156505,0.001607939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984856,0.000035823414,0.00030933687,0.000547232,0.00020273754,0.00041922985],"domain_scores_gemma":[0.9989928,0.00024132963,0.000044874545,0.0005254906,0.000115507486,0.00008002565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003294771,0.00017177142,0.00015702499,0.000065062966,0.00010674052,0.00045199887,0.0009403144,0.00008384856,0.00005446842],"category_scores_gemma":[0.000017108556,0.00013750744,0.00009936123,0.00063095614,0.0000114866025,0.00039951605,0.00031353152,0.00015412827,0.00018549137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064428765,0.00015215726,0.00030381934,0.0009611717,0.00013676815,0.00013580157,0.0022514581,0.012267863,0.0014982009,0.8048358,0.045962777,0.13142976],"study_design_scores_gemma":[0.00039533747,0.000070698974,0.0000140501215,0.0001437439,0.000004990496,0.00003507593,0.000009791662,0.8847332,0.0004525144,0.0017584846,0.11221105,0.0001710531],"about_ca_topic_score_codex":0.00004361761,"about_ca_topic_score_gemma":0.00012272736,"teacher_disagreement_score":0.8724654,"about_ca_system_score_codex":0.00004862864,"about_ca_system_score_gemma":0.00013170205,"threshold_uncertainty_score":0.56073904},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25503805,0.003455147,0.73985934,0.00016033939,0.0004534874,0.00016845192,1.6655062e-7,0.0003131034,0.00055189495],"genre_scores_gemma":[0.89930934,0.000046418187,0.100330494,0.00014050574,0.00011139094,0.0000057356788,3.9427766e-7,0.000023794277,0.00003194305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979292,0.00009900926,0.000424029,0.00070725224,0.00022661465,0.00061388285],"domain_scores_gemma":[0.99882483,0.0005474328,0.000056698416,0.00041438808,0.000030496247,0.0001261237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010308117,0.0002106865,0.00022051066,0.00015581015,0.0001709617,0.0006989521,0.00045533557,0.00010116252,0.000007018175],"category_scores_gemma":[0.00005716872,0.00019243661,0.000038607468,0.0009316761,0.000032168788,0.0003605465,0.0009138967,0.00052417384,0.000008033041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037474174,0.000043929092,0.00088675454,0.000037157184,0.000015779695,0.00019907043,0.0013638751,0.51440567,0.0009233837,0.025271684,0.00001953211,0.4568294],"study_design_scores_gemma":[0.00024545137,0.000022046726,0.00023807693,0.00045164803,0.000006360239,0.00007117848,0.00008995355,0.9983524,0.000033891934,0.000104309904,0.00015826391,0.00022643874],"about_ca_topic_score_codex":0.00005200404,"about_ca_topic_score_gemma":0.00006675391,"teacher_disagreement_score":0.64427125,"about_ca_system_score_codex":0.00012549797,"about_ca_system_score_gemma":0.000054836466,"threshold_uncertainty_score":0.7847337},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010165814,0.08065232,0.9034004,0.001178787,0.00083059596,0.012910387,0.0000016724796,0.00023933327,0.0006848179],"genre_scores_gemma":[0.034535013,0.019233858,0.9000519,0.0003846755,0.0066050026,0.037397735,0.000007558071,0.00021127786,0.0015730143],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766445,0.00012780014,0.00053005177,0.0004908225,0.00037284428,0.00081400864],"domain_scores_gemma":[0.998524,0.00055513263,0.000088607914,0.00043725313,0.00017525489,0.000219726],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004703492,0.00023717481,0.00039507457,0.00013128463,0.00048472485,0.0049448386,0.0015363535,0.00008872254,0.000030070407],"category_scores_gemma":[0.00013937551,0.00020963966,0.00008660347,0.0006228471,0.000032850196,0.0018048158,0.00073569675,0.0008942701,0.000010054953],"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.00005052846,0.000045756533,0.00009054174,0.0041751424,0.00031317968,0.00039424814,0.0011556422,0.08466112,0.0005112408,0.24665426,0.24444185,0.4175065],"study_design_scores_gemma":[0.00026851596,0.00019564513,0.000036902537,0.009098221,0.00001224831,0.00040960038,0.000032834458,0.46151415,0.000018547915,0.0024759232,0.52568895,0.0002484839],"about_ca_topic_score_codex":0.000005242653,"about_ca_topic_score_gemma":0.000004385177,"teacher_disagreement_score":0.41725802,"about_ca_system_score_codex":0.00009326554,"about_ca_system_score_gemma":0.0002876595,"threshold_uncertainty_score":0.99608815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030788427,0.00008451603,0.948328,0.0010839504,0.00038591333,0.048895195,0.000005737518,0.00064666144,0.00026210202],"genre_scores_gemma":[0.2961881,0.000007257409,0.46668878,0.0003618938,0.00042325666,0.23617575,0.000045058074,0.000058589194,0.000051326908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975918,0.00033721235,0.00061571965,0.0006879645,0.00021384977,0.0005534515],"domain_scores_gemma":[0.9930701,0.0009117836,0.000115674935,0.005615982,0.00013496014,0.0001514638],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009269499,0.00026535362,0.00027585265,0.00019326288,0.0003691823,0.0007246015,0.0068009836,0.00013701656,0.000004276727],"category_scores_gemma":[0.000021748272,0.00026607604,0.00012919304,0.0009770007,0.00011700029,0.00045971488,0.003398735,0.0005679869,0.000015903332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012596624,0.000719508,0.00034766344,0.00009875453,0.000034296605,0.000012602049,0.001997384,0.2344799,0.000017122018,0.35739556,0.0043157446,0.40056887],"study_design_scores_gemma":[0.0008075735,0.000090277266,0.00059856166,0.00035252786,0.0000052799983,0.000012611199,0.000012351141,0.9856492,0.00001019416,0.0011368536,0.011030351,0.00029421493],"about_ca_topic_score_codex":0.00004483766,"about_ca_topic_score_gemma":0.0001855511,"teacher_disagreement_score":0.7511693,"about_ca_system_score_codex":0.00015653523,"about_ca_system_score_gemma":0.0001395166,"threshold_uncertainty_score":0.99997914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068463017,0.23488458,0.73986113,0.0016372551,0.014351137,0.0010433472,0.00003553902,0.0007278006,0.0006129365],"genre_scores_gemma":[0.8058328,0.007822458,0.16792002,0.0012340163,0.00908926,0.00010572826,0.000008835166,0.00047985924,0.0075070104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914277,0.0015322648,0.0023318196,0.0012681106,0.0010727552,0.0023673084],"domain_scores_gemma":[0.9943061,0.0019102113,0.0011704505,0.00093401026,0.0008123262,0.0008669129],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037671025,0.0010129533,0.0013985687,0.00044140016,0.0014844023,0.005931061,0.0019538095,0.00059268076,0.00016948677],"category_scores_gemma":[0.0002995583,0.0009654977,0.0009847012,0.0016735609,0.0004937098,0.0027103254,0.00049831794,0.001583316,0.00013818507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005910076,0.000097703705,0.00005243604,0.000818265,0.00056415243,0.0019411456,0.00090514857,0.17283645,0.00030356552,0.036001768,0.00925179,0.77716845],"study_design_scores_gemma":[0.0013743602,0.00065652176,0.0012872429,0.0069871345,0.00045215632,0.010018124,0.00009628782,0.9294371,0.000012877119,0.015688226,0.033055488,0.00093449885],"about_ca_topic_score_codex":0.000029291836,"about_ca_topic_score_gemma":0.000040671843,"teacher_disagreement_score":0.7989865,"about_ca_system_score_codex":0.0012671635,"about_ca_system_score_gemma":0.000994503,"threshold_uncertainty_score":0.9998155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055948228,0.00052423996,0.941004,0.00096797454,0.00024259673,0.00042808935,0.0000034267316,0.00035701224,0.000524451],"genre_scores_gemma":[0.78891796,0.000015824773,0.20962118,0.00012813284,0.00015036661,0.00006409095,0.0000076241045,0.000011212518,0.0010836201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921656,0.0000263382,0.00014367074,0.00032365147,0.00011358191,0.00017619027],"domain_scores_gemma":[0.9995149,0.00017936042,0.00002471744,0.00019063393,0.00005001673,0.00004038972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032698744,0.0000870581,0.00009579023,0.00004012131,0.00009239696,0.0004657147,0.00015895568,0.00003550941,0.0000036893],"category_scores_gemma":[0.000016082995,0.00006420265,0.000026954307,0.00011693158,0.00003088452,0.000797192,0.00009098637,0.00008239747,0.0000018074606],"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.0000136398185,0.000035864978,0.00005576283,0.00024205957,0.000027608314,0.000005230124,0.0013231774,0.0013081775,0.0005752807,0.9485023,0.0010134084,0.046897504],"study_design_scores_gemma":[0.00028951632,0.00025546545,0.0004016272,0.00037238235,0.000014584923,0.0000430819,0.00032263814,0.8855094,0.0002597272,0.10716778,0.0051648994,0.00019891998],"about_ca_topic_score_codex":0.000035746863,"about_ca_topic_score_gemma":0.00015233527,"teacher_disagreement_score":0.88420117,"about_ca_system_score_codex":0.00003573952,"about_ca_system_score_gemma":0.000031236123,"threshold_uncertainty_score":0.44908974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007746105,0.0006142134,0.9706777,0.00053982885,0.0008805446,0.026113706,0.0000013879725,0.0002464752,0.00015155567],"genre_scores_gemma":[0.6248168,0.00049141067,0.038225804,0.0010910236,0.013027631,0.31845927,0.000030179772,0.00043157287,0.0034263507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415493,0.0002461536,0.00064496533,0.00097648875,0.0004415357,0.003535915],"domain_scores_gemma":[0.9982313,0.00018118753,0.00056424394,0.0005896308,0.00026168258,0.0001719388],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0033369258,0.00049607945,0.0005245151,0.00018938501,0.0005485251,0.0010411846,0.0010194068,0.0004325288,0.0000033000674],"category_scores_gemma":[0.000021641272,0.00047123188,0.0002685426,0.00043019888,0.000043248252,0.00012688393,0.0010030691,0.0044637276,0.0000024272551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017798724,0.000083117426,0.00016529475,0.00030054522,0.00039081826,0.000018051926,0.00006357938,0.056131568,0.000095376396,0.70753336,0.0024540776,0.23258625],"study_design_scores_gemma":[0.00055594963,0.00029026956,0.000005996743,0.00036720218,0.000039437095,0.00020541722,0.000008284146,0.51243824,0.0002506614,0.48118427,0.004307213,0.00034708853],"about_ca_topic_score_codex":0.00015056666,"about_ca_topic_score_gemma":0.0018256832,"teacher_disagreement_score":0.93245184,"about_ca_system_score_codex":0.0017942853,"about_ca_system_score_gemma":0.007255653,"threshold_uncertainty_score":0.9999958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36682686,0.0005334173,0.6252375,0.0001532619,0.0064500244,0.00013275673,3.2664298e-7,0.000052812695,0.000613039],"genre_scores_gemma":[0.8408149,0.000029835615,0.15691301,0.0010605089,0.0003715631,0.0000022868621,8.241565e-7,0.000015067618,0.0007920148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997679,0.00015653275,0.0007394618,0.00040935157,0.00055267697,0.0004629994],"domain_scores_gemma":[0.998362,0.00016205061,0.00059220765,0.0004327518,0.00029946092,0.00015153755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011014988,0.00024154014,0.000367159,0.00023488501,0.0002495598,0.0004900226,0.0019935002,0.00013520187,0.00010950563],"category_scores_gemma":[0.000022380917,0.00022556077,0.00020078653,0.00039613826,0.00007462476,0.0018763042,0.0010796363,0.0006472902,0.000025551231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000378116,0.00046558285,0.014563352,0.00055376196,0.0016968071,0.0013933955,0.021483248,0.7252452,0.03698975,0.025809705,0.09137404,0.08004707],"study_design_scores_gemma":[0.0005798936,0.000047409165,0.00033755196,0.0016213615,0.00004589025,0.0003149796,0.00013974855,0.9833817,0.004895009,0.006555361,0.0018418406,0.00023926195],"about_ca_topic_score_codex":0.00040194573,"about_ca_topic_score_gemma":0.00002710205,"teacher_disagreement_score":0.47398803,"about_ca_system_score_codex":0.00013499806,"about_ca_system_score_gemma":0.000106942214,"threshold_uncertainty_score":0.9198101},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014621152,0.005998648,0.932493,0.0041336734,0.0014370449,0.0019325335,0.00002269316,0.0018881728,0.05194806],"genre_scores_gemma":[0.75417495,0.00055392255,0.11744286,0.00070208946,0.0002755463,0.0015871186,0.0001683986,0.00010554523,0.12498956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800235,0.0000127200265,0.0007760657,0.00066292944,0.00029614728,0.00024976238],"domain_scores_gemma":[0.9984391,0.00011165893,0.00027471723,0.0006557015,0.00050160283,0.000017271293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004103034,0.0002991805,0.0004121152,0.0013366136,0.00009625415,0.00025172115,0.000916709,0.00046926664,0.000002249719],"category_scores_gemma":[0.00006194308,0.00028890034,0.0000252571,0.001165731,0.00016222907,0.0001869992,0.0008061711,0.00040814764,0.000019154082],"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.0000014213838,0.0000065924464,0.0006681905,0.000088969595,0.000016786786,0.00000952154,0.00003026871,0.0005339109,1.493911e-7,0.82915807,0.0025596505,0.16692647],"study_design_scores_gemma":[0.00013771537,0.00016832845,0.0005670738,0.0024350556,0.000008271505,0.00004381879,0.00014614024,0.03597546,0.000034355937,0.69423276,0.26538613,0.0008648841],"about_ca_topic_score_codex":0.000014980376,"about_ca_topic_score_gemma":0.000020231992,"teacher_disagreement_score":0.8150501,"about_ca_system_score_codex":0.00010610341,"about_ca_system_score_gemma":0.00013962948,"threshold_uncertainty_score":0.9999563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19297394,0.0001840867,0.8056356,0.0006171988,0.00037959457,0.00008700168,0.0000025555237,0.00002727634,0.000092751165],"genre_scores_gemma":[0.90091234,0.00001117213,0.09868301,0.00030366782,0.000043070875,0.0000019662318,0.000003819728,0.0000070811006,0.00003388684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984822,0.0000925196,0.0004893679,0.00037146732,0.0002733071,0.0002911184],"domain_scores_gemma":[0.99869823,0.00021211525,0.00032523935,0.00056770217,0.000106544256,0.00009013564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822684,0.000150745,0.00025081707,0.00017625486,0.000059674687,0.00031746196,0.0017934251,0.00006563717,0.000005054634],"category_scores_gemma":[0.00013777438,0.00012496102,0.00003438273,0.00033398793,0.00006649,0.00079410814,0.00038194394,0.0006213995,0.0000010342982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010462066,0.0016079971,0.32206517,0.00062826753,0.0011738123,0.0022679414,0.013671883,0.2922622,0.014328317,0.018721014,0.009935681,0.32229152],"study_design_scores_gemma":[0.0009836792,0.00007296679,0.002195484,0.0012136993,0.000014439865,0.00007625728,0.000053776337,0.99151736,0.003247498,0.00028254036,0.0002154356,0.00012688764],"about_ca_topic_score_codex":0.000164021,"about_ca_topic_score_gemma":0.000052853753,"teacher_disagreement_score":0.7079384,"about_ca_system_score_codex":0.00008974781,"about_ca_system_score_gemma":0.0001510901,"threshold_uncertainty_score":0.50957626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069584855,0.00004344656,0.9939021,0.0012658769,0.001909196,0.00065674866,0.000001059667,0.00029421243,0.0012315199],"genre_scores_gemma":[0.6746154,0.0000034494615,0.32333577,0.0016900523,0.00024623226,0.00006704572,0.000001740547,0.000007969947,0.000032356154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997192,0.00008790208,0.00035761032,0.0011112117,0.0004242332,0.0008269995],"domain_scores_gemma":[0.99746764,0.0005955456,0.000086430504,0.001228839,0.00040139037,0.00022013458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017021837,0.00025138972,0.00025540587,0.00018949069,0.0005555558,0.00064607273,0.003031838,0.000111555644,0.0000068694226],"category_scores_gemma":[0.000111679205,0.00021452393,0.000090159214,0.0019822693,0.0014106556,0.00048683718,0.00093874725,0.00027700947,0.000013625698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017573655,0.00006005288,0.0000031043114,0.0000064969404,0.0000044565436,0.0000015799371,0.00004671427,0.032439634,0.00004580798,0.7823261,0.00028014378,0.18476835],"study_design_scores_gemma":[0.00038364631,0.000442586,0.00016080697,0.000067865316,0.000006129413,0.000004385193,0.0000018086016,0.9507554,0.0009140504,0.046733957,0.0003042858,0.00022503153],"about_ca_topic_score_codex":0.000001890209,"about_ca_topic_score_gemma":2.4848478e-7,"teacher_disagreement_score":0.9183158,"about_ca_system_score_codex":0.00013349854,"about_ca_system_score_gemma":0.00024734586,"threshold_uncertainty_score":0.8748032},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031320571,0.0013945419,0.95166934,0.04077837,0.0008292597,0.0010429127,0.000006582565,0.000040267172,0.0011066865],"genre_scores_gemma":[0.5135848,0.00014612313,0.48167783,0.002652004,0.000051056562,0.000092396935,0.0000015309945,0.000015156906,0.0017791246],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978226,0.00056008104,0.0007922423,0.0002340814,0.00027371038,0.00031727296],"domain_scores_gemma":[0.99460125,0.0011419988,0.0007223053,0.002672086,0.00076601095,0.00009634765],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028086258,0.0001970154,0.00048588478,0.0000309813,0.001676616,0.0010038163,0.011467841,0.0001315086,0.000008428595],"category_scores_gemma":[0.00026898994,0.00013858659,0.00091777707,0.00081384915,0.00018665614,0.0012087465,0.0033001069,0.0008816602,0.0000040984787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020443343,0.0053362865,0.0030358883,0.00018780051,0.027440295,0.000007850656,0.012381276,0.015431465,0.007828921,0.4347534,0.45912722,0.034265175],"study_design_scores_gemma":[0.0034664043,0.00010892522,0.0016400602,0.00029847273,0.001147695,0.000087648266,0.001070138,0.9207957,0.0014595249,0.005767282,0.06370197,0.0004562047],"about_ca_topic_score_codex":0.00006786084,"about_ca_topic_score_gemma":0.00010770464,"teacher_disagreement_score":0.9053642,"about_ca_system_score_codex":0.00029366344,"about_ca_system_score_gemma":0.00060132414,"threshold_uncertainty_score":0.99962306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837057,0.00020871665,0.21199374,0.00092576357,0.0001553542,0.0006053091,0.0000057503953,0.000005930836,0.002393727],"genre_scores_gemma":[0.9879327,0.000017774437,0.011686255,0.0003204062,0.000019864407,0.000014077164,3.1647033e-7,8.3013026e-7,0.0000078060775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998574,0.0000481509,0.00055937434,0.00015836424,0.0005760984,0.00008398693],"domain_scores_gemma":[0.99816525,0.0005081276,0.00070141954,0.000095604795,0.0004939981,0.000035571484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080524,0.00006624451,0.00030178446,0.0005272894,0.000050113755,0.000087722285,0.0008201281,0.000027016802,0.0000043156697],"category_scores_gemma":[0.00004220649,0.000051825584,0.00005369787,0.0016430056,0.00017908028,0.00020329528,0.00025119167,0.00008389909,8.888826e-8],"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.00011347496,0.00019331378,0.08548095,0.0001181081,0.0013505103,0.000004634512,0.0014469697,0.021127056,0.011647119,0.77954453,0.00010335871,0.09886996],"study_design_scores_gemma":[0.0023713969,0.0003201888,0.6061534,0.00048342993,0.00031908622,0.000026588787,0.0020794529,0.3454829,0.018056793,0.0231268,0.0012075795,0.00037237955],"about_ca_topic_score_codex":0.000043132204,"about_ca_topic_score_gemma":0.000016642456,"teacher_disagreement_score":0.75641775,"about_ca_system_score_codex":0.0000144042715,"about_ca_system_score_gemma":0.00008961568,"threshold_uncertainty_score":0.2113386},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013335308,0.0029572328,0.8927657,0.00018602026,0.001088451,0.09991058,0.0000029759508,0.001048891,0.0019067922],"genre_scores_gemma":[0.1787194,0.00039895,0.10934316,0.001755495,0.0015955226,0.7033489,0.00004632896,0.0002434102,0.0045488477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99360317,0.00049120944,0.001253601,0.0019380692,0.0005277482,0.002186202],"domain_scores_gemma":[0.9949177,0.0018263009,0.0006581742,0.0017095683,0.00048050735,0.00040775342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015377972,0.00087747927,0.0009886668,0.00023473131,0.0011023983,0.00073274627,0.0024589298,0.0007014698,0.00006008174],"category_scores_gemma":[0.00014661248,0.0008808366,0.0004947078,0.0019079909,0.00021678647,0.000870532,0.0015672902,0.001815612,0.000043367963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031413036,0.00016397936,0.00022452124,0.00004437617,0.00013776991,0.0000280635,0.00034880484,0.4986374,0.0000066020334,0.0061643603,0.0075307153,0.48639926],"study_design_scores_gemma":[0.0024707227,0.00075282867,0.00022433251,0.0005805332,0.0000463415,0.000012360786,0.00014199932,0.7995143,0.000018165978,0.00066989113,0.19487068,0.0006978586],"about_ca_topic_score_codex":0.0000068001855,"about_ca_topic_score_gemma":0.00009117071,"teacher_disagreement_score":0.7834225,"about_ca_system_score_codex":0.00035631584,"about_ca_system_score_gemma":0.00028459224,"threshold_uncertainty_score":0.99936426},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012972475,0.00005195414,0.0010381379,0.0004577337,0.0000073790757,0.00016529179,0.0000012652599,0.0003492999,0.9977992],"genre_scores_gemma":[0.00038176987,2.9132624e-7,0.0037937232,0.00026832483,0.00014688795,0.00002451434,0.0000019802328,0.0000128836255,0.9953696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892074,0.00004027582,0.0001513481,0.00033929458,0.0002129545,0.00033536987],"domain_scores_gemma":[0.99896413,0.000049838913,0.000021826043,0.00075576303,0.00003051179,0.00017790281],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014992681,0.00012220307,0.00012960746,0.00004675886,0.000072159804,0.00012084957,0.0009923613,0.000051043986,0.9737877],"category_scores_gemma":[0.000009382431,0.00012136066,0.000047814985,0.0004022496,0.000018909404,0.00023409224,0.00015595158,0.000094322175,0.9888665],"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.0000057944962,0.000020754807,7.722343e-8,9.821812e-7,0.000004464367,0.000009439527,0.000015979633,0.0008631287,0.0000096377435,0.0000596686,0.06329556,0.93571454],"study_design_scores_gemma":[0.00010829339,0.00008747764,0.00002403502,0.000007777689,0.0000024104797,0.000011551701,7.325157e-8,0.025423996,0.000019194522,0.000022359543,0.9741388,0.00015402467],"about_ca_topic_score_codex":0.000010011177,"about_ca_topic_score_gemma":1.1698884e-7,"teacher_disagreement_score":0.93556046,"about_ca_system_score_codex":0.000029456218,"about_ca_system_score_gemma":0.000029335524,"threshold_uncertainty_score":0.49489442},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014595059,0.000053532745,0.0010442034,0.00043368942,0.000007414502,0.00016664642,0.00000120521,0.00034395303,0.9978034],"genre_scores_gemma":[0.0004113619,3.1984584e-7,0.003819819,0.00026273102,0.00014962694,0.000025655678,0.0000019198444,0.00001301078,0.99531555],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989127,0.000040598003,0.00015246069,0.00034353283,0.00021245891,0.00033828113],"domain_scores_gemma":[0.9989585,0.000051440027,0.000021852795,0.00075908616,0.000031084826,0.00017803599],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015089735,0.0001229196,0.00013105808,0.000046872017,0.000070191396,0.00011703752,0.0009856686,0.000052039828,0.97351015],"category_scores_gemma":[0.000009405925,0.00012194453,0.000048149177,0.00040293162,0.00001831087,0.00023585134,0.00015582202,0.00009518312,0.988928],"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.0000056486783,0.000021078124,8.942183e-8,0.0000010094959,0.000004559415,0.000010517049,0.00001491064,0.0009055495,0.000010824656,0.00006644808,0.06253665,0.9364227],"study_design_scores_gemma":[0.000106855055,0.000086317326,0.000033057004,0.000008279413,0.000002429024,0.000012852379,6.712911e-8,0.022532523,0.000020376912,0.000022284747,0.9770197,0.00015523101],"about_ca_topic_score_codex":0.000009165299,"about_ca_topic_score_gemma":1.1283324e-7,"teacher_disagreement_score":0.9362675,"about_ca_system_score_codex":0.00002887003,"about_ca_system_score_gemma":0.00002764183,"threshold_uncertainty_score":0.49727538},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30759886,0.016868785,0.67234725,0.0012770621,0.001531446,0.00011559373,0.0000043364994,0.00003216998,0.000224482],"genre_scores_gemma":[0.99074936,0.004323519,0.004633744,0.00014659345,0.00011664422,0.0000031736124,0.0000019954427,0.000004985576,0.000019984313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990187,0.000027925873,0.00043316642,0.00014623342,0.00022082277,0.0001531023],"domain_scores_gemma":[0.9993775,0.0001900326,0.00012251976,0.00008070692,0.00016176641,0.00006749311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045024292,0.000107310734,0.00017765797,0.00022077197,0.000034279466,0.000114565424,0.00038226927,0.00006634211,0.0000054224543],"category_scores_gemma":[0.000056693978,0.000109372646,0.000051102776,0.00018118245,0.000031416297,0.00039835507,0.0002172374,0.00037741798,2.3590887e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021347588,0.00016788242,0.013408552,0.00008726316,0.00043079993,0.00057277014,0.0026714418,0.54080784,0.00052068377,0.21050103,0.00019891275,0.23041931],"study_design_scores_gemma":[0.0010907325,0.00007442517,0.01987685,0.00067208015,0.000007815832,0.0003898184,0.00010145037,0.9629989,0.000058834336,0.0040434687,0.01051872,0.0001668469],"about_ca_topic_score_codex":0.0000027355559,"about_ca_topic_score_gemma":0.000012391417,"teacher_disagreement_score":0.68315053,"about_ca_system_score_codex":0.00007874409,"about_ca_system_score_gemma":0.000033926928,"threshold_uncertainty_score":0.4460087},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010055295,0.0020951678,0.99045986,0.0010032221,0.0007087185,0.00045659815,8.6213174e-7,0.0005870241,0.0036830145],"genre_scores_gemma":[0.86488634,0.00016113791,0.1337444,0.00018997335,0.0001251776,0.000195038,0.000029451683,0.00001874803,0.00064974837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988541,0.00007146846,0.00025265408,0.00042139352,0.0001478796,0.00025249197],"domain_scores_gemma":[0.99858296,0.00009544353,0.000047386042,0.0010980909,0.00008809606,0.000088006724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041606012,0.00013369531,0.000102271224,0.00005507493,0.00015039576,0.00018309237,0.0010258824,0.00010062365,0.00007798296],"category_scores_gemma":[0.000009239828,0.0001242468,0.00007044911,0.0004489791,0.000024568462,0.0011555679,0.00014146263,0.00015798869,0.00003967408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011175393,0.00007595329,0.000079734855,0.000008543997,0.000042292926,0.0000011389233,0.00055772037,0.0065877615,0.00015422281,0.8607867,0.036635313,0.09505943],"study_design_scores_gemma":[0.00007151724,0.00015765843,0.00030181833,0.000027173095,0.0000054000075,0.000002385331,0.00003630719,0.97931623,0.0000526338,0.006816759,0.013050473,0.00016163205],"about_ca_topic_score_codex":0.000029742894,"about_ca_topic_score_gemma":0.000058573733,"teacher_disagreement_score":0.9727285,"about_ca_system_score_codex":0.00005268321,"about_ca_system_score_gemma":0.000048138492,"threshold_uncertainty_score":0.50666374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038095008,0.00057082856,0.99219984,0.0035876436,0.00041783715,0.00050597114,0.0000010828363,0.000552336,0.0017834841],"genre_scores_gemma":[0.8563101,0.000027030705,0.13843915,0.0022383495,0.00065278093,0.0001816517,0.00004598655,0.00004494966,0.0020599742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861354,0.00006541484,0.00022652766,0.0005271306,0.0002497243,0.00031764724],"domain_scores_gemma":[0.99883384,0.00043899848,0.000052875243,0.00048372618,0.0001223111,0.000068248046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040692172,0.00016305827,0.00012832055,0.00005244021,0.000184951,0.00038744524,0.000493469,0.000074673546,0.000008898556],"category_scores_gemma":[0.00001122936,0.00010879974,0.00006555211,0.0006972414,0.00005034808,0.00040165705,0.000081358885,0.00016401746,0.000020071475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001900172,0.00002605469,0.000023908007,0.000031010655,0.00004651164,0.000009436653,0.0002654243,0.84646136,0.0001859398,0.069691285,0.040793605,0.04244648],"study_design_scores_gemma":[0.00018760459,0.00010638492,0.00029229792,0.00007031289,0.000015096192,0.000034228524,0.000027692458,0.9686048,0.00014366752,0.0011511596,0.029203402,0.00016335266],"about_ca_topic_score_codex":0.000012924424,"about_ca_topic_score_gemma":0.0000637093,"teacher_disagreement_score":0.8559292,"about_ca_system_score_codex":0.00006106963,"about_ca_system_score_gemma":0.000086517466,"threshold_uncertainty_score":0.44367248},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032848073,0.0008756265,0.99067706,0.00060234766,0.0020086714,0.005298279,0.000017219209,0.00001630564,0.00017599337],"genre_scores_gemma":[0.04359186,0.00047079683,0.9443291,0.0032347667,0.0020473383,0.0060958816,0.00003165186,0.000023615252,0.00017500742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976551,0.00006140983,0.00065310864,0.00052534626,0.00067066704,0.00043434987],"domain_scores_gemma":[0.9979521,0.0004159772,0.00037347135,0.00060443924,0.00052105525,0.00013295212],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002737105,0.00015956374,0.00024792217,0.00031952842,0.00013963318,0.00053186226,0.0054836078,0.00006606092,0.000013805246],"category_scores_gemma":[0.0000900341,0.00013615376,0.000058062087,0.0010198579,0.00025434594,0.0021859761,0.0012747932,0.00029428,0.0000011485612],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007246961,0.000089457586,0.00097019784,0.0000059848207,0.000020609596,0.000029517894,0.000021388454,0.023965642,0.000018074626,0.0011747536,0.0074160947,0.9662158],"study_design_scores_gemma":[0.001350057,0.00017265805,0.0013208603,0.0002450577,0.000005358275,0.000029182258,0.000007350814,0.8646822,0.00004369059,0.0014912727,0.13052958,0.0001227543],"about_ca_topic_score_codex":0.0000015389168,"about_ca_topic_score_gemma":0.000017224536,"teacher_disagreement_score":0.96609306,"about_ca_system_score_codex":0.00010942424,"about_ca_system_score_gemma":0.00057397137,"threshold_uncertainty_score":0.9998972},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6806993,0.000029767421,0.3068153,0.000008435167,0.00005549646,0.005555394,0.0000026305668,0.00010185254,0.0067318655],"genre_scores_gemma":[0.99473643,0.000008135983,0.0023546673,0.000028621218,0.000010386349,0.0028422181,0.0000111872605,0.0000036443944,0.000004678306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852294,0.000103747945,0.00059622637,0.00017332216,0.0003754227,0.00022833476],"domain_scores_gemma":[0.9987657,0.00007285325,0.00033059457,0.0004488225,0.00034116942,0.000040862185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012073602,0.00016252042,0.0001990973,0.00018811271,0.00015475326,0.0004172834,0.00031303646,0.000080411446,0.000004762637],"category_scores_gemma":[0.00006350037,0.00014033302,0.000052013496,0.0004269761,0.00007379453,0.0065803835,0.00013941819,0.0001147761,0.000003275087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007411812,0.000067655084,0.0036366412,0.00039668774,0.00004644571,1.7018942e-7,0.003911107,0.47105852,0.000047563914,0.047511496,0.00005761381,0.473192],"study_design_scores_gemma":[0.00043127863,0.0003185402,0.06306607,0.00040991214,0.00000789238,0.0000031075388,0.00019221104,0.9249311,0.00030911947,0.010208463,0.000011999401,0.0001103008],"about_ca_topic_score_codex":0.00009343823,"about_ca_topic_score_gemma":0.0000058187848,"teacher_disagreement_score":0.4730817,"about_ca_system_score_codex":0.00044001048,"about_ca_system_score_gemma":0.000385344,"threshold_uncertainty_score":0.57226145},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004954367,0.001676099,0.0044919676,0.00009965696,0.002403326,0.0005771485,0.000007438284,0.00047448275,0.99026495],"genre_scores_gemma":[0.00052062713,0.00008179251,0.00474863,0.00048242838,0.00042194946,0.0000532829,0.000010196694,0.00006170703,0.9936194],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99725187,0.00006985535,0.00059446826,0.0010351168,0.00051728124,0.00053138094],"domain_scores_gemma":[0.99721235,0.00028327576,0.0002828262,0.0019222486,0.00012655543,0.00017273777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004899943,0.0005881515,0.00070926896,0.0002441076,0.00016512087,0.00024594515,0.002154163,0.00050365506,0.00010443766],"category_scores_gemma":[0.000019755777,0.0006023763,0.0003718416,0.000044779677,0.0000972159,0.00010818428,0.00091596035,0.0008315205,0.0003222172],"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.0000011182824,0.0000044843223,5.179552e-7,0.000050494968,0.0000652546,0.000052647694,0.00007658571,0.00004084313,0.0000010909217,0.09656548,0.0021791768,0.9009623],"study_design_scores_gemma":[0.00016359183,0.00002915906,0.000006301556,0.0006430939,0.00004398228,0.00001516276,9.194204e-7,0.003915848,0.000008923263,0.008231183,0.98636764,0.0005741681],"about_ca_topic_score_codex":3.1295414e-7,"about_ca_topic_score_gemma":0.0000560655,"teacher_disagreement_score":0.9841885,"about_ca_system_score_codex":0.00013818668,"about_ca_system_score_gemma":0.0003261105,"threshold_uncertainty_score":0.9996428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001972593,0.0002451026,0.9961304,0.00017825424,0.00068602327,0.0004055114,0.0000011273561,0.00023548781,0.00014552005],"genre_scores_gemma":[0.89928806,0.00022988455,0.099972375,0.00014848652,0.000048484417,0.00022602544,0.000001656415,0.000010927426,0.000074111646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853176,0.000016682368,0.00025088261,0.00050320354,0.00023107286,0.000466401],"domain_scores_gemma":[0.99832386,0.00015938109,0.000041814154,0.0011015927,0.00023736194,0.0001359831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000785029,0.00016487965,0.00017030774,0.00022901918,0.0007384097,0.00031556247,0.0013896583,0.00007030703,7.8983675e-7],"category_scores_gemma":[0.0000072151474,0.00017389536,0.000038711732,0.0024341857,0.00017013532,0.0008316711,0.000021231504,0.0002512099,0.0000013410689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002158971,0.000055559423,0.000008101806,0.000036797544,0.0000091423535,1.6292991e-7,0.00016823944,0.93666106,0.00023332094,0.010366979,0.00008133473,0.052377123],"study_design_scores_gemma":[0.000114247014,0.00005050922,0.000055527267,0.00011594637,0.00001188415,0.0000037647972,0.000059728354,0.9964474,0.0013137966,0.00011504993,0.0015385047,0.0001736842],"about_ca_topic_score_codex":0.000018072044,"about_ca_topic_score_gemma":0.000009515108,"teacher_disagreement_score":0.89731544,"about_ca_system_score_codex":0.000115310606,"about_ca_system_score_gemma":0.0002128971,"threshold_uncertainty_score":0.7091247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049834503,0.0009826267,0.93958443,0.0074541993,0.0005185917,0.0010021644,0.000011842649,0.00016499088,0.045297675],"genre_scores_gemma":[0.9248806,0.000053523807,0.067009464,0.0024247114,0.00020302658,0.00005267988,0.0000036222048,0.000025332467,0.005346997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616617,0.00031206026,0.00059464556,0.0015169489,0.0005158653,0.0008942991],"domain_scores_gemma":[0.99597216,0.0013819489,0.00029890108,0.00162143,0.00044501494,0.00028055144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041559042,0.0005911002,0.000605872,0.00017931282,0.0006990534,0.00088364934,0.0014358992,0.00022463108,0.00007307399],"category_scores_gemma":[0.0000993614,0.0004748747,0.00010229243,0.001734756,0.00064352155,0.0007453469,0.0010156566,0.00064797484,0.000015271873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003964183,0.0002053306,0.0070681474,0.00011497488,0.00031483517,0.0001787463,0.0019201587,0.0022194746,0.000020582673,0.7203905,0.0012541515,0.2659167],"study_design_scores_gemma":[0.0033979318,0.0006238306,0.010014074,0.0018324556,0.00011748013,0.0000083619425,0.00014630615,0.9644314,0.0038549947,0.014229841,0.0006282189,0.00071512535],"about_ca_topic_score_codex":0.0003076243,"about_ca_topic_score_gemma":0.0007616471,"teacher_disagreement_score":0.9622119,"about_ca_system_score_codex":0.0002174796,"about_ca_system_score_gemma":0.00069667323,"threshold_uncertainty_score":0.9997703},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017375088,0.0014341999,0.8146885,0.00009917638,0.0018160474,0.0011413649,0.0000028093693,0.0006799186,0.18013625],"genre_scores_gemma":[0.0051222937,0.0037244137,0.06268115,0.004801171,0.011447918,0.00065243174,0.00015550325,0.00043940483,0.9109757],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665916,0.000030346062,0.0006650161,0.0013111862,0.00041631336,0.0009180037],"domain_scores_gemma":[0.99758816,0.00030051448,0.00046183696,0.0011285103,0.00028899187,0.000231963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024136937,0.00069730927,0.0007302131,0.0001249945,0.00043502322,0.00044944414,0.0025552905,0.00092002493,0.00013654519],"category_scores_gemma":[0.000005530665,0.0006981738,0.00042033521,0.00016218703,0.00007810942,0.00048784746,0.0008159833,0.0006200864,0.00006185643],"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.000025152896,0.000019070658,0.00002155234,0.00002669485,0.00014699614,0.000021629961,0.000013459179,0.26752385,3.8399244e-7,0.26565063,0.38643667,0.08011394],"study_design_scores_gemma":[0.00023343579,0.00014470825,0.000005315937,0.00008443204,0.000028779528,0.00014625725,7.5635576e-8,0.54784423,0.000008868216,0.011041343,0.4397657,0.0006968592],"about_ca_topic_score_codex":0.000014745012,"about_ca_topic_score_gemma":0.00016840172,"teacher_disagreement_score":0.7520073,"about_ca_system_score_codex":0.00018159261,"about_ca_system_score_gemma":0.00015971455,"threshold_uncertainty_score":0.99954695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5866984,0.052926384,0.25416887,0.0024143592,0.0067745615,0.0014692477,0.00017741589,0.00077906915,0.09459169],"genre_scores_gemma":[0.8732294,0.0039234427,0.02277054,0.00040074385,0.0011899385,0.00008234335,0.00061119266,0.0000823775,0.09771006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950064,0.00061371655,0.00073536974,0.0013608315,0.0011667452,0.0011169341],"domain_scores_gemma":[0.9965936,0.0002758875,0.00077962136,0.00096354616,0.00068357075,0.000703784],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00038629165,0.0008541981,0.0006880272,0.00034402573,0.011448532,0.00020328908,0.0015941986,0.0011558553,0.00027721343],"category_scores_gemma":[0.00008591443,0.0010757052,0.00063892215,0.00070876785,0.00064269424,0.0009645342,0.0004513145,0.0011154956,0.00030123378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013135961,0.001400714,0.05539631,0.00050109654,0.0014517971,0.022601124,0.15713763,0.14357626,0.026984407,0.44352663,0.021851439,0.12425898],"study_design_scores_gemma":[0.0059237173,0.0006595213,0.25055927,0.0017833858,0.0011505933,0.014757449,0.055270508,0.4070446,0.020274628,0.004839745,0.23332794,0.004408659],"about_ca_topic_score_codex":0.044978492,"about_ca_topic_score_gemma":0.009506976,"teacher_disagreement_score":0.4386869,"about_ca_system_score_codex":0.010328531,"about_ca_system_score_gemma":0.0052084737,"threshold_uncertainty_score":0.9991693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034229372,0.0004204969,0.9927044,0.0012923601,0.002138263,0.002242568,0.0000037564741,0.0001603873,0.0010343498],"genre_scores_gemma":[0.009970985,0.00006184638,0.9865668,0.0013095079,0.0009862393,0.00030512013,0.000014651919,0.000043284363,0.00074158603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965711,0.000028781285,0.00053791027,0.00136373,0.0008631413,0.0006353341],"domain_scores_gemma":[0.99662197,0.00097319385,0.00041004812,0.0014190351,0.00046851527,0.00010725005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011174732,0.0004419396,0.00035741052,0.00032201695,0.00043171123,0.0009448612,0.003380374,0.0002692908,0.000020464935],"category_scores_gemma":[0.000057943624,0.00031457414,0.00013310718,0.0005765555,0.00047697857,0.0009665078,0.00077921007,0.00055863225,0.000055080305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025195031,0.000013219691,0.0000034781792,0.00003078385,0.000009664133,0.0000029449575,0.0005398062,0.027142854,0.00003979528,0.06560237,0.00011702889,0.9064955],"study_design_scores_gemma":[0.00018714297,0.00010681845,0.000026566862,0.00012817059,0.00000783086,0.000021123533,1.891478e-7,0.80059505,0.00015346783,0.196345,0.0021135514,0.00031512664],"about_ca_topic_score_codex":0.000022144895,"about_ca_topic_score_gemma":0.000028053597,"teacher_disagreement_score":0.9061804,"about_ca_system_score_codex":0.0002469992,"about_ca_system_score_gemma":0.00031211204,"threshold_uncertainty_score":0.9999306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97699517,0.000066976725,0.006155747,0.0011806713,0.0026617118,0.00036337643,4.864413e-7,0.00011630734,0.012459559],"genre_scores_gemma":[0.9858205,0.000026165355,0.01335783,0.00025978367,0.0002917292,0.000009392276,2.6606241e-7,0.0000073300257,0.00022704457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907315,0.0000074345567,0.00018704255,0.00028567942,0.0002602355,0.00018648917],"domain_scores_gemma":[0.99928665,0.00011746488,0.00014044999,0.0003183218,0.00009060083,0.00004650245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029049546,0.00010015682,0.000100780024,0.000025000267,0.00009704419,0.00013091463,0.001467612,0.00005580102,0.000012451467],"category_scores_gemma":[0.000021291758,0.00006958538,0.000041835243,0.00018823857,0.000059363432,0.00018433035,0.001116194,0.00027340217,0.000002941755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031336647,0.00029951966,0.045792103,0.000048033708,0.000098108634,0.0000031510133,0.0033895425,0.0025507424,0.04628423,0.21344511,0.00880363,0.6792545],"study_design_scores_gemma":[0.00090973754,0.0003359755,0.028126786,0.00026864102,0.000014320938,0.00008322318,0.00014225274,0.86945266,0.014940782,0.0048081405,0.08041028,0.0005072044],"about_ca_topic_score_codex":0.0000023708944,"about_ca_topic_score_gemma":0.000009310226,"teacher_disagreement_score":0.86690193,"about_ca_system_score_codex":0.0000136545295,"about_ca_system_score_gemma":0.000013548956,"threshold_uncertainty_score":0.28376094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002277124,0.000085869055,0.0854896,0.002884107,0.0005938192,0.0007775581,0.0000126841005,0.0024800037,0.90539926],"genre_scores_gemma":[0.97612035,0.00009142777,0.011331717,0.0006739287,0.0027674644,2.668496e-7,0.00023308196,0.0016210963,0.0071606943],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99556476,0.0012460541,0.00038356072,0.0008748976,0.0007716082,0.0011590911],"domain_scores_gemma":[0.9968143,0.00017099525,0.00013236105,0.001345737,0.0012199349,0.00031669045],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0045337062,0.00019137234,0.00019738097,0.000251718,0.005386095,0.0022672669,0.0035361992,0.00011929164,0.014710176],"category_scores_gemma":[0.0010853551,0.00020465524,0.00006301346,0.002244096,0.00025599083,0.0006317109,0.0048617977,0.0006564665,0.01601764],"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.00003760889,0.000057182293,0.0000065667828,0.0000148931185,0.000031811178,0.00002100991,0.0014495782,0.00010041927,0.0010067961,0.06399415,0.5416854,0.39159456],"study_design_scores_gemma":[0.00031417314,0.0004165751,0.00014628052,0.00007284703,0.0000038325284,0.00007921738,0.00015227054,0.016120844,0.00036232665,0.0014133749,0.9806857,0.00023255633],"about_ca_topic_score_codex":0.00001673465,"about_ca_topic_score_gemma":9.705715e-7,"teacher_disagreement_score":0.9738432,"about_ca_system_score_codex":0.0002936517,"about_ca_system_score_gemma":0.000011505982,"threshold_uncertainty_score":0.99876845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73521155,0.0000033287486,0.26252866,0.000023292721,0.00044358763,0.00061700173,0.0000056510094,0.00008882166,0.001078087],"genre_scores_gemma":[0.9973837,8.266025e-8,0.0024864618,0.000022859556,0.000028242053,0.000042486885,0.0000028219736,0.0000057566394,0.00002755689],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983427,0.00011637342,0.0008233342,0.00021145819,0.00028248006,0.00022365217],"domain_scores_gemma":[0.99873984,0.000029761019,0.0005038708,0.00052133243,0.00014831353,0.00005688263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103467,0.00014026239,0.00028782367,0.0002079361,0.000043312983,0.00018788286,0.0002996744,0.00011317626,0.0000017728893],"category_scores_gemma":[0.0000163982,0.00012834105,0.00003598304,0.00030661625,0.000019972897,0.00077439134,0.00021849135,0.000112541085,0.00008381083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016279784,0.000001874612,0.6336163,0.001375862,0.000012939419,0.0000019780236,0.065280735,0.296504,0.000010065884,0.0024559794,0.000010190879,0.00071376195],"study_design_scores_gemma":[0.00056444923,0.000035159544,0.049164526,0.0006031308,0.0000030715194,0.000016606164,0.0035677538,0.9458194,0.000079116995,0.0000012816043,0.000015512547,0.00013000015],"about_ca_topic_score_codex":0.000022070866,"about_ca_topic_score_gemma":3.8696894e-7,"teacher_disagreement_score":0.64931536,"about_ca_system_score_codex":0.00014794341,"about_ca_system_score_gemma":0.000029701792,"threshold_uncertainty_score":0.52335966},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13700208,0.00062112,0.83163774,0.0017092645,0.00046652812,0.00097286416,0.00022174174,0.00006768435,0.027300954],"genre_scores_gemma":[0.9396708,0.000054751614,0.05758879,0.0005748164,0.000084412764,0.000033177454,0.000006135465,0.000022399268,0.0019647244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978696,0.000056887307,0.00024042121,0.00041165279,0.0010028356,0.00041860546],"domain_scores_gemma":[0.99892163,0.00024585772,0.00016226755,0.00040709088,0.0000011899297,0.0002619518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001707772,0.00022302082,0.00030178393,0.000011060974,0.00017399208,0.000052314906,0.0005584359,0.000025728566,0.0000037279108],"category_scores_gemma":[0.0000013478345,0.00017445837,0.00004141141,0.00011614849,0.00007681615,0.0008173308,0.00017753667,0.00013210395,1.5717936e-9],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002845421,0.00032956537,0.023542982,0.0005044746,0.00037105722,0.00030809245,0.0010953039,0.0018859599,0.0076705087,0.81959254,0.003610468,0.13824362],"study_design_scores_gemma":[0.0024223956,0.0008328756,0.06880453,0.000707226,0.00008446647,0.000021743928,0.00053057895,0.8368266,0.047499686,0.0057828394,0.035297595,0.0011894586],"about_ca_topic_score_codex":0.00064625137,"about_ca_topic_score_gemma":0.011044948,"teacher_disagreement_score":0.8349406,"about_ca_system_score_codex":0.0000072833254,"about_ca_system_score_gemma":0.00090962945,"threshold_uncertainty_score":0.7114206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000755092,0.00064150937,0.97998405,0.00019539412,0.0046021487,0.0015427368,0.0000030482133,0.00047549565,0.012480137],"genre_scores_gemma":[0.06906856,0.00028299203,0.89776,0.0016810576,0.002856506,0.00026463944,0.0000107300775,0.00022197157,0.027853575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99335444,0.00004632147,0.0010259503,0.002760772,0.0010621189,0.0017503973],"domain_scores_gemma":[0.99530965,0.0005724926,0.000696256,0.0024877442,0.00051768444,0.00041614915],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020884306,0.0009121859,0.0009410449,0.00067781046,0.0006480273,0.0017631369,0.0070190914,0.00055352703,0.000026871672],"category_scores_gemma":[0.000055311124,0.00094413676,0.00030113896,0.0007001469,0.0007768196,0.0015881064,0.0038682704,0.0013177197,0.00006624978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005025303,0.000037882233,0.000046211007,0.00006848134,0.000024663692,0.00005498652,0.00034840908,0.039792433,0.000031450076,0.5158276,0.0007491948,0.44301364],"study_design_scores_gemma":[0.0005503636,0.00009624367,0.0003995866,0.0008347758,0.000010230556,0.00004226515,0.0000018560959,0.9846741,0.000074499665,0.0050156945,0.007194942,0.0011054726],"about_ca_topic_score_codex":0.00007385986,"about_ca_topic_score_gemma":0.00008942514,"teacher_disagreement_score":0.9448816,"about_ca_system_score_codex":0.0005642894,"about_ca_system_score_gemma":0.0005297581,"threshold_uncertainty_score":0.9993009},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040482577,0.000046828594,0.9564228,0.0006136615,0.00033265646,0.0005538003,0.0000020272487,0.00016313982,0.0013825054],"genre_scores_gemma":[0.96992445,0.000015391397,0.028924758,0.0001223743,0.0004991725,0.00022371046,0.000014477221,0.00001875763,0.00025690268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986744,0.000052035626,0.00035089854,0.00036846,0.00018756025,0.00036666225],"domain_scores_gemma":[0.999154,0.00011216166,0.00013879014,0.0004414949,0.00008540958,0.00006814694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031222164,0.00015161894,0.00022463858,0.000059238264,0.000086038606,0.00016387485,0.00048741637,0.000105885425,0.000005488018],"category_scores_gemma":[0.000012414546,0.00015071298,0.000042882068,0.0002130082,0.00003210424,0.00044078345,0.0001120086,0.00013131628,0.000008708482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000722049,0.00016614185,0.00083764584,0.00020419648,0.000027986118,0.000017955772,0.00083892565,0.03956205,0.0019757296,0.32679972,0.0020275298,0.6274699],"study_design_scores_gemma":[0.00035334702,0.000046906433,0.0010903666,0.0000859984,0.0000039227357,0.000010710641,0.000015803285,0.99592626,0.00010049152,0.0011215026,0.0010772145,0.00016750405],"about_ca_topic_score_codex":0.0000038226817,"about_ca_topic_score_gemma":0.00008905881,"teacher_disagreement_score":0.95636415,"about_ca_system_score_codex":0.0001961797,"about_ca_system_score_gemma":0.000052699754,"threshold_uncertainty_score":0.6145897},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14732772,0.0015228081,0.12066467,0.00066542276,0.0011188647,0.0029109193,0.0006132025,0.00034338445,0.724833],"genre_scores_gemma":[0.940158,0.00094381714,0.0011809652,0.000035715406,0.0000768108,0.000014251333,0.00003611113,0.000050165174,0.057504173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790305,0.00006182879,0.00038693962,0.00076262554,0.00059299654,0.0002925599],"domain_scores_gemma":[0.99837744,0.000107747794,0.0006176194,0.00056964083,0.00023904355,0.00008849418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018881803,0.00037663072,0.00068213325,0.0005804275,0.0001297292,0.00007662438,0.0015536604,0.00019336442,0.000032480515],"category_scores_gemma":[0.000012639648,0.00031445714,0.000136411,0.0004875952,0.00027981034,0.00017317993,0.0013233698,0.0002533708,0.0000031563052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022428998,0.0006315332,0.015604734,0.0007237972,0.0037615143,0.00004051469,0.002306934,0.38774472,0.0005711571,0.5727089,0.010461018,0.0052208914],"study_design_scores_gemma":[0.0007846141,0.00022492449,0.0050332295,0.0006734251,0.0005722912,0.000015129528,0.00024565915,0.9826114,0.000047809877,0.00077502255,0.008470594,0.0005458696],"about_ca_topic_score_codex":0.00009098435,"about_ca_topic_score_gemma":0.00005749067,"teacher_disagreement_score":0.7928303,"about_ca_system_score_codex":0.00007032872,"about_ca_system_score_gemma":0.00007296172,"threshold_uncertainty_score":0.99993074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31502587,0.00032494724,0.6411676,0.017060596,0.0003338463,0.00039794593,0.0000022370502,0.00017632282,0.025510648],"genre_scores_gemma":[0.98692596,0.00008567052,0.012099876,0.0003675866,0.000030275258,0.00004159063,0.000015259933,0.00001101661,0.00042278186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664694,0.002054213,0.00026795646,0.0004429708,0.00025622838,0.0003316695],"domain_scores_gemma":[0.99618876,0.0016153274,0.00012832927,0.0017049124,0.00026262423,0.00010002606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004664591,0.00015504945,0.00015384285,0.000071988805,0.00023285237,0.00047705835,0.001714001,0.00012768303,0.000027550032],"category_scores_gemma":[0.000146909,0.00012620295,0.000044025535,0.00047592362,0.0001677971,0.0002792087,0.00038013156,0.0006089232,0.00001531452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005238273,0.0003144513,0.009667479,0.0000146573775,0.000013620655,0.00001920424,0.012551527,0.00009325186,0.0014459846,0.7659948,0.003065558,0.20681421],"study_design_scores_gemma":[0.00094922166,0.0000012052211,0.06503265,0.0002594532,0.000009503943,0.00012379681,0.00018228039,0.899238,0.0022855003,0.0058463444,0.025557525,0.0005145543],"about_ca_topic_score_codex":0.00030778727,"about_ca_topic_score_gemma":0.0048203715,"teacher_disagreement_score":0.8991447,"about_ca_system_score_codex":0.000013564397,"about_ca_system_score_gemma":0.000042017648,"threshold_uncertainty_score":0.51464075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003253634,0.0003378232,0.80271274,0.00006601865,0.00081577117,0.19059245,0.000024163113,0.0004544962,0.0017428845],"genre_scores_gemma":[0.10254817,0.00042281035,0.5702783,0.00056642725,0.0017056296,0.30058238,0.0025900383,0.00075902935,0.020547232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975309,0.000101867954,0.00027270708,0.00093843805,0.00051874155,0.00063737825],"domain_scores_gemma":[0.9974878,0.00013818264,0.00080503034,0.0010201831,0.0003623785,0.00018641537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003637902,0.00045962137,0.0006081485,0.00024535056,0.00046192307,0.00011404615,0.0019248638,0.00054093986,0.000018322538],"category_scores_gemma":[0.000013458667,0.0006032854,0.00044693303,0.0005511786,0.00006957495,0.00041731243,0.00024314054,0.00047683102,0.000025794729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026045342,0.002255605,0.0013048532,0.0051173638,0.00066850084,0.00041665699,0.0058290814,0.54840744,0.00029509666,0.0060217665,0.04411902,0.38296008],"study_design_scores_gemma":[0.008783896,0.0034536964,0.004556716,0.0027127764,0.000248669,0.000007817034,0.011075379,0.68054384,0.00041995363,0.0006123419,0.28545105,0.0021338703],"about_ca_topic_score_codex":0.0001463568,"about_ca_topic_score_gemma":0.047826514,"teacher_disagreement_score":0.3808262,"about_ca_system_score_codex":0.00048353153,"about_ca_system_score_gemma":0.000498413,"threshold_uncertainty_score":0.99964184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015459679,0.00032763177,0.97939634,0.0054929103,0.00020855073,0.0003656198,0.0000012508091,0.0001858551,0.012475877],"genre_scores_gemma":[0.64198154,0.00011523676,0.35595658,0.00075061235,0.00018922696,0.00016692327,0.0000102691565,0.000012429209,0.0008171566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900985,0.000045270557,0.00021583482,0.00027490544,0.0001237556,0.00033037714],"domain_scores_gemma":[0.9977961,0.0003611837,0.000085638734,0.0015821693,0.000083409774,0.00009149465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020099065,0.000116437885,0.00014396271,0.000032223434,0.00020679689,0.000097441865,0.0017446871,0.00006857927,0.000033124885],"category_scores_gemma":[0.00001341602,0.00011961888,0.00006469648,0.00025819754,0.00006825757,0.0004049745,0.00038915215,0.00014848403,0.000020591486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058658793,0.00007662504,0.000030091125,0.000003904282,0.000012992672,4.599812e-7,0.00008094767,0.012724042,0.0005496105,0.38515723,0.008584597,0.5927736],"study_design_scores_gemma":[0.0003741933,0.000039643855,0.000100891266,0.000013802543,0.0000045489764,0.0000044466024,0.000007013822,0.8682043,0.00009082075,0.009170576,0.12185589,0.00013386768],"about_ca_topic_score_codex":0.0000017805553,"about_ca_topic_score_gemma":0.0001239517,"teacher_disagreement_score":0.85548025,"about_ca_system_score_codex":0.00006974524,"about_ca_system_score_gemma":0.000036804537,"threshold_uncertainty_score":0.48779166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84512925,0.0038113934,0.062770516,0.002171287,0.0050730705,0.0017987414,0.000030333236,0.000534259,0.07868116],"genre_scores_gemma":[0.8754575,0.0004455624,0.004423101,0.00032152512,0.00015382834,0.000003826732,0.0018548452,0.00005736592,0.117282405],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978233,0.00019571485,0.00028500613,0.00083302485,0.0003725899,0.00049039576],"domain_scores_gemma":[0.99861485,0.00003596218,0.00029493793,0.0007106099,0.0001080182,0.00023561745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023254618,0.0003024496,0.0005146777,0.0003353919,0.0001798759,0.00018566204,0.0010578752,0.00027671535,0.00007439647],"category_scores_gemma":[0.000006441849,0.00038696057,0.000120455625,0.0008435274,0.000037119917,0.0004233662,0.00073039625,0.0007116228,0.000010562869],"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.00030076434,0.0011815401,0.1882679,0.0015878213,0.00056077604,0.003523262,0.07682688,0.0006422451,0.000058799404,0.12725697,0.0058218213,0.5939712],"study_design_scores_gemma":[0.006805463,0.0006731368,0.70086074,0.003333586,0.00027399507,0.00009160245,0.020612726,0.0036012908,0.00017529658,0.0044449707,0.25439626,0.0047309515],"about_ca_topic_score_codex":0.045411646,"about_ca_topic_score_gemma":0.99566233,"teacher_disagreement_score":0.9502507,"about_ca_system_score_codex":0.00095553935,"about_ca_system_score_gemma":0.0012788004,"threshold_uncertainty_score":0.9998582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012870194,0.0000027506344,0.9557367,0.00054477155,0.00010074623,0.02967415,0.000001157164,0.00012804891,0.0009414741],"genre_scores_gemma":[0.6735062,5.1066934e-7,0.27334443,0.00011873324,0.00009382707,0.05289804,0.0000011747053,0.000012448802,0.000024665333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986894,0.000028356648,0.00026148726,0.00040123117,0.00018745662,0.00043202666],"domain_scores_gemma":[0.9993152,0.00007552623,0.00011222391,0.00038527028,0.000049523816,0.000062233616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000537798,0.00012576481,0.00016122917,0.00005997906,0.00012820042,0.00010003731,0.0005640522,0.00008377542,0.000004339673],"category_scores_gemma":[0.00004555954,0.00012795322,0.00005687162,0.0003376033,0.000026396543,0.00042223698,0.0002302731,0.00018272115,0.00000709566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009453984,0.00050597574,0.0012835856,0.0001379298,0.000012374994,0.000014418009,0.0010834279,0.004058537,0.15313742,0.14187312,0.00022382554,0.69757485],"study_design_scores_gemma":[0.005652405,0.00032242766,0.008195826,0.00045254556,0.000004603195,0.00002764706,0.000017423203,0.95573044,0.0063736415,0.020446993,0.0022556956,0.0005203433],"about_ca_topic_score_codex":0.000015287003,"about_ca_topic_score_gemma":0.00013431115,"teacher_disagreement_score":0.9516719,"about_ca_system_score_codex":0.00020491035,"about_ca_system_score_gemma":0.00013342199,"threshold_uncertainty_score":0.52177805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13771598,0.0047888514,0.14693135,0.000735432,0.006433356,0.0029922982,0.000051037554,0.0007551635,0.6995965],"genre_scores_gemma":[0.86689806,0.0010547829,0.01303078,0.002206385,0.00025898192,0.00035251444,0.00002766525,0.00006362539,0.11610721],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99733603,0.000047074842,0.00047373524,0.00088627636,0.0005269726,0.0007299149],"domain_scores_gemma":[0.99775326,0.000048175218,0.00019874473,0.0004283984,0.0011640906,0.000407352],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003223072,0.00039047436,0.0003685448,0.00009387798,0.00017128336,0.0005066316,0.0010081611,0.00020057271,0.0033876451],"category_scores_gemma":[0.000043695534,0.00036638975,0.000035440193,0.00096691697,0.00010745089,0.00080404966,0.00027506842,0.0003773529,0.000029346158],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001926375,0.0000985763,0.0019521121,0.00001869743,0.00010025143,0.000044603355,0.00018772524,0.000454974,0.000036989546,0.07596572,0.8897408,0.03138024],"study_design_scores_gemma":[0.0008720327,0.000104567785,0.002917377,0.00004235287,0.000013000707,0.00009377373,0.00012844999,0.48819166,0.00022164673,0.00031343102,0.50648344,0.0006182928],"about_ca_topic_score_codex":0.010861734,"about_ca_topic_score_gemma":0.35774,"teacher_disagreement_score":0.72918206,"about_ca_system_score_codex":0.00018418879,"about_ca_system_score_gemma":0.0008688133,"threshold_uncertainty_score":0.9998788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35277176,0.0074372124,0.5229373,0.08008748,0.004411434,0.015621422,0.009161997,0.0021466569,0.0054247295],"genre_scores_gemma":[0.9629987,0.0014009734,0.02560555,0.00069635804,0.0005838829,0.001212228,0.002919119,0.000063180094,0.0045200256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99473214,0.0004132956,0.0005500069,0.0015970225,0.0015462632,0.0011612918],"domain_scores_gemma":[0.996559,0.0005592581,0.0001149534,0.0012665308,0.000938474,0.0005617317],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006937042,0.00027133684,0.00025677957,0.0006184882,0.0008123032,0.0040673246,0.0017159883,0.00010940701,0.00014251772],"category_scores_gemma":[0.00085710327,0.00024351085,0.00003702546,0.0017977029,0.0003954803,0.004543444,0.0015029446,0.00033277296,0.00007995252],"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.00007975005,0.00035455992,0.003037179,0.0010500882,0.00009036121,0.000030537172,0.0022180013,0.000011882118,0.064902455,0.52058876,0.2662577,0.14137875],"study_design_scores_gemma":[0.0011387118,0.00026065722,0.011089859,0.00036184216,0.000027501941,0.00006562014,0.00016145584,0.17329097,0.02111651,0.009207013,0.7823141,0.0009657109],"about_ca_topic_score_codex":0.0004458616,"about_ca_topic_score_gemma":0.0003811304,"teacher_disagreement_score":0.6102269,"about_ca_system_score_codex":0.00013840421,"about_ca_system_score_gemma":0.00044575037,"threshold_uncertainty_score":0.99696654},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035619756,0.000018775181,0.09098363,0.00073292106,0.003137071,0.0021963809,0.0000829127,0.0019064677,0.90058565],"genre_scores_gemma":[0.0014471113,0.0006048523,0.024931626,0.0012333599,0.0016421177,0.00088111975,0.00015625433,0.0010415268,0.96806204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98557884,0.0011392749,0.0017869204,0.0074027665,0.001955565,0.0021366323],"domain_scores_gemma":[0.97787666,0.0007990808,0.0016975405,0.017960828,0.00058769906,0.0010781845],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science","insufficient_payload"],"category_scores_codex":[0.004028119,0.0018784446,0.0018853551,0.00062841503,0.00035517346,0.00061630894,0.00962721,0.0018815582,0.85241616],"category_scores_gemma":[0.0006539099,0.0018728134,0.00077037927,0.0013791013,0.0003781038,0.00081076496,0.009227591,0.0018672416,0.98957145],"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.000067804955,0.00053956156,0.0022749829,0.0002998842,0.00062843505,0.00008577978,0.0006413388,0.00039958497,0.0010656293,0.002660415,0.95938015,0.03195643],"study_design_scores_gemma":[0.0011898183,7.807432e-7,0.00065784063,0.00075626746,0.0001689464,0.00019537081,0.0000060838147,0.0006598059,0.0003724972,0.0011178566,0.992851,0.0020236953],"about_ca_topic_score_codex":0.0010675405,"about_ca_topic_score_gemma":0.0039740996,"teacher_disagreement_score":0.13715528,"about_ca_system_score_codex":0.000716722,"about_ca_system_score_gemma":0.0006425763,"threshold_uncertainty_score":0.9994142},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888189,0.00021987245,0.00008055516,0.00034548025,0.0008826447,0.0006737766,0.0000031679717,0.000023459328,0.008952177],"genre_scores_gemma":[0.9959688,0.00013501527,0.00031107318,0.0001401914,0.00007301482,0.00006018654,0.000009350677,0.0000111375875,0.0032911862],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984779,0.0001654207,0.00045600338,0.00033484423,0.0003229866,0.00024285018],"domain_scores_gemma":[0.9977674,0.0005096864,0.0002988181,0.0012893218,0.00008530693,0.000049485814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060124596,0.00018215625,0.00025242285,0.000039290284,0.00012198957,0.00010368374,0.0013921463,0.00021303816,0.0000031664338],"category_scores_gemma":[0.00024112989,0.000108982196,0.0000992991,0.00032968458,0.00008550292,0.00018293751,0.00018481017,0.00040568918,0.0000036398014],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035987978,0.0006042005,0.26646256,0.0006669822,0.00010279684,0.000005497679,0.027069924,0.0028814715,0.00068683445,0.063530415,0.012179495,0.6254499],"study_design_scores_gemma":[0.00022633387,0.00007459006,0.9687188,0.00017397234,0.000012494411,0.0000028567838,0.000059301645,0.011962532,0.00063698454,0.007880662,0.010036276,0.00021514622],"about_ca_topic_score_codex":0.0018746953,"about_ca_topic_score_gemma":0.019876087,"teacher_disagreement_score":0.70225626,"about_ca_system_score_codex":0.000044224085,"about_ca_system_score_gemma":0.00015230082,"threshold_uncertainty_score":0.9980086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22737932,0.00014157072,0.7708345,0.00016781049,0.00041279825,0.0006140215,0.0000039081847,0.00003495626,0.00041113383],"genre_scores_gemma":[0.73804164,0.0001755977,0.26129743,0.000020703257,0.00009012711,0.0000049711207,0.00006090222,0.00002960837,0.00027903917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859583,0.00012600479,0.00020208233,0.0004306273,0.00031631085,0.00032914095],"domain_scores_gemma":[0.99828404,0.00033792463,0.0005488886,0.0005509793,0.0002289526,0.000049195296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261677,0.00022388842,0.00046602247,0.00018873392,0.0002050486,0.000048544156,0.0014927362,0.0002922092,0.0000011467447],"category_scores_gemma":[0.000010359035,0.00023806772,0.00017143167,0.00057576323,0.000076693475,0.00046704806,0.0001743758,0.00041932033,0.0000014358901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041512583,0.00079903984,0.017667888,0.0028327717,0.00047486415,0.00010893318,0.008088079,0.31985688,0.0009760022,0.025430428,0.0010505816,0.6222994],"study_design_scores_gemma":[0.00069002213,0.00008850339,0.05157697,0.0005798719,0.000052665255,0.000003206299,0.0064179213,0.93989897,0.00021719275,0.000077769204,0.00016773459,0.00022919252],"about_ca_topic_score_codex":0.0014915873,"about_ca_topic_score_gemma":0.08454241,"teacher_disagreement_score":0.6220702,"about_ca_system_score_codex":0.00022439024,"about_ca_system_score_gemma":0.00020614649,"threshold_uncertainty_score":0.97081196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013815378,0.00018312165,0.96667737,0.00020300939,0.00038064035,0.024917588,0.0000033007175,0.0002579873,0.005995461],"genre_scores_gemma":[0.8780708,0.000013643677,0.066113345,0.00078708684,0.00021830757,0.05241991,0.000012703322,0.000077873316,0.0022863755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972672,0.000084899264,0.00059884874,0.0008710385,0.00028285227,0.00089515443],"domain_scores_gemma":[0.9982153,0.00034455696,0.0001806203,0.0009982713,0.000102521866,0.00015870082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000709654,0.00032499383,0.00037366245,0.000100860125,0.000110245215,0.00048294372,0.0009249693,0.00019040408,0.0000315379],"category_scores_gemma":[0.00017458491,0.00029122666,0.00013169213,0.0005748364,0.00007126567,0.0010680677,0.00016782008,0.0002910398,0.000019335263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033904627,0.0046452135,0.00035089723,0.00052560517,0.00008394253,0.00012697189,0.0011298546,0.49484512,0.00084536785,0.2926944,0.011612041,0.19280156],"study_design_scores_gemma":[0.0032862672,0.0007262242,0.0018072345,0.00036075184,0.000010802788,0.000043927696,0.000058471025,0.9314386,0.0012056682,0.031817406,0.028127966,0.0011166575],"about_ca_topic_score_codex":0.000010540059,"about_ca_topic_score_gemma":0.00014718955,"teacher_disagreement_score":0.900564,"about_ca_system_score_codex":0.00018488515,"about_ca_system_score_gemma":0.00015023373,"threshold_uncertainty_score":0.999954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56686944,0.00079082063,0.43046302,0.000027961405,0.00004221436,0.000068866946,3.456064e-7,0.000027040687,0.0017103221],"genre_scores_gemma":[0.9903594,0.0006496654,0.008779385,0.00014485291,0.000008031952,0.000009357343,0.000002540739,0.0000061173755,0.000040614836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873704,0.000039160994,0.00037225918,0.00037121752,0.00018635298,0.00029397168],"domain_scores_gemma":[0.999229,0.00007184734,0.0000804312,0.00049598445,0.000066593355,0.000056116092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037805157,0.00014659524,0.00030411765,0.00020950355,0.00004322089,0.00019295828,0.00038496632,0.00007934954,0.000015798832],"category_scores_gemma":[0.000005217098,0.00013007448,0.000053958192,0.001724422,0.00002330942,0.0016607731,0.00010960952,0.0001694257,0.0000010567231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067924198,0.00003143909,0.001542449,0.000015805594,0.000064551525,0.0000024058725,0.00021746964,0.975532,0.000018351204,0.015047939,0.0000029141677,0.007517915],"study_design_scores_gemma":[0.00016471751,0.000028355658,0.021284278,0.000022179163,0.00003819932,0.0000017861764,0.00019512151,0.9775362,0.000029336126,0.00054580084,0.000009168734,0.00014487596],"about_ca_topic_score_codex":0.00010064301,"about_ca_topic_score_gemma":0.0019297481,"teacher_disagreement_score":0.42349002,"about_ca_system_score_codex":0.000022315691,"about_ca_system_score_gemma":0.00006695964,"threshold_uncertainty_score":0.53042835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013611698,0.0050050756,0.9711118,0.0040096804,0.0058086407,0.0003254832,0.00000919524,0.00002581635,0.00009262917],"genre_scores_gemma":[0.9727812,0.0014401388,0.023719009,0.0004859613,0.0015076502,0.000008580652,0.0000019673244,0.000023026643,0.000032512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968602,0.00007842447,0.0015404723,0.00041883538,0.0005178187,0.0005842197],"domain_scores_gemma":[0.9969341,0.0014045415,0.000579119,0.00024908475,0.0006491698,0.00018395993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018131534,0.00036795938,0.0006578254,0.00058427267,0.000120519166,0.00039061805,0.0013831678,0.00041231455,0.000016340782],"category_scores_gemma":[0.00064301747,0.00040475372,0.00028642133,0.0006652186,0.0000507165,0.00028929146,0.0004666449,0.0016256307,4.3510107e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003429863,0.000095933545,0.000690312,0.000083752006,0.0003616694,0.00012056323,0.0019885479,0.6960809,0.000016165195,0.28469267,0.0000545196,0.0154719185],"study_design_scores_gemma":[0.0017842796,0.00011059241,0.0013891537,0.0037696452,0.000039232793,0.00013804279,0.00011290471,0.9735864,0.000044138775,0.014281347,0.004440514,0.00030374483],"about_ca_topic_score_codex":0.00001634376,"about_ca_topic_score_gemma":0.00002098595,"teacher_disagreement_score":0.95916945,"about_ca_system_score_codex":0.0003774272,"about_ca_system_score_gemma":0.00021992999,"threshold_uncertainty_score":0.99984044},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01143164,0.0031346944,0.98245096,0.0004728923,0.001503511,0.0006651892,0.0000141301525,0.00017631249,0.00015068827],"genre_scores_gemma":[0.9843513,0.0018649201,0.01345815,0.00008573473,0.000109188455,0.000071159455,0.0000012732831,0.000020489235,0.00003780008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608296,0.0001780077,0.00089818146,0.0011509222,0.0006331516,0.0010567675],"domain_scores_gemma":[0.9960479,0.00076533854,0.0002600006,0.001579545,0.0010662512,0.0002809642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030389074,0.00046766878,0.0006412974,0.00036916306,0.0012705723,0.0004398202,0.0016365064,0.00023429803,0.000008714395],"category_scores_gemma":[0.000091318994,0.0005214913,0.00017088534,0.007374417,0.001114054,0.0011389581,0.00006740639,0.0010531386,0.0000021866406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025715697,0.0001232615,0.000076847005,0.000097363736,0.000058027832,0.0000015878353,0.0004355391,0.92229134,0.00029907902,0.006652651,0.00003436871,0.069904245],"study_design_scores_gemma":[0.0005061511,0.00007329702,0.001979014,0.0017489544,0.00007916388,0.0000068568916,0.00020827724,0.9941055,0.0007060812,0.00010863288,0.00008765827,0.0003904189],"about_ca_topic_score_codex":0.00011001845,"about_ca_topic_score_gemma":0.000032361433,"teacher_disagreement_score":0.97291964,"about_ca_system_score_codex":0.0007086407,"about_ca_system_score_gemma":0.000526923,"threshold_uncertainty_score":0.9997237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017268746,0.03397235,0.9550638,0.0008367444,0.0021351438,0.003798112,0.0000021442738,0.00042045178,0.0020443809],"genre_scores_gemma":[0.9034907,0.0038875337,0.08685434,0.0022120383,0.00021193564,0.0011760945,0.000032407654,0.00006755371,0.002067377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933794,0.0003712795,0.0014490997,0.0020774277,0.0006368178,0.00208595],"domain_scores_gemma":[0.9953864,0.0016817037,0.0007145459,0.0015010807,0.00045024545,0.00026598186],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014715659,0.0009439157,0.0010193724,0.00020273283,0.0016691202,0.0009912506,0.0015080944,0.00056104624,0.00014532362],"category_scores_gemma":[0.00014127482,0.000980271,0.00048562206,0.0027848585,0.00039374863,0.0008514395,0.0008589179,0.0010953274,0.000014554064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014162854,0.00008049891,0.00076931267,0.00038396067,0.00019691091,0.0000073109168,0.0006260175,0.884104,0.000013035594,0.02244625,0.0013406754,0.089890376],"study_design_scores_gemma":[0.002542698,0.0011627417,0.00047641047,0.0010466143,0.00014754539,0.000004690071,0.00018234586,0.9523056,0.000043959168,0.0033901492,0.03779681,0.00090043957],"about_ca_topic_score_codex":0.000032225464,"about_ca_topic_score_gemma":0.0005927397,"teacher_disagreement_score":0.90176386,"about_ca_system_score_codex":0.00022545393,"about_ca_system_score_gemma":0.00050675665,"threshold_uncertainty_score":0.9996306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046977542,0.00009792486,0.9155846,0.00027419516,0.0004341017,0.030347202,0.0000010274681,0.00024301911,0.006040347],"genre_scores_gemma":[0.95001364,0.000014193722,0.04077031,0.00058959797,0.00017717159,0.007337543,9.942163e-7,0.000053472206,0.0010430963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942044,0.00040459607,0.0012977166,0.0018695776,0.0005280261,0.0016956731],"domain_scores_gemma":[0.99690086,0.00088237476,0.00036946396,0.0011889491,0.0003173175,0.0003410198],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012557058,0.0007419247,0.00085789483,0.00027103926,0.0004558385,0.0011261383,0.001215989,0.00036032408,0.00004040167],"category_scores_gemma":[0.00016908358,0.0006634385,0.00007353179,0.0019771955,0.00033832624,0.0005508127,0.0019450092,0.0011539662,0.000022442558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042228465,0.00096836395,0.3286813,0.00047005835,0.00018254743,0.00033756677,0.00089673616,0.08088064,0.00016208838,0.015232904,0.00015230474,0.57161325],"study_design_scores_gemma":[0.0039524254,0.00031013996,0.017360827,0.004871569,0.000029128016,0.000022899234,0.0000900113,0.97237116,0.00014006037,0.000027699869,0.00016531724,0.0006587773],"about_ca_topic_score_codex":0.0003818668,"about_ca_topic_score_gemma":0.0005995509,"teacher_disagreement_score":0.90303606,"about_ca_system_score_codex":0.0002374215,"about_ca_system_score_gemma":0.000292278,"threshold_uncertainty_score":0.9999108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01863534,0.0013041963,0.969977,0.00009417487,0.003445676,0.0015020695,0.0000116859455,0.0008649147,0.0041649323],"genre_scores_gemma":[0.9466515,0.0005407204,0.026791384,0.0009921859,0.0021480164,0.0010646287,0.0021420978,0.00028429777,0.019385152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558383,0.000100396785,0.0008601765,0.0016888671,0.00063728873,0.0011294503],"domain_scores_gemma":[0.99647593,0.00027645056,0.00047238817,0.001873384,0.00041232567,0.0004895363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040013244,0.00082232116,0.00089434884,0.00019873101,0.0003041317,0.0005099208,0.0028113963,0.001132121,0.00014562267],"category_scores_gemma":[0.000008631838,0.0008046418,0.00036111317,0.0005476222,0.0000669529,0.0008825698,0.00016164898,0.0007635284,0.000047331778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013153965,0.00019523661,0.000017057859,0.00008705186,0.00008225147,0.000016408123,0.00047490172,0.024095325,0.0000157748,0.030395767,0.008555028,0.93593365],"study_design_scores_gemma":[0.00067312975,0.00028730245,0.00026405233,0.00020456138,0.000048380814,0.000009093404,0.00026827285,0.981573,0.00016724011,0.0004891203,0.014995332,0.0010205565],"about_ca_topic_score_codex":0.00002578409,"about_ca_topic_score_gemma":0.003584192,"teacher_disagreement_score":0.9574776,"about_ca_system_score_codex":0.00021273173,"about_ca_system_score_gemma":0.00034635706,"threshold_uncertainty_score":0.99944043},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012763764,0.00017813378,0.9763764,0.0014054056,0.008431417,0.0010938239,0.0000011118127,0.0004515206,0.011934544],"genre_scores_gemma":[0.025822088,0.00029313567,0.88089204,0.0038996597,0.0144896405,0.00024753515,0.000008818456,0.00023433288,0.07411276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99315125,0.00004907118,0.00094948604,0.0031835584,0.0012729067,0.0013937581],"domain_scores_gemma":[0.994967,0.00012927383,0.00039803723,0.0034026045,0.00048659777,0.0006164923],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016100706,0.0007946745,0.0007888312,0.000983221,0.00033479626,0.001270782,0.006428129,0.00042423542,0.0001877062],"category_scores_gemma":[0.000034601522,0.0008461964,0.0001706854,0.0011680734,0.00061594264,0.0015460929,0.004673849,0.0012716599,0.0011226473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047100284,0.000056000674,0.000024020357,0.000025455683,0.000015802574,0.00007368008,0.00027997774,0.087983355,0.000065090266,0.31416273,0.007341839,0.5899673],"study_design_scores_gemma":[0.0002641207,0.00013475363,0.00043663752,0.00025978603,0.000005575475,0.00004802751,5.964026e-7,0.9244771,0.00009191466,0.0019765135,0.071268775,0.0010361678],"about_ca_topic_score_codex":0.00006532882,"about_ca_topic_score_gemma":0.00007080977,"teacher_disagreement_score":0.8364938,"about_ca_system_score_codex":0.0007156972,"about_ca_system_score_gemma":0.0003806154,"threshold_uncertainty_score":0.999766},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007711319,0.011730704,0.11125416,0.00016300271,0.003144077,0.0016918976,0.00001032124,0.0008923007,0.8710364],"genre_scores_gemma":[0.012487875,0.000722316,0.0029375118,0.0021606975,0.0021687613,0.0007611445,0.00012756723,0.00047146488,0.97816265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99328595,0.00011160312,0.0016614478,0.0021509482,0.0011120848,0.0016779389],"domain_scores_gemma":[0.99610096,0.00029261137,0.0008449072,0.0021351655,0.00017177405,0.00045459165],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0012045328,0.0012146692,0.0012790959,0.00081285136,0.00017151401,0.0011444096,0.0053168414,0.0033149368,0.00010685727],"category_scores_gemma":[0.000017537144,0.0013358152,0.0004118518,0.00019696829,0.00031090013,0.0019437951,0.0023994548,0.0065119225,0.00008707998],"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.000035440054,0.00002346545,0.000051242143,0.00009270888,0.00010873742,0.00033024483,0.00047351728,0.015748484,0.00001351288,0.020915521,0.31461725,0.64758986],"study_design_scores_gemma":[0.0008551366,0.00009138137,0.000028084556,0.00074151077,0.000035502915,0.00007625082,0.000011509855,0.1190489,0.000006442547,0.008762945,0.8687673,0.0015750165],"about_ca_topic_score_codex":0.000028114466,"about_ca_topic_score_gemma":0.00014950555,"teacher_disagreement_score":0.64601487,"about_ca_system_score_codex":0.0007927648,"about_ca_system_score_gemma":0.00036958687,"threshold_uncertainty_score":0.9998925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016403722,0.00032071053,0.7854895,0.00036723324,0.0010571703,0.0013627193,0.000064155836,0.00024678803,0.21092768],"genre_scores_gemma":[0.8215632,0.000021263078,0.1627426,0.0035701648,0.0028379378,0.0001941269,0.000011341534,0.00015537466,0.0089040315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971487,0.000039127113,0.00057304814,0.0011415784,0.00029875056,0.0007988266],"domain_scores_gemma":[0.9976213,0.00025865412,0.00048373814,0.00097385846,0.00029862067,0.00036383065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031077134,0.0006850052,0.0009882445,0.000064678796,0.00024480483,0.00028190992,0.0007122713,0.0011956637,0.000013834775],"category_scores_gemma":[0.000018583192,0.00061552756,0.00019309694,0.000023268027,0.000921483,0.0000824121,0.0002880314,0.0010033109,0.000012677552],"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.00006779696,0.000006045012,0.000010865668,0.00003086401,0.00016279684,0.00011723031,0.000025923833,0.0005563699,0.00004324442,0.9421848,0.00005922384,0.056734845],"study_design_scores_gemma":[0.011242526,0.0025156268,0.00007335757,0.0016451272,0.00067794893,0.0035215581,0.000027575668,0.40499234,0.00020420493,0.5387338,0.0319852,0.004380742],"about_ca_topic_score_codex":0.00001832118,"about_ca_topic_score_gemma":0.00013376465,"teacher_disagreement_score":0.82139915,"about_ca_system_score_codex":0.00010239124,"about_ca_system_score_gemma":0.00031118633,"threshold_uncertainty_score":0.9996296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025710847,0.00035308552,0.9660733,0.00005457453,0.00007475317,0.006098378,9.848958e-7,0.000076655146,0.001557432],"genre_scores_gemma":[0.9651151,0.000033847893,0.027869752,0.00006513094,0.00006742194,0.0068260683,0.0000035132746,0.0000091316915,0.000010056927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887097,0.00011316728,0.00026396356,0.00033461326,0.00019375504,0.00022352292],"domain_scores_gemma":[0.9988341,0.00011034618,0.00017835844,0.0006212511,0.00018727838,0.00006870309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088459253,0.00013013372,0.0001679563,0.00003361881,0.00022189536,0.000069594826,0.00045687723,0.00005027622,0.0000037808636],"category_scores_gemma":[0.0000044246954,0.00011456359,0.000038978294,0.00045661826,0.000059452712,0.0001820497,0.00013400665,0.000098799246,0.0000044881454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019522022,0.00006106076,0.00093402545,0.000021418118,0.000018204224,6.373757e-8,0.0003685304,0.012578761,0.00007543603,0.11401332,0.0002558135,0.87167144],"study_design_scores_gemma":[0.0003519831,0.000051346302,0.002063221,0.00007132477,0.000007803013,0.000007190629,0.000016795471,0.9826598,0.00032485585,0.004256717,0.010046477,0.00014249583],"about_ca_topic_score_codex":8.9353597e-7,"about_ca_topic_score_gemma":0.0000019289753,"teacher_disagreement_score":0.97008103,"about_ca_system_score_codex":0.000030270328,"about_ca_system_score_gemma":0.00008103985,"threshold_uncertainty_score":0.46717677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047398006,0.000049068276,0.91489947,0.0002779603,0.0013460942,0.08037016,0.000003888857,0.001222395,0.0013569753],"genre_scores_gemma":[0.5098303,0.0000037589518,0.07372084,0.0017402202,0.0051414184,0.40897277,0.00006298167,0.00021772987,0.00031000155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938809,0.00047259853,0.0011047883,0.0015838966,0.00087081484,0.0020869952],"domain_scores_gemma":[0.99526584,0.0007121307,0.0007032523,0.0020673883,0.0005580449,0.000693324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001760175,0.00077456684,0.00092088437,0.000093338705,0.00054295914,0.0006164943,0.0025618875,0.0005663426,0.00002656476],"category_scores_gemma":[0.00006880217,0.00073898764,0.00034663678,0.0015535937,0.0001521085,0.0008162709,0.00071320165,0.00074452,0.000031101572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051848934,0.00049134437,0.0031515325,0.0001230772,0.00014187192,0.00010501869,0.00089368975,0.5757701,0.000021272617,0.102740966,0.19795038,0.118092276],"study_design_scores_gemma":[0.004218163,0.0003479616,0.00015193336,0.00038683394,0.000020765636,0.000015348149,0.0000531262,0.97602993,0.00008064694,0.0016271927,0.016177462,0.0008906564],"about_ca_topic_score_codex":0.00004130762,"about_ca_topic_score_gemma":0.000079279016,"teacher_disagreement_score":0.84117866,"about_ca_system_score_codex":0.00030912552,"about_ca_system_score_gemma":0.00053342094,"threshold_uncertainty_score":0.9995061},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000674087,0.0011823259,0.9713952,0.00040437237,0.0009923334,0.00057000236,0.0000033588435,0.00021133533,0.02456698],"genre_scores_gemma":[0.8978466,0.013145005,0.07533078,0.0043584453,0.0017691036,0.00007695962,0.00018074898,0.00009836306,0.007194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997242,0.000023006236,0.00083818956,0.00066957437,0.00066521106,0.0005620342],"domain_scores_gemma":[0.99823046,0.0000715636,0.00046823523,0.00062389596,0.00037100914,0.00023483313],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00097326597,0.00046060656,0.00045266305,0.000651658,0.0005155891,0.0013236047,0.001059467,0.00027309038,0.000012848206],"category_scores_gemma":[0.000012023141,0.00046212328,0.00005116302,0.00047129666,0.0007330383,0.01539895,0.0009826376,0.00045882261,0.000023023093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012929349,0.000009263119,0.000048093887,0.000056621968,0.0000080782365,0.0000042119345,0.004318832,0.0077774874,0.0000014888042,0.27551848,0.000075841795,0.7121687],"study_design_scores_gemma":[0.000446685,0.00022183996,0.0034950539,0.00034072422,0.000008130813,0.00015034644,0.00006588247,0.9495429,0.000011728536,0.0024470882,0.042583305,0.000686347],"about_ca_topic_score_codex":0.000014456299,"about_ca_topic_score_gemma":0.00008739174,"teacher_disagreement_score":0.94176537,"about_ca_system_score_codex":0.00016251241,"about_ca_system_score_gemma":0.0002653995,"threshold_uncertainty_score":0.99978304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000040391524,0.040904116,0.94528365,0.0032071194,0.00007543952,0.0011657929,0.00002111591,0.00044032081,0.008898393],"genre_scores_gemma":[0.75302356,0.063592784,0.1707867,0.0024476456,0.00022325764,0.0021640533,0.00018480173,0.0002523954,0.007324771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824035,0.000043429838,0.00044884285,0.0006449443,0.0001896959,0.00043273135],"domain_scores_gemma":[0.99610496,0.00054565014,0.0006185259,0.002252757,0.00038510628,0.000092996226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034057928,0.00041946536,0.000686231,0.0003029665,0.0003148876,0.00016028897,0.0034158647,0.000866026,0.000030930245],"category_scores_gemma":[0.000020403564,0.00037090134,0.00009449907,0.00017877805,0.00062049285,0.00035461748,0.0009293166,0.00086476235,0.000005919236],"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.000060482413,0.000020264442,0.00000278725,0.000010573909,0.00012401969,0.0000043922983,0.000055758283,0.00060504733,0.000009113912,0.8424405,0.00018975814,0.15647733],"study_design_scores_gemma":[0.002543455,0.0009911351,0.000018517207,0.0008602455,0.00013812451,0.000060350972,0.00004542737,0.07756289,0.000048046873,0.87753904,0.0392828,0.0009099594],"about_ca_topic_score_codex":0.000004270294,"about_ca_topic_score_gemma":0.0001229273,"teacher_disagreement_score":0.774497,"about_ca_system_score_codex":0.00008470148,"about_ca_system_score_gemma":0.0001614035,"threshold_uncertainty_score":0.9998743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562342,0.0015573914,0.17932,0.0015566257,0.005001121,0.005793627,0.0004285855,0.00003000096,0.24397066],"genre_scores_gemma":[0.51975095,0.00032578397,0.23622674,0.00037810538,0.00052712474,0.000982088,0.0025219724,0.0002240631,0.23906319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941443,0.00093163777,0.0011150831,0.0019557816,0.0008257528,0.0010274483],"domain_scores_gemma":[0.9956609,0.00064065354,0.0007324616,0.0020777604,0.00044465446,0.00044356787],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001326309,0.0008730229,0.00090606435,0.00012617455,0.0005075852,0.0030185373,0.005207927,0.00076835015,0.021258995],"category_scores_gemma":[0.00014611156,0.0008985684,0.0002821186,0.0006400365,0.00020996924,0.002236105,0.0012038627,0.0011221669,0.0047275913],"study_design_candidate":"design_other","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.00007286119,0.0005674661,0.0016851436,0.00015388761,0.00020846505,0.00017389657,0.10392174,0.013173865,0.0021016954,0.0231812,0.0048083803,0.8499514],"study_design_scores_gemma":[0.0017805896,0.00091634435,0.0355797,0.001713008,0.0003103401,0.0000746917,0.028626107,0.5262788,0.006428546,0.0018948712,0.39304823,0.0033487622],"about_ca_topic_score_codex":0.012525105,"about_ca_topic_score_gemma":0.056927864,"teacher_disagreement_score":0.8466026,"about_ca_system_score_codex":0.0003137949,"about_ca_system_score_gemma":0.0012656112,"threshold_uncertainty_score":0.9993465},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015697147,0.00071547815,0.102119684,0.00003276248,0.0008336333,0.00053832994,0.00003954821,0.0003981458,0.89516544],"genre_scores_gemma":[0.0010682553,0.00083289784,0.0033916458,0.00016113876,0.0002892457,0.000001373667,0.00001779509,0.000063446714,0.9941742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977978,0.000053702428,0.00023428438,0.0010666719,0.0003300389,0.0005174996],"domain_scores_gemma":[0.99751884,0.000155385,0.00030289506,0.0014618732,0.00017466352,0.00038634153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015443846,0.0005544509,0.00055796065,0.00015867532,0.00032080055,0.00020461512,0.0015503997,0.0009277978,0.0000035398918],"category_scores_gemma":[0.0000037185825,0.00066034024,0.00018815594,0.000016849826,0.00041698443,0.00022405855,0.0017428085,0.0014732616,0.000013023274],"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.000033950713,0.000007505869,0.0000014225357,0.000038995262,0.000099078105,0.0006890928,0.000047961097,0.00002582611,0.000042340056,0.954982,0.009206069,0.034825765],"study_design_scores_gemma":[0.0005281794,0.000065855995,0.000016539438,0.00014125044,0.000095146956,0.00009363934,0.0000050807494,0.016768144,0.00007445704,0.000022751834,0.9814344,0.00075454416],"about_ca_topic_score_codex":0.000023829312,"about_ca_topic_score_gemma":0.000008573677,"teacher_disagreement_score":0.97222835,"about_ca_system_score_codex":0.00010033831,"about_ca_system_score_gemma":0.00009844108,"threshold_uncertainty_score":0.9995848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001616322,0.000022834258,0.92432916,0.00041320795,0.001299246,0.071395405,0.000010435933,0.0008997839,0.0014683096],"genre_scores_gemma":[0.6165543,0.0000029204095,0.046209175,0.0019076169,0.0029900481,0.3316202,0.000094934345,0.00021998504,0.0004007798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941144,0.00022600325,0.0012252887,0.001565522,0.0008835243,0.0019852526],"domain_scores_gemma":[0.99503046,0.0005216449,0.00076415297,0.0019738122,0.0006472456,0.0010626913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002118259,0.00083829334,0.0009703678,0.00016473905,0.0004631171,0.00074898475,0.0028625957,0.0006734359,0.000019961799],"category_scores_gemma":[0.00010690316,0.0008136137,0.00037047136,0.0012380889,0.00022085056,0.0006465227,0.00071286364,0.0008934871,0.000014012132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003999913,0.0005444901,0.0006317072,0.00010979554,0.000091916496,0.00007544891,0.00019587953,0.63777333,0.000020115456,0.11146256,0.017843964,0.23085082],"study_design_scores_gemma":[0.005399076,0.00040986654,0.00010978622,0.00033508692,0.00003389705,0.00003244834,0.0000316742,0.97789747,0.000039206425,0.0004837531,0.014261803,0.000965931],"about_ca_topic_score_codex":0.000079161066,"about_ca_topic_score_gemma":0.000054941578,"teacher_disagreement_score":0.87811995,"about_ca_system_score_codex":0.00038597774,"about_ca_system_score_gemma":0.0010327152,"threshold_uncertainty_score":0.9994315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12719502,0.00093333004,0.8657332,0.00056232605,0.0016377873,0.00053271506,0.0000036477675,0.00047268978,0.0029292875],"genre_scores_gemma":[0.9670296,0.000032765514,0.03181342,0.00053087494,0.0002620886,0.00015874562,0.000029176152,0.000036078836,0.00010729446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966615,0.00026024523,0.00061852875,0.0010506107,0.00061138626,0.00079772185],"domain_scores_gemma":[0.9972822,0.00033358618,0.00032987288,0.0017089617,0.00015815067,0.00018721975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010949534,0.00045185265,0.00053398404,0.00017947922,0.00013466003,0.00043308135,0.002282691,0.00047443606,0.00005680606],"category_scores_gemma":[0.000030543382,0.00045870806,0.0001743607,0.00043059068,0.000043235337,0.00039013635,0.0025046084,0.0011200088,0.000072653376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005660121,0.00093157147,0.09345072,0.00087644253,0.0001212606,0.000240049,0.0030775925,0.3032131,0.0008334737,0.045377664,0.00085288764,0.55096865],"study_design_scores_gemma":[0.00048575978,0.000022756505,0.016350294,0.0011305527,0.00001596181,0.0000085355605,0.00002018979,0.9796575,0.0005731822,0.0005903301,0.00024207988,0.00090290763],"about_ca_topic_score_codex":0.0004197203,"about_ca_topic_score_gemma":0.00043470654,"teacher_disagreement_score":0.8398346,"about_ca_system_score_codex":0.000636335,"about_ca_system_score_gemma":0.0008878983,"threshold_uncertainty_score":0.99978644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096679716,0.0013359853,0.96767366,0.0004888017,0.00093045173,0.0005907508,4.9247035e-7,0.00022252926,0.028660674],"genre_scores_gemma":[0.34022328,0.0015518101,0.6495672,0.001993887,0.0007750977,0.00007651016,0.0000136318085,0.0001469468,0.005651643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946541,0.00013316434,0.0011526615,0.0019384185,0.0010643617,0.0010572688],"domain_scores_gemma":[0.99553025,0.0004970051,0.00042264932,0.003037121,0.00019277392,0.00032021524],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0036085686,0.0006432584,0.00080349797,0.00092494726,0.0003186092,0.0007981935,0.0065667457,0.00051531196,0.00004489532],"category_scores_gemma":[0.00003261795,0.00070684525,0.00016071026,0.0008830061,0.0007567628,0.0010553414,0.0025540302,0.001743295,0.00004992064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008926942,0.000032647535,0.00019842744,0.000042789343,0.0000064639303,0.00006014925,0.00023950763,0.21619871,0.000019054705,0.2949745,0.000090186535,0.48812863],"study_design_scores_gemma":[0.00048006256,0.00007155915,0.0007418359,0.0017878253,0.0000048915513,0.000030058656,3.9674404e-7,0.95918053,0.000043590204,0.022956438,0.0139565775,0.0007462489],"about_ca_topic_score_codex":0.00009193329,"about_ca_topic_score_gemma":0.00015826724,"teacher_disagreement_score":0.7429818,"about_ca_system_score_codex":0.00051629846,"about_ca_system_score_gemma":0.00038914784,"threshold_uncertainty_score":0.99953824},"labels":[],"label_agreement":null}]}