{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":454,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":454,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"7a6aab70d3e5","filters":{"topic":"Opportunistic and Delay-Tolerant Networks"}},"results":[{"id":"W2169090952","doi":"10.1145/1592665.1592678","title":"MobiClique","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":363,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dissemination; Exploit; Wireless ad hoc network; Key (lock); Middleware (distributed applications); Mobile ad hoc network; World Wide Web; Bluetooth; Mobile device; Mobile computing; Computer network; Social network (sociolinguistics); Delay-tolerant networking; Vehicular ad hoc network; Computer security; Distributed computing; Social media; Wireless; Telecommunications; Network packet","authors":[{"name":"Anna-Kaisa Pietiläinen","is_ca":false},{"name":"Earl Oliver","is_ca":true},{"name":"Jason LeBrun","is_ca":false},{"name":"George Varghese","is_ca":false},{"name":"Christophe Diot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009885545038354272,"gpt":0.2251961270612521,"spread":0.2153105820228978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001486074,0.0009402807,0.0006532379,0.0009520902,0.002115944,0.003817454,0.00314469,0.001650495,0.009637306],"category_scores_gemma":[0.002829514,0.000511594,0.000697216,0.0006314818,0.0009120869,0.004473941,0.003132143,0.002057632,0.005884602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009526246,"about_ca_system_score_gemma":0.00238696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007483318,"about_ca_topic_score_gemma":0.01086841,"domain_scores_codex":[0.998991,0.0002476037,0.00005696216,0.0001989815,0.0003344064,0.0001711219],"domain_scores_gemma":[0.9989919,0.0002090964,0.00008719212,0.0002431328,0.0001831482,0.0002854988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005725878,0.0003640587,0.005211411,0.001168318,0.0001939612,0.001248496,0.001892216,0.03307964,0.01825945,0.4527934,0.2196667,0.2655498],"study_design_scores_gemma":[0.00009747075,0.0001347803,0.0006096148,0.0001058368,0.00004994182,0.0006941255,0.0002833593,0.05417001,0.002867728,0.02984825,0.9110662,0.00007260001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03685509,0.007388799,0.6085628,0.007787137,0.004397088,0.001790707,0.002650535,0.02640235,0.3041655],"genre_scores_gemma":[0.2606198,0.004969973,0.6239954,0.003779287,0.001664506,0.001822983,0.003925043,0.003939926,0.09528295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009637306,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128466234","doi":"10.1109/infcom.2009.5062058","title":"Optimal and scalable distribution of content updates over a mobile social network","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":290,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Bandwidth (computing); Service provider; Computer network; Mobile social network; Service (business); Content distribution; Mobile device; Mobile computing; World Wide Web; Database","authors":[{"name":"Stratis Ioannidis","is_ca":true},{"name":"Augustin Chaintreau","is_ca":false},{"name":"Laurent Massoulié","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01843461279547681,"gpt":0.2368739483847795,"spread":0.2184393355893027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473879,0.0007539636,0.0009357375,0.0006112541,0.000746546,0.0008713964,0.001107521,0.0008380809,0.001168333],"category_scores_gemma":[0.007893194,0.0004349636,0.0002791572,0.0007328776,0.001027188,0.001875049,0.001118309,0.0005885373,0.0002178387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00181189,"about_ca_system_score_gemma":0.00085926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005357451,"about_ca_topic_score_gemma":0.004254654,"domain_scores_codex":[0.9991766,0.0002772194,0.000028702,0.0001543357,0.0001621859,0.0002008739],"domain_scores_gemma":[0.9964656,0.00234767,0.0004768596,0.0001928634,0.0002674784,0.0002495533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002170608,0.00006508136,0.00147969,0.00005493603,0.000033582,0.0001486798,0.0001347325,0.9590687,0.004842974,0.01447423,0.001035414,0.01844502],"study_design_scores_gemma":[0.00001652716,0.00002916447,0.0002108722,0.000001886644,0.000005747772,0.00002131729,0.00003071406,0.9931788,0.0003976913,0.005877692,0.0002255467,0.000003951528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4429974,0.0005286405,0.5491205,0.001148097,0.00004857107,0.0001993831,0.0002239278,0.000461428,0.005272094],"genre_scores_gemma":[0.9820554,0.0001426696,0.01635712,0.00003687683,0.00002775138,0.00004160155,0.00004626741,0.00002495078,0.001267369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005357451,"threshold_uncertainty_score":0.01314628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147830904","doi":"10.1145/1080139.1080141","title":"Practical routing in delay-tolerant networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":245,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Routing table; Network topology; Node (physics); Network packet; Schedule; Routing (electronic design automation); Static routing; Topology (electrical circuits); Engineering","authors":[{"name":"Evan P. C. Jones","is_ca":true},{"name":"Lily Li","is_ca":true},{"name":"Paul A. S. Ward","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03208924193418186,"gpt":0.2855542628287059,"spread":0.2534650208945241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002070472,0.0007414271,0.0005696266,0.0006646671,0.0007484365,0.00187934,0.001306905,0.001404099,0.002529741],"category_scores_gemma":[0.00834593,0.000528497,0.0002854289,0.001025566,0.001855758,0.00304769,0.001357941,0.001308464,0.0005390946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812316,"about_ca_system_score_gemma":0.0008849992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001241551,"about_ca_topic_score_gemma":0.0009235356,"domain_scores_codex":[0.9981188,0.0008487335,0.00009936226,0.0002865111,0.0005398284,0.0001067067],"domain_scores_gemma":[0.9964702,0.002332867,0.0003286324,0.0004578716,0.0003122931,0.00009810679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008610538,0.00005548375,0.0006482686,0.0003533231,0.00003399704,0.0001755703,0.000258454,0.6316149,0.006047113,0.2854294,0.003275067,0.07202233],"study_design_scores_gemma":[0.00003706124,0.0001070921,0.0001494387,0.00005373375,0.00001732195,0.0001642063,0.0001010109,0.7434398,0.00235029,0.2310111,0.02254232,0.00002666648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01333196,0.001908375,0.9766942,0.0008446317,0.00015797,0.0001026144,0.00004910432,0.0003821666,0.006528857],"genre_scores_gemma":[0.5612229,0.003966272,0.4268837,0.0004111897,0.0002811608,0.0003964092,0.0002211428,0.000144009,0.006473122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002529741,"threshold_uncertainty_score":0.01314926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161147255","doi":"10.1145/1161089.1161127","title":"Low-cost communication for rural internet kiosks using mechanical backhaul","year":2006,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Interactive kiosk; Backhaul (telecommunications); The Internet; Computer science; Computer network; Telecommunications; Architecture; Computer security; Internet access; Wireless; World Wide Web","authors":[{"name":"Aaditeshwar Seth","is_ca":true},{"name":"Darcy Kroeker","is_ca":true},{"name":"Matei Zaharia","is_ca":true},{"name":"Shimin Guo","is_ca":true},{"name":"Srinivasan Keshav","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03380065408349288,"gpt":0.2708571602689887,"spread":0.2370565061854958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004622108,0.0003635812,0.0001496999,0.0004542877,0.001175934,0.0007344094,0.0006920093,0.0004326742,0.003679839],"category_scores_gemma":[0.0007309884,0.0001359386,0.00008924791,0.0003849016,0.0003345757,0.001256825,0.00106575,0.0002793001,0.0007254127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004254218,"about_ca_system_score_gemma":0.0004269954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001798052,"about_ca_topic_score_gemma":0.004384053,"domain_scores_codex":[0.9997759,0.00006406331,0.00001034475,0.00002616569,0.00006684912,0.00005655185],"domain_scores_gemma":[0.9994414,0.0001470741,0.00006235042,0.00016186,0.0001297811,0.00005757047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001481235,0.000709829,0.01466133,0.000481856,0.00008658685,0.00196747,0.003815361,0.03879514,0.2824356,0.05155873,0.02216923,0.5818375],"study_design_scores_gemma":[0.0003488467,0.003644943,0.01455833,0.0001298735,0.0002571038,0.003255662,0.004840609,0.5878353,0.122151,0.03952128,0.2232329,0.0002242362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4756186,0.0005366834,0.4820331,0.0009621087,0.0001165638,0.0003486289,0.00008548277,0.003165374,0.03713349],"genre_scores_gemma":[0.9603049,0.0001442752,0.03289061,0.00008675431,0.00002598668,0.00007598853,0.00008988389,0.00003785143,0.006343702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003679839,"threshold_uncertainty_score":0.01231033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032501570","doi":"10.1145/1247660.1247685","title":"Vehicular opportunistic communication under the microscope","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Microscope; Optics; Physics","authors":[{"name":"David Hadaller","is_ca":true},{"name":"Srinivasan Keshav","is_ca":true},{"name":"Tim Brecht","is_ca":true},{"name":"Shubham Agarwal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02568964051146672,"gpt":0.2652163804901617,"spread":0.2395267399786949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003947636,0.000225106,0.0002907426,0.0002965548,0.0009569922,0.0009819289,0.0005787883,0.0006447776,0.00258143],"category_scores_gemma":[0.001926973,0.0001654906,0.000224941,0.0002712992,0.001015746,0.001300253,0.001793924,0.0004852261,0.0003337366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007193742,"about_ca_system_score_gemma":0.0006844576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003435532,"about_ca_topic_score_gemma":0.003674937,"domain_scores_codex":[0.9996406,0.0001042654,0.000006664996,0.00005422121,0.0001010198,0.00009315007],"domain_scores_gemma":[0.9992581,0.0003853182,0.00009067501,0.00008115593,0.00009319164,0.00009156187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003445257,0.0001919716,0.01057764,0.0002720135,0.00009873105,0.003018729,0.001218203,0.3475797,0.03353231,0.4888321,0.009889176,0.1044449],"study_design_scores_gemma":[0.00006557954,0.0004493141,0.002902776,0.0000427429,0.0000437342,0.001254212,0.001535375,0.8141093,0.006374763,0.1378654,0.03529571,0.00006101363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4510193,0.003435618,0.4557953,0.00469032,0.0006265891,0.000173349,0.000222379,0.0004454737,0.08359161],"genre_scores_gemma":[0.9787755,0.0008334782,0.01482576,0.0001687637,0.0001031742,0.00003270143,0.00002888647,0.00001182588,0.005220043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003435532,"threshold_uncertainty_score":0.0086357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000652320","doi":"10.1145/1409944.1409953","title":"Media sharing based on colocation prediction in urban transport","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":166,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Bluetooth; Scheme (mathematics); Public transport; Wireless; Order (exchange); Work (physics); Multimedia; Computer network; Telecommunications; Transport engineering; Engineering","authors":[{"name":"Liam McNamara","is_ca":false},{"name":"Cecilia Mascolo","is_ca":false},{"name":"Licia Capra","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02960022901638371,"gpt":0.2112111007878798,"spread":0.1816108717714961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960974,0.0005340055,0.0006332615,0.00145378,0.0007003162,0.0007943909,0.001389693,0.0005181094,0.0004617337],"category_scores_gemma":[0.004328638,0.0003621714,0.0002482005,0.001643563,0.0005671657,0.001314067,0.0006888998,0.0004053274,0.000171142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139443,"about_ca_system_score_gemma":0.0005905053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01259864,"about_ca_topic_score_gemma":0.01539215,"domain_scores_codex":[0.9995548,0.0001135499,0.00002861026,0.0001303041,0.00009016395,0.00008249248],"domain_scores_gemma":[0.9972515,0.001197784,0.0005721914,0.0004365279,0.0003344576,0.000207675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002060087,0.0005001077,0.1138781,0.0001921103,0.0002098231,0.00101361,0.0007235048,0.6909031,0.01283931,0.002877696,0.003143863,0.1716587],"study_design_scores_gemma":[0.0000152081,0.00006107239,0.009042734,0.000005805849,0.00002049885,0.0001246261,0.0001609488,0.9855661,0.003544474,0.00107463,0.0003674258,0.00001642966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9415716,0.0002156203,0.05575493,0.0001943407,0.00002552123,0.00007322972,0.0005233889,0.0006138453,0.001027563],"genre_scores_gemma":[0.9954839,0.00003533551,0.003973473,0.000007155319,0.000007915707,0.000008355671,0.0002374823,0.000007907642,0.0002385753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01259864,"threshold_uncertainty_score":0.02505058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069133175","doi":"10.1109/35.925687","title":"Spontaneous networking: an application oriented approach to ad hoc networking","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Institute for Theoretical Astrophysics","keywords":"Computer science; Wireless ad hoc network; Computer network; Leverage (statistics); Computer security; Authentication (law); Access control; Vehicular ad hoc network; Network management; Service (business); Delay-tolerant networking; Telecommunications; Wireless","authors":[{"name":"Laura Marie Feeney","is_ca":false},{"name":"Bengt Ahlgren","is_ca":false},{"name":"Assar Westerlund","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04688086519037868,"gpt":0.2812015972557327,"spread":0.2343207320653541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002920513,0.001230669,0.0009023529,0.001923211,0.001838751,0.005582966,0.003503134,0.002512102,0.003188523],"category_scores_gemma":[0.002999083,0.000807571,0.0009075773,0.00220613,0.004845789,0.007664946,0.003615517,0.003520525,0.001402617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001422874,"about_ca_system_score_gemma":0.001628818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001007258,"about_ca_topic_score_gemma":0.001638511,"domain_scores_codex":[0.9972441,0.001057105,0.0001916415,0.0003333445,0.001023688,0.0001501393],"domain_scores_gemma":[0.9982904,0.0007544179,0.0001402889,0.0004095481,0.0002291319,0.0001762662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001972098,0.00004634238,0.0002004372,0.000273931,0.00003019524,0.00024343,0.0005233921,0.009591148,0.001766665,0.9296491,0.005348574,0.05230692],"study_design_scores_gemma":[0.00002929609,0.0001091496,0.0001625729,0.0001663322,0.00003653288,0.0007448433,0.0003633699,0.081165,0.001896477,0.6841455,0.2311262,0.00005462999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0013369,0.003063604,0.9756165,0.001883657,0.000566269,0.000271194,0.000043952,0.0003781028,0.01683979],"genre_scores_gemma":[0.09923326,0.01321873,0.8612422,0.001590537,0.001992444,0.001442257,0.0001773416,0.000231077,0.02087211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005582966,"threshold_uncertainty_score":0.01544529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980690490","doi":"10.1109/seccom.2007.4550373","title":"Anonymity and security in delay tolerant networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Anonymity; Authentication (law); Computer network; Cryptography; Public key infrastructure; Cryptographic protocol; Public-key cryptography; Encryption","authors":[{"name":"Aniket Kate","is_ca":true},{"name":"Gregory M. Zaverucha","is_ca":true},{"name":"Urs Hengartner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01051639673875017,"gpt":0.2321295651153177,"spread":0.2216131683765675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003025025,0.0006182307,0.0007579766,0.001257354,0.002582571,0.004787655,0.001134042,0.002263932,0.002238955],"category_scores_gemma":[0.008177883,0.0004928422,0.0007367061,0.002368526,0.004662225,0.00758694,0.003791413,0.002656144,0.0006582763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002644338,"about_ca_system_score_gemma":0.001549498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001180746,"about_ca_topic_score_gemma":0.0005199183,"domain_scores_codex":[0.9956144,0.001668377,0.0002953226,0.0006468285,0.001254735,0.0005202848],"domain_scores_gemma":[0.9902491,0.006389916,0.0009184777,0.001366237,0.0007289125,0.0003472902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001595735,0.00002588631,0.0003752547,0.0001437582,0.00002468228,0.0001958696,0.0005178591,0.02424602,0.001847629,0.9416606,0.002548473,0.02825432],"study_design_scores_gemma":[0.0000458828,0.00007553578,0.0001991873,0.00005810051,0.00002676034,0.0004695962,0.000236686,0.06404299,0.002816618,0.9003815,0.0316016,0.00004553065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0552299,0.005164555,0.8971182,0.005542143,0.0005273483,0.0002033804,0.0002900634,0.0004086779,0.0355158],"genre_scores_gemma":[0.8598542,0.006411538,0.1184411,0.0008420308,0.0008986644,0.0004867193,0.0002724986,0.00007731195,0.01271581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004787655,"threshold_uncertainty_score":0.01918614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164328519","doi":"10.1109/infcom.2007.194","title":"Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Dissemination; Fountain code; Computer science; Scalability; Wireless sensor network; Cache; Fault tolerance; Overhead (engineering); Decoding methods; Distributed computing; Random walk; Code (set theory); Process (computing); Reliability (semiconductor); Computer network; Algorithm; Block code; Hamming code; Set (abstract data type); Mathematics; Telecommunications","authors":[{"name":"Yunfeng Lin","is_ca":true},{"name":"Ben Liang","is_ca":true},{"name":"B. Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04191301575529736,"gpt":0.2690513084002992,"spread":0.2271382926450018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001749266,0.0003929326,0.0007995569,0.0009356398,0.001070561,0.0008257788,0.00129584,0.0009040466,0.0002891121],"category_scores_gemma":[0.01301624,0.0002852418,0.0003537342,0.00116778,0.001528651,0.002044407,0.00129358,0.000734295,0.0001537318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001080178,"about_ca_system_score_gemma":0.00130964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003203243,"about_ca_topic_score_gemma":0.002195629,"domain_scores_codex":[0.9987926,0.0003866218,0.00007682805,0.0002385609,0.0003633923,0.0001420062],"domain_scores_gemma":[0.9882872,0.004343824,0.002033566,0.003525449,0.001473389,0.0003366448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004487697,0.000111595,0.003621217,0.0001507749,0.00007239836,0.0003390257,0.0006531326,0.7890882,0.02670485,0.04049385,0.001601608,0.1367145],"study_design_scores_gemma":[0.00005120132,0.0001477886,0.000578486,0.00001293032,0.00001608267,0.0002251496,0.0000779865,0.9652255,0.01089702,0.02117107,0.001568966,0.00002785879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2120986,0.0004531867,0.7845685,0.0003230869,0.00003279043,0.00007645629,0.00003319785,0.001337683,0.001076486],"genre_scores_gemma":[0.9135786,0.0001263268,0.0847958,0.00007125529,0.00002459449,0.00009596432,0.00005950553,0.00006546888,0.001182542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003203243,"threshold_uncertainty_score":0.009251118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026139231","doi":"10.1109/tetc.2015.2414792","title":"Epidemic Information Dissemination in Mobile Social Networks With Opportunistic Links","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dissemination; Information Dissemination; Computer science; Internet privacy; TRACE (psycholinguistics); Mobile device; Process (computing); Social media; Mobile computing; Computer network; World Wide Web; Telecommunications","authors":[{"name":"Qichao Xu","is_ca":false},{"name":"Zhou Su","is_ca":false},{"name":"Kuan Zhang","is_ca":true},{"name":"Pinyi Ren","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02991073318141059,"gpt":0.2908368200637876,"spread":0.2609260868823771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008736615,0.0004280679,0.0005473342,0.001164691,0.0007639588,0.0009413818,0.0007791756,0.001241714,0.0007423763],"category_scores_gemma":[0.004456223,0.0003251747,0.0006831998,0.000723926,0.0008753613,0.001601919,0.0009549595,0.0005821502,0.0001221361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141846,"about_ca_system_score_gemma":0.0007719984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007147721,"about_ca_topic_score_gemma":0.003414638,"domain_scores_codex":[0.9992552,0.0003018056,0.00003531628,0.00009830596,0.0002004656,0.0001088507],"domain_scores_gemma":[0.9982213,0.001132019,0.0002925882,0.00008203785,0.0002072548,0.00006472645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006795765,0.00006522354,0.003593323,0.0001258287,0.0000725061,0.0008498483,0.000581757,0.8101627,0.00466776,0.163919,0.001436364,0.01445776],"study_design_scores_gemma":[0.00001526633,0.00002081524,0.0003012407,0.000007936074,0.00001523474,0.00008054222,0.0000503892,0.9823527,0.0002402857,0.01591681,0.0009852858,0.00001353008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3299303,0.001380412,0.6487983,0.001667946,0.0001478362,0.0001925959,0.0002382117,0.0004151849,0.01722923],"genre_scores_gemma":[0.9851899,0.0005479039,0.01043139,0.0001081931,0.00003751252,0.00009532299,0.00005104618,0.00001444478,0.003524402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007147721,"threshold_uncertainty_score":0.01421225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103344667","doi":"10.1109/mcsa.2004.29","title":"User mobility for opportunistic ad-hoc networking","year":2004,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Mobility model; Wireless ad hoc network; Network packet; Latency (audio); Mobile computing; Delay-tolerant networking; Mobile ad hoc network; Routing protocol; Wireless; Telecommunications; Optimized Link State Routing Protocol","authors":[{"name":"Jing Su","is_ca":false},{"name":"Alvin Chin","is_ca":false},{"name":"A. Popivanova","is_ca":false},{"name":"Ashvin Goel","is_ca":true},{"name":"Eyal de Lara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03820589656752386,"gpt":0.2652751979491181,"spread":0.2270693013815943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002251902,0.001054646,0.0008984024,0.001260644,0.001492843,0.002099921,0.002127731,0.00172252,0.004548451],"category_scores_gemma":[0.01138848,0.0005026598,0.0006173709,0.002394703,0.001869534,0.004691365,0.002335386,0.002260082,0.001547024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419378,"about_ca_system_score_gemma":0.001140938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002617541,"about_ca_topic_score_gemma":0.002761688,"domain_scores_codex":[0.9977616,0.001115649,0.0001039656,0.0002350347,0.0005857482,0.0001978975],"domain_scores_gemma":[0.9944062,0.003526875,0.000431441,0.0009775072,0.0004886457,0.0001692584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001788314,0.0001205056,0.001870601,0.0005106458,0.00007706768,0.0008845756,0.0006168035,0.1007439,0.003290392,0.7362819,0.01976744,0.1356574],"study_design_scores_gemma":[0.00004179197,0.00009566643,0.0007675487,0.0001935894,0.00005769069,0.001096947,0.0002150619,0.4640373,0.0008395335,0.4506968,0.08188582,0.00007226889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01290965,0.0158156,0.9260587,0.005549255,0.001704596,0.0004075042,0.0004467959,0.001040851,0.03606716],"genre_scores_gemma":[0.655401,0.0163387,0.298815,0.001768971,0.003092737,0.001865671,0.0007110958,0.0003769538,0.02162983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004548451,"threshold_uncertainty_score":0.01521611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139352451","doi":"10.1109/jsac.2008.080606","title":"Stochastic analysis of network coding in epidemic routing","year":2008,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Computer network; Correctness; Routing protocol; Coding (social sciences); Distributed computing; Wireless network; Wireless; Network packet; Algorithm; Telecommunications","authors":[{"name":"Yunfeng Lin","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Ben Liang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06992630000424571,"gpt":0.3071814167100825,"spread":0.2372551167058368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002713284,0.0007248044,0.0008516163,0.001260273,0.0007168634,0.001398481,0.001008489,0.001380861,0.002001625],"category_scores_gemma":[0.0144063,0.0005380902,0.0007134981,0.0008909921,0.002423874,0.001885884,0.001348597,0.001375144,0.0002438912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002905261,"about_ca_system_score_gemma":0.001549114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008863493,"about_ca_topic_score_gemma":0.003975752,"domain_scores_codex":[0.9987769,0.0005872544,0.00003880991,0.00008687707,0.0003183297,0.0001918422],"domain_scores_gemma":[0.9914534,0.006403474,0.0007920189,0.0002630678,0.0008276467,0.0002603295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002188085,0.00001287358,0.000375769,0.00003607618,0.00001670087,0.00008068442,0.00008320626,0.5790813,0.0006887349,0.4165285,0.0008058615,0.002268394],"study_design_scores_gemma":[0.000005520861,0.000005397545,0.00006815199,0.000007097571,0.000003468094,0.00001218348,0.00001497439,0.9422805,0.0000629409,0.05718079,0.0003516514,0.000007276418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06615888,0.001230884,0.9133627,0.001673435,0.0001400324,0.00008486586,0.0001875543,0.0001652388,0.01699636],"genre_scores_gemma":[0.9562528,0.001784961,0.03250635,0.0002765178,0.0001642491,0.0002685165,0.0001710691,0.0000875124,0.008487958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008863493,"threshold_uncertainty_score":0.02107924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099217666","doi":"10.1109/npsec.2005.1532050","title":"Practical security for disconnected nodes","year":2005,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Disconnection; Computer science; Computer network; Computer security; Context (archaeology); Authentication (law); Cryptography; Identity (music)","authors":[{"name":"Aaditeshwar Seth","is_ca":true},{"name":"Srinivasan Keshav","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04113585057330327,"gpt":0.3159793536108287,"spread":0.2748435030375254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003167267,0.0006768152,0.0005004455,0.000666419,0.00197305,0.002421062,0.001243616,0.001975218,0.003569605],"category_scores_gemma":[0.009623467,0.0004499092,0.0005208584,0.0006413455,0.002935947,0.006634193,0.006170026,0.002834811,0.001107269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001607987,"about_ca_system_score_gemma":0.001424781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004136513,"about_ca_topic_score_gemma":0.0002803325,"domain_scores_codex":[0.9971598,0.001103779,0.0001829219,0.0004126728,0.000873844,0.0002669276],"domain_scores_gemma":[0.993447,0.002620457,0.0006276765,0.002406153,0.0006313616,0.0002673095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002576549,0.00004000607,0.0007840088,0.0002008447,0.00002696357,0.0002287453,0.0006740546,0.0285219,0.009459519,0.8948166,0.004793487,0.06019628],"study_design_scores_gemma":[0.0001006486,0.0001392977,0.0002730638,0.0001204416,0.00003323618,0.0006687478,0.0003550535,0.1546208,0.008321051,0.7886554,0.04667799,0.00003420681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06154329,0.001907285,0.9007874,0.005074346,0.0002609733,0.0001675564,0.00008969794,0.0005151766,0.02965427],"genre_scores_gemma":[0.8409799,0.001405401,0.1472895,0.0005653401,0.0002181473,0.0002602285,0.0001859798,0.00006685656,0.009028731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003569605,"threshold_uncertainty_score":0.01675034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313195381","doi":"10.1109/tcomm.2022.3228611","title":"Future Space Networks: Toward the Next Giant Leap for Humankind","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; St. Francis Xavier University; Carleton University","funders":"National Research Council Canada; Mitacs","keywords":"Standardization; Software deployment; Space (punctuation); Communications satellite; Telecommunications; Satellite; Systems engineering; Computer science; Space technology; Architecture; Space exploration; Engineering; Aerospace engineering; Software engineering","authors":[{"name":"Mohammed Y. Abdelsadek","is_ca":true},{"name":"Aizaz U. Chaudhry","is_ca":true},{"name":"Tasneem Darwish","is_ca":true},{"name":"Eylem Erdoğan","is_ca":false},{"name":"Güneş Karabulut Kurt","is_ca":true},{"name":"Pablo G. Madoery","is_ca":true},{"name":"Olfa Ben Yahia","is_ca":true},{"name":"Halim Yanıkömeroğlu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07624539177131777,"gpt":0.2821979077412448,"spread":0.205952515969927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132481,0.0003522664,0.0001705123,0.0005205111,0.001090552,0.003173722,0.0007380205,0.001652895,0.005201602],"category_scores_gemma":[0.001172971,0.0001300462,0.0001340374,0.0007868768,0.001451516,0.007218691,0.001879789,0.001419202,0.001102322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00119858,"about_ca_system_score_gemma":0.001761057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00149085,"about_ca_topic_score_gemma":0.002116515,"domain_scores_codex":[0.9996116,0.0001289169,0.00001086273,0.00004576319,0.0001370322,0.00006590998],"domain_scores_gemma":[0.9992068,0.0002295986,0.00006526949,0.00011139,0.00020153,0.0001853459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003494992,0.00001843436,0.0006381142,0.000195247,0.00001116176,0.00007750372,0.0005616744,0.003477128,0.002028454,0.7773468,0.05031554,0.165295],"study_design_scores_gemma":[0.000003317385,0.00003381146,0.0003088171,0.0001991167,0.000006508487,0.0001673358,0.001089009,0.004619183,0.000723896,0.231731,0.7611056,0.00001237596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04983152,0.1313717,0.2878558,0.2059298,0.007352472,0.0001010053,0.0004962697,0.001575005,0.3154865],"genre_scores_gemma":[0.5845175,0.1513636,0.1557901,0.01354126,0.004530755,0.0001588634,0.0008049518,0.0003609275,0.08893199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005201602,"threshold_uncertainty_score":0.0174011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081531839","doi":"10.1109/tpds.2011.179","title":"DCS: Distributed Asynchronous Clock Synchronization in Delay Tolerant Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Clock synchronization; Asynchronous communication; Computer science; Synchronization (alternating current); Clock drift; Convergence (economics); Self-clocking signal; Master clock; Protocol (science); Clock network; Network Time Protocol; Computer network; Distributed computing; Real-time computing; Clock skew; Clock signal; Time synchronization; Jitter","authors":[{"name":"Bong Jun Choi","is_ca":true},{"name":"Hao Liang","is_ca":true},{"name":"Xuemin Shen","is_ca":true},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02328643411635698,"gpt":0.2166241658301244,"spread":0.1933377317137674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006070458,0.0004297598,0.0004834849,0.0005792232,0.0006062675,0.0008779311,0.001236449,0.0004614598,0.001735187],"category_scores_gemma":[0.001470872,0.0001323903,0.0002155249,0.0009620145,0.0006948615,0.001108087,0.0009040461,0.0006622564,0.0004209099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006934801,"about_ca_system_score_gemma":0.001025185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001235576,"about_ca_topic_score_gemma":0.001197448,"domain_scores_codex":[0.9994355,0.0001491519,0.00004856646,0.0001053255,0.0002131391,0.00004820635],"domain_scores_gemma":[0.9992611,0.0002574056,0.00009950652,0.0001084402,0.000211329,0.00006222216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007454926,0.0001183716,0.001174033,0.0008127247,0.00008649631,0.0004077717,0.0003438078,0.2816371,0.04548696,0.2910828,0.01262178,0.3654826],"study_design_scores_gemma":[0.0002301689,0.0003728607,0.0002724818,0.00006733055,0.00009094806,0.0003937198,0.0001466659,0.8191164,0.03271965,0.04958317,0.09693911,0.00006752352],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01010841,0.0008823724,0.9833346,0.0002824266,0.000422302,0.0001275,0.00008436161,0.0006175134,0.004140468],"genre_scores_gemma":[0.7156549,0.00216461,0.2723634,0.0003994677,0.0004640197,0.0004520593,0.0003933959,0.0001094146,0.007998788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001735187,"threshold_uncertainty_score":0.005804777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2312087731","doi":"10.1109/mnet.2016.7437024","title":"A performance comparison of delay-tolerant network routing protocols","year":2016,"lang":"en","type":"article","venue":"IEEE Network","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Interior gateway protocol; Routing protocol; Network packet; Link-state routing protocol; Distributed computing","authors":[{"name":"Tamer Abdelkader","is_ca":false},{"name":"Kshirasagar Naik","is_ca":true},{"name":"Amiya Nayak","is_ca":true},{"name":"Nishith Goel","is_ca":false},{"name":"Vineet Srivastava","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04280833214941708,"gpt":0.2906900152742017,"spread":0.2478816831247846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003021933,0.001002626,0.0007200495,0.002760764,0.0007016774,0.001265807,0.001304098,0.0008770971,0.0006828945],"category_scores_gemma":[0.007313526,0.0001948586,0.0003763004,0.002424113,0.0005028342,0.002534644,0.0008061701,0.0004624596,0.0001853864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001602735,"about_ca_system_score_gemma":0.0009546962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001700026,"about_ca_topic_score_gemma":0.001082426,"domain_scores_codex":[0.9961874,0.0009558068,0.0003978643,0.000333077,0.001886297,0.0002396411],"domain_scores_gemma":[0.9940934,0.003455433,0.0005645147,0.0004390242,0.001286007,0.000161624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002621506,0.0009135621,0.0144218,0.002002335,0.0007197272,0.0006095853,0.0005058174,0.5702665,0.03760944,0.03090347,0.00924405,0.3301821],"study_design_scores_gemma":[0.0001516429,0.004176879,0.007802282,0.000163548,0.0002984562,0.001179534,0.0007263643,0.9313176,0.02712303,0.01039667,0.01651563,0.0001482724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8022552,0.02725311,0.1199438,0.001613102,0.001056733,0.0006221568,0.001531442,0.001424509,0.04429989],"genre_scores_gemma":[0.9682418,0.005247767,0.02353193,0.0001113725,0.0001023535,0.0001758096,0.0008687663,0.00006104766,0.001659064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003021933,"threshold_uncertainty_score":0.01598173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169926009","doi":"10.1109/infocom.2008.210","title":"Efficient Network Coded Data Transmissions in Disruption Tolerant Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Linear network coding; Routing protocol; Erasure code; Network packet; Delay-tolerant networking; Data transmission; Distributed computing; Zone Routing Protocol; Wireless Routing Protocol; Decoding methods; Algorithm","authors":[{"name":"Yunfeng Lin","is_ca":true},{"name":"Binbin Li","is_ca":true},{"name":"Ben Liang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0584623847499717,"gpt":0.2684341533044095,"spread":0.2099717685544378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001467884,0.0003701667,0.0003698952,0.0006546511,0.0005380887,0.0006218579,0.0008900083,0.0005898707,0.0005073615],"category_scores_gemma":[0.006267217,0.0002354274,0.0001824835,0.0009885724,0.001276029,0.001326354,0.001016991,0.0005513745,0.0001414147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001034614,"about_ca_system_score_gemma":0.0009938424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001736032,"about_ca_topic_score_gemma":0.001634524,"domain_scores_codex":[0.9991878,0.0002927927,0.00003682465,0.00007002634,0.0003334067,0.00007923485],"domain_scores_gemma":[0.99712,0.001889979,0.0003329986,0.0003304179,0.0002669251,0.00005972181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002061344,0.0000663145,0.0006710627,0.0001862408,0.00002217991,0.0002550939,0.0003344134,0.7466764,0.027153,0.1638567,0.001326182,0.05924634],"study_design_scores_gemma":[0.00002744868,0.00007774497,0.0001613042,0.0000240592,0.00001191528,0.0001885138,0.00005612871,0.9376011,0.008689509,0.05000683,0.00313079,0.00002464211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04763749,0.0004719578,0.9478627,0.0002616124,0.00004539254,0.00008152219,0.00005617314,0.0002388853,0.003344238],"genre_scores_gemma":[0.7920671,0.0006582143,0.204901,0.0001060531,0.00003433752,0.0002007121,0.00007753866,0.0000453158,0.001909677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001736032,"threshold_uncertainty_score":0.007763028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031318223","doi":"10.1145/1290168.1290181","title":"Very low-cost internet access using KioskNet","year":2007,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Interactive kiosk; Software deployment; Computer science; The Internet; Variety (cybernetics); Internet access; Computer security; Key (lock); Architecture; World Wide Web; Telecommunications; Software engineering","authors":[{"name":"Shimin Guo","is_ca":true},{"name":"Mohammad Hossein Falaki","is_ca":true},{"name":"Earl Oliver","is_ca":true},{"name":"Shams Rahman","is_ca":true},{"name":"Aaditeshwar Seth","is_ca":true},{"name":"Matei Zaharia","is_ca":true},{"name":"Srinivasan Keshav","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.096577608363858,"gpt":0.358721231872917,"spread":0.2621436235090591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430069,0.0003885983,0.0003027958,0.001309301,0.001036346,0.001434025,0.001140765,0.0005820179,0.0114169],"category_scores_gemma":[0.002053711,0.0002488531,0.0001697772,0.001343224,0.0005902807,0.003403659,0.001834736,0.0005512415,0.003738641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000688676,"about_ca_system_score_gemma":0.0005983966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003119964,"about_ca_topic_score_gemma":0.004493459,"domain_scores_codex":[0.9992742,0.0001572671,0.00003388516,0.00009442223,0.0003028629,0.0001375121],"domain_scores_gemma":[0.9986978,0.0002384657,0.0001107521,0.0003961783,0.000376975,0.000179917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001222495,0.0008070223,0.01662033,0.0009952036,0.0001009406,0.001845378,0.00129175,0.01536865,0.0641766,0.05169426,0.04859221,0.7972853],"study_design_scores_gemma":[0.0005626133,0.002707096,0.03436721,0.0004648917,0.0002675939,0.00547223,0.002138132,0.1230456,0.04786609,0.03523131,0.747521,0.0003560395],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.3837708,0.002401419,0.2790553,0.002109046,0.0003974541,0.001231221,0.0008488981,0.01984517,0.3103407],"genre_scores_gemma":[0.9447656,0.0008584228,0.0341398,0.0001768977,0.00009309649,0.0001689422,0.0004808615,0.0001904244,0.01912597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.0114169,"threshold_uncertainty_score":0.03819329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080843436","doi":"10.1109/infcom.2013.6567093","title":"ZOOM: Scaling the mobility for fast opportunistic forwarding in vehicular networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Zoom; Heuristic; Computer network; TRACE (psycholinguistics); Global Positioning System; Distributed computing; Telecommunications; Engineering","authors":[{"name":"Hongzi Zhu","is_ca":false},{"name":"Mianxiong Dong","is_ca":false},{"name":"Shan Chang","is_ca":false},{"name":"Yanmin Zhu","is_ca":false},{"name":"Minglu Li","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02196257185543216,"gpt":0.2369063184555737,"spread":0.2149437466001415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006685,0.0006325271,0.0005779964,0.0008116919,0.0006478105,0.0004727902,0.001091626,0.0004899115,0.000727149],"category_scores_gemma":[0.002943155,0.0002507542,0.000368975,0.0005086876,0.0005359892,0.001096908,0.001155086,0.000345377,0.0001467878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005644404,"about_ca_system_score_gemma":0.0008734813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003972177,"about_ca_topic_score_gemma":0.005202606,"domain_scores_codex":[0.9997086,0.00007660543,0.00001337578,0.00005504469,0.00008376664,0.00006266004],"domain_scores_gemma":[0.9991722,0.0004051012,0.00009272168,0.0001857335,0.00008349875,0.00006082983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002761116,0.0001745673,0.005210882,0.000200695,0.00009389428,0.000392123,0.0005220661,0.6654751,0.02798665,0.01771345,0.004782451,0.2771721],"study_design_scores_gemma":[0.00003035114,0.0001099113,0.00051529,0.0000109719,0.00001537405,0.0001398587,0.00009660752,0.98758,0.003981205,0.005079486,0.002422584,0.00001849794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1425896,0.0007369865,0.8512515,0.0002206492,0.00008870966,0.0002304208,0.0001147224,0.002562099,0.002205169],"genre_scores_gemma":[0.8606288,0.0002252725,0.1382755,0.0000621797,0.00002436992,0.00009736216,0.0001105497,0.00005463533,0.0005214122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003972177,"threshold_uncertainty_score":0.007898092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097147215","doi":"10.1109/infcom.2011.5935032","title":"Exploiting temporal dependency for opportunistic forwarding in urban vehicular networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Vehicular ad hoc network; Dependency (UML); Markov chain; Markov process; Global Positioning System; Telecommunications; Wireless ad hoc network; Wireless; Artificial intelligence","authors":[{"name":"Shan Chang","is_ca":false},{"name":"Minglu Li","is_ca":false},{"name":"Kshirasagar Naik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06883326845337219,"gpt":0.2446719291994073,"spread":0.1758386607460351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279662,0.0004189338,0.0004916677,0.001241872,0.0006385064,0.0006444044,0.0009541351,0.0004452607,0.0004533711],"category_scores_gemma":[0.007830056,0.0005379308,0.0005687997,0.001070952,0.0008299581,0.001034749,0.0007068373,0.0004256792,0.00006507271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252399,"about_ca_system_score_gemma":0.001195786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01009693,"about_ca_topic_score_gemma":0.01378557,"domain_scores_codex":[0.9995031,0.0001564981,0.00002827755,0.00009643013,0.0001192871,0.00009637111],"domain_scores_gemma":[0.995267,0.003263272,0.0008269371,0.0003054327,0.0002266205,0.0001107059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005982365,0.00003043091,0.009765385,0.00004980235,0.00005969361,0.0002426007,0.0001569011,0.9553087,0.001924855,0.0224,0.0003096186,0.009692103],"study_design_scores_gemma":[0.000002872489,0.00000917408,0.0009088601,0.000003407189,0.00001110188,0.00004348675,0.00002508902,0.9898245,0.0002934985,0.008621188,0.00025045,0.000006343662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4049669,0.0004158073,0.5915806,0.0003198918,0.0000262279,0.00007598492,0.0003171446,0.0002150818,0.002082364],"genre_scores_gemma":[0.9889362,0.0001886403,0.01034776,0.00002050958,0.00001097598,0.0000311146,0.0001475593,0.00001169901,0.00030559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01009693,"threshold_uncertainty_score":0.02007633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083626523","doi":"10.1109/infocom.2014.6848116","title":"GeoMob: A mobility-aware geocast scheme in metropolitans via taxicabs and buses","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Geocast; Computer science; Scalability; Computer network; Multicast; Scheme (mathematics); TRACE (psycholinguistics); Distributed computing; Routing protocol; Routing (electronic design automation); Database; Optimized Link State Routing Protocol","authors":[{"name":"Boyang Yu","is_ca":true},{"name":"Jianping Pan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008655094280764433,"gpt":0.2133067178754876,"spread":0.2046516235947231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003781369,0.0003978583,0.0004661795,0.0007603652,0.000847225,0.0007516963,0.001142446,0.0004691974,0.00154134],"category_scores_gemma":[0.000733935,0.0002319357,0.0002368196,0.0008000851,0.0004442783,0.0009716238,0.001620959,0.0004387659,0.0004835249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006620166,"about_ca_system_score_gemma":0.0009194994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005904203,"about_ca_topic_score_gemma":0.009965521,"domain_scores_codex":[0.9998425,0.00003744235,0.000008638488,0.00003021839,0.00004025357,0.0000408638],"domain_scores_gemma":[0.9997173,0.00003279045,0.0000539452,0.00007854932,0.0000606092,0.00005673766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001456351,0.0003074438,0.004818548,0.0004105886,0.0001324667,0.0006267162,0.0007925474,0.2713594,0.07041049,0.1350985,0.02479683,0.4897901],"study_design_scores_gemma":[0.0001915804,0.000508037,0.002229906,0.00007086973,0.00006324831,0.0005590318,0.0004307847,0.8443164,0.02936987,0.02019538,0.1019838,0.00008108945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.167617,0.001468495,0.8079827,0.0008314128,0.0004233776,0.0004691022,0.000695557,0.004167965,0.01634436],"genre_scores_gemma":[0.8859687,0.0007306411,0.1039523,0.0001402898,0.00005593523,0.0001887481,0.0007331952,0.0001311161,0.008099061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005904203,"threshold_uncertainty_score":0.01173967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965068054","doi":"10.1109/mwc.2014.6757895","title":"Security and privacy in mobile social networks: challenges and solutions","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Computer security; Focus (optics); Mobile computing; Internet privacy; The Internet; Mobile device; Mobile Web; Mobile telephony; Information privacy; World Wide Web; Mobile technology; Computer network; Mobile radio","authors":[{"name":"Xiaohui Liang","is_ca":true},{"name":"Kuan Zhang","is_ca":true},{"name":"Xuemin Shen","is_ca":true},{"name":"Xiaodong Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04952587965226581,"gpt":0.2736031758979922,"spread":0.2240772962457264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008432057,0.0008504316,0.00140209,0.001448022,0.0040142,0.008716389,0.002664229,0.005273089,0.001655129],"category_scores_gemma":[0.01270158,0.0008342023,0.0009267927,0.002381634,0.006053114,0.01775779,0.006251791,0.005996588,0.0004380322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002709321,"about_ca_system_score_gemma":0.002363308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001695396,"about_ca_topic_score_gemma":0.001662668,"domain_scores_codex":[0.9935268,0.00322574,0.0003318863,0.0007506462,0.001652504,0.0005124529],"domain_scores_gemma":[0.9835802,0.01135778,0.001022127,0.001999427,0.001438913,0.0006016055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007525445,0.0001064983,0.002351155,0.0007873519,0.00008309073,0.000356835,0.001253003,0.02176278,0.001296342,0.771523,0.01403958,0.1863652],"study_design_scores_gemma":[0.00002454536,0.00008507694,0.0007701592,0.0004690381,0.00004253817,0.0008612921,0.00221731,0.116774,0.001138867,0.8166228,0.06091852,0.00007597255],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.04688302,0.08013981,0.5677295,0.2649339,0.002208209,0.0003736942,0.0003007989,0.0003505691,0.03708038],"genre_scores_gemma":[0.7538049,0.07935946,0.1460384,0.005441764,0.005551385,0.0004893637,0.0002438759,0.0000794842,0.008991319],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.008716389,"threshold_uncertainty_score":0.04459351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100697149","doi":"10.1145/1247694.1247709","title":"Performance modeling of network coding in epidemic routing","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Computer network; Routing protocol; Coding (social sciences); Multipath routing; Distributed computing; Static routing; Routing (electronic design automation); Network packet","authors":[{"name":"Yunfeng Lin","is_ca":true},{"name":"Ben Liang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03796185511034981,"gpt":0.2570285625247699,"spread":0.2190667074144201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001837557,0.0007828794,0.0005561321,0.0007466192,0.0005004272,0.001170427,0.001195705,0.001284288,0.001103985],"category_scores_gemma":[0.00967081,0.0003803241,0.0003895882,0.0007708259,0.001289075,0.00212058,0.0009395633,0.000874701,0.0002684375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230573,"about_ca_system_score_gemma":0.001036439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007082472,"about_ca_topic_score_gemma":0.00248265,"domain_scores_codex":[0.9991956,0.000339372,0.00002296443,0.00008108355,0.0002238289,0.0001370974],"domain_scores_gemma":[0.9962023,0.002627166,0.0003682854,0.0001953742,0.0005127171,0.00009427733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002238592,0.00001282437,0.0002501162,0.00001442652,0.000005898408,0.00004740704,0.00006046297,0.9429358,0.0009069728,0.05352727,0.0002625348,0.001953842],"study_design_scores_gemma":[0.000002216721,0.00000717044,0.00003891271,0.000002246568,0.000002094107,0.00000994112,0.000007413656,0.9923376,0.0001062166,0.007328334,0.0001540411,0.000003805698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1721636,0.0008937474,0.8003376,0.001202616,0.0001004662,0.00009859764,0.0001792496,0.000258911,0.02476522],"genre_scores_gemma":[0.9811367,0.0005488987,0.01418652,0.00007130028,0.00003206347,0.0000766824,0.0000584407,0.00003413429,0.003855247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007082472,"threshold_uncertainty_score":0.01672935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003222347","doi":"10.1145/572277.572284","title":"The Age of Spiritual Machines","year":2001,"lang":"en","type":"article","venue":"ACM SIGCAS Computers and Society","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"Citation; Computer science; World Wide Web","authors":[{"name":"Felix Stalder","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02058834408621993,"gpt":0.2444700832935555,"spread":0.2238817392073355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002188148,0.0003976522,0.0003902958,0.001118123,0.006822572,0.01105503,0.0006838197,0.002987005,0.03804697],"category_scores_gemma":[0.007148737,0.0003292541,0.0002673806,0.001240098,0.01094551,0.02335414,0.006721665,0.00519737,0.006689254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003265115,"about_ca_system_score_gemma":0.00220512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003802753,"about_ca_topic_score_gemma":0.006106793,"domain_scores_codex":[0.998584,0.0004796579,0.00003881833,0.0001718331,0.0004313971,0.0002942467],"domain_scores_gemma":[0.9965069,0.001244398,0.00022525,0.0004978297,0.0005948675,0.0009307417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005428747,0.00001423887,0.0005958966,0.0000905109,0.000007412348,0.0001685899,0.01646664,0.0001056165,0.0003245625,0.5946696,0.3387288,0.04877379],"study_design_scores_gemma":[0.0000030721,0.0000100054,0.0003215719,0.00009873398,0.000002364434,0.0001225405,0.004261029,0.00008867143,0.0001103185,0.09489402,0.9000797,0.000007950324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"commentary","genre_scores_codex":[0.01959842,0.0436732,0.006129952,0.3954424,0.009023137,0.00002199282,0.0003225678,0.0005022719,0.5252861],"genre_scores_gemma":[0.564317,0.05727647,0.002990277,0.06037209,0.00928716,0.00008607095,0.0002610062,0.0007896458,0.3046203],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.03804697,"threshold_uncertainty_score":0.1272798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038638313","doi":"10.1109/mnet.2010.5634437","title":"Betweenness centrality and resistance distance in communication networks","year":2010,"lang":"en","type":"article","venue":"IEEE Network","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Betweenness centrality; Computer science; Centrality; Theoretical computer science; Graph theory; Telecommunications network; Graph; Criticality; Context (archaeology); Distributed computing; Computer network; Mathematics","authors":[{"name":"Ali Tizghadam","is_ca":true},{"name":"Alberto Leon‐Garcia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01373697005833437,"gpt":0.2370599700395991,"spread":0.2233229999812648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001806278,0.0008597517,0.0007119905,0.0022504,0.0007712591,0.002098905,0.001173909,0.001368608,0.003449823],"category_scores_gemma":[0.01174628,0.0003985691,0.0005088319,0.002434553,0.002607804,0.005101239,0.001260548,0.001286126,0.0003873341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001648225,"about_ca_system_score_gemma":0.0007733709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00232914,"about_ca_topic_score_gemma":0.001817887,"domain_scores_codex":[0.9981062,0.0006881423,0.00007411284,0.0004550391,0.0005255194,0.0001509189],"domain_scores_gemma":[0.9940031,0.004127767,0.0008165602,0.0003581802,0.0005134572,0.0001809621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003485057,0.00002316972,0.0007917074,0.0001572359,0.0000533272,0.0001156881,0.000226208,0.1718687,0.002389245,0.7995398,0.001031172,0.0237689],"study_design_scores_gemma":[0.00001561295,0.00006119734,0.0007892265,0.00003433947,0.00003934844,0.000178001,0.0001176385,0.2567713,0.001074775,0.7307257,0.01015865,0.00003425714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04986816,0.002068472,0.9307436,0.001160601,0.00013063,0.00006225815,0.000127722,0.0001781573,0.01566036],"genre_scores_gemma":[0.8760372,0.003785373,0.1108711,0.0002375715,0.0004329107,0.0002171316,0.0001927657,0.0001480057,0.008078004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003449823,"threshold_uncertainty_score":0.01195884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014679376","doi":"10.1016/j.tcs.2012.10.029","title":"On the exploration of time-varying networks","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computability; Computer science; Exploit; Class (philosophy); Node (physics); Focus (optics); Upper and lower bounds; Theoretical computer science; Mathematics; Computer security; Artificial intelligence","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Bernard Mans","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0262796194452426,"gpt":0.2461781794776854,"spread":0.2198985600324428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844757,0.0008522299,0.001351617,0.001324224,0.000885561,0.002056829,0.001551394,0.001599497,0.004712994],"category_scores_gemma":[0.01820684,0.0005918572,0.0007471698,0.002096739,0.002519562,0.004341627,0.002936776,0.001599261,0.0002325899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001157239,"about_ca_system_score_gemma":0.0009103618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003129167,"about_ca_topic_score_gemma":0.002147104,"domain_scores_codex":[0.9991415,0.0005176314,0.00002588027,0.0000919067,0.0001262213,0.0000968618],"domain_scores_gemma":[0.9869002,0.01159901,0.0004819969,0.0002916048,0.0002937625,0.0004334982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001491108,0.00004032338,0.0008531145,0.0001595227,0.00005569315,0.0001099857,0.0002756279,0.433564,0.0003528543,0.5459429,0.002546345,0.01595044],"study_design_scores_gemma":[0.00002041703,0.00002010659,0.0001121699,0.00002749485,0.00001013796,0.00003239318,0.00005834448,0.6199023,0.00005819184,0.3778011,0.001948755,0.000008616356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1366866,0.008602601,0.8100235,0.005978842,0.0003118596,0.0000880357,0.0003453136,0.0001888993,0.03777435],"genre_scores_gemma":[0.9082024,0.008438459,0.06705366,0.0005241972,0.0004852042,0.0001854866,0.0002739901,0.0001309698,0.01470563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004712994,"threshold_uncertainty_score":0.01576656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2808038031","doi":"10.1016/j.future.2018.07.040","title":"Opportunistic Edge Computing: Concepts, opportunities and research challenges","year":2018,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Scalability; Cloud computing; Edge computing; Computer science; Software deployment; Enhanced Data Rates for GSM Evolution; Distributed computing; Key (lock); Utility computing; The Internet; Edge device; Data science; Computer network; Computer security; World Wide Web; Telecommunications; Database; Software engineering; Cloud computing security; Operating system","authors":[{"name":"Richard Olaniyan","is_ca":true},{"name":"Olamilekan Fadahunsi","is_ca":true},{"name":"Muthucumaru Maheswaran","is_ca":true},{"name":"Mohamed Faten Zhani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2063548228275931,"gpt":0.3427392126485317,"spread":0.1363843898209386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186822,0.0005053631,0.0008414228,0.0008216716,0.001067402,0.005739633,0.002334402,0.001579567,0.002387079],"category_scores_gemma":[0.004712895,0.0003613569,0.0002944682,0.002087667,0.002610645,0.007891835,0.001739308,0.002287077,0.0004000289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001385351,"about_ca_system_score_gemma":0.001687896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001801862,"about_ca_topic_score_gemma":0.002341932,"domain_scores_codex":[0.9991172,0.0002695757,0.00003186202,0.0001480172,0.0002572103,0.0001760052],"domain_scores_gemma":[0.9941696,0.004256507,0.0002541128,0.0004416791,0.0005370675,0.0003410306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005866268,0.0001158728,0.001350548,0.0004254977,0.0000296709,0.0001296083,0.0002477366,0.02135344,0.00100844,0.8436848,0.007977454,0.1236182],"study_design_scores_gemma":[0.00001400125,0.00005864001,0.0005082472,0.0002157218,0.0000230101,0.0003641071,0.0008898138,0.1201834,0.0008860727,0.8213702,0.05544731,0.00003934818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.06498672,0.1540362,0.6244195,0.03407733,0.002602804,0.0002247663,0.0004558677,0.0004775519,0.1187194],"genre_scores_gemma":[0.8342898,0.08380385,0.06653548,0.001963756,0.002239716,0.0001728372,0.0001830104,0.00008502611,0.01072657],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005739633,"threshold_uncertainty_score":0.01156515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063968252","doi":"10.1109/mwc.2015.7054718","title":"Social on the road: enabling secure and efficient social networking on highways","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Context (archaeology); Internet privacy; The Internet; Information exchange; Computer security; World Wide Web; Order (exchange); Personally identifiable information; Social network (sociolinguistics); Social media; Telecommunications; Business","authors":[{"name":"Tom H. Luan","is_ca":false},{"name":"Rongxing Lu","is_ca":false},{"name":"Xuemin Shen","is_ca":true},{"name":"Fan Bai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1169675286131343,"gpt":0.3012897265651873,"spread":0.184322197952053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001369693,0.0006445905,0.0004620956,0.001164462,0.001172742,0.001505525,0.001478305,0.0007986569,0.004281596],"category_scores_gemma":[0.00347439,0.0002863606,0.0004016437,0.0005297877,0.0007998843,0.003678701,0.006900047,0.0007249142,0.002193212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006056152,"about_ca_system_score_gemma":0.0008897684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002696053,"about_ca_topic_score_gemma":0.004201775,"domain_scores_codex":[0.9983266,0.0005627764,0.00008826397,0.0002067032,0.000474916,0.0003405952],"domain_scores_gemma":[0.9982811,0.0003229237,0.0002029616,0.0005170321,0.0003929316,0.0002831098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001718282,0.0007699225,0.02018097,0.00175474,0.0002896271,0.003203209,0.00472493,0.05844105,0.03493528,0.1610884,0.1374081,0.5754854],"study_design_scores_gemma":[0.0001654934,0.001179179,0.008285071,0.000228516,0.0002029811,0.001360964,0.004385852,0.4427316,0.0206208,0.05655917,0.4639973,0.0002829449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2852283,0.004829319,0.5618827,0.004221124,0.001661594,0.002555697,0.002587848,0.03399611,0.1030374],"genre_scores_gemma":[0.9442647,0.001171031,0.03877939,0.0004269572,0.0002244045,0.0005186239,0.001514431,0.0003408302,0.01275972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004281596,"threshold_uncertainty_score":0.01432341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392796562","doi":"10.1109/tmc.2024.3377226","title":"A Unified Framework for Guiding Generative AI With Wireless Perception in Resource Constrained Mobile Edge Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Guangdong Provincial Pearl River Talents Program; Info-communications Media Development Authority; National Natural Science Foundation of China; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Computer science; Wireless; Enhanced Data Rates for GSM Evolution; Wireless network; Resource (disambiguation); Generative grammar; Mobile computing; Perception; Computer network; Mobile telephony; Distributed computing; Mobile radio; Human–computer interaction; Telecommunications; Artificial intelligence","authors":[{"name":"Jiacheng Wang","is_ca":false},{"name":"Hongyang Du","is_ca":false},{"name":"Dusit Niyato","is_ca":false},{"name":"Jiawen Kang","is_ca":false},{"name":"Zehui Xiong","is_ca":false},{"name":"Deepu Rajan","is_ca":false},{"name":"Shiwen Mao","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02564544004550459,"gpt":0.2788105216645401,"spread":0.2531650816190355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009204188,0.0006949003,0.0007324723,0.0006602798,0.0006358284,0.001149174,0.002064478,0.0009612289,0.001243663],"category_scores_gemma":[0.00265351,0.0004997265,0.0006367265,0.000556966,0.001241518,0.001921369,0.001838714,0.001173368,0.0002620064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009919518,"about_ca_system_score_gemma":0.00134244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009170949,"about_ca_topic_score_gemma":0.008361778,"domain_scores_codex":[0.9994689,0.0001380971,0.00002558348,0.0001476368,0.0001371117,0.00008271186],"domain_scores_gemma":[0.9993359,0.000338369,0.00008172209,0.00006997817,0.0001063525,0.00006760225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006236153,0.00005896112,0.001020498,0.00004581809,0.00002967331,0.0001076805,0.0002876635,0.8661676,0.005789986,0.04463396,0.0009932112,0.08080257],"study_design_scores_gemma":[0.000002935204,0.00001098373,0.0000465683,0.000001628588,0.000002501169,0.000006776659,0.00001110086,0.9958752,0.0002939897,0.00348852,0.0002559352,0.000003798513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006331536,0.00006872964,0.9924756,0.00008503027,0.000008300176,0.00002080776,0.0000119538,0.0002225461,0.0007755689],"genre_scores_gemma":[0.5721316,0.0002135044,0.4252374,0.0001583013,0.00004266245,0.0001695795,0.00007982018,0.0001201449,0.00184704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009170949,"threshold_uncertainty_score":0.01823515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155962735","doi":"10.1109/tmc.2010.229","title":"Adaptive Asynchronous Sleep Scheduling Protocols for Delay Tolerant Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Sleep mode; Computer network; Energy consumption; Distributed computing; Efficient energy use; Scalability; Power management; Network packet; Scheduling (production processes); Power consumption; Power (physics)","authors":[{"name":"Bong Jun Choi","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02207387829873364,"gpt":0.2764403257347331,"spread":0.2543664474359995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007318855,0.0004513504,0.0002853489,0.00057672,0.0006270751,0.0006468857,0.001123278,0.0003218404,0.001320115],"category_scores_gemma":[0.001583059,0.0001606844,0.0002312437,0.000514622,0.0004896477,0.0009679288,0.0006042263,0.0006365296,0.0002221482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006096285,"about_ca_system_score_gemma":0.000591101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006042654,"about_ca_topic_score_gemma":0.001083911,"domain_scores_codex":[0.999656,0.00009905057,0.00004096574,0.00005529016,0.0001218163,0.00002691651],"domain_scores_gemma":[0.9992431,0.0003234594,0.0001243163,0.0001168018,0.0001491501,0.00004315404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005415163,0.0001885893,0.001292507,0.000730222,0.000108641,0.0003273631,0.000738519,0.176653,0.07820061,0.3463905,0.006935297,0.3878933],"study_design_scores_gemma":[0.0001736108,0.0004394082,0.0004673548,0.00008216443,0.0001117544,0.0004362549,0.0002114548,0.8396121,0.02589921,0.08476686,0.04773185,0.00006799216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02344597,0.001376005,0.9695467,0.0002337196,0.0003169043,0.0001964374,0.00005012157,0.000449256,0.0043849],"genre_scores_gemma":[0.7175286,0.001979416,0.2738825,0.0003407428,0.0003593932,0.0006035446,0.0001992709,0.00009336932,0.005013099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001320115,"threshold_uncertainty_score":0.004423141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128508520","doi":"10.1016/j.comcom.2011.09.001","title":"Research challenges towards the Future Internet","year":2011,"lang":"en","type":"article","venue":"Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; The Internet; Flexibility (engineering); Protocol stack; Scalability; Architecture; Reserved IP addresses; Telecommunications; Internet Protocol; Internet research; World Wide Web; IP address management; Computer network; Wireless sensor network","authors":[{"name":"Marco Conti","is_ca":false},{"name":"Song Chong","is_ca":false},{"name":"Serge Fdida","is_ca":false},{"name":"Weijia Jia","is_ca":false},{"name":"Holger Karl","is_ca":false},{"name":"Ying‐Dar Lin","is_ca":false},{"name":"Petri Mähönen","is_ca":false},{"name":"Martin Maier","is_ca":true},{"name":"Refik Molva","is_ca":false},{"name":"Steve Uhlig","is_ca":false},{"name":"Moshe Zukerman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3571833005297325,"gpt":0.3518207627934932,"spread":0.005362537736239348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007652762,0.0005635343,0.001081207,0.002092858,0.002767833,0.009638458,0.002906413,0.00867492,0.02048361],"category_scores_gemma":[0.01002792,0.0005014923,0.0005621199,0.002809324,0.007466405,0.02912645,0.002949129,0.00700908,0.00374314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003706467,"about_ca_system_score_gemma":0.004803204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002201714,"about_ca_topic_score_gemma":0.002713131,"domain_scores_codex":[0.9981971,0.0006279938,0.00006820211,0.0002705918,0.0005839299,0.0002522159],"domain_scores_gemma":[0.988292,0.006166163,0.0005188895,0.0007142046,0.002511733,0.001796952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007215278,0.0001035192,0.0005440063,0.0005163433,0.00002021583,0.0001449808,0.0004154776,0.002948714,0.000481469,0.8394027,0.07134232,0.08400803],"study_design_scores_gemma":[0.00001766277,0.00003733255,0.0002419475,0.0004444625,0.0000148226,0.0001970886,0.002047405,0.006780014,0.0002516,0.7225974,0.2673405,0.00002987549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.01287591,0.2160379,0.04339751,0.6010722,0.008507075,0.00006037245,0.0004136039,0.0003493358,0.1172861],"genre_scores_gemma":[0.4298034,0.4108229,0.04430423,0.0505967,0.02607239,0.0003076267,0.0006817079,0.0002136044,0.0371975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02048361,"threshold_uncertainty_score":0.06852454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037324986","doi":"10.1109/tmc.2011.251","title":"Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Bayesian game; Node (physics); Computer network; Network packet; Nash equilibrium; Markov decision process; Game theory; Wireless network; Core (optical fiber); Best response; Distributed computing; Wireless; Sequential game; Markov process; Mathematical optimization; Mathematical economics; Telecommunications","authors":[{"name":"Khajonpong Akkarajitsakul","is_ca":true},{"name":"Ekram Hossain","is_ca":true},{"name":"Dusit Niyato","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02807585781632486,"gpt":0.2509028771768766,"spread":0.2228270193605518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002567111,0.0008562274,0.001353982,0.0006664323,0.0008512225,0.001576096,0.00253617,0.001910544,0.001358188],"category_scores_gemma":[0.007101113,0.0005474185,0.0008795819,0.0008811124,0.001808569,0.002912945,0.001794361,0.001658222,0.0001959557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002141207,"about_ca_system_score_gemma":0.00232746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00937498,"about_ca_topic_score_gemma":0.005596036,"domain_scores_codex":[0.9982178,0.0007590509,0.00007187163,0.0002747871,0.0004615606,0.0002149424],"domain_scores_gemma":[0.9975225,0.001639114,0.0002732991,0.00009236524,0.0002637376,0.0002089905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001345187,0.00009790247,0.0008586377,0.00009773381,0.00008611959,0.000380786,0.0004290882,0.7112695,0.00221653,0.2643159,0.001864858,0.01824834],"study_design_scores_gemma":[0.00002070546,0.00002650012,0.0001010989,0.000007441989,0.00001499915,0.00003863669,0.0000307899,0.9636123,0.0001704173,0.03517478,0.0007880277,0.00001427767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02890125,0.0001783885,0.9630004,0.0007068345,0.00003857531,0.0001391577,0.0001071843,0.0000854248,0.006842733],"genre_scores_gemma":[0.8867452,0.0005306747,0.1063012,0.0002301825,0.00006851391,0.0004045832,0.0001380219,0.00003401827,0.005547725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00937498,"threshold_uncertainty_score":0.01864082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2936076319","doi":"10.5815/ijwmt.2019.02.01","title":"Convergence of MANET in Communication among Smart Devices in IoT","year":2019,"lang":"en","type":"article","venue":"International Journal of Wireless and Microwave Technologies","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mobile ad hoc network; Computer science; Internet of Things; Information exchange; Computer network; Convergence (economics); Bridge (graph theory); Mobile device; Smart device; Computer security; Telecommunications; World Wide Web; Human–computer interaction; Network packet","authors":[{"name":"Tanweer Alam","is_ca":false},{"name":"Baha Rababah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007866064945703086,"gpt":0.2270737805588273,"spread":0.2192077156131243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006815234,0.0005946337,0.0006087341,0.001057177,0.0009102208,0.001368536,0.0007870473,0.001023243,0.002535315],"category_scores_gemma":[0.002008849,0.0002598473,0.0004597054,0.001165207,0.0006820626,0.002542743,0.001275121,0.001260263,0.0008520197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000523761,"about_ca_system_score_gemma":0.0004209208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000670911,"about_ca_topic_score_gemma":0.0006954409,"domain_scores_codex":[0.9990564,0.0003271333,0.0000466428,0.000186523,0.0002790419,0.000104162],"domain_scores_gemma":[0.999132,0.0004213281,0.00007018918,0.0001105917,0.00021263,0.00005332159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006176142,0.0002705236,0.005481926,0.001175453,0.0001926662,0.002848868,0.001691739,0.1804512,0.03147451,0.3994515,0.009511948,0.366832],"study_design_scores_gemma":[0.00004873883,0.0007453788,0.002323692,0.0002233347,0.0001537342,0.005011869,0.001096446,0.7540689,0.02372752,0.1133293,0.09914726,0.0001238955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05526417,0.008325299,0.8907246,0.0008770778,0.0008007401,0.0002533547,0.0000806508,0.0006817841,0.04299237],"genre_scores_gemma":[0.8073294,0.008077069,0.1640784,0.0006007127,0.0003623101,0.0003129164,0.0001712265,0.0001443393,0.0189237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002535315,"threshold_uncertainty_score":0.008481443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W179639306","doi":"10.5555/2095116.2095245","title":"Rumor spreading and vertex expansion","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Rumor; Vertex (graph theory); Combinatorics; Graph; Computer science; Mathematics; Discrete mathematics","authors":[{"name":"George Giakkoupis","is_ca":true},{"name":"Thomas Sauerwald","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.018086276963633,"gpt":0.2263251710791549,"spread":0.2082388941155219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002725706,0.0006665876,0.0007599244,0.002191526,0.001285584,0.001918694,0.001761003,0.0013123,0.002240654],"category_scores_gemma":[0.03708587,0.0005158547,0.0005324792,0.001657612,0.002990312,0.006116908,0.002502494,0.00197238,0.0003490619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360784,"about_ca_system_score_gemma":0.0003854041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001844914,"about_ca_topic_score_gemma":0.0009656725,"domain_scores_codex":[0.9978328,0.001135946,0.00005578756,0.0002969312,0.0003458017,0.0003326943],"domain_scores_gemma":[0.9327587,0.05521138,0.005750309,0.003739874,0.001461768,0.001077975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007654474,0.0001532883,0.01258689,0.0004403961,0.0001480101,0.0008062668,0.002369988,0.2240843,0.02218879,0.6784326,0.003144814,0.05487934],"study_design_scores_gemma":[0.00005659055,0.000182752,0.002802625,0.00007324597,0.00009125437,0.0007978177,0.0004712045,0.6384621,0.005948547,0.347232,0.003818908,0.00006282591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4884532,0.002074332,0.4916024,0.001532652,0.00007362623,0.0001250667,0.0002362395,0.0004026245,0.01549983],"genre_scores_gemma":[0.9762047,0.0009768346,0.02045178,0.0001157167,0.0001131391,0.00006806276,0.0001024094,0.0000583814,0.001908963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002725706,"threshold_uncertainty_score":0.01441509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006741433","doi":"10.1007/s11227-014-1195-9","title":"GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Hop (telecommunications); Latency (audio); Zone Routing Protocol; Distance-vector routing protocol; Distributed computing; Routing (electronic design automation); Wireless Routing Protocol; Telecommunications","authors":[{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Deepak Kumar Sharma","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Rohan Gupta","is_ca":false},{"name":"Sanjay Garg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02180578335023805,"gpt":0.2538559763131712,"spread":0.2320501929629331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005773384,0.0005238521,0.0005513745,0.0006556476,0.0006413045,0.0006971124,0.001341445,0.000840269,0.00145879],"category_scores_gemma":[0.001416913,0.0001832217,0.0003604978,0.0007720598,0.0004774554,0.0006891057,0.0008845545,0.0008316142,0.0003011671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006625534,"about_ca_system_score_gemma":0.001306008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003965994,"about_ca_topic_score_gemma":0.006775781,"domain_scores_codex":[0.9997125,0.0000722494,0.00001169252,0.00004547448,0.00009949064,0.00005854032],"domain_scores_gemma":[0.9995679,0.0001761162,0.0000621801,0.00007283302,0.00009100031,0.00002984225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002460114,0.0001503215,0.0009423741,0.0001105045,0.0001050932,0.0002963525,0.0001618925,0.7798952,0.01537319,0.03803626,0.008299285,0.1563835],"study_design_scores_gemma":[0.00004009543,0.00008335974,0.000235298,0.00000943309,0.00002390592,0.000117098,0.00003141409,0.9816477,0.003822461,0.009534546,0.004435276,0.00001940363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04836561,0.0004350166,0.9399036,0.0004478972,0.0002078144,0.0001979389,0.0002529758,0.003328716,0.006860517],"genre_scores_gemma":[0.691829,0.0004328911,0.2971267,0.0003119922,0.00003894816,0.0002770381,0.0004754732,0.0002156913,0.009292315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003965994,"threshold_uncertainty_score":0.007885814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1805437643","doi":"10.1007/978-3-642-22450-8_14","title":"MobiID: A User-Centric and Social-Aware Reputation Based Incentive Scheme for Delay/Disruption Tolerant Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Israeli Centers for Research Excellence","keywords":"Computer science; Incentive; Reputation; Scheme (mathematics); Distributed computing; Microeconomics","authors":[{"name":"Lifei Wei","is_ca":false},{"name":"Haojin Zhu","is_ca":false},{"name":"Zhenfu Cao","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02456562186060364,"gpt":0.2476865249307305,"spread":0.2231209030701269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141695,0.0006140428,0.0009430642,0.0005974902,0.001029849,0.001608961,0.002940149,0.001003677,0.00411658],"category_scores_gemma":[0.002648711,0.0003634885,0.0004606395,0.000775121,0.0005163402,0.002677006,0.002504137,0.0015431,0.001326804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114421,"about_ca_system_score_gemma":0.00140532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00123215,"about_ca_topic_score_gemma":0.001749137,"domain_scores_codex":[0.9992686,0.0001485476,0.00004894573,0.0001060294,0.0003159706,0.0001119124],"domain_scores_gemma":[0.9990569,0.000219038,0.00009444997,0.0002447002,0.0002079427,0.0001770022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001375183,0.0005149549,0.001077006,0.000649801,0.0001449793,0.0003874622,0.0004273476,0.07908768,0.03830366,0.189297,0.06839669,0.6203383],"study_design_scores_gemma":[0.0002902984,0.0005143567,0.001052477,0.00008817418,0.000122181,0.0009037314,0.00009974041,0.7540141,0.02387385,0.0787944,0.1400839,0.0001628256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01893114,0.001479104,0.9595892,0.0007936964,0.0006978533,0.0003594715,0.0004928819,0.005376286,0.01228031],"genre_scores_gemma":[0.5584728,0.001442723,0.3950845,0.0004174225,0.0003641998,0.0003923103,0.0009952041,0.0004688551,0.04236188],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00411658,"threshold_uncertainty_score":0.01377136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2910804566","doi":"10.1111/amet.12735","title":"Data centers as infrastructural in‐betweens:","year":2019,"lang":"en","type":"article","venue":"American Ethnologist","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"American-Scandinavian Foundation; Wenner-Gren Foundation; American Council of Learned Societies; National Science Foundation","keywords":"Militarism; Cloud computing; Transformative learning; Landfall; Space (punctuation); Peninsula; History; Sociology; Archaeology; Political science; Geography; Computer science; Law; Politics; Meteorology","authors":[{"name":"Alix Johnson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03290704001681011,"gpt":0.2986533073082599,"spread":0.2657462672914498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00113618,0.0002450709,0.0001578505,0.001021172,0.008420706,0.005536191,0.0004784653,0.0004051478,0.005578264],"category_scores_gemma":[0.001192433,0.0001488198,0.00009422511,0.000954091,0.01327814,0.004168856,0.004601556,0.001230109,0.0002683416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00597476,"about_ca_system_score_gemma":0.00344048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03574122,"about_ca_topic_score_gemma":0.04354616,"domain_scores_codex":[0.9990718,0.000465698,0.00002506161,0.00008850541,0.00008527179,0.0002636751],"domain_scores_gemma":[0.9992411,0.0003108809,0.0001342632,0.00006587117,0.00009526897,0.0001525603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.00007798315,0.00003583995,0.01204837,0.0001074718,0.000008839139,0.0005497828,0.3829602,0.0004717756,0.0004684629,0.5755528,0.008920925,0.01879753],"study_design_scores_gemma":[0.00001005435,0.00002903105,0.008081788,0.000389159,0.00001024789,0.000452333,0.5650754,0.0004656366,0.0004662534,0.0155456,0.4094564,0.00001801946],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6933051,0.002719896,0.00324385,0.007536992,0.000173272,0.0000633111,0.0002141019,0.00004413922,0.2926994],"genre_scores_gemma":[0.9935781,0.0006382642,0.0002495973,0.0002505111,0.0000183482,0.00001655783,0.00001821143,0.00001015959,0.005220276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03574122,"threshold_uncertainty_score":0.07106632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145473395","doi":"10.1016/j.comnet.2010.08.001","title":"Design and implementation of the KioskNet system","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Interactive kiosk; Software deployment; Computer science; Variety (cybernetics); Key (lock); Computer security; Architecture; The Internet; Software; World Wide Web; Software engineering; Engineering management; Telecommunications; Operating system","authors":[{"name":"Shimin Guo","is_ca":true},{"name":"Mohammad Derakhshani","is_ca":true},{"name":"Mohammad Hossein Falaki","is_ca":true},{"name":"Usman Ismail","is_ca":true},{"name":"Rowena Luk","is_ca":true},{"name":"Earl Oliver","is_ca":true},{"name":"Shams Rahman","is_ca":true},{"name":"Aaditeshwar Seth","is_ca":true},{"name":"Matei Zaharia","is_ca":true},{"name":"Srinivasan Keshav","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01117332777418436,"gpt":0.2269275386593774,"spread":0.215754210885193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842842,0.0003088894,0.0004704758,0.0003976333,0.0005631858,0.001279555,0.001696362,0.0006654508,0.00656918],"category_scores_gemma":[0.001044701,0.0002956114,0.0002017665,0.0002273072,0.0004068967,0.0008545765,0.0007447359,0.0006169748,0.001658569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005120373,"about_ca_system_score_gemma":0.001345755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001781914,"about_ca_topic_score_gemma":0.001810316,"domain_scores_codex":[0.9995083,0.00008736791,0.00003825188,0.00008875915,0.0001768462,0.0001005091],"domain_scores_gemma":[0.999624,0.00005888794,0.0000339097,0.00007797144,0.0001495304,0.00005564243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002121978,0.0009436387,0.007340576,0.001154806,0.0002397334,0.0009449098,0.001084523,0.2867151,0.1797737,0.09341672,0.01462826,0.411636],"study_design_scores_gemma":[0.0003707756,0.001029334,0.001620122,0.00008864286,0.00013683,0.0004323577,0.0002533933,0.8075738,0.1092146,0.01023474,0.06895754,0.0000878325],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09517945,0.0002654675,0.8757147,0.0002963996,0.000233126,0.0008733188,0.000226154,0.008294824,0.01891664],"genre_scores_gemma":[0.7566537,0.0001853224,0.2311469,0.0001629306,0.00002990339,0.0005060824,0.0003551101,0.0002751608,0.01068486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00656918,"threshold_uncertainty_score":0.02197611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030064374","doi":"10.1109/tvt.2012.2200001","title":"Modeling and Delay Analysis of Intermittently Connected Roadside Communication Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Bundle; Queueing theory; Computer network; Computer science; Context (archaeology); Network packet; The Internet; Distributed computing","authors":[{"name":"Maurice Khabbaz","is_ca":true},{"name":"Wissam Fawaz","is_ca":true},{"name":"Chadi Assi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01523892073542964,"gpt":0.2383245204603154,"spread":0.2230855997248858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004705435,0.0006452663,0.0004843901,0.00065801,0.0004196287,0.0008141296,0.001013902,0.0007849565,0.001034321],"category_scores_gemma":[0.002094715,0.0003385757,0.0003899115,0.0005961674,0.0006585537,0.0009262471,0.0005406417,0.0005329699,0.0001866184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00177579,"about_ca_system_score_gemma":0.0007164061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01272473,"about_ca_topic_score_gemma":0.005608895,"domain_scores_codex":[0.9997367,0.00006626028,0.00001178375,0.00006280497,0.00006962706,0.00005278994],"domain_scores_gemma":[0.9992549,0.0003742013,0.0001750825,0.00003188815,0.0001270876,0.00003678879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001117631,0.000005199097,0.000478065,0.000009479449,0.000005290453,0.00004338417,0.00002912292,0.9905691,0.000504749,0.007133706,0.0001376246,0.001073095],"study_design_scores_gemma":[6.666859e-7,0.000002941803,0.00005508456,8.56646e-7,0.000001218887,0.000005196081,0.000004908369,0.9987082,0.00004829156,0.001074403,0.0000967753,0.000001358367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.241441,0.000962268,0.7473679,0.0006414679,0.00006256091,0.00007661417,0.0003358059,0.000290445,0.008821872],"genre_scores_gemma":[0.98862,0.0004699116,0.008101473,0.00003007298,0.00002654391,0.00004580153,0.00009861395,0.0000272581,0.002580347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01272473,"threshold_uncertainty_score":0.02530134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046773087","doi":"10.1007/s00224-011-9341-8","title":"Searching for Black Holes in Subways","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Government of Canada; University of Ottawa","funders":"","keywords":"Computer science","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Matthew Kellett","is_ca":true},{"name":"Peter C. Mason","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07450081417601022,"gpt":0.2626419194833614,"spread":0.1881411053073511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506826,0.0005445331,0.001572269,0.001465368,0.00254674,0.003680699,0.002587455,0.002554673,0.008570745],"category_scores_gemma":[0.01618391,0.001041388,0.001036373,0.001705232,0.003169397,0.008643508,0.003927844,0.001983308,0.0005107448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121904,"about_ca_system_score_gemma":0.001291176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003319189,"about_ca_topic_score_gemma":0.003959463,"domain_scores_codex":[0.9989009,0.0004457995,0.00004050522,0.000197827,0.0001664904,0.0002485444],"domain_scores_gemma":[0.9894924,0.007067375,0.0008900506,0.001219764,0.0005760854,0.0007542366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000439424,0.0001000603,0.002727063,0.0001711261,0.00007087667,0.0002365809,0.0006907252,0.1031981,0.001023847,0.8637097,0.006434777,0.02119767],"study_design_scores_gemma":[0.00004578122,0.00002992649,0.000229384,0.00003018693,0.00002523473,0.000080561,0.0005246651,0.2511713,0.0005581509,0.7438564,0.003430801,0.00001759012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4033147,0.001357737,0.5604635,0.004006244,0.0002720672,0.0001884777,0.000409668,0.0004352231,0.02955234],"genre_scores_gemma":[0.9128241,0.0007360769,0.07428595,0.0003483164,0.00008987156,0.0001019666,0.0002343071,0.0001297006,0.01124971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008570745,"threshold_uncertainty_score":0.02867198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130741280","doi":"10.5539/cis.v1n1p69","title":"Disruption Tolerant Networking","year":2008,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Delay-tolerant networking; Path (computing); Computer network; Telecommunications; Routing (electronic design automation); Routing protocol","authors":[{"name":"Kevin Curran","is_ca":false},{"name":"James Knox","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02193169884224285,"gpt":0.2297966902070549,"spread":0.207864991364812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006845634,0.0007117853,0.0005901738,0.0008583202,0.001118614,0.00287075,0.001622738,0.001236977,0.01302913],"category_scores_gemma":[0.002146374,0.0002466588,0.0003426547,0.001167687,0.0008098829,0.002650897,0.002169418,0.001476942,0.006926538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000931131,"about_ca_system_score_gemma":0.0009145666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008772475,"about_ca_topic_score_gemma":0.0009416196,"domain_scores_codex":[0.9989696,0.0001457819,0.00004695911,0.0001819735,0.0005326503,0.0001230984],"domain_scores_gemma":[0.9988465,0.0002469501,0.0001060037,0.000287869,0.0003802638,0.0001323352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001508383,0.0001162492,0.000982995,0.0008741434,0.00007064882,0.0004203833,0.0002615901,0.02168491,0.01586645,0.2906252,0.1077696,0.561177],"study_design_scores_gemma":[0.00002046867,0.0001254508,0.0004557254,0.0002449397,0.00003456908,0.001039751,0.0001594965,0.04083538,0.006522604,0.1331533,0.8173474,0.00006092458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009277297,0.03533849,0.6549656,0.005825484,0.00466227,0.0005388671,0.00101346,0.004736308,0.2836422],"genre_scores_gemma":[0.4236265,0.08619054,0.2654055,0.00589601,0.00418515,0.0008747765,0.004092598,0.0008017904,0.208927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01302913,"threshold_uncertainty_score":0.04358679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016722709","doi":"10.1002/net.1033","title":"Minimum linear gossip graphs and maximal linear (Δ, <i>k</i>)‐gossip graphs","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Gossip; Combinatorics; Graph; Mathematics; Discrete mathematics; Computer science; Node (physics)","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Joseph G. Peters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0185127435136274,"gpt":0.2372820739664975,"spread":0.2187693304528701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461424,0.0002818685,0.000274418,0.0006137722,0.000761085,0.0007952516,0.0007336938,0.0004073688,0.002790596],"category_scores_gemma":[0.002570655,0.0002758971,0.0004073206,0.0005072013,0.0008406417,0.001191969,0.0006508479,0.0006495084,0.0002711456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003554,"about_ca_system_score_gemma":0.0004476517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001582478,"about_ca_topic_score_gemma":0.001338388,"domain_scores_codex":[0.999594,0.0001148831,0.00002593593,0.00007694559,0.00008811639,0.0001000614],"domain_scores_gemma":[0.9965502,0.001755588,0.0006224696,0.0002646419,0.0004918813,0.000315206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000888438,0.0002084467,0.006680901,0.00070527,0.00009979469,0.0007941177,0.001475084,0.18518,0.05028477,0.6739157,0.01080203,0.06896548],"study_design_scores_gemma":[0.0001290681,0.0002870907,0.00396426,0.000084868,0.00007303127,0.0009264885,0.0008055577,0.4575421,0.02611166,0.4973979,0.01260822,0.00006976492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6578131,0.0003489258,0.3173657,0.0007544945,0.00002297807,0.0001292263,0.0008301831,0.0006742647,0.02206127],"genre_scores_gemma":[0.9607081,0.0001084145,0.03571322,0.0001109737,0.00001625007,0.00009791199,0.000595851,0.000053148,0.00259607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002790596,"threshold_uncertainty_score":0.009335458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007719809","doi":"10.1016/j.jpdc.2010.12.009","title":"The impact of mobility on Mobile Ad Hoc Networks through the perspective of complex networks","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Wireless ad hoc network; Vehicular ad hoc network; Mobility model; Network topology; Wireless network; Perspective (graphical); Optimized Link State Routing Protocol; Wireless; Distributed computing; Telecommunications; Network packet","authors":[{"name":"Cristiano Rezende","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true},{"name":"Richard W. Pazzi","is_ca":true},{"name":"Bruno P. S. Rocha","is_ca":false},{"name":"Antônio A. F. Loureiro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04403697820227219,"gpt":0.2981529466302975,"spread":0.2541159684280253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297024,0.000489518,0.0004224982,0.0007865765,0.0008979103,0.002799509,0.0007385264,0.001332246,0.001891907],"category_scores_gemma":[0.005290937,0.0003198244,0.0003155954,0.001064001,0.002131824,0.005671357,0.001165815,0.001298736,0.000230889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113945,"about_ca_system_score_gemma":0.0004744186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00245603,"about_ca_topic_score_gemma":0.001797949,"domain_scores_codex":[0.9994692,0.0002773889,0.00001369975,0.00004673066,0.0001361285,0.00005673629],"domain_scores_gemma":[0.9972887,0.00184814,0.0002692484,0.0001465709,0.00026043,0.0001868406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004125276,0.00002935422,0.001165131,0.0001304553,0.00003508322,0.0003697508,0.0004286747,0.1092651,0.0009082282,0.8696592,0.002070402,0.01589737],"study_design_scores_gemma":[0.00002054849,0.00008596219,0.001567976,0.0001004382,0.00004711355,0.0002897718,0.000615522,0.327007,0.0002494391,0.6469761,0.02300368,0.00003645444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2431754,0.06079837,0.4785358,0.05198096,0.00321506,0.00008969602,0.0003703405,0.00009642122,0.161738],"genre_scores_gemma":[0.9642056,0.02066405,0.008298759,0.0004196326,0.001877106,0.00003294907,0.00002749076,0.00002744952,0.004446833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002799509,"threshold_uncertainty_score":0.008267283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2800057146","doi":"10.1109/access.2018.2831247","title":"A Time-Ordered Aggregation Model-Based Centrality Metric for Mobile Social Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Centrality; Computer science; Metric (unit); Measure (data warehouse); Interval (graph theory); Network controllability; Katz centrality; Graph; Time complexity; Network theory; Theoretical computer science; Mathematics; Data mining; Algorithm; Betweenness centrality; Statistics; Combinatorics","authors":[{"name":"Huan Zhou","is_ca":false},{"name":"Mengni Ruan","is_ca":false},{"name":"Chunsheng Zhu","is_ca":true},{"name":"Victor C. M. Leung","is_ca":true},{"name":"Shouzhi Xu","is_ca":false},{"name":"Chung‐Ming Huang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04058898984324828,"gpt":0.3177905462529564,"spread":0.2772015564097081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212094,0.0008143841,0.0005316918,0.001951141,0.0006831523,0.001164779,0.001034571,0.000665297,0.0007916888],"category_scores_gemma":[0.004220541,0.0001857861,0.0006506584,0.002407402,0.0004874167,0.002664632,0.0006394595,0.0007260515,0.0002204041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001994942,"about_ca_system_score_gemma":0.001103564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01095592,"about_ca_topic_score_gemma":0.0102338,"domain_scores_codex":[0.9986086,0.0003727233,0.00009432587,0.0003204568,0.0005094098,0.00009449803],"domain_scores_gemma":[0.9984536,0.0005574239,0.0003036949,0.0001548864,0.0004406158,0.00008962395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001142265,0.0001029686,0.006944453,0.0002129101,0.0001240033,0.0003282609,0.0003644735,0.7108876,0.009496863,0.1386314,0.005318212,0.1274746],"study_design_scores_gemma":[0.000005449092,0.00004388935,0.0008574143,0.000009501284,0.00002649118,0.0001127725,0.00005299365,0.9759007,0.0008049997,0.01937624,0.00278987,0.00001966741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03038086,0.000674621,0.9644835,0.0003373995,0.0001240183,0.00009880619,0.0003058382,0.0003442294,0.00325076],"genre_scores_gemma":[0.8598855,0.0009295818,0.1356381,0.0001088354,0.0001672991,0.0002163659,0.0006156354,0.0000570098,0.002381652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01095592,"threshold_uncertainty_score":0.02178431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170308744","doi":"10.1007/s11036-008-0131-8","title":"DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking","year":2009,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Computer science; Computer network; Roaming; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Wireless network; Node (physics); Delay-tolerant networking; Geographic routing; Heterogeneous network; Routing (electronic design automation); Routing protocol; Wireless; Wireless Routing Protocol; Telecommunications","authors":[{"name":"Hany Samuel","is_ca":true},{"name":"Weihua Zhuang","is_ca":true},{"name":"Bruno R. Preiss","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01455350726314988,"gpt":0.2568117510979012,"spread":0.2422582438347513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511994,0.0004882954,0.001066913,0.001010969,0.001163603,0.0007935155,0.001576609,0.000623355,0.0008525444],"category_scores_gemma":[0.002835756,0.0003491692,0.0005213485,0.001229803,0.0005844376,0.00138871,0.001078681,0.000522089,0.0001780691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139523,"about_ca_system_score_gemma":0.0008759609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001667001,"about_ca_topic_score_gemma":0.003758057,"domain_scores_codex":[0.9992799,0.0002903305,0.0000482591,0.0001176419,0.000200446,0.00006345131],"domain_scores_gemma":[0.998845,0.0006008469,0.0001056718,0.0001286347,0.0002215149,0.00009842805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000389759,0.0001303692,0.001228214,0.0003338169,0.0001440338,0.0001836705,0.0002619799,0.8120399,0.009928519,0.04461705,0.00575537,0.1249874],"study_design_scores_gemma":[0.00001604248,0.00008144626,0.0001637602,0.00001041457,0.00003346442,0.0001036035,0.00003689525,0.9813884,0.00162675,0.01400972,0.00251763,0.00001183124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03452369,0.001305577,0.9600277,0.0003814332,0.0003062123,0.0001566689,0.0001677362,0.0002357906,0.002895197],"genre_scores_gemma":[0.702659,0.001470778,0.2887902,0.0002748373,0.0001854352,0.0002645149,0.0005466846,0.00009481746,0.005713764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001667001,"threshold_uncertainty_score":0.00826782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2752406850","doi":"10.1016/j.jpdc.2017.08.008","title":"A location Prediction-based routing scheme for opportunistic networks in an IoT scenario","year":2017,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Node (physics); Overhead (engineering); Markov chain; Network packet; Geographic routing; Routing (electronic design automation); Scheme (mathematics); Routing protocol; Reliability (semiconductor); Internet of Things; Distributed computing; Dynamic Source Routing; Computer security","authors":[{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Satya Jyoti Borah","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Aman Bansal","is_ca":false},{"name":"Apoorv Gupta","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04185171047291864,"gpt":0.2931014631230441,"spread":0.2512497526501254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757337,0.0005308819,0.0009195046,0.000660631,0.001117132,0.000721027,0.001745314,0.0007159099,0.0009623647],"category_scores_gemma":[0.00144641,0.0002963281,0.0003357515,0.0009214336,0.0004403522,0.001236314,0.001569179,0.0005850044,0.000265065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007234105,"about_ca_system_score_gemma":0.001052291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005315522,"about_ca_topic_score_gemma":0.009116574,"domain_scores_codex":[0.9995893,0.00007399397,0.00003150612,0.00009388927,0.0001228812,0.0000885119],"domain_scores_gemma":[0.9993157,0.000184544,0.00008200867,0.0001530941,0.0001948838,0.00006980207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006808408,0.000337104,0.00354018,0.0001552099,0.0001181313,0.000662151,0.0003129564,0.6146309,0.03121547,0.03104074,0.01149545,0.3058108],"study_design_scores_gemma":[0.0000154914,0.00007409268,0.0002754492,0.000005742733,0.00001992733,0.0001418573,0.00004553356,0.9927889,0.001711628,0.003568658,0.001333022,0.0000198764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07961163,0.0007658866,0.9127372,0.0005057449,0.0003583591,0.0001478164,0.0002091816,0.001107189,0.004557003],"genre_scores_gemma":[0.9146215,0.0002721476,0.08262729,0.00010166,0.00006652268,0.00005665684,0.0001868595,0.00003325009,0.002034078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005315522,"threshold_uncertainty_score":0.01056916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117987433","doi":"10.1109/mobiq.2006.340403","title":"An Empirical Evaluation of the Student-Net Delay Tolerant Network","year":2006,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Computer network; Net (polyhedron); Mathematics","authors":[{"name":"Jing Su","is_ca":true},{"name":"Ashvin Goel","is_ca":true},{"name":"Eyal de Lara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03743628616115367,"gpt":0.325367008946271,"spread":0.2879307227851173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01628469,0.0005363117,0.0004598055,0.003263971,0.001428203,0.001541698,0.002313864,0.001271736,0.003105444],"category_scores_gemma":[0.08618622,0.0002038817,0.0003598756,0.002753126,0.001816691,0.005459296,0.001496231,0.001404049,0.0004885386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003285532,"about_ca_system_score_gemma":0.0009617158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004194368,"about_ca_topic_score_gemma":0.00377939,"domain_scores_codex":[0.9934407,0.004079365,0.000349461,0.0006958988,0.001098413,0.000336126],"domain_scores_gemma":[0.8268766,0.1411431,0.01126956,0.006833999,0.009171142,0.004705466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.004605517,0.002516667,0.4556427,0.00125508,0.000595502,0.0005680041,0.002829194,0.322543,0.001823105,0.04707312,0.01800738,0.1425407],"study_design_scores_gemma":[0.0002836165,0.003229827,0.05620079,0.0001532502,0.0001701413,0.0008561137,0.005057469,0.9001113,0.002225148,0.02026477,0.01135426,0.00009329891],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9651986,0.0009290206,0.02351778,0.001241222,0.0001331877,0.0003745442,0.001795218,0.0002449267,0.006565305],"genre_scores_gemma":[0.9893862,0.0002135532,0.008469122,0.00005942861,0.00003750766,0.0001378704,0.001152628,0.00002439164,0.0005193161],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01628469,"threshold_uncertainty_score":0.08612269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095068881","doi":"10.1145/1755743.1755773","title":"Social-Greedy","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Greedy algorithm; Bootstrapping (finance); Routing (electronic design automation); Simple (philosophy); Task (project management); Computer network; Wireless; Distributed computing; Process (computing); Algorithm; Telecommunications; Mathematics; Engineering","authors":[{"name":"Kazem Jahanbakhsh","is_ca":true},{"name":"Gholamali C. Shoja","is_ca":true},{"name":"Valerie King","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0179990810014534,"gpt":0.2544887901985314,"spread":0.236489709197078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391716,0.001141993,0.0009855466,0.001149036,0.001733124,0.001444036,0.002302028,0.001417069,0.007368953],"category_scores_gemma":[0.004897075,0.0003851661,0.0008034073,0.001265659,0.00110564,0.002367072,0.002155972,0.0007625645,0.002270937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410544,"about_ca_system_score_gemma":0.002133958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001962702,"about_ca_topic_score_gemma":0.004033078,"domain_scores_codex":[0.9988576,0.0003485667,0.00005915518,0.0002898762,0.0002955018,0.0001492312],"domain_scores_gemma":[0.9981014,0.0007904276,0.0001953727,0.0004430908,0.0003226424,0.0001470326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004437004,0.0002875605,0.002805478,0.0005945722,0.0002120918,0.000324359,0.0004245983,0.2924117,0.00926815,0.2722893,0.04306456,0.3778739],"study_design_scores_gemma":[0.0001112638,0.00024374,0.0006738695,0.00005649601,0.00007633259,0.0004750869,0.0002680141,0.7299841,0.00455218,0.2248515,0.03865784,0.00004954509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02084587,0.0005429502,0.9525363,0.001014746,0.0002857613,0.0004543548,0.0005294232,0.001405496,0.02238517],"genre_scores_gemma":[0.4310822,0.0007488852,0.5418609,0.0007840121,0.0001989825,0.0007995966,0.001340952,0.0003607388,0.02282369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007368953,"threshold_uncertainty_score":0.02465159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2762470713","doi":"10.1109/ihtc.2017.8058172","title":"On D2D communications for public safety applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search and rescue; Computer science; Wireless; Provisioning; Drone; Cellular network; Computer network; Wireless network; Mobile telephony; Mobile radio; Telecommunications","authors":[{"name":"Ali Alnoman","is_ca":true},{"name":"Alagan Anpalagan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1033413420705414,"gpt":0.3254762216584948,"spread":0.2221348795879534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003883344,0.0007066547,0.0003741889,0.001139459,0.0005541238,0.001266687,0.0007056012,0.001503851,0.01414262],"category_scores_gemma":[0.0007887532,0.0002741458,0.0002575169,0.002026409,0.0005117072,0.00185029,0.0009741956,0.0012246,0.006454634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006295179,"about_ca_system_score_gemma":0.0004396036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001504727,"about_ca_topic_score_gemma":0.001459204,"domain_scores_codex":[0.999615,0.00007465166,0.00002211882,0.00006515227,0.0001700324,0.0000529807],"domain_scores_gemma":[0.9994836,0.0001717282,0.00003656137,0.00005310018,0.000225894,0.0000290543],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001857481,0.0000970375,0.001123413,0.001463042,0.00004159588,0.0005668921,0.0001935059,0.009713449,0.01703971,0.09348131,0.1559101,0.7201842],"study_design_scores_gemma":[0.00001073103,0.0001213981,0.0008638804,0.00038657,0.00002536941,0.0006371155,0.0001438785,0.02160487,0.004263555,0.02228689,0.9496241,0.0000316838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.01163716,0.4156654,0.2014109,0.01253781,0.008569967,0.0003170681,0.0005573144,0.000885643,0.3484186],"genre_scores_gemma":[0.1994323,0.5309352,0.05127575,0.006178103,0.009300272,0.000362894,0.00135561,0.0002041799,0.2009557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01414262,"threshold_uncertainty_score":0.04731172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033777448","doi":"10.1016/s0736-5853(00)00024-1","title":"Mobile computing and ubiquitous networking: concepts, technologies and challenges","year":2001,"lang":"en","type":"article","venue":"Telematics and Informatics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Ubiquitous computing; Mobile technology; Mobile computing; Internet privacy; Multimedia; Telecommunications; World Wide Web; Human–computer interaction","authors":[{"name":"Samuel Pierre","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03122165449826553,"gpt":0.2588073198011088,"spread":0.2275856653028433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003657964,0.0009839217,0.001622002,0.001986992,0.001735135,0.01073545,0.002307417,0.004485799,0.003470838],"category_scores_gemma":[0.004574084,0.0007428214,0.0004650027,0.003835782,0.005985845,0.01734261,0.002832512,0.005288694,0.001145391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001764565,"about_ca_system_score_gemma":0.001968116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001152763,"about_ca_topic_score_gemma":0.00174299,"domain_scores_codex":[0.9980713,0.0006398214,0.0001066668,0.0002326038,0.0007721824,0.0001774685],"domain_scores_gemma":[0.9956679,0.002880665,0.0002379269,0.0002350289,0.000644558,0.0003339237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000053318,0.00009405717,0.001403604,0.001178748,0.0000308492,0.0002414746,0.000729145,0.002698102,0.001765206,0.7392455,0.01813061,0.2344294],"study_design_scores_gemma":[0.00001939963,0.000117314,0.0009838496,0.000971266,0.00003717524,0.001536538,0.002758797,0.01994395,0.000853752,0.6468964,0.3257811,0.0001004265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.01216806,0.704945,0.1616084,0.07327036,0.003706238,0.0001022057,0.0001649315,0.0003274466,0.04370745],"genre_scores_gemma":[0.2087483,0.6480438,0.102057,0.007589796,0.01514632,0.0004464622,0.0002211688,0.0001223594,0.01762485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01073545,"threshold_uncertainty_score":0.0193454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}