{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008218889,0.00005132786,0.00006044113,0.00002063711,0.00003719593,0.00006011597,0.0003231813,0.00003113521,0.00005574765],"category_scores_gemma":[7.017148e-7,0.00004073121,0.00002548057,0.0001106443,0.000007801654,0.0001594187,0.00003130029,0.00005213507,0.0001203537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005335384,"about_ca_system_score_gemma":0.00002523222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002699184,"about_ca_topic_score_gemma":4.596855e-7,"domain_scores_codex":[0.9995297,0.000009971157,0.00008682442,0.0001425078,0.00008778497,0.0001431638],"domain_scores_gemma":[0.999594,0.00001878357,0.00001594895,0.0002745604,0.00002020562,0.00007647337],"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":[8.949281e-7,0.00002336496,0.00002769897,2.849497e-7,0.000001187712,0.00002671617,0.00003596606,0.000008075941,0.00003554786,0.4898563,0.0175611,0.4924228],"study_design_scores_gemma":[0.0001712743,0.0001297978,0.0007721632,0.000004931844,0.000001503201,0.00004083086,0.000005276909,0.8963993,0.0001959149,0.07641645,0.02569185,0.0001707021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005114415,0.00002549734,0.7852603,0.001869484,0.0001014505,0.00002750142,6.592099e-8,0.0001698769,0.2120344],"genre_scores_gemma":[0.9491211,0.000008360525,0.0420393,0.005293202,0.0000575354,7.672452e-7,4.548239e-7,0.000001209419,0.003478062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9486097,"threshold_uncertainty_score":0.1660971,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001586405,0.00008567326,0.0001644896,0.00001061335,0.0001045537,0.00006307168,0.0001628827,0.00005956116,0.00003085037],"category_scores_gemma":[0.000001182966,0.00007122853,0.00003970001,0.0001387806,0.00005327862,0.0001886928,0.00007941708,0.00006139656,0.000003148255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001198845,"about_ca_system_score_gemma":0.00002594805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001854381,"about_ca_topic_score_gemma":0.000001156362,"domain_scores_codex":[0.999239,0.0000206018,0.0001905464,0.000187344,0.0001365434,0.0002259299],"domain_scores_gemma":[0.9996433,0.0000320164,0.00006738761,0.0001325618,0.00005617217,0.00006861032],"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.0001036262,0.000356651,0.006206528,0.00001660961,0.00005332777,0.00002965258,0.0003730689,0.002132072,0.0002307695,0.4864247,0.1470397,0.3570333],"study_design_scores_gemma":[0.0005181936,0.0002947831,0.01450641,0.00001582455,0.00001277826,0.000011324,0.00003629633,0.9771791,0.00009751352,0.003790271,0.003359627,0.0001779479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1633286,0.0002065079,0.8339746,0.0002903402,0.0001041632,0.0001139661,0.000006756519,0.00006077023,0.00191433],"genre_scores_gemma":[0.9929911,0.0000268182,0.006262975,0.0002864688,0.0001148331,0.000003438302,0.00002053177,0.000002019121,0.0002918142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.975047,"threshold_uncertainty_score":0.2904615,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000651677,0.0001758638,0.0002293974,0.00008185632,0.00009649272,0.0001853966,0.0004587407,0.000141525,0.0001148233],"category_scores_gemma":[0.00001030311,0.000153646,0.00006376005,0.0003989051,0.00003805244,0.000702236,0.0002509937,0.0004088662,0.0001309877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006134761,"about_ca_system_score_gemma":0.0001150658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004086487,"about_ca_topic_score_gemma":0.00008207664,"domain_scores_codex":[0.9981385,0.00008429672,0.0004539388,0.000446419,0.0002710733,0.0006057621],"domain_scores_gemma":[0.9989114,0.0002755451,0.00008661856,0.0004808051,0.00004661894,0.0001989896],"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.0000235744,0.0002782927,0.002690797,0.000003503512,0.00001732963,0.0005584064,0.0003698829,0.01184693,0.000004492531,0.3797166,0.01682431,0.5876659],"study_design_scores_gemma":[0.0003662089,0.00002974996,0.000277462,0.000018784,0.000003447181,0.0001599231,0.00002360843,0.9924276,0.000005641388,0.0004109404,0.006062426,0.0002141462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001778185,0.00006047925,0.9526486,0.004547528,0.0003040096,0.000119942,1.956921e-7,0.000204248,0.04033685],"genre_scores_gemma":[0.8571328,0.00002372458,0.1394234,0.002446392,0.0003331446,0.000007525528,0.000001852385,0.000009746929,0.0006213694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9805807,"threshold_uncertainty_score":0.6265504,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002685014,0.0001203404,0.0001529753,0.00004001315,0.0001044129,0.0001751727,0.0007615397,0.00009156808,0.00004311192],"category_scores_gemma":[0.00000319753,0.0001067953,0.00007990922,0.0001231738,0.0000360679,0.0002286232,0.0002771511,0.0001080821,0.00002489332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004314556,"about_ca_system_score_gemma":0.00004400713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002361979,"about_ca_topic_score_gemma":0.0000915871,"domain_scores_codex":[0.9990414,0.00004340664,0.0002936071,0.0002072503,0.0001435935,0.0002707524],"domain_scores_gemma":[0.9990219,0.0001497707,0.00008647075,0.0005803854,0.00008745059,0.00007400429],"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.0000335852,0.0002060272,0.0001683341,0.00001768798,0.00001941781,0.000007358136,0.00008595582,0.0004104149,0.0006282871,0.8035455,0.02220929,0.1726681],"study_design_scores_gemma":[0.0003551964,0.00002623411,0.00005198323,0.00002998836,0.000007276371,0.00001894068,0.00001813535,0.9814381,0.0004618999,0.01406172,0.003378471,0.0001520267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006302746,0.00003782289,0.9869361,0.000436084,0.0002641434,0.0002597789,0.000003011736,0.0001364448,0.005623895],"genre_scores_gemma":[0.8534569,0.000004514625,0.1448579,0.0004674498,0.00007829729,0.00001373231,0.00003368756,0.000008768818,0.00107878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9810277,"threshold_uncertainty_score":0.4354985,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110843,0.0001096336,0.0001036737,0.00003491973,0.0003220503,0.0001727614,0.001213131,0.0000669478,0.00007047872],"category_scores_gemma":[0.000003352974,0.00007053361,0.0000498262,0.0002363879,0.0001230785,0.00017792,0.0003077502,0.0001824111,0.0001139005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002665764,"about_ca_system_score_gemma":0.0000775166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004422017,"about_ca_topic_score_gemma":0.00002763456,"domain_scores_codex":[0.9989673,0.00006202068,0.000255833,0.0002049872,0.0002188371,0.0002910044],"domain_scores_gemma":[0.9982418,0.0003015451,0.00007960644,0.001174263,0.00008235598,0.0001204376],"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.000006047132,0.00006473705,0.0001539107,0.000003595009,0.00002190453,0.00003536182,0.000200911,0.00005402075,0.000300162,0.8887596,0.0163738,0.09402592],"study_design_scores_gemma":[0.0006402275,0.00009590603,0.003678799,0.00004619627,0.00003803265,0.0001918606,0.0006760458,0.8146392,0.000502557,0.04308924,0.1357938,0.0006081333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001941085,0.000240482,0.9362143,0.003171782,0.0002087212,0.0001166096,5.93136e-7,0.0001326131,0.05797385],"genre_scores_gemma":[0.9690129,0.00006410078,0.02318521,0.004980993,0.00004958776,0.000003474829,0.000009558354,0.000007524577,0.00268661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9670718,"threshold_uncertainty_score":0.2876277,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001928975,0.00007967551,0.00009854362,0.0001054614,0.00006485216,0.00001235341,0.0002542137,0.00006466831,0.00006535165],"category_scores_gemma":[0.000002720569,0.0000738137,0.00002714337,0.0002825001,0.00002376699,0.0001919067,0.00001299033,0.0001046638,0.00002704142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003977319,"about_ca_system_score_gemma":0.00007987591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000374078,"about_ca_topic_score_gemma":0.00003040689,"domain_scores_codex":[0.9991181,0.00001484615,0.0002028635,0.0002732154,0.0002298576,0.0001611012],"domain_scores_gemma":[0.9995361,0.00005378587,0.00003171768,0.0002762184,0.00002706414,0.00007508902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002024398,0.001153433,0.7246774,0.00004181073,0.00001995775,0.0008197461,0.006735869,0.03346977,0.00009455836,0.08780918,0.03203769,0.1129382],"study_design_scores_gemma":[0.0003300381,0.00005149551,0.06364801,0.00001745824,0.000001457256,0.000005712665,0.000005534774,0.935172,0.00003283548,0.0002083735,0.0004538712,0.00007327912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03070843,0.000008293246,0.9339071,0.0003767974,0.0003030121,0.0001100323,0.000001515234,0.0001680336,0.03441682],"genre_scores_gemma":[0.9943014,0.000006789078,0.004460821,0.0005006632,0.00007147135,0.00001255033,0.0000215662,0.000004551947,0.0006201756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.963593,"threshold_uncertainty_score":0.3010035,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006267102,0.0002936266,0.0003162771,0.0001814884,0.0006095817,0.0002394256,0.003749873,0.0001432554,0.000006145201],"category_scores_gemma":[0.000005151011,0.0003118026,0.0000816479,0.001705809,0.0001178805,0.0004065371,0.0007112914,0.0004145486,0.0002409147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001147394,"about_ca_system_score_gemma":0.00008918434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001592025,"about_ca_topic_score_gemma":0.0001185945,"domain_scores_codex":[0.997588,0.0002527141,0.0005644261,0.0006611423,0.0003454039,0.0005882924],"domain_scores_gemma":[0.9935809,0.000200408,0.0002198276,0.005344719,0.0002465261,0.000407654],"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.00006147802,0.0008489591,0.0002127916,0.000007446012,0.00003783992,0.00007111538,0.0010791,0.003690901,0.0001752545,0.01471391,0.009325238,0.969776],"study_design_scores_gemma":[0.0001848283,0.00006791046,0.0001011622,0.00001860627,0.00001339909,0.0004916238,0.00002352697,0.5902012,0.000001017694,0.0006444407,0.4080096,0.0002426578],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001744283,0.001346325,0.9509059,0.001167776,0.0007952259,0.0006200587,0.00000330387,0.0005713641,0.04284572],"genre_scores_gemma":[0.8059149,0.001420647,0.1889785,0.001351447,0.000701069,0.0002287783,0.0001975495,0.00004120909,0.001165882],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695333,"threshold_uncertainty_score":0.9999334,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019769,0.000137408,0.000188485,0.00008070996,0.00007499028,0.00009494773,0.0003184168,0.0001234172,0.00002890371],"category_scores_gemma":[0.00000314146,0.0001191304,0.00003149421,0.0003375342,0.00005649112,0.0002708556,0.0002184849,0.0002419393,0.000006932869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002326215,"about_ca_system_score_gemma":0.00003258013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001156969,"about_ca_topic_score_gemma":0.0003813544,"domain_scores_codex":[0.9986725,0.00003743457,0.0003037553,0.0003663072,0.0001677464,0.0004522198],"domain_scores_gemma":[0.9991941,0.0001877823,0.00004816331,0.0003354927,0.00003471324,0.0001996904],"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.00008683161,0.0002896844,0.06211999,0.00001957678,0.00002225169,0.00175136,0.001202811,0.0007293261,0.00001205952,0.1788511,0.005897895,0.7490171],"study_design_scores_gemma":[0.0003890195,0.00003834851,0.008013339,0.00001311341,0.000002124302,0.00007793759,0.00002648612,0.9849812,0.000009933136,0.004673921,0.00158793,0.0001865988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07114903,0.0002968493,0.9022831,0.0002011317,0.0002800176,0.000113051,3.631914e-7,0.0001011525,0.02557531],"genre_scores_gemma":[0.9882395,0.00005188167,0.01042022,0.001029135,0.00009571836,0.000001948169,0.000001536131,0.000005250763,0.000154772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9842519,"threshold_uncertainty_score":0.4857998,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290066,0.0001884947,0.0002571102,0.00007755165,0.000116868,0.0001485186,0.001365331,0.0001035684,0.00006302584],"category_scores_gemma":[0.000005355056,0.0001458824,0.00003119362,0.0005561869,0.00007971607,0.0004940372,0.0004588329,0.0002259499,0.00001618185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004225331,"about_ca_system_score_gemma":0.00008438624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006364842,"about_ca_topic_score_gemma":0.002149919,"domain_scores_codex":[0.9978351,0.00005910261,0.0003351685,0.0006469327,0.0003225993,0.0008010751],"domain_scores_gemma":[0.9981453,0.000229797,0.00008250531,0.001251425,0.00006196256,0.0002290058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001591807,0.002238126,0.4893048,0.0001053503,0.0002865878,0.006662779,0.005047468,0.01975522,0.00009344379,0.07377397,0.04068211,0.3604583],"study_design_scores_gemma":[0.0008615959,0.00005551161,0.003712937,0.00003707378,0.00000902631,0.00007546917,0.0004903778,0.9878581,0.000007629062,0.00007524829,0.006564761,0.0002523161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007660692,0.0001970918,0.9829412,0.00034609,0.0001834698,0.0001873753,0.00001065744,0.000145365,0.008328065],"genre_scores_gemma":[0.7930458,0.00008028401,0.2050413,0.001107067,0.00007452133,0.00000232973,0.00005195836,0.00001159933,0.0005851957],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9681028,"threshold_uncertainty_score":0.5948913,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915325,0.0001790585,0.0002379772,0.0003138532,0.0001770157,0.0001065153,0.0003398033,0.0002003486,0.000003524449],"category_scores_gemma":[0.000004622052,0.0001822542,0.00004402367,0.000709931,0.00004296331,0.00057038,0.000008640085,0.0007848088,0.000005049319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001955016,"about_ca_system_score_gemma":0.0001210829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004429907,"about_ca_topic_score_gemma":0.00004947764,"domain_scores_codex":[0.9984046,0.0001034153,0.0005547027,0.0002662555,0.0003022563,0.0003687211],"domain_scores_gemma":[0.9991773,0.0002041128,0.0001695716,0.0002402061,0.0001006012,0.000108208],"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.00001592521,0.00006401235,0.0002881371,0.00001276706,0.000005822825,0.00001944887,0.002450785,0.4511246,6.180977e-7,0.0009354338,0.0001024718,0.54498],"study_design_scores_gemma":[0.0004843755,0.00008899348,0.0001919237,0.000157281,0.000006090391,0.00001414224,0.0002891936,0.9976509,0.000007440852,0.0003449764,0.000555206,0.0002094989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01450504,0.00002337195,0.9826204,0.000413463,0.0009442871,0.0002266377,0.000001751617,0.000134046,0.001131015],"genre_scores_gemma":[0.9892307,0.00001816132,0.01026398,0.0002421812,0.0001410463,0.00002118785,0.00001113777,0.0000100336,0.00006160401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9747256,"threshold_uncertainty_score":0.7432112,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004783302,0.0001962002,0.0002439083,0.00004603722,0.0002219755,0.0001767047,0.0007045272,0.000109737,0.00004512232],"category_scores_gemma":[0.000005842372,0.0001716192,0.0001297926,0.0002271237,0.00006801687,0.0002994474,0.0001998154,0.0001290795,0.00004028013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006934228,"about_ca_system_score_gemma":0.0002436535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001095256,"about_ca_topic_score_gemma":0.00002160068,"domain_scores_codex":[0.9983076,0.00002351228,0.0003643201,0.0005436303,0.0002298333,0.0005310705],"domain_scores_gemma":[0.9985971,0.0001864233,0.00009663258,0.0007405397,0.0001089131,0.0002704109],"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.00004064788,0.00025014,0.0001514054,0.00003453021,0.0000378979,0.00007193324,0.0002365064,0.0005118879,0.00002307773,0.3927774,0.008610136,0.5972544],"study_design_scores_gemma":[0.001372504,0.0002931998,0.0001383463,0.00005358467,0.00002586984,0.00004727058,0.00004733576,0.7534942,0.00002754285,0.09200703,0.1519447,0.0005484603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000891482,0.0001762139,0.9866046,0.0008641636,0.001159772,0.0003925527,0.000004837909,0.0003568596,0.009549507],"genre_scores_gemma":[0.8592964,0.00007499193,0.1359199,0.001932116,0.0003263647,0.00006031658,0.00001716584,0.0000189936,0.002353836],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8584049,"threshold_uncertainty_score":0.6998428,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164212,0.0001443744,0.0004891781,0.0007967548,0.0003566814,0.00004060057,0.001786864,0.00009413043,0.000008735804],"category_scores_gemma":[0.0001289105,0.0001435679,0.0001218561,0.005564404,0.0001011286,0.0002202,0.0001584661,0.001025416,0.000003298711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001703127,"about_ca_system_score_gemma":0.0002802952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005983788,"about_ca_topic_score_gemma":0.0002744737,"domain_scores_codex":[0.9975988,0.0005760092,0.000959647,0.0001974876,0.000284293,0.0003837236],"domain_scores_gemma":[0.9959497,0.002003435,0.0005230845,0.001149023,0.0002526316,0.0001220843],"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.00004549786,0.0005616643,0.101446,0.000003886977,0.0004373213,0.00009139582,0.002439016,0.8615688,0.00009835274,0.01672485,0.001138355,0.01544482],"study_design_scores_gemma":[0.0002988172,0.00004068262,0.03881503,0.0001748604,0.00005688508,0.0001066342,0.00002520313,0.9593243,0.000003100849,0.000988557,0.0000320754,0.0001338819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09449883,0.0004348,0.9027331,0.0006272425,0.0001908591,0.0001119373,0.000002620499,0.0000412511,0.001359324],"genre_scores_gemma":[0.9849841,0.0007145679,0.01400205,0.0001941663,0.00006144304,0.000007111157,0.000007856555,0.000008660401,0.00002006414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8904852,"threshold_uncertainty_score":0.585453,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001824474,0.00008467131,0.0001084373,0.00002257555,0.00008935766,0.0001176629,0.0002460542,0.00005506754,0.00008979926],"category_scores_gemma":[0.00001768099,0.00006632007,0.00005169899,0.00009524225,0.00002814355,0.000449773,0.00009395754,0.0000815131,0.00005910718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001382994,"about_ca_system_score_gemma":0.00007451847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004431003,"about_ca_topic_score_gemma":0.00001081325,"domain_scores_codex":[0.9992122,0.00002124163,0.0001541316,0.0002466683,0.00012299,0.0002427547],"domain_scores_gemma":[0.999185,0.0003094494,0.00003819542,0.0002915891,0.00005925689,0.0001165235],"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.00001341136,0.0001298814,0.00005823741,0.000005070612,0.00001234073,0.000008459395,0.0001629515,0.00001010046,0.00001425598,0.8038151,0.1129908,0.08277943],"study_design_scores_gemma":[0.000260891,0.00003685387,0.00003799316,0.00000333507,0.000005053934,0.000025077,0.00001601345,0.9396108,0.0001175324,0.01058791,0.04918353,0.0001149845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001111731,0.00002006938,0.96573,0.01128861,0.0001738921,0.0001331556,0.000002392065,0.0001909015,0.02134923],"genre_scores_gemma":[0.7313855,0.000004171839,0.2664787,0.001090654,0.0002067673,0.00001191209,0.000003542958,0.000003865497,0.0008148499],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9396007,"threshold_uncertainty_score":0.2704454,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004767849,0.0001791048,0.0001743874,0.00009547613,0.003283383,0.0002155883,0.003387705,0.0000659737,0.0001073116],"category_scores_gemma":[0.000001000906,0.0001540945,0.0002096383,0.0006043665,0.0001482147,0.0002497099,0.00005581419,0.0008356621,0.00001694647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009755635,"about_ca_system_score_gemma":0.00013949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002961455,"about_ca_topic_score_gemma":0.00007207011,"domain_scores_codex":[0.9984968,0.0002831556,0.0003033061,0.000311295,0.0002729957,0.0003324465],"domain_scores_gemma":[0.9959998,0.000708525,0.0001276331,0.002976147,0.00009312631,0.0000948135],"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.000079303,0.001109877,0.000002974229,0.000015081,0.0002232154,0.000006058603,0.006719612,0.1808563,0.00005957249,0.1654792,0.0389425,0.6065063],"study_design_scores_gemma":[0.0002961281,0.0001281383,0.0000104463,0.000007290902,0.00003967197,0.00002931975,0.001035699,0.8082734,0.0000137707,0.001814333,0.1881686,0.000183254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00003191358,0.0008764123,0.9481656,0.04712447,0.001424541,0.0005713858,0.00004931221,0.000192001,0.001564359],"genre_scores_gemma":[0.975367,0.0007813571,0.01975777,0.001818601,0.0001577924,0.0008896414,0.00002285894,0.00002423568,0.001180808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.975335,"threshold_uncertainty_score":0.9980142,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003411917,0.0004051107,0.0005263621,0.0001708955,0.0003345016,0.000212633,0.0004806946,0.0003327406,0.00003137401],"category_scores_gemma":[0.000002045693,0.0003774464,0.0001144888,0.000761147,0.0001057128,0.0004508133,0.000009434296,0.000433705,0.00003103835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001658203,"about_ca_system_score_gemma":0.0001156828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004645068,"about_ca_topic_score_gemma":0.00008975255,"domain_scores_codex":[0.997277,0.0002099002,0.0007998291,0.000718982,0.0003220592,0.0006722885],"domain_scores_gemma":[0.9985594,0.0001302023,0.0002033008,0.000635645,0.0001301213,0.0003412893],"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.0001704304,0.0006159179,0.0006288636,0.00005920197,0.0001006836,0.0002860218,0.0004819018,0.9726516,0.000005123971,0.003128105,0.0007474124,0.02112474],"study_design_scores_gemma":[0.001209997,0.0002239509,0.0005832191,0.0001367459,0.00003529335,0.0001868207,0.0001338753,0.9964556,0.000006076231,0.000168505,0.0004112105,0.000448698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002766318,0.0007798224,0.9935358,0.00005657656,0.001342618,0.0005638195,0.000250565,0.0002873258,0.0004171901],"genre_scores_gemma":[0.9980337,0.000252023,0.001168355,0.00007647061,0.00007752333,0.0001404394,0.0001627087,0.0000234302,0.00006534212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9952674,"threshold_uncertainty_score":0.9998677,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000977517,0.0003476144,0.0007015258,0.00004970525,0.0003228475,0.0000901378,0.001276075,0.000202468,0.00002319309],"category_scores_gemma":[0.000006251072,0.0002475227,0.000165783,0.0006998667,0.0001514447,0.0004427049,0.0002532014,0.0002657742,0.00008204457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005607283,"about_ca_system_score_gemma":0.0001752663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008026709,"about_ca_topic_score_gemma":0.000007486951,"domain_scores_codex":[0.9965214,0.000164319,0.001019923,0.0006150391,0.0005667274,0.001112656],"domain_scores_gemma":[0.997476,0.0004372257,0.0006035492,0.001052033,0.0001801382,0.0002510831],"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.0003069894,0.000233865,0.1023021,0.00008115522,0.0001113932,0.00004758401,0.0005071526,0.07369299,0.0001131957,0.00622308,0.117095,0.6992854],"study_design_scores_gemma":[0.001029088,0.000447098,0.001424763,0.001285258,0.00002104319,0.00003517034,0.000006419296,0.974764,0.0001743507,0.001810797,0.01849911,0.0005028808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02149398,0.0001777576,0.9626643,0.0002266451,0.00354807,0.00351996,0.00000307198,0.000311946,0.008054278],"genre_scores_gemma":[0.9817443,0.00002163323,0.01252625,0.0002583484,0.004244854,0.0007918375,0.000001758115,0.00003143169,0.0003795339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9602504,"threshold_uncertainty_score":0.9999977,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005761819,0.0002252765,0.0003143419,0.00007563827,0.0003081314,0.00007171353,0.001525181,0.0001434664,0.00008643227],"category_scores_gemma":[0.000004201676,0.0001861064,0.00006257613,0.0007842812,0.00008728444,0.0002170193,0.0004566661,0.0003231708,0.00003393821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003377529,"about_ca_system_score_gemma":0.0001303413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006587285,"about_ca_topic_score_gemma":0.00005088369,"domain_scores_codex":[0.9975783,0.0001182208,0.0005251718,0.0007420225,0.0003604273,0.0006758429],"domain_scores_gemma":[0.9978921,0.0001864997,0.00008350366,0.001523181,0.0000416866,0.000273027],"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.00004553473,0.0003549702,0.002008124,0.000007043211,0.00001783085,0.0005160177,0.0004838773,0.8586296,0.00000611139,0.01356278,0.02733481,0.09703328],"study_design_scores_gemma":[0.0005408002,0.00003519311,0.002066943,0.00004896301,0.000006146795,0.0001094446,0.00001205907,0.9930091,8.049412e-7,0.0002428474,0.003668173,0.0002595134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006659741,0.0004633508,0.984576,0.0006887068,0.0006978939,0.0002636854,0.000004799927,0.0002331606,0.006412615],"genre_scores_gemma":[0.9665858,0.0001766215,0.0316649,0.0006896679,0.0002769702,0.00001088003,0.00006948381,0.0000140597,0.0005116152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9599261,"threshold_uncertainty_score":0.7589199,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002118364,0.000341674,0.0005990898,0.0001491095,0.0002374465,0.0004568637,0.009237562,0.0001246985,0.00008140942],"category_scores_gemma":[0.00003411619,0.0003254503,0.0002013157,0.0008284617,0.0001136076,0.001105559,0.006056317,0.000529835,0.0001379109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000112052,"about_ca_system_score_gemma":0.0001058652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007591883,"about_ca_topic_score_gemma":0.00001595586,"domain_scores_codex":[0.997084,0.0004493226,0.001034633,0.0005092214,0.0004035631,0.0005192793],"domain_scores_gemma":[0.9926696,0.0009558234,0.0005238683,0.005322299,0.0002645339,0.0002638404],"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.00000619294,0.000151132,0.0007216072,0.0004205548,0.00004841046,0.00002949963,0.0001416131,0.00005685101,0.000003540946,0.007533868,0.04261196,0.9482748],"study_design_scores_gemma":[0.0005711552,0.00005398231,0.001301423,0.006872043,0.00007564732,0.0002097621,0.00000501503,0.6894917,0.00003921117,0.002131918,0.2984112,0.0008368668],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005421079,0.03059337,0.9629087,0.002380689,0.0005565516,0.00066716,0.000002113271,0.0002768592,0.002072388],"genre_scores_gemma":[0.425749,0.05404398,0.4828542,0.03651223,0.0003814163,0.0000506097,0.0001660861,0.00006482376,0.0001776993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9474379,"threshold_uncertainty_score":0.9999198,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110316,0.0002006419,0.0002745443,0.00005666706,0.0002603839,0.0003463544,0.0009142394,0.0001271083,0.00007167078],"category_scores_gemma":[0.00002284538,0.0001340647,0.0001384129,0.0003224788,0.00008646771,0.0004110793,0.0002829674,0.0002454392,0.00002651924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004817749,"about_ca_system_score_gemma":0.00008131356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001313038,"about_ca_topic_score_gemma":0.00001924976,"domain_scores_codex":[0.9981177,0.00008032747,0.0004735523,0.0004909001,0.000230335,0.0006071638],"domain_scores_gemma":[0.998239,0.0005886462,0.0001043196,0.000763435,0.0001253443,0.0001792344],"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.00001791781,0.0002271924,0.00321403,0.00005106287,0.00005593498,0.00003700885,0.0004671013,0.02783639,0.00003362284,0.1748438,0.01548529,0.7777307],"study_design_scores_gemma":[0.0002761742,0.00003395288,0.0006195483,0.00002586768,0.000008632715,0.00001032866,0.0001224927,0.9888574,0.000003902379,0.008308195,0.001541569,0.00019187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005498963,0.00009690653,0.9876933,0.0011807,0.0006203322,0.0008869515,0.000001573989,0.0001272829,0.003893957],"genre_scores_gemma":[0.9815291,0.00001875977,0.01621244,0.001178066,0.0001757896,0.0002292333,0.000009257455,0.00001387885,0.0006334982],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9760301,"threshold_uncertainty_score":0.5466998,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008323963,0.0002418883,0.000336462,0.0001460272,0.000168317,0.0001127215,0.0007882083,0.0001632076,0.0000600544],"category_scores_gemma":[0.00001743718,0.0002258746,0.0001431099,0.0003082595,0.00003978935,0.0005586554,0.0002405773,0.0002253795,0.00001079414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004550409,"about_ca_system_score_gemma":0.0001191405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001039759,"about_ca_topic_score_gemma":0.00003403604,"domain_scores_codex":[0.9978665,0.00005485533,0.0005688832,0.0005719749,0.0002324223,0.0007053746],"domain_scores_gemma":[0.9987884,0.0001718923,0.0001592381,0.0005415987,0.00008598849,0.0002528425],"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.00008918239,0.0003680655,0.05751654,0.00008535777,0.00008754319,0.001053736,0.00249548,0.0004945276,0.00002770721,0.6097124,0.007514965,0.3205545],"study_design_scores_gemma":[0.0005129183,0.0001063289,0.0002775117,0.00005485399,0.00001259377,0.00002884142,0.0001705833,0.9874116,0.00001774491,0.01042544,0.0006447724,0.0003367924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002765862,0.00009014185,0.975327,0.00006202972,0.0005652588,0.0003904876,0.000001935573,0.0002212886,0.02057596],"genre_scores_gemma":[0.9160826,0.00001615408,0.08269234,0.0003728605,0.0001878847,0.00008012332,0.00001661287,0.00002315914,0.000528227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9869171,"threshold_uncertainty_score":0.9210899,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004523802,0.0001630609,0.0002481809,0.0001058442,0.00008538062,0.0001117853,0.0004069414,0.00009139969,0.00006907108],"category_scores_gemma":[0.0000127002,0.0001366518,0.00004047479,0.0003048904,0.0001110071,0.0002953311,0.0002735243,0.0001639707,0.00003825817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000320935,"about_ca_system_score_gemma":0.00004022773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005032613,"about_ca_topic_score_gemma":0.0002039595,"domain_scores_codex":[0.9985899,0.00007267304,0.0002758313,0.0004670277,0.000199298,0.0003952441],"domain_scores_gemma":[0.9989631,0.000182444,0.00005152358,0.0005558591,0.00005418814,0.0001928421],"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.00003826906,0.000635927,0.07017101,0.0001182685,0.00005253971,0.0001333187,0.0008798077,0.00007197358,0.0002179609,0.4213416,0.00523437,0.501105],"study_design_scores_gemma":[0.0003816031,0.0001091832,0.003263741,0.00001863179,0.000003740595,0.00003371646,0.00007530913,0.9803812,0.00004627032,0.01161105,0.003843058,0.0002324778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04344375,0.00009579576,0.9463552,0.0005941467,0.0001349935,0.0001212547,0.000002340137,0.000129291,0.00912319],"genre_scores_gemma":[0.9749082,0.00001887335,0.0237148,0.0007669715,0.00007023323,0.00001230726,0.000002577339,0.000007847047,0.0004981607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9803092,"threshold_uncertainty_score":0.55725,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004745236,0.0001197228,0.0001989114,0.00006862482,0.0004812379,0.00008915608,0.0009256221,0.0001072468,0.000001089975],"category_scores_gemma":[0.00000469219,0.0001276879,0.00002627923,0.0001623532,0.0002827322,0.0002588829,0.0007496236,0.0002961529,0.000002710192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001957005,"about_ca_system_score_gemma":0.00003182927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002415856,"about_ca_topic_score_gemma":0.0002110699,"domain_scores_codex":[0.9988838,0.0002652826,0.0002336777,0.0002542469,0.000096241,0.0002667575],"domain_scores_gemma":[0.9983217,0.0003950127,0.00008257903,0.001058036,0.0000485281,0.00009420536],"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.000002737386,0.0001823239,0.0003525871,0.00001659683,0.00001328335,0.000001243977,0.006931081,0.00008821745,0.00001052029,0.3106382,0.000303484,0.6814597],"study_design_scores_gemma":[0.0002851656,0.00002916422,0.002976109,0.00003235454,0.00000670234,0.00001082015,0.0001998132,0.9771026,9.626377e-7,0.01217483,0.007014957,0.0001665731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1117714,0.0278368,0.838979,0.009910638,0.0003407058,0.000586372,0.000008112348,0.0003368655,0.01023007],"genre_scores_gemma":[0.9813749,0.01597355,0.002323974,0.0001438691,0.00006937885,0.00008719646,0.000005579377,0.000008131417,0.00001347278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9770143,"threshold_uncertainty_score":0.520696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067978,0.00009076319,0.0001908039,0.00006907906,0.00006176368,0.00001737229,0.0003744577,0.00006305697,0.000007449424],"category_scores_gemma":[0.000007092477,0.0000835032,0.00003482978,0.000410299,0.00001753738,0.0002538412,0.000148897,0.0001597643,0.000005082911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002702666,"about_ca_system_score_gemma":0.00003936654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004633659,"about_ca_topic_score_gemma":0.00001826929,"domain_scores_codex":[0.9986697,0.00002081855,0.0005036236,0.0002111718,0.0001591371,0.0004355537],"domain_scores_gemma":[0.9993481,0.0001941438,0.00009658885,0.0002525612,0.00004020602,0.00006839475],"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.0000201029,0.00003106038,0.09845232,0.00002618889,0.000007936535,0.00002821349,0.0005205826,0.5634215,0.00004442492,0.07175451,0.000207097,0.265486],"study_design_scores_gemma":[0.0001366436,0.00001715422,0.0007131312,0.00009526687,0.000001420969,0.000007644408,0.0000309636,0.9980909,0.00002124459,0.0007702243,0.00001555327,0.00009981089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1262847,0.00005875553,0.84195,0.00003729903,0.0002103961,0.00005265816,5.730519e-8,0.00005288681,0.03135332],"genre_scores_gemma":[0.9406787,0.00003726176,0.05889918,0.0001891753,0.0001094772,7.323899e-7,5.450553e-7,0.000004754816,0.00008019649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.814394,"threshold_uncertainty_score":0.3405161,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002930736,0.0001221826,0.0001723031,0.000009910243,0.000328581,0.0001556066,0.0008339323,0.00006390233,0.000002597583],"category_scores_gemma":[0.000005450185,0.0000822801,0.00013308,0.0001603271,0.0002023182,0.0001311045,0.0005869446,0.0001301399,0.000001983059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007672764,"about_ca_system_score_gemma":0.00002849836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003018637,"about_ca_topic_score_gemma":0.000003246347,"domain_scores_codex":[0.9990866,0.00003661221,0.0002143797,0.0002337787,0.0001860933,0.0002424963],"domain_scores_gemma":[0.9987845,0.000453546,0.00007891725,0.0005620781,0.00004421159,0.0000767208],"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.000009767258,0.000069015,0.004611342,0.00001770498,0.00009779818,0.00009412397,0.003890753,0.0000550306,0.0000931244,0.03609615,0.04790169,0.9070635],"study_design_scores_gemma":[0.0005699242,0.0001116044,0.005988298,0.00002743347,0.00001407558,0.0001008761,0.0001708999,0.9366514,0.00001008001,0.01063693,0.04546884,0.0002496414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05918346,0.0006654618,0.9362546,0.002028994,0.0005581396,0.00009219773,0.000001377692,0.00007085804,0.001144864],"genre_scores_gemma":[0.9475404,0.001095432,0.04942677,0.001433235,0.0001923531,0.000002755821,0.000003837079,0.000007302498,0.0002979343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9365964,"threshold_uncertainty_score":0.3355285,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008274706,0.0001880848,0.0002708247,0.00003001903,0.0002357833,0.0001782777,0.0008478768,0.0001805111,0.00000439789],"category_scores_gemma":[0.000005918483,0.0001905027,0.00003910431,0.0005094466,0.0001817792,0.0003541412,0.0001606167,0.0006710456,0.00000421753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002441968,"about_ca_system_score_gemma":0.00004085858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003605086,"about_ca_topic_score_gemma":0.001897751,"domain_scores_codex":[0.998259,0.0001513629,0.000391039,0.0004456701,0.0001896293,0.0005632631],"domain_scores_gemma":[0.9981801,0.0003517649,0.0001547799,0.001077316,0.00005568861,0.0001803754],"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.0002843658,0.0003467312,0.234443,0.00009363022,0.00006525331,0.0001806541,0.001260158,0.01232332,0.00004335593,0.4722829,0.1230737,0.1556028],"study_design_scores_gemma":[0.001102742,0.00003153042,0.1148207,0.0002867704,0.00001822309,0.00002029521,0.00002123115,0.7211065,0.000008981633,0.1023816,0.05932543,0.0008760163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04176208,0.002045915,0.9418198,0.001094855,0.004161457,0.0002946431,0.000003835122,0.000184042,0.008633405],"genre_scores_gemma":[0.9853289,0.0003243505,0.01266506,0.0003410954,0.00105784,0.00001890952,0.000009893787,0.00001288126,0.0002410374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9435669,"threshold_uncertainty_score":0.7768477,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226497,0.0001376738,0.0001614022,0.00007712712,0.0003549083,0.0001664119,0.001633638,0.00004741495,0.00007380312],"category_scores_gemma":[0.00002564259,0.00008528576,0.00005549276,0.0008196534,0.001503273,0.001047755,0.0005766878,0.0001943576,0.00009696513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002251715,"about_ca_system_score_gemma":0.0000524683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.164626e-7,"about_ca_topic_score_gemma":1.728422e-8,"domain_scores_codex":[0.9981532,0.0001404715,0.0002589813,0.0003069959,0.0005982885,0.0005420275],"domain_scores_gemma":[0.9979672,0.0008412641,0.00009851452,0.0007645581,0.0001123531,0.0002161146],"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.000005810422,0.00004788277,0.00001223247,0.000001172755,0.000002264584,0.000001099397,0.0003073228,0.001468572,0.0000378832,0.9571469,0.0002299685,0.04073893],"study_design_scores_gemma":[0.00006552214,0.0000986919,0.00003710595,0.0000242,0.000003076774,0.000008030712,0.00000277815,0.9096573,0.0003697168,0.08959914,0.00002825305,0.000106173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00467148,0.00003172676,0.9823406,0.0008806026,0.000690864,0.0001323031,3.521396e-7,0.00008152878,0.01117059],"genre_scores_gemma":[0.9795883,0.00000516624,0.01908231,0.001056277,0.0002441699,0.000005058543,5.769025e-7,0.000005433036,0.00001267181],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9749169,"threshold_uncertainty_score":0.5538872,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001923708,0.0003241929,0.0004292362,0.0002794698,0.0008951572,0.001017445,0.0008173434,0.0002484876,0.00001446253],"category_scores_gemma":[0.000005251008,0.0002952584,0.00005756354,0.0002967075,0.0003684702,0.0004455316,0.000578679,0.0003289765,0.0000574101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005671291,"about_ca_system_score_gemma":0.0002741954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001792216,"about_ca_topic_score_gemma":0.0000119021,"domain_scores_codex":[0.9963443,0.0007530447,0.0006126131,0.0008973405,0.0007561795,0.0006365191],"domain_scores_gemma":[0.9972788,0.0002193884,0.0002030239,0.0009130472,0.0009573604,0.0004283701],"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.000005137985,0.00004318244,0.00001377881,0.0000664452,0.0000403719,0.00008979541,0.003673518,0.00002352967,0.00004024917,0.4004728,0.370151,0.2253802],"study_design_scores_gemma":[0.0002369163,0.0002817657,0.00003655373,0.00005560429,0.000005445604,0.0001903946,0.0005307285,0.5827659,0.00001196247,0.00005394361,0.4155823,0.0002485082],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009456464,0.00668118,0.9328497,0.003886674,0.04972718,0.0004209241,0.000009880238,0.0003131094,0.005165722],"genre_scores_gemma":[0.698516,0.002229086,0.02960553,0.001137766,0.2664567,0.00004663608,0.0001117779,0.00005589625,0.001840561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9032441,"threshold_uncertainty_score":0.9999499,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006717762,0.0001675778,0.0001867061,0.00005919076,0.001632389,0.0002687979,0.001705919,0.0001150905,0.000001280514],"category_scores_gemma":[0.000006109385,0.0001315534,0.00006378059,0.0003566478,0.0002461121,0.00007631621,0.0004665753,0.00051003,0.00002742407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006974635,"about_ca_system_score_gemma":0.0001143456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002367375,"about_ca_topic_score_gemma":0.00001518593,"domain_scores_codex":[0.9984971,0.0003281967,0.000248938,0.0002675162,0.0003467654,0.0003114666],"domain_scores_gemma":[0.9980443,0.0004698327,0.0001569928,0.001104001,0.0001146938,0.0001102002],"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.00002532695,0.0002996858,0.00004822838,0.000005346528,0.000046432,0.000006569116,0.01233169,0.001277305,0.00003163658,0.7597662,0.03165435,0.1945072],"study_design_scores_gemma":[0.0003340051,0.00004997961,0.0001376785,0.00004479392,0.00001338074,0.000005309067,0.0004028733,0.9788066,0.00001533292,0.002317802,0.01765755,0.0002147158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2941329,0.00141803,0.5187922,0.09081754,0.003146069,0.001274881,0.00003076331,0.001510093,0.08887755],"genre_scores_gemma":[0.9974996,0.00006860554,0.000480251,0.001299655,0.0005254382,0.00003907608,0.000008721844,0.00001517222,0.00006341666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9775293,"threshold_uncertainty_score":0.9996673,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000563504,0.0003441414,0.0003790908,0.0002849208,0.00046736,0.0004430433,0.0004219089,0.0002513293,0.00002131063],"category_scores_gemma":[0.000001482843,0.0003187277,0.000154668,0.0009795624,0.0001260359,0.0002895822,0.000008973611,0.0006737534,0.00000837035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001797739,"about_ca_system_score_gemma":0.0001876204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001284426,"about_ca_topic_score_gemma":0.00001331473,"domain_scores_codex":[0.9976226,0.0001502142,0.0005199136,0.0008554462,0.0002592214,0.0005925741],"domain_scores_gemma":[0.9981558,0.001051214,0.00009178296,0.0004533336,0.0000926137,0.0001553079],"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.00005029851,0.00009531371,0.000004329886,0.00003958826,0.000041149,0.00004437537,0.001603354,0.6207801,0.0001086057,0.003653825,0.0001800422,0.373399],"study_design_scores_gemma":[0.0004795554,0.0005020621,0.000004519572,0.0007560809,0.00002986938,0.00005939085,0.0005575028,0.9955716,0.0001925495,0.0006021812,0.0008638689,0.0003808253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01566495,0.0001658066,0.9809897,0.0002166281,0.001082825,0.001134764,0.00001280448,0.0005228237,0.0002096819],"genre_scores_gemma":[0.9287472,0.00002766508,0.06990092,0.0005443621,0.0003182871,0.000301995,0.0000102612,0.00004522708,0.0001040793],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9130822,"threshold_uncertainty_score":0.9999265,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006342931,0.0003803546,0.0004214594,0.0001547633,0.0009002403,0.0002946654,0.0008636939,0.0002753389,0.00002886502],"category_scores_gemma":[0.00000229083,0.0003774918,0.000281667,0.0004171995,0.00009981898,0.000325728,0.0000130406,0.001013314,0.00002530069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006453772,"about_ca_system_score_gemma":0.000157875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000139211,"about_ca_topic_score_gemma":0.00001712207,"domain_scores_codex":[0.9974048,0.00007692415,0.0006152536,0.0008196211,0.0003075978,0.0007758065],"domain_scores_gemma":[0.9979321,0.0006810086,0.0002307481,0.0006762085,0.0001991387,0.0002808086],"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.00004841209,0.000185865,0.00000361212,0.00001191857,0.00003374742,0.00001269159,0.0001589992,0.5995022,0.0001365798,0.0007523029,0.00002646585,0.3991272],"study_design_scores_gemma":[0.0009479038,0.0005114829,0.000007588459,0.00009746004,0.00002730084,0.00007467226,0.00003346308,0.9959016,0.0009603013,0.0002801931,0.0007191292,0.0004389128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005664502,0.00002677304,0.9828836,0.00006224624,0.002066194,0.008504923,0.00000959728,0.0005130954,0.0002690953],"genre_scores_gemma":[0.8013803,0.000002150869,0.1944536,0.0002316399,0.0004269491,0.003426499,0.000002312844,0.00003859931,0.00003801323],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7957157,"threshold_uncertainty_score":0.9998677,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001145597,0.0001266224,0.0001366294,0.0001039087,0.0004686987,0.0001663394,0.008009505,0.00008802847,0.00003362357],"category_scores_gemma":[0.000002353312,0.00008926722,0.00007314698,0.0003988218,0.0003517602,0.0002437685,0.004235101,0.0006831076,0.0001929516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002872942,"about_ca_system_score_gemma":0.0001054085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004851929,"about_ca_topic_score_gemma":0.00006455207,"domain_scores_codex":[0.9982212,0.0006113574,0.0002461548,0.0002930997,0.0002933404,0.0003348003],"domain_scores_gemma":[0.9945951,0.0003178294,0.00006599991,0.004626841,0.0002783689,0.0001159261],"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.000001509015,0.00008662956,0.00001297048,0.000002835631,0.00001785367,0.000003675623,0.007370351,4.87214e-7,2.562708e-7,0.4496056,0.01583761,0.5270602],"study_design_scores_gemma":[0.0001641429,0.0001240049,0.003288129,0.00004095635,0.000007259501,0.0000546527,0.0006701433,0.5402296,0.000007896127,0.03198538,0.4232189,0.0002088874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001671923,0.008048057,0.8631687,0.02268757,0.0007966193,0.000219015,0.000001545219,0.0002238376,0.1046874],"genre_scores_gemma":[0.8126361,0.004000876,0.1817322,0.0007226103,0.0004325357,0.00005995255,0.000006605388,0.00001226978,0.0003968415],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8124689,"threshold_uncertainty_score":0.9973577,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003286547,0.000340904,0.0003287539,0.0002105698,0.0005332397,0.0001432167,0.0005357255,0.0001593541,0.0003394811],"category_scores_gemma":[0.000001299112,0.0003456047,0.0002025308,0.000499781,0.0001839274,0.0002860519,0.000007817929,0.0004551445,0.00008699344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001896011,"about_ca_system_score_gemma":0.000385479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001115959,"about_ca_topic_score_gemma":0.00005737383,"domain_scores_codex":[0.9976092,0.0002456326,0.0005085057,0.0006946868,0.0004091173,0.0005328564],"domain_scores_gemma":[0.9982291,0.0005302414,0.0001539001,0.0005663009,0.0002644693,0.0002559527],"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.00009864405,0.000770596,0.00002081607,0.00002772068,0.0001171063,0.00008755338,0.001187482,0.904896,0.0001043699,0.003315452,0.0002816616,0.08909264],"study_design_scores_gemma":[0.0007745809,0.0003265557,0.00005631564,0.0001173005,0.00003002709,0.0000380927,0.0002397093,0.9965335,0.0003268671,0.001046496,0.0001075886,0.0004029433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01343651,0.00003545955,0.9837512,0.0001241142,0.0009148043,0.0004182576,0.00007182054,0.0004190394,0.0008288109],"genre_scores_gemma":[0.9806091,0.00001060118,0.01764536,0.001415256,0.00005691535,0.00006776446,0.00003131439,0.00002882355,0.0001348901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9671726,"threshold_uncertainty_score":0.9998996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003672226,0.0000719965,0.0001914292,0.0003054547,0.000009035272,0.00003536989,0.0009880948,0.00008513017,0.000004296703],"category_scores_gemma":[0.0000103343,0.00006212626,0.00002954865,0.0001420463,0.0001180283,0.0002334097,0.0002873003,0.0002148245,0.000001254984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003133777,"about_ca_system_score_gemma":0.00004078124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000829347,"about_ca_topic_score_gemma":0.0001427428,"domain_scores_codex":[0.9991788,0.00002968871,0.0004245757,0.0001026681,0.0001688643,0.00009542696],"domain_scores_gemma":[0.9991809,0.000115669,0.0003645488,0.0001711875,0.0001542885,0.00001345769],"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.0000452545,0.0001063718,0.6708896,0.00002504642,0.0000423591,0.00009857121,0.0004943054,0.00009376611,0.006932243,0.02290314,0.0001085739,0.2982608],"study_design_scores_gemma":[0.004878542,0.0005820296,0.5291914,0.003858616,0.00002202188,0.0007673583,0.007874038,0.3469801,0.04800705,0.05521502,0.001783844,0.0008398952],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.973148,0.001004648,0.02444906,0.0008096707,0.0002146118,0.00005510608,0.000001371241,0.00001674686,0.0003007418],"genre_scores_gemma":[0.9944684,0.00127209,0.004198519,0.00003271926,0.000005457024,0.000001103532,9.324679e-7,0.000002616039,0.00001817519],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3468864,"threshold_uncertainty_score":0.2533435,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001541106,0.00006347249,0.00007450689,0.00002525552,0.00007084382,0.00005688183,0.0001404124,0.00003214209,0.00004708161],"category_scores_gemma":[0.00000179885,0.00004957386,0.00001490961,0.00006985195,0.00001753794,0.000433899,0.000141125,0.00004847858,0.00006458318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006262328,"about_ca_system_score_gemma":0.00001108567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008864005,"about_ca_topic_score_gemma":5.330913e-7,"domain_scores_codex":[0.99945,0.00001366239,0.00008425742,0.0001256798,0.0000961001,0.0002303176],"domain_scores_gemma":[0.9995555,0.00005567262,0.00001877749,0.0001953942,0.00001141376,0.0001632611],"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.000003934589,0.00005423109,0.01084135,0.000008342689,0.00000810038,0.00001304988,0.000780857,0.000002087543,0.0003707248,0.2028022,0.01575153,0.7693636],"study_design_scores_gemma":[0.0003771955,0.0000622275,0.00830196,0.00003305262,0.000009463472,0.000146569,0.00009604717,0.966355,0.0003800386,0.003707628,0.02018496,0.0003459146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03351376,0.0002330756,0.9306687,0.0002064574,0.0004660807,0.00003974007,1.750034e-7,0.0001014584,0.03477059],"genre_scores_gemma":[0.9804168,0.00002119275,0.01785572,0.0005450465,0.00007885689,0.000001563441,6.131828e-7,0.000003268997,0.00107698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9663529,"threshold_uncertainty_score":0.2021563,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002846123,0.0003236406,0.0004914238,0.0001389103,0.0005876235,0.0002548706,0.001623925,0.0001322025,0.000008526328],"category_scores_gemma":[0.0000451271,0.0002177058,0.0002346017,0.0003359416,0.0001214758,0.0001360834,0.0002614208,0.0004485004,9.32352e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008019556,"about_ca_system_score_gemma":0.0003173568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000144521,"about_ca_topic_score_gemma":8.550426e-7,"domain_scores_codex":[0.9969296,0.0003912542,0.001141593,0.0002915704,0.0005646626,0.0006813378],"domain_scores_gemma":[0.9966648,0.001269626,0.0007729343,0.0005552227,0.0004501798,0.0002873028],"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.00003575273,0.00005407216,0.000113269,0.00002248408,0.00002672506,0.00001757275,0.0001717166,0.4634582,0.00002114609,0.00241135,0.0008203133,0.5328474],"study_design_scores_gemma":[0.001346457,0.0003290854,0.0001970816,0.0002353187,0.00004584382,0.0003289177,0.0000743385,0.9936157,0.000031548,0.00121139,0.002319273,0.0002650335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008361831,0.00002458154,0.9916993,0.0002347885,0.0006769443,0.006250269,0.000001722156,0.00006235491,0.0002138693],"genre_scores_gemma":[0.77593,0.000001883669,0.2206524,0.00095429,0.001684318,0.0007193293,0.000002618195,0.00003886822,0.00001623432],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7750939,"threshold_uncertainty_score":0.8877784,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008827295,0.0005973581,0.0006360849,0.0005903693,0.0005760356,0.0005543098,0.001315007,0.0005611734,0.00001252706],"category_scores_gemma":[0.00001350958,0.0005761143,0.0001708882,0.000513377,0.0005494876,0.0006674202,0.0006075132,0.0006384592,0.000005068895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000265244,"about_ca_system_score_gemma":0.0005297309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001596909,"about_ca_topic_score_gemma":0.00001994649,"domain_scores_codex":[0.9961308,0.00005078629,0.0006723725,0.001675618,0.0006677052,0.0008026958],"domain_scores_gemma":[0.997591,0.0004939393,0.0005472019,0.000673362,0.000497882,0.0001965679],"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.000059018,0.00006255846,0.00008327253,0.00008703019,0.0000240009,0.00008792147,0.0008499119,0.01273094,0.000004475131,0.01855849,0.00009084605,0.9673615],"study_design_scores_gemma":[0.0006369044,0.0001937656,0.00008042413,0.0002570983,0.00002527337,0.00003277167,5.235484e-7,0.958095,0.00001555325,0.03914859,0.0008886821,0.0006254119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007901525,0.0004624566,0.9962859,0.000332892,0.001359271,0.0009329664,0.0000166451,0.0001650092,0.0003658948],"genre_scores_gemma":[0.7459184,0.00007426039,0.2502817,0.002446626,0.0009239287,0.0000592579,0.00008855847,0.0000650431,0.000142252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9667361,"threshold_uncertainty_score":0.999669,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000213187,0.0001639503,0.0002913681,0.0001063517,0.00004102008,0.00008351122,0.002466805,0.00006415818,0.00005449601],"category_scores_gemma":[0.00002247205,0.0001439375,0.00003256237,0.0005952384,0.0005255168,0.0004111622,0.00118705,0.0003400131,0.0003735657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004179412,"about_ca_system_score_gemma":0.00009725324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001440097,"about_ca_topic_score_gemma":0.00009309228,"domain_scores_codex":[0.9983376,0.00006888309,0.0002637782,0.0006371223,0.0002158703,0.0004767472],"domain_scores_gemma":[0.9977849,0.0001405355,0.0001656262,0.001786,0.00002544273,0.00009749795],"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.00001917118,0.00003924386,0.1525477,0.000006893318,0.00002914545,0.0001326321,0.0002936921,0.00008608287,0.00005899873,0.007848202,0.006651506,0.8322868],"study_design_scores_gemma":[0.001809606,0.001016788,0.1735425,0.0001075318,0.00002159585,0.0001523502,0.002962441,0.7433442,0.0000686376,0.005641439,0.06988379,0.001449167],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7561714,0.0002089443,0.20577,0.005304379,0.001444722,0.000376789,0.00005373254,0.000524499,0.03014551],"genre_scores_gemma":[0.9880391,0.00005496535,0.009654336,0.001850181,0.00004558667,0.000002941425,0.00004862576,0.000008831885,0.0002954316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8308376,"threshold_uncertainty_score":0.58696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003893762,0.0001202711,0.0001579569,0.00002876227,0.0001319933,0.000105576,0.0006232858,0.00008402525,0.000005443794],"category_scores_gemma":[3.732122e-7,0.00008568625,0.00004356156,0.0001912435,0.00006904462,0.0001396948,0.0003945175,0.0002182189,0.000001839154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008261236,"about_ca_system_score_gemma":0.00004565771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001265388,"about_ca_topic_score_gemma":0.000005397911,"domain_scores_codex":[0.9990084,0.00009746049,0.0002638044,0.0002515879,0.0001588678,0.000219948],"domain_scores_gemma":[0.9990274,0.0001476097,0.0001558045,0.000528196,0.00006078339,0.0000801684],"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.000006998524,0.00002557247,0.003916655,0.00003392383,0.00004007886,0.00001263674,0.0004818871,0.01066505,0.00006743739,0.07331624,0.011694,0.8997395],"study_design_scores_gemma":[0.0002342125,0.00004028841,0.003293886,0.00002462807,0.000007681714,0.00005645942,0.00001103087,0.9953904,0.00004121896,0.0002844485,0.0005176149,0.00009814874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007566322,0.00007106123,0.9894429,0.0001438137,0.002253755,0.0002706444,5.617301e-7,0.00008045825,0.0001704232],"genre_scores_gemma":[0.9110295,0.000006779652,0.08839907,0.0002071557,0.000327753,0.000007382166,0.000001349368,0.00000690517,0.00001405801],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9847254,"threshold_uncertainty_score":0.3494184,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002733773,0.0001542286,0.0003496842,0.0007514404,0.0001624893,0.00002434022,0.0004880595,0.000295176,0.00001045163],"category_scores_gemma":[0.000002192516,0.0001510146,0.0001254024,0.00151647,0.0001414054,0.0002345752,0.00001405223,0.0003893855,0.000002805267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002889553,"about_ca_system_score_gemma":0.00001728867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004041832,"about_ca_topic_score_gemma":0.00004511546,"domain_scores_codex":[0.9988552,0.00008539338,0.0003684781,0.0002563053,0.0001335081,0.0003011282],"domain_scores_gemma":[0.9987309,0.00009535328,0.0001071889,0.0008635549,0.0001139155,0.00008911063],"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.00002013444,0.0002613698,0.0006302129,0.000005716277,0.0009476299,0.000007400465,0.0002721864,0.8071111,0.0003135519,0.007991928,0.00001399522,0.1824248],"study_design_scores_gemma":[0.0002048546,0.00005215071,0.00005876133,0.00002197413,0.0003864904,0.0000339437,0.00006917345,0.9982073,0.0004935301,0.0002954891,0.00003248548,0.0001438738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1975645,0.0006303754,0.8010542,0.0002725336,0.0001250771,0.00009896071,0.000002133247,0.0001946903,0.00005756661],"genre_scores_gemma":[0.9884993,0.0002910137,0.01103218,0.0001123408,0.000008164114,0.00002558499,0.000005657188,0.000009985205,0.0000158153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7909348,"threshold_uncertainty_score":0.6158198,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002678007,0.0001209747,0.0003035624,0.0001278353,0.0000706352,0.00004494607,0.000709548,0.00006002252,0.000001777329],"category_scores_gemma":[0.00001378389,0.000110984,0.00006803585,0.0001756985,0.0001732026,0.0001098387,0.0001561386,0.0001148752,0.000008123251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001899008,"about_ca_system_score_gemma":0.00005536164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003858703,"about_ca_topic_score_gemma":0.000001093888,"domain_scores_codex":[0.9985488,0.0002571643,0.000438788,0.0002590633,0.0001689849,0.0003271928],"domain_scores_gemma":[0.9986504,0.0006179065,0.0001966448,0.0003919926,0.00007362738,0.00006937338],"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.0000272008,0.00004737536,0.0004229247,0.0001409601,0.00001476087,0.000009538708,0.007926973,0.001271997,0.00005341825,0.9596658,0.0000793443,0.03033967],"study_design_scores_gemma":[0.0003601121,0.00008070198,0.0004841004,0.0003369698,0.000004425731,0.00001338831,0.0004448369,0.9325532,0.00009021908,0.06540983,0.0000722837,0.0001498867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1106906,0.0001371659,0.8771511,0.00001032356,0.0004898667,0.0002644303,0.000001401817,0.00008621001,0.01116894],"genre_scores_gemma":[0.9892527,0.000002251464,0.01048017,0.00003018555,0.0001124105,0.000003417769,0.00000123373,0.00001130055,0.0001062873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9312813,"threshold_uncertainty_score":0.4525796,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000426716,0.00009746365,0.0001053646,0.0001736866,0.0006502391,0.0003950645,0.0005333752,0.0000313925,0.000003469512],"category_scores_gemma":[0.000002103024,0.00008268926,0.0000238125,0.0006892536,0.0002761902,0.009418488,0.0003282289,0.00008802427,0.00004571299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002196488,"about_ca_system_score_gemma":0.0001154672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003625986,"about_ca_topic_score_gemma":1.013235e-7,"domain_scores_codex":[0.9988436,0.00001299649,0.0002770869,0.0001898035,0.0004012187,0.0002753333],"domain_scores_gemma":[0.9992779,0.00003514662,0.00009816769,0.0002764809,0.0001480138,0.0001642614],"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.000003097628,0.00001108548,0.0009502675,0.000006471047,0.00000192996,0.000006913487,0.002541101,0.0005806673,0.000008099611,0.04492288,0.001563306,0.9494042],"study_design_scores_gemma":[0.0001553872,0.00003913582,0.00755768,0.00001312711,8.059056e-7,0.0002179728,0.000008731477,0.9728059,0.00001067388,0.0002391496,0.01883053,0.0001208905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01765285,0.0000427615,0.972545,0.0002032857,0.001049748,0.00008098558,4.568695e-7,0.0001220479,0.008302908],"genre_scores_gemma":[0.9709838,0.000130518,0.02704761,0.00163322,0.0001776683,0.000002999577,0.000002680521,0.00000145135,0.00002004068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9722252,"threshold_uncertainty_score":0.6828176,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000570017,0.0004948095,0.0005371842,0.0001853334,0.0004628929,0.0003038789,0.001020195,0.0004321714,0.00007055434],"category_scores_gemma":[0.000009362077,0.000456448,0.0002164577,0.001092512,0.0003114747,0.0005111446,0.0004611136,0.0007266313,0.00005981159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002348189,"about_ca_system_score_gemma":0.00008920419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003746389,"about_ca_topic_score_gemma":0.00001943838,"domain_scores_codex":[0.99664,0.0001331448,0.0006355752,0.0009940236,0.0004929566,0.001104305],"domain_scores_gemma":[0.9977245,0.0002644581,0.0002239933,0.00103701,0.0001428756,0.0006071534],"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.0003465671,0.0005351576,0.02406118,0.00005627138,0.0002385001,0.002079706,0.0008221618,0.005982977,0.00004939103,0.06059063,0.0747964,0.8304411],"study_design_scores_gemma":[0.0009452986,0.0002224062,0.001386863,0.00006899839,0.00003841683,0.0003148141,0.00002496682,0.9546109,0.000006365215,0.00975587,0.03202671,0.0005983773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04030539,0.003420045,0.9352983,0.0008565271,0.00207198,0.000396662,0.000007416961,0.000677031,0.01696663],"genre_scores_gemma":[0.9722959,0.001964378,0.02050618,0.002568457,0.0009019347,0.0000289058,0.00003285309,0.00005600092,0.001645436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9486279,"threshold_uncertainty_score":0.9997887,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063875,0.0002252919,0.0005137007,0.00003141285,0.0003741409,0.0000775542,0.0009298768,0.00009969736,0.000008982513],"category_scores_gemma":[0.00002862083,0.0001165089,0.0003525495,0.0003679458,0.0003838875,0.0001710663,0.000276647,0.0005235734,3.168339e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006981795,"about_ca_system_score_gemma":0.0001214771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006476166,"about_ca_topic_score_gemma":0.000003368611,"domain_scores_codex":[0.9979236,0.0002567256,0.0008873568,0.0002256958,0.000316496,0.0003901687],"domain_scores_gemma":[0.9966237,0.0009225649,0.001283802,0.0004729216,0.0005650886,0.0001319031],"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.001005997,0.0007636672,0.004988843,0.00001648203,0.0006512965,0.00005553961,0.004691676,0.8655102,0.000008078161,0.02559794,0.005066852,0.0916434],"study_design_scores_gemma":[0.0006866425,0.00128782,0.02609573,0.00008458348,0.00003936332,0.0001146654,0.001227887,0.9623998,0.000002244107,0.007772815,0.0001498263,0.0001386663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05715134,0.006224077,0.935268,0.0001071462,0.0002442123,0.0001986685,0.00001184351,0.00001460157,0.0007801174],"genre_scores_gemma":[0.9958025,0.0008073458,0.00317681,0.00004475647,0.0001516827,0.000001426276,0.000003425206,0.000007329447,0.000004756866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9386511,"threshold_uncertainty_score":0.4751094,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003911148,0.0001788259,0.0002422822,0.0001109726,0.0003982266,0.000366945,0.001096878,0.0001642786,0.000032908],"category_scores_gemma":[0.000008115973,0.000173106,0.0001223809,0.0007617126,0.0001275438,0.0006171133,0.0001007142,0.0001131541,0.00002105143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005970658,"about_ca_system_score_gemma":0.0001776496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001832495,"about_ca_topic_score_gemma":0.000007886359,"domain_scores_codex":[0.9984074,0.00006289923,0.0003111424,0.0004642659,0.000266175,0.0004881489],"domain_scores_gemma":[0.9987949,0.0001643099,0.0001969384,0.0004082819,0.0003058853,0.000129698],"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.0002003859,0.0003714559,0.0003538327,0.00005263009,0.00007329751,0.000009126164,0.0004343793,0.1599433,0.00004734856,0.00254573,0.08093415,0.7550344],"study_design_scores_gemma":[0.0006264592,0.00008611605,0.00007042314,0.00001138945,0.00002067435,0.000001018032,0.000002102634,0.9949538,0.0002623615,0.002829744,0.0009154695,0.0002204103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01220566,0.00006157562,0.985074,0.0001869376,0.0008780266,0.0005395444,0.00001489241,0.0002009608,0.0008384358],"genre_scores_gemma":[0.9876099,0.000004930707,0.0101439,0.0009231275,0.0009148218,0.000119022,0.00002804738,0.00001698994,0.0002392508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9754043,"threshold_uncertainty_score":0.7059057,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964196,0.000189834,0.000249008,0.00006229023,0.0003374839,0.00019723,0.0003743151,0.0001233796,0.000002613267],"category_scores_gemma":[0.000001028122,0.0001941485,0.00006251795,0.0003864704,0.00003690736,0.0001107043,0.00007081225,0.0001785772,0.000001165381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003106633,"about_ca_system_score_gemma":0.00003123724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008466121,"about_ca_topic_score_gemma":0.00001305049,"domain_scores_codex":[0.9984639,0.00003736476,0.0003894825,0.0005107571,0.000112574,0.0004859482],"domain_scores_gemma":[0.9989509,0.0003223623,0.0001523134,0.0004012004,0.00004582003,0.0001274032],"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.000007753384,0.00005742687,0.0004149927,0.000007858429,0.000004315395,0.000005548352,0.00003754901,0.2417895,0.000009370447,0.00611642,0.0002399393,0.7513093],"study_design_scores_gemma":[0.0004455483,0.00007530793,0.0001432145,0.00005158628,0.000008549524,0.00001314288,0.00001825547,0.989729,0.000008416723,0.001505553,0.007781127,0.0002202633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005221547,0.0006228962,0.9923157,0.0001639864,0.00009942822,0.001014878,0.000004998255,0.0001206853,0.0004358825],"genre_scores_gemma":[0.9920573,0.00007753144,0.005569477,0.0008275738,0.0005561312,0.0008111643,0.00005308719,0.00001387052,0.00003389153],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9868357,"threshold_uncertainty_score":0.7917144,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047129,0.0001725094,0.0003478662,0.00009490186,0.0006513714,0.0005944514,0.0006764018,0.0001205138,0.000001400908],"category_scores_gemma":[0.00009801261,0.0001591718,0.00007953937,0.0001236902,0.00007605911,0.0003980514,0.0001237505,0.0003078157,2.595725e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006423079,"about_ca_system_score_gemma":0.0002940529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001888396,"about_ca_topic_score_gemma":0.000009608882,"domain_scores_codex":[0.9983316,0.00006259016,0.0007452267,0.0002705293,0.0002229819,0.0003670489],"domain_scores_gemma":[0.9976825,0.0002382853,0.001041714,0.0003771818,0.0003954246,0.0002649448],"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.0003648776,0.0005078294,0.2127939,0.0001290382,0.00008664127,0.0003112789,0.0003822022,0.5952888,0.00004120244,0.01781913,0.0009856109,0.1712896],"study_design_scores_gemma":[0.001647556,0.0002437756,0.02373501,0.0003024899,0.00001913457,0.00006422049,0.00004872329,0.9729051,9.97284e-7,0.0007945041,0.00008222775,0.0001562783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03601455,0.0001191365,0.9626961,0.0004818832,0.0004574494,0.0001502614,0.000009310264,0.00002909564,0.00004220233],"genre_scores_gemma":[0.9508238,0.000008253768,0.04858977,0.0001188717,0.0004096436,0.000002136479,0.00003291276,0.000008518687,0.000006080709],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9148093,"threshold_uncertainty_score":0.6490836,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00131781,0.0001187217,0.0001609603,0.00002308067,0.000136738,0.0000894128,0.0008954858,0.00007337741,0.0000909794],"category_scores_gemma":[0.000002315145,0.00007439838,0.00007562576,0.0003642141,0.00005681101,0.000201851,0.0001617765,0.000107087,0.00001072064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003232855,"about_ca_system_score_gemma":0.0001664352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007332909,"about_ca_topic_score_gemma":0.00009315345,"domain_scores_codex":[0.9978378,0.0002981994,0.0003592885,0.0002906991,0.0009453563,0.0002686334],"domain_scores_gemma":[0.9987384,0.00007967902,0.0001249101,0.0007631861,0.0002272283,0.00006660497],"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.00002311491,0.0009138612,0.1594527,0.000007871184,0.00005662859,0.00001610034,0.0007108444,0.4048872,0.00006080406,0.0795106,0.1157852,0.2385751],"study_design_scores_gemma":[0.0003180302,0.00006048855,0.04569139,0.000009292698,0.00002849036,0.00001036029,0.00001548363,0.9449742,0.00001858245,0.00789254,0.0008769933,0.0001041406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1480463,0.0001399344,0.8279577,0.0004948328,0.00065329,0.0002789772,0.000001049299,0.0000734146,0.02235448],"genre_scores_gemma":[0.9911627,0.000001783593,0.007611343,0.0006279053,0.000314872,0.00001027906,0.000004712122,0.0000059843,0.0002604864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8431163,"threshold_uncertainty_score":0.3033878,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001246334,0.00005813048,0.00006885688,0.00002189721,0.0001123218,0.00009247502,0.0004468267,0.00006041766,0.0002065119],"category_scores_gemma":[0.000001291245,0.00004759374,0.00003426588,0.0001134839,0.00003499118,0.0001507905,0.0001186282,0.0001526999,0.0002432872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002410799,"about_ca_system_score_gemma":0.0000375576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001121757,"about_ca_topic_score_gemma":0.00001306345,"domain_scores_codex":[0.9994536,0.000007947683,0.00009009367,0.0001569996,0.000123424,0.0001679419],"domain_scores_gemma":[0.9995981,0.00002914502,0.00002367735,0.0002441395,0.00003245262,0.0000724355],"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":[6.208651e-7,0.00002038629,0.0002532239,9.488373e-7,0.000003318015,0.00001442864,0.000111547,1.515522e-7,0.0003388257,0.7082766,0.04603341,0.2449466],"study_design_scores_gemma":[0.0003194585,0.00003573722,0.001499856,0.000001961844,0.000004873698,0.00005054221,0.00002013951,0.7895742,0.0002037293,0.05254845,0.1554079,0.0003331825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003425654,0.0000035477,0.7422894,0.0017756,0.0005017245,0.00002829054,1.867961e-7,0.0001726438,0.2518029],"genre_scores_gemma":[0.9657887,8.7414e-7,0.02784702,0.001025408,0.0002403687,0.000002030634,7.426861e-7,0.00000320946,0.005091636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9623631,"threshold_uncertainty_score":0.3127046,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002421491,0.00007319065,0.00009242089,0.0000323503,0.001596394,0.0004501643,0.002996192,0.00004708379,0.00002281866],"category_scores_gemma":[0.00000857733,0.00006367381,0.000054262,0.00004974872,0.0001059282,0.0003040774,0.0004642706,0.00008151427,0.00009709319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001779387,"about_ca_system_score_gemma":0.00007432073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000985001,"about_ca_topic_score_gemma":0.00002396227,"domain_scores_codex":[0.9993364,0.00001621193,0.0001569593,0.0002104484,0.00009739597,0.0001826454],"domain_scores_gemma":[0.9957802,0.0002889911,0.0001114033,0.00360552,0.0001041986,0.0001096425],"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.000001154326,0.00003871048,0.00002911603,0.000001116554,0.000004234046,9.931987e-8,0.00001043505,6.312279e-7,9.707829e-7,0.704111,0.006446738,0.2893558],"study_design_scores_gemma":[0.0002113643,0.00002576764,0.0001563402,0.000003839207,0.000003184883,0.000001882159,0.00000553613,0.5659181,0.000003354681,0.06339547,0.37018,0.00009506854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000005378151,0.00001964292,0.7762487,0.01560867,0.00008576126,0.0002864215,0.00000845708,0.00009952561,0.2076374],"genre_scores_gemma":[0.8782064,0.00004703728,0.1165553,0.001187934,0.00006484293,0.0002395087,0.00002339314,0.000005972056,0.003669718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8782009,"threshold_uncertainty_score":0.9997034,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003604291,0.0001816066,0.0003008049,0.00007512359,0.0002158085,0.0002684022,0.0002458818,0.000127025,0.000001137905],"category_scores_gemma":[0.000008789805,0.0001506777,0.00001737702,0.0001334055,0.0002018451,0.0003549765,0.000532307,0.0001707897,0.000002028226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007568708,"about_ca_system_score_gemma":0.00001813698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000147271,"about_ca_topic_score_gemma":0.000001174129,"domain_scores_codex":[0.998895,0.00001544521,0.0004801964,0.0001370882,0.0001619305,0.0003102777],"domain_scores_gemma":[0.9991609,0.0001906069,0.000209466,0.0002951192,0.00005016659,0.00009375619],"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.000001515796,0.00001335903,0.0003239662,0.0002303065,0.00001490752,0.000008993344,0.006051796,0.00002818847,5.456484e-7,0.02272184,0.0002991289,0.9703054],"study_design_scores_gemma":[0.0002800972,0.0001953975,0.00007660609,0.0001341233,0.00001195567,0.0003095568,0.005988714,0.9632298,0.000003650747,0.007259772,0.02228427,0.0002260532],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1195417,0.02908678,0.836876,0.0005687171,0.0003353188,0.0005356986,0.000002426189,0.0006897853,0.0123636],"genre_scores_gemma":[0.8920601,0.04847056,0.05916047,0.0002043568,0.00005906724,0.000006287632,0.000001843779,0.000007506305,0.00002981617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9700794,"threshold_uncertainty_score":0.6144459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}