{"meta":{"query_hash":"7a6aab70d3e5","filters":{"topic":"Opportunistic and Delay-Tolerant Networks"},"cohort_total":454,"direct_labels_cover":1,"predictions_cover":454,"exported":454,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7a6aab70d3e5","api":"https://metacan.xera.ac/api/v1/cohort?topic=Opportunistic+and+Delay-Tolerant+Networks"},"results":[{"id":"W11383567","doi":"10.1007/978-94-007-4516-2_13","title":"Destination Guided Mobility Models for Mobile Ad Hoc Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mobility model; Waypoint; Computer science; Simple (philosophy); Mobile ad hoc network; Wireless ad hoc network; Distributed computing; Computer network; Wireless; Real-time computing; Telecommunications","score_opus":0.020769338376241772,"score_gpt":0.23093330675021417,"score_spread":0.2101639683739724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11383567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078028045,0.0065148626,0.96646047,0.0009794926,0.00042171965,0.00006397734,0.00035075215,0.0002920303,0.01711392],"genre_scores_gemma":[0.6713733,0.025359612,0.21531034,0.0006465193,0.001219797,0.0006346957,0.0014236976,0.0005299082,0.083502114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974924,0.00009486906,0.000012865091,0.00003322892,0.000081572085,0.000028227038],"domain_scores_gemma":[0.9996581,0.00016651663,0.00003615473,0.000040713443,0.00007572992,0.000022906534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052599807,0.0012653647,0.0008582396,0.0007192358,0.00043033718,0.0013973555,0.0020626336,0.0012540849,0.0024274453],"category_scores_gemma":[0.0015518477,0.0005254363,0.00063365756,0.0012080116,0.00064169185,0.0021594667,0.00095924735,0.0014002162,0.0011114221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000300905,0.000033149972,0.0001482579,0.00010017557,0.000030570798,0.000075051525,0.0001351649,0.66635567,0.0009450923,0.3038997,0.005968708,0.022278396],"study_design_scores_gemma":[0.000007689635,0.000015869375,0.0000417125,0.000023617624,0.000010482717,0.000031013118,0.000023292481,0.8597415,0.000104150706,0.13163912,0.0083515635,0.000010006361],"about_ca_topic_score_codex":0.0033946275,"about_ca_topic_score_gemma":0.0029434913,"teacher_disagreement_score":0.0033946275,"about_ca_system_score_codex":0.0010675,"about_ca_system_score_gemma":0.000591914,"threshold_uncertainty_score":0.008120656},"labels":[],"label_agreement":null},{"id":"W135003788","doi":"10.1007/978-3-642-25832-9_76","title":"Robotic Communications and Surveillance - The DARPA LANdroids Program","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Human–computer interaction; Computer vision","score_opus":0.0353364389975511,"score_gpt":0.25959050025204156,"score_spread":0.22425406125449046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135003788","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029620579,0.037191667,0.28925908,0.01999389,0.00496273,0.00075746677,0.0044370657,0.0031185907,0.61065894],"genre_scores_gemma":[0.20726967,0.05062219,0.26714775,0.0011380316,0.0032399923,0.0006311758,0.00945698,0.00086884527,0.45962533],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971074,0.00006004418,0.000005755823,0.00004755307,0.00013727353,0.00003866815],"domain_scores_gemma":[0.9995802,0.00007218997,0.000020771564,0.0000514738,0.00013448767,0.00014090516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011428953,0.0011444357,0.0004916373,0.0007749024,0.00048051385,0.001159513,0.0009764043,0.0006182551,0.00835692],"category_scores_gemma":[0.00069354865,0.0002865963,0.00030524473,0.0009159112,0.00054172985,0.0009555188,0.0010025321,0.0011090371,0.0029299955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021306782,0.00031945485,0.0007457245,0.00017473807,0.00004641757,0.00010489001,0.00013976979,0.031539112,0.004879997,0.11575702,0.35591668,0.4901631],"study_design_scores_gemma":[0.00008848645,0.0003228878,0.0012546147,0.00013671395,0.000021891949,0.00018734779,0.00009321286,0.077532165,0.008159225,0.04174918,0.8704319,0.000022416272],"about_ca_topic_score_codex":0.007866935,"about_ca_topic_score_gemma":0.010442785,"teacher_disagreement_score":0.00835692,"about_ca_system_score_codex":0.0012564253,"about_ca_system_score_gemma":0.001789268,"threshold_uncertainty_score":0.027956724},"labels":[],"label_agreement":null},{"id":"W1484239453","doi":"10.1002/dac.2777","title":"Dynamic intelligence towards smart and green world","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Ubiquitous computing; Energy consumption; Cloud computing; Efficient energy use; Green computing; Wireless sensor network; Context (archaeology); Variety (cybernetics); Wireless; Field (mathematics); Telecommunications; Computer security; Computer network; Human–computer interaction; Artificial intelligence; Engineering","score_opus":0.02478163070342392,"score_gpt":0.2888689877850755,"score_spread":0.2640873570816516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484239453","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01862571,0.22581133,0.1679815,0.14885777,0.08221992,0.00018717487,0.00047798373,0.0029682382,0.35287032],"genre_scores_gemma":[0.2789035,0.26674798,0.06102919,0.0314929,0.060296733,0.0003170283,0.00078181777,0.0014515077,0.29897934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990396,0.00019612467,0.00004150374,0.00019843198,0.00039993372,0.00012446249],"domain_scores_gemma":[0.99884665,0.00039395905,0.00012081871,0.0001718448,0.0002537525,0.00021291964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725819,0.0005649057,0.0005636087,0.0014733543,0.0012880334,0.006684921,0.000905818,0.0023060257,0.009015004],"category_scores_gemma":[0.00227042,0.0003306668,0.00048576458,0.0015348303,0.0022796916,0.009894588,0.002848728,0.003439756,0.003382161],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062585576,0.000034865294,0.00039671437,0.0009264686,0.000035308654,0.0003534688,0.0011104011,0.0015582059,0.0050420775,0.5473659,0.26745895,0.17565505],"study_design_scores_gemma":[0.000003507892,0.000018729637,0.00018595892,0.00014439577,0.00000937358,0.00022192168,0.0003589195,0.0015668649,0.0011775085,0.09170066,0.904594,0.000018220213],"about_ca_topic_score_codex":0.00031463045,"about_ca_topic_score_gemma":0.00042191404,"teacher_disagreement_score":0.009015004,"about_ca_system_score_codex":0.0010448248,"about_ca_system_score_gemma":0.0010340711,"threshold_uncertainty_score":0.030158162},"labels":[],"label_agreement":null},{"id":"W1497080212","doi":"","title":"Flunet: Automated tracking of contacts during flu season","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Bluetooth; Flooding (psychology); Computer science; Wireless sensor network; Mobile social network; Tracking (education); Computer network; Routing (electronic design automation); Delay-tolerant networking; Real-time computing; Routing protocol; Wireless; Data mining; Mobile computing; Telecommunications","score_opus":0.0123172222462863,"score_gpt":0.23898890013100416,"score_spread":0.22667167788471787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497080212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9216796,0.00033765228,0.027299615,0.00026122679,0.00006290591,0.00036003086,0.04302481,0.003309065,0.0036650219],"genre_scores_gemma":[0.9417657,0.00014963732,0.024218641,0.000039239687,0.000024821362,0.00015699005,0.031774726,0.00003619814,0.0018340145],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997346,0.000062461746,0.000018446548,0.00008577236,0.000058352263,0.000040264465],"domain_scores_gemma":[0.99920243,0.0002441521,0.00014435654,0.0001320349,0.00019124793,0.00008573749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005734168,0.00041640078,0.00030821876,0.0015401219,0.00033404856,0.00030915547,0.00060260564,0.0003278183,0.0010234221],"category_scores_gemma":[0.0016399536,0.00015143692,0.00017481632,0.0009919051,0.00015006431,0.0004300132,0.00043215728,0.00017439944,0.00039644045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013723404,0.0003306019,0.62582934,0.00045035733,0.00026858243,0.00043907727,0.0008072779,0.100254975,0.016275197,0.0019554284,0.041701667,0.21031514],"study_design_scores_gemma":[0.00010042472,0.00038457024,0.33727205,0.00007252012,0.00006283969,0.0005403091,0.0007687009,0.62998414,0.00833833,0.0014123674,0.020999454,0.00006427654],"about_ca_topic_score_codex":0.08227142,"about_ca_topic_score_gemma":0.113512695,"teacher_disagreement_score":0.08227142,"about_ca_system_score_codex":0.00079233974,"about_ca_system_score_gemma":0.0007029102,"threshold_uncertainty_score":0.16358513},"labels":[],"label_agreement":null},{"id":"W1508265852","doi":"10.1002/wcm.2233","title":"Modeling epidemic data diffusion for wireless mobile networks","year":2012,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Manitoba; Ryerson University","keywords":"Computer science; Computer network; Node (physics); Wireless network; Mobility model; Distributed computing; Wireless; Wireless WAN; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.07742694936646713,"score_gpt":0.3232350619692962,"score_spread":0.24580811260282906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508265852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13664612,0.0009827883,0.85652965,0.00097012945,0.00010290035,0.00013295333,0.00019228479,0.00027018564,0.0041729826],"genre_scores_gemma":[0.94057,0.0010631674,0.05301474,0.000093989634,0.00005861406,0.00021020974,0.00017856268,0.00004065304,0.0047699725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956566,0.00020232718,0.000029151162,0.000058389327,0.00009249143,0.000051968218],"domain_scores_gemma":[0.9980083,0.0015222271,0.00018024088,0.00006668677,0.0001764206,0.000046127516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016393211,0.00071092707,0.00071361515,0.0010764325,0.0005337231,0.001083033,0.00082682783,0.0015060804,0.00093257026],"category_scores_gemma":[0.0058628703,0.00048461134,0.00077192334,0.0007290419,0.0006626207,0.0012892988,0.0009361798,0.0009305905,0.0001637989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017897648,0.000013810909,0.0009971646,0.00002213642,0.000018904946,0.00006379793,0.00006130065,0.98002654,0.00041720094,0.015615307,0.00022228052,0.0025235638],"study_design_scores_gemma":[0.0000025135535,0.0000030765466,0.000038854436,0.0000018886606,0.00000238534,0.000006048396,0.000006547838,0.99779665,0.00003959682,0.0019456274,0.00015492363,0.0000019290542],"about_ca_topic_score_codex":0.010925006,"about_ca_topic_score_gemma":0.004695412,"teacher_disagreement_score":0.010925006,"about_ca_system_score_codex":0.001421464,"about_ca_system_score_gemma":0.0006054516,"threshold_uncertainty_score":0.021722794},"labels":[],"label_agreement":null},{"id":"W1513171864","doi":"10.1109/wimob.2005.1512919","title":"Energy-aware task allocation over MANETs","year":2006,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mobile device; Energy consumption; Distributed computing; Heuristic; Mobile computing; Set (abstract data type); Energy (signal processing); Mobile ad hoc network; Task (project management); Greedy algorithm; Wireless; Computer network; Algorithm; Operating system; Artificial intelligence","score_opus":0.007693530067966905,"score_gpt":0.20086279740596863,"score_spread":0.19316926733800172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513171864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08170968,0.0013117265,0.9113232,0.00032041164,0.00011371599,0.00019744533,0.00007598415,0.00073735055,0.0042106006],"genre_scores_gemma":[0.7479158,0.00084852206,0.24616224,0.00013140331,0.00008644127,0.00026765582,0.00013794648,0.00012965164,0.0043202853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992034,0.00031579813,0.000048230697,0.00014316106,0.0001231648,0.00016630936],"domain_scores_gemma":[0.999113,0.00046462112,0.0001234971,0.00010837617,0.00010154952,0.00008886378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010182846,0.00096372684,0.0012205272,0.0009568654,0.0008840713,0.0008882996,0.0015125393,0.0006818758,0.0014036596],"category_scores_gemma":[0.0021732026,0.00045029624,0.0003429639,0.00150536,0.00060046796,0.0012005824,0.00081582455,0.00047446176,0.00034232103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029874383,0.00010497261,0.0006364243,0.00012647317,0.000052611165,0.000099139,0.00007709357,0.8910526,0.0037392196,0.007775868,0.0020495653,0.09398728],"study_design_scores_gemma":[0.000029585723,0.000059985614,0.00018213205,0.000007447684,0.00001474851,0.00006148461,0.000061544204,0.98742664,0.0014771131,0.009031482,0.0016378008,0.000010056785],"about_ca_topic_score_codex":0.0025779733,"about_ca_topic_score_gemma":0.003906612,"teacher_disagreement_score":0.0025779733,"about_ca_system_score_codex":0.0007002869,"about_ca_system_score_gemma":0.0010187193,"threshold_uncertainty_score":0.0053852797},"labels":[],"label_agreement":null},{"id":"W1523987610","doi":"","title":"Mobile Interface Theory: Embodied Space and Locative Media by Jason Farman (review)","year":2013,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embodied cognition; Locative case; Interface (matter); Space (punctuation); Computer science; Media arts; Human–computer interaction; Sociology; Art; Linguistics; Artificial intelligence; Visual arts; Philosophy","score_opus":0.007494157235711199,"score_gpt":0.2623278184042288,"score_spread":0.25483366116851763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523987610","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004297932,0.99541676,0.00012361913,0.0034658585,0.00054753764,0.000002302856,0.000006977147,0.0000016061754,0.00039242432],"genre_scores_gemma":[0.00080338103,0.9957604,0.00019669195,0.0019589383,0.0007652282,0.000010331872,0.000012818601,0.0000021861822,0.00049010484],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934334,0.00019944963,0.00007809934,0.00011833791,0.00021758223,0.00004323664],"domain_scores_gemma":[0.99688196,0.0022237396,0.00017424353,0.00003717342,0.0005736243,0.00010931275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020425033,0.00096875324,0.001623719,0.0038951116,0.0007508494,0.0026464048,0.0013260596,0.0033202874,0.0033135184],"category_scores_gemma":[0.0054614935,0.00047757925,0.0005317939,0.006348116,0.0025329515,0.0060921833,0.0018214961,0.0033275874,0.0014014288],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001216504,0.00010200356,0.0003537406,0.01744003,0.00015454915,0.00020480099,0.00058329775,0.00048431367,0.0004162962,0.019908097,0.23950927,0.72072196],"study_design_scores_gemma":[0.00005456133,0.000083343795,0.0014893708,0.013204347,0.00022605964,0.0007438106,0.00044449684,0.00021038226,0.00023184948,0.012128869,0.97112525,0.000057588524],"about_ca_topic_score_codex":0.007506793,"about_ca_topic_score_gemma":0.009996317,"teacher_disagreement_score":0.007506793,"about_ca_system_score_codex":0.001666822,"about_ca_system_score_gemma":0.003859266,"threshold_uncertainty_score":0.014926195},"labels":[],"label_agreement":null},{"id":"W1525966270","doi":"10.1109/lanman.2015.7114741","title":"TASA: traffic offloading by tag-assisted social-aware opportunistic sharing in mobile social networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bluetooth; Exploit; Computer network; Cellular traffic; Cellular network; TRACE (psycholinguistics); Mobile device; Mobile social network; Mobile computing; Computer security; Wireless; World Wide Web; Telecommunications","score_opus":0.059080327320387385,"score_gpt":0.279030421861813,"score_spread":0.2199500945414256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525966270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1595699,0.0004245589,0.83096915,0.00022359821,0.00018552081,0.00027752033,0.00014734414,0.0020212585,0.0061811856],"genre_scores_gemma":[0.9601647,0.00010587385,0.03783906,0.00008099442,0.000052305797,0.00012012925,0.00009262961,0.00005753106,0.0014866882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991497,0.00024226609,0.000031293173,0.00014469445,0.00022751935,0.00020447306],"domain_scores_gemma":[0.99876523,0.00045470943,0.00014649314,0.0002450687,0.00021629689,0.00017222487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000813933,0.0010575394,0.00083535013,0.00093466154,0.0010943427,0.00095609936,0.0016066434,0.0006375876,0.0010399964],"category_scores_gemma":[0.0023789406,0.0002588572,0.0006681134,0.00087205134,0.0008526118,0.0013752681,0.001961432,0.0005053691,0.00032812817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004933096,0.00076318515,0.008479734,0.00022412463,0.00021704005,0.0008192815,0.0007326793,0.640801,0.048729878,0.03510808,0.0050972253,0.25853446],"study_design_scores_gemma":[0.000012752646,0.00009536051,0.0005950508,0.000006462739,0.000021650407,0.00012424114,0.00010208185,0.98656785,0.002801286,0.007865371,0.0017873729,0.000020457379],"about_ca_topic_score_codex":0.004370106,"about_ca_topic_score_gemma":0.0051730974,"teacher_disagreement_score":0.004370106,"about_ca_system_score_codex":0.00080763013,"about_ca_system_score_gemma":0.0012066185,"threshold_uncertainty_score":0.008689284},"labels":[],"label_agreement":null},{"id":"W1527669161","doi":"10.1109/tsipn.2015.2452811","title":"Optimal Forwarding in Opportunistic Delay Tolerant Networks With Meeting Rate Estimations","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Computer network; Distributed computing; Node (physics); A priori and a posteriori; Network topology; Telecommunications","score_opus":0.019693186406651218,"score_gpt":0.2300917326534443,"score_spread":0.21039854624679308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527669161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096371174,0.00026745486,0.90161985,0.0002038127,0.00001943551,0.000062499246,0.000112946276,0.00028535444,0.0010574263],"genre_scores_gemma":[0.91376114,0.00016475358,0.084973976,0.00004126711,0.000020170164,0.00008732965,0.00013965917,0.00003737678,0.0007744084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00037101578,0.000052869265,0.00021416834,0.00018351329,0.000105459425],"domain_scores_gemma":[0.9926093,0.00554347,0.0010304266,0.00035129354,0.0003429798,0.00012252155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025898248,0.00068770925,0.0010026342,0.00093219976,0.0006824008,0.000872891,0.0016116627,0.0008938974,0.0006186447],"category_scores_gemma":[0.013918424,0.0006319092,0.00038845456,0.0009205855,0.000975666,0.0017728709,0.000996368,0.00072010583,0.00013642397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005441708,0.000020023717,0.00074716454,0.000029407454,0.000011826799,0.000046099525,0.000052486786,0.98207986,0.00071558525,0.0051907315,0.00021270919,0.010839751],"study_design_scores_gemma":[0.000006667396,0.000010569943,0.000116796204,0.0000021258031,0.0000026375685,0.000015771442,0.000014820422,0.9940843,0.0003433342,0.0052869176,0.000111256035,0.000004892059],"about_ca_topic_score_codex":0.005668032,"about_ca_topic_score_gemma":0.0039272252,"teacher_disagreement_score":0.005668032,"about_ca_system_score_codex":0.0013469639,"about_ca_system_score_gemma":0.0012427523,"threshold_uncertainty_score":0.013696432},"labels":[],"label_agreement":null},{"id":"W1538488771","doi":"","title":"Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Steering committee; Computer science; Library science; Wireless network; Telecommunications; Pleasure; Wireless; Event (particle physics); Engineering; Engineering management; World Wide Web; Psychology","score_opus":0.017165325691793954,"score_gpt":0.23225564997859174,"score_spread":0.21509032428679778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538488771","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012780885,0.042506035,0.8020971,0.0076944153,0.016508944,0.0007708664,0.0044112406,0.0066387057,0.10659191],"genre_scores_gemma":[0.19489938,0.09216894,0.42378664,0.0038757222,0.006516545,0.0021769898,0.024208324,0.0027852647,0.24958222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977835,0.00071568514,0.0002514266,0.00021144153,0.00087873,0.00015925156],"domain_scores_gemma":[0.99687296,0.0012880154,0.0001306733,0.00062021473,0.00081436796,0.0002736919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003100227,0.0016400293,0.0018302734,0.0012670176,0.0004524875,0.0040071155,0.0019126885,0.0018988919,0.037488665],"category_scores_gemma":[0.0048660566,0.0006597366,0.0019182696,0.0010035607,0.00076414045,0.0024407767,0.0022798956,0.003138547,0.011522973],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048304163,0.0004778048,0.0053307707,0.0016746642,0.0008413319,0.00061108434,0.000424074,0.16684532,0.008999325,0.06431777,0.32054538,0.4294494],"study_design_scores_gemma":[0.000059930706,0.000218262,0.001984099,0.00044108322,0.00021544819,0.00043308255,0.00013916365,0.2833788,0.002574627,0.028003236,0.68247557,0.00007667681],"about_ca_topic_score_codex":0.006874194,"about_ca_topic_score_gemma":0.0062019974,"teacher_disagreement_score":0.037488665,"about_ca_system_score_codex":0.0009028066,"about_ca_system_score_gemma":0.0023027018,"threshold_uncertainty_score":0.1254121},"labels":[],"label_agreement":null},{"id":"W1540477816","doi":"10.1109/sose.2015.16","title":"Sensor Data Propagation in Mobile Hosting Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Wireless sensor network; Mobile device; Real-time computing; Latency (audio); Energy consumption; Mobile computing; Context (archaeology); Minification; Computer network; Telecommunications; Engineering; World Wide Web","score_opus":0.08992070640422131,"score_gpt":0.2892831398719911,"score_spread":0.1993624334677698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540477816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22317465,0.0052991253,0.7517046,0.002056026,0.00049115083,0.0003232638,0.0005886805,0.0012915572,0.0150710605],"genre_scores_gemma":[0.95610845,0.0026846922,0.03437742,0.00019190884,0.0001302771,0.00013888798,0.00021094055,0.000050134127,0.0061072404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992937,0.00018176831,0.000032890628,0.00012830853,0.00024573255,0.00011760269],"domain_scores_gemma":[0.9975284,0.0014478773,0.00028246094,0.00019232003,0.00048177247,0.000067248766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903061,0.00062038976,0.00052087585,0.0010731652,0.00085125124,0.0011636912,0.0007948678,0.0007279266,0.0018109124],"category_scores_gemma":[0.005146186,0.00037086516,0.00024773288,0.001503167,0.0005853014,0.0015875167,0.0007774627,0.0005676134,0.00034515845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003202386,0.00007790579,0.0086480975,0.00027216363,0.00007174629,0.0006686582,0.00035553068,0.82525176,0.009598326,0.045804724,0.004812397,0.104118444],"study_design_scores_gemma":[0.000013129594,0.00007416938,0.001279146,0.00002506789,0.000024101164,0.00021852835,0.00017680129,0.9747439,0.0021568665,0.015050715,0.0062188404,0.000018758337],"about_ca_topic_score_codex":0.006130031,"about_ca_topic_score_gemma":0.0059267664,"teacher_disagreement_score":0.006130031,"about_ca_system_score_codex":0.0011029468,"about_ca_system_score_gemma":0.00045712545,"threshold_uncertainty_score":0.012188733},"labels":[],"label_agreement":null},{"id":"W1578620116","doi":"10.1111/cogs.12244","title":"The Cognitive Social Network in Dreams: Transitivity, Assortativity, and Giant Component Proportion Are Monotonic","year":2015,"lang":"en","type":"article","venue":"Cognitive Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Assortativity; Transitive relation; Psychology; Dream; Cognition; Social network (sociolinguistics); Cognitive psychology; Neuroscience; Mathematics; Complex network; Computer science; Combinatorics","score_opus":0.0436336666235233,"score_gpt":0.29004953112248966,"score_spread":0.24641586449896635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578620116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922827,0.000080070015,0.0054396456,0.00007349319,0.0000032988755,0.000013655945,0.00023441842,0.000015060887,0.0018576079],"genre_scores_gemma":[0.9981817,0.000031209747,0.0014731991,0.00000460754,0.0000022190634,0.00001147432,0.00012080485,0.0000025615172,0.00017217154],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995165,0.00022018014,0.000036927868,0.00011773586,0.00006557764,0.000043118733],"domain_scores_gemma":[0.99306315,0.0039463495,0.0014302322,0.0007326899,0.00049677846,0.00033087423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011376163,0.00014740266,0.00019577789,0.0017744411,0.000554296,0.00091116794,0.00027577823,0.0001717832,0.0013145105],"category_scores_gemma":[0.010989036,0.00015684978,0.00029447774,0.0014536205,0.001123098,0.0014593077,0.000751165,0.00020156476,0.00009335205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010198023,0.00012061379,0.83502775,0.000267386,0.0004174055,0.0005174626,0.010540685,0.019317688,0.008940692,0.051193297,0.0013417287,0.07129544],"study_design_scores_gemma":[0.00003566252,0.00017712452,0.7985609,0.000046140078,0.00014823886,0.0013745319,0.0059839594,0.07710271,0.0031379354,0.10948455,0.0038689305,0.000079266676],"about_ca_topic_score_codex":0.0038546897,"about_ca_topic_score_gemma":0.004758354,"teacher_disagreement_score":0.0038546897,"about_ca_system_score_codex":0.0007222814,"about_ca_system_score_gemma":0.0002582715,"threshold_uncertainty_score":0.0076645017},"labels":[],"label_agreement":null},{"id":"W1580069493","doi":"10.1109/icc.2015.7248801","title":"A novel D2D data offloading scheme for LTE networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Upload; Bluetooth; Reuse; Cellular network; Telecommunications link; Spectrum management; Scheme (mathematics); Channel (broadcasting); Wireless; Telecommunications; Operating system","score_opus":0.24863161727000774,"score_gpt":0.32342573761382876,"score_spread":0.07479412034382102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580069493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097820796,0.00093880424,0.8912107,0.00024175874,0.00025959645,0.00024670176,0.00018192314,0.0014073416,0.007692403],"genre_scores_gemma":[0.9320926,0.0002670473,0.06419262,0.00014256398,0.00006940185,0.00012757069,0.0001440553,0.000017325116,0.002946808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994073,0.000091815935,0.000045000004,0.00010637274,0.0001905859,0.00015892657],"domain_scores_gemma":[0.9994223,0.00011890591,0.000060699116,0.00016341847,0.00016288883,0.00007190834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026548505,0.00096056244,0.00076080475,0.000833328,0.0017160353,0.000720732,0.0013399886,0.0006457225,0.0014423885],"category_scores_gemma":[0.00092924415,0.00025068817,0.00044690157,0.00081039,0.0004978229,0.00088106823,0.001441135,0.00043841466,0.00047532527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013320409,0.0004714319,0.0044615148,0.0002769335,0.00011615482,0.0012251936,0.0005567291,0.16123098,0.15013683,0.015958598,0.008053901,0.6561797],"study_design_scores_gemma":[0.00008396796,0.0003875311,0.0015049244,0.000019193503,0.000056503297,0.001066346,0.00013874032,0.9668546,0.018561365,0.004512281,0.0067325346,0.00008216361],"about_ca_topic_score_codex":0.0066930475,"about_ca_topic_score_gemma":0.010083992,"teacher_disagreement_score":0.0066930475,"about_ca_system_score_codex":0.0008667112,"about_ca_system_score_gemma":0.0007255905,"threshold_uncertainty_score":0.013308167},"labels":[],"label_agreement":null},{"id":"W1582391565","doi":"10.1109/medhocnet.2015.7173161","title":"An architecture for M2M enabled social networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Architecture; Gateway (web page); Scalability; Autonomy; Process (computing); Default gateway; Human–computer interaction; World Wide Web; Internet privacy; Computer network; Operating system","score_opus":0.0399800458177474,"score_gpt":0.27511366584876895,"score_spread":0.23513362003102156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582391565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043772362,0.00053916714,0.92484015,0.0017328335,0.00030849144,0.0007877222,0.00018002832,0.0067415275,0.02109764],"genre_scores_gemma":[0.55322224,0.0006664881,0.41802824,0.0005535372,0.000113532646,0.00083528395,0.0005723174,0.00021933907,0.025788983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993943,0.00014813266,0.00004445319,0.00013256156,0.00020916288,0.00007139447],"domain_scores_gemma":[0.9993549,0.00011578376,0.00004523058,0.00017170513,0.00019147896,0.00012088664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010513234,0.0005104221,0.00035305417,0.0006071936,0.001701597,0.0018439648,0.0018143533,0.0014066081,0.0034587656],"category_scores_gemma":[0.0014921764,0.0003827375,0.00047318946,0.0005521994,0.00081469695,0.0026380573,0.003027108,0.00093107467,0.0013446594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006917057,0.0006636519,0.006382841,0.0007834368,0.00022618886,0.0016596765,0.0030336932,0.11456904,0.068788946,0.4436365,0.041346435,0.31821796],"study_design_scores_gemma":[0.000108956505,0.0004497657,0.0015845378,0.000117374286,0.00014841618,0.0006866943,0.0006952263,0.6675463,0.019918017,0.09515478,0.21349649,0.00009346407],"about_ca_topic_score_codex":0.004578091,"about_ca_topic_score_gemma":0.0057726605,"teacher_disagreement_score":0.004578091,"about_ca_system_score_codex":0.0012605343,"about_ca_system_score_gemma":0.0013098451,"threshold_uncertainty_score":0.011570752},"labels":[],"label_agreement":null},{"id":"W1588311058","doi":"10.1109/milcom.2005.1605707","title":"Operation of the Dynamic TDMA Subnet Relay System with HF Bearers","year":2006,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Institute of Population and Public Health","funders":"","keywords":"Subnet; Relay; Ultra high frequency; Computer network; Computer science; Software deployment; Telecommunications; Time division multiple access; Suite; Task (project management); Computer security; Engineering; Geography","score_opus":0.0038411753455175287,"score_gpt":0.17082613333568936,"score_spread":0.16698495799017182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588311058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102464,0.00020101579,0.16545193,0.00016773617,0.000063133826,0.00012995499,0.00012568048,0.0009874144,0.022626732],"genre_scores_gemma":[0.9858466,0.000040772527,0.01180797,0.000025270576,0.000017696691,0.000021742424,0.000046946843,0.000010362561,0.0021826378],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985313,0.000030468676,0.00000729415,0.000026426796,0.00004570964,0.000036997273],"domain_scores_gemma":[0.9998072,0.000062946725,0.000027773143,0.000040191997,0.00003744213,0.000024483525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034061878,0.00019499769,0.00022829653,0.00019432542,0.00029375966,0.00036268757,0.0004893654,0.00024137292,0.0014106205],"category_scores_gemma":[0.00045791702,0.000059354792,0.000113522176,0.000086195396,0.00021394508,0.00039332992,0.000340163,0.00011414208,0.00033749887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019407156,0.0003949182,0.024914233,0.00014184354,0.00012182045,0.0020514957,0.0010071383,0.22749312,0.3876765,0.034679733,0.0041729654,0.3154054],"study_design_scores_gemma":[0.00021895672,0.0032904646,0.010418731,0.000017823742,0.00012446556,0.0018700814,0.00034872824,0.8297911,0.12508473,0.003931371,0.024842918,0.000060609185],"about_ca_topic_score_codex":0.001970181,"about_ca_topic_score_gemma":0.0017240011,"teacher_disagreement_score":0.001970181,"about_ca_system_score_codex":0.00026028047,"about_ca_system_score_gemma":0.0002807557,"threshold_uncertainty_score":0.004719019},"labels":[],"label_agreement":null},{"id":"W1592446879","doi":"10.1109/icc.2015.7249443","title":"A Social Awareness based Feedback Mechanism for delivery reliability in Delay Tolerant Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Redundancy (engineering); Receipt; Computer network; Reliability (semiconductor); Overhead (engineering); Mechanism (biology); Construct (python library); Distributed computing; Resource (disambiguation); Node (physics); Engineering; World Wide Web","score_opus":0.05265677429255703,"score_gpt":0.27757649745317897,"score_spread":0.22491972316062195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592446879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093851075,0.0012447771,0.90027446,0.0005187489,0.0002159895,0.00017154831,0.000088589935,0.0012177301,0.002417186],"genre_scores_gemma":[0.9557709,0.00034028667,0.04250944,0.00011662535,0.000098317665,0.00011125944,0.000040258696,0.000023810013,0.0009890925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.00029176226,0.00008316619,0.00021779332,0.00035931854,0.0001032833],"domain_scores_gemma":[0.99698955,0.0013511932,0.00048064924,0.0002755166,0.0007267193,0.00017633464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017855759,0.00063553185,0.00066470355,0.0010628367,0.00092038634,0.000780414,0.0013769692,0.0006852719,0.00066217786],"category_scores_gemma":[0.0065276898,0.00025778363,0.00041952732,0.0005428691,0.000595922,0.0018168403,0.001176821,0.000593784,0.00012008562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009528006,0.000533895,0.0060198153,0.0009096062,0.0002447279,0.0009093057,0.00202189,0.29738453,0.082570374,0.08178471,0.0063404534,0.5203279],"study_design_scores_gemma":[0.00008667441,0.00071745605,0.0016037053,0.00005284519,0.00020093219,0.00054130453,0.00022800325,0.9484852,0.014276817,0.02676238,0.006931989,0.00011266965],"about_ca_topic_score_codex":0.0017833742,"about_ca_topic_score_gemma":0.0013611867,"teacher_disagreement_score":0.0017855759,"about_ca_system_score_codex":0.00078211667,"about_ca_system_score_gemma":0.0010363449,"threshold_uncertainty_score":0.009443164},"labels":[],"label_agreement":null},{"id":"W1767780609","doi":"10.1109/wiopt.2005.52","title":"Towards an Understanding of EASE and Its Properties","year":2005,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Protocol (science); Upper and lower bounds; Routing protocol; Routing (electronic design automation); Exponential function; Distributed computing; Theoretical computer science; Mathematical optimization; Computer network; Mathematics","score_opus":0.11216721477421077,"score_gpt":0.2594456411277467,"score_spread":0.14727842635353594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767780609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038932882,0.0024512154,0.8214182,0.0076881843,0.00025267867,0.00012851757,0.000357521,0.00032715534,0.12844355],"genre_scores_gemma":[0.7929195,0.0059881243,0.16721547,0.0021854572,0.0011197994,0.0005418662,0.00041117583,0.00032841467,0.029290117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989016,0.0002763255,0.000054956843,0.00019730227,0.0003691129,0.00020064418],"domain_scores_gemma":[0.99602985,0.0018295234,0.0004944746,0.00091529876,0.00047018318,0.0002607987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017474556,0.0006833809,0.00087878987,0.0014506109,0.0014085082,0.0034586657,0.0019431452,0.0021475928,0.006683433],"category_scores_gemma":[0.007227715,0.0005916009,0.0009971675,0.0012313658,0.0040521724,0.014299981,0.0034942299,0.003956997,0.0014109275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008824962,0.000010875446,0.00008723416,0.00002730944,0.0000030803772,0.000038971437,0.00009225608,0.0039934567,0.00021195285,0.99214023,0.00059567735,0.002790036],"study_design_scores_gemma":[0.00001482439,0.00003227432,0.00016339499,0.000026190486,0.00001026789,0.00014765126,0.000097531505,0.029372223,0.00032328308,0.9537512,0.016046274,0.000014857466],"about_ca_topic_score_codex":0.0024906902,"about_ca_topic_score_gemma":0.001298964,"teacher_disagreement_score":0.006683433,"about_ca_system_score_codex":0.0012585969,"about_ca_system_score_gemma":0.0010044852,"threshold_uncertainty_score":0.022358358},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Rumor; Vertex (graph theory); Combinatorics; Graph; Computer science; Mathematics; Discrete mathematics","score_opus":0.018086276963633,"score_gpt":0.22632517107915487,"score_spread":0.20823889411552188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179639306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48845318,0.002074332,0.4916024,0.0015326516,0.00007362623,0.00012506673,0.00023623952,0.00040262454,0.015499831],"genre_scores_gemma":[0.9762047,0.0009768346,0.020451777,0.00011571673,0.00011313915,0.00006806276,0.00010240941,0.000058381404,0.001908963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783283,0.0011359459,0.00005578756,0.00029693116,0.00034580173,0.0003326943],"domain_scores_gemma":[0.93275875,0.055211376,0.0057503087,0.003739874,0.0014617678,0.0010779748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002725706,0.0006665876,0.00075992435,0.0021915263,0.001285584,0.0019186939,0.0017610028,0.0013123001,0.0022406538],"category_scores_gemma":[0.037085872,0.0005158547,0.0005324792,0.0016576123,0.0029903117,0.006116908,0.002502494,0.0019723799,0.00034906185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076544745,0.0001532883,0.012586888,0.0004403961,0.0001480101,0.00080626685,0.0023699875,0.22408426,0.02218879,0.6784326,0.0031448144,0.054879345],"study_design_scores_gemma":[0.000056590547,0.00018275197,0.0028026248,0.000073245974,0.00009125437,0.00079781766,0.00047120446,0.6384621,0.0059485473,0.347232,0.0038189078,0.000062825915],"about_ca_topic_score_codex":0.0018449137,"about_ca_topic_score_gemma":0.00096567255,"teacher_disagreement_score":0.002725706,"about_ca_system_score_codex":0.0013607843,"about_ca_system_score_gemma":0.00038540407,"threshold_uncertainty_score":0.014415085},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israeli Centers for Research Excellence","keywords":"Computer science; Incentive; Reputation; Scheme (mathematics); Distributed computing; Microeconomics","score_opus":0.02456562186060364,"score_gpt":0.2476865249307305,"score_spread":0.22312090307012689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1805437643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01893114,0.0014791036,0.95958924,0.00079369644,0.0006978533,0.00035947154,0.0004928819,0.0053762863,0.01228031],"genre_scores_gemma":[0.5584728,0.0014427231,0.3950845,0.00041742253,0.0003641998,0.00039231026,0.0009952041,0.0004688551,0.04236188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992686,0.00014854761,0.000048945734,0.000106029445,0.0003159706,0.000111912435],"domain_scores_gemma":[0.9990569,0.00021903802,0.00009444997,0.00024470018,0.00020794266,0.00017700218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014169499,0.0006140428,0.0009430642,0.00059749023,0.001029849,0.0016089611,0.0029401486,0.0010036774,0.0041165804],"category_scores_gemma":[0.0026487114,0.00036348854,0.0004606395,0.000775121,0.0005163402,0.0026770057,0.002504137,0.0015430995,0.0013268036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013751829,0.0005149549,0.0010770062,0.00064980105,0.00014497928,0.00038746223,0.00042734764,0.07908768,0.03830366,0.18929696,0.06839669,0.62033826],"study_design_scores_gemma":[0.00029029837,0.00051435665,0.001052477,0.00008817418,0.00012218097,0.00090373144,0.000099740406,0.75401413,0.023873853,0.078794405,0.14008392,0.00016282556],"about_ca_topic_score_codex":0.0012321504,"about_ca_topic_score_gemma":0.0017491366,"teacher_disagreement_score":0.0041165804,"about_ca_system_score_codex":0.0011144207,"about_ca_system_score_gemma":0.0014053201,"threshold_uncertainty_score":0.013771355},"labels":[],"label_agreement":null},{"id":"W1833054536","doi":"10.1109/icc.2002.997447","title":"Scheduled rendezvous and RFID wakeup in embedded wireless networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rendezvous; Computer science; Computer network; Wireless; Wireless network; Embedded system; Telecommunications; Engineering","score_opus":0.010435158728125515,"score_gpt":0.21290245463754454,"score_spread":0.20246729590941903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833054536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37944937,0.0097047575,0.58728576,0.00029835608,0.00011479485,0.00008449617,0.00004508018,0.00041218472,0.022605116],"genre_scores_gemma":[0.95276654,0.0019372156,0.03918929,0.0000615496,0.00004583939,0.00005480813,0.000040791358,0.000029845874,0.005874183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981743,0.00005004579,0.0000072863254,0.000033111763,0.00006118752,0.000031023028],"domain_scores_gemma":[0.99947876,0.00032685368,0.00006970608,0.00006225857,0.000044242603,0.000018311335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026657394,0.00027244329,0.00022633423,0.00029148927,0.0003509287,0.000402201,0.00042826007,0.00033253548,0.00089005206],"category_scores_gemma":[0.0011155269,0.00019065475,0.0001238346,0.00042597472,0.0005766527,0.0008256319,0.00033155223,0.00024233216,0.00013425412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005617299,0.00012806024,0.004321945,0.000377196,0.00007633143,0.0008362324,0.00037554526,0.5496496,0.102836624,0.11312393,0.001833573,0.22587919],"study_design_scores_gemma":[0.000088337714,0.00075173395,0.0046833465,0.00004472581,0.00008500161,0.0015831141,0.0003072864,0.82428837,0.07313716,0.076342724,0.018632308,0.00005591388],"about_ca_topic_score_codex":0.0009983758,"about_ca_topic_score_gemma":0.0014672477,"teacher_disagreement_score":0.0009983758,"about_ca_system_score_codex":0.00029917646,"about_ca_system_score_gemma":0.00022383576,"threshold_uncertainty_score":0.0029774904},"labels":[],"label_agreement":null},{"id":"W1840584530","doi":"","title":"Integrating wireless sensor networks and mobile ad hoc networks for an enhanced end-user experience","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Wireless sensor network; Overlay; Wireless ad hoc network; Overlay network; Architecture; Interconnection; Distributed computing; Wireless; Telecommunications; The Internet; Geography; World Wide Web","score_opus":0.014552554361625003,"score_gpt":0.2642927319468651,"score_spread":0.2497401775852401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840584530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12584074,0.0022832237,0.8205012,0.0023269232,0.0002924188,0.00013871286,0.00003542446,0.0016153943,0.046965927],"genre_scores_gemma":[0.684935,0.0022993195,0.292409,0.00039102096,0.00023895747,0.000073813804,0.000090525966,0.000094704075,0.019467695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997309,0.00010219795,0.000013473087,0.000019722958,0.000106988606,0.000026674223],"domain_scores_gemma":[0.9996599,0.00013952568,0.000019592788,0.000055259443,0.00008045548,0.00004531563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044996198,0.0003103719,0.0001618145,0.00015603815,0.00022618148,0.00078682206,0.0003735436,0.00054953364,0.002332448],"category_scores_gemma":[0.0010236065,0.00015213991,0.00014908434,0.00022298246,0.00018269084,0.0021077462,0.00084958883,0.0004969375,0.00040745345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005229872,0.0003937484,0.0051388377,0.0006696395,0.00007597441,0.0020811202,0.002397153,0.028753411,0.18490511,0.15210022,0.014084436,0.6088773],"study_design_scores_gemma":[0.00011666394,0.0018697408,0.0069458038,0.00024739432,0.00017800597,0.0063597285,0.00215729,0.3617258,0.05803406,0.107226186,0.45503157,0.00010781329],"about_ca_topic_score_codex":0.00017009511,"about_ca_topic_score_gemma":0.0005029174,"teacher_disagreement_score":0.002332448,"about_ca_system_score_codex":0.00013924172,"about_ca_system_score_gemma":0.00021070537,"threshold_uncertainty_score":0.007802844},"labels":[],"label_agreement":null},{"id":"W1851445302","doi":"10.15353/joci.v4i1.2964","title":"Introduction to the Special Issue: Wireless Networking for Communities, Citizens and the Public Interest","year":2008,"lang":"en","type":"article","venue":"The Journal of Community Informatics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Internet privacy; Wireless; Public relations; Telecommunications; Political science; Business; Sociology; Computer science","score_opus":0.0636360593004488,"score_gpt":0.25863400211284704,"score_spread":0.19499794281239824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851445302","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034959146,0.03300049,0.0029873627,0.037476376,0.88091254,0.00013816336,0.0002815792,0.00020551443,0.044648364],"genre_scores_gemma":[0.0014324951,0.026082221,0.00065276615,0.017424788,0.8605626,0.00012723978,0.0003152134,0.00019254822,0.09321002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808913,0.00023485589,0.00020277417,0.00033012236,0.00092131936,0.00022183498],"domain_scores_gemma":[0.99250656,0.0022008736,0.00051492004,0.00028202403,0.002398034,0.0020975412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021078566,0.0030212326,0.003946147,0.0034778672,0.0022896586,0.00863565,0.002659067,0.009064853,0.06957589],"category_scores_gemma":[0.0048121726,0.00075019634,0.0018152931,0.002340128,0.0014106587,0.0061227665,0.0027462034,0.010025291,0.038994774],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020414362,0.000044353772,0.000100178935,0.00020965519,0.00001092051,0.00009315015,0.000017115955,0.00008256904,0.00017851299,0.0018032088,0.97598654,0.021453341],"study_design_scores_gemma":[0.0000120005025,0.000077009856,0.0005009677,0.0002659866,0.00002120457,0.0002533083,0.00005097065,0.00030913568,0.00006598182,0.0021520348,0.9962702,0.00002130572],"about_ca_topic_score_codex":0.0009780369,"about_ca_topic_score_gemma":0.0028877174,"teacher_disagreement_score":0.06957589,"about_ca_system_score_codex":0.0015579106,"about_ca_system_score_gemma":0.0018073777,"threshold_uncertainty_score":0.23275453},"labels":[],"label_agreement":null},{"id":"W185524144","doi":"10.1007/978-1-4614-8397-7_3","title":"Unicast Capacity of Vehicular Networks with Socialized Mobility","year":2013,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unicast; Computer network; Transport engineering; Computer science; Business; Engineering; Multicast","score_opus":0.010295318501793447,"score_gpt":0.17529411988289104,"score_spread":0.1649988013810976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185524144","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.542763,0.015977683,0.34085572,0.0063587534,0.0004900801,0.000120903846,0.0021615082,0.0009042728,0.09036808],"genre_scores_gemma":[0.9905094,0.0026430434,0.002138434,0.00011437739,0.0002126041,0.00007226871,0.00021064605,0.000074095915,0.0040251515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865544,0.00041219543,0.00003978298,0.0001555834,0.000287674,0.0004493745],"domain_scores_gemma":[0.98762506,0.009705511,0.00050650584,0.00055797806,0.0012078295,0.0003971067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016595039,0.00072371657,0.0014957478,0.0021406717,0.0012327796,0.0028888353,0.0024010856,0.0013724504,0.0045972993],"category_scores_gemma":[0.0116191525,0.000924401,0.00052610936,0.0026784483,0.0021033639,0.0035926842,0.0026445403,0.001403306,0.0006129955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005036939,0.00006765565,0.00089168584,0.00040251456,0.000093471084,0.00037469642,0.00086170883,0.5538064,0.0069803544,0.39933616,0.008825358,0.02785627],"study_design_scores_gemma":[0.000019883331,0.000054257715,0.00042464992,0.00007695149,0.000034520945,0.00029204722,0.00027292027,0.75240505,0.0015564878,0.24283539,0.0019797469,0.000048192414],"about_ca_topic_score_codex":0.004555655,"about_ca_topic_score_gemma":0.0023176377,"teacher_disagreement_score":0.0045972993,"about_ca_system_score_codex":0.0023644958,"about_ca_system_score_gemma":0.0015319984,"threshold_uncertainty_score":0.017155766},"labels":[],"label_agreement":null},{"id":"W1863801877","doi":"","title":"Simulation of energy efficilent data dissemination in wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Wireless sensor network; Dissemination; Scalability; Energy consumption; Distributed computing; Computer network; Protocol (science); Real-time computing; Telecommunications; Engineering; Database","score_opus":0.01988021753904631,"score_gpt":0.26300296871466805,"score_spread":0.24312275117562174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863801877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716948,0.00041000164,0.21907616,0.00040077293,0.00005137948,0.00012308064,0.000284452,0.0007287866,0.0072305026],"genre_scores_gemma":[0.9818627,0.00017368505,0.016896006,0.00002623963,0.0000038754056,0.000078505785,0.00012229128,0.000025050067,0.00081163656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949527,0.00023213394,0.00003209471,0.000049733397,0.00013532212,0.000055435914],"domain_scores_gemma":[0.99777067,0.001777354,0.00012704023,0.0001087711,0.00016036924,0.000055859364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010414743,0.00040283357,0.00048993883,0.0005162895,0.00036776814,0.00057534716,0.00063875143,0.0006756648,0.00071979256],"category_scores_gemma":[0.004208372,0.00027385715,0.00033934982,0.0005697308,0.000597997,0.0007591054,0.00055816147,0.00039619222,0.000077124634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039996794,0.0000294359,0.00081141177,0.000018116296,0.00000954629,0.000020395193,0.000025987049,0.9943879,0.0011488802,0.0013969277,0.000055995635,0.0020554136],"study_design_scores_gemma":[0.000007807947,0.000017715924,0.00009458648,0.000001340379,0.0000026279586,0.000004266908,0.0000060962816,0.9987382,0.0007048309,0.0002962478,0.00012443941,0.0000017604873],"about_ca_topic_score_codex":0.006124142,"about_ca_topic_score_gemma":0.003049023,"teacher_disagreement_score":0.006124142,"about_ca_system_score_codex":0.0009285352,"about_ca_system_score_gemma":0.00068655115,"threshold_uncertainty_score":0.0121769905},"labels":[],"label_agreement":null},{"id":"W1868870237","doi":"10.15353/joci.v4i1.2970","title":"Metropolitan Wi-Fi Research Network at the Los Angeles State Historic Park","year":2008,"lang":"en","type":"article","venue":"The Journal of Community Informatics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Cisco Systems; National Science Foundation","keywords":"Metropolitan area; Downtown; Software deployment; Citizen journalism; Urban computing; Creativity; Geography; Sociology; Computer science; Political science; World Wide Web; Archaeology","score_opus":0.11204466524357605,"score_gpt":0.32047191806353215,"score_spread":0.2084272528199561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868870237","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14046492,0.0059771896,0.035996106,0.027471934,0.0021565359,0.00090807927,0.03276939,0.012864652,0.74139106],"genre_scores_gemma":[0.29022363,0.004635247,0.05892797,0.0011068373,0.00052610884,0.0008896933,0.02407119,0.0007323007,0.61888707],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9995926,0.000086919164,0.000010304022,0.000112260146,0.00013110506,0.00006690675],"domain_scores_gemma":[0.9990964,0.00013221694,0.00006919046,0.00009074121,0.0004008125,0.00021071822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006874032,0.00044220206,0.00026204638,0.0007774838,0.0013312788,0.0014151394,0.0007872949,0.00038699288,0.04066421],"category_scores_gemma":[0.0010855782,0.00017909575,0.00010871679,0.0010529602,0.00029161657,0.0011544026,0.00085534545,0.00067064096,0.008373739],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033020123,0.0003417001,0.0200771,0.00019053894,0.00004954594,0.00057794986,0.00082525867,0.0010569155,0.0037860903,0.017518494,0.6848154,0.2704308],"study_design_scores_gemma":[0.00006814138,0.00015850629,0.009590985,0.00009772854,0.000030514666,0.00019351802,0.0011864103,0.008739936,0.002314063,0.0024590096,0.97512203,0.000039121343],"about_ca_topic_score_codex":0.044252567,"about_ca_topic_score_gemma":0.086842895,"teacher_disagreement_score":0.044252567,"about_ca_system_score_codex":0.0011187616,"about_ca_system_score_gemma":0.0022347802,"threshold_uncertainty_score":0.13603538},"labels":[],"label_agreement":null},{"id":"W1945981647","doi":"10.1002/wcm.2405","title":"Sparsely‐deployed relay node assisted routing algorithm for vehicular ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Relay; Routing protocol; Network packet; Wireless ad hoc network; Node (physics); Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Zone Routing Protocol; Wireless; Telecommunications","score_opus":0.03908896661281739,"score_gpt":0.26076637058247304,"score_spread":0.22167740396965566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945981647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059201516,0.00051231927,0.9384285,0.00013219555,0.00004739686,0.00005220451,0.000029508015,0.00039176806,0.0012045206],"genre_scores_gemma":[0.833202,0.0003533327,0.16503377,0.00004838242,0.000040172523,0.00007168135,0.00010153395,0.00002421719,0.001124962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996822,0.0001260683,0.000014879706,0.00004656021,0.00009859231,0.00003174013],"domain_scores_gemma":[0.99934775,0.00032512035,0.00011531592,0.000061784594,0.00012431126,0.000025712994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052590884,0.000492865,0.0005999057,0.00073309516,0.00029142536,0.0004179522,0.0010295891,0.0004436562,0.0005319389],"category_scores_gemma":[0.0015455862,0.00022140816,0.00032986767,0.0005283706,0.0003117628,0.00080036995,0.0006293896,0.0003210776,0.0001744846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012129162,0.000038384238,0.00072595023,0.00006287422,0.00005689472,0.00015151581,0.000108302775,0.8987596,0.008571955,0.008967227,0.0010339761,0.08140206],"study_design_scores_gemma":[0.0000078208905,0.00004068505,0.00007438002,0.0000023034418,0.000006191963,0.000035454632,0.000009818467,0.9971923,0.0005802982,0.001702381,0.0003442131,0.0000042766637],"about_ca_topic_score_codex":0.0013978919,"about_ca_topic_score_gemma":0.0015294972,"teacher_disagreement_score":0.0013978919,"about_ca_system_score_codex":0.00039672098,"about_ca_system_score_gemma":0.0004077624,"threshold_uncertainty_score":0.002878368},"labels":[],"label_agreement":null},{"id":"W1947768731","doi":"10.1109/infocom.2014.6848134","title":"Improving data forwarding in Mobile Social Networks with infrastructure support: A space-crossing community approach","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Space (punctuation); Routing (electronic design automation); Computer network; Exploit; Distributed computing; Computer security","score_opus":0.02447025413052787,"score_gpt":0.24859952721521178,"score_spread":0.22412927308468392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947768731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12584364,0.00074295484,0.86997527,0.0007105905,0.000050289684,0.00023914453,0.00007553992,0.00037714964,0.0019854943],"genre_scores_gemma":[0.756701,0.00046149016,0.24090739,0.00016507719,0.000083582316,0.00015564253,0.00016680147,0.00004699439,0.0013120635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978818,0.00079544215,0.000086166954,0.00041782754,0.0006282203,0.00019049492],"domain_scores_gemma":[0.9900726,0.00629136,0.0010142161,0.000879176,0.0013018956,0.00044070644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004005833,0.000978772,0.0010902222,0.0039875936,0.0021542504,0.0015731503,0.0022285413,0.0018587612,0.0008386648],"category_scores_gemma":[0.014806148,0.00047570645,0.0011599262,0.0023106884,0.0014020577,0.004748115,0.0030775005,0.0010192168,0.00018171952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003276205,0.0005405782,0.018007424,0.0004157657,0.00034418193,0.00058037485,0.0019125496,0.5352254,0.014538918,0.092626356,0.0034183552,0.33206248],"study_design_scores_gemma":[0.000026630116,0.00016797784,0.0010811944,0.00001837237,0.000055569086,0.0002481174,0.00026164166,0.97405225,0.0025471887,0.019004056,0.0025081898,0.000028824381],"about_ca_topic_score_codex":0.0055707414,"about_ca_topic_score_gemma":0.004828587,"teacher_disagreement_score":0.0055707414,"about_ca_system_score_codex":0.0015340267,"about_ca_system_score_gemma":0.0015151204,"threshold_uncertainty_score":0.02118516},"labels":[],"label_agreement":null},{"id":"W1963640435","doi":"10.1109/lcnw.2012.6424071","title":"Towards provisioning vehicle-based rural information services","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Provisioning; Computer science; Computer network; Network packet; Service (business); Business","score_opus":0.009802793519958556,"score_gpt":0.22211549375272588,"score_spread":0.21231270023276733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963640435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13184102,0.0019907025,0.8517265,0.0010969014,0.00015463094,0.00035207218,0.0002552272,0.0022173342,0.010365622],"genre_scores_gemma":[0.7296992,0.0016816098,0.26225775,0.00022852962,0.00004641285,0.000083477185,0.0004872649,0.00005675081,0.0054589454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976796,0.00006180456,0.000009787259,0.000038353148,0.00007123396,0.000050838607],"domain_scores_gemma":[0.99951017,0.000091739785,0.000051434567,0.000078594945,0.0002128328,0.000055178392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053274626,0.0003449318,0.00023648707,0.00049580005,0.0003671866,0.0008851051,0.0010526398,0.0006775402,0.0015445416],"category_scores_gemma":[0.0011002634,0.0001980176,0.00015148212,0.00084923144,0.0003016841,0.0010310899,0.0009139586,0.00047953444,0.00087305735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040272303,0.00038555881,0.008728421,0.000736039,0.0000823635,0.00058603735,0.00079479587,0.21726228,0.12509376,0.060634047,0.01765074,0.56764334],"study_design_scores_gemma":[0.000049040424,0.00044718062,0.0018868941,0.000064251406,0.00005865542,0.0005186035,0.00082376215,0.83854336,0.03669569,0.012527277,0.10833641,0.000048934977],"about_ca_topic_score_codex":0.003273687,"about_ca_topic_score_gemma":0.0030091102,"teacher_disagreement_score":0.003273687,"about_ca_system_score_codex":0.00042249603,"about_ca_system_score_gemma":0.00088335515,"threshold_uncertainty_score":0.006509304},"labels":[],"label_agreement":null},{"id":"W1963998539","doi":"10.1145/2079327.2079339","title":"Towards a scalable routing architecture for dynamic substrates","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Computer network; Routing (electronic design automation); Architecture; Policy-based routing; Distributed computing; Static routing; Dynamic Source Routing; Node (physics); Key (lock); Geographic routing; Link-state routing protocol; Equal-cost multi-path routing; Routing protocol; Engineering; Computer security; Database; Geography","score_opus":0.03300716531919993,"score_gpt":0.24275129275167753,"score_spread":0.2097441274324776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963998539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08406743,0.0011034374,0.9010398,0.00066514034,0.00015597368,0.00011355738,0.0001346913,0.0027283393,0.009991745],"genre_scores_gemma":[0.48049507,0.0013067509,0.508092,0.00018892474,0.00008786386,0.00022789456,0.0006747027,0.00020098394,0.0087258965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997408,0.00004341828,0.000024050794,0.000046547488,0.00010160518,0.000043549655],"domain_scores_gemma":[0.9994961,0.000073777104,0.00005019377,0.00015164232,0.00017872467,0.0000495223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051078544,0.0004306328,0.0004284291,0.0005792519,0.0007405755,0.001659786,0.0017332184,0.00060299487,0.001598534],"category_scores_gemma":[0.0009366411,0.00033316883,0.00028895223,0.00086481957,0.00049911,0.0023285255,0.0012677436,0.0006866424,0.0006472071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029553522,0.00014590539,0.0022821114,0.00041123573,0.00009867511,0.0007266683,0.000397677,0.3569764,0.13517107,0.1452772,0.01778512,0.34043244],"study_design_scores_gemma":[0.00003630351,0.00028589036,0.00066305243,0.000041986008,0.000060951712,0.00042552798,0.00022117405,0.89054435,0.019069547,0.053550992,0.035052337,0.000047901354],"about_ca_topic_score_codex":0.0011730811,"about_ca_topic_score_gemma":0.0025142818,"teacher_disagreement_score":0.0017332184,"about_ca_system_score_codex":0.00062796683,"about_ca_system_score_gemma":0.0005378977,"threshold_uncertainty_score":0.0053476095},"labels":[],"label_agreement":null},{"id":"W1964476712","doi":"10.1109/bwcca.2012.102","title":"A Density Mapping Algorithm for Supporting Cyber Foraging Service Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Foraging; Service (business); Computer network; Distributed computing; Business; Geology","score_opus":0.031526273479189806,"score_gpt":0.25992794386361756,"score_spread":0.22840167038442777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964476712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020458175,0.000121114914,0.9766203,0.00014797902,0.000029210245,0.000102856844,0.000057944664,0.00073956075,0.0017228442],"genre_scores_gemma":[0.25921586,0.00018366374,0.7371335,0.00007457784,0.00004033253,0.00034750695,0.0002920571,0.00010997279,0.0026025309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951315,0.00013845309,0.000034696295,0.000080201295,0.00016664674,0.00006688115],"domain_scores_gemma":[0.9979845,0.0011876202,0.00013581106,0.00019532615,0.00041419343,0.000082359584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010710785,0.00069509534,0.00084398506,0.0016733601,0.0010518779,0.0010463523,0.0016455475,0.0010858285,0.00226435],"category_scores_gemma":[0.006902119,0.0004740698,0.00054020464,0.0016120633,0.00056975364,0.0019668804,0.0014074289,0.00081526034,0.0007519324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019708373,0.00015185883,0.0027104765,0.00009868967,0.000046044755,0.00013709467,0.00046670967,0.6464985,0.004070238,0.027754592,0.004507531,0.31336117],"study_design_scores_gemma":[0.000013913484,0.000022309208,0.000102551734,0.0000046098594,0.0000036939487,0.000049067934,0.000035632882,0.99256563,0.00067681883,0.0055648065,0.0009541836,0.0000067047285],"about_ca_topic_score_codex":0.007343018,"about_ca_topic_score_gemma":0.005827997,"teacher_disagreement_score":0.007343018,"about_ca_system_score_codex":0.0011569473,"about_ca_system_score_gemma":0.0015173582,"threshold_uncertainty_score":0.014600575},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04952587965226581,"score_gpt":0.2736031758979922,"score_spread":0.2240772962457264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965068054","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04688302,0.08013981,0.56772953,0.2649339,0.0022082091,0.0003736942,0.00030079894,0.0003505691,0.03708038],"genre_scores_gemma":[0.7538049,0.079359464,0.14603843,0.005441764,0.005551385,0.00048936374,0.00024387594,0.0000794842,0.008991319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935268,0.0032257396,0.0003318863,0.0007506462,0.0016525042,0.0005124529],"domain_scores_gemma":[0.9835802,0.01135778,0.0010221271,0.0019994266,0.0014389126,0.00060160545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008432057,0.00085043156,0.0014020897,0.0014480223,0.0040141996,0.008716389,0.002664229,0.005273089,0.001655129],"category_scores_gemma":[0.012701582,0.0008342023,0.0009267927,0.0023816344,0.006053114,0.017757786,0.0062517906,0.005996588,0.00043803224],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007525445,0.00010649828,0.0023511546,0.00078735186,0.00008309073,0.00035683496,0.0012530035,0.021762777,0.0012963424,0.771523,0.01403958,0.18636517],"study_design_scores_gemma":[0.000024545358,0.00008507694,0.0007701592,0.00046903815,0.00004253817,0.00086129206,0.0022173095,0.11677397,0.001138867,0.8166228,0.060918525,0.00007597255],"about_ca_topic_score_codex":0.0016953965,"about_ca_topic_score_gemma":0.0016626676,"teacher_disagreement_score":0.008716389,"about_ca_system_score_codex":0.0027093207,"about_ca_system_score_gemma":0.0023633083,"threshold_uncertainty_score":0.044593513},"labels":[],"label_agreement":null},{"id":"W1969463950","doi":"10.1109/icc.2010.5502781","title":"Distributed Clock Synchronization in Delay Tolerant Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Clock synchronization; Computer science; Asynchronous communication; Computer network; Clock drift; Self-clocking signal; Data synchronization; Synchronization (alternating current); Robustness (evolution); Distributed computing; Real-time computing; Wireless sensor network; Clock skew; Clock signal; Telecommunications; Channel (broadcasting); Jitter","score_opus":0.006996904712193332,"score_gpt":0.2140673282154808,"score_spread":0.20707042350328747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969463950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029056042,0.0019429742,0.96538615,0.000244975,0.00022282374,0.000037623355,0.000039982417,0.00022450135,0.0028449653],"genre_scores_gemma":[0.9079644,0.0021199966,0.0861365,0.000106677464,0.00022573369,0.00013262684,0.00008946841,0.00003655843,0.0031879705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996182,0.0001068712,0.000022944008,0.000087515706,0.00013005338,0.000034353023],"domain_scores_gemma":[0.9994821,0.00024461155,0.000087713415,0.000062669635,0.00009651255,0.000026439924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058041327,0.0003093271,0.00036911076,0.0004021943,0.0003703917,0.00065092754,0.000561756,0.00037440297,0.00069558405],"category_scores_gemma":[0.0018653416,0.00013722948,0.00012585561,0.000654448,0.0005321471,0.00082354737,0.00061254494,0.0003925472,0.00013085724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000277926,0.00003370767,0.0012258322,0.00030100418,0.000048852748,0.00028379334,0.00022928625,0.6127298,0.01889634,0.19583999,0.002568324,0.16756517],"study_design_scores_gemma":[0.000091399925,0.00014931454,0.00028259843,0.000029352326,0.00003078595,0.00014299937,0.000060119466,0.89938307,0.005942067,0.079135865,0.01472644,0.000026004991],"about_ca_topic_score_codex":0.0009335264,"about_ca_topic_score_gemma":0.0006680243,"teacher_disagreement_score":0.0009335264,"about_ca_system_score_codex":0.00052257837,"about_ca_system_score_gemma":0.00043322516,"threshold_uncertainty_score":0.0037916303},"labels":[],"label_agreement":null},{"id":"W1973966313","doi":"10.1145/1501434.1501467","title":"A privacy-preserving UBICOMP architecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"National Research Council Canada","keywords":"Ubiquitous computing; Computer science; Software deployment; Internet privacy; Information privacy; Architecture; Human–computer interaction; Privacy software; The Internet; World Wide Web; Computer security","score_opus":0.00954295875801017,"score_gpt":0.20689407432632284,"score_spread":0.19735111556831267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973966313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019041868,0.0005660955,0.9635339,0.0006360851,0.00010058724,0.00029977667,0.00008558738,0.00398177,0.011754325],"genre_scores_gemma":[0.47141066,0.0009994737,0.50082856,0.0006315092,0.00015274558,0.00039957353,0.00046741706,0.0002705396,0.024839468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980259,0.0003178832,0.00014061833,0.000379749,0.0009023331,0.00023355696],"domain_scores_gemma":[0.9975157,0.00025182698,0.00019263441,0.0010753941,0.0007108975,0.00025362038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022616251,0.0005733395,0.0006823982,0.0008454476,0.0022676599,0.0033834553,0.00461913,0.002055704,0.0019977458],"category_scores_gemma":[0.0028620877,0.00068748614,0.0004315007,0.001395963,0.0011876192,0.004286502,0.0036957364,0.0021077492,0.0012030476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015037569,0.0006483801,0.0033712457,0.00042390902,0.00019269924,0.001495661,0.0021465921,0.06934283,0.03940138,0.36492965,0.032071415,0.48447248],"study_design_scores_gemma":[0.00013859794,0.00044228954,0.0011688956,0.00009288473,0.00015478005,0.0020662143,0.00043793058,0.6621134,0.03736866,0.16505224,0.13080278,0.00016128858],"about_ca_topic_score_codex":0.00304968,"about_ca_topic_score_gemma":0.0027800854,"teacher_disagreement_score":0.00461913,"about_ca_system_score_codex":0.00097402715,"about_ca_system_score_gemma":0.0016345864,"threshold_uncertainty_score":0.011960745},"labels":[],"label_agreement":null},{"id":"W19786","doi":"","title":"Jamming with SKAM","year":2004,"lang":"en","type":"article","venue":"Essays on Canadian writing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Jamming; Physics; Condensed matter physics","score_opus":0.010712147030928282,"score_gpt":0.19858082444118613,"score_spread":0.18786867741025784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W19786","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009936323,0.008873814,0.006863943,0.291354,0.018867187,0.000048959373,0.00023009062,0.00025514988,0.6635705],"genre_scores_gemma":[0.35287836,0.007594965,0.0023278957,0.056711104,0.005510428,0.00005021416,0.000120747114,0.0003441245,0.57446223],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661666,0.0006704594,0.00007223174,0.00039178852,0.001568413,0.00068053266],"domain_scores_gemma":[0.9955449,0.0012474317,0.0002239036,0.00035975437,0.002054738,0.00056912267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024645398,0.0009188666,0.00043146222,0.0016223597,0.018094027,0.008672554,0.0012168805,0.0056494065,0.012688613],"category_scores_gemma":[0.012650534,0.00042942865,0.00043562416,0.0018715836,0.012295064,0.004923919,0.0024396356,0.006987932,0.0024064402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010035246,0.000021677402,0.000495237,0.00011297262,0.000029553134,0.00023089729,0.014835985,0.00075100776,0.00052423263,0.4138747,0.53376,0.035263494],"study_design_scores_gemma":[0.000008625029,0.0000116098545,0.00046021925,0.00012469657,0.000012795027,0.00010948442,0.005427589,0.00029415262,0.00030292242,0.022052588,0.9711604,0.000034872224],"about_ca_topic_score_codex":0.51100725,"about_ca_topic_score_gemma":0.63027567,"teacher_disagreement_score":0.51100725,"about_ca_system_score_codex":0.022645358,"about_ca_system_score_gemma":0.016042585,"threshold_uncertainty_score":0.98374504},"labels":[],"label_agreement":null},{"id":"W1979437486","doi":"10.1109/icc.2010.5501798","title":"Exploiting Node Localization for Performance Improvement of Vehicular Delay-Tolerant Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Instituto de Telecomunicações","keywords":"Computer science; Computer network; Node (physics); Byte; Scheduling (production processes); Duration (music); Real-time computing; Distributed computing; Mobility model; Engineering","score_opus":0.012877135375744307,"score_gpt":0.22083355121445547,"score_spread":0.20795641583871116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979437486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.501002,0.0017061166,0.49151173,0.00029446627,0.000047252677,0.000041108608,0.00004080854,0.0013448761,0.0040115966],"genre_scores_gemma":[0.9933816,0.00014571991,0.006293501,0.000010301666,0.0000065386275,0.0000064468027,0.000012318878,0.000006637429,0.0001370384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994843,0.00020047347,0.000023959863,0.000060049595,0.00012943071,0.00010176849],"domain_scores_gemma":[0.9980768,0.0011491891,0.0003314928,0.00016435864,0.00020652187,0.00007159865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010630647,0.00047922644,0.0004725307,0.0006268498,0.00033943445,0.0006033625,0.00056409807,0.00031552895,0.00032823236],"category_scores_gemma":[0.004280293,0.00014024456,0.00013708822,0.00058644614,0.0003718589,0.0007807569,0.0006572,0.00021693153,0.00009940208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037822442,0.00008322723,0.0038682057,0.00007583354,0.000027300232,0.00010012539,0.00012761951,0.8888522,0.019276837,0.0037737896,0.000416206,0.08302047],"study_design_scores_gemma":[0.000014749182,0.00026001324,0.0007069474,0.000006416735,0.000018486056,0.000073206145,0.000039124272,0.9891908,0.008083328,0.0011197396,0.00047585115,0.000011335541],"about_ca_topic_score_codex":0.0014264393,"about_ca_topic_score_gemma":0.001334814,"teacher_disagreement_score":0.0014264393,"about_ca_system_score_codex":0.00064224465,"about_ca_system_score_gemma":0.0004700208,"threshold_uncertainty_score":0.005622089},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Anonymity; Authentication (law); Computer network; Cryptography; Public key infrastructure; Cryptographic protocol; Public-key cryptography; Encryption","score_opus":0.010516396738750168,"score_gpt":0.23212956511531768,"score_spread":0.22161316837656753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980690490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055229902,0.005164555,0.8971182,0.0055421432,0.00052734825,0.00020338039,0.00029006338,0.0004086779,0.035515796],"genre_scores_gemma":[0.8598542,0.0064115385,0.11844115,0.0008420308,0.0008986644,0.00048671928,0.00027249855,0.00007731195,0.012715815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956144,0.0016683771,0.0002953226,0.0006468285,0.001254735,0.0005202848],"domain_scores_gemma":[0.9902491,0.006389916,0.00091847766,0.0013662366,0.0007289125,0.00034729016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030250251,0.00061823067,0.0007579766,0.0012573543,0.0025825705,0.0047876546,0.001134042,0.0022639323,0.002238955],"category_scores_gemma":[0.008177883,0.00049284217,0.00073670613,0.002368526,0.004662225,0.0075869397,0.0037914126,0.0026561436,0.0006582763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015957348,0.000025886306,0.00037525475,0.00014375817,0.00002468228,0.0001958696,0.0005178591,0.024246022,0.0018476287,0.94166064,0.0025484734,0.02825432],"study_design_scores_gemma":[0.000045882804,0.00007553578,0.00019918726,0.000058100508,0.000026760345,0.00046959624,0.00023668603,0.064042985,0.0028166184,0.9003815,0.031601597,0.00004553065],"about_ca_topic_score_codex":0.0011807465,"about_ca_topic_score_gemma":0.0005199183,"teacher_disagreement_score":0.0047876546,"about_ca_system_score_codex":0.0026443377,"about_ca_system_score_gemma":0.0015494978,"threshold_uncertainty_score":0.01918614},"labels":[],"label_agreement":null},{"id":"W1982807028","doi":"10.1109/infcom.2013.6567091","title":"Connectivity in two-dimensional lattice networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Square lattice; Wireless ad hoc network; Lattice (music); Computer science; Percolation (cognitive psychology); Percolation threshold; Vertex (graph theory); Mobile ad hoc network; Percolation theory; Statistical physics; Mathematics; Wireless; Combinatorics; Theoretical computer science; Topology (electrical circuits); Physics; Ising model; Telecommunications; Quantum mechanics","score_opus":0.016714418329279522,"score_gpt":0.24601468167472162,"score_spread":0.2293002633454421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982807028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2645174,0.0068502706,0.69025373,0.0029887883,0.00023254017,0.00007541365,0.00066542765,0.0005693604,0.033847116],"genre_scores_gemma":[0.96237016,0.0026789412,0.03058388,0.00017479964,0.0001279225,0.000092455906,0.00030450118,0.00004856201,0.0036188615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951863,0.0001610335,0.000020646341,0.00007640884,0.0001481925,0.00007507496],"domain_scores_gemma":[0.99830025,0.0010869798,0.00024851112,0.00008293485,0.0001679688,0.000113448914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038693738,0.00026254804,0.00040450675,0.0014175923,0.0006832601,0.0017440636,0.00063929835,0.00083653023,0.0016372288],"category_scores_gemma":[0.0039828736,0.0003131074,0.0003386947,0.0014385846,0.0016925812,0.001964368,0.0008496795,0.00074831676,0.0002459663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005086485,0.00003371394,0.0015691102,0.00015130016,0.000023568447,0.00032455285,0.00025974293,0.28701285,0.0024256292,0.69246763,0.0021264283,0.013554581],"study_design_scores_gemma":[0.00002468638,0.000021179676,0.0005732937,0.000022778497,0.0000082845145,0.00019887084,0.000110254136,0.50334203,0.00041058776,0.4916202,0.0036439444,0.000023970599],"about_ca_topic_score_codex":0.0030501555,"about_ca_topic_score_gemma":0.002326941,"teacher_disagreement_score":0.0030501555,"about_ca_system_score_codex":0.0009543761,"about_ca_system_score_gemma":0.00040877255,"threshold_uncertainty_score":0.00692451},"labels":[],"label_agreement":null},{"id":"W1985164077","doi":"10.1109/mass.2012.6502554","title":"A novel distributed scheme for building spontaneous social communities over manets","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scheme (mathematics); Computer science; Distributed computing; Mobile ad hoc network; Stability (learning theory); Identification (biology); Wireless ad hoc network; Computer network; Community structure; Telecommunications; Wireless; Mathematics; Machine learning","score_opus":0.04882069105204994,"score_gpt":0.28150428488503487,"score_spread":0.23268359383298493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985164077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019595895,0.00010446241,0.9776309,0.000135188,0.00006158423,0.00024864072,0.00006425556,0.0006239583,0.0015350835],"genre_scores_gemma":[0.49840686,0.00015294111,0.49563703,0.00011879302,0.00011723114,0.0005774795,0.00026937164,0.000071748465,0.004648576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843305,0.00046917264,0.000106030944,0.00035107418,0.0005355928,0.000105089086],"domain_scores_gemma":[0.9974017,0.0007024814,0.00022454337,0.00094847474,0.00042439133,0.0002984534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001871841,0.00041369375,0.0007147418,0.00091234717,0.0017752742,0.0009654924,0.0025273967,0.00075289066,0.0011628595],"category_scores_gemma":[0.004424575,0.0002760934,0.00041228667,0.0009262176,0.00091801904,0.0026983735,0.003358163,0.00085229246,0.00049499917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008058742,0.0005139099,0.002845176,0.0003393048,0.00015873871,0.0006566147,0.0016405799,0.15348299,0.08577689,0.19508229,0.008157379,0.55054027],"study_design_scores_gemma":[0.00018716,0.00044663664,0.00059968926,0.000021493664,0.000050666167,0.0006363825,0.000226309,0.898151,0.0150380405,0.056458075,0.028108118,0.000076486336],"about_ca_topic_score_codex":0.0007372687,"about_ca_topic_score_gemma":0.0010448487,"teacher_disagreement_score":0.0025273967,"about_ca_system_score_codex":0.00065899035,"about_ca_system_score_gemma":0.0009047381,"threshold_uncertainty_score":0.009899378},"labels":[],"label_agreement":null},{"id":"W1991966706","doi":"10.1109/infcomw.2014.6849242","title":"Content Relevance Opportunistic Routing for Wireless Multimedia Sensor Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; British Columbia Institute of Technology","keywords":"Computer science; Routing protocol; Computer network; Network packet; Relevance (law); Wireless sensor network; Routing (electronic design automation); Bandwidth (computing); Dynamic Source Routing; Multimedia; Efficient energy use; Engineering","score_opus":0.05131735046577476,"score_gpt":0.2489430365352619,"score_spread":0.19762568606948713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991966706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07357899,0.0037097689,0.90978074,0.00076133746,0.00021603856,0.0004143767,0.00012650134,0.00093314116,0.010479133],"genre_scores_gemma":[0.84506696,0.0014594261,0.14870453,0.00022522717,0.00014682183,0.00021846825,0.00016894478,0.000088870715,0.0039207204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950457,0.0001871986,0.000028143908,0.000057344514,0.00017649663,0.000046262365],"domain_scores_gemma":[0.9987564,0.0007620364,0.000120583114,0.00016883813,0.00014746308,0.000044533583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007253527,0.0003559525,0.0003073572,0.0004921094,0.0005832001,0.00070391205,0.00084766187,0.0004307297,0.0005948568],"category_scores_gemma":[0.0024845067,0.00017073924,0.00016056097,0.00057507824,0.00055899867,0.0009158219,0.0006339995,0.00043881038,0.0001329022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059713295,0.00023918462,0.0020937684,0.00079489965,0.00011316958,0.0009863633,0.0007229511,0.3011233,0.16103195,0.12720631,0.009871146,0.39521986],"study_design_scores_gemma":[0.00003685946,0.00029485978,0.0009152734,0.00005277845,0.00006463974,0.00078234565,0.00019089121,0.88419664,0.027285546,0.057277262,0.028849544,0.00005331876],"about_ca_topic_score_codex":0.000780688,"about_ca_topic_score_gemma":0.0015266802,"teacher_disagreement_score":0.00084766187,"about_ca_system_score_codex":0.000678141,"about_ca_system_score_gemma":0.0005098726,"threshold_uncertainty_score":0.004920244},"labels":[],"label_agreement":null},{"id":"W1994798111","doi":"10.1109/lcnw.2014.6927728","title":"Optimal encounter-based routing via objects with periodic behaviours","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Routing (electronic design automation); Constraint (computer-aided design); Routing protocol; Context (archaeology); Set (abstract data type); Computer network; Distributed computing; Link-state routing protocol; Graph; Theoretical computer science; Domain (mathematical analysis); Time complexity; Algorithm; Mathematics","score_opus":0.010091434221240531,"score_gpt":0.21288610518236514,"score_spread":0.2027946709611246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994798111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11789838,0.00045569922,0.8772353,0.0002697674,0.00003903912,0.000080564896,0.00006335219,0.00038870185,0.003569207],"genre_scores_gemma":[0.7993692,0.00060846703,0.19534354,0.00009570416,0.000037593414,0.00014900437,0.00023316593,0.00010220341,0.004060927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948764,0.0001702931,0.000036643,0.0001070485,0.00012102544,0.0000772274],"domain_scores_gemma":[0.9989048,0.0005477901,0.00021559,0.00017793853,0.00006571256,0.00008813587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008409622,0.0005374205,0.0007915485,0.00095462025,0.00080374425,0.0011995267,0.0012650833,0.000960956,0.0009928094],"category_scores_gemma":[0.002686296,0.0005628338,0.0006400839,0.0010304846,0.0012186024,0.0021106056,0.0018702372,0.0005980489,0.00025048462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018615293,0.00007241047,0.0015043457,0.00013040038,0.00004992795,0.00027461394,0.00043013683,0.8134701,0.006010807,0.115095325,0.0015398005,0.061235987],"study_design_scores_gemma":[0.000020587537,0.000079670936,0.0003168017,0.00001179035,0.000016015281,0.00012751928,0.0000873445,0.90846974,0.0012204315,0.0869156,0.0027177806,0.0000168167],"about_ca_topic_score_codex":0.0012343681,"about_ca_topic_score_gemma":0.001133284,"teacher_disagreement_score":0.0012650833,"about_ca_system_score_codex":0.0008036811,"about_ca_system_score_gemma":0.00053627894,"threshold_uncertainty_score":0.0058311224},"labels":[],"label_agreement":null},{"id":"W1996996220","doi":"10.1145/2815347.2815360","title":"OnlineCruise","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Publication; Reliability (semiconductor); Multicast; Service (business); Computer network; World Wide Web","score_opus":0.08246465466621175,"score_gpt":0.2651848657549985,"score_spread":0.18272021108878675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996996220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032221697,0.0022916377,0.48638266,0.0022675414,0.0029342093,0.0013416082,0.008034486,0.14469351,0.31983262],"genre_scores_gemma":[0.32654086,0.0018136693,0.31372172,0.0021535535,0.00082448666,0.00079244864,0.027646253,0.01731077,0.3091963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869674,0.0002670014,0.00006345668,0.0002490854,0.00049968367,0.00022409466],"domain_scores_gemma":[0.9975357,0.00041929918,0.00011246718,0.0011189521,0.00047458455,0.00033900377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011229647,0.0008809684,0.0005747229,0.0010248681,0.00097403734,0.0020105622,0.0024915126,0.0015273097,0.062436756],"category_scores_gemma":[0.0037149186,0.0003514391,0.0006826056,0.0008256532,0.00047650863,0.003389732,0.0034334315,0.0011220702,0.030156132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001112508,0.0006154136,0.0021248194,0.00076227076,0.00010446232,0.0011603914,0.00058011134,0.0069835884,0.018563831,0.06540004,0.3869173,0.51567525],"study_design_scores_gemma":[0.00009172944,0.00019218195,0.00075671956,0.000053695465,0.00002342383,0.0009477316,0.0001482568,0.023215597,0.010554214,0.010179959,0.95377177,0.000064743894],"about_ca_topic_score_codex":0.0021800054,"about_ca_topic_score_gemma":0.00358658,"teacher_disagreement_score":0.062436756,"about_ca_system_score_codex":0.00048285455,"about_ca_system_score_gemma":0.0010583214,"threshold_uncertainty_score":0.20887178},"labels":[],"label_agreement":null},{"id":"W1997488760","doi":"10.5555/1400549.1400611","title":"RMobiGen: a trace generation, visualization, and performance analysis tool for random mobility models","year":2008,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Credibility; Mobility model; TRACE (psycholinguistics); Visualization; Generator (circuit theory); Simulation software; Component (thermodynamics); Discrete event simulation; Software; Distributed computing; Data visualization; Human–computer interaction; Simulation; Data mining","score_opus":0.07629309336313099,"score_gpt":0.29178316646589525,"score_spread":0.21549007310276425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997488760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006409459,0.000093633185,0.8888785,0.00016628239,0.000060931878,0.00018974477,0.0014418408,0.100618444,0.002141155],"genre_scores_gemma":[0.18850403,0.00056083314,0.7821255,0.00020971117,0.000052848565,0.0013189451,0.0054535163,0.018001368,0.0037733167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989951,0.00033917226,0.000096722906,0.00010258825,0.00039131372,0.00007511109],"domain_scores_gemma":[0.9962999,0.002453837,0.0002599436,0.0004923012,0.00037338174,0.00012052239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021732997,0.0014762073,0.00089779944,0.002250198,0.00040590682,0.0010556645,0.002585016,0.0009447806,0.009756496],"category_scores_gemma":[0.009727827,0.0007955935,0.00078058057,0.0011278061,0.00044055821,0.0016598492,0.0014160891,0.0016065226,0.0020980323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073275884,0.0005507237,0.006244238,0.001095388,0.00026385635,0.0010925183,0.0011647446,0.4950727,0.01616956,0.04005109,0.10118457,0.3363778],"study_design_scores_gemma":[0.00012197874,0.000076650394,0.00037908152,0.00006383849,0.000022052694,0.00019418489,0.00003690744,0.96339315,0.008274553,0.0064081475,0.0209806,0.00004895591],"about_ca_topic_score_codex":0.0027111445,"about_ca_topic_score_gemma":0.0024066875,"teacher_disagreement_score":0.009756496,"about_ca_system_score_codex":0.00056512916,"about_ca_system_score_gemma":0.0011323403,"threshold_uncertainty_score":0.03263879},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Bluetooth; Scheme (mathematics); Public transport; Wireless; Order (exchange); Work (physics); Multimedia; Computer network; Telecommunications; Transport engineering; Engineering","score_opus":0.02960022901638371,"score_gpt":0.21121110078787977,"score_spread":0.18161087177149607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000652320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415716,0.00021562034,0.055754926,0.00019434067,0.000025521234,0.00007322972,0.0005233889,0.0006138453,0.0010275632],"genre_scores_gemma":[0.9954839,0.00003533551,0.0039734733,0.0000071553186,0.000007915707,0.000008355671,0.00023748234,0.000007907642,0.00023857535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995548,0.000113549904,0.000028610257,0.00013030409,0.00009016395,0.00008249248],"domain_scores_gemma":[0.99725145,0.001197784,0.00057219143,0.00043652792,0.0003344576,0.000207675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960974,0.0005340055,0.0006332615,0.0014537805,0.0007003162,0.00079439086,0.0013896927,0.00051810936,0.0004617337],"category_scores_gemma":[0.0043286383,0.00036217135,0.00024820052,0.0016435629,0.00056716567,0.0013140673,0.00068889983,0.00040532736,0.000171142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002060087,0.0005001077,0.11387809,0.00019211031,0.00020982306,0.0010136096,0.0007235048,0.6909031,0.012839305,0.002877696,0.0031438633,0.17165866],"study_design_scores_gemma":[0.000015208096,0.000061072395,0.009042734,0.0000058058486,0.000020498854,0.00012462607,0.00016094884,0.98556614,0.0035444745,0.0010746304,0.00036742576,0.000016429656],"about_ca_topic_score_codex":0.012598644,"about_ca_topic_score_gemma":0.015392151,"teacher_disagreement_score":0.012598644,"about_ca_system_score_codex":0.0011394428,"about_ca_system_score_gemma":0.00059050525,"threshold_uncertainty_score":0.02505058},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Citation; Computer science; World Wide Web","score_opus":0.020588344086219932,"score_gpt":0.24447008329355546,"score_spread":0.22388173920733553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003222347","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019598419,0.0436732,0.006129952,0.39544237,0.009023137,0.000021992819,0.00032256782,0.0005022719,0.5252861],"genre_scores_gemma":[0.564317,0.05727647,0.0029902768,0.06037209,0.00928716,0.00008607095,0.00026100618,0.00078964577,0.3046203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858403,0.00047965793,0.00003881833,0.00017183306,0.00043139706,0.0002942467],"domain_scores_gemma":[0.99650687,0.001244398,0.00022525003,0.0004978297,0.00059486745,0.0009307417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021881475,0.0003976522,0.00039029584,0.0011181233,0.0068225716,0.011055032,0.0006838197,0.0029870053,0.038046975],"category_scores_gemma":[0.0071487366,0.00032925408,0.00026738056,0.0012400977,0.010945506,0.023354145,0.0067216647,0.00519737,0.006689254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054287466,0.000014238868,0.0005958966,0.000090510905,0.000007412348,0.00016858992,0.01646664,0.000105616535,0.00032456245,0.59466964,0.33872882,0.04877379],"study_design_scores_gemma":[0.0000030720996,0.000010005396,0.00032157186,0.00009873398,0.0000023644336,0.00012254046,0.004261029,0.00008867143,0.00011031855,0.09489402,0.9000797,0.000007950324],"about_ca_topic_score_codex":0.0038027526,"about_ca_topic_score_gemma":0.0061067934,"teacher_disagreement_score":0.038046975,"about_ca_system_score_codex":0.0032651145,"about_ca_system_score_gemma":0.0022051202,"threshold_uncertainty_score":0.12727982},"labels":[],"label_agreement":null},{"id":"W2003300496","doi":"10.5555/514151.514167","title":"Low power rendezvous in embedded wireless networks","year":2000,"lang":"en","type":"article","venue":"Mobile Ad Hoc Networking and Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rendezvous; Computer science; Computer network; Sleep mode; Node (physics); Wireless; Server; Power (physics); Real-time computing; Power consumption; Telecommunications","score_opus":0.006773329496542888,"score_gpt":0.21585698446966672,"score_spread":0.20908365497312384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003300496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057357647,0.036046468,0.84865093,0.00069431384,0.0004020671,0.000134323,0.000080442325,0.0013868385,0.05524699],"genre_scores_gemma":[0.7599056,0.015797077,0.1965364,0.00030650749,0.00047168485,0.00030390825,0.00015396533,0.00037220068,0.026152736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956506,0.00011147103,0.000013084432,0.00009087377,0.00018804826,0.00003146602],"domain_scores_gemma":[0.9996902,0.00015970979,0.00003352651,0.00006110457,0.000036319667,0.000019234523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029001426,0.00050655095,0.000377313,0.00029714257,0.00040575437,0.00080999586,0.0008260293,0.000558874,0.0016857625],"category_scores_gemma":[0.0009194937,0.00027760532,0.00019313728,0.00060991297,0.0008984422,0.0009487135,0.0006641982,0.00089081307,0.00061613333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001909701,0.00013565605,0.0013265165,0.00072069134,0.0000437479,0.0010120346,0.0004923782,0.28362557,0.07220825,0.33035663,0.010552004,0.29933554],"study_design_scores_gemma":[0.000044454395,0.00025067717,0.0013180042,0.00012862853,0.0000334843,0.0012995506,0.00017833267,0.71964616,0.02251074,0.17500442,0.0795172,0.00006834492],"about_ca_topic_score_codex":0.0009311426,"about_ca_topic_score_gemma":0.0010786277,"teacher_disagreement_score":0.0016857625,"about_ca_system_score_codex":0.00067716616,"about_ca_system_score_gemma":0.00026268626,"threshold_uncertainty_score":0.005639434},"labels":[],"label_agreement":null},{"id":"W2006061868","doi":"10.1145/1056808.1057059","title":"Effect of location-awareness on rendezvous behaviour","year":2005,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Mobile phone; Mobile device; Computer science; Mobile computing; Exploratory research; Location awareness; Mobile telephony; Human–computer interaction; Mobile radio; Computer network; Telecommunications; Engineering; World Wide Web","score_opus":0.012426191061881916,"score_gpt":0.2712797418931933,"score_spread":0.2588535508313114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006061868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9982162,0.00004087289,0.0005616569,0.000023614322,0.0000032300984,0.000014540718,0.00001647406,0.000018709723,0.00110473],"genre_scores_gemma":[0.9992932,0.000025666022,0.00041670518,0.000012117644,0.0000024953429,0.00000961661,0.000019679592,0.0000045325905,0.00021599494],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989792,0.0005020263,0.000060233247,0.00016028502,0.00017069707,0.00012765078],"domain_scores_gemma":[0.9774699,0.017856415,0.0021173635,0.0011569915,0.0007238308,0.0006754377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011964651,0.0003819586,0.00031398115,0.00033810173,0.00042647813,0.00059324317,0.00035318447,0.00042470725,0.0018684452],"category_scores_gemma":[0.013361546,0.0002733086,0.00022445466,0.00015778704,0.0005692434,0.00063941017,0.0006329103,0.0005249295,0.00011781333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013696658,0.0044473126,0.3740478,0.0014046704,0.0005504712,0.0013561617,0.02562179,0.009210874,0.4344863,0.0014073629,0.0005462793,0.1332242],"study_design_scores_gemma":[0.00027624663,0.0108109135,0.9020492,0.00009337449,0.00045305456,0.0008671724,0.013336609,0.0082679475,0.058800027,0.0011961113,0.0036815568,0.00016780582],"about_ca_topic_score_codex":0.0019651926,"about_ca_topic_score_gemma":0.002717113,"teacher_disagreement_score":0.0019651926,"about_ca_system_score_codex":0.00030443998,"about_ca_system_score_gemma":0.00032008276,"threshold_uncertainty_score":0.0063275695},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Hop (telecommunications); Latency (audio); Zone Routing Protocol; Distance-vector routing protocol; Distributed computing; Routing (electronic design automation); Wireless Routing Protocol; Telecommunications","score_opus":0.021805783350238046,"score_gpt":0.2538559763131712,"score_spread":0.23205019296293314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006741433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04836561,0.00043501658,0.93990356,0.0004478972,0.00020781436,0.00019793886,0.0002529758,0.0033287164,0.006860517],"genre_scores_gemma":[0.691829,0.0004328911,0.29712665,0.0003119922,0.000038948157,0.0002770381,0.00047547318,0.00021569127,0.009292315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997125,0.0000722494,0.000011692519,0.00004547448,0.00009949064,0.000058540318],"domain_scores_gemma":[0.9995679,0.00017611621,0.0000621801,0.00007283302,0.00009100031,0.000029842246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057733845,0.00052385207,0.00055137445,0.0006556476,0.00064130453,0.00069711235,0.0013414455,0.000840269,0.0014587903],"category_scores_gemma":[0.0014169134,0.0001832217,0.00036049777,0.0007720598,0.00047745544,0.00068910565,0.0008845545,0.0008316142,0.00030116714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024601142,0.00015032153,0.00094237406,0.000110504516,0.00010509318,0.0002963525,0.00016189249,0.77989525,0.01537319,0.03803626,0.008299285,0.15638348],"study_design_scores_gemma":[0.000040095434,0.00008335974,0.000235298,0.00000943309,0.000023905915,0.000117097996,0.000031414085,0.98164773,0.0038224612,0.009534546,0.004435276,0.000019403627],"about_ca_topic_score_codex":0.0039659943,"about_ca_topic_score_gemma":0.006775781,"teacher_disagreement_score":0.0039659943,"about_ca_system_score_codex":0.0006625534,"about_ca_system_score_gemma":0.0013060078,"threshold_uncertainty_score":0.007885814},"labels":[],"label_agreement":null},{"id":"W2007110310","doi":"10.1109/iscc.2013.6754974","title":"A DNS protocol - based Service Discovery architecture for disaster response systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Service discovery; Computer science; Computer network; Service (business); Situation awareness; Architecture; Protocol (science); Computer security; Distributed computing; World Wide Web; Web service; Engineering","score_opus":0.021086248211708684,"score_gpt":0.2560536015294551,"score_spread":0.23496735331774643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007110310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020578807,0.0012292279,0.9539758,0.0014482448,0.00040310074,0.0004744391,0.00017967739,0.007098932,0.014611782],"genre_scores_gemma":[0.45539853,0.0021738631,0.51829344,0.0009116445,0.0002496833,0.00046548416,0.001232707,0.0003022325,0.020972447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989214,0.00023489486,0.00018174203,0.0001285719,0.00042731356,0.000106164574],"domain_scores_gemma":[0.99898297,0.0001334998,0.000061685925,0.00021802109,0.0004706739,0.00013315027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022282943,0.00037905393,0.00058184844,0.0010337465,0.0017688569,0.0030246323,0.0018953274,0.0012600896,0.0016205737],"category_scores_gemma":[0.0016788082,0.0004704166,0.00042802622,0.0011004448,0.0009682724,0.003346733,0.0017436576,0.0013543655,0.0010364238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007955766,0.0005049547,0.003784153,0.00061559124,0.0001525888,0.0008073618,0.0012430606,0.09274607,0.07505197,0.511365,0.03340017,0.27953368],"study_design_scores_gemma":[0.00009388366,0.0002600245,0.00095914054,0.00011322845,0.00013629047,0.00060306647,0.0003121068,0.71564615,0.03898596,0.04834853,0.1943965,0.0001450626],"about_ca_topic_score_codex":0.008770407,"about_ca_topic_score_gemma":0.008654616,"teacher_disagreement_score":0.008770407,"about_ca_system_score_codex":0.002287465,"about_ca_system_score_gemma":0.0028921969,"threshold_uncertainty_score":0.01743871},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; 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","score_opus":0.04403697820227219,"score_gpt":0.29815294663029746,"score_spread":0.25411596842802525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007719809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24317536,0.06079837,0.47853583,0.051980965,0.0032150603,0.00008969602,0.0003703405,0.00009642122,0.16173796],"genre_scores_gemma":[0.9642056,0.020664047,0.008298759,0.00041963256,0.0018771059,0.00003294907,0.000027490756,0.000027449521,0.0044468334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994692,0.0002773889,0.000013699746,0.000046730656,0.00013612845,0.000056736288],"domain_scores_gemma":[0.9972887,0.0018481397,0.00026924838,0.00014657094,0.00026042995,0.0001868406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092970236,0.000489518,0.00042249818,0.0007865765,0.0008979103,0.0027995089,0.0007385264,0.0013322459,0.0018919071],"category_scores_gemma":[0.005290937,0.0003198244,0.00031559542,0.0010640012,0.0021318244,0.005671357,0.0011658147,0.0012987357,0.000230889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004125276,0.000029354223,0.0011651311,0.00013045532,0.000035083223,0.00036975084,0.00042867474,0.10926511,0.0009082282,0.8696592,0.002070402,0.015897375],"study_design_scores_gemma":[0.000020548492,0.000085962194,0.0015679764,0.000100438185,0.000047113546,0.0002897718,0.000615522,0.327007,0.00024943906,0.6469761,0.023003682,0.00003645444],"about_ca_topic_score_codex":0.0024560296,"about_ca_topic_score_gemma":0.001797949,"teacher_disagreement_score":0.0027995089,"about_ca_system_score_codex":0.0011394504,"about_ca_system_score_gemma":0.00047441857,"threshold_uncertainty_score":0.008267283},"labels":[],"label_agreement":null},{"id":"W2009802555","doi":"10.1007/s11276-013-0588-7","title":"Contention aware mobility prediction routing for intermittently connected mobile networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Node (physics); Routing (electronic design automation); Protocol (science); Distributed computing; Mobility model; Delay-tolerant networking; Link-state routing protocol; Wireless Routing Protocol","score_opus":0.01445690682555665,"score_gpt":0.22618303775367848,"score_spread":0.21172613092812184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009802555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20134568,0.0026638652,0.7905527,0.0011937824,0.00031472783,0.00007495358,0.00016331323,0.0006688234,0.003022249],"genre_scores_gemma":[0.9768549,0.0003181566,0.021833396,0.000034872173,0.000070819995,0.000023222103,0.00006171225,0.000018384795,0.00078457943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.000084725514,0.000024925152,0.00007518559,0.00013376004,0.000084470084],"domain_scores_gemma":[0.9976071,0.0014780615,0.00030649843,0.00023805967,0.00027376783,0.00009657084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124631,0.00042168083,0.00064605277,0.0008625305,0.0010202398,0.00088634394,0.001434907,0.00050459726,0.00068027456],"category_scores_gemma":[0.0046919077,0.0004020839,0.0002029461,0.00090960914,0.00056860654,0.0014588062,0.00090283493,0.0007742926,0.00008356287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029859898,0.0001458266,0.005423246,0.000089056186,0.0000733588,0.00024402524,0.00030615882,0.85275966,0.0062909224,0.017577112,0.003895979,0.11289611],"study_design_scores_gemma":[0.000004381196,0.000015567242,0.00024112039,0.0000035215248,0.000010289828,0.00002342612,0.000019925243,0.99590707,0.000414588,0.0031144328,0.00024166508,0.0000039430297],"about_ca_topic_score_codex":0.0062612244,"about_ca_topic_score_gemma":0.012987302,"teacher_disagreement_score":0.0062612244,"about_ca_system_score_codex":0.0009195011,"about_ca_system_score_gemma":0.0009018346,"threshold_uncertainty_score":0.012449563},"labels":[],"label_agreement":null},{"id":"W2010675581","doi":"10.1109/infcom.2012.6195571","title":"Socialize spontaneously with mobile applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Cloud computing; Human–computer interaction; Bluetooth; Interface (matter); Competitor analysis; Mobile device; Mobile computing; Multimedia; World Wide Web; Computer network; Telecommunications; Operating system; Wireless","score_opus":0.009746802875984931,"score_gpt":0.22761780687685457,"score_spread":0.21787100400086964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010675581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38040218,0.00043908018,0.5357378,0.0015946251,0.00022812332,0.0013828985,0.0002143701,0.0072313524,0.07276948],"genre_scores_gemma":[0.90598595,0.00029164003,0.07323276,0.0005808396,0.00017055638,0.0006204103,0.0003139155,0.0006871699,0.018116875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773264,0.0008709102,0.00013102505,0.00035897052,0.0006461827,0.00026023397],"domain_scores_gemma":[0.9963159,0.0013617593,0.0003071638,0.0012628667,0.0004053546,0.0003470056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018174188,0.0008531172,0.00044627284,0.000647713,0.0013768991,0.003182931,0.0012125855,0.0011101136,0.0036159689],"category_scores_gemma":[0.007637803,0.00053121767,0.00064907223,0.00043008843,0.0011136412,0.0041308617,0.005509575,0.0015956454,0.001737509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007787496,0.0015290336,0.040614124,0.0009128152,0.0005078228,0.0036351155,0.03515679,0.030121023,0.25934988,0.16308108,0.018819066,0.4454946],"study_design_scores_gemma":[0.00024442363,0.0013449815,0.02281773,0.0002498163,0.00036263507,0.0027890385,0.010653928,0.25783297,0.08382293,0.15194805,0.4675918,0.0003417102],"about_ca_topic_score_codex":0.0007714384,"about_ca_topic_score_gemma":0.000919587,"teacher_disagreement_score":0.0036159689,"about_ca_system_score_codex":0.00041353266,"about_ca_system_score_gemma":0.00063424633,"threshold_uncertainty_score":0.012096643},"labels":[],"label_agreement":null},{"id":"W2012403106","doi":"10.1007/s11235-008-9134-9","title":"A localized algorithm for bi-connectivity of connected mobile robots","year":2008,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Robot; Network partition; Wireless ad hoc network; Mobile robot; Partition (number theory); Algorithm; Computer network; Fault tolerance; Topology (electrical circuits); Distributed computing; Wireless; Artificial intelligence; Network packet; Telecommunications; Mathematics","score_opus":0.04359173874023514,"score_gpt":0.27444694863381325,"score_spread":0.2308552098935781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012403106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010491766,0.000073000636,0.9877609,0.0000753918,0.00002161697,0.000054383006,0.00003155977,0.00049358536,0.0009977617],"genre_scores_gemma":[0.3144334,0.00014077564,0.68058825,0.00010005266,0.00003249136,0.00052344735,0.00027584253,0.00013918226,0.0037664892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952257,0.00012019517,0.000032010084,0.00012091361,0.00012698834,0.00007727379],"domain_scores_gemma":[0.99858886,0.0007085995,0.0001204992,0.00022035226,0.00024911907,0.00011256263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085125124,0.00082801096,0.0010939274,0.0010849362,0.0011254675,0.0010904653,0.0022910207,0.0013422973,0.0036219193],"category_scores_gemma":[0.0039498014,0.00056246266,0.0004991433,0.0012586261,0.00083759543,0.0019249328,0.003126294,0.0011035564,0.0008482869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045083713,0.00015527951,0.00087629614,0.00019858545,0.00006519615,0.00015565076,0.00034147152,0.6723403,0.0076390672,0.038099155,0.0041904505,0.27548778],"study_design_scores_gemma":[0.00004419119,0.0000618192,0.000075924574,0.0000070595665,0.000009465168,0.000032329855,0.00002509648,0.98956454,0.00083025947,0.0086967135,0.0006434135,0.00000911448],"about_ca_topic_score_codex":0.0031257544,"about_ca_topic_score_gemma":0.003856838,"teacher_disagreement_score":0.0036219193,"about_ca_system_score_codex":0.0008615859,"about_ca_system_score_gemma":0.001340685,"threshold_uncertainty_score":0.012116492},"labels":[],"label_agreement":null},{"id":"W2012928197","doi":"10.1007/s11227-013-0927-6","title":"Advances in communication networks for pervasive and ubiquitous applications","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Ubiquitous computing; Cyberspace; Data science; Computer security; Human–computer interaction; World Wide Web; The Internet","score_opus":0.011104250280494948,"score_gpt":0.24154065995190527,"score_spread":0.23043640967141032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012928197","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03068529,0.3407411,0.3979747,0.03937588,0.016671216,0.00011500543,0.00047092928,0.00083931495,0.1731266],"genre_scores_gemma":[0.45231622,0.34658375,0.11854366,0.0042015547,0.011268788,0.0001471626,0.0005224684,0.0002499459,0.06616636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945813,0.0001119691,0.000030937088,0.00008939641,0.00024992038,0.000059569247],"domain_scores_gemma":[0.9982948,0.0009955826,0.00009394804,0.00020058788,0.00030815514,0.00010709627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008394651,0.0005876575,0.00052055076,0.00073882454,0.0005204277,0.0020765846,0.0010120634,0.0012617601,0.007994621],"category_scores_gemma":[0.0025066219,0.00027035412,0.00022374254,0.0020359852,0.0011095019,0.0042438093,0.0012767737,0.0020464328,0.001479108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007480444,0.000070504255,0.0007873765,0.0008704433,0.000026507792,0.00014167823,0.00013990163,0.019014295,0.0037392143,0.5727476,0.040939536,0.36144814],"study_design_scores_gemma":[0.000016832186,0.00007918043,0.0007775857,0.00030391727,0.00003790718,0.0005625498,0.00024257517,0.064573966,0.0020780656,0.2596878,0.67160803,0.000031611922],"about_ca_topic_score_codex":0.0008577675,"about_ca_topic_score_gemma":0.0015069089,"teacher_disagreement_score":0.007994621,"about_ca_system_score_codex":0.0009936832,"about_ca_system_score_gemma":0.0009036659,"threshold_uncertainty_score":0.026744664},"labels":[],"label_agreement":null},{"id":"W2013089234","doi":"10.1109/icc.2012.6364126","title":"Opportunistic routing in tactical networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer network; Computer science; Network packet; Overhead (engineering); Distributed computing","score_opus":0.03191751054616181,"score_gpt":0.25873770020055425,"score_spread":0.22682018965439243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013089234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07337856,0.018039174,0.85212946,0.0016960106,0.000602554,0.0003212944,0.00020968665,0.00096292724,0.052660357],"genre_scores_gemma":[0.8569374,0.009932956,0.124613784,0.00036002585,0.00020885895,0.00026608686,0.00019259403,0.00007359162,0.00741459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992787,0.0003280244,0.000025892763,0.0000604305,0.00022670462,0.00008033189],"domain_scores_gemma":[0.9989422,0.0006583285,0.000109507644,0.00013377714,0.00011258989,0.000043624565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011690063,0.0002952044,0.00036319412,0.000539338,0.000563228,0.0013070711,0.00066981855,0.0006275241,0.0009669076],"category_scores_gemma":[0.0022759582,0.00027043457,0.00020067499,0.00085403916,0.00075390725,0.0012178766,0.0007805914,0.00057897787,0.00017395035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013140138,0.00009010851,0.002247224,0.00043628787,0.00009124088,0.00080571225,0.00038799306,0.48987466,0.008264955,0.27112567,0.008106305,0.21843836],"study_design_scores_gemma":[0.000038832004,0.00013223414,0.0010883007,0.00011382394,0.000045600467,0.000856988,0.00024072248,0.7699401,0.0032113984,0.15833308,0.06594508,0.000053832755],"about_ca_topic_score_codex":0.0024863866,"about_ca_topic_score_gemma":0.0027719606,"teacher_disagreement_score":0.0024863866,"about_ca_system_score_codex":0.0007212256,"about_ca_system_score_gemma":0.0007584188,"threshold_uncertainty_score":0.0061823726},"labels":[],"label_agreement":null},{"id":"W2013376029","doi":"10.1002/nem.793","title":"A random obstacle‐based mobility model for delay‐tolerant networking","year":2011,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Key Laboratory of Computer Network and Information Integration","keywords":"Obstacle; Computer science; Node (physics); Mobility model; Path (computing); Computer network; Delay-tolerant networking; Signal strength; Distributed computing; Real-time computing; Routing (electronic design automation); Routing protocol; Wireless sensor network; Optimized Link State Routing Protocol","score_opus":0.06295481932385799,"score_gpt":0.2715307868331963,"score_spread":0.20857596750933832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013376029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06484942,0.000560938,0.9231259,0.000470903,0.00022091817,0.00010047094,0.00019599797,0.00028305085,0.010192329],"genre_scores_gemma":[0.93221235,0.0008750248,0.057952095,0.00014307536,0.00007970113,0.00022905237,0.00023778778,0.000081710714,0.008189147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.00011003335,0.000020216363,0.000053923304,0.00012175596,0.000056360117],"domain_scores_gemma":[0.99952626,0.00017679714,0.000106200394,0.000044748827,0.00010261706,0.000043496817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322063,0.00057328976,0.0005145258,0.00066403963,0.00046267084,0.0007080444,0.0012377164,0.0006759479,0.0010490348],"category_scores_gemma":[0.001320345,0.00025993376,0.00055740756,0.00046824192,0.00052540476,0.0009929792,0.0007834514,0.0005366862,0.00019564315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018263429,0.000015336143,0.00031020644,0.000019402958,0.000010710254,0.00009793556,0.000030014256,0.97250384,0.0010585426,0.022812705,0.00040562704,0.002717366],"study_design_scores_gemma":[0.000003837139,0.0000129795,0.000049414,0.0000031650075,0.0000045383663,0.000024576655,0.0000062411405,0.99633586,0.00014523264,0.002670031,0.0007384982,0.000005675323],"about_ca_topic_score_codex":0.0051506483,"about_ca_topic_score_gemma":0.0029560078,"teacher_disagreement_score":0.0051506483,"about_ca_system_score_codex":0.0008429254,"about_ca_system_score_gemma":0.0006499119,"threshold_uncertainty_score":0.01024133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computability; Computer science; Exploit; Class (philosophy); Node (physics); Focus (optics); Upper and lower bounds; Theoretical computer science; Mathematics; Computer security; Artificial intelligence","score_opus":0.0262796194452426,"score_gpt":0.24617817947768544,"score_spread":0.21989856003244285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014679376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1366866,0.008602601,0.81002355,0.005978842,0.00031185956,0.0000880357,0.0003453136,0.00018889927,0.037774347],"genre_scores_gemma":[0.9082024,0.008438459,0.06705366,0.0005241972,0.00048520416,0.00018548664,0.00027399007,0.00013096984,0.014705631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914145,0.00051763136,0.000025880272,0.0000919067,0.00012622129,0.0000968618],"domain_scores_gemma":[0.98690015,0.011599006,0.00048199692,0.0002916048,0.00029376245,0.00043349824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018447565,0.00085222995,0.001351617,0.0013242238,0.000885561,0.0020568292,0.0015513942,0.001599497,0.0047129937],"category_scores_gemma":[0.018206842,0.00059185724,0.00074716983,0.0020967387,0.0025195624,0.0043416275,0.0029367763,0.001599261,0.00023258991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014911083,0.00004032338,0.0008531145,0.00015952268,0.000055693148,0.0001099857,0.00027562786,0.433564,0.0003528543,0.5459429,0.0025463453,0.015950436],"study_design_scores_gemma":[0.00002041703,0.00002010659,0.000112169946,0.000027494852,0.000010137958,0.000032393178,0.00005834448,0.6199023,0.00005819184,0.3778011,0.0019487552,0.000008616356],"about_ca_topic_score_codex":0.0031291666,"about_ca_topic_score_gemma":0.0021471044,"teacher_disagreement_score":0.0047129937,"about_ca_system_score_codex":0.0011572388,"about_ca_system_score_gemma":0.0009103618,"threshold_uncertainty_score":0.015766561},"labels":[],"label_agreement":null},{"id":"W2014693842","doi":"10.1109/vtcfall.2014.6966080","title":"On Network Coding in Intermittently Connected Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear network coding; Computer network; Computer science; Routing protocol; Coding (social sciences); Routing (electronic design automation); Distributed computing; Delay-tolerant networking; Geographic routing; Static routing; Wireless Routing Protocol","score_opus":0.0109370478032996,"score_gpt":0.2146200732097885,"score_spread":0.2036830254064889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014693842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022953657,0.0066899215,0.9416721,0.0015956059,0.00032264125,0.000067455614,0.00010236189,0.000122972,0.02647328],"genre_scores_gemma":[0.84176373,0.018675292,0.12780613,0.00065137574,0.0009778402,0.00043372138,0.00017951852,0.000118729426,0.009393637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849534,0.0006820685,0.00005382513,0.00011924648,0.00048674972,0.00016279983],"domain_scores_gemma":[0.9898351,0.008436355,0.00041861853,0.00046709715,0.00070596323,0.0001367625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017915785,0.0007325365,0.00074458827,0.0014804079,0.00079105573,0.0013562527,0.0010896334,0.0012782376,0.0018218975],"category_scores_gemma":[0.011418608,0.00039785905,0.00041689293,0.002061521,0.0032210709,0.0025354587,0.0019621628,0.0020966001,0.0003380342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039139748,0.000016796208,0.00032750156,0.00011102849,0.000015690255,0.00013588779,0.00017976627,0.24144414,0.0013170941,0.73477244,0.0021561505,0.019484397],"study_design_scores_gemma":[0.000019052783,0.00004215768,0.00016628476,0.00008833322,0.000011981355,0.00014065835,0.000048080932,0.5511382,0.0005974326,0.4427766,0.0049423734,0.000028840732],"about_ca_topic_score_codex":0.004466904,"about_ca_topic_score_gemma":0.002335668,"teacher_disagreement_score":0.004466904,"about_ca_system_score_codex":0.002067731,"about_ca_system_score_gemma":0.0011930373,"threshold_uncertainty_score":0.015002489},"labels":[],"label_agreement":null},{"id":"W2015036286","doi":"10.1007/s13278-013-0115-y","title":"A novel approach for modeling and managing spontaneous social communities over MANETs","year":2013,"lang":"en","type":"article","venue":"Social Network Analysis and Mining","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"NetLogo; Computer science; Middleware (distributed applications); Identification (biology); Focus (optics); Mobile ad hoc network; Distributed computing; Order (exchange); Social network (sociolinguistics); Data science; World Wide Web; Computer network; Social media","score_opus":0.03137474340898955,"score_gpt":0.24345391657182108,"score_spread":0.21207917316283154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015036286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019162333,0.00018386738,0.9786531,0.00028217005,0.000036401176,0.0001671241,0.00035229587,0.0002763727,0.0008863258],"genre_scores_gemma":[0.4674512,0.00055758527,0.52684623,0.00015539724,0.00017442579,0.0005195304,0.0009421275,0.000093475035,0.0032600132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852496,0.00039888005,0.00011198721,0.0004362051,0.00040660801,0.000121383135],"domain_scores_gemma":[0.99597025,0.0024564075,0.0005494248,0.00044260797,0.00039002582,0.00019127649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021709434,0.0010252085,0.0012243977,0.0024688176,0.0014653933,0.0021786338,0.0032585706,0.0017972959,0.0008967312],"category_scores_gemma":[0.007772493,0.0008146833,0.0016592827,0.0027950052,0.0013365237,0.004469736,0.0024417776,0.0014854973,0.00024564547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007348007,0.00018552177,0.0050155413,0.00014925514,0.00016612279,0.00027047916,0.00055981654,0.88369393,0.0017331865,0.063724115,0.0015017373,0.042926777],"study_design_scores_gemma":[0.0000034407658,0.000008906846,0.00011301581,0.000003684088,0.000010917413,0.000027433083,0.000039788905,0.9851393,0.00014196032,0.013996965,0.00051031733,0.0000042212587],"about_ca_topic_score_codex":0.012262632,"about_ca_topic_score_gemma":0.01656526,"teacher_disagreement_score":0.012262632,"about_ca_system_score_codex":0.0014906746,"about_ca_system_score_gemma":0.001715703,"threshold_uncertainty_score":0.024382532},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Gossip; Combinatorics; Graph; Mathematics; Discrete mathematics; Computer science; Node (physics)","score_opus":0.0185127435136274,"score_gpt":0.23728207396649753,"score_spread":0.21876933045287014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016722709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6578131,0.00034892577,0.31736568,0.0007544945,0.000022978073,0.00012922635,0.0008301831,0.0006742647,0.022061273],"genre_scores_gemma":[0.9607081,0.000108414475,0.035713222,0.0001109737,0.000016250071,0.000097911994,0.000595851,0.000053148004,0.0025960696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959403,0.00011488314,0.000025935935,0.00007694559,0.00008811639,0.000100061436],"domain_scores_gemma":[0.9965502,0.0017555881,0.00062246964,0.00026464195,0.00049188134,0.00031520598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034614236,0.00028186847,0.00027441804,0.0006137722,0.000761085,0.00079525163,0.0007336938,0.0004073688,0.0027905963],"category_scores_gemma":[0.0025706554,0.0002758971,0.00040732062,0.0005072013,0.00084064173,0.0011919689,0.00065084785,0.00064950844,0.00027114557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088843796,0.00020844671,0.006680901,0.00070527004,0.00009979469,0.0007941177,0.0014750845,0.18517996,0.050284766,0.6739157,0.010802031,0.06896548],"study_design_scores_gemma":[0.00012906808,0.00028709066,0.00396426,0.000084868,0.000073031275,0.00092648854,0.0008055577,0.45754206,0.026111657,0.49739787,0.012608217,0.00006976492],"about_ca_topic_score_codex":0.0015824784,"about_ca_topic_score_gemma":0.001338388,"teacher_disagreement_score":0.0027905963,"about_ca_system_score_codex":0.0010035535,"about_ca_system_score_gemma":0.00044765175,"threshold_uncertainty_score":0.009335458},"labels":[],"label_agreement":null},{"id":"W2017104388","doi":"10.1109/chinacom.2009.5339913","title":"DFMAC: DTN-friendly medium access control for wireless local area networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Roaming; Computer network; Computer science; Wireless network; Wireless; Wi-Fi; Radio resource management; Telecommunications","score_opus":0.020622444697687602,"score_gpt":0.2645786500280846,"score_spread":0.24395620533039702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017104388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010751137,0.0022681307,0.9794775,0.0003745081,0.00032825707,0.00016387037,0.0000738007,0.00057415204,0.00598865],"genre_scores_gemma":[0.7662077,0.0018441308,0.22493912,0.0006570207,0.00037617362,0.00044815394,0.00019179692,0.000049862545,0.005286099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927765,0.0001862541,0.000039172217,0.00010007194,0.00030154045,0.00009534117],"domain_scores_gemma":[0.99925846,0.0002343028,0.000118865675,0.00011232691,0.0002239493,0.0000521245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254224,0.000643451,0.00048763884,0.00069787446,0.0007994335,0.0011225278,0.001384856,0.0007420509,0.0011822674],"category_scores_gemma":[0.0024762517,0.00014999378,0.00028573498,0.00063738774,0.0005758601,0.0009525802,0.0009866862,0.0007638675,0.00029064206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035691637,0.0002354834,0.0025694952,0.0007759774,0.00012155889,0.0011017267,0.0004243579,0.23719157,0.04391432,0.20643543,0.016777927,0.4900953],"study_design_scores_gemma":[0.000035893267,0.00020412113,0.00041242648,0.000042066495,0.000035327626,0.0005177498,0.00004124833,0.9456356,0.0046265777,0.01668647,0.031732004,0.000030531875],"about_ca_topic_score_codex":0.0025854302,"about_ca_topic_score_gemma":0.0032742743,"teacher_disagreement_score":0.0025854302,"about_ca_system_score_codex":0.00080794387,"about_ca_system_score_gemma":0.0009440495,"threshold_uncertainty_score":0.005862057},"labels":[],"label_agreement":null},{"id":"W2021897427","doi":"10.1109/lisat.2014.6845196","title":"Use of Bloom Filters to convey identity of surveillance targets","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"InterDigital (Canada)","funders":"","keywords":"Bloom filter; Computer science; Computer security; Node (physics); Filter (signal processing); Identity (music); Computer network; False positive paradox; Interception; Artificial intelligence; Engineering","score_opus":0.03332638688587123,"score_gpt":0.2456832221976277,"score_spread":0.21235683531175648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021897427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04454774,0.00024237936,0.94586146,0.00072700635,0.00010164289,0.0003011344,0.00021290974,0.001767608,0.006238144],"genre_scores_gemma":[0.5226662,0.0004290317,0.46609548,0.00046850616,0.00006781499,0.00027572017,0.00037406824,0.000091535185,0.009531656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755234,0.00065776065,0.00025721404,0.00033626216,0.0009153656,0.00028107333],"domain_scores_gemma":[0.99027467,0.0033361628,0.0012385983,0.002811641,0.002100641,0.00023817424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028513342,0.0007349668,0.0006303486,0.0019501138,0.0017972087,0.0023077202,0.0015490899,0.0014096188,0.0015112077],"category_scores_gemma":[0.008362127,0.00049396197,0.00052953145,0.0014239873,0.0011472557,0.004473387,0.0018385348,0.0012060531,0.00068606355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016942691,0.00042533578,0.013642308,0.00026636742,0.0002303697,0.0010909577,0.0032276956,0.052141286,0.19249047,0.17332108,0.009351678,0.5521181],"study_design_scores_gemma":[0.00013232374,0.0006270331,0.0031696216,0.00017892118,0.0001799304,0.0014985866,0.0011889834,0.51224256,0.32713866,0.066346906,0.087048255,0.0002482265],"about_ca_topic_score_codex":0.006216748,"about_ca_topic_score_gemma":0.007996754,"teacher_disagreement_score":0.006216748,"about_ca_system_score_codex":0.0027137024,"about_ca_system_score_gemma":0.0021944374,"threshold_uncertainty_score":0.019689322},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.029910733181410586,"score_gpt":0.29083682006378764,"score_spread":0.26092608688237706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026139231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3299303,0.0013804125,0.64879835,0.0016679465,0.00014783621,0.0001925959,0.00023821165,0.00041518488,0.017229235],"genre_scores_gemma":[0.98518986,0.0005479039,0.0104313865,0.00010819314,0.000037512524,0.00009532299,0.00005104618,0.000014444777,0.0035244024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.0003018056,0.000035316276,0.00009830596,0.00020046555,0.00010885069],"domain_scores_gemma":[0.99822134,0.0011320193,0.00029258823,0.00008203785,0.00020725482,0.000064726446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087366154,0.00042806787,0.0005473342,0.0011646908,0.00076395884,0.00094138185,0.0007791756,0.001241714,0.0007423763],"category_scores_gemma":[0.0044562235,0.0003251747,0.00068319985,0.000723926,0.0008753613,0.0016019188,0.00095495954,0.0005821502,0.00012213615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006795765,0.00006522354,0.0035933226,0.00012582866,0.000072506096,0.00084984826,0.000581757,0.81016266,0.00466776,0.16391897,0.0014363637,0.014457764],"study_design_scores_gemma":[0.00001526633,0.000020815241,0.00030124068,0.000007936074,0.000015234739,0.00008054222,0.000050389197,0.9823527,0.00024028569,0.015916806,0.0009852858,0.0000135300825],"about_ca_topic_score_codex":0.0071477215,"about_ca_topic_score_gemma":0.003414638,"teacher_disagreement_score":0.0071477215,"about_ca_system_score_codex":0.0011418463,"about_ca_system_score_gemma":0.00077199837,"threshold_uncertainty_score":0.014212251},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bundle; Queueing theory; Computer network; Computer science; Context (archaeology); Network packet; The Internet; Distributed computing","score_opus":0.015238920735429644,"score_gpt":0.23832452046031544,"score_spread":0.22308559972488579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030064374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24144101,0.00096226804,0.7473679,0.0006414679,0.00006256091,0.000076614175,0.00033580593,0.000290445,0.008821872],"genre_scores_gemma":[0.98862004,0.00046991158,0.008101473,0.000030072975,0.000026543914,0.000045801527,0.00009861395,0.000027258102,0.0025803468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997367,0.00006626028,0.000011783746,0.000062804975,0.00006962706,0.00005278994],"domain_scores_gemma":[0.9992549,0.0003742013,0.00017508255,0.000031888154,0.00012708758,0.00003678879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004705435,0.0006452663,0.00048439013,0.00065801,0.00041962872,0.0008141296,0.0010139018,0.0007849565,0.0010343214],"category_scores_gemma":[0.0020947154,0.00033857572,0.0003899115,0.0005961674,0.00065855373,0.0009262471,0.0005406417,0.00053296995,0.00018661842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011176308,0.0000051990974,0.000478065,0.000009479449,0.000005290453,0.00004338417,0.00002912292,0.9905691,0.000504749,0.0071337055,0.00013762461,0.0010730949],"study_design_scores_gemma":[6.6668593e-7,0.0000029418031,0.00005508456,8.56646e-7,0.0000012188873,0.0000051960815,0.0000049083687,0.99870825,0.000048291557,0.0010744027,0.0000967753,0.0000013583672],"about_ca_topic_score_codex":0.012724726,"about_ca_topic_score_gemma":0.0056088953,"teacher_disagreement_score":0.012724726,"about_ca_system_score_codex":0.0017757897,"about_ca_system_score_gemma":0.0007164061,"threshold_uncertainty_score":0.025301337},"labels":[],"label_agreement":null},{"id":"W2031277951","doi":"10.1145/2512921.2512923","title":"Data dissemination for delay tolerant vehicular networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dissemination; Relay; Computer network; Network packet; Vehicular ad hoc network; Dijkstra's algorithm; Reliability (semiconductor); Path (computing); Information Dissemination; Shortest path problem; Real-time computing; Distributed computing; Wireless ad hoc network; Wireless; Telecommunications; Graph; Theoretical computer science","score_opus":0.0322239469368062,"score_gpt":0.27562595397712897,"score_spread":0.24340200704032278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031277951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024066,0.00077096943,0.9729119,0.00020660536,0.0000870458,0.000064622574,0.000048513153,0.00036852752,0.0014757938],"genre_scores_gemma":[0.74419874,0.0011957668,0.24869642,0.00011345617,0.00009962011,0.00017908053,0.00021943873,0.000047350444,0.005250199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997235,0.00006681591,0.000022976383,0.00004437193,0.00011649368,0.000025832796],"domain_scores_gemma":[0.99947673,0.00023607136,0.00007170832,0.0000542266,0.0001374916,0.00002378166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004064725,0.00032401455,0.00046629526,0.00063499936,0.0004639215,0.00060519023,0.0008155855,0.00040124496,0.00064981123],"category_scores_gemma":[0.0016693837,0.00015093395,0.00022924645,0.0006906376,0.0002367937,0.0008021615,0.00043325548,0.0003225189,0.0001711025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002623693,0.00009206306,0.001694151,0.00039009194,0.000077044904,0.00034608552,0.0005091374,0.44557115,0.036795244,0.049425665,0.0047859675,0.46005097],"study_design_scores_gemma":[0.00004036086,0.00014400177,0.0002682547,0.000015216196,0.000028370694,0.00018659842,0.0000689745,0.96541226,0.00884554,0.010474564,0.014500184,0.000015598118],"about_ca_topic_score_codex":0.0014841851,"about_ca_topic_score_gemma":0.0013911698,"teacher_disagreement_score":0.0014841851,"about_ca_system_score_codex":0.00058011577,"about_ca_system_score_gemma":0.00044420036,"threshold_uncertainty_score":0.0042090416},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.096577608363858,"score_gpt":0.35872123187291705,"score_spread":0.26214362350905906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031318223","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3837708,0.002401419,0.27905527,0.0021090459,0.0003974541,0.0012312214,0.0008488981,0.019845169,0.3103407],"genre_scores_gemma":[0.9447656,0.0008584228,0.034139797,0.00017689772,0.00009309649,0.00016894225,0.00048086155,0.00019042443,0.019125966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992742,0.00015726709,0.000033885164,0.000094422234,0.00030286287,0.00013751214],"domain_scores_gemma":[0.99869776,0.00023846567,0.000110752146,0.00039617828,0.00037697496,0.000179917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430069,0.00038859827,0.00030279582,0.0013093008,0.0010363464,0.001434025,0.001140765,0.0005820179,0.011416896],"category_scores_gemma":[0.0020537113,0.0002488531,0.0001697772,0.0013432237,0.0005902807,0.0034036587,0.0018347359,0.0005512415,0.0037386406],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012224945,0.00080702227,0.016620327,0.0009952036,0.00010094056,0.0018453782,0.0012917498,0.015368645,0.064176604,0.051694263,0.048592206,0.79728526],"study_design_scores_gemma":[0.0005626133,0.002707096,0.034367215,0.00046489167,0.0002675939,0.0054722303,0.0021381325,0.12304563,0.047866087,0.035231315,0.74752104,0.00035603947],"about_ca_topic_score_codex":0.0031199637,"about_ca_topic_score_gemma":0.0044934587,"teacher_disagreement_score":0.011416896,"about_ca_system_score_codex":0.000688676,"about_ca_system_score_gemma":0.00059839664,"threshold_uncertainty_score":0.038193285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Microscope; Optics; Physics","score_opus":0.025689640511466723,"score_gpt":0.26521638049016166,"score_spread":0.23952673997869495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032501570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45101932,0.0034356178,0.4557953,0.00469032,0.00062658906,0.00017334898,0.00022237902,0.00044547374,0.08359161],"genre_scores_gemma":[0.9787755,0.0008334782,0.014825758,0.00016876371,0.000103174214,0.000032701428,0.00002888647,0.000011825885,0.0052200425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996406,0.00010426535,0.0000066649964,0.000054221215,0.00010101976,0.00009315007],"domain_scores_gemma":[0.9992581,0.00038531824,0.00009067501,0.00008115593,0.00009319164,0.00009156187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039476357,0.00022510598,0.00029074264,0.00029655476,0.00095699215,0.0009819289,0.00057878834,0.0006447776,0.0025814297],"category_scores_gemma":[0.0019269731,0.00016549062,0.00022494099,0.00027129918,0.001015746,0.0013002526,0.0017939243,0.00048522613,0.00033373662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003445257,0.00019197162,0.010577639,0.00027201345,0.00009873105,0.0030187292,0.0012182029,0.34757972,0.033532314,0.4888321,0.009889176,0.104444854],"study_design_scores_gemma":[0.00006557954,0.0004493141,0.0029027765,0.000042742904,0.000043734202,0.0012542121,0.0015353746,0.8141093,0.006374763,0.13786541,0.035295714,0.00006101363],"about_ca_topic_score_codex":0.0034355316,"about_ca_topic_score_gemma":0.0036749367,"teacher_disagreement_score":0.0034355316,"about_ca_system_score_codex":0.0007193742,"about_ca_system_score_gemma":0.0006844576,"threshold_uncertainty_score":0.0086357},"labels":[],"label_agreement":null},{"id":"W2033722220","doi":"10.1016/j.procs.2013.06.006","title":"The Evolution of Information Networks around Data-shifting Paradigms","year":2013,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Bottleneck; The Internet; Participatory sensing; Process (computing); Architecture; Network architecture; Distributed computing; Key (lock); Data science; Computer network; Computer security; World Wide Web","score_opus":0.016785445079178625,"score_gpt":0.22491170255567278,"score_spread":0.20812625747649416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033722220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06840777,0.032575537,0.7112649,0.05942865,0.0014976169,0.00032994326,0.0005155231,0.0011338452,0.12484622],"genre_scores_gemma":[0.71629894,0.036863625,0.2107404,0.0066776546,0.0032164236,0.0007018086,0.00046194505,0.000395861,0.024643201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614453,0.001531525,0.00017560109,0.0008769248,0.00093613606,0.00033528105],"domain_scores_gemma":[0.99344903,0.0033495356,0.00046720073,0.0014220804,0.00078015705,0.00053197023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041493145,0.0006927355,0.00067401316,0.0025465968,0.00258484,0.011250993,0.0018161329,0.0036906062,0.002832853],"category_scores_gemma":[0.009379006,0.00079145987,0.000691272,0.0028041322,0.01010172,0.025813483,0.0050147194,0.0062916963,0.0011734846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021614036,0.0000135642385,0.00018741182,0.00006646509,0.000009222947,0.00006471858,0.0009171168,0.0031475483,0.00054794864,0.9782436,0.0015843872,0.015196408],"study_design_scores_gemma":[0.000013739558,0.000033473665,0.00025817094,0.00011296222,0.000010701909,0.0001784994,0.0006256723,0.014822634,0.00051108515,0.8710426,0.112355314,0.000035227615],"about_ca_topic_score_codex":0.0020321133,"about_ca_topic_score_gemma":0.0010957217,"teacher_disagreement_score":0.011250993,"about_ca_system_score_codex":0.0046549067,"about_ca_system_score_gemma":0.0018472045,"threshold_uncertainty_score":0.03377384},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Ubiquitous computing; Mobile technology; Mobile computing; Internet privacy; Multimedia; Telecommunications; World Wide Web; Human–computer interaction","score_opus":0.031221654498265534,"score_gpt":0.2588073198011088,"score_spread":0.2275856653028433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033777448","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012168059,0.70494497,0.16160841,0.07327036,0.0037062385,0.000102205726,0.00016493147,0.00032744656,0.043707445],"genre_scores_gemma":[0.20874831,0.6480438,0.10205705,0.0075897956,0.015146318,0.00044646222,0.00022116884,0.00012235939,0.017624846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807125,0.0006398214,0.000106666754,0.00023260375,0.0007721824,0.00017746851],"domain_scores_gemma":[0.99566793,0.0028806645,0.00023792686,0.0002350289,0.000644558,0.00033392367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036579638,0.0009839217,0.0016220015,0.001986992,0.0017351353,0.010735446,0.002307417,0.004485799,0.0034708376],"category_scores_gemma":[0.0045740837,0.0007428214,0.0004650027,0.003835782,0.0059858453,0.017342608,0.0028325121,0.0052886936,0.001145391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053317995,0.00009405717,0.0014036039,0.0011787476,0.0000308492,0.00024147461,0.00072914496,0.0026981018,0.001765206,0.7392455,0.01813061,0.2344294],"study_design_scores_gemma":[0.000019399633,0.00011731397,0.0009838496,0.000971266,0.000037175236,0.0015365375,0.002758797,0.019943945,0.000853752,0.64689636,0.32578114,0.00010042647],"about_ca_topic_score_codex":0.0011527627,"about_ca_topic_score_gemma":0.0017429896,"teacher_disagreement_score":0.010735446,"about_ca_system_score_codex":0.0017645647,"about_ca_system_score_gemma":0.0019681163,"threshold_uncertainty_score":0.019345403},"labels":[],"label_agreement":null},{"id":"W2033899596","doi":"10.1007/s11036-012-0419-6","title":"MONET Special Half-Issue “Recent Advances on Communications and Networking in China”","year":2012,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Telecommunications; China; Computer network; Political science","score_opus":0.015131907171904322,"score_gpt":0.26410977891835535,"score_spread":0.24897787174645103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033899596","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009591741,0.057155225,0.0038558198,0.04860488,0.7045435,0.00042875405,0.009403732,0.0013149836,0.16510135],"genre_scores_gemma":[0.037490506,0.0327497,0.0017270803,0.009454184,0.23077118,0.00029656355,0.011359002,0.0007647329,0.675387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994106,0.000068775065,0.000059182676,0.000077845674,0.00024866321,0.00013490736],"domain_scores_gemma":[0.99704164,0.00039561675,0.00030410005,0.00021406008,0.0012360355,0.0008085496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014417354,0.0012991534,0.0014258628,0.0045185634,0.0011221243,0.0030457652,0.0013090128,0.0019178503,0.15084696],"category_scores_gemma":[0.0023248817,0.00027340034,0.0007159304,0.0033299064,0.00038772944,0.0024412817,0.0017247824,0.0011492891,0.03303479],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022789856,0.00004610653,0.0005970786,0.00080048956,0.000024165869,0.00015305728,0.000024126746,0.00018341214,0.00076918857,0.0016149668,0.926188,0.069371365],"study_design_scores_gemma":[0.000025391435,0.00009813597,0.0057093427,0.00023326473,0.000030971605,0.00015923285,0.000060201484,0.00097547757,0.000627808,0.0009909072,0.99107176,0.000017433096],"about_ca_topic_score_codex":0.002072919,"about_ca_topic_score_gemma":0.004261374,"teacher_disagreement_score":0.15084696,"about_ca_system_score_codex":0.0013685583,"about_ca_system_score_gemma":0.0025349848,"threshold_uncertainty_score":0.5046333},"labels":[],"label_agreement":null},{"id":"W2035653651","doi":"10.1016/j.pmcj.2012.07.007","title":"Predicting missing contacts in mobile social networks","year":2012,"lang":"en","type":"article","venue":"Pervasive and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Popularity; Mobile social network; Range (aeronautics); Routing (electronic design automation); Social contact; Wireless sensor network; Delay-tolerant networking; Computer network; Human–computer interaction; Routing protocol; Mobile computing","score_opus":0.021891670570098644,"score_gpt":0.2646715877179974,"score_spread":0.2427799171478988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035653651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9335678,0.0012536023,0.05987113,0.0013331438,0.00016442256,0.00012582332,0.0015284248,0.00025400706,0.0019017102],"genre_scores_gemma":[0.9947048,0.00023436107,0.003542243,0.00004727242,0.00010481165,0.00002821282,0.00061307254,0.000011000714,0.0007141991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985678,0.0003433652,0.00013109611,0.00038143594,0.00036674674,0.00020952814],"domain_scores_gemma":[0.98052806,0.015531346,0.0017136864,0.00060585723,0.00086871244,0.00075235014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020087538,0.00081231474,0.0014372105,0.003066666,0.0011208341,0.0014122381,0.0022856523,0.0025661732,0.0011300844],"category_scores_gemma":[0.0163138,0.000715151,0.0006189458,0.002131945,0.00079068344,0.0033062587,0.0012658439,0.0014864157,0.0005079429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014608625,0.0008985773,0.33427638,0.00047282065,0.0003560639,0.002069703,0.0014501141,0.5406432,0.0026923122,0.010228186,0.0073295482,0.09812218],"study_design_scores_gemma":[0.000020968399,0.000097057455,0.012825986,0.00001989118,0.00004445153,0.0003279534,0.00040162264,0.975492,0.00049446226,0.009643013,0.00061652093,0.000016019054],"about_ca_topic_score_codex":0.009640301,"about_ca_topic_score_gemma":0.01635251,"teacher_disagreement_score":0.009640301,"about_ca_system_score_codex":0.0009548472,"about_ca_system_score_gemma":0.0005067692,"threshold_uncertainty_score":0.019168377},"labels":[],"label_agreement":null},{"id":"W2036193826","doi":"10.1109/apscc.2011.85","title":"A Distributed Mobile Database Architecture","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Architecture; Distributed database; Mobile database; Mobile computing; Mobile device; Data architecture; Distributed computing; Database; Computer architecture; Computer network; Reference architecture; Mobile station; Software architecture; Operating system; Base station","score_opus":0.031205903353328387,"score_gpt":0.22608314370612223,"score_spread":0.19487724035279386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036193826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021807963,0.0021922926,0.9447338,0.0013904681,0.00038055412,0.00034210732,0.0003436176,0.008748823,0.020060375],"genre_scores_gemma":[0.4165036,0.0023788535,0.5478561,0.0009831223,0.00033273906,0.00047106933,0.0016384411,0.00034651562,0.029489538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994723,0.00007308083,0.000047563855,0.00012722643,0.00020674003,0.00007309616],"domain_scores_gemma":[0.9995895,0.00003736614,0.000018156124,0.00012721951,0.00014180335,0.00008597601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064889557,0.0003259783,0.00042460178,0.00051247206,0.00092709693,0.0024480403,0.002096625,0.0009816781,0.0045846235],"category_scores_gemma":[0.0008456704,0.00036378545,0.000372933,0.0008466016,0.00039485464,0.0023311635,0.0019383259,0.00095015136,0.0021549626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009964098,0.0004578688,0.0040247617,0.00072189636,0.0002009027,0.00092329487,0.0009804887,0.034559842,0.09629821,0.25793535,0.057905618,0.5449953],"study_design_scores_gemma":[0.00034765017,0.00067807897,0.0019365477,0.00018776726,0.00029897896,0.002282292,0.0004204446,0.28995505,0.03592815,0.09081002,0.57703376,0.00012134918],"about_ca_topic_score_codex":0.001815082,"about_ca_topic_score_gemma":0.0022080808,"teacher_disagreement_score":0.0045846235,"about_ca_system_score_codex":0.00072768587,"about_ca_system_score_gemma":0.0011203431,"threshold_uncertainty_score":0.01533705},"labels":[],"label_agreement":null},{"id":"W2037007037","doi":"10.1109/icc.2012.6364184","title":"PMDS: A probabilistic misbehavior detection scheme in DTN","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Probabilistic logic; Computer science; Node (physics); Scheme (mathematics); Computer network; Routing (electronic design automation); Reputation; Routing protocol; Game theory; Computer security; Engineering; Artificial intelligence","score_opus":0.026145974526145938,"score_gpt":0.24767036408836052,"score_spread":0.22152438956221457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037007037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043298528,0.00020467027,0.9541711,0.00029904715,0.00006680642,0.00016310751,0.00005394599,0.00054626283,0.0011964516],"genre_scores_gemma":[0.9293173,0.00014314245,0.069459245,0.0000966594,0.000033432865,0.00011286681,0.00004284554,0.00001950546,0.0007750793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625576,0.0013401667,0.00032043463,0.00059859105,0.0012409206,0.00024407066],"domain_scores_gemma":[0.99104846,0.0034611442,0.0019501912,0.0017642974,0.0012016292,0.0005742449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040230877,0.00059343065,0.00090624753,0.0011606296,0.0009553158,0.0010254224,0.002167922,0.0011702892,0.0004231615],"category_scores_gemma":[0.014336221,0.0003581429,0.00065101904,0.0007971275,0.0017315223,0.002462453,0.0024599908,0.0012152774,0.00013104054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014478045,0.00032942358,0.013985377,0.00046712928,0.00027505096,0.0013069673,0.0015900627,0.44230086,0.057749182,0.1856873,0.0042786,0.2905822],"study_design_scores_gemma":[0.000043702028,0.00020565356,0.00066306884,0.00001833388,0.000043580665,0.00044462006,0.000054437296,0.97083414,0.0060692406,0.019492578,0.002077946,0.000052655523],"about_ca_topic_score_codex":0.0016222417,"about_ca_topic_score_gemma":0.0012054611,"teacher_disagreement_score":0.0040230877,"about_ca_system_score_codex":0.001376701,"about_ca_system_score_gemma":0.0015671379,"threshold_uncertainty_score":0.021276414},"labels":[],"label_agreement":null},{"id":"W2037067117","doi":"10.1016/j.tcs.2014.08.008","title":"The worst case behavior of randomized gossip protocols","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Gossip; Rumor; Computer science; Node (physics); Phone; Gossip protocol; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Randomness; Mathematics; Artificial intelligence; Statistics","score_opus":0.014456712512052642,"score_gpt":0.27928492875888133,"score_spread":0.2648282162468287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037067117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6840912,0.0022974138,0.26970145,0.0080663115,0.00025563044,0.00017755346,0.0010242781,0.0019976157,0.032388534],"genre_scores_gemma":[0.98784256,0.00033190896,0.009172427,0.00019952813,0.00008818496,0.000090201254,0.00019466717,0.00021087177,0.0018695277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9892335,0.00542621,0.00043315906,0.0012658274,0.0021275198,0.0015138359],"domain_scores_gemma":[0.84769833,0.12927055,0.0072055683,0.008240545,0.0042075426,0.003377499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014438627,0.0012747585,0.0020253756,0.0021423113,0.002609893,0.004860039,0.003672783,0.003320409,0.0039036218],"category_scores_gemma":[0.0835677,0.0015430019,0.0009661346,0.0017191677,0.0045178984,0.0075187823,0.0028295387,0.0033161272,0.00062610646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027145233,0.0004341769,0.0043772934,0.00037732013,0.00032121144,0.0007361345,0.0007146369,0.70192534,0.011479983,0.25633436,0.008217532,0.012367435],"study_design_scores_gemma":[0.00010182776,0.00010829022,0.00047214044,0.000028858987,0.000056575624,0.00021277161,0.00019291953,0.90076524,0.0020294604,0.095460445,0.00052675593,0.000044695284],"about_ca_topic_score_codex":0.0018108701,"about_ca_topic_score_gemma":0.0016451456,"teacher_disagreement_score":0.014438627,"about_ca_system_score_codex":0.0031023459,"about_ca_system_score_gemma":0.0028145916,"threshold_uncertainty_score":0.07635969},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; 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","score_opus":0.02807585781632486,"score_gpt":0.25090287717687665,"score_spread":0.2228270193605518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037324986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028901251,0.00017838847,0.9630004,0.00070683454,0.000038575312,0.00013915771,0.000107184314,0.0000854248,0.0068427334],"genre_scores_gemma":[0.88674515,0.0005306747,0.10630118,0.00023018254,0.00006851391,0.00040458323,0.00013802189,0.00003401827,0.0055477247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821776,0.0007590509,0.000071871626,0.0002747871,0.00046156056,0.00021494241],"domain_scores_gemma":[0.99752253,0.0016391136,0.00027329908,0.00009236524,0.00026373763,0.00020899047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025671108,0.00085622736,0.0013539818,0.0006664323,0.0008512225,0.0015760964,0.0025361704,0.0019105442,0.0013581875],"category_scores_gemma":[0.0071011134,0.0005474185,0.0008795819,0.00088111236,0.0018085686,0.0029129453,0.0017943606,0.0016582222,0.0001959557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013451875,0.00009790247,0.00085863774,0.00009773381,0.00008611959,0.00038078605,0.0004290882,0.7112695,0.0022165296,0.2643159,0.0018648582,0.01824834],"study_design_scores_gemma":[0.000020705456,0.000026500116,0.00010109889,0.0000074419886,0.000014999148,0.000038636692,0.000030789903,0.96361226,0.00017041733,0.035174783,0.00078802765,0.000014277673],"about_ca_topic_score_codex":0.00937498,"about_ca_topic_score_gemma":0.0055960356,"teacher_disagreement_score":0.00937498,"about_ca_system_score_codex":0.0021412075,"about_ca_system_score_gemma":0.00232746,"threshold_uncertainty_score":0.018640816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013736970058334368,"score_gpt":0.23705997003959914,"score_spread":0.22332299998126476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038638313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049868155,0.0020684716,0.93074363,0.0011606008,0.00013062998,0.00006225815,0.00012772204,0.00017815728,0.015660359],"genre_scores_gemma":[0.8760372,0.0037853734,0.11087106,0.0002375715,0.0004329107,0.0002171316,0.00019276574,0.00014800567,0.008078004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810624,0.0006881423,0.00007411284,0.0004550391,0.0005255194,0.00015091892],"domain_scores_gemma":[0.9940031,0.0041277674,0.00081656023,0.00035818023,0.0005134572,0.00018096209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062778,0.0008597517,0.0007119905,0.0022504004,0.0007712591,0.002098905,0.0011739089,0.0013686077,0.0034498235],"category_scores_gemma":[0.011746283,0.00039856913,0.00050883193,0.0024345533,0.0026078038,0.005101239,0.0012605481,0.0012861259,0.0003873341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034850575,0.000023169725,0.00079170737,0.0001572359,0.0000533272,0.000115688104,0.00022620797,0.1718687,0.002389245,0.7995398,0.0010311719,0.023768896],"study_design_scores_gemma":[0.00001561295,0.00006119734,0.0007892265,0.000034339468,0.000039348437,0.00017800096,0.000117638534,0.25677133,0.0010747749,0.7307257,0.010158651,0.00003425714],"about_ca_topic_score_codex":0.0023291404,"about_ca_topic_score_gemma":0.0018178868,"teacher_disagreement_score":0.0034498235,"about_ca_system_score_codex":0.0016482249,"about_ca_system_score_gemma":0.0007733709,"threshold_uncertainty_score":0.0119588375},"labels":[],"label_agreement":null},{"id":"W2043280338","doi":"10.1145/1507222.1507227","title":"“Social cohesion analysis of networks: a novel method for identifying cohesive subgroups in social hypertext” by Alvin Chin, with Jessica Rubart as coordinator","year":2009,"lang":"en","type":"article","venue":"ACM SIGWEB Newsletter","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Beijing; Cohesion (chemistry); Computer science; Hypertext; World Wide Web; Social computing; Chin; Context (archaeology); Social network (sociolinguistics); Social media; China; Political science; Medicine","score_opus":0.02958344532161527,"score_gpt":0.31511903367173444,"score_spread":0.28553558835011916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043280338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062050574,0.0028647871,0.9221364,0.0028929766,0.00057844963,0.00072058185,0.00058411394,0.0017362784,0.006435775],"genre_scores_gemma":[0.3453047,0.0019078667,0.636673,0.0008091609,0.0006932396,0.0014284044,0.0019644962,0.0006332887,0.010585829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590814,0.0018560827,0.00023984507,0.00088640547,0.0009705345,0.0001390597],"domain_scores_gemma":[0.99096525,0.0056438562,0.0008203313,0.00063390046,0.0015729488,0.0003637453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003070758,0.0010155023,0.0006787705,0.0055990983,0.0020394595,0.0027291141,0.0010647628,0.0010253985,0.002462145],"category_scores_gemma":[0.017769791,0.0005913771,0.0010588185,0.0044895587,0.0015278334,0.004425434,0.0023495583,0.0013831215,0.0011142428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045352904,0.00021561437,0.02585173,0.00068733894,0.00044175718,0.00052962324,0.0117842425,0.007984004,0.011804996,0.025605865,0.039786994,0.8748542],"study_design_scores_gemma":[0.00017386462,0.0005995742,0.058199883,0.0008205225,0.0006280907,0.0027785688,0.013777389,0.5030665,0.027723316,0.13633893,0.2554259,0.00046749823],"about_ca_topic_score_codex":0.003288852,"about_ca_topic_score_gemma":0.0052306997,"teacher_disagreement_score":0.0055990983,"about_ca_system_score_codex":0.00078701845,"about_ca_system_score_gemma":0.0007809541,"threshold_uncertainty_score":0.016239882},"labels":[],"label_agreement":null},{"id":"W2043610923","doi":"10.1109/wimob.2010.5645017","title":"DYMES: A dynamic messaging service for VANETs","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Service (business); Context (archaeology); Publication; World Wide Web; Information flow; Mobile device; Vehicular ad hoc network; Computer network; Wireless; Wireless ad hoc network; Telecommunications","score_opus":0.010868244081382917,"score_gpt":0.25338423428095147,"score_spread":0.24251599019956854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043610923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025069252,0.0014635309,0.81895113,0.0012014696,0.0007470834,0.00088721944,0.0034789108,0.11668805,0.031513307],"genre_scores_gemma":[0.5670433,0.0030172302,0.33962247,0.0014562486,0.0006981708,0.001876332,0.016322507,0.009028805,0.060935035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.00022508918,0.00011277372,0.00011611477,0.00031382908,0.00013506053],"domain_scores_gemma":[0.99892265,0.00032814374,0.000104688166,0.00024419458,0.00020051718,0.00019982345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261148,0.0008680162,0.000647364,0.0010248779,0.0008068709,0.0026593895,0.0020823663,0.0014682395,0.007611039],"category_scores_gemma":[0.0045018597,0.000630634,0.00049929466,0.00076759554,0.00049398176,0.0035224056,0.0038723422,0.0016126573,0.0031328113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025495144,0.0003398383,0.0052306955,0.0018389681,0.00029422535,0.0019103795,0.0030146409,0.03330277,0.08356525,0.17842853,0.22065094,0.46887434],"study_design_scores_gemma":[0.0003036238,0.00045290645,0.0017840835,0.00019427354,0.000119994416,0.0013282469,0.00056791375,0.16902535,0.03354247,0.03644214,0.75597817,0.00026077946],"about_ca_topic_score_codex":0.0015897645,"about_ca_topic_score_gemma":0.0017807743,"teacher_disagreement_score":0.007611039,"about_ca_system_score_codex":0.000537046,"about_ca_system_score_gemma":0.0009048588,"threshold_uncertainty_score":0.025461435},"labels":[],"label_agreement":null},{"id":"W2045229904","doi":"10.1145/2641798.2641801","title":"Community-based forwarding for low-capacity pocket switched networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Exploit; Computer network; Latency (audio); Reliability (semiconductor); Popularity; Routing (electronic design automation); Virtual routing and forwarding; Node (physics); Routing protocol; Distributed computing; Routing table; Power (physics); Computer security; Telecommunications; Engineering","score_opus":0.041847767902990766,"score_gpt":0.2468706003574289,"score_spread":0.20502283245443811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045229904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07664744,0.0008059938,0.9159035,0.00078537164,0.00011961431,0.00018409072,0.00017856082,0.000507891,0.0048675537],"genre_scores_gemma":[0.85611486,0.0008316421,0.13699023,0.00012787533,0.00006893957,0.0002008328,0.0002642227,0.000049752005,0.005351546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966455,0.00010164027,0.000013831759,0.00004352757,0.000119212265,0.000057280224],"domain_scores_gemma":[0.99841666,0.0009918425,0.00009210712,0.00012747699,0.00027865847,0.000093263625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167316,0.00031103604,0.0004252367,0.000797673,0.0010955142,0.0006746218,0.0011445039,0.0007430897,0.001943381],"category_scores_gemma":[0.004483112,0.0002053851,0.00037972466,0.0006975978,0.00059595297,0.0013065209,0.00093702757,0.00076836103,0.0001512212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020494337,0.00008862694,0.0013089142,0.00017856108,0.00004423095,0.00026543494,0.0002636695,0.7293579,0.009658133,0.15728992,0.005452948,0.095886655],"study_design_scores_gemma":[0.000019187784,0.0000285467,0.000098771154,0.000006863011,0.000007231419,0.000039426464,0.00002233707,0.96455085,0.00065544795,0.032727845,0.0018345959,0.000008930113],"about_ca_topic_score_codex":0.011846493,"about_ca_topic_score_gemma":0.012793717,"teacher_disagreement_score":0.011846493,"about_ca_system_score_codex":0.0015042423,"about_ca_system_score_gemma":0.0013856633,"threshold_uncertainty_score":0.02355504},"labels":[],"label_agreement":null},{"id":"W2046405541","doi":"10.1109/icc.2012.6364252","title":"A privacy-preserving proximity friend notification scheme with opportunistic networking","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Network packet; Scheme (mathematics); Bluetooth; Internet privacy; Computer network; Software deployment; Phone; Wireless; Telecommunications","score_opus":0.04044339342025334,"score_gpt":0.24409101698109553,"score_spread":0.2036476235608422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046405541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07982721,0.0010805082,0.9101409,0.0005065435,0.00022517348,0.0004386552,0.00022719723,0.00070345553,0.006850436],"genre_scores_gemma":[0.93597585,0.00041357524,0.060095686,0.00014322046,0.00008647085,0.00018429883,0.00012959563,0.000015209337,0.0029560835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.00034544972,0.000108995286,0.0002413047,0.00042995356,0.00021345288],"domain_scores_gemma":[0.9976993,0.0007958642,0.00037738724,0.0006300387,0.00032568764,0.00017173518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012144465,0.00070397946,0.00082197506,0.0009905391,0.0016916237,0.0007289651,0.0016919787,0.0008002456,0.0009695986],"category_scores_gemma":[0.00410999,0.00028732567,0.00062056957,0.0011558176,0.0007766689,0.0021942756,0.0025133397,0.0008610812,0.00023186211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002368335,0.00061866525,0.0048191873,0.0006738566,0.00026019954,0.0021450806,0.0020559924,0.22775252,0.0803054,0.18451254,0.010067366,0.4844209],"study_design_scores_gemma":[0.00023778375,0.00097256765,0.0015108497,0.000075501135,0.00019049151,0.003573481,0.00040600845,0.8942151,0.023098018,0.04838267,0.027116474,0.00022103683],"about_ca_topic_score_codex":0.00235656,"about_ca_topic_score_gemma":0.0023897872,"teacher_disagreement_score":0.00235656,"about_ca_system_score_codex":0.0009771549,"about_ca_system_score_gemma":0.0011731861,"threshold_uncertainty_score":0.0070897937},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Government of Canada; University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.07450081417601022,"score_gpt":0.26264191948336135,"score_spread":0.18814110530735112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046773087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40331468,0.0013577373,0.56046355,0.0040062442,0.0002720672,0.00018847773,0.000409668,0.00043522308,0.02955234],"genre_scores_gemma":[0.9128241,0.00073607685,0.074285954,0.0003483164,0.00008987156,0.00010196659,0.00023430707,0.00012970058,0.011249706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989009,0.0004457995,0.00004050522,0.00019782704,0.00016649035,0.00024854444],"domain_scores_gemma":[0.9894924,0.007067375,0.0008900506,0.0012197637,0.0005760854,0.0007542366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015068257,0.00054453313,0.0015722691,0.0014653682,0.0025467398,0.0036806993,0.0025874549,0.0025546728,0.008570745],"category_scores_gemma":[0.01618391,0.0010413879,0.0010363725,0.0017052322,0.0031693971,0.008643508,0.003927844,0.0019833078,0.0005107448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043942404,0.00010006029,0.0027270634,0.00017112608,0.000070876675,0.00023658092,0.00069072517,0.10319806,0.0010238466,0.86370975,0.0064347773,0.02119767],"study_design_scores_gemma":[0.00004578122,0.00002992649,0.00022938404,0.000030186931,0.000025234734,0.000080561,0.0005246651,0.25117126,0.0005581509,0.74385643,0.0034308014,0.000017590124],"about_ca_topic_score_codex":0.0033191894,"about_ca_topic_score_gemma":0.0039594634,"teacher_disagreement_score":0.008570745,"about_ca_system_score_codex":0.00121904,"about_ca_system_score_gemma":0.001291176,"threshold_uncertainty_score":0.02867198},"labels":[],"label_agreement":null},{"id":"W2051115321","doi":"10.1145/1558590.1558599","title":"Distributing content updates over a mobile social network","year":2009,"lang":"en","type":"article","venue":"ACM SIGMOBILE Mobile Computing and Communications Review","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Computer network; Bandwidth (computing); Mobile social network; Service provider; Cellular network; Service (business); Mobile computing; Database; Business","score_opus":0.05016017632120736,"score_gpt":0.3247047183053052,"score_spread":0.27454454198409783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051115321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6134335,0.0016338166,0.36662033,0.0029326694,0.0001738589,0.00031174038,0.00035641956,0.0003631533,0.014174482],"genre_scores_gemma":[0.98613507,0.0005674316,0.009650639,0.00008139544,0.00011406258,0.000057965684,0.000057923025,0.00002249629,0.003313054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893004,0.0004089609,0.000035668894,0.00017993724,0.00024415817,0.00020123264],"domain_scores_gemma":[0.9948778,0.003170728,0.0009024366,0.0003120457,0.00043009056,0.0003069768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013403082,0.0008943839,0.00074489554,0.0011623894,0.001392142,0.0014304828,0.0014499162,0.0014304087,0.0020205365],"category_scores_gemma":[0.007762361,0.00038744143,0.0004492223,0.0014582311,0.0012692382,0.0028367147,0.001288782,0.00064281013,0.00034081528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045590632,0.00023189351,0.0064685233,0.00020975982,0.00018076599,0.0013681117,0.00083388446,0.82689714,0.010427126,0.097391635,0.0039361203,0.051599115],"study_design_scores_gemma":[0.00003666231,0.000102139806,0.0007768798,0.000009917802,0.00003851925,0.00016176277,0.00020558898,0.9725537,0.00067699235,0.023055015,0.0023673,0.000015418953],"about_ca_topic_score_codex":0.0063913055,"about_ca_topic_score_gemma":0.0037682767,"teacher_disagreement_score":0.0063913055,"about_ca_system_score_codex":0.0018469327,"about_ca_system_score_gemma":0.0005627724,"threshold_uncertainty_score":0.013400555},"labels":[],"label_agreement":null},{"id":"W2051187438","doi":"","title":"Design principles for robust opportunistic communication","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Communications system; Mobile telephony; Focus (optics); Communications protocol; Protocol (science); Telecommunications; Computer network; Mobile radio","score_opus":0.14710444184002003,"score_gpt":0.27890594698170673,"score_spread":0.1318015051416867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051187438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022628848,0.0001932958,0.984193,0.00049582974,0.00005980645,0.00011487049,0.000029592962,0.0001374006,0.01251333],"genre_scores_gemma":[0.42725405,0.0011142872,0.5513427,0.00087746873,0.0002763184,0.0020191649,0.00013451699,0.00022123852,0.016760139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678063,0.0010658492,0.000252353,0.00037939544,0.0012679399,0.000253706],"domain_scores_gemma":[0.9956664,0.001991658,0.00043230943,0.00074643997,0.0010178701,0.0001453474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033317984,0.0005956066,0.00043091967,0.000624553,0.0011378131,0.0020946288,0.001600937,0.0015574078,0.004918432],"category_scores_gemma":[0.0073203174,0.0006042162,0.000615074,0.0005161335,0.0025319275,0.0027387168,0.0023483627,0.0021658742,0.0012678824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036024998,0.000031303058,0.00021486834,0.00016708067,0.000024501986,0.0001343161,0.00036441186,0.037568707,0.00502985,0.922438,0.0029876856,0.03100325],"study_design_scores_gemma":[0.000091475515,0.00017029807,0.00018959989,0.00014377208,0.000059711936,0.00052126695,0.0002083878,0.27839735,0.007832331,0.6208438,0.09148536,0.000056660807],"about_ca_topic_score_codex":0.0009092574,"about_ca_topic_score_gemma":0.00077393494,"teacher_disagreement_score":0.004918432,"about_ca_system_score_codex":0.0012500795,"about_ca_system_score_gemma":0.0013511047,"threshold_uncertainty_score":0.017620444},"labels":[],"label_agreement":null},{"id":"W2051426928","doi":"10.1145/1410064.1410071","title":"Design principles for opportunistic communication in constrained computing environments","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless; Power consumption; Distributed computing; Energy consumption; Wireless network; Computer network; Ubiquitous computing; Embedded system; Power (physics); Computer architecture; Telecommunications; Human–computer interaction; Engineering; Electrical engineering","score_opus":0.12435549671636568,"score_gpt":0.2671669133786318,"score_spread":0.1428114166622661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051426928","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036490883,0.0005475637,0.9712625,0.0011571739,0.0001457708,0.0001539225,0.00003812881,0.00017341592,0.022872387],"genre_scores_gemma":[0.5586025,0.0030671419,0.4048069,0.0015529013,0.0004929435,0.002340863,0.00013280395,0.00028479606,0.028719058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981811,0.0005885132,0.00011579587,0.00019789048,0.0006899676,0.00022680835],"domain_scores_gemma":[0.99741346,0.0012935738,0.0002159998,0.00035804705,0.00055444933,0.00016450211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019226484,0.00077089976,0.00052765216,0.0006007931,0.0014616924,0.0029674824,0.001960505,0.0016553884,0.005239831],"category_scores_gemma":[0.0057844985,0.0006201929,0.0005147689,0.0006496725,0.0023090446,0.0033803792,0.0024675133,0.0019717745,0.0014463824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003445495,0.000030976666,0.00023359465,0.00017084219,0.000021568761,0.00019692077,0.0005621581,0.03966138,0.0029690443,0.92710435,0.004138701,0.02487607],"study_design_scores_gemma":[0.00007201053,0.00010745409,0.0001864209,0.00011339201,0.00004633821,0.0006148433,0.0002715996,0.2468836,0.00214654,0.6868398,0.06266058,0.00005748028],"about_ca_topic_score_codex":0.0014138266,"about_ca_topic_score_gemma":0.0020538403,"teacher_disagreement_score":0.005239831,"about_ca_system_score_codex":0.0011310289,"about_ca_system_score_gemma":0.001463691,"threshold_uncertainty_score":0.01752901},"labels":[],"label_agreement":null},{"id":"W2053082175","doi":"10.1109/ew.2010.5483532","title":"Optimal two-hop routing in delay-tolerant networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Computer science; Hop (telecommunications); Computer network; Routing protocol; Overhead (engineering); Network routing; Distributed computing; Routing (electronic design automation)","score_opus":0.012528688964176252,"score_gpt":0.2417095034150842,"score_spread":0.22918081445090796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053082175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110983446,0.00082226534,0.88493896,0.000348583,0.000044009357,0.000047299105,0.000039924762,0.00019915757,0.002576385],"genre_scores_gemma":[0.91849464,0.00036569784,0.07953223,0.000065085245,0.000025127489,0.0000719545,0.00004842268,0.00004326455,0.0013535602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926883,0.00033336825,0.000035900634,0.000116869465,0.00015982238,0.0000851779],"domain_scores_gemma":[0.99897563,0.000695445,0.00013986153,0.000065901164,0.000073173636,0.000050078674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012811365,0.00044057664,0.0007021647,0.00047901474,0.00048152416,0.00087041967,0.0006269218,0.00066402473,0.0005402922],"category_scores_gemma":[0.003205564,0.00032229023,0.0002498235,0.00065382704,0.0010138009,0.0011465946,0.0007168162,0.00039285887,0.00007388407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044867153,0.000025088344,0.00028023767,0.000040836276,0.000014760483,0.00004076989,0.0000665527,0.95435786,0.001403373,0.031947367,0.00028516975,0.011493114],"study_design_scores_gemma":[0.000014205264,0.000022655395,0.00008335341,0.0000031187478,0.0000048251673,0.000016034453,0.000020137715,0.9708316,0.0005635713,0.027937908,0.0004969796,0.000005510703],"about_ca_topic_score_codex":0.0013746147,"about_ca_topic_score_gemma":0.0008110146,"teacher_disagreement_score":0.0013746147,"about_ca_system_score_codex":0.0011182884,"about_ca_system_score_gemma":0.0006682749,"threshold_uncertainty_score":0.0081138015},"labels":[],"label_agreement":null},{"id":"W2054332019","doi":"10.1155/2011/617624","title":"Communications and Networking for Smart Grid: Technology and Practice","year":2011,"lang":"en","type":"article","venue":"International Journal of Digital Multimedia Broadcasting","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Telecommunications; Smart grid; Grid; Computer security; Electrical engineering","score_opus":0.079841371097653,"score_gpt":0.3089870727331833,"score_spread":0.22914570163553033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054332019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080483295,0.24059041,0.37998793,0.1140021,0.008548779,0.00024681285,0.00015322985,0.000881924,0.24754046],"genre_scores_gemma":[0.27862868,0.38173193,0.2165467,0.013202213,0.0147343,0.00044121023,0.0002422255,0.00028599612,0.09418666],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997761,0.00069414184,0.0002101979,0.0002822238,0.0009622593,0.00009019357],"domain_scores_gemma":[0.9949509,0.0018897167,0.00035399545,0.00084731943,0.0016742282,0.00028371686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031616916,0.00077643985,0.000566896,0.0018687148,0.0008476474,0.0042061405,0.0012030344,0.0034822873,0.0063561844],"category_scores_gemma":[0.0053955032,0.00031263876,0.00022789008,0.0032579994,0.0043476713,0.0064917314,0.0021408591,0.002958606,0.0024790554],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032481643,0.00007190701,0.0006770082,0.0009795179,0.000014935636,0.00014805458,0.00049416255,0.0051278034,0.0019662278,0.45294246,0.04298869,0.49455678],"study_design_scores_gemma":[0.000012258199,0.000117423275,0.00048660618,0.0014537334,0.000019248748,0.0006962525,0.0005965226,0.013095617,0.0021982836,0.19257993,0.78870374,0.000040278926],"about_ca_topic_score_codex":0.0012062805,"about_ca_topic_score_gemma":0.001381672,"teacher_disagreement_score":0.0063561844,"about_ca_system_score_codex":0.0021054938,"about_ca_system_score_gemma":0.0022567927,"threshold_uncertainty_score":0.02126354},"labels":[],"label_agreement":null},{"id":"W2056492559","doi":"10.1109/efta.2007.4416861","title":"Addressing the challenges of eNetwork cyberengineering","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.10441466286888529,"score_gpt":0.2854117446133062,"score_spread":0.18099708174442092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056492559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024924593,0.0028071692,0.8623839,0.021063095,0.0005846831,0.000057077435,0.000033907392,0.00044110254,0.087704435],"genre_scores_gemma":[0.79751694,0.006152048,0.16632755,0.0021616006,0.00061196886,0.00018514777,0.000050192713,0.00015388761,0.02684069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.0002792351,0.00002289294,0.000082296196,0.00022127393,0.00010257176],"domain_scores_gemma":[0.99716634,0.0014613573,0.00019600613,0.0006460278,0.00033939557,0.00019082947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020584723,0.00039607895,0.00032993025,0.00041750874,0.0017403906,0.003748012,0.0012518889,0.0017480364,0.0034870745],"category_scores_gemma":[0.004096294,0.00018084953,0.00023652766,0.00042007334,0.0027860512,0.0057936697,0.003885641,0.0021995825,0.00049753446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144510705,0.000049275422,0.0006404374,0.0000919428,0.0000130853205,0.00015731427,0.00042422264,0.03166587,0.0020867772,0.8913205,0.003910139,0.0696259],"study_design_scores_gemma":[0.000008550086,0.000034683373,0.00018814765,0.00006491688,0.000010546414,0.00026462166,0.00053140713,0.079509035,0.0020499835,0.8189112,0.09840893,0.000018000963],"about_ca_topic_score_codex":0.0010441641,"about_ca_topic_score_gemma":0.0019512195,"teacher_disagreement_score":0.003748012,"about_ca_system_score_codex":0.00074782484,"about_ca_system_score_gemma":0.0017793002,"threshold_uncertainty_score":0.011665463},"labels":[],"label_agreement":null},{"id":"W2057440614","doi":"10.1007/s11227-014-1243-5","title":"Efficient routing based on past information to predict the future location for message passing in 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":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Geographic routing; Latency (audio); Wireless Routing Protocol; Dynamic Source Routing; Probabilistic logic; Distributed computing; Routing (electronic design automation); Link-state routing protocol; Zone Routing Protocol; Telecommunications; Artificial intelligence","score_opus":0.009991258978234632,"score_gpt":0.2177091045419444,"score_spread":0.20771784556370976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057440614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2014925,0.00056984834,0.793661,0.00038075092,0.00011319594,0.00009598618,0.00026743097,0.0005803184,0.0028388253],"genre_scores_gemma":[0.95823383,0.00021971327,0.04001887,0.000034056786,0.000034160945,0.000048744238,0.00020281377,0.000033445813,0.0011743722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999597,0.000096793,0.000028036322,0.0000811579,0.000110427805,0.000086589105],"domain_scores_gemma":[0.9980282,0.0010924705,0.00024568714,0.00026777375,0.00027351853,0.00009232213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008508543,0.00043274183,0.0007593359,0.0009967178,0.0008730947,0.000777761,0.001420219,0.00055251183,0.00074891106],"category_scores_gemma":[0.0047848993,0.00044827285,0.00028507836,0.0010627254,0.00061926025,0.0014719989,0.0009793475,0.0005495701,0.00015499449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016600543,0.000062518986,0.0022415468,0.000052101495,0.000033624598,0.00009456097,0.00011534808,0.9335813,0.0026388902,0.013743468,0.0014250273,0.045845617],"study_design_scores_gemma":[0.0000031630725,0.000008833437,0.00010432229,0.0000016163963,0.000003831912,0.000010549599,0.000010672144,0.9965352,0.00025448648,0.002923999,0.00014026591,0.000002957951],"about_ca_topic_score_codex":0.010590501,"about_ca_topic_score_gemma":0.017384313,"teacher_disagreement_score":0.010590501,"about_ca_system_score_codex":0.0010473626,"about_ca_system_score_gemma":0.0012096657,"threshold_uncertainty_score":0.021057725},"labels":[],"label_agreement":null},{"id":"W2057708173","doi":"10.1109/glocomw.2013.6855719","title":"Performance analysis of multi-channel multi-source message delivery in ICMN","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; The Internet; Bandwidth (computing); Channel (broadcasting); Hop (telecommunications); Distributed computing; World Wide Web","score_opus":0.028858772591625333,"score_gpt":0.23307334861524232,"score_spread":0.20421457602361698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057708173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6291237,0.0020613684,0.35494974,0.00048992806,0.00009805132,0.00009946119,0.000096339245,0.0005738452,0.012507578],"genre_scores_gemma":[0.9962735,0.00018540907,0.002925882,0.000018021014,0.000008145125,0.000010238592,0.0000134086295,0.000008420222,0.0005568684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922884,0.00023434972,0.000020458805,0.00009937121,0.00027345918,0.00014342285],"domain_scores_gemma":[0.99712163,0.0019573818,0.00030600475,0.00011051305,0.0004391416,0.000065389075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012935861,0.00048590123,0.00041206033,0.00064898655,0.00037682196,0.00066592405,0.000564798,0.00046790575,0.000828582],"category_scores_gemma":[0.004485224,0.00017627356,0.0001877088,0.0005268508,0.0004372996,0.00070353685,0.0004385185,0.00033333883,0.00010393525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022408519,0.00006050401,0.0024981054,0.0001244113,0.000030379633,0.0002013495,0.00014979744,0.9600963,0.008585341,0.0077501666,0.000508581,0.019770987],"study_design_scores_gemma":[0.000002306219,0.00008632064,0.0003540385,0.0000028349452,0.0000072858847,0.00004637336,0.000021626,0.99784625,0.0011449796,0.00037633043,0.00010784155,0.0000038370085],"about_ca_topic_score_codex":0.004273649,"about_ca_topic_score_gemma":0.0023043589,"teacher_disagreement_score":0.004273649,"about_ca_system_score_codex":0.0017649621,"about_ca_system_score_gemma":0.0006722663,"threshold_uncertainty_score":0.0128058195},"labels":[],"label_agreement":null},{"id":"W2059353064","doi":"10.1109/vetecf.2010.5594488","title":"DTcoop: Delay Tolerant Cooperative Communications in DTN/WLAN Integrated Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Upload; Node (physics); Local area network; Delay-tolerant networking; Wireless; The Internet; Scheduling (production processes); Dissemination; Transmission (telecommunications); Wi-Fi; Wireless network; Routing protocol; Network packet; Telecommunications; Engineering; Optimized Link State Routing Protocol; Operating system","score_opus":0.024669353910991912,"score_gpt":0.27036079289119397,"score_spread":0.24569143898020207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059353064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078682594,0.001209801,0.91287535,0.00022725697,0.000111460206,0.00015552095,0.00004446784,0.00027600615,0.0064174333],"genre_scores_gemma":[0.91611534,0.00072009605,0.078765415,0.00013182926,0.00007099283,0.00012868927,0.00006053281,0.000015687328,0.0039913855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995369,0.000112819806,0.000020926585,0.00008233617,0.0001600222,0.00008703791],"domain_scores_gemma":[0.999326,0.00025652684,0.00012487106,0.000071915616,0.00015676819,0.000063950996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006364917,0.00048448087,0.00039025975,0.00047114247,0.00068672915,0.0007192639,0.00094937807,0.00063923345,0.00069468806],"category_scores_gemma":[0.0012405809,0.00014444155,0.00021380394,0.00091232767,0.0004941047,0.0009192204,0.0010098635,0.00034907283,0.00013361582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005460796,0.0002143028,0.0038597358,0.0004601357,0.00012511293,0.0018080351,0.0007711705,0.5873323,0.059848323,0.08069446,0.0047082077,0.25963214],"study_design_scores_gemma":[0.00002783554,0.0002944572,0.00046863637,0.000018796714,0.00004175674,0.0005594515,0.00014390262,0.973865,0.006171443,0.007967399,0.010415871,0.000025535339],"about_ca_topic_score_codex":0.00384955,"about_ca_topic_score_gemma":0.0040592006,"teacher_disagreement_score":0.00384955,"about_ca_system_score_codex":0.00073937356,"about_ca_system_score_gemma":0.0007035341,"threshold_uncertainty_score":0.0076542497},"labels":[],"label_agreement":null},{"id":"W2062598172","doi":"10.1109/glocom.2014.7036820","title":"An efficient adaptive MAC frame aggregation scheme in delay tolerant sensor networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Quality of service; Energy consumption; Queue; Throughput; Data aggregator; Transmission (telecommunications); Efficient energy use; Frame (networking); Scheme (mathematics); Channel (broadcasting); Transmission delay; Data transmission; Wireless; Real-time computing; Telecommunications; Network packet; Engineering","score_opus":0.013095459619304336,"score_gpt":0.23177131890021418,"score_spread":0.21867585928090985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062598172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071430475,0.0014842201,0.92360896,0.0002044267,0.00026960636,0.00012811205,0.000056399014,0.0006708202,0.002147033],"genre_scores_gemma":[0.83179975,0.00045951077,0.16556586,0.00012388082,0.00012353042,0.00010417772,0.000107145715,0.00002747052,0.001688625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996195,0.00008351208,0.00003479529,0.00005803184,0.00015825228,0.00004589112],"domain_scores_gemma":[0.9994553,0.00013223365,0.00007189529,0.00009798677,0.00021131845,0.000031329146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068932574,0.0004739591,0.00045466292,0.0006438439,0.00072755106,0.00045216756,0.00087308313,0.0003725837,0.00040049286],"category_scores_gemma":[0.0016609232,0.00015927765,0.00020268778,0.00059237,0.00028798086,0.0007279103,0.0004339991,0.00039146646,0.000119030614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088985416,0.00027254448,0.0025506802,0.00026900246,0.0001269881,0.00058792613,0.0007042704,0.2442813,0.18067178,0.04452403,0.006102091,0.5190195],"study_design_scores_gemma":[0.00003963063,0.00028868896,0.0009496298,0.000015273714,0.00005786805,0.0002763433,0.000045738863,0.9652411,0.021039922,0.0047123358,0.0072939117,0.000039566738],"about_ca_topic_score_codex":0.0020977375,"about_ca_topic_score_gemma":0.0025061427,"teacher_disagreement_score":0.0020977375,"about_ca_system_score_codex":0.00063332095,"about_ca_system_score_gemma":0.00048689012,"threshold_uncertainty_score":0.0045950413},"labels":[],"label_agreement":null},{"id":"W2063222754","doi":"10.1109/lcn.2011.6115200","title":"Effective utilization of place as a resource in pocket switched networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Relay; Computer science; Computer network; Resource (disambiguation); Wireless; Wireless network; Resource management (computing); Mobility model; Range (aeronautics); Distributed computing; Telecommunications; Engineering","score_opus":0.03452918866659915,"score_gpt":0.24710534194203645,"score_spread":0.2125761532754373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063222754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.922786,0.0012832247,0.068959095,0.00049990526,0.00006026712,0.00008244109,0.00042666213,0.00042870842,0.005473724],"genre_scores_gemma":[0.99431735,0.00023081689,0.004942515,0.000024484983,0.000012742003,0.000018724262,0.00007668802,0.000012850601,0.0003639153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991879,0.00024976654,0.000049727012,0.00012829223,0.00018433234,0.00019996459],"domain_scores_gemma":[0.9947135,0.0031444656,0.00072706834,0.00077962666,0.00026879885,0.00036642991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013573703,0.00053700584,0.0006508571,0.0010114291,0.00084053486,0.001437591,0.0013578054,0.0007346841,0.0017736288],"category_scores_gemma":[0.00638172,0.00028669005,0.0002593523,0.001738813,0.0011008814,0.0034335894,0.0015235114,0.0005667161,0.00023909502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017942867,0.00049807486,0.036755297,0.0003533062,0.00014861255,0.0008774068,0.00069707894,0.6575383,0.024575094,0.028124338,0.0038623281,0.24477588],"study_design_scores_gemma":[0.00009824136,0.000629217,0.01101325,0.000042059542,0.00010401709,0.0007927536,0.0013177702,0.9323865,0.00910746,0.037278675,0.0071473443,0.000082615246],"about_ca_topic_score_codex":0.0048443335,"about_ca_topic_score_gemma":0.0071887593,"teacher_disagreement_score":0.0048443335,"about_ca_system_score_codex":0.0010496426,"about_ca_system_score_gemma":0.0008190949,"threshold_uncertainty_score":0.009632289},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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","score_opus":0.11696752861313432,"score_gpt":0.3012897265651873,"score_spread":0.184322197952053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063968252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28522834,0.004829319,0.5618827,0.004221124,0.0016615936,0.0025556965,0.0025878476,0.033996105,0.103037365],"genre_scores_gemma":[0.94426465,0.0011710308,0.038779385,0.00042695715,0.00022440455,0.00051862386,0.0015144309,0.00034083016,0.012759716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983266,0.0005627764,0.000088263965,0.00020670322,0.000474916,0.0003405952],"domain_scores_gemma":[0.9982811,0.00032292368,0.00020296159,0.00051703205,0.00039293157,0.00028310978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013696926,0.0006445905,0.00046209563,0.0011644623,0.001172742,0.0015055247,0.0014783047,0.0007986569,0.0042815963],"category_scores_gemma":[0.00347439,0.0002863606,0.00040164372,0.0005297877,0.00079988426,0.0036787011,0.0069000474,0.0007249142,0.002193212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017182818,0.00076992245,0.020180967,0.0017547404,0.00028962712,0.0032032095,0.00472493,0.058441054,0.03493528,0.16108844,0.13740811,0.5754854],"study_design_scores_gemma":[0.00016549342,0.0011791788,0.008285071,0.00022851597,0.00020298114,0.0013609639,0.0043858523,0.4427316,0.020620797,0.05655917,0.46399733,0.00028294488],"about_ca_topic_score_codex":0.0026960531,"about_ca_topic_score_gemma":0.004201775,"teacher_disagreement_score":0.0042815963,"about_ca_system_score_codex":0.0006056152,"about_ca_system_score_gemma":0.0008897684,"threshold_uncertainty_score":0.014323413},"labels":[],"label_agreement":null},{"id":"W2067247085","doi":"10.1016/j.disc.2014.10.001","title":"Forbidden minors for graphs with no first obstruction to parametric Feynman integration","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Feynman diagram; Mathematics; Combinatorics; Planar graph; Parametric statistics; Discrete mathematics; Feynman integral; Graph; Mathematical physics","score_opus":0.017260534697099403,"score_gpt":0.23521452140082533,"score_spread":0.21795398670372593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067247085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6171576,0.00020683554,0.32960957,0.0008661026,0.00019651662,0.00019138028,0.00043535337,0.00066231476,0.05067438],"genre_scores_gemma":[0.93712354,0.00015043265,0.040386647,0.00021390743,0.0000923614,0.0001959237,0.00042518854,0.0002464277,0.021165472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931955,0.00013428218,0.00004087832,0.00016708244,0.00015163593,0.00018659313],"domain_scores_gemma":[0.99732935,0.0011497348,0.0004735434,0.00037244995,0.00025077874,0.0004241271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007481285,0.0006759127,0.0007992519,0.0014166522,0.002390457,0.0023069265,0.0015926629,0.0013106894,0.0056935814],"category_scores_gemma":[0.003791616,0.0006925017,0.0011642283,0.0008310398,0.0020521658,0.0030829227,0.0021878215,0.0027322646,0.0008275282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009732618,0.00006229861,0.000468087,0.000033532855,0.000012443547,0.00019287737,0.000527319,0.0022463794,0.0029311962,0.9853131,0.0011718296,0.0069435993],"study_design_scores_gemma":[0.000026219102,0.000031346088,0.0003178546,0.0000110867995,0.000014107085,0.00019088495,0.0001698984,0.0130141275,0.001478149,0.9822817,0.0024470447,0.00001758336],"about_ca_topic_score_codex":0.0011885031,"about_ca_topic_score_gemma":0.0015120101,"teacher_disagreement_score":0.0056935814,"about_ca_system_score_codex":0.0011180264,"about_ca_system_score_gemma":0.0008375691,"threshold_uncertainty_score":0.019046962},"labels":[],"label_agreement":null},{"id":"W2068123891","doi":"10.1109/iciea.2013.6566678","title":"Stochastic modeling and analysis of opportunistic computing in intermittent mobile cloud","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Mobile cloud computing; Suite; Computer network; Mobile telephony; Mobile device; Mobile computing; Bandwidth (computing); Computation; Mobile radio; Operating system","score_opus":0.023203357400102095,"score_gpt":0.2491280395523237,"score_spread":0.2259246821522216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068123891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32057494,0.0017076922,0.65334,0.0045053996,0.00021779136,0.00016913441,0.0006244206,0.00033000784,0.018530654],"genre_scores_gemma":[0.98672974,0.0005592795,0.006657459,0.00015590806,0.00007657771,0.00010402101,0.00012182137,0.00004496417,0.0055501023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993106,0.00025093567,0.00002540766,0.000080413025,0.00013266403,0.00019995122],"domain_scores_gemma":[0.9953258,0.0029991393,0.000792306,0.00015391812,0.0004164067,0.0003124355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018492698,0.000778175,0.0009264567,0.00086548977,0.0006300756,0.0013334767,0.0015026691,0.0011578696,0.0018865858],"category_scores_gemma":[0.006634444,0.0005296142,0.0006700679,0.00071908603,0.0016225583,0.0013983313,0.0013140191,0.0011356766,0.00016678107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043723077,0.000025052464,0.0010976106,0.00004315759,0.000028721668,0.00017742856,0.00007835009,0.8707307,0.0006251334,0.12427877,0.0013848031,0.0014864953],"study_design_scores_gemma":[0.0000047692656,0.0000036075508,0.00011164955,0.000003392602,0.000002636417,0.000008465403,0.000015450167,0.9907436,0.000027034836,0.008923552,0.00015145491,0.000004410795],"about_ca_topic_score_codex":0.019651383,"about_ca_topic_score_gemma":0.009124956,"teacher_disagreement_score":0.019651383,"about_ca_system_score_codex":0.002170587,"about_ca_system_score_gemma":0.0013078998,"threshold_uncertainty_score":0.039074004},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04688086519037868,"score_gpt":0.28120159725573274,"score_spread":0.23432073206535406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069133175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013368997,0.0030636045,0.97561646,0.0018836566,0.000566269,0.00027119403,0.000043951997,0.00037810285,0.016839786],"genre_scores_gemma":[0.09923326,0.013218728,0.86124223,0.0015905371,0.0019924443,0.0014422574,0.00017734157,0.00023107699,0.020872114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972441,0.0010571054,0.00019164153,0.00033334448,0.0010236885,0.00015013927],"domain_scores_gemma":[0.99829036,0.0007544179,0.00014028893,0.00040954805,0.00022913194,0.00017626624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029205128,0.0012306694,0.0009023529,0.0019232113,0.001838751,0.0055829664,0.003503134,0.0025121015,0.0031885235],"category_scores_gemma":[0.002999083,0.000807571,0.00090757734,0.00220613,0.0048457887,0.007664946,0.0036155167,0.0035205248,0.0014026165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019720976,0.00004634238,0.0002004372,0.00027393096,0.000030195242,0.00024342998,0.00052339205,0.009591148,0.0017666648,0.9296491,0.0053485744,0.052306924],"study_design_scores_gemma":[0.000029296092,0.00010914964,0.00016257295,0.00016633225,0.000036532878,0.0007448433,0.00036336988,0.081165,0.001896477,0.6841455,0.23112623,0.000054629993],"about_ca_topic_score_codex":0.0010072576,"about_ca_topic_score_gemma":0.0016385114,"teacher_disagreement_score":0.0055829664,"about_ca_system_score_codex":0.0014228739,"about_ca_system_score_gemma":0.0016288179,"threshold_uncertainty_score":0.015445292},"labels":[],"label_agreement":null},{"id":"W2073320561","doi":"10.4304/jnw.7.7.1106-1115","title":"Routing Algorithm Based on Multi-Community Evolutionary Game for VANET","year":2012,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Vehicular ad hoc network; Evolutionary algorithm; Routing (electronic design automation); Algorithm; Artificial intelligence; Computer network; Wireless ad hoc network; Telecommunications; Wireless","score_opus":0.04919750498611805,"score_gpt":0.28233116607136716,"score_spread":0.2331336610852491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073320561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025848659,0.00018056584,0.9681664,0.00027481033,0.000050061335,0.00012935988,0.000042335032,0.00009220685,0.0052156057],"genre_scores_gemma":[0.7459576,0.00039546893,0.2478679,0.00015449981,0.000037696936,0.00046114193,0.00014119584,0.000034226923,0.004950271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999607,0.00015425502,0.000016959033,0.00006894015,0.00009441451,0.00005849],"domain_scores_gemma":[0.99963653,0.00018876715,0.00004352552,0.000016771877,0.0000726162,0.000041861953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005459863,0.0005905148,0.0007377709,0.0005664838,0.0006939291,0.0007274817,0.0014329951,0.00093260355,0.0015444388],"category_scores_gemma":[0.0016485237,0.00022288403,0.0005485705,0.00053626363,0.0005143591,0.00086788094,0.000931151,0.0006718254,0.00012451496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004181848,0.000047885947,0.00057251914,0.00005417791,0.000040150295,0.00014058485,0.00009375729,0.92732286,0.0016700543,0.04818122,0.0010750942,0.020759875],"study_design_scores_gemma":[0.000013626603,0.000019718993,0.00004469312,0.000002697109,0.000005158312,0.000034421704,0.000010330747,0.99350655,0.00010890844,0.0057805935,0.00046889455,0.000004465893],"about_ca_topic_score_codex":0.005189779,"about_ca_topic_score_gemma":0.0039017792,"teacher_disagreement_score":0.005189779,"about_ca_system_score_codex":0.0007933147,"about_ca_system_score_gemma":0.001024443,"threshold_uncertainty_score":0.010319114},"labels":[],"label_agreement":null},{"id":"W2074472335","doi":"10.1109/chinacom.2008.4684961","title":"A secure incentive scheme for delay tolerant networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Bundle; Network packet; Node (physics); Scheme (mathematics); Packet forwarding; Incentive; Path (computing); Wireless; Store and forward; Distributed computing; Delay-tolerant networking; Computer security; Routing protocol; Telecommunications; Optimized Link State Routing Protocol","score_opus":0.026452828780145283,"score_gpt":0.2311847958942792,"score_spread":0.2047319671141339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074472335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03390276,0.00034242772,0.9570943,0.0009763174,0.00025273635,0.0003309989,0.00013128555,0.00030819833,0.0066608596],"genre_scores_gemma":[0.8550234,0.00043283674,0.13606566,0.00023756217,0.00015490268,0.00034709676,0.00012729267,0.00003347304,0.0075777015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842405,0.00042908662,0.00012782488,0.00025193565,0.0005769736,0.00019010574],"domain_scores_gemma":[0.99734324,0.001060986,0.000405855,0.0005738267,0.00032991907,0.0002860818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022173433,0.0005281538,0.000678657,0.000594735,0.0011099147,0.0013034045,0.0017508151,0.0012419807,0.0028594164],"category_scores_gemma":[0.0059590572,0.0002955477,0.00048413879,0.00088335935,0.0012920174,0.00315616,0.0027067543,0.001793156,0.00048779222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006537452,0.00022167427,0.0008544247,0.0002468742,0.000049879018,0.00041368263,0.00048150253,0.10193653,0.019661617,0.7596735,0.005569201,0.11023734],"study_design_scores_gemma":[0.00033327003,0.00035705822,0.00031956352,0.000052482133,0.000050129933,0.0004999794,0.00007346639,0.7184564,0.007601724,0.24646544,0.02570752,0.000082913335],"about_ca_topic_score_codex":0.00064301543,"about_ca_topic_score_gemma":0.0004945929,"teacher_disagreement_score":0.0028594164,"about_ca_system_score_codex":0.001320974,"about_ca_system_score_gemma":0.0016852723,"threshold_uncertainty_score":0.011726558},"labels":[],"label_agreement":null},{"id":"W2075609395","doi":"10.5539/cis.v5n3p90","title":"Mobility Prediction in Dynamic Grids","year":2012,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mobility model; Key (lock); Mobility management; Task (project management); Grid; Track (disk drive); Distributed computing; Duration (music); Tracking (education); Real-time computing; Computer network; Computer security; Systems engineering","score_opus":0.0111051043011684,"score_gpt":0.23645813643997113,"score_spread":0.22535303213880273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075609395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10297022,0.0014746841,0.88634896,0.0014618962,0.0002503608,0.0000617104,0.0006831829,0.0012333539,0.0055155554],"genre_scores_gemma":[0.95545954,0.0010067703,0.04016363,0.00008990428,0.000094497926,0.000048414044,0.00058469677,0.000057865553,0.0024946076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996866,0.000074793825,0.000017220751,0.00009525275,0.000068764275,0.000057333953],"domain_scores_gemma":[0.9990651,0.00043574526,0.00014796048,0.00010743823,0.00017534988,0.00006851839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157583,0.00042523147,0.00053675607,0.0005310688,0.00058281363,0.0007823943,0.000973867,0.00059887336,0.0010646705],"category_scores_gemma":[0.0037394504,0.00033309453,0.00031885167,0.0008352236,0.0004981333,0.0013367395,0.0009829501,0.0007721054,0.00035208568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084887506,0.000017156932,0.0050558853,0.000037072263,0.000015431442,0.00011425456,0.000056966976,0.9474585,0.0007041295,0.015737055,0.0024193835,0.02829938],"study_design_scores_gemma":[0.000002702925,0.0000059813374,0.00028091262,0.000004229673,0.000002534866,0.000020962105,0.000016557613,0.99315953,0.00016177857,0.0056489757,0.00069186965,0.000003914689],"about_ca_topic_score_codex":0.016804198,"about_ca_topic_score_gemma":0.007974,"teacher_disagreement_score":0.016804198,"about_ca_system_score_codex":0.0008407712,"about_ca_system_score_gemma":0.0007854735,"threshold_uncertainty_score":0.033412755},"labels":[],"label_agreement":null},{"id":"W2079057834","doi":"10.1007/s11036-011-0346-y","title":"Advances in Green Mobile Networks","year":2011,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Enabling; Computer science; Macrocell; Backhaul (telecommunications); Telecommunications; Femtocell; Greenhouse gas; Efficient energy use; Energy consumption; Environmental economics; Cellular network; Wireless; Base station; Electrical engineering; Engineering","score_opus":0.013027315115277141,"score_gpt":0.2326066392989615,"score_spread":0.21957932418368437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079057834","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020870201,0.32662046,0.22061059,0.041138586,0.019958453,0.00010264813,0.00035715464,0.0009322873,0.36940968],"genre_scores_gemma":[0.34045538,0.3677199,0.08665409,0.008139583,0.009037756,0.00014833178,0.00058991584,0.00031494632,0.18694006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997073,0.000059595972,0.000009637189,0.000040501207,0.00013557197,0.00004732958],"domain_scores_gemma":[0.99930847,0.0002802998,0.000038254482,0.00009649836,0.0001934326,0.000083030805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009315046,0.00046251097,0.0004887338,0.0007795614,0.00050201576,0.0014763065,0.0008100769,0.0013671552,0.011119532],"category_scores_gemma":[0.0014363102,0.00015727182,0.00022375405,0.0013193752,0.0009124454,0.003031306,0.0014561504,0.0014715736,0.002793339],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005104723,0.00006680367,0.00042979873,0.00050105865,0.000015025458,0.00013799721,0.00014527628,0.007112577,0.0042368304,0.4888758,0.055205148,0.4432227],"study_design_scores_gemma":[0.000007343441,0.000037416045,0.00031452288,0.00019134984,0.000010408109,0.00015378075,0.0001207959,0.012689279,0.0014854204,0.14609322,0.83888304,0.0000134426855],"about_ca_topic_score_codex":0.0007338634,"about_ca_topic_score_gemma":0.0012663497,"teacher_disagreement_score":0.011119532,"about_ca_system_score_codex":0.00096199353,"about_ca_system_score_gemma":0.0009862032,"threshold_uncertainty_score":0.037198603},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Zoom; Heuristic; Computer network; TRACE (psycholinguistics); Global Positioning System; Distributed computing; Telecommunications; Engineering","score_opus":0.021962571855432163,"score_gpt":0.2369063184555737,"score_spread":0.21494374660014154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080843436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14258963,0.0007369865,0.85125154,0.00022064918,0.00008870966,0.00023042079,0.00011472244,0.0025620994,0.002205169],"genre_scores_gemma":[0.8606288,0.00022527245,0.13827547,0.0000621797,0.000024369921,0.00009736216,0.0001105497,0.000054635333,0.00052141224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997086,0.00007660543,0.000013375783,0.000055044693,0.00008376664,0.000062660045],"domain_scores_gemma":[0.9991722,0.00040510116,0.00009272168,0.00018573354,0.00008349875,0.000060829825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010066854,0.0006325271,0.0005779964,0.00081169186,0.0006478105,0.0004727902,0.0010916262,0.00048991153,0.00072714896],"category_scores_gemma":[0.0029431554,0.00025075415,0.00036897496,0.00050868763,0.0005359892,0.0010969082,0.0011550857,0.000345377,0.00014678777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002761116,0.0001745673,0.0052108816,0.00020069498,0.00009389428,0.000392123,0.0005220661,0.6654751,0.027986646,0.017713446,0.0047824513,0.27717215],"study_design_scores_gemma":[0.000030351135,0.00010991128,0.00051529,0.000010971905,0.000015374051,0.0001398587,0.000096607524,0.98758,0.003981205,0.0050794864,0.002422584,0.000018497944],"about_ca_topic_score_codex":0.0039721774,"about_ca_topic_score_gemma":0.0052026063,"teacher_disagreement_score":0.0039721774,"about_ca_system_score_codex":0.0005644404,"about_ca_system_score_gemma":0.0008734813,"threshold_uncertainty_score":0.007898092},"labels":[],"label_agreement":null},{"id":"W2081191867","doi":"10.1145/1364654.1364671","title":"Fair and efficient scheduling in data ferrying networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Digital subscriber line; Scheduling (production processes); The Internet; Distributed computing","score_opus":0.045701097166000064,"score_gpt":0.28133464404327646,"score_spread":0.2356335468772764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081191867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076692134,0.00057536503,0.9175375,0.00034321132,0.00008346723,0.00015306886,0.00015535159,0.0004277438,0.004032147],"genre_scores_gemma":[0.872493,0.00034260057,0.12403036,0.00007228793,0.00008301679,0.00013739282,0.00010532124,0.00007496374,0.0026610014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802125,0.0007014944,0.00008725408,0.00033207017,0.00045338811,0.00040457494],"domain_scores_gemma":[0.99560034,0.0026201033,0.00048663918,0.0006429062,0.0003894857,0.00026053487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044378443,0.00070410967,0.0009397057,0.0008181051,0.0011851512,0.0016041878,0.002459647,0.00073700526,0.0012713755],"category_scores_gemma":[0.008458806,0.00044384273,0.00029558688,0.0013727235,0.0016081379,0.002516226,0.0014301479,0.0008199423,0.0002085955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031153747,0.000076423705,0.0005172978,0.00008254323,0.000020798527,0.000066337685,0.00017344832,0.8657118,0.0026792458,0.09789808,0.0016156774,0.030846814],"study_design_scores_gemma":[0.000041093706,0.0000427212,0.00011115838,0.0000058397773,0.00000555857,0.000017013248,0.000031516236,0.9562451,0.0009804595,0.04102853,0.001481422,0.000009481227],"about_ca_topic_score_codex":0.0068551507,"about_ca_topic_score_gemma":0.005571552,"teacher_disagreement_score":0.0068551507,"about_ca_system_score_codex":0.0033720871,"about_ca_system_score_gemma":0.0026569662,"threshold_uncertainty_score":0.024466336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023286434116356978,"score_gpt":0.21662416583012437,"score_spread":0.1933377317137674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081531839","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010108407,0.00088237243,0.9833346,0.00028242663,0.00042230196,0.00012750001,0.00008436161,0.0006175134,0.0041404683],"genre_scores_gemma":[0.7156549,0.0021646104,0.27236336,0.00039946765,0.0004640197,0.00045205932,0.00039339587,0.000109414636,0.007998788],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994355,0.00014915192,0.000048566464,0.0001053255,0.00021313905,0.000048206348],"domain_scores_gemma":[0.9992611,0.0002574056,0.00009950652,0.000108440196,0.00021132898,0.000062222156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006070458,0.00042975976,0.00048348485,0.0005792232,0.00060626754,0.00087793113,0.0012364491,0.00046145977,0.0017351867],"category_scores_gemma":[0.0014708717,0.00013239031,0.00021552487,0.00096201454,0.00069486146,0.0011080867,0.00090404606,0.00066225644,0.0004209099],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074549264,0.00011837163,0.0011740326,0.0008127247,0.00008649631,0.00040777173,0.0003438078,0.28163707,0.04548696,0.29108283,0.012621781,0.36548263],"study_design_scores_gemma":[0.00023016894,0.0003728607,0.00027248182,0.000067330555,0.00009094806,0.00039371985,0.00014666595,0.8191164,0.03271965,0.049583167,0.09693911,0.00006752352],"about_ca_topic_score_codex":0.0012355761,"about_ca_topic_score_gemma":0.0011974479,"teacher_disagreement_score":0.0017351867,"about_ca_system_score_codex":0.00069348013,"about_ca_system_score_gemma":0.0010251851,"threshold_uncertainty_score":0.005804777},"labels":[],"label_agreement":null},{"id":"W2081585988","doi":"10.1109/milcom.2012.6415788","title":"Cross-layer modeling and analysis of multihop tactical networking in convoy topology","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer network; Computer science; Robustness (evolution); Network topology; Narrowband; Wireless network; Wireless; Throughput; Distributed computing; Topology (electrical circuits); Radio networks; Telecommunications; Engineering; Electrical engineering","score_opus":0.059143179019864996,"score_gpt":0.3274053475443023,"score_spread":0.2682621685244373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081585988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11509083,0.000543643,0.87391317,0.00021439446,0.000036244677,0.000028050219,0.000050749244,0.00015464787,0.009968268],"genre_scores_gemma":[0.9634048,0.00043060508,0.031779796,0.00006191362,0.00002674436,0.00004682077,0.00007186942,0.000055843255,0.0041216803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981314,0.000052068353,0.000005705959,0.000026989066,0.000068193345,0.000033987024],"domain_scores_gemma":[0.99972755,0.0001236959,0.000055622833,0.000026773117,0.000052500418,0.000013718442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005199002,0.00050799694,0.00031225066,0.00036430274,0.00030861862,0.00076566724,0.0009178761,0.0006480538,0.00086883904],"category_scores_gemma":[0.001118769,0.0002495521,0.00033259444,0.00029028094,0.00047258925,0.0012664926,0.0005835907,0.00051808613,0.00017701836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010562647,0.0000097940565,0.00026230345,0.000009373867,0.000008178022,0.00004445196,0.000024035831,0.9814559,0.0016431698,0.014650114,0.00012405934,0.0017580336],"study_design_scores_gemma":[6.2745636e-7,0.0000038452827,0.00005201995,7.359828e-7,0.0000010626916,0.00000681606,0.000004641469,0.9983266,0.00012640469,0.0013565841,0.0001193205,0.000001338875],"about_ca_topic_score_codex":0.0053157643,"about_ca_topic_score_gemma":0.002485645,"teacher_disagreement_score":0.0053157643,"about_ca_system_score_codex":0.00074112124,"about_ca_system_score_gemma":0.00037099124,"threshold_uncertainty_score":0.010569632},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008655094280764433,"score_gpt":0.21330671787548755,"score_spread":0.2046516235947231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083626523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16761702,0.0014684953,0.80798274,0.0008314128,0.0004233776,0.00046910223,0.00069555704,0.0041679647,0.016344361],"genre_scores_gemma":[0.88596874,0.0007306411,0.10395227,0.00014028979,0.000055935234,0.00018874813,0.00073319516,0.00013111609,0.008099061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998425,0.000037442347,0.000008638488,0.000030218389,0.000040253566,0.000040863804],"domain_scores_gemma":[0.9997173,0.00003279045,0.000053945198,0.000078549325,0.000060609196,0.000056737656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037813687,0.0003978583,0.00046617945,0.00076036516,0.000847225,0.0007516963,0.0011424463,0.0004691974,0.0015413403],"category_scores_gemma":[0.00073393504,0.00023193572,0.00023681964,0.0008000851,0.00044427827,0.00097162375,0.0016209587,0.00043876586,0.00048352493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014563511,0.0003074438,0.004818548,0.00041058863,0.00013246672,0.00062671624,0.00079254736,0.2713594,0.07041049,0.13509855,0.024796834,0.4897901],"study_design_scores_gemma":[0.00019158037,0.00050803705,0.002229906,0.00007086973,0.000063248306,0.00055903185,0.00043078465,0.84431636,0.029369868,0.02019538,0.10198379,0.00008108945],"about_ca_topic_score_codex":0.005904203,"about_ca_topic_score_gemma":0.009965521,"teacher_disagreement_score":0.005904203,"about_ca_system_score_codex":0.0006620166,"about_ca_system_score_gemma":0.0009194994,"threshold_uncertainty_score":0.011739671},"labels":[],"label_agreement":null},{"id":"W2083985819","doi":"10.1145/2616973","title":"A Taxonomy and Survey of Microscopic Mobility Models from the Mobile Networking Domain","year":2014,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Taxonomy (biology); Field (mathematics); Domain (mathematical analysis); Data science; Artificial intelligence","score_opus":0.1271266380728229,"score_gpt":0.31636877448488837,"score_spread":0.18924213641206547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083985819","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043007364,0.70207644,0.21671632,0.009248566,0.0018327179,0.00031409814,0.0007056807,0.0005896883,0.06421581],"genre_scores_gemma":[0.033953622,0.89102495,0.061683144,0.0015970289,0.0015838294,0.00044760047,0.0011795849,0.00013611575,0.00839413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987625,0.00026036424,0.00012458088,0.00017310865,0.0005884451,0.00009110292],"domain_scores_gemma":[0.9974221,0.0013538146,0.00022965932,0.00023182882,0.00067032845,0.00009217679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020516524,0.0015076194,0.0014092088,0.007187146,0.001044365,0.003208099,0.003088288,0.0023289532,0.0032754024],"category_scores_gemma":[0.0053485907,0.00090036896,0.0010655563,0.008965964,0.0015678968,0.0071050455,0.0019070966,0.0027807928,0.0020474019],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027434207,0.00014127207,0.0016566442,0.006527061,0.000061459585,0.00026245834,0.00054744596,0.016666446,0.0010189204,0.47583148,0.037892926,0.45936638],"study_design_scores_gemma":[0.0000073325787,0.00010811089,0.0009839211,0.0031968935,0.0000519601,0.0011840364,0.00041685847,0.016720364,0.00070473226,0.1569168,0.8196112,0.00009787612],"about_ca_topic_score_codex":0.0038850114,"about_ca_topic_score_gemma":0.0027031037,"teacher_disagreement_score":0.007187146,"about_ca_system_score_codex":0.002360616,"about_ca_system_score_gemma":0.0027234356,"threshold_uncertainty_score":0.017127514},"labels":[],"label_agreement":null},{"id":"W2086978409","doi":"10.1155/2013/358267","title":"Improvement and Performance Evaluation for Multimedia Files Transmission in Vehicle-Based DTNs","year":2013,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; File sharing; Computer network; The Internet; Vehicular ad hoc network; Peer-to-peer; Mobile device; Transmission (telecommunications); Wireless network; Wireless; Wireless ad hoc network; Telecommunications; Operating system","score_opus":0.01679543881795787,"score_gpt":0.25624279721376814,"score_spread":0.23944735839581027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086978409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9281907,0.0028180026,0.061845537,0.00027132104,0.00015745327,0.00016480514,0.00026299496,0.0009360679,0.0053532342],"genre_scores_gemma":[0.9925426,0.00037069735,0.006501277,0.000013008761,0.000012117164,0.000024154251,0.0001352263,0.000013253083,0.00038770653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985014,0.0004346629,0.00010632822,0.0001864489,0.0005223327,0.0002488541],"domain_scores_gemma":[0.9944559,0.0030451375,0.00044436697,0.00037521689,0.0014496945,0.00022980325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972975,0.0006458508,0.0006620705,0.001529693,0.00084628747,0.00065570755,0.0009364969,0.0005907704,0.00096224324],"category_scores_gemma":[0.0071182973,0.000117248936,0.0002808711,0.0012330725,0.00043975993,0.0015096227,0.00052980304,0.00032707187,0.00015591366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002507275,0.00065928843,0.01689739,0.0008265036,0.00019190549,0.00062506733,0.0003533657,0.71907985,0.048456147,0.004884713,0.002628846,0.20288967],"study_design_scores_gemma":[0.000031995,0.0010271741,0.0032668053,0.000014662008,0.000065379325,0.0002924319,0.00020879028,0.9716275,0.022279508,0.00052956224,0.000622802,0.000033383],"about_ca_topic_score_codex":0.006067403,"about_ca_topic_score_gemma":0.0036531305,"teacher_disagreement_score":0.006067403,"about_ca_system_score_codex":0.0019637444,"about_ca_system_score_gemma":0.000635069,"threshold_uncertainty_score":0.014248073},"labels":[],"label_agreement":null},{"id":"W2087187917","doi":"10.1109/sysose.2007.4304257","title":"WiFi repeater deployment for improved communication in confined-space urban disaster search","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Repeater (horology); Search and rescue; USable; Urban search and rescue; Radio repeater; Software deployment; Computer science; Space (punctuation); Rescue robot; Wireless; Confined space; Computer security; Disaster area; Disaster response; Emergency management; Robot; Telecommunications; World Wide Web; Mobile robot; Geography; Artificial intelligence","score_opus":0.027479552242441852,"score_gpt":0.2782380809129906,"score_spread":0.25075852867054876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087187917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98094696,0.00006914419,0.018044349,0.00002652187,0.0000050933454,0.000014412363,0.000021821103,0.00010634001,0.00076525426],"genre_scores_gemma":[0.9944423,0.00002870772,0.005134859,0.000008340754,0.0000017816913,0.000009555438,0.000012397158,0.0000034789437,0.00035866196],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998534,0.0000504316,0.0000058950645,0.000023088303,0.000028294853,0.000039037437],"domain_scores_gemma":[0.9994789,0.00023869179,0.00010573758,0.0000634424,0.000074367235,0.00003897893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019042859,0.00018812233,0.00021760169,0.0002538014,0.00021032883,0.000193164,0.0004202436,0.00035358436,0.0008622027],"category_scores_gemma":[0.00087183947,0.00010394239,0.00012614901,0.00020808062,0.00018492962,0.00040519642,0.0003590454,0.00011614063,0.0001574334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020082032,0.00057866675,0.028749675,0.00026275843,0.00009112192,0.0015068594,0.00061417534,0.15836883,0.67656755,0.0020449583,0.0008192132,0.12838802],"study_design_scores_gemma":[0.00019052978,0.0074180206,0.050339192,0.000033301552,0.00015138136,0.002268901,0.00104311,0.47922745,0.45180658,0.0013064422,0.00611348,0.00010165097],"about_ca_topic_score_codex":0.00096884876,"about_ca_topic_score_gemma":0.0023596147,"teacher_disagreement_score":0.00096884876,"about_ca_system_score_codex":0.00013432406,"about_ca_system_score_gemma":0.00013371384,"threshold_uncertainty_score":0.002884388},"labels":[],"label_agreement":null},{"id":"W2088660813","doi":"10.1109/wimob.2014.6962213","title":"Opportunistic networks: Minimizing expected latency","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Latency (audio); Computer network; Distributed computing; Mathematical proof; Mobile telephony; Routing protocol; Class (philosophy); Routing (electronic design automation); Mobile radio; Telecommunications","score_opus":0.01241695894718412,"score_gpt":0.20309326254307833,"score_spread":0.19067630359589421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088660813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045777425,0.0010542321,0.943194,0.00048438634,0.00009122482,0.00015729216,0.00015169704,0.00039438324,0.008695392],"genre_scores_gemma":[0.89856666,0.0011241336,0.0939522,0.00014697379,0.00009509653,0.00025727734,0.00010468522,0.00011878546,0.005634202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991652,0.00024092107,0.00003523095,0.00014178817,0.00025524184,0.00016161523],"domain_scores_gemma":[0.99690527,0.0020766698,0.00037849927,0.00023761558,0.000268116,0.00013388545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011421231,0.00080788694,0.0006978469,0.00066737167,0.0008087449,0.0011185565,0.0015406492,0.00073013623,0.0017523409],"category_scores_gemma":[0.0062459125,0.00033262267,0.0003003482,0.00092985306,0.0008196282,0.0016513277,0.0012649171,0.0006076122,0.00023042892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016895679,0.00006647066,0.00063245633,0.00019436517,0.000039417097,0.00017498412,0.0001334673,0.84868234,0.0074988245,0.08789629,0.002778401,0.051734094],"study_design_scores_gemma":[0.000033978955,0.00009429772,0.00020763383,0.000018227196,0.000020997668,0.00012769473,0.00005768049,0.93775,0.002305915,0.056405872,0.0029583457,0.00001931472],"about_ca_topic_score_codex":0.0027278105,"about_ca_topic_score_gemma":0.0029426378,"teacher_disagreement_score":0.0027278105,"about_ca_system_score_codex":0.001484567,"about_ca_system_score_gemma":0.0018561815,"threshold_uncertainty_score":0.010771394},"labels":[],"label_agreement":null},{"id":"W2090322550","doi":"10.1007/s00779-009-0230-y","title":"Special issue on “Intelligent systems and services for ubiquitous computing”","year":2009,"lang":"en","type":"article","venue":"Personal and Ubiquitous Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Ubiquitous computing; Context-aware pervasive systems; Mobile computing; Middleware (distributed applications); Intelligent Network; Intelligent transportation system; Distributed computing; Smart environment; End-user computing; Intelligent decision support system; Computer network; Cloud computing; Computer security; Utility computing; Internet of Things; Human–computer interaction; Artificial intelligence; Cloud computing security","score_opus":0.020036531500422273,"score_gpt":0.25771603762171114,"score_spread":0.23767950612128885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090322550","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046138803,0.015969357,0.0020382851,0.01747859,0.90601575,0.00014345595,0.0003799836,0.00025048738,0.057262655],"genre_scores_gemma":[0.0029025322,0.02214491,0.00080485066,0.008018445,0.7344367,0.00016667934,0.0011595644,0.00033965491,0.23002672],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980519,0.00024482192,0.00019970219,0.00032917227,0.00093796337,0.00023643771],"domain_scores_gemma":[0.9942983,0.0011876528,0.0003745654,0.00042787174,0.0025574937,0.0011541921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022854512,0.0030393389,0.003998567,0.0056599216,0.0024637382,0.0071470034,0.0028915985,0.0052164104,0.11558734],"category_scores_gemma":[0.005330696,0.0006681523,0.0019233659,0.0034998746,0.0010154702,0.0047417283,0.0027314723,0.0033483622,0.051494688],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054024407,0.00003780449,0.00013245117,0.00034405434,0.000022898816,0.00011838666,0.000012932514,0.000089945286,0.00036535348,0.0020950004,0.9714301,0.025296945],"study_design_scores_gemma":[0.00001396071,0.000049901577,0.0005395071,0.00012645891,0.000030447865,0.00017852709,0.000020414396,0.00028631138,0.00017307118,0.0014047936,0.99716455,0.000011913723],"about_ca_topic_score_codex":0.0011557307,"about_ca_topic_score_gemma":0.003061795,"teacher_disagreement_score":0.11558734,"about_ca_system_score_codex":0.0016545416,"about_ca_system_score_gemma":0.0019496648,"threshold_uncertainty_score":0.38667816},"labels":[],"label_agreement":null},{"id":"W2091788990","doi":"10.1145/2069000.2069012","title":"Towards end-to-end routing for periodic mobile objects","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Flooding (psychology); Dijkstra's algorithm; Shortest path problem; Routing (electronic design automation); Path (computing); Base station; Computer network; Graph; Distributed computing; Domain (mathematical analysis); Real-time computing; Theoretical computer science; Mathematics","score_opus":0.04428165183777826,"score_gpt":0.25715057477866043,"score_spread":0.21286892294088217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091788990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011468586,0.0005314535,0.98494613,0.0005111677,0.000064089945,0.000058306825,0.000049376973,0.00041041724,0.00196042],"genre_scores_gemma":[0.18270317,0.0013272282,0.81031823,0.00017267688,0.00008158981,0.00011309651,0.00035612655,0.000111494424,0.004816396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943835,0.00014715087,0.00004661464,0.000099134275,0.00020160613,0.000067119836],"domain_scores_gemma":[0.9990945,0.00037547716,0.00010147387,0.00023397055,0.00013516919,0.000059484006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011866614,0.0004870317,0.0005218566,0.000717659,0.00079487317,0.0015452544,0.0018216937,0.001369523,0.0015777008],"category_scores_gemma":[0.002674532,0.0004574849,0.00042338035,0.00087809894,0.00069138996,0.0029661972,0.0014343514,0.0011335247,0.0005776663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000343705,0.00021173093,0.001416278,0.00048302626,0.000086983906,0.00053306675,0.0007014993,0.41649622,0.02867319,0.26544547,0.012498056,0.27311072],"study_design_scores_gemma":[0.000031476782,0.00012525,0.00036545497,0.000046179048,0.000017929047,0.0002620576,0.0002115089,0.8483736,0.004160431,0.12346361,0.02291732,0.000025075478],"about_ca_topic_score_codex":0.0014419917,"about_ca_topic_score_gemma":0.0022269725,"teacher_disagreement_score":0.0018216937,"about_ca_system_score_codex":0.00064753677,"about_ca_system_score_gemma":0.00055757014,"threshold_uncertainty_score":0.0062757134},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Greedy algorithm; Bootstrapping (finance); Routing (electronic design automation); Simple (philosophy); Task (project management); Computer network; Wireless; Distributed computing; Process (computing); Algorithm; Telecommunications; Mathematics; Engineering","score_opus":0.017999081001453403,"score_gpt":0.2544887901985314,"score_spread":0.23648970919707799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095068881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020845868,0.0005429502,0.9525363,0.0010147461,0.00028576126,0.0004543548,0.0005294232,0.001405496,0.022385173],"genre_scores_gemma":[0.4310822,0.00074888516,0.54186094,0.00078401214,0.00019898247,0.0007995966,0.0013409515,0.00036073878,0.022823688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988576,0.00034856665,0.000059155176,0.00028987616,0.00029550184,0.00014923124],"domain_scores_gemma":[0.9981014,0.0007904276,0.00019537269,0.00044309083,0.00032264236,0.00014703255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917164,0.0011419931,0.0009855466,0.0011490362,0.0017331245,0.0014440365,0.0023020282,0.0014170685,0.0073689534],"category_scores_gemma":[0.0048970752,0.00038516606,0.00080340734,0.0012656593,0.0011056403,0.002367072,0.002155972,0.00076256454,0.0022709374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044370038,0.00028756046,0.0028054777,0.0005945722,0.00021209184,0.00032435896,0.00042459831,0.29241174,0.00926815,0.27228928,0.04306456,0.37787387],"study_design_scores_gemma":[0.00011126384,0.00024374,0.00067386945,0.000056496006,0.00007633259,0.00047508688,0.00026801406,0.7299841,0.0045521804,0.22485149,0.038657837,0.000049545095],"about_ca_topic_score_codex":0.0019627018,"about_ca_topic_score_gemma":0.0040330775,"teacher_disagreement_score":0.0073689534,"about_ca_system_score_codex":0.0014105438,"about_ca_system_score_gemma":0.0021339576,"threshold_uncertainty_score":0.024651587},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Vehicular ad hoc network; Dependency (UML); Markov chain; Markov process; Global Positioning System; Telecommunications; Wireless ad hoc network; Wireless; Artificial intelligence","score_opus":0.06883326845337219,"score_gpt":0.2446719291994073,"score_spread":0.1758386607460351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097147215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40496686,0.00041580727,0.59158057,0.00031989184,0.000026227899,0.00007598492,0.00031714462,0.00021508179,0.0020823644],"genre_scores_gemma":[0.98893625,0.00018864035,0.010347764,0.000020509578,0.000010975976,0.000031114603,0.0001475593,0.000011699008,0.00030558996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950314,0.0001564981,0.000028277553,0.00009643013,0.000119287055,0.000096371106],"domain_scores_gemma":[0.99526703,0.0032632719,0.00082693715,0.00030543265,0.00022662053,0.00011070586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012796621,0.00041893384,0.0004916677,0.001241872,0.00063850643,0.0006444044,0.00095413515,0.00044526067,0.00045337106],"category_scores_gemma":[0.007830056,0.00053793075,0.00056879973,0.001070952,0.00082995807,0.0010347486,0.0007068373,0.00042567917,0.00006507271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059823655,0.000030430905,0.009765385,0.000049802347,0.000059693608,0.00024260073,0.00015690108,0.95530874,0.001924855,0.022400005,0.0003096186,0.009692103],"study_design_scores_gemma":[0.000002872489,0.00000917408,0.0009088601,0.0000034071886,0.000011101877,0.000043486754,0.000025089024,0.9898245,0.0002934985,0.008621188,0.00025045,0.0000063436623],"about_ca_topic_score_codex":0.010096928,"about_ca_topic_score_gemma":0.013785565,"teacher_disagreement_score":0.010096928,"about_ca_system_score_codex":0.0012523994,"about_ca_system_score_gemma":0.0011957859,"threshold_uncertainty_score":0.020076334},"labels":[],"label_agreement":null},{"id":"W2097477280","doi":"10.1145/1454630.1454658","title":"RealMobiSim","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Credibility; Computer science; Component (thermodynamics); Interpretation (philosophy); Field (mathematics); Generator (circuit theory); Mobility model; Mobile computing; Simulation software; Distributed computing; Software; Human–computer interaction; Computer network; Operating system; Programming language","score_opus":0.03282046896258906,"score_gpt":0.21357562941532804,"score_spread":0.18075516045273898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097477280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046926744,0.00096515764,0.5605118,0.001785261,0.0008153438,0.0012152358,0.021313403,0.2069625,0.15950447],"genre_scores_gemma":[0.40654504,0.0019767857,0.46735442,0.0009986759,0.00013410507,0.0022011066,0.03203836,0.021622285,0.06712915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995772,0.00011282048,0.000035630277,0.00004853325,0.00016670559,0.00005910235],"domain_scores_gemma":[0.9986998,0.00062707294,0.00007293115,0.00020842416,0.00024841673,0.00014322884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086026266,0.0005976742,0.0005994344,0.0006236747,0.00045025037,0.0009986607,0.001999948,0.00093589345,0.041752554],"category_scores_gemma":[0.0032668605,0.00043521862,0.00067188166,0.0005355199,0.00043758945,0.0010417307,0.0012953281,0.0015250592,0.007137404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013151558,0.0005610633,0.0075578885,0.0018208058,0.00028118852,0.00071348675,0.0009252818,0.33217186,0.017006347,0.13223162,0.29043388,0.21498148],"study_design_scores_gemma":[0.00027480404,0.00012811467,0.00080349576,0.000115410854,0.000052094412,0.000253717,0.00008480534,0.6025507,0.012227975,0.017813744,0.36563286,0.000062190054],"about_ca_topic_score_codex":0.0034440479,"about_ca_topic_score_gemma":0.0030791482,"teacher_disagreement_score":0.041752554,"about_ca_system_score_codex":0.00050304015,"about_ca_system_score_gemma":0.0013894923,"threshold_uncertainty_score":0.13967621},"labels":[],"label_agreement":null},{"id":"W2097531318","doi":"10.1109/ccnc08.2007.92","title":"Prototypes of Opportunistic Wireless Mesh Networks Supporting Real-Time Services","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless mesh network; Computer network; Computer science; Municipal wireless network; Order One Network Protocol; Service set; Mesh networking; Wireless network; Broadband; Wireless broadband; Wireless; Software deployment; Wireless WAN; Reuse; Broadband networks; Telecommunications; Wi-Fi array; Engineering","score_opus":0.018436094511125267,"score_gpt":0.24054471806099187,"score_spread":0.2221086235498666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097531318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54219025,0.00063036126,0.40506697,0.00077076745,0.0007443283,0.0010062812,0.0004782553,0.0010832661,0.0480295],"genre_scores_gemma":[0.871732,0.00029505583,0.119386554,0.00006518293,0.000029602326,0.0004489399,0.00020409442,0.000021621243,0.007816979],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977463,0.00005637666,0.000007688954,0.000028047963,0.00009062667,0.000042653337],"domain_scores_gemma":[0.9995246,0.00015888082,0.00004662934,0.000082751656,0.00011694609,0.00007033042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003981089,0.00028729913,0.00015518066,0.000161796,0.0002447914,0.000396751,0.0010058652,0.00046711694,0.001763876],"category_scores_gemma":[0.0010901614,0.00014120291,0.00015498798,0.000109230125,0.00033949965,0.000691272,0.00037317968,0.00049580075,0.00021678286],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012122714,0.0008641463,0.0028950342,0.000807793,0.000086871274,0.0015640253,0.00065874204,0.07312237,0.5863583,0.20212413,0.0065624057,0.1237439],"study_design_scores_gemma":[0.000437204,0.0063105817,0.0041429563,0.0001067557,0.00009890403,0.0019361966,0.00041428237,0.41847467,0.40634075,0.041615557,0.11998822,0.00013379876],"about_ca_topic_score_codex":0.00047342514,"about_ca_topic_score_gemma":0.0004320238,"teacher_disagreement_score":0.001763876,"about_ca_system_score_codex":0.0003041339,"about_ca_system_score_gemma":0.00037278642,"threshold_uncertainty_score":0.0059007406},"labels":[],"label_agreement":null},{"id":"W2097745563","doi":"10.1109/iscc.2011.5984032","title":"SocioSpace: An adaptive service-oriented architecture that integrates smart spaces and social networks through the IP multimedia subsystem","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Interfacing; Context (archaeology); Service (business); Smart environment; Multimedia; Architecture; World Wide Web; Reliability (semiconductor); IP Multimedia Subsystem; Social network (sociolinguistics); Human–computer interaction; Computer network; Social media; Quality of service; Internet of Things","score_opus":0.051462643428986286,"score_gpt":0.23729154628982696,"score_spread":0.18582890286084067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097745563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108738735,0.0005040794,0.85823995,0.0012481308,0.00019095236,0.00034370538,0.00016116232,0.010272149,0.020301163],"genre_scores_gemma":[0.73355925,0.00039864794,0.25115347,0.0004951406,0.00008855046,0.00029097282,0.00035671107,0.000261435,0.013395835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997392,0.00006793465,0.000014559266,0.00004887296,0.00008543616,0.000043940323],"domain_scores_gemma":[0.9996886,0.000048998074,0.000034627075,0.000060593935,0.00006618454,0.00010097261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512147,0.00034131293,0.0002734921,0.00051380217,0.00078298536,0.0014681597,0.0010233984,0.0006948512,0.0019535571],"category_scores_gemma":[0.00066580065,0.00020716205,0.00030277474,0.00034889768,0.0009290299,0.0023980732,0.0017354542,0.00061946246,0.00071986456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074197055,0.0007320357,0.011264657,0.0004451528,0.00019960936,0.001379359,0.003456163,0.05992615,0.12082563,0.28783044,0.030453969,0.48274484],"study_design_scores_gemma":[0.000119972705,0.0006093559,0.004355049,0.00009306621,0.00014436278,0.0010490789,0.00132052,0.6009341,0.041526407,0.09049148,0.2592104,0.00014630164],"about_ca_topic_score_codex":0.0029074787,"about_ca_topic_score_gemma":0.0037242572,"teacher_disagreement_score":0.0029074787,"about_ca_system_score_codex":0.00069365103,"about_ca_system_score_gemma":0.0011051508,"threshold_uncertainty_score":0.0065353513},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disconnection; Computer science; Computer network; Computer security; Context (archaeology); Authentication (law); Cryptography; Identity (music)","score_opus":0.041135850573303274,"score_gpt":0.3159793536108287,"score_spread":0.2748435030375254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099217666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061543286,0.001907285,0.9007874,0.0050743464,0.00026097326,0.0001675564,0.00008969794,0.0005151766,0.029654274],"genre_scores_gemma":[0.8409799,0.0014054008,0.14728945,0.0005653401,0.00021814727,0.0002602285,0.00018597976,0.000066856555,0.009028731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715984,0.0011037788,0.00018292187,0.00041267276,0.000873844,0.00026692756],"domain_scores_gemma":[0.993447,0.002620457,0.00062767655,0.002406153,0.00063136156,0.00026730954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031672674,0.00067681517,0.00050044555,0.000666419,0.0019730502,0.0024210624,0.0012436161,0.0019752176,0.003569605],"category_scores_gemma":[0.009623467,0.00044990925,0.00052085845,0.00064134545,0.002935947,0.006634193,0.0061700265,0.0028348109,0.0011072689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002576549,0.000040006074,0.0007840088,0.00020084469,0.00002696357,0.00022874531,0.00067405455,0.028521897,0.009459519,0.89481664,0.0047934875,0.060196277],"study_design_scores_gemma":[0.000100648576,0.00013929774,0.00027306384,0.00012044161,0.000033236178,0.0006687478,0.00035505346,0.1546208,0.008321051,0.7886554,0.04667799,0.00003420681],"about_ca_topic_score_codex":0.00041365135,"about_ca_topic_score_gemma":0.00028033255,"teacher_disagreement_score":0.003569605,"about_ca_system_score_codex":0.001607987,"about_ca_system_score_gemma":0.001424781,"threshold_uncertainty_score":0.016750336},"labels":[],"label_agreement":null},{"id":"W2099489764","doi":"10.1007/s12652-011-0053-3","title":"Ambient networks and services","year":2011,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computational intelligence; Computer science; Ambient intelligence; Artificial intelligence","score_opus":0.044882048159851716,"score_gpt":0.24767361074401145,"score_spread":0.20279156258415973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099489764","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02008245,0.0639855,0.26355666,0.04921376,0.0065640872,0.000112103604,0.0006093262,0.000795172,0.595081],"genre_scores_gemma":[0.6610894,0.063547105,0.05365497,0.0040959516,0.0056637046,0.0002713228,0.0009451541,0.0003315941,0.21040072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991585,0.0002103356,0.000051942836,0.00017644814,0.00031124058,0.00009156278],"domain_scores_gemma":[0.9991161,0.00032726742,0.00006228051,0.00022829938,0.00015111513,0.00011481892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000967102,0.0006035097,0.0005665357,0.0010982356,0.0014138308,0.008860118,0.0008753425,0.0023628946,0.011532824],"category_scores_gemma":[0.002768504,0.00042873537,0.00038952252,0.0019116037,0.003769867,0.01022297,0.0030051072,0.0024648025,0.0018431118],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064233277,0.00000899387,0.00010668591,0.00003710568,0.000004811983,0.00003659673,0.00016903158,0.0007690166,0.00014937698,0.9759168,0.007539236,0.015255898],"study_design_scores_gemma":[0.000004765376,0.000009818518,0.00019518328,0.00007138939,0.000010750284,0.00016647326,0.0003265203,0.0042273486,0.00015225903,0.7213799,0.27344608,0.000009515671],"about_ca_topic_score_codex":0.0031731261,"about_ca_topic_score_gemma":0.003288119,"teacher_disagreement_score":0.011532824,"about_ca_system_score_codex":0.0018380353,"about_ca_system_score_gemma":0.0012116544,"threshold_uncertainty_score":0.038581133},"labels":[],"label_agreement":null},{"id":"W2100130157","doi":"10.1109/iecon.2007.4460410","title":"Opportunistic Communication for eNetworks Cyberengineering","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Wireless sensor network; Context (archaeology); Ubiquitous computing; Interdependence; Architecture; Wireless; Proof of concept; Code (set theory); Distributed computing; Software engineering; Human–computer interaction; Computer network; Telecommunications","score_opus":0.019974439630293373,"score_gpt":0.2550144520488549,"score_spread":0.23504001241856154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100130157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03487681,0.0006664883,0.9161988,0.002632465,0.00020204666,0.000070673,0.00003892927,0.00042130184,0.044892557],"genre_scores_gemma":[0.814233,0.00066694507,0.167745,0.0004237889,0.0001227365,0.00022313884,0.000046970283,0.000065618464,0.016472807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996493,0.00013989086,0.000015322048,0.000058512112,0.000103093196,0.000033902343],"domain_scores_gemma":[0.998818,0.00060460356,0.00009958445,0.00027329748,0.00010822601,0.00009628227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008050374,0.00032406737,0.00019572525,0.00023807252,0.0007484198,0.0013259801,0.0007000573,0.00078722095,0.0034493217],"category_scores_gemma":[0.0020991936,0.00014640867,0.00018350335,0.00016353704,0.001213885,0.0022450609,0.002034423,0.0010087624,0.00030592352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004338112,0.00003561243,0.00045679344,0.000076510936,0.000010998002,0.00017766879,0.00027475035,0.0375068,0.0048056454,0.9026154,0.0023382036,0.05165824],"study_design_scores_gemma":[0.000032638323,0.00008836476,0.0003165372,0.00005720725,0.000020987047,0.0002789479,0.00025528317,0.28373882,0.004410725,0.6272775,0.08349889,0.000024085784],"about_ca_topic_score_codex":0.00081202027,"about_ca_topic_score_gemma":0.0011652895,"teacher_disagreement_score":0.0034493217,"about_ca_system_score_codex":0.0006158046,"about_ca_system_score_gemma":0.00086060906,"threshold_uncertainty_score":0.011539102},"labels":[],"label_agreement":null},{"id":"W2100403022","doi":"10.5555/1535571.1535583","title":"DTN based dominating set routing technique for mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Roaming; Computer science; Wireless ad hoc network; Distributed computing; Mobile ad hoc network; Adaptive quality of service multi-hop routing; Quality of service; Geographic routing; Delay-tolerant networking; Optimized Link State Routing Protocol; Node (physics); Routing protocol; Wireless network; Routing (electronic design automation); Wireless Routing Protocol; Wireless; Engineering; Telecommunications","score_opus":0.03098235861945877,"score_gpt":0.260940381535487,"score_spread":0.2299580229160282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100403022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038746644,0.0016784179,0.9906375,0.0002143412,0.000277078,0.000105051084,0.000052723553,0.00019907531,0.002961201],"genre_scores_gemma":[0.19820203,0.004170085,0.79140806,0.00028800117,0.00029686867,0.00048202198,0.0003526541,0.00005906611,0.0047412934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940705,0.00020061384,0.00003484022,0.00006916519,0.0002661415,0.000022189593],"domain_scores_gemma":[0.99962175,0.000162371,0.000041773877,0.000054289736,0.00009812776,0.000021696156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007078568,0.00052325876,0.0005673876,0.00078057236,0.00053341646,0.0005276748,0.001240819,0.00054271024,0.00096465286],"category_scores_gemma":[0.0015436419,0.00019592636,0.0004602473,0.0009893294,0.00047061796,0.0007409316,0.00052941113,0.00075944833,0.00033190995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014402934,0.00008307107,0.00090341375,0.00081971864,0.00017061886,0.0004176807,0.00049615477,0.35751554,0.033511247,0.18206401,0.0103507675,0.4135237],"study_design_scores_gemma":[0.000060495528,0.0003239626,0.00035536074,0.00007820644,0.00008423028,0.00090976554,0.00006791545,0.86089313,0.008504711,0.061449036,0.0672208,0.0000523682],"about_ca_topic_score_codex":0.0007711723,"about_ca_topic_score_gemma":0.0013524604,"teacher_disagreement_score":0.001240819,"about_ca_system_score_codex":0.0006667789,"about_ca_system_score_gemma":0.0006222012,"threshold_uncertainty_score":0.0048378706},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Computer network; Routing protocol; Coding (social sciences); Multipath routing; Distributed computing; Static routing; Routing (electronic design automation); Network packet","score_opus":0.03796185511034981,"score_gpt":0.25702856252476985,"score_spread":0.21906670741442005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100697149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17216359,0.00089374743,0.8003376,0.0012026164,0.000100466204,0.00009859764,0.00017924956,0.000258911,0.02476522],"genre_scores_gemma":[0.98113674,0.0005488987,0.014186525,0.00007130028,0.00003206347,0.0000766824,0.000058440695,0.000034134286,0.003855247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919564,0.000339372,0.000022964427,0.00008108355,0.00022382892,0.00013709736],"domain_scores_gemma":[0.9962023,0.002627166,0.00036828543,0.00019537419,0.00051271706,0.00009427733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018375568,0.0007828794,0.00055613206,0.00074661925,0.0005004272,0.001170427,0.0011957046,0.0012842879,0.0011039854],"category_scores_gemma":[0.00967081,0.00038032405,0.00038958824,0.0007708259,0.0012890752,0.0021205796,0.0009395633,0.000874701,0.00026843752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022385922,0.00001282437,0.00025011617,0.000014426515,0.000005898408,0.000047407044,0.000060462975,0.9429358,0.0009069728,0.053527273,0.00026253477,0.0019538424],"study_design_scores_gemma":[0.0000022167214,0.0000071704403,0.00003891271,0.0000022465679,0.0000020941072,0.00000994112,0.0000074136565,0.99233764,0.00010621664,0.007328334,0.00015404107,0.0000038056978],"about_ca_topic_score_codex":0.0070824716,"about_ca_topic_score_gemma":0.0024826496,"teacher_disagreement_score":0.0070824716,"about_ca_system_score_codex":0.0023057295,"about_ca_system_score_gemma":0.0010364391,"threshold_uncertainty_score":0.016729355},"labels":[],"label_agreement":null},{"id":"W2100940862","doi":"10.1109/glocom.2010.5683237","title":"Improving Dominating Set Routing Performance via Node Mobility Model","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Computer network; Computer science; Roaming; Node (physics); Wireless ad hoc network; Geographic routing; Mobility model; Mobile ad hoc network; Routing (electronic design automation); Distributed computing; Destination-Sequenced Distance Vector routing; Routing protocol; Dynamic Source Routing; Wireless; Network packet; Engineering; Telecommunications","score_opus":0.016306239871797613,"score_gpt":0.23323757884298205,"score_spread":0.21693133897118444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100940862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1067064,0.0006459277,0.885874,0.00047935624,0.00012028342,0.000062501924,0.00006446325,0.00026274272,0.005784443],"genre_scores_gemma":[0.9235263,0.00066254736,0.07370457,0.000092617294,0.000039901694,0.000062100364,0.00008999131,0.000045083172,0.0017769613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993754,0.0002733053,0.000022726117,0.00006603073,0.00018873351,0.00007380528],"domain_scores_gemma":[0.9974293,0.0019148391,0.0001510888,0.00018134149,0.00024427497,0.00007912249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016593214,0.0007467801,0.00069133856,0.00072307646,0.0005874651,0.00074418035,0.001329691,0.00068961777,0.0007036961],"category_scores_gemma":[0.007110348,0.00037547402,0.00046559947,0.00074863445,0.00052147347,0.0014815002,0.00076925557,0.0006644334,0.0002040169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021402668,0.000013815097,0.0002162791,0.00001270206,0.000010128462,0.000021542965,0.00003176877,0.98531383,0.0009846936,0.007150898,0.00028634924,0.0059367046],"study_design_scores_gemma":[0.0000024464136,0.000012988821,0.00003132676,0.0000013047389,0.0000032503842,0.0000085359725,0.000004697264,0.9975079,0.00019298852,0.002085495,0.00014613985,0.0000028515353],"about_ca_topic_score_codex":0.0031778566,"about_ca_topic_score_gemma":0.0030845439,"teacher_disagreement_score":0.0031778566,"about_ca_system_score_codex":0.0014690288,"about_ca_system_score_gemma":0.00070731767,"threshold_uncertainty_score":0.010658622},"labels":[],"label_agreement":null},{"id":"W2101078743","doi":"10.1109/tc.2013.133","title":"Self-Adaptive Context Data Management in Large-Scale Mobile Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Exploit; Scalability; Distributed computing; Overhead (engineering); Computer network; Mobile computing; Data management; Context (archaeology); Bandwidth (computing); Computer security; Database; Operating system","score_opus":0.025335800103610907,"score_gpt":0.23749723980613252,"score_spread":0.2121614397025216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101078743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30626142,0.0042275866,0.6835494,0.0006733071,0.00016235911,0.0001864356,0.00008057736,0.0022065504,0.0026523843],"genre_scores_gemma":[0.9776023,0.00028531262,0.021558315,0.00005226747,0.00003472708,0.00004132017,0.000033503697,0.000022727945,0.0003695661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995003,0.00013951471,0.00005077296,0.0000987394,0.0001345879,0.00007608772],"domain_scores_gemma":[0.9983339,0.00064588,0.00024238753,0.00034150254,0.0002609407,0.00017530861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008871653,0.00044419043,0.00065512856,0.000557163,0.0010202447,0.0010938003,0.0012884886,0.0005948061,0.00030271817],"category_scores_gemma":[0.0026558253,0.00032789956,0.00022132859,0.00059846195,0.00059306255,0.0019197518,0.0014526794,0.00054858223,0.000095315874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032730115,0.00024627065,0.011783224,0.00035026125,0.00025996537,0.00097404345,0.0010751373,0.7048658,0.061024986,0.018147487,0.004514368,0.19643115],"study_design_scores_gemma":[0.000019737416,0.000073785246,0.0011207048,0.000010754796,0.00003411751,0.00015353663,0.0001641833,0.9862407,0.0044677365,0.0053088125,0.0023849525,0.000021141095],"about_ca_topic_score_codex":0.0031470996,"about_ca_topic_score_gemma":0.004122674,"teacher_disagreement_score":0.0031470996,"about_ca_system_score_codex":0.0005676159,"about_ca_system_score_gemma":0.00054177915,"threshold_uncertainty_score":0.006257534},"labels":[],"label_agreement":null},{"id":"W2101222531","doi":"10.1109/mwc.2014.6845046","title":"Mobile traffic offloading by exploiting social network services and leveraging opportunistic device-to-device sharing","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Mobile device; Leverage (statistics); Exploit; Cellular traffic; Cellular network; Computer security; World Wide Web","score_opus":0.05030465054405037,"score_gpt":0.28184194242937294,"score_spread":0.23153729188532257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101222531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41409567,0.0010688342,0.56073356,0.0004978357,0.0002304196,0.00026109972,0.00015321275,0.0015552797,0.02140399],"genre_scores_gemma":[0.9841957,0.00020940439,0.014223157,0.000051613693,0.000047877562,0.00004870797,0.000059505088,0.0000305076,0.0011335051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00011576085,0.000019063007,0.000077993616,0.00015323964,0.00011366212],"domain_scores_gemma":[0.9991341,0.00028527432,0.000119799144,0.00020486081,0.00016735042,0.00008860653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037995138,0.0009068362,0.00054609583,0.0009878747,0.0007733322,0.0009078429,0.00081309804,0.00046118096,0.0008991341],"category_scores_gemma":[0.0015410887,0.00019307247,0.00038728944,0.0008886708,0.0005898654,0.0012448451,0.00138207,0.000401917,0.00026395658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050835445,0.0007975587,0.012333311,0.00035319297,0.00019627446,0.0014685628,0.0007372207,0.31811875,0.17022313,0.039058268,0.0052133594,0.450992],"study_design_scores_gemma":[0.000024262765,0.00027235338,0.0028260741,0.000021689906,0.00006720274,0.0005694203,0.0003326625,0.953421,0.015570804,0.017121898,0.009730444,0.00004222379],"about_ca_topic_score_codex":0.0024120044,"about_ca_topic_score_gemma":0.0038261716,"teacher_disagreement_score":0.0024120044,"about_ca_system_score_codex":0.0005602711,"about_ca_system_score_gemma":0.00061475404,"threshold_uncertainty_score":0.0047959685},"labels":[],"label_agreement":null},{"id":"W2101459623","doi":"10.1109/iccchina.2012.6356871","title":"A secure message delivery scheme with path tracking for delay tolerant networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer network; Computer science; Node (physics); Incentive; Computer security; Authentication (law); Path (computing); Wireless ad hoc network; Wireless; Telecommunications","score_opus":0.020771201597249763,"score_gpt":0.22899917092508887,"score_spread":0.2082279693278391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101459623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029608767,0.00087239785,0.9640679,0.0005475135,0.00026525935,0.00034063874,0.00011040512,0.00097441324,0.0032126796],"genre_scores_gemma":[0.7624744,0.0010442686,0.22784425,0.00031219807,0.0001457817,0.0004487937,0.00032423472,0.000071904884,0.0073341373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987954,0.00025064943,0.00011703611,0.00022142804,0.0004632175,0.00015224711],"domain_scores_gemma":[0.9986846,0.00034475644,0.00027237792,0.0003085287,0.00028404623,0.000105644176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010491841,0.0008020262,0.00078650226,0.0011795211,0.0015992495,0.0008633261,0.0015925051,0.0012350813,0.0017936819],"category_scores_gemma":[0.0027731366,0.00027384958,0.0006875179,0.0012452785,0.0010416504,0.0028746882,0.0024671403,0.0012487075,0.00063246436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015294069,0.0003438689,0.0016515295,0.00071160495,0.000184119,0.0012339534,0.0014164599,0.18463875,0.093289606,0.30219638,0.0120301815,0.40077424],"study_design_scores_gemma":[0.00029320922,0.000997525,0.00054324424,0.000073392606,0.00014344136,0.0014682974,0.00016332722,0.88171995,0.027008872,0.057490133,0.029930359,0.0001681902],"about_ca_topic_score_codex":0.0011648767,"about_ca_topic_score_gemma":0.00072559254,"teacher_disagreement_score":0.0017936819,"about_ca_system_score_codex":0.0011963882,"about_ca_system_score_gemma":0.0013867584,"threshold_uncertainty_score":0.008680403},"labels":[],"label_agreement":null},{"id":"W2102436827","doi":"10.1109/tc.2008.51","title":"Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Broadcasting (networking); Upper and lower bounds; Approximation algorithm; Bounded function; Redundancy (engineering); Bandwidth (computing); Node (physics); Constant (computer programming); Algorithm; Computer network; Mathematics","score_opus":0.020716769565089322,"score_gpt":0.2091507970209899,"score_spread":0.18843402745590057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102436827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016733024,0.0005250935,0.9796825,0.00022928853,0.000021005842,0.00007773538,0.0000491503,0.0008754718,0.0018066865],"genre_scores_gemma":[0.60614204,0.00075292157,0.38905206,0.00018524307,0.00013021898,0.0003800372,0.00020065668,0.00016789733,0.0029888963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782443,0.0007333733,0.000098169694,0.0003036317,0.0007805627,0.00025994313],"domain_scores_gemma":[0.99274135,0.0038263437,0.0009521162,0.0017393574,0.00061306445,0.00012788508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021189908,0.0008834823,0.0018443457,0.0011463052,0.0009616704,0.0012904204,0.0023118232,0.00121801,0.0014256706],"category_scores_gemma":[0.010185572,0.00064193807,0.0006682118,0.0016817853,0.0011749689,0.0022712315,0.0017852996,0.0012154133,0.0007420756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000968971,0.00017486911,0.0009577255,0.0007288438,0.00016428469,0.00041714907,0.00068830315,0.61218876,0.032821715,0.125313,0.008368649,0.21720777],"study_design_scores_gemma":[0.00014529456,0.00033411902,0.0003014084,0.000050867275,0.00006979479,0.00046037155,0.00009973073,0.9358139,0.01121229,0.04687515,0.004601975,0.00003514791],"about_ca_topic_score_codex":0.0018193532,"about_ca_topic_score_gemma":0.0014072773,"teacher_disagreement_score":0.0023118232,"about_ca_system_score_codex":0.0013507522,"about_ca_system_score_gemma":0.0014052673,"threshold_uncertainty_score":0.011206448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; 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","score_opus":0.03820589656752386,"score_gpt":0.26527519794911814,"score_spread":0.22706930138159429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103344667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012909648,0.0158156,0.92605865,0.005549255,0.001704596,0.0004075042,0.00044679586,0.0010408505,0.03606716],"genre_scores_gemma":[0.655401,0.016338702,0.29881504,0.0017689706,0.0030927372,0.0018656715,0.0007110958,0.00037695377,0.021629829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977616,0.0011156489,0.0001039656,0.00023503466,0.0005857482,0.0001978975],"domain_scores_gemma":[0.9944062,0.0035268746,0.000431441,0.0009775072,0.00048864575,0.00016925842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002251902,0.0010546457,0.00089840236,0.0012606442,0.001492843,0.0020999208,0.0021277312,0.0017225196,0.0045484514],"category_scores_gemma":[0.011388477,0.0005026598,0.00061737094,0.0023947034,0.001869534,0.0046913647,0.002335386,0.0022600817,0.0015470241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017883144,0.00012050556,0.001870601,0.0005106458,0.00007706768,0.0008845756,0.0006168035,0.10074386,0.0032903918,0.73628193,0.019767437,0.13565737],"study_design_scores_gemma":[0.00004179197,0.00009566643,0.00076754874,0.00019358943,0.000057690686,0.0010969465,0.00021506193,0.46403727,0.00083953346,0.45069677,0.08188582,0.000072268886],"about_ca_topic_score_codex":0.0026175405,"about_ca_topic_score_gemma":0.0027616879,"teacher_disagreement_score":0.0045484514,"about_ca_system_score_codex":0.0014193782,"about_ca_system_score_gemma":0.0011409384,"threshold_uncertainty_score":0.015216112},"labels":[],"label_agreement":null},{"id":"W2103888945","doi":"10.1109/iscc.2010.5546565","title":"A secure group management scheme for mobile ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Computer security; Wireless ad hoc network; Mobile ad hoc network; Cryptography; Computer network; Distributed computing; Communication in small groups; Mobile computing; Scheme (mathematics); Wireless; Telecommunications","score_opus":0.007825972088874948,"score_gpt":0.22908415423321477,"score_spread":0.22125818214433982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103888945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011367879,0.00043554365,0.979051,0.0006318581,0.0003293014,0.0005130853,0.00009984065,0.0007782338,0.006793225],"genre_scores_gemma":[0.38554156,0.0006358202,0.59806544,0.000375249,0.00029785323,0.0011225248,0.00037351114,0.00008511757,0.013502962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840754,0.0003793886,0.00015346751,0.00018510655,0.00074361765,0.00013087883],"domain_scores_gemma":[0.99867636,0.00024857817,0.00017946554,0.00056402525,0.00020691828,0.00012474135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001715628,0.0006407144,0.0005255921,0.00073762576,0.0019463995,0.0013388091,0.0014755967,0.001378247,0.0027212948],"category_scores_gemma":[0.0029569722,0.00027860995,0.00067908136,0.00091194396,0.0016770533,0.0030828873,0.0036376973,0.0015342808,0.0012341641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025818302,0.000121326535,0.00044498403,0.00025782108,0.000065375025,0.00044064748,0.00087522255,0.019494666,0.025970591,0.80682755,0.008085902,0.13715775],"study_design_scores_gemma":[0.00051666336,0.0008945278,0.0004809304,0.00011757769,0.00017965102,0.0015569638,0.00020531862,0.31103697,0.028485216,0.4517842,0.20457162,0.00017037443],"about_ca_topic_score_codex":0.0004120814,"about_ca_topic_score_gemma":0.00044462446,"teacher_disagreement_score":0.0027212948,"about_ca_system_score_codex":0.00091189006,"about_ca_system_score_gemma":0.0013514883,"threshold_uncertainty_score":0.009103596},"labels":[],"label_agreement":null},{"id":"W2104997690","doi":"10.1007/s00453-013-9861-5","title":"Communication Complexity of Quasirandom Rumor Spreading","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"","keywords":"Hypercube; Computer science; Combinatorics; Node (physics); Discrete mathematics; Communication complexity; Theoretical computer science; Mathematics","score_opus":0.03068134274019199,"score_gpt":0.24824574633812657,"score_spread":0.21756440359793458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104997690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.647139,0.0016832931,0.31122738,0.011016242,0.00017851911,0.00020209102,0.0016026543,0.0003823004,0.026568498],"genre_scores_gemma":[0.98052853,0.0009130108,0.011911915,0.00033712864,0.0003140163,0.00018697718,0.0004381626,0.00008771429,0.005282632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666613,0.0013807275,0.00014026587,0.00044962217,0.00080031634,0.0005629109],"domain_scores_gemma":[0.92178756,0.068571165,0.0033844656,0.0030526365,0.0017405794,0.0014635386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003284998,0.000706278,0.0020950353,0.0015317147,0.0019082405,0.004955295,0.0034463692,0.0025179954,0.008037453],"category_scores_gemma":[0.034506172,0.00090926175,0.0011080402,0.0019583427,0.0032291184,0.009660293,0.0032568967,0.0033864907,0.00062727893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061584654,0.0001805721,0.0034343465,0.00030765895,0.00011409226,0.00030230434,0.0007547057,0.19735922,0.0022316708,0.7735627,0.00616655,0.014970349],"study_design_scores_gemma":[0.00008678323,0.000032562057,0.00058987795,0.000018987428,0.000029267125,0.00010624995,0.00011609711,0.42999408,0.00041240035,0.567991,0.0005942752,0.00002847851],"about_ca_topic_score_codex":0.0023022166,"about_ca_topic_score_gemma":0.0018378551,"teacher_disagreement_score":0.008037453,"about_ca_system_score_codex":0.0033166632,"about_ca_system_score_gemma":0.0022078035,"threshold_uncertainty_score":0.026887953},"labels":[],"label_agreement":null},{"id":"W2107308768","doi":"10.4304/jcm.5.2.152-163","title":"Preventing Unauthorized Messages and Achieving End-to-End Security in Delay Tolerant Heterogeneous Wireless Networks","year":2010,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Roaming; Node (physics); Wireless network; Heterogeneous network; Wireless ad hoc network; Distributed computing; Computer security; Wireless; Telecommunications","score_opus":0.017930174717161865,"score_gpt":0.27868297436511685,"score_spread":0.260752799647955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107308768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17704456,0.00053450256,0.81899875,0.0002945823,0.000070277354,0.00009755017,0.000032990774,0.00031657476,0.0026101149],"genre_scores_gemma":[0.9647563,0.00017760698,0.03426981,0.000049777464,0.00003067572,0.000032047687,0.000032130192,0.000011097144,0.00064060243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991855,0.0002667769,0.00007222095,0.00009797117,0.00025341872,0.00012404125],"domain_scores_gemma":[0.9979096,0.00086706236,0.00037204838,0.0004199056,0.000315462,0.0001158567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011469583,0.00044591495,0.00038157045,0.0005812315,0.0007424,0.0010503598,0.0009149262,0.00070148584,0.0005996787],"category_scores_gemma":[0.0024191616,0.00015175235,0.00021441434,0.00047666987,0.00075097533,0.0020634483,0.0014412359,0.00061650045,0.00015208972],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013800693,0.0003854247,0.006080056,0.00043761687,0.00016229933,0.0014365115,0.0007942308,0.48035392,0.1935718,0.14269793,0.0033045863,0.16939554],"study_design_scores_gemma":[0.00003352644,0.0003034588,0.00050837325,0.000016640472,0.00003740637,0.00028001535,0.00018186242,0.93488616,0.038965985,0.021158349,0.003605541,0.000022785534],"about_ca_topic_score_codex":0.0005105318,"about_ca_topic_score_gemma":0.00034370474,"teacher_disagreement_score":0.0011469583,"about_ca_system_score_codex":0.0004985492,"about_ca_system_score_gemma":0.00040240007,"threshold_uncertainty_score":0.006065786},"labels":[],"label_agreement":null},{"id":"W2107796859","doi":"10.1504/ijcnds.2009.026558","title":"Cognitive networking of large scale wireless systems","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless WAN; Cognitive radio; Wireless network; Municipal wireless network; Wi-Fi array; Wireless mesh network; Wireless broadband; Wireless; Key distribution in wireless sensor networks; Radio resource management; Cognitive network; Quality of service; Multi-frequency network; Distributed computing; Telecommunications","score_opus":0.017067676532595753,"score_gpt":0.2775984651340733,"score_spread":0.26053078860147755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107796859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03317521,0.0054400815,0.93650323,0.0011880882,0.0005391647,0.000061862134,0.000033052213,0.00031132807,0.022747885],"genre_scores_gemma":[0.9205982,0.004645718,0.06814769,0.00035257096,0.0005860571,0.0001431865,0.000033580032,0.00003010749,0.0054629236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972266,0.000074134805,0.000007608385,0.000036439433,0.0001124046,0.000046710957],"domain_scores_gemma":[0.99933666,0.0004060337,0.000064617765,0.000066013825,0.000077829296,0.00004893595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513104,0.00037816662,0.00035799626,0.00038439137,0.00052039104,0.0012297502,0.00074420194,0.0005386388,0.0011277249],"category_scores_gemma":[0.0017967382,0.00016691646,0.00020401883,0.00046560925,0.0010932913,0.0015737759,0.0010491702,0.0007705479,0.00015870959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007668469,0.00005969249,0.0008619973,0.00026849777,0.00007903311,0.00061599026,0.00033801753,0.24476163,0.00925294,0.6463489,0.0053287297,0.09200783],"study_design_scores_gemma":[0.000030350167,0.00006472369,0.00045344353,0.00003271461,0.000027255732,0.00027658598,0.000103649734,0.62645555,0.0013691849,0.3526934,0.018463878,0.000029288494],"about_ca_topic_score_codex":0.0011306949,"about_ca_topic_score_gemma":0.0009213506,"teacher_disagreement_score":0.0012297502,"about_ca_system_score_codex":0.00050088606,"about_ca_system_score_gemma":0.00036547624,"threshold_uncertainty_score":0.0037726164},"labels":[],"label_agreement":null},{"id":"W2108479384","doi":"10.1109/glocom.2010.5683907","title":"A Double-Loop Receiver-Initiated Medium Access Control Scheme for Data Dissemination Services with Packet Pre-Downloading","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Upload; Network packet; Overhead (engineering); Local area network; Scheme (mathematics); Dissemination; Access control; The Internet; Internet access; Telecommunications; Operating system","score_opus":0.05261729146718252,"score_gpt":0.33456634619359293,"score_spread":0.2819490547264104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108479384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038445834,0.00048337123,0.9587571,0.000115425806,0.000090000074,0.00015440614,0.000022189308,0.00048345583,0.0014482251],"genre_scores_gemma":[0.84725803,0.00026645293,0.14988296,0.00009531501,0.000111122106,0.00016772139,0.000050547176,0.000018512052,0.0021493114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948597,0.00012990975,0.000035140703,0.00011595388,0.00017945866,0.000053593394],"domain_scores_gemma":[0.99902165,0.00032314536,0.00014705924,0.00015220378,0.00028681508,0.00006916838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080856425,0.0004789645,0.00048244421,0.0004940557,0.0006177029,0.00063924503,0.0013702197,0.0005985412,0.0006342696],"category_scores_gemma":[0.0016950469,0.00013442399,0.00028557045,0.0004402945,0.0004367364,0.000887336,0.000490804,0.00056290464,0.0001632043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008674689,0.00070205703,0.0033098704,0.0006221055,0.00019530012,0.0011591809,0.00079047395,0.19487137,0.3594205,0.07008695,0.0038118616,0.3641629],"study_design_scores_gemma":[0.00006526532,0.0005268583,0.0004374756,0.000010989758,0.000059628437,0.0005278755,0.000033455985,0.9675625,0.02150787,0.002692685,0.006535273,0.000040097322],"about_ca_topic_score_codex":0.0010311597,"about_ca_topic_score_gemma":0.000988223,"teacher_disagreement_score":0.0013702197,"about_ca_system_score_codex":0.00047699446,"about_ca_system_score_gemma":0.00068430183,"threshold_uncertainty_score":0.0042761564},"labels":[],"label_agreement":null},{"id":"W2110405014","doi":"10.1109/cloudnet.2015.7335327","title":"DRAP: A decentralized public resourced cloudlet for Ad-hoc networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloudlet; Computer science; Mobile device; Computer network; Distributed computing; Cloud computing; Resource (disambiguation); Mobile computing; Mobile ad hoc network; Shared resource; Overlay network; Operating system; The Internet","score_opus":0.08604429311504326,"score_gpt":0.27141401368339363,"score_spread":0.18536972056835038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110405014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042684812,0.00040100122,0.9461857,0.0003905529,0.00023234855,0.00058919867,0.00016610096,0.002828874,0.0065214215],"genre_scores_gemma":[0.6194097,0.00032085413,0.3728585,0.00020196587,0.00007542697,0.00029946293,0.0003676501,0.00010121129,0.0063652257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.000101988175,0.000019536159,0.00007134454,0.00012564503,0.00008464992],"domain_scores_gemma":[0.999448,0.00009425061,0.00006915094,0.00015236663,0.00011995181,0.00011630009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070691475,0.00039933965,0.0005081449,0.000402877,0.001149404,0.00091665867,0.0020402914,0.0006090008,0.0013918186],"category_scores_gemma":[0.000908397,0.00020386501,0.0002871217,0.0005427248,0.00042482425,0.0013022784,0.0014230317,0.00065838144,0.00059943844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001271878,0.0007447423,0.0030627085,0.00040234957,0.00014875794,0.0008525612,0.0003592406,0.3672441,0.061435487,0.09907068,0.03950927,0.42589808],"study_design_scores_gemma":[0.000065543114,0.00022322041,0.0003950796,0.000011193424,0.000018305074,0.00027470017,0.000066264634,0.969282,0.0068480805,0.00980713,0.01297713,0.000031335665],"about_ca_topic_score_codex":0.0022358384,"about_ca_topic_score_gemma":0.003761064,"teacher_disagreement_score":0.0022358384,"about_ca_system_score_codex":0.00082477875,"about_ca_system_score_gemma":0.0011154525,"threshold_uncertainty_score":0.0059842467},"labels":[],"label_agreement":null},{"id":"W2113774834","doi":"10.1109/glocom.2006.1011","title":"WSNp1-6: Applying Peer-to-Peer Asynchronous Publish Subscribe Message Middleware to Mobile Ah Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Asynchronous communication; Mobile ad hoc network; Middleware (distributed applications); Wireless ad hoc network; Node (physics); Network packet; Message oriented middleware; Distributed computing; Message broker; Message passing; Mobile computing; Wireless; Operating system; Software architecture","score_opus":0.012065312311818682,"score_gpt":0.2307891886440039,"score_spread":0.21872387633218524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113774834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01116562,0.0005925095,0.97633505,0.000267068,0.00025504644,0.00045514663,0.00006940114,0.007203918,0.0036562628],"genre_scores_gemma":[0.21293905,0.0014840425,0.77692455,0.00017330526,0.00024470768,0.00045366507,0.0005608639,0.00045047834,0.0067693666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.00030930177,0.00012429978,0.00012212437,0.00047813627,0.00007479388],"domain_scores_gemma":[0.9993468,0.00015115134,0.00007738541,0.00020009617,0.0001636903,0.000060810868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042408,0.0005880604,0.00062963046,0.00081796397,0.0005463637,0.0012720368,0.0021361227,0.00082374434,0.001514893],"category_scores_gemma":[0.0028572255,0.00037462093,0.000532827,0.0007882381,0.00055505923,0.0015980493,0.0016243189,0.0010342248,0.0010613151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003990446,0.00049884117,0.0037321348,0.0016394986,0.0003425178,0.0014103102,0.0006525295,0.07648396,0.11562897,0.0631414,0.016185384,0.71988547],"study_design_scores_gemma":[0.0002783973,0.0009135624,0.0020164996,0.00011636911,0.00021187493,0.0018777049,0.00021628177,0.6629989,0.09774876,0.036573302,0.19691968,0.00012862156],"about_ca_topic_score_codex":0.00069689314,"about_ca_topic_score_gemma":0.00060592615,"teacher_disagreement_score":0.0021361227,"about_ca_system_score_codex":0.0004075879,"about_ca_system_score_gemma":0.00074789644,"threshold_uncertainty_score":0.0108014345},"labels":[],"label_agreement":null},{"id":"W2113836451","doi":"10.1109/glocom.2009.5425463","title":"Cross-Layer Resource Allocation for Efficient Message Dissemination in Rural Infostation Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Resource allocation; Relay; Node (physics); Bandwidth (computing); Quality of service; Transmission (telecommunications); Distributed computing; Resource management (computing); Physical layer; Telecommunications; Wireless; Power (physics); Engineering","score_opus":0.01530474066977757,"score_gpt":0.29201089236843775,"score_spread":0.2767061516986602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113836451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1718382,0.0006283244,0.8231353,0.00023621516,0.00002614276,0.00009537423,0.00002855102,0.00023810075,0.0037738401],"genre_scores_gemma":[0.9616929,0.00016099027,0.03690631,0.000050933955,0.000015588383,0.000055486475,0.000015472606,0.000014567406,0.0010876236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.00019787833,0.000019393678,0.0000686633,0.000086297136,0.00006671986],"domain_scores_gemma":[0.99890363,0.00066742016,0.00018000953,0.00009083599,0.00011726062,0.000040707324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010340218,0.00044400926,0.00043223554,0.0003708968,0.00052683474,0.0007913196,0.0006793109,0.00052230747,0.0014130056],"category_scores_gemma":[0.0022579385,0.00024887206,0.000164346,0.0004146087,0.00056279864,0.0010931123,0.000976115,0.00036952042,0.00020905782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021839577,0.0001153016,0.0010912586,0.0001777324,0.0000743683,0.0003925031,0.0003265827,0.88643396,0.041605696,0.024425428,0.0009606057,0.044178315],"study_design_scores_gemma":[0.000027428241,0.00012792235,0.00033843447,0.0000065932823,0.000021398857,0.00010284115,0.000065645756,0.98937327,0.0046301964,0.0040222183,0.0012730332,0.000010926382],"about_ca_topic_score_codex":0.0010401035,"about_ca_topic_score_gemma":0.0012426701,"teacher_disagreement_score":0.0014130056,"about_ca_system_score_codex":0.0005844727,"about_ca_system_score_gemma":0.0004923466,"threshold_uncertainty_score":0.0054684877},"labels":[],"label_agreement":null},{"id":"W2114966563","doi":"10.1145/2656346.2656352","title":"Vehicular social systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Vehicular ad hoc network; Wireless ad hoc network; Field (mathematics); Publication; Routing (electronic design automation); Routing protocol; Computer network; Computer security; Wireless; Telecommunications; Business","score_opus":0.014793651556063037,"score_gpt":0.2125799004363181,"score_spread":0.19778624888025506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114966563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050373174,0.012980437,0.4925118,0.014413213,0.0022432632,0.0010858969,0.0073247408,0.0019993235,0.41706812],"genre_scores_gemma":[0.8532382,0.011674801,0.04878102,0.0013879852,0.0010297494,0.00065177324,0.0056255553,0.00016760564,0.07744338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984041,0.0005969867,0.00010923446,0.0003100053,0.0003958416,0.00018383766],"domain_scores_gemma":[0.99782443,0.0007772612,0.00028089594,0.0004040248,0.00051124545,0.00020226155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008838713,0.0006771168,0.00071685854,0.0017882498,0.0019120497,0.004243348,0.0010435316,0.0016600768,0.013153752],"category_scores_gemma":[0.0056894934,0.00028263865,0.0005892782,0.0022426534,0.0010787458,0.0030446593,0.0030200935,0.001011432,0.0037066028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005833505,0.00005534804,0.003745322,0.00030486545,0.000104637016,0.0005676624,0.00068976055,0.03583227,0.00071580487,0.8260406,0.04139937,0.09048603],"study_design_scores_gemma":[0.000043698477,0.00008055129,0.002085787,0.00017295862,0.00006402779,0.00069201796,0.0012456455,0.08292442,0.0005337743,0.44166327,0.4704188,0.00007502059],"about_ca_topic_score_codex":0.006519209,"about_ca_topic_score_gemma":0.004947507,"teacher_disagreement_score":0.013153752,"about_ca_system_score_codex":0.0018442922,"about_ca_system_score_gemma":0.0014652336,"threshold_uncertainty_score":0.044003725},"labels":[],"label_agreement":null},{"id":"W2115026050","doi":"10.1504/ijwmc.2013.053040","title":"On routing protocols using mobile social networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Wireless and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Routing protocol; Wireless Routing Protocol; Node (physics); Link-state routing protocol; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Software deployment; Distributed computing; Policy-based routing; Mobile social network; Routing (electronic design automation); Mobile computing","score_opus":0.0218246247946045,"score_gpt":0.3035615761572218,"score_spread":0.2817369513626173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115026050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005693689,0.016198454,0.9334316,0.00426678,0.0016829582,0.00047438426,0.00017078908,0.0005664575,0.037514873],"genre_scores_gemma":[0.3177006,0.063682705,0.565543,0.0035082905,0.0061990893,0.003880904,0.0010684794,0.0004730816,0.037943788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714166,0.0011263886,0.00022039287,0.00032985146,0.0009907314,0.00019097803],"domain_scores_gemma":[0.9949961,0.003194943,0.00030201176,0.00070126343,0.00068872335,0.000117092786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002746505,0.0019293196,0.001443681,0.003133903,0.0019281877,0.0029836104,0.0021967,0.0021787207,0.003938408],"category_scores_gemma":[0.008430908,0.00079906493,0.0011126582,0.004894713,0.0034329628,0.008995876,0.0039549284,0.003491478,0.001655587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009841914,0.000061318955,0.00032931546,0.00046419897,0.000087355926,0.00034175973,0.0005050605,0.05003154,0.0021464045,0.82880884,0.013207495,0.10391832],"study_design_scores_gemma":[0.00007826113,0.00019520472,0.0002524701,0.00042992385,0.000090245514,0.00075008516,0.0002060829,0.22913487,0.002451363,0.6319241,0.13436799,0.0001194401],"about_ca_topic_score_codex":0.0018058118,"about_ca_topic_score_gemma":0.0014101295,"teacher_disagreement_score":0.003938408,"about_ca_system_score_codex":0.002038207,"about_ca_system_score_gemma":0.0012210156,"threshold_uncertainty_score":0.01478833},"labels":[],"label_agreement":null},{"id":"W2115822357","doi":"10.1109/cjece.2013.6704694","title":"The DBF-based semantic service discovery for mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Service discovery; Computer science; Scalability; Bloom filter; Service (business); Overhead (engineering); Computer network; Business process discovery; Mobile ad hoc network; Wireless ad hoc network; Vehicular ad hoc network; Web service; Distributed computing; World Wide Web; Database; Business process; Network packet; Telecommunications; Wireless; Engineering","score_opus":0.005385133317202549,"score_gpt":0.16687373126534158,"score_spread":0.16148859794813902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115822357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008540874,0.0009377977,0.985028,0.00060828374,0.00011803335,0.00027394862,0.00028425985,0.0011364799,0.0030722483],"genre_scores_gemma":[0.23350453,0.0017453212,0.75870156,0.00040017316,0.00009627688,0.00051064504,0.0012483994,0.00010315347,0.003689954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974383,0.0006589398,0.00028921786,0.0003447077,0.0010246801,0.00024408505],"domain_scores_gemma":[0.99813485,0.00074561354,0.00012791174,0.0003810866,0.00047969396,0.00013081514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041786926,0.00052801234,0.0013126783,0.002624949,0.0022951192,0.0030232193,0.0023317137,0.001602294,0.001352606],"category_scores_gemma":[0.0067357384,0.0004986359,0.0012481736,0.002871773,0.0015421133,0.005038219,0.001790622,0.0014275821,0.00056256587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045981858,0.00027184383,0.0021912172,0.0005016466,0.00015141474,0.00041607954,0.00047444875,0.1394278,0.009872022,0.4034164,0.013149547,0.4296677],"study_design_scores_gemma":[0.00006583523,0.00008106788,0.00035887837,0.000056818826,0.00004429623,0.00037645834,0.00012413473,0.84574926,0.006685295,0.12007472,0.026315138,0.000067957524],"about_ca_topic_score_codex":0.027225886,"about_ca_topic_score_gemma":0.015842544,"teacher_disagreement_score":0.027225886,"about_ca_system_score_codex":0.0049457774,"about_ca_system_score_gemma":0.005183385,"threshold_uncertainty_score":0.054134846},"labels":[],"label_agreement":null},{"id":"W2117317341","doi":"10.1145/1247721.1247722","title":"Performance evaluation and analysis of delay tolerant networking","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Council","keywords":"Computer science; Bottleneck; Delay-tolerant networking; Computer network; Transfer (computing); Wireless; Interactive kiosk; Telecommunications; Embedded system; Wireless ad hoc network; Operating system; Vehicular ad hoc network","score_opus":0.030281419970914186,"score_gpt":0.2770709383944273,"score_spread":0.24678951842351313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117317341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9392335,0.0014541644,0.048766974,0.0002943195,0.000100027595,0.00018879952,0.00053288834,0.001122087,0.008307234],"genre_scores_gemma":[0.9917657,0.0002211216,0.006971264,0.000022546295,0.000015939988,0.00004282625,0.00033813927,0.00004477089,0.00057760807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726427,0.0005959779,0.00018469614,0.00034300395,0.0012013383,0.0004106925],"domain_scores_gemma":[0.9869019,0.008103702,0.0011059549,0.0013151513,0.0021600458,0.0004132212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028063743,0.0009531979,0.00061478064,0.0016393336,0.0006106054,0.00085664686,0.0012018925,0.0005364139,0.0011290772],"category_scores_gemma":[0.013541171,0.00017542279,0.00024704318,0.0019713757,0.0005047863,0.0012171622,0.00058276113,0.00038322108,0.00021226227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012368712,0.00038483567,0.014397618,0.00032503493,0.000101322556,0.00017016625,0.00014315367,0.8841794,0.017057367,0.0038611756,0.001660888,0.07648226],"study_design_scores_gemma":[0.000023865205,0.00076024764,0.005019332,0.000013052235,0.000034902816,0.00013760276,0.00008947041,0.9789412,0.012895191,0.0011923412,0.00087277027,0.000019976176],"about_ca_topic_score_codex":0.004083605,"about_ca_topic_score_gemma":0.002471653,"teacher_disagreement_score":0.004083605,"about_ca_system_score_codex":0.0023325647,"about_ca_system_score_gemma":0.0007938297,"threshold_uncertainty_score":0.016924024},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Computer network; Net (polyhedron); Mathematics","score_opus":0.037436286161153666,"score_gpt":0.32536700894627096,"score_spread":0.2879307227851173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117987433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96519864,0.00092902064,0.023517776,0.0012412219,0.00013318773,0.00037454424,0.0017952175,0.00024492672,0.0065653054],"genre_scores_gemma":[0.9893862,0.00021355315,0.0084691215,0.00005942861,0.000037507656,0.0001378704,0.0011526285,0.000024391638,0.0005193161],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9934407,0.0040793647,0.000349461,0.00069589884,0.0010984126,0.00033612596],"domain_scores_gemma":[0.82687664,0.14114313,0.011269564,0.006833999,0.009171142,0.0047054663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016284686,0.00053631165,0.0004598055,0.003263971,0.001428203,0.0015416978,0.0023138644,0.0012717358,0.0031054444],"category_scores_gemma":[0.08618622,0.00020388173,0.00035987556,0.0027531257,0.0018166908,0.0054592956,0.0014962308,0.0014040492,0.00048853864],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046055173,0.0025166671,0.4556427,0.0012550803,0.000595502,0.0005680041,0.002829194,0.32254303,0.0018231052,0.047073122,0.018007383,0.1425407],"study_design_scores_gemma":[0.0002836165,0.0032298272,0.05620079,0.00015325022,0.00017014125,0.0008561137,0.0050574695,0.9001113,0.0022251476,0.020264767,0.011354261,0.00009329891],"about_ca_topic_score_codex":0.0041943677,"about_ca_topic_score_gemma":0.0037793897,"teacher_disagreement_score":0.016284686,"about_ca_system_score_codex":0.003285532,"about_ca_system_score_gemma":0.0009617158,"threshold_uncertainty_score":0.08612269},"labels":[],"label_agreement":null},{"id":"W2120848919","doi":"10.1109/syscon.2011.5929110","title":"A Holonic Federated Sensor Management Framework for pervasive surveillance systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Wireless sensor network; Distributed computing; Operability; Architecture; Computer security; Embedded system; Computer network; Software engineering; Database","score_opus":0.05498735392885684,"score_gpt":0.2522603388056629,"score_spread":0.19727298487680606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120848919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01489796,0.00039331568,0.97994745,0.0002223932,0.00005223764,0.00010684727,0.0000370015,0.0017477797,0.0025949595],"genre_scores_gemma":[0.4894373,0.00045785727,0.50522506,0.00019003871,0.00005168801,0.00019876029,0.00018853706,0.000075317075,0.0041754274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996363,0.00009024812,0.00003209596,0.00005907361,0.00013059378,0.00005173857],"domain_scores_gemma":[0.9997825,0.000042328928,0.000024736013,0.000052031268,0.00005389436,0.00004453837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442327,0.00035908254,0.00029389886,0.0004677902,0.000626087,0.0012869751,0.0013760397,0.00066637044,0.0008786095],"category_scores_gemma":[0.0006076116,0.00018188679,0.0003756527,0.000338768,0.00051353703,0.001495246,0.0010865683,0.0006835968,0.00014233532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040916516,0.00034208977,0.0018982879,0.00036503898,0.00013878367,0.0010897894,0.0008533421,0.2878657,0.044800848,0.22427337,0.010375469,0.42758805],"study_design_scores_gemma":[0.00005591031,0.00019759209,0.0006894997,0.000045227578,0.000056392855,0.00039351758,0.0001262625,0.921961,0.011766766,0.032442905,0.03222057,0.000044320324],"about_ca_topic_score_codex":0.004108015,"about_ca_topic_score_gemma":0.005250509,"teacher_disagreement_score":0.004108015,"about_ca_system_score_codex":0.0007058918,"about_ca_system_score_gemma":0.0010821146,"threshold_uncertainty_score":0.0081682205},"labels":[],"label_agreement":null},{"id":"W2120906187","doi":"10.1109/icc.2011.5962781","title":"DSA: Distributed Semi-Asynchronous Sleep Scheduling Protocol for Mobile Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Synchronization (alternating current); Distributed computing; Computer network; Scheduling (production processes); Wireless; Efficient energy use; Clock synchronization; Real-time computing; Wireless sensor network; Engineering; Channel (broadcasting); Telecommunications","score_opus":0.03743671126098699,"score_gpt":0.2712189638468954,"score_spread":0.23378225258590843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120906187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028319623,0.0014717054,0.9627114,0.00036789654,0.00040332228,0.000354738,0.00019695933,0.0015935976,0.0045808265],"genre_scores_gemma":[0.7487037,0.0017854531,0.23910427,0.00037245944,0.00036724494,0.0012168285,0.00081022317,0.00016938397,0.0074704136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.00008244063,0.00003313496,0.000031191183,0.000107062704,0.000021978894],"domain_scores_gemma":[0.99949634,0.00014388462,0.000083437706,0.00007296921,0.00013618903,0.00006721008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058354676,0.0005189825,0.00040685863,0.00059958186,0.0006080826,0.0005314922,0.0007759757,0.00031037637,0.0010843736],"category_scores_gemma":[0.0010326717,0.00016021336,0.00025952913,0.0005054219,0.00047706446,0.00066822104,0.0007701868,0.000548039,0.00038531335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009987837,0.0003149044,0.0025612512,0.0011804965,0.00022501276,0.000748098,0.00082191965,0.13383074,0.12744056,0.12121553,0.027840195,0.58282256],"study_design_scores_gemma":[0.00042422034,0.00095310307,0.0011318844,0.00007914878,0.00017061981,0.000891142,0.00023438464,0.80855316,0.029261544,0.033339713,0.124877505,0.000083536084],"about_ca_topic_score_codex":0.0009243644,"about_ca_topic_score_gemma":0.0014496517,"teacher_disagreement_score":0.0010843736,"about_ca_system_score_codex":0.00036467123,"about_ca_system_score_gemma":0.00089881034,"threshold_uncertainty_score":0.003627658},"labels":[],"label_agreement":null},{"id":"W2121070936","doi":"10.1109/iscc.2011.5983942","title":"Improving source-location privacy through opportunistic routing in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless sensor network; Computer science; Computer network; Relay; Network packet; Key distribution in wireless sensor networks; Adversary; Software deployment; Hop (telecommunications); Wireless; Computer security; Wireless network; Telecommunications","score_opus":0.05000363798929827,"score_gpt":0.2381965001923833,"score_spread":0.18819286220308504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121070936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06444952,0.001179521,0.93061197,0.00060682814,0.00007952887,0.00009700125,0.00006344842,0.00028070356,0.002631463],"genre_scores_gemma":[0.8855341,0.0016137226,0.11073135,0.0001669686,0.00008737344,0.00011548151,0.00007316759,0.0000506418,0.0016271649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808633,0.00095322414,0.00011937691,0.00017809718,0.00049435685,0.00016866598],"domain_scores_gemma":[0.9941282,0.0037020603,0.0007538966,0.0009639882,0.00033116306,0.00012076974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002902683,0.0005875463,0.00059850246,0.00086421653,0.00089732656,0.0010500501,0.0012669994,0.0007620971,0.0004220884],"category_scores_gemma":[0.006908685,0.00040263336,0.0005092101,0.0011903459,0.0011570244,0.002772124,0.0018919151,0.0005965755,0.00013969095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049929356,0.00017947845,0.0046764486,0.00034944605,0.00015548883,0.0006437596,0.00069297233,0.72074884,0.028132167,0.0930042,0.0019857038,0.1489322],"study_design_scores_gemma":[0.00004504778,0.00021862738,0.0005508933,0.00003058883,0.0000696493,0.0006110565,0.0001930129,0.9091732,0.008840854,0.074374,0.0058447155,0.000048403475],"about_ca_topic_score_codex":0.0008216458,"about_ca_topic_score_gemma":0.0010352145,"teacher_disagreement_score":0.002902683,"about_ca_system_score_codex":0.0005982199,"about_ca_system_score_gemma":0.0008563277,"threshold_uncertainty_score":0.015351057},"labels":[],"label_agreement":null},{"id":"W2122632764","doi":"10.1109/aict-iciw.2006.137","title":"Networks without Borders: Communication despite Disconnection","year":2006,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Disconnection; Computer network; Social connectedness; Distributed computing; The Internet; Architecture; Routing protocol; Routing (electronic design automation); World Wide Web","score_opus":0.010057044171378232,"score_gpt":0.2389017763647144,"score_spread":0.22884473219333618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122632764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11008255,0.012541212,0.66696477,0.010075597,0.0019327931,0.0002878634,0.00029297886,0.0025168245,0.19530533],"genre_scores_gemma":[0.8685629,0.0060195005,0.101690836,0.0013583561,0.00076347194,0.00035416055,0.0003758467,0.00026236102,0.020612558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.00020841698,0.00005349177,0.00021596321,0.00023400124,0.00013014756],"domain_scores_gemma":[0.9973991,0.00080079,0.0003566013,0.00072075496,0.00035949858,0.00036328103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010427838,0.00039154704,0.00051114074,0.00066079694,0.0013983473,0.0032182918,0.0011132886,0.0020613188,0.0020135744],"category_scores_gemma":[0.0059493203,0.00031309723,0.0001611484,0.000829618,0.00287834,0.006670533,0.0048795673,0.0014407268,0.000986738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019557533,0.000067683,0.001825909,0.00056850864,0.000056205707,0.0024532417,0.0029293746,0.02059099,0.020745073,0.7041854,0.016318489,0.23006362],"study_design_scores_gemma":[0.000080459555,0.00024421336,0.0015051671,0.00035456588,0.0001029816,0.004231644,0.0020410453,0.06461594,0.008254713,0.5585318,0.3599395,0.00009801247],"about_ca_topic_score_codex":0.00030262754,"about_ca_topic_score_gemma":0.00028500147,"teacher_disagreement_score":0.0032182918,"about_ca_system_score_codex":0.00036968422,"about_ca_system_score_gemma":0.0005074237,"threshold_uncertainty_score":0.00673604},"labels":[],"label_agreement":null},{"id":"W2122975771","doi":"10.1109/ccnc.2007.170","title":"Hybrid Data Dissemination Approach for Sensor Network with Multiple Cooperative Sinks","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scalability; Synchronizing; Computer science; Distributed computing; Dissemination; Computer network; Simple (philosophy); Wireless sensor network; Software; Operating system; Telecommunications; Transmission (telecommunications)","score_opus":0.0364369880970048,"score_gpt":0.2765715103731481,"score_spread":0.2401345222761433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122975771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027107395,0.000420477,0.9700411,0.00017232216,0.00004309743,0.00009307518,0.000023877801,0.00035541685,0.0017433034],"genre_scores_gemma":[0.65675855,0.00057185703,0.3369227,0.00015704083,0.000088843466,0.00044345928,0.00011092786,0.000060652703,0.004885975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.00013440255,0.00003501025,0.00012819366,0.00024362378,0.00003936571],"domain_scores_gemma":[0.99946433,0.00021514269,0.00004691355,0.0001216462,0.000118745455,0.00003311573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008032049,0.00041685635,0.00059401407,0.0006423986,0.0005094706,0.000612891,0.0014343768,0.0006028251,0.0010077856],"category_scores_gemma":[0.0011217294,0.00023537224,0.00044343676,0.0006992602,0.00042593942,0.0016352253,0.0015546903,0.0004728278,0.00024260335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042880478,0.00027158007,0.001999732,0.000744391,0.00032709035,0.0008506476,0.0014348908,0.28824168,0.19953445,0.07877594,0.0036783298,0.42371252],"study_design_scores_gemma":[0.0001610165,0.0004964806,0.0006169698,0.000026529151,0.00013038432,0.0004178801,0.00021506603,0.942967,0.021623699,0.016919553,0.01637363,0.0000518496],"about_ca_topic_score_codex":0.0005935356,"about_ca_topic_score_gemma":0.0007922677,"teacher_disagreement_score":0.0014343768,"about_ca_system_score_codex":0.0003802762,"about_ca_system_score_gemma":0.0004188248,"threshold_uncertainty_score":0.0042477846},"labels":[],"label_agreement":null},{"id":"W2125476209","doi":"10.5555/2693848.2694142","title":"Simulation implementation and performance analysis for situational awareness data dissemination in a tactical manet","year":2014,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Mobile ad hoc network; Computer science; Situation awareness; Network topology; Dissemination; Wireless ad hoc network; Computer network; Distributed computing; Bandwidth (computing); Information Dissemination; Vehicular ad hoc network; Wireless; World Wide Web; Engineering; Network packet; Telecommunications","score_opus":0.09110122704480515,"score_gpt":0.3872044403897134,"score_spread":0.29610321334490824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125476209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7773143,0.0002034875,0.20315605,0.0005493285,0.00011319684,0.00039547373,0.0007840606,0.0011754467,0.016308645],"genre_scores_gemma":[0.96969306,0.000120562894,0.028774103,0.000037647744,0.0000071398968,0.00017374007,0.0002675542,0.000037036512,0.00088918826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935097,0.00031402617,0.00004240494,0.000052557825,0.0001371519,0.00010288949],"domain_scores_gemma":[0.99613756,0.0027422425,0.00017653346,0.00031834227,0.00050547876,0.00011971068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012032894,0.0005146975,0.00054188893,0.00071183965,0.0005869119,0.00067066454,0.0008695224,0.00069496775,0.0017886839],"category_scores_gemma":[0.0043027126,0.00022241191,0.00037095905,0.0007795142,0.000466109,0.0005771033,0.00055789656,0.00077597273,0.0001563436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080954786,0.00013037243,0.0021307126,0.000026995162,0.000018560882,0.00004671611,0.00005718005,0.989384,0.0010413649,0.0032066908,0.00025977055,0.0036165847],"study_design_scores_gemma":[0.000011290679,0.000035211793,0.00018812741,0.000002550162,0.000003936809,0.000005804438,0.000017549613,0.998741,0.0005088213,0.00029951413,0.00018316615,0.0000030907531],"about_ca_topic_score_codex":0.013748448,"about_ca_topic_score_gemma":0.0073917573,"teacher_disagreement_score":0.013748448,"about_ca_system_score_codex":0.0009506566,"about_ca_system_score_gemma":0.0011042156,"threshold_uncertainty_score":0.027336836},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Bandwidth (computing); Service provider; Computer network; Mobile social network; Service (business); Content distribution; Mobile device; Mobile computing; World Wide Web; Database","score_opus":0.018434612795476805,"score_gpt":0.23687394838477951,"score_spread":0.2184393355893027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128466234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44299737,0.00052864046,0.54912055,0.0011480974,0.000048571073,0.00019938311,0.00022392781,0.00046142805,0.005272094],"genre_scores_gemma":[0.98205537,0.00014266964,0.016357116,0.000036876834,0.00002775138,0.000041601554,0.00004626741,0.000024950781,0.0012673687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917656,0.00027721937,0.000028702003,0.00015433572,0.00016218588,0.00020087385],"domain_scores_gemma":[0.99646556,0.0023476696,0.00047685957,0.00019286336,0.00026747843,0.00024955327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014738791,0.0007539636,0.0009357375,0.0006112541,0.000746546,0.0008713964,0.0011075209,0.0008380809,0.0011683328],"category_scores_gemma":[0.007893194,0.00043496356,0.00027915716,0.0007328776,0.0010271883,0.001875049,0.0011183092,0.00058853725,0.00021783874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021706079,0.00006508136,0.0014796897,0.000054936027,0.000033582004,0.00014867976,0.00013473255,0.95906866,0.0048429742,0.014474226,0.0010354142,0.018445019],"study_design_scores_gemma":[0.000016527156,0.00002916447,0.00021087221,0.0000018866442,0.0000057477723,0.000021317292,0.000030714058,0.99317884,0.00039769127,0.0058776923,0.00022554673,0.0000039515276],"about_ca_topic_score_codex":0.005357451,"about_ca_topic_score_gemma":0.0042546536,"teacher_disagreement_score":0.005357451,"about_ca_system_score_codex":0.0018118903,"about_ca_system_score_gemma":0.00085926,"threshold_uncertainty_score":0.013146281},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer 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","score_opus":0.3571833005297325,"score_gpt":0.35182076279349317,"score_spread":0.005362537736239348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128508520","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012875914,0.21603785,0.043397512,0.6010722,0.008507075,0.00006037245,0.00041360394,0.0003493358,0.11728613],"genre_scores_gemma":[0.42980337,0.41082293,0.044304233,0.050596695,0.026072394,0.00030762667,0.0006817079,0.00021360438,0.037197497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819714,0.0006279938,0.00006820211,0.00027059176,0.00058392994,0.0002522159],"domain_scores_gemma":[0.98829204,0.006166163,0.0005188895,0.00071420457,0.002511733,0.0017969516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076527623,0.0005635343,0.0010812073,0.002092858,0.0027678327,0.009638458,0.002906413,0.00867492,0.020483613],"category_scores_gemma":[0.010027922,0.0005014923,0.00056211994,0.0028093236,0.0074664047,0.029126454,0.0029491293,0.00700908,0.0037431403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072152776,0.00010351921,0.0005440063,0.00051634334,0.00002021583,0.00014498085,0.00041547755,0.002948714,0.000481469,0.83940274,0.07134232,0.08400803],"study_design_scores_gemma":[0.000017662771,0.000037332546,0.00024194755,0.0004444625,0.000014822596,0.00019708858,0.0020474046,0.0067800144,0.00025160002,0.72259736,0.2673405,0.000029875493],"about_ca_topic_score_codex":0.002201714,"about_ca_topic_score_gemma":0.0027131308,"teacher_disagreement_score":0.020483613,"about_ca_system_score_codex":0.0037064673,"about_ca_system_score_gemma":0.004803204,"threshold_uncertainty_score":0.06852454},"labels":[],"label_agreement":null},{"id":"W2129582053","doi":"10.1109/wowmom.2011.5986461","title":"Predicting missing contacts in mobile social networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Popularity; Mobile social network; Wireless sensor network; Routing (electronic design automation); Social contact; Range (aeronautics); Computer network; Mobile device; Mobile computing; Distributed computing; Human–computer interaction; World Wide Web; Engineering","score_opus":0.04125896020187168,"score_gpt":0.24424877153658156,"score_spread":0.2029898113347099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129582053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8924525,0.0006754555,0.1043811,0.0003558156,0.000036193174,0.00007263686,0.0005677015,0.00029965365,0.0011590264],"genre_scores_gemma":[0.98993707,0.00017346036,0.009089511,0.00001900829,0.000031236432,0.000024608693,0.00042121817,0.000010406967,0.00029337572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915457,0.0003222478,0.000052512078,0.00018612125,0.0001661283,0.000118393225],"domain_scores_gemma":[0.9918378,0.0055208607,0.0010828093,0.00071131525,0.0004902975,0.00035694512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192977,0.0006894364,0.00081789424,0.002728747,0.000673913,0.0008258283,0.0011553768,0.001203569,0.00046767696],"category_scores_gemma":[0.012772649,0.0005456283,0.00043621918,0.0013073543,0.00063065835,0.0018311448,0.0008946344,0.00063521095,0.00032375456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010298764,0.0003747111,0.1716224,0.00037845003,0.00029749732,0.0018539738,0.0019524638,0.66340834,0.006228237,0.009178493,0.0040538907,0.13962168],"study_design_scores_gemma":[0.000014656322,0.000067331755,0.01133514,0.00001903504,0.000030125953,0.0002836195,0.00046277017,0.9743215,0.0011545368,0.011426451,0.0008713772,0.0000134408965],"about_ca_topic_score_codex":0.0039806077,"about_ca_topic_score_gemma":0.0053790854,"teacher_disagreement_score":0.0039806077,"about_ca_system_score_codex":0.0005465791,"about_ca_system_score_gemma":0.0002500842,"threshold_uncertainty_score":0.007914901},"labels":[],"label_agreement":null},{"id":"W2129802095","doi":"10.1002/wcm.935","title":"A secure and efficient RSU‐aided bundle forwarding protocol for vehicular delay tolerant networks","year":2010,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Computer network; Vehicular ad hoc network; Wireless ad hoc network; Protocol (science); Bundle; Vehicle-to-vehicle; Delay-tolerant networking; Wireless; Telecommunications","score_opus":0.020345983185051434,"score_gpt":0.29534081739854207,"score_spread":0.27499483421349064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129802095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064471975,0.00071305525,0.9309642,0.00041096768,0.00013066568,0.00024033483,0.000079989884,0.00058641576,0.0024023987],"genre_scores_gemma":[0.90016335,0.0003616776,0.096394405,0.00011625227,0.00007970366,0.00023304409,0.00018940642,0.000025058256,0.0024370265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894625,0.0003094341,0.00007362142,0.000098412675,0.0004511569,0.00012111052],"domain_scores_gemma":[0.99851996,0.00042103507,0.00033826008,0.0003315094,0.0003172569,0.00007201567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969245,0.000510228,0.0006357139,0.0008965476,0.0007619014,0.0006405581,0.0010925807,0.0007105376,0.0008581823],"category_scores_gemma":[0.0021061813,0.00030031215,0.00034712863,0.0006827534,0.00070762314,0.0014022712,0.0019784763,0.0006142436,0.0004048395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013212605,0.00034839753,0.003185357,0.00033491614,0.00025159467,0.0018060256,0.0013099316,0.39037085,0.100088194,0.13959725,0.012087323,0.3492989],"study_design_scores_gemma":[0.00009958688,0.00046705376,0.00038772885,0.00002088737,0.00004810121,0.0005212673,0.00010927939,0.9495782,0.014433888,0.022705723,0.011578317,0.000050017014],"about_ca_topic_score_codex":0.000790312,"about_ca_topic_score_gemma":0.0010781407,"teacher_disagreement_score":0.0011969245,"about_ca_system_score_codex":0.0005072479,"about_ca_system_score_gemma":0.0007326297,"threshold_uncertainty_score":0.0063300133},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Delay-tolerant networking; Path (computing); Computer network; Telecommunications; Routing (electronic design automation); Routing protocol","score_opus":0.021931698842242848,"score_gpt":0.22979669020705487,"score_spread":0.207864991364812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130741280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009277297,0.035338495,0.65496564,0.005825484,0.0046622697,0.0005388671,0.0010134601,0.0047363085,0.2836422],"genre_scores_gemma":[0.42362654,0.08619054,0.26540554,0.0058960104,0.0041851504,0.00087477645,0.004092598,0.00080179045,0.20892699],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896955,0.00014578189,0.000046959107,0.00018197346,0.0005326503,0.0001230984],"domain_scores_gemma":[0.99884653,0.00024695008,0.00010600367,0.00028786904,0.00038026375,0.00013233522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068456336,0.00071178534,0.0005901738,0.00085832016,0.0011186145,0.0028707501,0.0016227376,0.0012369768,0.013029126],"category_scores_gemma":[0.0021463742,0.00024665883,0.0003426547,0.0011676875,0.0008098829,0.0026508966,0.0021694181,0.001476942,0.006926538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015083828,0.00011624917,0.000982995,0.0008741434,0.00007064882,0.00042038327,0.00026159006,0.021684915,0.015866453,0.29062515,0.1077696,0.561177],"study_design_scores_gemma":[0.00002046867,0.00012545075,0.00045572536,0.0002449397,0.000034569075,0.0010397511,0.00015949646,0.040835377,0.006522604,0.1331533,0.8173474,0.00006092458],"about_ca_topic_score_codex":0.00087724754,"about_ca_topic_score_gemma":0.00094161957,"teacher_disagreement_score":0.013029126,"about_ca_system_score_codex":0.00093113095,"about_ca_system_score_gemma":0.0009145666,"threshold_uncertainty_score":0.04358679},"labels":[],"label_agreement":null},{"id":"W2131773335","doi":"10.1109/icc.2013.6654791","title":"Social profile-based multicast routing scheme for delay-tolerant networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Multicast; Unicast; Geocast; Distributed computing; Delay-tolerant networking; Flooding (psychology); Protocol Independent Multicast; Wireless ad hoc network; Routing (electronic design automation); Node (physics); Source-specific multicast; Scheme (mathematics); Routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Wireless; Telecommunications; Engineering","score_opus":0.0308662894110808,"score_gpt":0.2630562023806117,"score_spread":0.23218991296953093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131773335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088646375,0.00060906744,0.90159243,0.00073266675,0.00026443426,0.00053664064,0.00027782333,0.00094999495,0.0063905707],"genre_scores_gemma":[0.85740685,0.00031341074,0.13789473,0.00017296124,0.00008486145,0.00029968543,0.00035460992,0.000028138802,0.0034448004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00021339678,0.00005308644,0.00008851695,0.00021704708,0.000077144985],"domain_scores_gemma":[0.9990344,0.0001840936,0.00014940891,0.0002319747,0.00027728148,0.00012280178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093749556,0.00049864023,0.00078321743,0.0012434166,0.0018209725,0.0006990223,0.0016444988,0.000882251,0.00078250276],"category_scores_gemma":[0.0020811716,0.00014935854,0.0005427165,0.0008027423,0.0004012459,0.0016661953,0.001780476,0.0006666737,0.0003549618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011654149,0.000759207,0.0050715003,0.00043171062,0.00028585398,0.0012590719,0.0021495577,0.114694856,0.08087511,0.16534598,0.016863944,0.6110978],"study_design_scores_gemma":[0.000119447184,0.0005948443,0.0012641236,0.000038354683,0.00013252035,0.0012231612,0.00040948,0.90580624,0.020686528,0.042219657,0.027371446,0.00013420358],"about_ca_topic_score_codex":0.0015738808,"about_ca_topic_score_gemma":0.0020247935,"teacher_disagreement_score":0.0018209725,"about_ca_system_score_codex":0.0010946763,"about_ca_system_score_gemma":0.00081999187,"threshold_uncertainty_score":0.007942438},"labels":[],"label_agreement":null},{"id":"W2132753097","doi":"10.1109/lcn.2010.5735795","title":"Managing Presence and Policies in Social Network dependent systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Popularity; Computer science; Aggregate (composite); Social network (sociolinguistics); World Wide Web; Information exchange; Join (topology); Data science; Computer security; Social media","score_opus":0.017014066024021588,"score_gpt":0.24723488845718847,"score_spread":0.23022082243316688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132753097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20040745,0.0006548018,0.7831585,0.003146088,0.00020757658,0.00046857353,0.0002984847,0.0033766972,0.008281786],"genre_scores_gemma":[0.92245567,0.00029948787,0.07228849,0.00030139065,0.00013782768,0.00021603687,0.00035764495,0.00014091049,0.0038026532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99390703,0.0021210564,0.00063911243,0.0012254954,0.0014562474,0.0006510096],"domain_scores_gemma":[0.9787017,0.011599463,0.0023547004,0.0037205166,0.0019821909,0.0016413544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075905453,0.0007891509,0.0012609438,0.0015288573,0.0032978363,0.006665237,0.0031365396,0.0024525754,0.001213191],"category_scores_gemma":[0.0248643,0.0010453649,0.00063682423,0.001375308,0.0037866195,0.012342899,0.0061575975,0.0027166167,0.00045567387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005925949,0.0007014177,0.018307963,0.00028785094,0.00024787858,0.0022708534,0.0036254271,0.5399054,0.009352147,0.31456864,0.005878902,0.10426091],"study_design_scores_gemma":[0.000057990525,0.000066649925,0.000851902,0.000024161414,0.000059811995,0.00024030764,0.00055404246,0.84129053,0.003940064,0.14283764,0.010012862,0.0000640031],"about_ca_topic_score_codex":0.005303902,"about_ca_topic_score_gemma":0.0042465706,"teacher_disagreement_score":0.0075905453,"about_ca_system_score_codex":0.002600964,"about_ca_system_score_gemma":0.002687993,"threshold_uncertainty_score":0.040143132},"labels":[],"label_agreement":null},{"id":"W2133703098","doi":"10.1109/tpds.2012.23","title":"Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Routing (electronic design automation); Wireless Routing Protocol; Zone Routing Protocol; Channel (broadcasting); Dynamic Source Routing; Wireless; Protocol (science); Telecommunications","score_opus":0.03798366065885279,"score_gpt":0.278229920591184,"score_spread":0.24024625993233123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133703098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0468343,0.0009450563,0.94861275,0.00030918376,0.00017849664,0.00010143726,0.000030819327,0.00043883733,0.0025490469],"genre_scores_gemma":[0.9138119,0.00055095344,0.08335962,0.00012631761,0.000092132934,0.00019650921,0.00007032478,0.000032781973,0.0017593692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00009144735,0.00002461744,0.000046571877,0.00012323237,0.000035979276],"domain_scores_gemma":[0.99920815,0.00034218223,0.0001389454,0.00011092103,0.00014875864,0.000051149345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006514306,0.0003350456,0.00040066932,0.0005519589,0.0005974188,0.0005073923,0.0013745014,0.000395717,0.00043684235],"category_scores_gemma":[0.0020785667,0.00015839121,0.00028493462,0.0004962693,0.0004738265,0.0009002305,0.0007996286,0.0006127064,0.000099128614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029805864,0.00018686065,0.0034298373,0.00031464233,0.00020553074,0.0011813228,0.0006719267,0.573593,0.050026257,0.16193454,0.0059190826,0.20223893],"study_design_scores_gemma":[0.000015915202,0.00006886894,0.00020374353,0.0000074761056,0.000023125609,0.00017435022,0.000029429037,0.9876451,0.0016504268,0.006997746,0.003170923,0.0000130643],"about_ca_topic_score_codex":0.0009816273,"about_ca_topic_score_gemma":0.0017347215,"teacher_disagreement_score":0.0013745014,"about_ca_system_score_codex":0.0005353433,"about_ca_system_score_gemma":0.00073658855,"threshold_uncertainty_score":0.0038841963},"labels":[],"label_agreement":null},{"id":"W2134759640","doi":"10.5194/isprsarchives-xl-4-273-2014","title":"Towards a Location-based Service for Early Mental Health Interventions in Disaster Response Using Minimalistic Tele-operated Android Robots Technology","year":2014,"lang":"en","type":"article","venue":"˜The œinternational archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mental health; Android (operating system); Autonomy; Computer science; Computer security; Psychological intervention; Robot; Process management; Engineering; Psychology; Nursing; Artificial intelligence; Medicine; Political science; Psychiatry","score_opus":0.02882805356345305,"score_gpt":0.288694161169162,"score_spread":0.259866107605709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134759640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24370623,0.0007736889,0.7199423,0.0019141572,0.00023915707,0.00073771196,0.00024837398,0.005329267,0.027109174],"genre_scores_gemma":[0.8224807,0.00028108733,0.16869555,0.00023719616,0.00003927367,0.00021105037,0.00015577216,0.00005242413,0.0078469375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966633,0.000103991166,0.000023312405,0.000055355264,0.00009976204,0.00005123667],"domain_scores_gemma":[0.999566,0.00008694472,0.000044248824,0.00007801958,0.00014926007,0.00007548314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033963058,0.00032860402,0.00020713244,0.00038607095,0.00046946312,0.0009881218,0.000908063,0.0006417869,0.0033194213],"category_scores_gemma":[0.0010216866,0.00014853451,0.00024085773,0.00022117417,0.00041911338,0.0010987573,0.0016312095,0.00046556417,0.0010947968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013964642,0.0005501487,0.017287228,0.0015546944,0.00011896258,0.0033662217,0.006781634,0.015242009,0.19216688,0.044822514,0.022417298,0.69429594],"study_design_scores_gemma":[0.0003845822,0.0030269877,0.038860906,0.0006866133,0.0004760138,0.006405784,0.011154925,0.5165138,0.11935648,0.02746616,0.275268,0.00039964067],"about_ca_topic_score_codex":0.0028958747,"about_ca_topic_score_gemma":0.0032462103,"teacher_disagreement_score":0.0033194213,"about_ca_system_score_codex":0.00034118377,"about_ca_system_score_gemma":0.00059860403,"threshold_uncertainty_score":0.011104524},"labels":[],"label_agreement":null},{"id":"W2134928001","doi":"10.1109/jsyst.2010.2065093","title":"Relational Attribute Integrated Matching Analysis (RAIMA): A Framework for the Design of Self-Adaptive Egocentric Social Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Matching (statistics); Inference; Context (archaeology); Visualization; Order (exchange); Social computing; Social network analysis; Data science; Artificial intelligence; World Wide Web; Social media","score_opus":0.05095727209843758,"score_gpt":0.26698986386127477,"score_spread":0.21603259176283718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134928001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010232052,0.00009355257,0.9977539,0.0001014197,0.000010172206,0.000060612354,0.000042482934,0.00015456784,0.00076017244],"genre_scores_gemma":[0.06600475,0.00026737028,0.9319526,0.00008642576,0.000035905712,0.00026976608,0.00019225883,0.000083051054,0.001107892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625885,0.0017840143,0.00021741848,0.00069249095,0.00087593583,0.00017127933],"domain_scores_gemma":[0.9973369,0.001207887,0.00035934523,0.0005222263,0.00041846329,0.00015511653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055750804,0.0008622409,0.0010195854,0.00240373,0.0013318215,0.0028459732,0.0033342976,0.0011432698,0.0032338598],"category_scores_gemma":[0.011315861,0.0006290234,0.001960492,0.0025745523,0.002032985,0.0041630385,0.0032555196,0.0017397742,0.0008238358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000681237,0.00009752771,0.0017791428,0.00023390127,0.0001875657,0.00017290603,0.00088026683,0.16349818,0.0024302814,0.64440197,0.003869648,0.18238048],"study_design_scores_gemma":[0.000014514929,0.000053814114,0.00031018813,0.000052175637,0.000050886567,0.00012917488,0.00016076563,0.66747296,0.0013362513,0.30937484,0.021015484,0.00002891176],"about_ca_topic_score_codex":0.0038454104,"about_ca_topic_score_gemma":0.0043089376,"teacher_disagreement_score":0.0055750804,"about_ca_system_score_codex":0.0017335825,"about_ca_system_score_gemma":0.0022131926,"threshold_uncertainty_score":0.029484153},"labels":[],"label_agreement":null},{"id":"W2137242749","doi":"10.1109/ccece.2007.92","title":"Online Routing of Stochastically Arriving Bundles in Delay Tolerant Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bundle; Computer science; Computer network; Node (physics); Distributed computing; Routing (electronic design automation); The Internet; Network packet; Routing protocol; Engineering","score_opus":0.018505025145374457,"score_gpt":0.25648125757825563,"score_spread":0.23797623243288119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137242749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1614609,0.000189403,0.8365126,0.00025120456,0.000035729237,0.000054304106,0.00005512194,0.00039088406,0.0010498372],"genre_scores_gemma":[0.95369285,0.00013689096,0.044687096,0.00005235347,0.000031106418,0.000051806786,0.00007119203,0.000049943694,0.0012267357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987764,0.0004149686,0.00007661053,0.00025201833,0.00028326074,0.00019676759],"domain_scores_gemma":[0.99632347,0.0020267973,0.00084017933,0.0003130662,0.00025583975,0.00024067616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021045052,0.00054896745,0.0010249849,0.0006945054,0.0010035546,0.001358643,0.0012592755,0.000705578,0.00072524586],"category_scores_gemma":[0.00531056,0.0009097739,0.0004067836,0.00055439165,0.0012241802,0.0016836966,0.0009912957,0.0006609182,0.00014209488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013043755,0.000048567323,0.0012632095,0.000023967914,0.00002656543,0.0001123503,0.00012735181,0.9648254,0.0027069284,0.017227547,0.00036786622,0.013139786],"study_design_scores_gemma":[0.000004802528,0.000017748838,0.00013837813,0.000001412951,0.000004414497,0.000017662638,0.000012598348,0.9888545,0.0004248109,0.010317004,0.00020137164,0.000005314804],"about_ca_topic_score_codex":0.0033082473,"about_ca_topic_score_gemma":0.0037707263,"teacher_disagreement_score":0.0033082473,"about_ca_system_score_codex":0.0016476098,"about_ca_system_score_gemma":0.0006745517,"threshold_uncertainty_score":0.011954248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Computer network; Correctness; Routing protocol; Coding (social sciences); Distributed computing; Wireless network; Wireless; Network packet; Algorithm; Telecommunications","score_opus":0.06992630000424571,"score_gpt":0.30718141671008253,"score_spread":0.23725511670583682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139352451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066158876,0.0012308835,0.9133627,0.0016734349,0.00014003241,0.00008486586,0.0001875543,0.00016523882,0.01699636],"genre_scores_gemma":[0.95625275,0.001784961,0.032506347,0.0002765178,0.00016424905,0.0002685165,0.00017106911,0.0000875124,0.0084879575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877685,0.0005872544,0.000038809907,0.000086877066,0.00031832966,0.0001918422],"domain_scores_gemma":[0.9914534,0.006403474,0.0007920189,0.00026306784,0.0008276467,0.00026032954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027132845,0.00072480435,0.0008516163,0.0012602727,0.0007168634,0.0013984812,0.0010084886,0.0013808609,0.0020016255],"category_scores_gemma":[0.014406305,0.0005380902,0.0007134981,0.0008909921,0.0024238739,0.0018858837,0.0013485972,0.0013751443,0.0002438912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002188085,0.000012873582,0.00037576904,0.000036076184,0.000016700871,0.00008068442,0.00008320626,0.5790813,0.00068873493,0.41652852,0.0008058615,0.0022683938],"study_design_scores_gemma":[0.0000055208607,0.0000053975446,0.00006815199,0.000007097571,0.000003468094,0.000012183476,0.000014974387,0.94228053,0.0000629409,0.057180792,0.00035165143,0.0000072764183],"about_ca_topic_score_codex":0.008863493,"about_ca_topic_score_gemma":0.0039757523,"teacher_disagreement_score":0.008863493,"about_ca_system_score_codex":0.0029052608,"about_ca_system_score_gemma":0.0015491144,"threshold_uncertainty_score":0.021079242},"labels":[],"label_agreement":null},{"id":"W2140353984","doi":"10.1109/wocn.2005.1436038","title":"Replica update strategies in mobile ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Replica; Mobile ad hoc network; Computer network; Unavailability; Wireless ad hoc network; Distributed computing; Scalability; Overhead (engineering); Node (physics); Consistency (knowledge bases); Vehicular ad hoc network; Network topology; Mobile computing; Data consistency; Consistency model; Eventual consistency; Engineering; Database; Wireless; Telecommunications","score_opus":0.012197156891723565,"score_gpt":0.24646668415219977,"score_spread":0.2342695272604762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140353984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07927801,0.007249562,0.90512824,0.00040873472,0.00028197438,0.00028061055,0.00005420572,0.0010339076,0.0062847547],"genre_scores_gemma":[0.86715496,0.002160283,0.12654771,0.00010605903,0.00016990538,0.00020746846,0.00007752603,0.00006492422,0.0035112004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992692,0.00030511068,0.000055831435,0.000081211016,0.00024058956,0.000047999893],"domain_scores_gemma":[0.9970421,0.0015369973,0.00027032508,0.00059894903,0.0004520061,0.00009961333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014477673,0.0005652205,0.0008084352,0.00096760894,0.0006770032,0.00095457386,0.0016579563,0.0008074116,0.0008923991],"category_scores_gemma":[0.00618297,0.0003058145,0.00026387305,0.0009839643,0.0006338433,0.001882813,0.00072979636,0.00046585407,0.0003196214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047730355,0.00021143508,0.0031626194,0.00042997222,0.00015936277,0.0009669357,0.0010518354,0.4275425,0.02422658,0.06152343,0.004612214,0.4756358],"study_design_scores_gemma":[0.00011295392,0.0002893041,0.00042386193,0.00003359571,0.00007063651,0.00056407636,0.00019986203,0.949721,0.006344982,0.033181455,0.009023256,0.000035005647],"about_ca_topic_score_codex":0.001160035,"about_ca_topic_score_gemma":0.0010292595,"teacher_disagreement_score":0.0016579563,"about_ca_system_score_codex":0.00042694775,"about_ca_system_score_gemma":0.00036204432,"threshold_uncertainty_score":0.007656634},"labels":[],"label_agreement":null},{"id":"W2140551145","doi":"10.1109/lcn.2009.5355060","title":"Using passive RFID tags for vehicle-assisted data dissemination in intelligent transportation systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Exploit; Intelligent transportation system; Vehicular ad hoc network; Computer science; Scheme (mathematics); Dissemination; Vehicular communication systems; Computer network; Communications system; Government (linguistics); Telecommunications; Embedded system; Computer security; Wireless ad hoc network; Wireless; Transport engineering; Engineering","score_opus":0.10700923721735524,"score_gpt":0.3443556933207333,"score_spread":0.23734645610337807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140551145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051597133,0.0024622167,0.94046426,0.0002183831,0.00011800045,0.00006771919,0.000019956662,0.00035512904,0.0046972423],"genre_scores_gemma":[0.9191776,0.0017102887,0.07448109,0.000117151256,0.000072086674,0.00004998043,0.000046914134,0.000017481781,0.0043274164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999729,0.00008371373,0.000018574818,0.000063332336,0.00008007248,0.000025275993],"domain_scores_gemma":[0.999634,0.00016132773,0.00006151311,0.00005742889,0.00007349534,0.000012148255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033582537,0.00031152304,0.00022932996,0.0003891063,0.00029819575,0.0005548899,0.0007781268,0.00058599806,0.0004087519],"category_scores_gemma":[0.00083321764,0.00013477798,0.00020977308,0.0005146808,0.0004011771,0.0011299002,0.00042740893,0.00028659328,0.00022191793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037822526,0.0002124093,0.0033157857,0.000970144,0.000095061376,0.0005825559,0.00065000774,0.120270595,0.2550671,0.07415399,0.0036122547,0.54069185],"study_design_scores_gemma":[0.00006233346,0.0010925835,0.0015434752,0.000071627444,0.00016836375,0.0015172114,0.00027220362,0.77864105,0.14056495,0.016353428,0.059612326,0.00010056835],"about_ca_topic_score_codex":0.0005510931,"about_ca_topic_score_gemma":0.00054087443,"teacher_disagreement_score":0.0007781268,"about_ca_system_score_codex":0.00035093253,"about_ca_system_score_gemma":0.000288144,"threshold_uncertainty_score":0.0025462508},"labels":[],"label_agreement":null},{"id":"W2140811101","doi":"10.1002/sec.1082","title":"ReDD: recommendation‐based data dissemination in privacy‐preserving mobile social networks","year":2014,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Dissemination; Computer security; Network packet; Authentication (law); Internet privacy; Computer network; Protocol (science); Social network (sociolinguistics); Confidentiality; Quality (philosophy); Mobile phone; World Wide Web; Social media; Telecommunications","score_opus":0.02557547304041716,"score_gpt":0.2935082090601328,"score_spread":0.2679327360197156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140811101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03713148,0.0012892823,0.9537785,0.00095602224,0.00018469508,0.00060858624,0.00043382117,0.0025995173,0.0030181108],"genre_scores_gemma":[0.7876751,0.0007375167,0.20474957,0.00044552085,0.00014487034,0.00051257893,0.00054222316,0.000057087203,0.005135534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960681,0.0014276092,0.00037311978,0.00072533346,0.0011239081,0.00028199173],"domain_scores_gemma":[0.9938676,0.0022737423,0.0007486923,0.0017294304,0.0010797225,0.00030085156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038218847,0.0007329206,0.0012469621,0.0016110076,0.0013958067,0.0012690024,0.002456503,0.001817855,0.0015236237],"category_scores_gemma":[0.008205742,0.00047294394,0.00084386405,0.0017654946,0.0008167303,0.0027888333,0.0027948644,0.001262179,0.00059798587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017165208,0.0006999936,0.008632847,0.0009537413,0.00062574976,0.0014736876,0.0012263755,0.31570095,0.048771754,0.053278293,0.020239288,0.5466808],"study_design_scores_gemma":[0.00013751273,0.00032108,0.0008473186,0.000028705836,0.000065870685,0.00040619448,0.0001605269,0.9632806,0.0101917405,0.013026163,0.011460302,0.00007397245],"about_ca_topic_score_codex":0.004147482,"about_ca_topic_score_gemma":0.003365109,"teacher_disagreement_score":0.004147482,"about_ca_system_score_codex":0.0011614563,"about_ca_system_score_gemma":0.001344713,"threshold_uncertainty_score":0.020212293},"labels":[],"label_agreement":null},{"id":"W2141368513","doi":"10.1145/2507924.2507966","title":"Efficient relay deployment for controlling connectivity in delay tolerant mobile networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Computer network; Software deployment; Network partition; Node (physics); Greedy algorithm; Heuristic; Partition (number theory); Disjoint sets; Path (computing); Distributed computing; Transmission (telecommunications); Algorithm; Telecommunications; Engineering; Mathematics","score_opus":0.013268947542677954,"score_gpt":0.23213197519123402,"score_spread":0.21886302764855606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141368513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12270925,0.0009833474,0.87261087,0.00020714435,0.000049099475,0.00015739696,0.00008469627,0.0008058132,0.0023924187],"genre_scores_gemma":[0.8669508,0.00035165454,0.13182256,0.00003348435,0.000018119905,0.00008185345,0.00008488067,0.000034357283,0.0006223499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967086,0.00013717644,0.000017290253,0.000063163505,0.000058887497,0.00005271301],"domain_scores_gemma":[0.9989882,0.00061989314,0.00017145826,0.00011016623,0.00006545141,0.000044701203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058239244,0.0007970933,0.0005309198,0.00076652574,0.00057878805,0.0004904087,0.000859219,0.0005672708,0.00059909286],"category_scores_gemma":[0.0023892066,0.00029951837,0.00024995476,0.000701775,0.0006186836,0.0008736282,0.0006352433,0.0002939241,0.0002186232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016619959,0.000043428463,0.0010641045,0.000116990115,0.00002579503,0.00018784161,0.00018927391,0.9117129,0.013833532,0.009262759,0.0010866454,0.062310606],"study_design_scores_gemma":[0.000035218978,0.00012831265,0.0003632522,0.000010433371,0.00001804266,0.0001879219,0.00010701148,0.9854696,0.005917868,0.005829488,0.0019196763,0.000013229795],"about_ca_topic_score_codex":0.0018051586,"about_ca_topic_score_gemma":0.0023453191,"teacher_disagreement_score":0.0018051586,"about_ca_system_score_codex":0.000681676,"about_ca_system_score_gemma":0.00039083313,"threshold_uncertainty_score":0.0049459934},"labels":[],"label_agreement":null},{"id":"W2141453446","doi":"10.1007/s11036-010-0241-y","title":"DFMAC: DTN-Friendly Medium Access Control for Wireless Local Area Networks Supporting Voice/Data Services","year":2010,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Roaming; Computer network; Computer science; Node (physics); Access control; Wi-Fi; Wireless; Local area network; Wireless network; Delay-tolerant networking; Scheme (mathematics); Wireless ad hoc network; Telecommunications; Vehicular ad hoc network","score_opus":0.015146433459554267,"score_gpt":0.2835256832422676,"score_spread":0.2683792497827134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141453446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02399972,0.0021491796,0.941349,0.00060001144,0.0013136469,0.0005181351,0.00085414463,0.012414458,0.01680168],"genre_scores_gemma":[0.7162337,0.0010511944,0.24891011,0.0013254929,0.0005957075,0.0005968553,0.0017048419,0.0004874198,0.029094774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995442,0.000057492118,0.000028801254,0.000060704668,0.00019707967,0.00011159868],"domain_scores_gemma":[0.999253,0.00013218747,0.0000616235,0.0001340295,0.00034234888,0.00007682784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007810564,0.0006176726,0.00060058705,0.00089471415,0.0009623835,0.0010424322,0.0010995237,0.0005872737,0.003984879],"category_scores_gemma":[0.0019564983,0.00019346831,0.00021216374,0.0004892463,0.000470082,0.00068392203,0.0009747564,0.0010491537,0.0010476456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012139848,0.0003460688,0.0015010053,0.00044888706,0.00008469675,0.0006265636,0.0003339398,0.031439297,0.10995098,0.07024403,0.09328077,0.6905297],"study_design_scores_gemma":[0.00017063363,0.00045789828,0.0011203664,0.00006838301,0.0001023528,0.00082850404,0.000067611916,0.746828,0.056101106,0.019856958,0.17429633,0.00010196523],"about_ca_topic_score_codex":0.005227703,"about_ca_topic_score_gemma":0.011321805,"teacher_disagreement_score":0.005227703,"about_ca_system_score_codex":0.0009374111,"about_ca_system_score_gemma":0.001059745,"threshold_uncertainty_score":0.013330698},"labels":[],"label_agreement":null},{"id":"W2141984911","doi":"10.1109/pacrim.1997.619986","title":"An Internet protocol for flexible, scalable, and secure interaction with ubiquitous computing devices","year":2002,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Internet layer; Computer science; Resource Reservation Protocol; Computer network; Scalability; The Internet; Session Initiation Protocol; Protocol (science); Ubiquitous computing; Internet Protocol Control Protocol; Internet Protocol; Distributed computing; World Wide Web; Server; User Datagram Protocol; Operating system","score_opus":0.04610351199062404,"score_gpt":0.3061981546182973,"score_spread":0.26009464262767323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141984911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004505443,0.004631215,0.9451158,0.002783138,0.0020308017,0.000953503,0.0002646222,0.0026137857,0.037101608],"genre_scores_gemma":[0.11094405,0.010383161,0.83829796,0.002236094,0.0016563889,0.0036013536,0.0010561699,0.00043356058,0.031391244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984993,0.00034702328,0.00016203144,0.00010923978,0.0007753596,0.00010710615],"domain_scores_gemma":[0.9991917,0.00018476814,0.00008537496,0.00019705133,0.00023627156,0.000104791885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019114481,0.0008470467,0.0006651623,0.0010621591,0.0017397841,0.0021052544,0.0015207379,0.0015739744,0.0034972928],"category_scores_gemma":[0.0027130805,0.00052414223,0.00066438684,0.0011065423,0.0016612113,0.004964529,0.0025697348,0.0025977844,0.0019686786],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010763567,0.00014191565,0.00031727977,0.0005680227,0.000082602724,0.0012581432,0.00058218936,0.005950108,0.024938116,0.6555506,0.06735283,0.24315044],"study_design_scores_gemma":[0.00012762233,0.0002914959,0.0005037876,0.0003377316,0.00013270674,0.0022775142,0.00020679818,0.04597931,0.014375265,0.14962193,0.7859962,0.00014960387],"about_ca_topic_score_codex":0.0007845485,"about_ca_topic_score_gemma":0.0011800549,"teacher_disagreement_score":0.0034972928,"about_ca_system_score_codex":0.0006855397,"about_ca_system_score_gemma":0.0017379574,"threshold_uncertainty_score":0.011699617},"labels":[],"label_agreement":null},{"id":"W2143830146","doi":"10.1109/iscc.2003.1214094","title":"A scalable network architecture for distributed virtual environments with dynamic QoS over 1Pv6","year":2004,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Quality of service; Distributed computing; Computer network; Adaptation (eye); IPv6; Network architecture; Architecture; Virtual network; IPv4; Virtual reality; The Internet; Human–computer interaction; Operating system","score_opus":0.006043501552178677,"score_gpt":0.202214024166947,"score_spread":0.19617052261476833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143830146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047681265,0.00069573004,0.9385839,0.00057927123,0.00015330386,0.00019619403,0.0001164165,0.003243719,0.008750215],"genre_scores_gemma":[0.5377341,0.00070539454,0.4518178,0.00015103287,0.00009480952,0.00035943638,0.0005773934,0.00015784921,0.008402183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971014,0.00006212539,0.000022332213,0.00004829314,0.00011801703,0.000039127368],"domain_scores_gemma":[0.9996044,0.00007949705,0.000037205864,0.00008245842,0.00013174016,0.00006464266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728573,0.0003344061,0.00027231657,0.0004137803,0.0008277904,0.0010316485,0.001324109,0.000506748,0.0017398769],"category_scores_gemma":[0.0010585791,0.00022016172,0.00025926353,0.0004108123,0.00046411506,0.0013031289,0.0010884762,0.0006216849,0.0003594182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045926488,0.00025208946,0.0017231632,0.00038601903,0.00009842799,0.00060147716,0.00055572507,0.36825418,0.095412545,0.20979846,0.019461934,0.3029966],"study_design_scores_gemma":[0.000050838906,0.00021117525,0.00058100396,0.0000325694,0.000052503,0.00023961283,0.00009772409,0.9194569,0.010989852,0.030609962,0.037629217,0.00004861767],"about_ca_topic_score_codex":0.0029867666,"about_ca_topic_score_gemma":0.0045408946,"teacher_disagreement_score":0.0029867666,"about_ca_system_score_codex":0.0010849667,"about_ca_system_score_gemma":0.00087098667,"threshold_uncertainty_score":0.007872045},"labels":[],"label_agreement":null},{"id":"W2144076504","doi":"10.1109/icecs.2009.5410752","title":"Trust management in opportunistic pervasive healthcare systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Exploit; Computer science; Ubiquitous computing; Trust management (information system); Computer security; Health care; Trustworthiness; Wireless sensor network; Data sharing; Wireless; Computer network; Human–computer interaction; Telecommunications","score_opus":0.030593750927058953,"score_gpt":0.2629336671717981,"score_spread":0.23233991624473915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144076504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19904914,0.0010853162,0.7807328,0.0024823311,0.00013616023,0.00023050753,0.00011164734,0.00037493292,0.015797086],"genre_scores_gemma":[0.9829706,0.00017677528,0.014964149,0.00007236145,0.000026192463,0.00005653263,0.000030856587,0.000010919237,0.0016916135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764305,0.00108113,0.00017241668,0.00032409996,0.00048079505,0.00029840492],"domain_scores_gemma":[0.9942346,0.0031424619,0.001079936,0.00057353923,0.0005399057,0.00042950906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028299328,0.00037185752,0.00049499184,0.00041313688,0.0012285443,0.0018387764,0.0008622104,0.00084501144,0.0011440841],"category_scores_gemma":[0.011333933,0.00035127028,0.00030249832,0.00045149348,0.0014565678,0.002224212,0.0022486206,0.0006803958,0.00016430432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006187875,0.0001708659,0.011189151,0.00027925282,0.00019958794,0.0025729989,0.0029803775,0.5819073,0.005371773,0.29521412,0.0041080527,0.095387705],"study_design_scores_gemma":[0.000070285256,0.00011932425,0.0012336946,0.000031063093,0.0000428995,0.00047787864,0.00063045253,0.85031885,0.0012559257,0.13720247,0.008577257,0.000039935814],"about_ca_topic_score_codex":0.0051166923,"about_ca_topic_score_gemma":0.0032673248,"teacher_disagreement_score":0.0051166923,"about_ca_system_score_codex":0.0014865318,"about_ca_system_score_gemma":0.0014124708,"threshold_uncertainty_score":0.014966309},"labels":[],"label_agreement":null},{"id":"W2144388829","doi":"10.1145/2068897.2068928","title":"Motion-based routing for opportunistic ad-hoc networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Distributed computing; Routing protocol; Geographic routing; Wireless ad hoc network; Static routing; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.07246146750988519,"score_gpt":0.24342549897010773,"score_spread":0.17096403146022254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144388829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040111765,0.003846276,0.9839934,0.000673145,0.00051384995,0.00026106377,0.00008718977,0.00052573485,0.0060881567],"genre_scores_gemma":[0.37779227,0.007130725,0.60312164,0.00070749584,0.00071537425,0.0010724333,0.0004990416,0.00016403738,0.008797031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904543,0.00031688003,0.00007549939,0.0000897397,0.00040715138,0.000065275504],"domain_scores_gemma":[0.9987721,0.00055327354,0.00014475266,0.00030083515,0.00017271901,0.00005622187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012645537,0.0006735258,0.00063938514,0.00076988514,0.0009672808,0.0009882343,0.0020545668,0.0009045308,0.0020019934],"category_scores_gemma":[0.0036984012,0.00031342782,0.0004595183,0.0009462631,0.0010054149,0.0023419221,0.0017137399,0.0009915044,0.00047166465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015686855,0.000083285326,0.0006959566,0.00074986607,0.00011809438,0.0005236512,0.00033301773,0.14591283,0.013237533,0.5785001,0.014591127,0.2450976],"study_design_scores_gemma":[0.000082828185,0.00018488738,0.00036899993,0.00013534677,0.00009063375,0.0007202564,0.00010155437,0.6535631,0.004567285,0.21976866,0.120326795,0.00008957493],"about_ca_topic_score_codex":0.0009172003,"about_ca_topic_score_gemma":0.0013695119,"teacher_disagreement_score":0.0020545668,"about_ca_system_score_codex":0.00086174434,"about_ca_system_score_gemma":0.0006569896,"threshold_uncertainty_score":0.0066973567},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01117332777418436,"score_gpt":0.2269275386593774,"score_spread":0.21575421088519303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145473395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09517945,0.0002654675,0.8757147,0.00029639964,0.000233126,0.0008733188,0.00022615398,0.008294824,0.018916644],"genre_scores_gemma":[0.7566537,0.00018532242,0.23114693,0.0001629306,0.00002990339,0.00050608243,0.00035511007,0.0002751608,0.010684865],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950826,0.00008736791,0.000038251877,0.00008875915,0.00017684621,0.000100509125],"domain_scores_gemma":[0.999624,0.000058887937,0.0000339097,0.00007797144,0.00014953045,0.00005564243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842842,0.00030888943,0.00047047582,0.00039763327,0.00056318584,0.0012795555,0.0016963619,0.0006654508,0.00656918],"category_scores_gemma":[0.0010447009,0.00029561136,0.00020176648,0.00022730719,0.00040689667,0.0008545765,0.0007447359,0.0006169748,0.0016585689],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021219777,0.0009436387,0.0073405765,0.0011548062,0.00023973343,0.0009449098,0.0010845228,0.28671515,0.17977375,0.09341672,0.014628258,0.411636],"study_design_scores_gemma":[0.00037077564,0.0010293344,0.0016201218,0.00008864286,0.00013683003,0.00043235766,0.0002533933,0.8075738,0.10921462,0.010234744,0.068957545,0.0000878325],"about_ca_topic_score_codex":0.0017819139,"about_ca_topic_score_gemma":0.0018103161,"teacher_disagreement_score":0.00656918,"about_ca_system_score_codex":0.00051203725,"about_ca_system_score_gemma":0.0013457546,"threshold_uncertainty_score":0.021976113},"labels":[],"label_agreement":null},{"id":"W2146769390","doi":"10.1007/s11036-013-0446-y","title":"RCare: Extending Secure Health Care to Rural Area Using VANETs","year":2013,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Computer security; Relay; Routing (electronic design automation); Incentive; Cryptography","score_opus":0.011111968952170507,"score_gpt":0.25643006032536575,"score_spread":0.24531809137319524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146769390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08004525,0.0011181064,0.8515112,0.0019125474,0.0009135689,0.001084138,0.0010686908,0.020327827,0.0420187],"genre_scores_gemma":[0.7756763,0.0010203025,0.19016972,0.00080799864,0.00015309254,0.00033645928,0.002292337,0.00055841706,0.028985305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958175,0.00011101934,0.000026654427,0.000060188697,0.00011842046,0.00010196163],"domain_scores_gemma":[0.999416,0.00011686984,0.000052012543,0.0002176622,0.000100937556,0.000096489326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006890857,0.0004758298,0.000310059,0.0005424517,0.0004303314,0.0008029807,0.0013563334,0.00064512977,0.004782702],"category_scores_gemma":[0.0012688513,0.00018908552,0.00042736696,0.0005834934,0.00041937616,0.001391739,0.003133556,0.00070100866,0.0011336731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010957519,0.00063207105,0.006485089,0.00073309813,0.0003161005,0.0015187201,0.0006556213,0.13436355,0.047585487,0.091311924,0.06265237,0.6526501],"study_design_scores_gemma":[0.0002430672,0.0007657517,0.0029426801,0.00012390658,0.00014276366,0.0014229887,0.00068594987,0.66165125,0.027829204,0.045144577,0.25893897,0.00010885441],"about_ca_topic_score_codex":0.003017873,"about_ca_topic_score_gemma":0.0038261497,"teacher_disagreement_score":0.004782702,"about_ca_system_score_codex":0.00032662536,"about_ca_system_score_gemma":0.0006808239,"threshold_uncertainty_score":0.015999734},"labels":[],"label_agreement":null},{"id":"W2147493445","doi":"10.1109/glocom.2009.5425768","title":"SPID: A Novel P2P-Based Information Diffusion Scheme for Mobile Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Popularity; Node (physics); Distributed computing; Bandwidth (computing); Scheme (mathematics); Mobile computing; Mobile device; Peer-to-peer; Optimized Link State Routing Protocol; Vehicular ad hoc network; Wireless; Routing protocol; Network packet; World Wide Web; Telecommunications","score_opus":0.012323781786633991,"score_gpt":0.2337963660621124,"score_spread":0.22147258427547842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147493445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129657425,0.00089780457,0.98061496,0.0005121406,0.00024319938,0.00027633843,0.00014591066,0.0016128081,0.0027310415],"genre_scores_gemma":[0.44118702,0.0016790397,0.5466363,0.00038716258,0.0002614948,0.0006682537,0.00054943626,0.00014140584,0.008489867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949956,0.00009364299,0.000044804176,0.000091452646,0.00023061199,0.000039970615],"domain_scores_gemma":[0.99939764,0.00016861912,0.00007177208,0.00012606476,0.00016386218,0.00007214265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967557,0.00051026203,0.0008072786,0.0010682264,0.0010699253,0.0007200265,0.001986456,0.00081064604,0.001272401],"category_scores_gemma":[0.0016870751,0.0002577495,0.00046519973,0.0010836016,0.0005924965,0.0023108877,0.0017814899,0.00091136934,0.0005067238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067538134,0.00026717316,0.0014334117,0.000767058,0.00015195739,0.0008697706,0.00072513556,0.070262566,0.098538905,0.08497501,0.01912864,0.722205],"study_design_scores_gemma":[0.0002765962,0.00044447268,0.00053871906,0.000038618167,0.00008765459,0.0011535211,0.0001228229,0.86475414,0.02412246,0.023596697,0.08473048,0.00013380958],"about_ca_topic_score_codex":0.0014525653,"about_ca_topic_score_gemma":0.0013674885,"teacher_disagreement_score":0.001986456,"about_ca_system_score_codex":0.0006630007,"about_ca_system_score_gemma":0.0008624714,"threshold_uncertainty_score":0.004810393},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Routing table; Network topology; Node (physics); Network packet; Schedule; Routing (electronic design automation); Static routing; Topology (electrical circuits); Engineering","score_opus":0.03208924193418186,"score_gpt":0.28555426282870594,"score_spread":0.25346502089452405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147830904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013331955,0.0019083752,0.9766942,0.0008446317,0.00015797,0.00010261439,0.000049104325,0.0003821666,0.0065288567],"genre_scores_gemma":[0.5612229,0.003966272,0.4268837,0.0004111897,0.00028116084,0.0003964092,0.00022114284,0.00014400898,0.006473122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981188,0.00084873347,0.00009936226,0.00028651106,0.00053982844,0.000106706735],"domain_scores_gemma":[0.9964702,0.002332867,0.00032863242,0.00045787156,0.0003122931,0.00009810679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002070472,0.0007414271,0.0005696266,0.0006646671,0.00074843655,0.0018793403,0.001306905,0.0014040994,0.0025297406],"category_scores_gemma":[0.00834593,0.000528497,0.00028542895,0.0010255656,0.0018557583,0.0030476898,0.0013579406,0.0013084636,0.0005390946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086105385,0.000055483753,0.00064826856,0.0003533231,0.000033997043,0.00017557025,0.00025845403,0.6316149,0.0060471133,0.28542936,0.0032750673,0.072022334],"study_design_scores_gemma":[0.00003706124,0.00010709206,0.00014943874,0.000053733747,0.00001732195,0.00016420634,0.000101010926,0.7434398,0.0023502896,0.23101114,0.02254232,0.000026666476],"about_ca_topic_score_codex":0.0012415514,"about_ca_topic_score_gemma":0.0009235356,"teacher_disagreement_score":0.0025297406,"about_ca_system_score_codex":0.0018123164,"about_ca_system_score_gemma":0.0008849992,"threshold_uncertainty_score":0.0131492615},"labels":[],"label_agreement":null},{"id":"W2148750274","doi":"10.1109/rose.2009.5356001","title":"Data visualization: From body sensor network to social networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Visualization; Social network (sociolinguistics); Overlay; Overlay network; Task (project management); Computer network; Mobile social network; World Wide Web; The Internet; Mobile computing; Human–computer interaction; Distributed computing; Social media; Data mining; Operating system","score_opus":0.047389533687296835,"score_gpt":0.3051634434890025,"score_spread":0.25777390980170567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148750274","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012240018,0.0018366997,0.97120476,0.0035541418,0.00025860607,0.00016057905,0.00039262205,0.0033377458,0.0070147817],"genre_scores_gemma":[0.51082724,0.0052172714,0.4735308,0.0008444261,0.00048245405,0.00040630676,0.00072521175,0.0004493016,0.007517031],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902964,0.00043359495,0.000044539902,0.00016143436,0.00028365973,0.000047128473],"domain_scores_gemma":[0.99790394,0.0011431567,0.00017871092,0.0003229504,0.0002995412,0.00015178908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014649923,0.0006910454,0.0005249645,0.0014349014,0.0007941797,0.0023271136,0.0011242153,0.0008455032,0.0027768181],"category_scores_gemma":[0.0053950124,0.00035894994,0.00038058215,0.0016693448,0.0011258416,0.0046825334,0.0022455512,0.0010428176,0.00043735857],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036097819,0.00016753969,0.0071418253,0.0008059994,0.00015085383,0.0010320778,0.0031828564,0.07914453,0.010135786,0.24226853,0.042793807,0.61281526],"study_design_scores_gemma":[0.00005038877,0.00011727848,0.003082849,0.00020021005,0.00007772249,0.00079884706,0.0013209366,0.5353321,0.009233267,0.32074478,0.12896176,0.00007985146],"about_ca_topic_score_codex":0.0039202925,"about_ca_topic_score_gemma":0.002978184,"teacher_disagreement_score":0.0039202925,"about_ca_system_score_codex":0.0009120639,"about_ca_system_score_gemma":0.00063720247,"threshold_uncertainty_score":0.0092894435},"labels":[],"label_agreement":null},{"id":"W2148844368","doi":"10.1109/glocom.2009.5425746","title":"An Adaptive Forwarding Scheme for Message Delivery over Delay Tolerant Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Scheme (mathematics); Delay-tolerant networking; Power consumption; Network delay; Resource consumption; Distributed computing; Power (physics); Routing protocol; Routing (electronic design automation); Network packet","score_opus":0.020849757372392155,"score_gpt":0.25938710572642987,"score_spread":0.23853734835403773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148844368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026395816,0.0006516499,0.9705508,0.00020414405,0.0001988738,0.00013028426,0.000049509643,0.00052785606,0.0012911656],"genre_scores_gemma":[0.653753,0.001009593,0.34131822,0.00025100852,0.00016711319,0.00021992417,0.00017115728,0.000044534183,0.003065459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.00006930337,0.000036766116,0.00007224329,0.0001449819,0.000039030132],"domain_scores_gemma":[0.9993548,0.00023906786,0.00007919663,0.00011514968,0.00017649373,0.000035317906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007382365,0.0004226597,0.0004440945,0.00075451203,0.00081503385,0.0003933387,0.0012947547,0.000624996,0.0008048441],"category_scores_gemma":[0.001700524,0.00015844377,0.00029334653,0.00049929175,0.00039215075,0.0012538347,0.0006734286,0.00053500227,0.00016120143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006707724,0.00018197118,0.0018665934,0.00043140838,0.00013731793,0.0006379732,0.00077911356,0.17866386,0.16872248,0.08046744,0.005023142,0.5624178],"study_design_scores_gemma":[0.00010754976,0.00046426107,0.000581713,0.00004200029,0.00011579434,0.0006957029,0.000088731045,0.9172904,0.033390142,0.022352215,0.024773713,0.000097743425],"about_ca_topic_score_codex":0.0012645845,"about_ca_topic_score_gemma":0.0012454956,"teacher_disagreement_score":0.0012947547,"about_ca_system_score_codex":0.0005955637,"about_ca_system_score_gemma":0.0005005159,"threshold_uncertainty_score":0.004321158},"labels":[],"label_agreement":null},{"id":"W2149063025","doi":"10.1109/glocom.2010.5684058","title":"Delay Analysis for a Reliable Message Delivery in Sparse Vehicular Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Computer science; Wireless ad hoc network; Vehicular ad hoc network; Computer network; Reliability (semiconductor); Probabilistic logic; Focus (optics); Transmission (telecommunications); Relation (database); Message passing; Distributed computing; Telecommunications; Data mining; Wireless; Artificial intelligence","score_opus":0.015130731749020226,"score_gpt":0.2287536187613291,"score_spread":0.2136228870123089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149063025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039546777,0.0015332656,0.9557097,0.00027382228,0.00007511773,0.00005091661,0.000079510406,0.00013465164,0.0025962791],"genre_scores_gemma":[0.93598956,0.002180567,0.05790619,0.00012951018,0.00015238693,0.00014438358,0.00012599968,0.00010714073,0.0032642689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990669,0.00020281995,0.000043615946,0.00014649714,0.00042090047,0.00011936868],"domain_scores_gemma":[0.99575543,0.0030344287,0.00041541905,0.00013658027,0.00057716435,0.000081007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017232496,0.0007238632,0.0006375466,0.001298005,0.0004953329,0.00085698883,0.00093705294,0.0004337487,0.0012681664],"category_scores_gemma":[0.008979045,0.00036649941,0.0003887287,0.00076896755,0.00083395507,0.0016297152,0.00073501293,0.0006126311,0.00029436266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101913036,0.000012919599,0.00069424394,0.00015842993,0.000027865353,0.00012526913,0.00014047271,0.9390766,0.005312093,0.040207434,0.0005389868,0.013603815],"study_design_scores_gemma":[0.0000042730285,0.000043220265,0.00016944463,0.0000105969775,0.000012046121,0.00006665324,0.0000325018,0.98779476,0.0008979484,0.01011836,0.0008416709,0.000008526906],"about_ca_topic_score_codex":0.0029324873,"about_ca_topic_score_gemma":0.0013764494,"teacher_disagreement_score":0.0029324873,"about_ca_system_score_codex":0.0016448153,"about_ca_system_score_gemma":0.0008641869,"threshold_uncertainty_score":0.011934042},"labels":[],"label_agreement":null},{"id":"W2149169325","doi":"10.1109/lcomm.2012.120312.121675","title":"Social Groupcasting Algorithm for Wireless Cellular Multicast Services","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Dissemination; Wireless ad hoc network; Upload; Wireless; Wireless network; Distributed computing; World Wide Web; Telecommunications","score_opus":0.05540864212330869,"score_gpt":0.2932850428698417,"score_spread":0.237876400746533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149169325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019684024,0.00027933175,0.97595596,0.0002530148,0.00013318735,0.00013159573,0.000043496435,0.00036409273,0.0031553206],"genre_scores_gemma":[0.6269519,0.00037024514,0.36793593,0.00019676515,0.000154485,0.00031735047,0.00021439673,0.00005326943,0.0038056497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948776,0.00014167943,0.00002919736,0.00008119053,0.00019500124,0.000065074746],"domain_scores_gemma":[0.99937576,0.00023448815,0.00007128469,0.000096729775,0.0001754489,0.00004630857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073451444,0.00040643665,0.00053958734,0.0006521182,0.0011165651,0.00056873605,0.0011340864,0.0006372086,0.0012581635],"category_scores_gemma":[0.0021549875,0.00013561244,0.0003407828,0.00062685553,0.000427213,0.0011454304,0.00088543154,0.0007582974,0.0003307702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049171323,0.00022629133,0.0020683547,0.0001805565,0.00009830777,0.00023916381,0.000587223,0.28325757,0.019816259,0.14518195,0.010518677,0.53733385],"study_design_scores_gemma":[0.000063135085,0.000096428645,0.00021187078,0.000009973238,0.000023825487,0.000091265814,0.00006968724,0.95849127,0.0039652325,0.026366107,0.0105962325,0.000014897285],"about_ca_topic_score_codex":0.0021798748,"about_ca_topic_score_gemma":0.0024574634,"teacher_disagreement_score":0.0021798748,"about_ca_system_score_codex":0.00089675095,"about_ca_system_score_gemma":0.00083595724,"threshold_uncertainty_score":0.006506443},"labels":[],"label_agreement":null},{"id":"W2149179640","doi":"10.1109/ccnc.2011.5766523","title":"Exploring personal interest in intermittently connected wireless mobile social networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Focus (optics); Mobility model; Wireless; Mobile computing; Ranging; Computer network; Mobile device; Routing (electronic design automation); Mobile telephony; Dissemination; Mobile social network; Delay-tolerant networking; Distributed computing; Mobile radio; Telecommunications; Routing protocol; World Wide Web; Wireless Routing Protocol","score_opus":0.2556135943192557,"score_gpt":0.25723296875814033,"score_spread":0.0016193744388846576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149179640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8961856,0.0006524145,0.098038994,0.00078117015,0.000021360962,0.00006863865,0.00009542119,0.00008103783,0.004075414],"genre_scores_gemma":[0.99475527,0.0002005882,0.004544403,0.000028389342,0.000018705463,0.000019464649,0.000027583073,0.0000047893905,0.0004008628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9991868,0.00052746665,0.00001571933,0.00008707094,0.00009725589,0.00008558796],"domain_scores_gemma":[0.9933716,0.0053605493,0.00059664954,0.00023713984,0.00021183112,0.00022229666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014145714,0.000458319,0.0005128434,0.00090835895,0.0007210789,0.0009978095,0.0009814355,0.0010962178,0.00067184394],"category_scores_gemma":[0.008735981,0.00033985975,0.00037669067,0.00082406343,0.0012084213,0.0026688485,0.0012636556,0.0005734431,0.000087722314],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075737527,0.0004978054,0.040890116,0.0002878657,0.00025268967,0.001552982,0.0033930098,0.79970455,0.0095482115,0.07920748,0.001746859,0.062161166],"study_design_scores_gemma":[0.000028613009,0.00017614261,0.0044048,0.000011947282,0.00005064834,0.00027116426,0.0006022253,0.95849144,0.0012596325,0.033756718,0.0009224307,0.000024160492],"about_ca_topic_score_codex":0.0022321672,"about_ca_topic_score_gemma":0.0020397003,"teacher_disagreement_score":0.0022321672,"about_ca_system_score_codex":0.0007458541,"about_ca_system_score_gemma":0.0002554174,"threshold_uncertainty_score":0.0074810386},"labels":[],"label_agreement":null},{"id":"W2150709808","doi":"10.1109/imtc.2009.5168605","title":"SenseFace: A sensor network overlay for social networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless sensor network; Overlay network; Wearable computer; Computer network; Default gateway; Dissemination; Human–computer interaction; The Internet; World Wide Web; Embedded system; Telecommunications","score_opus":0.023445561813169036,"score_gpt":0.26119676010380466,"score_spread":0.23775119829063562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150709808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012303848,0.0004834516,0.96436346,0.00097172946,0.0003083141,0.0007449538,0.0007493952,0.01081474,0.009260157],"genre_scores_gemma":[0.3137679,0.0014246791,0.66512454,0.00042023766,0.00024777182,0.0014403199,0.0021985811,0.0008408441,0.014535123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998632,0.0003796013,0.000101091035,0.00022488595,0.00054670096,0.00011579869],"domain_scores_gemma":[0.9983918,0.00048845273,0.00014589014,0.00038615055,0.0003048498,0.00028288394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018727945,0.0007827724,0.00058007403,0.001177975,0.0014993115,0.0019814945,0.0018005326,0.0011099429,0.0052844263],"category_scores_gemma":[0.0050611193,0.00045330237,0.00084809697,0.00076951436,0.00095620775,0.0048648077,0.0049239798,0.0013745048,0.0011525874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006777797,0.00039795437,0.0032553633,0.0012684547,0.0001993332,0.0010592904,0.0023035018,0.14322925,0.029087115,0.34098148,0.06569659,0.41184396],"study_design_scores_gemma":[0.00011707015,0.00025204377,0.0009844593,0.00012830754,0.00006776625,0.0004354216,0.0005839655,0.6722486,0.0082798535,0.098535374,0.21826796,0.00009924185],"about_ca_topic_score_codex":0.004656219,"about_ca_topic_score_gemma":0.005834405,"teacher_disagreement_score":0.0052844263,"about_ca_system_score_codex":0.0010764089,"about_ca_system_score_gemma":0.0017211919,"threshold_uncertainty_score":0.017678201},"labels":[],"label_agreement":null},{"id":"W2151826058","doi":"10.1109/glocom.2009.5425485","title":"Adaptive Asynchronous Clock Based Power Saving Protocols for Delay Tolerant Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Scalability; Distributed computing; Computer network; Delay-tolerant networking; Efficient energy use; Scheduling (production processes); Routing protocol; Routing (electronic design automation); Engineering; Wireless Routing Protocol","score_opus":0.025641382340167516,"score_gpt":0.270764030206663,"score_spread":0.24512264786649549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151826058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030175434,0.0013686061,0.9632668,0.00024180289,0.00021302937,0.00013158911,0.000035702204,0.00038041332,0.0041866642],"genre_scores_gemma":[0.8030062,0.0016447547,0.1895055,0.0002488948,0.00017900926,0.00041051026,0.00010943547,0.000059771675,0.0048359893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969363,0.00008223222,0.000030710184,0.000056412,0.00011015836,0.000026905102],"domain_scores_gemma":[0.9992173,0.0003746637,0.00013005403,0.00010484675,0.00013202515,0.000041175197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006307563,0.00045151997,0.00032936427,0.0005128403,0.000498974,0.0006755412,0.0012092487,0.00045460468,0.0014015877],"category_scores_gemma":[0.0015909653,0.000157221,0.00019350373,0.0005163232,0.000563757,0.0010063637,0.00065694575,0.00064480247,0.00019161521],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057006493,0.0002361932,0.0009952345,0.00064966513,0.00011029776,0.00048241665,0.000753637,0.2803162,0.08948029,0.33629942,0.0052947016,0.2848118],"study_design_scores_gemma":[0.00015699363,0.00028250713,0.00026571305,0.00004616489,0.00008317212,0.0003560866,0.00010200086,0.89087486,0.021927694,0.06086083,0.024996033,0.00004777594],"about_ca_topic_score_codex":0.00035718817,"about_ca_topic_score_gemma":0.0005328326,"teacher_disagreement_score":0.0014015877,"about_ca_system_score_codex":0.00042764063,"about_ca_system_score_gemma":0.00034533697,"threshold_uncertainty_score":0.00468874},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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)","score_opus":0.02207387829873364,"score_gpt":0.27644032573473315,"score_spread":0.2543664474359995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155962735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023445968,0.0013760048,0.9695467,0.00023371965,0.00031690433,0.0001964374,0.000050121565,0.00044925595,0.0043849004],"genre_scores_gemma":[0.71752864,0.0019794165,0.2738825,0.00034074282,0.00035939316,0.00060354464,0.00019927091,0.000093369315,0.005013099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965596,0.00009905057,0.00004096574,0.000055290162,0.00012181627,0.000026916507],"domain_scores_gemma":[0.99924314,0.00032345936,0.00012431628,0.00011680183,0.0001491501,0.00004315404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007318855,0.0004513504,0.00028534894,0.00057672005,0.0006270751,0.0006468857,0.0011232777,0.0003218404,0.0013201149],"category_scores_gemma":[0.0015830594,0.00016068443,0.00023124371,0.00051462196,0.00048964773,0.00096792885,0.0006042263,0.00063652964,0.00022214824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005415163,0.00018858931,0.0012925066,0.000730222,0.000108640954,0.00032736314,0.00073851895,0.17665301,0.07820061,0.34639046,0.0069352966,0.38789332],"study_design_scores_gemma":[0.00017361081,0.00043940818,0.00046735475,0.00008216443,0.000111754365,0.00043625486,0.00021145478,0.83961207,0.025899211,0.08476686,0.047731847,0.00006799216],"about_ca_topic_score_codex":0.0006042654,"about_ca_topic_score_gemma":0.0010839108,"teacher_disagreement_score":0.0013201149,"about_ca_system_score_codex":0.0006096285,"about_ca_system_score_gemma":0.000591101,"threshold_uncertainty_score":0.0044231415},"labels":[],"label_agreement":null},{"id":"W2158594242","doi":"10.1109/sdrn.2007.4348970","title":"SAFIRE: A Self-Organizing Architecture for Information Exchange between First Responders","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interoperability; Computer science; Flexibility (engineering); Information exchange; Architecture; Salient; Cognitive radio; Distributed computing; Disaster response; Communications system; Emergency management; Computer security; Telecommunications; Wireless; Artificial intelligence; World Wide Web","score_opus":0.01701699574211456,"score_gpt":0.23512372069347273,"score_spread":0.21810672495135816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158594242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018282648,0.00022298275,0.97128534,0.00052679115,0.00012831556,0.00040434705,0.00008391195,0.0030968469,0.0059687314],"genre_scores_gemma":[0.43079284,0.0005628654,0.5531652,0.0004654589,0.00014174604,0.0008367939,0.00064456445,0.00020880454,0.013181677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935526,0.0001938838,0.00006408743,0.00010270798,0.00020275277,0.00008125319],"domain_scores_gemma":[0.99847656,0.00041613958,0.00018164964,0.0003496045,0.00035285307,0.00022331167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020148235,0.00042044715,0.00044285232,0.0008261679,0.0015194172,0.0015170086,0.0022914666,0.001338632,0.0024830005],"category_scores_gemma":[0.0027870995,0.0003860726,0.0005500186,0.00056429947,0.00089447206,0.002444811,0.0019120515,0.0010816633,0.0008106805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010126707,0.00084530463,0.0061337203,0.00078730256,0.00038599173,0.0010745049,0.003796847,0.17754713,0.05809018,0.25649774,0.031440362,0.46238822],"study_design_scores_gemma":[0.00015583108,0.00058926304,0.0017273785,0.00008692575,0.00014029714,0.0006924944,0.0006854289,0.74602985,0.018550549,0.0885382,0.14264305,0.00016076099],"about_ca_topic_score_codex":0.0020422924,"about_ca_topic_score_gemma":0.0031755434,"teacher_disagreement_score":0.0024830005,"about_ca_system_score_codex":0.0006068338,"about_ca_system_score_gemma":0.0012880928,"threshold_uncertainty_score":0.010655582},"labels":[],"label_agreement":null},{"id":"W2159691688","doi":"10.1007/978-3-642-29952-0_34","title":"The Worst Case Behavior of Randomized Gossip","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Gossip; Rumor; Computer science; Node (physics); Phone; Randomized algorithm; Point (geometry); Theoretical computer science; Combinatorics; Algorithm; Discrete mathematics; Mathematics","score_opus":0.02149200284039755,"score_gpt":0.25031227203030243,"score_spread":0.2288202691899049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159691688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53260416,0.003337135,0.38017073,0.009376965,0.00042172748,0.00022442026,0.0015372026,0.0030252,0.06930254],"genre_scores_gemma":[0.9737084,0.00065470504,0.019167073,0.0003531832,0.0002100077,0.00016199933,0.0003736469,0.0005007839,0.0048702876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918224,0.0039082295,0.0002918009,0.0010263089,0.0016731272,0.0012781284],"domain_scores_gemma":[0.88006306,0.10208587,0.0046578553,0.006972442,0.003319562,0.0029011793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011199391,0.0014381319,0.0020375126,0.0020564485,0.0026186113,0.0051780003,0.0044366685,0.0032086738,0.006657194],"category_scores_gemma":[0.07590529,0.001666618,0.0013036515,0.0018726528,0.0049977032,0.0074728313,0.0030450022,0.003710315,0.00091732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020957664,0.0002856182,0.002400091,0.0004218666,0.00026539675,0.00052430376,0.0005531227,0.5872745,0.0072491015,0.36998567,0.012999455,0.015945127],"study_design_scores_gemma":[0.00009660103,0.000084734274,0.00031895688,0.000037054746,0.00005360115,0.00019396386,0.000120074095,0.84382373,0.0013418057,0.15328902,0.00059763825,0.00004279472],"about_ca_topic_score_codex":0.002083181,"about_ca_topic_score_gemma":0.001610559,"teacher_disagreement_score":0.011199391,"about_ca_system_score_codex":0.00332215,"about_ca_system_score_gemma":0.0027593118,"threshold_uncertainty_score":0.05922872},"labels":[],"label_agreement":null},{"id":"W2161047006","doi":"10.1109/glocom.2009.5425221","title":"SARP - A Novel Multi-Copy Routing Protocol for Intermittently Connected Mobile Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Protocol (science); Zone Routing Protocol; Routing (electronic design automation); Wireless Routing Protocol","score_opus":0.052207101893063046,"score_gpt":0.330681375998142,"score_spread":0.27847427410507897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161047006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04902513,0.001330012,0.93813366,0.00036086852,0.0002804823,0.00024224182,0.00018287291,0.001370429,0.009074307],"genre_scores_gemma":[0.61202496,0.0018112137,0.37136477,0.00028522598,0.00022204271,0.00050087797,0.00071206526,0.00012363536,0.012955239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997924,0.000038558068,0.000020155652,0.00003072072,0.00010077009,0.000017494574],"domain_scores_gemma":[0.99972326,0.00008903549,0.00004682168,0.00006456421,0.00005021595,0.000026162039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027604945,0.00022913588,0.00033895342,0.00044963314,0.00049732014,0.00053376483,0.001183043,0.00048242,0.0011054634],"category_scores_gemma":[0.0008290226,0.00014182186,0.00027322109,0.0004983,0.00032253642,0.0013112432,0.0009863526,0.000539348,0.00029304522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035345586,0.00018526996,0.0023775746,0.00088718574,0.00016662193,0.0018519198,0.0007001227,0.12080089,0.15680002,0.094479784,0.014594438,0.6068027],"study_design_scores_gemma":[0.000112529284,0.00077847025,0.0013532838,0.0000749528,0.00012505012,0.0045059673,0.00021554984,0.8081964,0.034515183,0.03432041,0.115711324,0.000090856855],"about_ca_topic_score_codex":0.00045563,"about_ca_topic_score_gemma":0.00095909473,"teacher_disagreement_score":0.001183043,"about_ca_system_score_codex":0.00029003777,"about_ca_system_score_gemma":0.00042229268,"threshold_uncertainty_score":0.0036981106},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03380065408349288,"score_gpt":0.2708571602689887,"score_spread":0.23705650618549584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161147255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4756186,0.00053668336,0.4820331,0.0009621087,0.00011656375,0.00034862888,0.000085482774,0.0031653738,0.03713349],"genre_scores_gemma":[0.9603049,0.00014427515,0.032890614,0.00008675431,0.000025986685,0.00007598853,0.00008988389,0.000037851427,0.006343702],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977595,0.00006406331,0.000010344748,0.000026165686,0.00006684912,0.00005655185],"domain_scores_gemma":[0.99944144,0.00014707405,0.000062350424,0.00016186,0.00012978112,0.000057570473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046221082,0.00036358123,0.00014969987,0.00045428774,0.0011759335,0.00073440943,0.0006920093,0.00043267416,0.0036798392],"category_scores_gemma":[0.0007309884,0.00013593856,0.000089247915,0.00038490162,0.00033457574,0.001256825,0.0010657498,0.00027930012,0.00072541274],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014812354,0.000709829,0.014661333,0.00048185603,0.00008658685,0.0019674702,0.0038153608,0.03879514,0.2824356,0.051558733,0.022169234,0.58183753],"study_design_scores_gemma":[0.00034884672,0.0036449425,0.014558335,0.00012987354,0.00025710376,0.0032556618,0.004840609,0.58783525,0.122150965,0.039521277,0.22323285,0.00022423621],"about_ca_topic_score_codex":0.0017980515,"about_ca_topic_score_gemma":0.004384053,"teacher_disagreement_score":0.0036798392,"about_ca_system_score_codex":0.0004254218,"about_ca_system_score_gemma":0.00042699536,"threshold_uncertainty_score":0.012310326},"labels":[],"label_agreement":null},{"id":"W2161173520","doi":"10.1109/ievc.2013.6681138","title":"Advanced Security Methodologies for Spontaneous Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Field (mathematics); Open research; Computer security; World Wide Web","score_opus":0.0340655929974795,"score_gpt":0.280554673053557,"score_spread":0.24648908005607753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161173520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002009062,0.001586319,0.98187166,0.00087463105,0.00021510465,0.00012261169,0.0000501117,0.00012997366,0.013140497],"genre_scores_gemma":[0.14698702,0.006037033,0.8262491,0.00057114626,0.00083160674,0.0008286854,0.00028360073,0.00019585318,0.01801605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961966,0.001555826,0.0003157692,0.00042438338,0.0013369559,0.00017051862],"domain_scores_gemma":[0.9953139,0.0024125676,0.00037696603,0.0009353304,0.00080070907,0.00016058332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047309618,0.00101994,0.0004005494,0.0019498959,0.0013014512,0.0038685326,0.0016380799,0.0013363952,0.004851785],"category_scores_gemma":[0.0072079897,0.00050442154,0.0011220981,0.0010396354,0.003080797,0.007172093,0.002918402,0.0027301423,0.0014175193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005591449,0.000014873944,0.000083809726,0.000094801275,0.000010320817,0.000075977405,0.0002283934,0.0037576607,0.00076363643,0.96755755,0.0015557954,0.025851488],"study_design_scores_gemma":[0.000011199368,0.000029684385,0.000078819,0.00013371005,0.000017812728,0.0002953491,0.00018163715,0.044307962,0.0015553581,0.8715148,0.08185581,0.00001783173],"about_ca_topic_score_codex":0.0006496846,"about_ca_topic_score_gemma":0.0005918855,"teacher_disagreement_score":0.004851785,"about_ca_system_score_codex":0.0014445522,"about_ca_system_score_gemma":0.0015736553,"threshold_uncertainty_score":0.025020003},"labels":[],"label_agreement":null},{"id":"W2161258826","doi":"10.1109/glocom.2011.6134042","title":"SATS: Secure Data-Forwarding Scheme for Delay-Tolerant Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Scheme (mathematics); Wireless; Wireless network; Telecommunications; Mathematics","score_opus":0.11486963548890301,"score_gpt":0.2701509795083801,"score_spread":0.15528134401947707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161258826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068490244,0.0006994891,0.9237199,0.00073564175,0.00040141682,0.00034662837,0.00026465504,0.0012994244,0.0040427013],"genre_scores_gemma":[0.88727796,0.00038278275,0.105938956,0.00026790428,0.000114192495,0.00021886698,0.00035515724,0.000036124402,0.005408049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897337,0.00023394529,0.00011297115,0.00013587574,0.000377329,0.00016638021],"domain_scores_gemma":[0.9979163,0.00041744547,0.00029614518,0.0006567314,0.00053951173,0.00017392168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011241141,0.0006246488,0.0008132801,0.0009603176,0.0015832447,0.00091259286,0.0015846745,0.0009410643,0.0019953032],"category_scores_gemma":[0.0024200194,0.00022132204,0.0006405483,0.0009117997,0.0009945338,0.0026491447,0.0024848909,0.0010777104,0.0005206736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028474294,0.0003482313,0.0044613983,0.00074753485,0.0003107513,0.0011266996,0.001363616,0.16861473,0.10003663,0.28327712,0.02306839,0.4137975],"study_design_scores_gemma":[0.00030378922,0.0007935891,0.0009984946,0.00006854923,0.00015740082,0.0011203676,0.00022425853,0.8561067,0.036150854,0.06876143,0.035137955,0.000176507],"about_ca_topic_score_codex":0.0014128408,"about_ca_topic_score_gemma":0.0015799745,"teacher_disagreement_score":0.0019953032,"about_ca_system_score_codex":0.0012761056,"about_ca_system_score_gemma":0.0013474155,"threshold_uncertainty_score":0.009258866},"labels":[],"label_agreement":null},{"id":"W2161706562","doi":"10.1109/milcom.2009.5379935","title":"SReD: A Secure REputation-based Dynamic Window Scheme for disruption-tolerant networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Probabilistic logic; Routing (electronic design automation); Node (physics); Routing protocol; Denial-of-service attack; Distributed computing","score_opus":0.010602178661610796,"score_gpt":0.26059421875037164,"score_spread":0.24999204008876086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161706562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056907054,0.0010565111,0.93531704,0.0005590606,0.0003213063,0.00038607093,0.00020446233,0.0018791736,0.0033692352],"genre_scores_gemma":[0.8789196,0.0004991684,0.11588485,0.00018163848,0.00013050504,0.00023357029,0.00025333322,0.000052564024,0.003844702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987394,0.000249411,0.00014482372,0.00020891821,0.0004988365,0.00015861937],"domain_scores_gemma":[0.99782556,0.00044687925,0.0004906983,0.0006879606,0.0003259986,0.0002228033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001981168,0.00052334403,0.0009859467,0.0009922714,0.000900083,0.001004013,0.0022579546,0.0009946944,0.0013814371],"category_scores_gemma":[0.003937071,0.00027772787,0.00047318515,0.00063176104,0.00092780613,0.003046243,0.0029773547,0.0012273886,0.00054943305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028695292,0.000610914,0.0021697402,0.00056534546,0.00027961296,0.0012352242,0.00086588756,0.16081814,0.14011459,0.1669534,0.013863148,0.5096545],"study_design_scores_gemma":[0.00043408727,0.0010585148,0.00094519154,0.000038932285,0.0001148221,0.0010501347,0.00012592906,0.9014761,0.03396442,0.035452664,0.025116108,0.0002230336],"about_ca_topic_score_codex":0.00075718935,"about_ca_topic_score_gemma":0.0006914489,"teacher_disagreement_score":0.0022579546,"about_ca_system_score_codex":0.00083180517,"about_ca_system_score_gemma":0.000953374,"threshold_uncertainty_score":0.010477543},"labels":[],"label_agreement":null},{"id":"W2162194817","doi":"10.1080/15501320500330695","title":"Distributed Dynamic Storage in Wireless Networks","year":2005,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science; Delaunay triangulation; Spanner; Distributed algorithm; Spanning tree; Intersection (aeronautics); Wireless network; Unit disk graph; Graph; Construct (python library); Triangulation; Distributed computing; Theoretical computer science; Algorithm; Wireless; Mathematics; Computer network; Discrete mathematics","score_opus":0.009391912479989445,"score_gpt":0.2484645451833662,"score_spread":0.23907263270337675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162194817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026906002,0.0064243907,0.9486738,0.0011913459,0.00045469613,0.00014546418,0.00027883946,0.001637939,0.0142875165],"genre_scores_gemma":[0.75710624,0.0075773094,0.21379119,0.00032772584,0.00047074907,0.00063782185,0.0007074636,0.00024181089,0.019139547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992379,0.0002234323,0.00006223751,0.00013328945,0.00025333822,0.00008986628],"domain_scores_gemma":[0.99890137,0.00041800103,0.00008800068,0.00039838778,0.00014426956,0.000049933413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095670816,0.0005543298,0.0008603394,0.00066917064,0.0010835128,0.0021539703,0.001883039,0.0008800954,0.0031041368],"category_scores_gemma":[0.0029499372,0.00037774036,0.00030653723,0.0020733096,0.0009375017,0.003751746,0.0019433266,0.00068604556,0.0010101695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000492293,0.000086969485,0.0011997411,0.00066067657,0.00008468474,0.00067186606,0.00066078146,0.3467323,0.013179023,0.3646782,0.017789027,0.25376442],"study_design_scores_gemma":[0.00008491819,0.00013065613,0.00030757737,0.00009627393,0.0000504968,0.00064588274,0.00030186944,0.73483014,0.007249421,0.18766695,0.068588786,0.000047080717],"about_ca_topic_score_codex":0.0011430635,"about_ca_topic_score_gemma":0.0010193086,"teacher_disagreement_score":0.0031041368,"about_ca_system_score_codex":0.0008972244,"about_ca_system_score_gemma":0.0007933619,"threshold_uncertainty_score":0.01038444},"labels":[],"label_agreement":null},{"id":"W2163009522","doi":"10.1145/1397705.1397710","title":"Practical security for rural internet kiosks","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interactive kiosk; The Internet; Computer security; Computer science; Database transaction; Internet privacy; Payment; Architecture; World Wide Web; Database; Geography","score_opus":0.05998031822831396,"score_gpt":0.3023744561915942,"score_spread":0.24239413796328024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163009522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13698705,0.000608959,0.83401906,0.0010563765,0.000047190653,0.0002836704,0.00008956014,0.001349537,0.025558572],"genre_scores_gemma":[0.9084546,0.00037808905,0.0860067,0.00009850671,0.000022025708,0.0001068373,0.00009023722,0.00006407484,0.004779046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998696,0.00036999406,0.000082834435,0.00015368908,0.0004928906,0.00020451592],"domain_scores_gemma":[0.99804014,0.0005687829,0.00036679808,0.0005212879,0.00039125668,0.00011168118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009964206,0.0007149629,0.00032669172,0.0009091131,0.0013622651,0.0018289429,0.00085423933,0.0010872502,0.0036455921],"category_scores_gemma":[0.0027971207,0.0004265233,0.00029577347,0.00048123393,0.0016480389,0.003982673,0.0024882134,0.0011935289,0.0010808366],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074325607,0.00026734837,0.007929826,0.00070163334,0.00008260141,0.0012619817,0.002086471,0.15079808,0.12480693,0.526788,0.007972738,0.17656112],"study_design_scores_gemma":[0.000083111394,0.0005664171,0.003819806,0.00019376037,0.00006485846,0.0030521515,0.0015701888,0.5327573,0.052867655,0.32888862,0.07600089,0.00013531581],"about_ca_topic_score_codex":0.00044963075,"about_ca_topic_score_gemma":0.0005102638,"teacher_disagreement_score":0.0036455921,"about_ca_system_score_codex":0.0009439803,"about_ca_system_score_gemma":0.000822147,"threshold_uncertainty_score":0.012195766},"labels":[],"label_agreement":null},{"id":"W2163194970","doi":"10.1109/pccc.2007.358931","title":"Inverse Geolocation: Worms with a Sense of Direction","year":2007,"lang":"en","type":"article","venue":"IEEE International Performance, Computing, and Communications Conference","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Geolocation; Computer science; Inverse; Inverse problem; The Internet; Mathematics; World Wide Web","score_opus":0.035897576123130895,"score_gpt":0.2787035113457188,"score_spread":0.24280593522258792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163194970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035089664,0.0018737846,0.9192179,0.0048756264,0.0011050528,0.00014847332,0.00029516013,0.0018888762,0.03550549],"genre_scores_gemma":[0.7576194,0.0034623805,0.20769739,0.0023626848,0.0010245276,0.00034529777,0.00040410922,0.00020500168,0.02687925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989195,0.00030518838,0.000060108796,0.00016113279,0.00041632156,0.0001377318],"domain_scores_gemma":[0.9965591,0.0011079627,0.00064662955,0.0010344385,0.000539335,0.000112526395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008551331,0.0006983135,0.00061104354,0.0011237737,0.0009649437,0.002265379,0.0011370752,0.0028763823,0.002516208],"category_scores_gemma":[0.005894169,0.00042953857,0.00041606076,0.0011265369,0.0034999445,0.006872928,0.0028545097,0.0020515262,0.0010947968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018675979,0.00006729132,0.0039042511,0.00032790136,0.0000596014,0.000831539,0.0008330022,0.03077619,0.033886652,0.70659393,0.020815933,0.20171696],"study_design_scores_gemma":[0.00011223508,0.00032884718,0.002575395,0.00026618273,0.00012076049,0.0059905145,0.0009701463,0.19400194,0.040574398,0.5415702,0.21324718,0.00024215202],"about_ca_topic_score_codex":0.00066284585,"about_ca_topic_score_gemma":0.0006758187,"teacher_disagreement_score":0.0028763823,"about_ca_system_score_codex":0.0004012983,"about_ca_system_score_gemma":0.0004794407,"threshold_uncertainty_score":0.008417547},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041913015755297364,"score_gpt":0.26905130840029917,"score_spread":0.2271382926450018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164328519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21209858,0.0004531867,0.7845685,0.00032308692,0.000032790434,0.000076456294,0.000033197848,0.0013376826,0.0010764862],"genre_scores_gemma":[0.91357857,0.00012632679,0.084795795,0.00007125529,0.000024594492,0.00009596432,0.00005950553,0.000065468885,0.001182542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879265,0.0003866218,0.00007682805,0.0002385609,0.0003633923,0.00014200619],"domain_scores_gemma":[0.98828715,0.0043438245,0.0020335664,0.0035254492,0.001473389,0.00033664476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017492657,0.00039293265,0.0007995569,0.00093563984,0.0010705614,0.00082577876,0.0012958403,0.0009040466,0.00028911207],"category_scores_gemma":[0.013016239,0.00028524175,0.0003537342,0.0011677804,0.0015286505,0.0020444072,0.0012935799,0.000734295,0.00015373176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044876966,0.000111595,0.0036212166,0.00015077493,0.00007239836,0.00033902575,0.00065313256,0.78908825,0.026704846,0.04049385,0.0016016077,0.13671449],"study_design_scores_gemma":[0.000051201318,0.00014778858,0.000578486,0.000012930321,0.00001608267,0.00022514962,0.0000779865,0.9652255,0.010897025,0.021171067,0.0015689664,0.000027858787],"about_ca_topic_score_codex":0.003203243,"about_ca_topic_score_gemma":0.002195629,"teacher_disagreement_score":0.003203243,"about_ca_system_score_codex":0.0010801778,"about_ca_system_score_gemma":0.0013096399,"threshold_uncertainty_score":0.009251118},"labels":[],"label_agreement":null},{"id":"W2164553252","doi":"10.1109/icdcsw.2007.98","title":"Architecture for Supporting Real Time Traffic in Large ScaleWireless Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Unicast; Computer science; Computer network; Quality of service; Network packet; Wireless; Wireless network; Distributed computing; Energy consumption; Interconnection; Resource allocation; Telecommunications; Engineering","score_opus":0.009840035910589328,"score_gpt":0.25533591317149723,"score_spread":0.2454958772609079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164553252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07645577,0.00059086643,0.91947657,0.00026582013,0.00006855944,0.00004728024,0.000023205828,0.00040126566,0.0026706767],"genre_scores_gemma":[0.78686666,0.00067757105,0.20897993,0.0000769731,0.000048709426,0.00014256724,0.00007094497,0.00003944873,0.0030972008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999824,0.000047460406,0.000007848302,0.000027461794,0.000069732945,0.000023535062],"domain_scores_gemma":[0.99958605,0.00014891896,0.000060814873,0.00010186265,0.00006977395,0.000032619915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048535402,0.0002820314,0.0002765932,0.00024836053,0.00039894506,0.0005541505,0.00093467446,0.00040819566,0.0006458751],"category_scores_gemma":[0.0013907903,0.00015571309,0.00018423233,0.00027632146,0.00054001156,0.001015733,0.00056620885,0.00054541463,0.00016909154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013454085,0.00014799496,0.0021090538,0.0002703494,0.00006662206,0.00019357908,0.00029654353,0.479961,0.059108797,0.2767349,0.003007358,0.17796928],"study_design_scores_gemma":[0.000023912855,0.00011747319,0.00043066358,0.000009004048,0.000021276606,0.00014974283,0.000039350056,0.9369221,0.0047615934,0.051262166,0.0062463577,0.000016420508],"about_ca_topic_score_codex":0.0005028263,"about_ca_topic_score_gemma":0.00084324955,"teacher_disagreement_score":0.00093467446,"about_ca_system_score_codex":0.00045175612,"about_ca_system_score_gemma":0.00050482,"threshold_uncertainty_score":0.0032777786},"labels":[],"label_agreement":null},{"id":"W2164768240","doi":"10.1109/sahcn.2011.5984880","title":"OppSense: Information sharing for mobile phones in sensing field with data repositories","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"VINNOVA","keywords":"Computer science; Data exchange; Overhead (engineering); Information exchange; Software deployment; Mobile phone; Mobile device; Wireless; Key (lock); Mobile computing; Computer network; Field (mathematics); Distributed computing; Database; Computer security; World Wide Web; Telecommunications; Operating system","score_opus":0.06031251944272874,"score_gpt":0.25462385031953344,"score_spread":0.1943113308768047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164768240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11819074,0.00028230838,0.8765949,0.0003316716,0.000040754905,0.00030118882,0.000095922616,0.0014038442,0.0027586408],"genre_scores_gemma":[0.84884995,0.00014531382,0.14882216,0.00010208185,0.000029682957,0.00028279022,0.00013251381,0.00004747342,0.0015879819],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897397,0.00030290932,0.00008355204,0.0001656787,0.00033690518,0.00013692977],"domain_scores_gemma":[0.9975374,0.0009844598,0.00033556132,0.00064818346,0.0002728529,0.00022150036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001355514,0.0005941483,0.00090919674,0.0008865108,0.0010489069,0.000997924,0.0023332303,0.000900557,0.0012667774],"category_scores_gemma":[0.004732799,0.00038782074,0.00046668787,0.0009775334,0.0007259121,0.0028294066,0.0033292419,0.000508782,0.00027411108],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016243056,0.0009022746,0.012368858,0.0006302184,0.0002771926,0.0021849743,0.0019341948,0.31581196,0.078830816,0.046748307,0.007914011,0.5307729],"study_design_scores_gemma":[0.00011590495,0.0007046741,0.001658011,0.00002478275,0.00005927834,0.0013130752,0.00038248964,0.95137197,0.01992012,0.013897715,0.010484185,0.00006774694],"about_ca_topic_score_codex":0.0013123895,"about_ca_topic_score_gemma":0.0018839848,"teacher_disagreement_score":0.0023332303,"about_ca_system_score_codex":0.00050895807,"about_ca_system_score_gemma":0.0010170649,"threshold_uncertainty_score":0.00716871},"labels":[],"label_agreement":null},{"id":"W2165449282","doi":"10.1109/icc.2009.5198700","title":"Adaptive Exponential Beacon Period Protocol for Power Saving in Delay Tolerant Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Network packet; Computer network; Protocol (science); Exponential function; Power (physics); Exponential distribution; Real-time computing; Mathematics","score_opus":0.027539655553644463,"score_gpt":0.2831186418375844,"score_spread":0.25557898628393994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165449282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058518242,0.0018526608,0.9360091,0.00016635668,0.0001373001,0.00012356379,0.000055537457,0.00057865673,0.0025585839],"genre_scores_gemma":[0.87729454,0.001188501,0.1176592,0.00011804959,0.00008538262,0.00022823397,0.00012997759,0.00005281398,0.0032433423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974936,0.000059494505,0.00002148924,0.00004635169,0.00009153895,0.000031779065],"domain_scores_gemma":[0.9995073,0.00021379362,0.0000867473,0.00007014561,0.000092883965,0.00002912176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005151591,0.0002621181,0.00029643264,0.00043092706,0.0003244077,0.00039352945,0.0010166087,0.00024076842,0.000829232],"category_scores_gemma":[0.0010839165,0.00012733872,0.00015982549,0.0004654446,0.00032216276,0.0007726932,0.00038717024,0.00039960508,0.00014654611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012494278,0.00026729604,0.0029819598,0.00082215515,0.00014356434,0.00081289926,0.00090022746,0.116774864,0.2246116,0.09899001,0.005986782,0.5464592],"study_design_scores_gemma":[0.00031984076,0.0014635398,0.0020251644,0.0000934316,0.0002774466,0.0018317233,0.00025935282,0.7973564,0.1055903,0.032867588,0.057807703,0.000107495114],"about_ca_topic_score_codex":0.0004311027,"about_ca_topic_score_gemma":0.0006068526,"teacher_disagreement_score":0.0010166087,"about_ca_system_score_codex":0.0003618592,"about_ca_system_score_gemma":0.0003328298,"threshold_uncertainty_score":0.0027740002},"labels":[],"label_agreement":null},{"id":"W2165479285","doi":"10.1109/tcomm.2012.082812.110813","title":"Double-Loop Receiver-Initiated MAC for Cooperative Data Dissemination via Roadside WLANs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Network packet; Roaming; Node (physics); Local area network; Overhead (engineering); Relay; Dissemination; Channel (broadcasting); Wi-Fi; Wireless; Wireless network; Telecommunications; Engineering","score_opus":0.1748730875254381,"score_gpt":0.369360642529684,"score_spread":0.1944875550042459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165479285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080065385,0.0012014052,0.91569275,0.00012930932,0.00004178603,0.000064700216,0.000015906888,0.00027843026,0.0025103283],"genre_scores_gemma":[0.9499666,0.0004980583,0.048203085,0.000047749545,0.00003814383,0.00007326825,0.000022462855,0.000012785456,0.0011377811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994091,0.00021742976,0.000026669906,0.00010265729,0.00016551252,0.0000786175],"domain_scores_gemma":[0.99821436,0.0008988611,0.000344169,0.00013890695,0.00035067808,0.000053033462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011285702,0.00043703124,0.00048295883,0.00052710646,0.0004558746,0.0005871259,0.0010024393,0.00042198983,0.0005813088],"category_scores_gemma":[0.0027633156,0.00017011701,0.00030485616,0.00047168284,0.00055254134,0.0008067699,0.0007001907,0.00042944174,0.00014061815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004010415,0.00024665968,0.004205032,0.000545592,0.00018043436,0.000775845,0.0011571223,0.7071858,0.0825115,0.05880763,0.0018630112,0.14212042],"study_design_scores_gemma":[0.000010641009,0.00017594431,0.00020220461,0.000006003312,0.00002285446,0.00009174518,0.00005116879,0.9926495,0.0036807028,0.0015869088,0.001510098,0.0000122771135],"about_ca_topic_score_codex":0.0011305964,"about_ca_topic_score_gemma":0.0010797081,"teacher_disagreement_score":0.0011305964,"about_ca_system_score_codex":0.00056944555,"about_ca_system_score_gemma":0.0005451662,"threshold_uncertainty_score":0.005968511},"labels":[],"label_agreement":null},{"id":"W2166094302","doi":"10.1109/ictd.2007.4937417","title":"Design and implementation of the KioskNet system","year":2007,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interactive kiosk; Software deployment; Variety (cybernetics); Computer science; Computer security; The Internet; Software; Key (lock); World Wide Web; Engineering management; Software engineering; Engineering; Operating system","score_opus":0.020151512535902118,"score_gpt":0.2601221703093254,"score_spread":0.23997065777342327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166094302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15828218,0.00034369997,0.7734637,0.0007898916,0.00040818728,0.005498253,0.00063980516,0.017095821,0.043478377],"genre_scores_gemma":[0.58845186,0.0003067701,0.3897902,0.000325215,0.000054250697,0.0019991873,0.00095237955,0.00072931836,0.017390816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991153,0.00013782489,0.00008875117,0.00016454159,0.00035728572,0.00013624075],"domain_scores_gemma":[0.99938416,0.00006779139,0.00003979728,0.00010377767,0.00027080788,0.000133689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069098483,0.0004216798,0.0004591853,0.00050625094,0.0007023361,0.0013467278,0.0017487537,0.00086428743,0.008763421],"category_scores_gemma":[0.0014024397,0.00042426458,0.00017964371,0.00034579457,0.0005338132,0.0014556271,0.0009469827,0.0011166098,0.0026982902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001664174,0.0020886213,0.012356947,0.001865901,0.00015031327,0.0030182071,0.003473077,0.080854304,0.29522657,0.046632893,0.028058926,0.52461016],"study_design_scores_gemma":[0.0009264706,0.0035734978,0.011761469,0.0003036125,0.00019883366,0.001690257,0.0015983067,0.46539629,0.19732684,0.0074793156,0.30941227,0.00033290562],"about_ca_topic_score_codex":0.0016087797,"about_ca_topic_score_gemma":0.0012557021,"teacher_disagreement_score":0.008763421,"about_ca_system_score_codex":0.0007213734,"about_ca_system_score_gemma":0.0014837359,"threshold_uncertainty_score":0.029316604},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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","score_opus":0.009885545038354272,"score_gpt":0.22519612706125205,"score_spread":0.2153105820228978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169090952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036855087,0.0073887995,0.6085628,0.007787137,0.0043970877,0.0017907075,0.0026505352,0.026402349,0.30416545],"genre_scores_gemma":[0.26061985,0.004969973,0.6239954,0.0037792875,0.0016645057,0.0018229835,0.0039250427,0.003939926,0.09528295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899095,0.00024760372,0.00005696216,0.00019898154,0.0003344064,0.00017112188],"domain_scores_gemma":[0.9989919,0.00020909641,0.00008719212,0.00024313276,0.00018314822,0.0002854988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001486074,0.0009402807,0.00065323786,0.0009520902,0.002115944,0.0038174542,0.0031446903,0.0016504955,0.009637306],"category_scores_gemma":[0.0028295144,0.000511594,0.000697216,0.00063148176,0.0009120869,0.004473941,0.0031321426,0.002057632,0.0058846017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057258777,0.00036405874,0.0052114106,0.0011683184,0.00019396115,0.0012484957,0.0018922157,0.03307964,0.018259453,0.4527934,0.21966672,0.2655498],"study_design_scores_gemma":[0.00009747075,0.00013478032,0.00060961477,0.00010583681,0.000049941824,0.0006941255,0.00028335935,0.05417001,0.0028677275,0.029848246,0.91106623,0.000072600014],"about_ca_topic_score_codex":0.0074833184,"about_ca_topic_score_gemma":0.0108684115,"teacher_disagreement_score":0.009637306,"about_ca_system_score_codex":0.0009526246,"about_ca_system_score_gemma":0.0023869595,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; 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","score_opus":0.058462384749971695,"score_gpt":0.2684341533044095,"score_spread":0.2099717685544378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169926009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04763749,0.0004719578,0.94786274,0.0002616124,0.00004539254,0.00008152219,0.000056173136,0.00023888533,0.003344238],"genre_scores_gemma":[0.79206705,0.00065821427,0.20490102,0.000106053056,0.00003433752,0.00020071206,0.00007753866,0.000045315803,0.0019096769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918777,0.00029279274,0.000036824655,0.00007002634,0.0003334067,0.00007923485],"domain_scores_gemma":[0.99712,0.0018899791,0.0003329986,0.0003304179,0.00026692505,0.000059721813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014678843,0.0003701667,0.00036989522,0.0006546511,0.0005380887,0.0006218579,0.00089000835,0.00058987073,0.00050736155],"category_scores_gemma":[0.0062672175,0.00023542743,0.0001824835,0.0009885724,0.0012760292,0.0013263545,0.0010169913,0.00055137445,0.00014141473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020613443,0.0000663145,0.00067106273,0.00018624078,0.000022179911,0.0002550939,0.00033441343,0.7466764,0.027153002,0.16385674,0.0013261818,0.059246335],"study_design_scores_gemma":[0.000027448681,0.000077744975,0.00016130424,0.0000240592,0.00001191528,0.00018851382,0.000056128705,0.93760115,0.008689509,0.050006833,0.0031307898,0.000024642106],"about_ca_topic_score_codex":0.0017360318,"about_ca_topic_score_gemma":0.0016345241,"teacher_disagreement_score":0.0017360318,"about_ca_system_score_codex":0.0010346136,"about_ca_system_score_gemma":0.0009938424,"threshold_uncertainty_score":0.007763028},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014553507263149879,"score_gpt":0.2568117510979012,"score_spread":0.24225824383475134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170308744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03452369,0.001305577,0.9600277,0.00038143323,0.00030621226,0.00015666886,0.00016773622,0.00023579058,0.0028951971],"genre_scores_gemma":[0.70265895,0.0014707783,0.28879017,0.00027483734,0.00018543516,0.00026451488,0.0005466846,0.000094817464,0.0057137636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992799,0.0002903305,0.0000482591,0.000117641895,0.00020044604,0.000063451305],"domain_scores_gemma":[0.998845,0.0006008469,0.000105671825,0.00012863467,0.00022151487,0.00009842805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015119943,0.0004882954,0.0010669134,0.0010109686,0.0011636029,0.0007935155,0.0015766091,0.00062335504,0.0008525444],"category_scores_gemma":[0.0028357557,0.00034916922,0.0005213485,0.0012298034,0.0005844376,0.0013887098,0.0010786811,0.00052208896,0.00017806914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038975902,0.00013036915,0.0012282144,0.00033381692,0.00014403381,0.0001836705,0.00026197993,0.8120399,0.009928519,0.044617053,0.0057553696,0.124987364],"study_design_scores_gemma":[0.000016042479,0.00008144626,0.00016376021,0.000010414568,0.000033464425,0.00010360347,0.000036895253,0.98138845,0.0016267496,0.014009718,0.0025176303,0.000011831239],"about_ca_topic_score_codex":0.0016670013,"about_ca_topic_score_gemma":0.0037580568,"teacher_disagreement_score":0.0016670013,"about_ca_system_score_codex":0.0011395231,"about_ca_system_score_gemma":0.00087596086,"threshold_uncertainty_score":0.00826782},"labels":[],"label_agreement":null},{"id":"W2171544289","doi":"10.1109/glocom.2009.5425467","title":"Preventing Unauthorized Messages in DTN Based Mobile Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Roaming; Wireless ad hoc network; Node (physics); Wireless network; Mobile ad hoc network; Authentication (law); Distributed computing; Computer security; Wireless; Network packet; Telecommunications; Engineering","score_opus":0.012898918724515778,"score_gpt":0.25169722129639244,"score_spread":0.23879830257187665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171544289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3340355,0.0025983038,0.6496579,0.00059022213,0.00028870252,0.00042823268,0.00008760579,0.0012556564,0.011057983],"genre_scores_gemma":[0.944539,0.0008206112,0.051860366,0.00009657896,0.000056282992,0.00009759279,0.000084171166,0.000024920371,0.002420391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991855,0.00026222147,0.00007814556,0.000077195444,0.0003005908,0.000096262964],"domain_scores_gemma":[0.9971733,0.0011945104,0.000535431,0.00051667256,0.0004068926,0.00017322034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927153,0.00042434467,0.000500839,0.0010499436,0.0013245115,0.0008070844,0.00080895924,0.0006834649,0.0005576616],"category_scores_gemma":[0.0040698266,0.0002495602,0.0002277124,0.00062665093,0.00087787845,0.0021583717,0.0012308921,0.00039122006,0.00024800512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016914604,0.00040571322,0.011187347,0.00072601036,0.00013190736,0.0021166636,0.0014220071,0.36716372,0.0934804,0.08030081,0.0052255853,0.43614835],"study_design_scores_gemma":[0.00009775174,0.00076665985,0.0013216246,0.000050681123,0.00009959829,0.0012500666,0.0003502409,0.9265469,0.027891725,0.025027357,0.016542207,0.000055228153],"about_ca_topic_score_codex":0.0019346018,"about_ca_topic_score_gemma":0.0019261397,"teacher_disagreement_score":0.0019346018,"about_ca_system_score_codex":0.0005526272,"about_ca_system_score_gemma":0.0007144671,"threshold_uncertainty_score":0.0068366528},"labels":[],"label_agreement":null},{"id":"W2171555797","doi":"10.1002/dac.2989","title":"An energy‐efficient history‐based routing scheme for opportunistic networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Energy consumption; Computer network; Overhead (engineering); Routing protocol; Routing (electronic design automation); Network packet; Energy (signal processing); Efficient energy use; Bandwidth (computing); Electrical engineering; Mathematics; Statistics","score_opus":0.09001436105111163,"score_gpt":0.3074328118247264,"score_spread":0.2174184507736148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171555797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12283391,0.0016152443,0.8619597,0.0006389106,0.00028037865,0.00023979676,0.00023521094,0.0013714153,0.010825441],"genre_scores_gemma":[0.94328904,0.0004057896,0.052215546,0.00010942551,0.000058943886,0.00009032906,0.00019504415,0.00003118689,0.003604785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970406,0.000067059875,0.000023468097,0.00005347336,0.0001058717,0.00004603115],"domain_scores_gemma":[0.99941635,0.00019947009,0.00008932917,0.00012596294,0.00011376286,0.000055119886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055829075,0.00038216854,0.00044323454,0.0007901163,0.000735847,0.00048168923,0.0015273091,0.00045211735,0.0012879419],"category_scores_gemma":[0.0014094226,0.0002001325,0.00029465498,0.00052332657,0.00039947708,0.0011383661,0.0012411707,0.0004187466,0.00020998878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008346321,0.00028117906,0.004044315,0.00042249,0.00014758133,0.0008889045,0.00060115097,0.33792627,0.05945435,0.08438591,0.010795222,0.50021803],"study_design_scores_gemma":[0.000054062606,0.00021139476,0.0010425308,0.000032128264,0.000052904717,0.0003572051,0.00009520851,0.9630519,0.009011274,0.01747119,0.008554678,0.00006544072],"about_ca_topic_score_codex":0.0025330228,"about_ca_topic_score_gemma":0.0035078295,"teacher_disagreement_score":0.0025330228,"about_ca_system_score_codex":0.0005134022,"about_ca_system_score_gemma":0.00080925913,"threshold_uncertainty_score":0.005036533},"labels":[],"label_agreement":null},{"id":"W2184323220","doi":"10.1109/mnet.2015.7340426","title":"CHetNet: crowdsourcing to heterogeneous cellular networks","year":2015,"lang":"en","type":"article","venue":"IEEE Network","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Heterogeneous network; Crowdsourcing; Computer science; Software deployment; Cellular network; Wireless network; Computer network; Distributed computing; Wireless; Data science; Telecommunications; World Wide Web; Software engineering","score_opus":0.033221033786724884,"score_gpt":0.23853242160042967,"score_spread":0.20531138781370478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184323220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014076937,0.0005212084,0.96703535,0.0010329566,0.00045272685,0.00036047882,0.00009658793,0.00077508995,0.015648717],"genre_scores_gemma":[0.7218248,0.0011344287,0.25634876,0.0010025993,0.00039990523,0.00091598346,0.000265416,0.00018067875,0.01792744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859184,0.0006224362,0.000044373977,0.00020312643,0.000386945,0.00015111941],"domain_scores_gemma":[0.99824643,0.0008901116,0.00015706984,0.00030919435,0.00022052176,0.00017675338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020116274,0.0006548033,0.00067058724,0.0006983249,0.001685781,0.0015153389,0.0018300915,0.0016201718,0.0029424925],"category_scores_gemma":[0.004814205,0.00024111208,0.00064532843,0.001005835,0.0020727187,0.0015733384,0.0049158935,0.0013296253,0.0005850256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029511144,0.0001823404,0.001584365,0.0004593052,0.0001269606,0.0013416864,0.0014109034,0.362307,0.013669678,0.35363808,0.020539064,0.24444553],"study_design_scores_gemma":[0.000072796975,0.0001571845,0.00032884517,0.00006213682,0.000033390093,0.00027030802,0.0003940969,0.777542,0.0035948798,0.15640087,0.061089575,0.000053981028],"about_ca_topic_score_codex":0.0037326636,"about_ca_topic_score_gemma":0.0038057233,"teacher_disagreement_score":0.0037326636,"about_ca_system_score_codex":0.0012013807,"about_ca_system_score_gemma":0.0012689335,"threshold_uncertainty_score":0.010638654},"labels":[],"label_agreement":null},{"id":"W2213956524","doi":"10.1109/lcnw.2015.7365925","title":"Hybrid Community-Based Forwarding: A complete energy efficient algorithm for pocket switched networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"University of Saskatchewan","keywords":"Computer science; Latency (audio); Exploit; Computer network; Distributed computing; Heuristic; Popularity; Algorithm; Computer security","score_opus":0.06538087455180729,"score_gpt":0.2612173148807286,"score_spread":0.19583644032892128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213956524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043277055,0.00019505416,0.9531683,0.00026772777,0.000037173384,0.0001854181,0.00009928265,0.00075094873,0.0020189446],"genre_scores_gemma":[0.4577418,0.00017973412,0.5379394,0.00011358359,0.00003201329,0.00029770413,0.00027056754,0.00009197858,0.0033331933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997085,0.000067003915,0.000013028629,0.00003916389,0.00010817828,0.00006417161],"domain_scores_gemma":[0.99939525,0.00028881687,0.00005435923,0.0000644099,0.00014044983,0.000056693363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011036746,0.0006526442,0.0006506119,0.0012113214,0.0009672661,0.0005597213,0.0017699989,0.0010960945,0.002325969],"category_scores_gemma":[0.002735343,0.00023392674,0.00042530746,0.001065933,0.00044908977,0.0011989658,0.0011960035,0.00046714343,0.0002813181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024916153,0.00013826396,0.0016605797,0.0001029838,0.000059190534,0.00010719666,0.00020481597,0.66491485,0.006044938,0.019718038,0.0038504668,0.30294952],"study_design_scores_gemma":[0.00003803529,0.00003341352,0.00009338748,0.0000064840146,0.000007482139,0.000037024674,0.00002343903,0.99108326,0.0007718088,0.006795549,0.0011040969,0.0000060540574],"about_ca_topic_score_codex":0.010546577,"about_ca_topic_score_gemma":0.013612575,"teacher_disagreement_score":0.010546577,"about_ca_system_score_codex":0.0013118976,"about_ca_system_score_gemma":0.0019136054,"threshold_uncertainty_score":0.020970345},"labels":[],"label_agreement":null},{"id":"W2214007724","doi":"10.1142/s0129054115500288","title":"Shortest, Fastest, and Foremost Broadcast in Dynamic Networks","year":2015,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bounded function; Graph; Upper and lower bounds; Shortest path problem; Class (philosophy); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.026783227500746628,"score_gpt":0.3116693806386324,"score_spread":0.2848861531378858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214007724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15882665,0.005050896,0.8133048,0.0014873015,0.00016624326,0.00011855415,0.00021455962,0.0005663029,0.020264717],"genre_scores_gemma":[0.8868368,0.0044758855,0.10276011,0.00022520735,0.00023326071,0.000210418,0.00028837606,0.00017865337,0.0047912938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933845,0.00020524379,0.000024594972,0.00016053408,0.00016363976,0.00010757806],"domain_scores_gemma":[0.99605113,0.0029958899,0.0004216405,0.00018607793,0.00021172018,0.00013359124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012234015,0.000503143,0.00066875876,0.00094395335,0.00081344804,0.0013251303,0.0010964277,0.0010599676,0.0011607934],"category_scores_gemma":[0.008861914,0.0004379794,0.00044878657,0.0010146401,0.0016348307,0.0025639383,0.0009675163,0.0011980816,0.00021948473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023572703,0.0000746801,0.0013728171,0.00054835255,0.000026658678,0.00021508515,0.00041965497,0.5276824,0.0059273923,0.40505147,0.0045779315,0.053867724],"study_design_scores_gemma":[0.000020265503,0.000064126856,0.00034940013,0.000037758215,0.000019617793,0.00010187643,0.0001433018,0.76974046,0.0012191251,0.22481813,0.0034669894,0.000018943376],"about_ca_topic_score_codex":0.0030600126,"about_ca_topic_score_gemma":0.0020296327,"teacher_disagreement_score":0.0030600126,"about_ca_system_score_codex":0.0014860266,"about_ca_system_score_gemma":0.00090388977,"threshold_uncertainty_score":0.010782003},"labels":[],"label_agreement":null},{"id":"W2240661141","doi":"10.5296/npa.v7i3.8201","title":"A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks","year":2015,"lang":"en","type":"article","venue":"Network Protocols and Algorithms","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Computer science; Computer network; Delay-tolerant networking; Transfer (computing); Overhead (engineering); Reliability (semiconductor); Routing protocol; Protocol (science); Distributed computing; Data transmission; Routing (electronic design automation); Wireless Routing Protocol","score_opus":0.043533955554352535,"score_gpt":0.3086215794366964,"score_spread":0.26508762388234386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240661141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038011153,0.00020279351,0.99398285,0.00011973219,0.00007526754,0.00009553169,0.000027233227,0.00069128623,0.0010041875],"genre_scores_gemma":[0.32916853,0.0007052219,0.6619899,0.00026268064,0.00027001055,0.000768404,0.00021234238,0.000258658,0.006364121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885285,0.00033314622,0.00007968121,0.00015747643,0.00046156227,0.000115370756],"domain_scores_gemma":[0.99859756,0.0005782462,0.0001609844,0.00027624404,0.0002707171,0.00011626198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021812348,0.0007676251,0.0007641988,0.0010367597,0.001043632,0.001309615,0.0023150567,0.001301742,0.0028317785],"category_scores_gemma":[0.004003161,0.00034603712,0.0007962685,0.0009010384,0.0012876354,0.003051574,0.0022503126,0.0018161098,0.0007461808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032547035,0.00018988029,0.0005457145,0.000390095,0.000074474716,0.00060103356,0.0010768131,0.35980242,0.032390714,0.39455658,0.00769042,0.20235655],"study_design_scores_gemma":[0.00007193299,0.0002960383,0.00013115315,0.000043257805,0.000045349832,0.00024281924,0.00007564958,0.8919466,0.009281708,0.07283195,0.024975508,0.000058100206],"about_ca_topic_score_codex":0.0022923355,"about_ca_topic_score_gemma":0.0012976793,"teacher_disagreement_score":0.0028317785,"about_ca_system_score_codex":0.0011446652,"about_ca_system_score_gemma":0.0011902081,"threshold_uncertainty_score":0.011535585},"labels":[],"label_agreement":null},{"id":"W2288611833","doi":"10.1109/glocom.2015.7417371","title":"An Adaptive Frame Length Aggregation Scheme in Vehicular Delay-Tolerant Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Frame (networking); Throughput; Transmission (telecommunications); Computer network; Scheme (mathematics); Transmission delay; Data aggregator; Wireless; Data transmission; Real-time computing; Topology (electrical circuits); Telecommunications; Wireless sensor network; Engineering; Mathematics; Electrical engineering","score_opus":0.0895136670358828,"score_gpt":0.32265924731258694,"score_spread":0.23314558027670412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288611833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16606647,0.0017052226,0.82930446,0.00018693616,0.00018855439,0.00012070541,0.00005502243,0.00047335302,0.0018992064],"genre_scores_gemma":[0.94046855,0.00034765174,0.058436435,0.000046289246,0.00004874244,0.000044817178,0.000058323432,0.000013557934,0.00053564174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994789,0.00013136219,0.00005851977,0.000075229495,0.00018033304,0.000075625416],"domain_scores_gemma":[0.9989919,0.000345692,0.00018529652,0.00013946743,0.00028167982,0.000055998928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095576386,0.00047292115,0.0004588477,0.0007963895,0.0007082489,0.00056705077,0.0010365379,0.0003895134,0.00025035284],"category_scores_gemma":[0.0026076746,0.00017070147,0.00021504085,0.0007190072,0.00040833457,0.0009501472,0.00056083075,0.00036346115,0.00007921657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063519645,0.00018390652,0.004895676,0.00021708742,0.0000921119,0.0005749614,0.0007060118,0.5351557,0.095309235,0.032019787,0.002511884,0.3276984],"study_design_scores_gemma":[0.00002931137,0.00028381703,0.0013008424,0.000020196752,0.00005488052,0.00026948322,0.0000845074,0.9750074,0.013475846,0.005709625,0.0037115873,0.00005250187],"about_ca_topic_score_codex":0.003716491,"about_ca_topic_score_gemma":0.0034595435,"teacher_disagreement_score":0.003716491,"about_ca_system_score_codex":0.000996244,"about_ca_system_score_gemma":0.00051305175,"threshold_uncertainty_score":0.0073897243},"labels":[],"label_agreement":null},{"id":"W2289089659","doi":"10.1007/978-3-319-26784-5_9","title":"Rumours Spread Slowly in a Small World Spatial Network","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Pacific Institute for the Mathematical Sciences; Dalhousie University","funders":"","keywords":"Computer science; Distance; Spatial network; Metric (unit); Random graph; Metric space; Graph; Theoretical computer science; Small-world network; Combinatorics; Discrete mathematics; Complex network; Mathematics; Shortest path problem; World Wide Web","score_opus":0.03563427540586068,"score_gpt":0.2445023864282399,"score_spread":0.20886811102237923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289089659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7845147,0.0015219348,0.20209204,0.0017480012,0.000113253256,0.00010629798,0.0003580562,0.00047380736,0.0090719545],"genre_scores_gemma":[0.9873679,0.0007802484,0.007110597,0.00008407802,0.00008110294,0.0000397634,0.00011372437,0.000047732596,0.004374842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994604,0.00023391208,0.00002033216,0.000097175514,0.00010158812,0.00008646696],"domain_scores_gemma":[0.98345584,0.012987794,0.0014019075,0.0007962334,0.00072839984,0.0006298079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014901373,0.00058331824,0.001022717,0.0018770295,0.0015037224,0.0018957432,0.0016042267,0.0019634268,0.001899464],"category_scores_gemma":[0.016403956,0.00079895026,0.00049370475,0.001663499,0.0019779173,0.0036673588,0.0014745825,0.0013796273,0.00039382683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010365241,0.00014422319,0.009099089,0.0003897258,0.00021517901,0.0017167064,0.001323655,0.7364656,0.009006766,0.20648393,0.006120951,0.027997741],"study_design_scores_gemma":[0.000064987864,0.000109022,0.0015988454,0.000027555092,0.000064747954,0.00037197335,0.0004080786,0.91751134,0.0009535726,0.07755769,0.0012973621,0.00003473888],"about_ca_topic_score_codex":0.0043389695,"about_ca_topic_score_gemma":0.0031567449,"teacher_disagreement_score":0.0043389695,"about_ca_system_score_codex":0.0012502522,"about_ca_system_score_gemma":0.00048254695,"threshold_uncertainty_score":0.009071231},"labels":[],"label_agreement":null},{"id":"W2294671746","doi":"10.1007/978-3-319-11569-6_66","title":"Mobility Models-Based Performance Evaluation of the History Based Prediction for Routing Protocol for Infrastructure-Less Opportunistic Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Waypoint; Communication source; Routing protocol; Mobility model; Latency (audio); Network packet; Exploit; Overhead (engineering); Topology (electrical circuits); Distributed computing; Real-time computing; Engineering; Telecommunications; Computer security","score_opus":0.07137973589297492,"score_gpt":0.26438328529340643,"score_spread":0.19300354940043152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294671746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94252425,0.0020572154,0.047903158,0.0003504852,0.00014818486,0.00012488807,0.0004257307,0.0008443081,0.005621811],"genre_scores_gemma":[0.9959176,0.00018921013,0.0032236183,0.000011154209,0.00001258766,0.000016651324,0.00018459914,0.000023954959,0.0004206348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985454,0.0004761987,0.00007716969,0.00015308347,0.00053355814,0.0002146929],"domain_scores_gemma":[0.9950472,0.0033145766,0.00035689372,0.00040542876,0.00072585646,0.00015000436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024404898,0.0010787119,0.0008147726,0.0011307714,0.00057172694,0.00089820544,0.0012566635,0.0008744619,0.00095422793],"category_scores_gemma":[0.0064743473,0.00026985942,0.00028514498,0.0010616179,0.000676222,0.0016967762,0.0008465581,0.00071356306,0.00013499998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018504829,0.00041263146,0.006045396,0.0001493462,0.00014045039,0.00013639285,0.00011451305,0.9112216,0.008691607,0.0027920057,0.0019380618,0.06650752],"study_design_scores_gemma":[0.0000120303375,0.000297663,0.0013295521,0.0000051658167,0.000022581098,0.00003902877,0.000027461243,0.9949226,0.002768444,0.0004594827,0.00010268003,0.000013312396],"about_ca_topic_score_codex":0.00905005,"about_ca_topic_score_gemma":0.0072258194,"teacher_disagreement_score":0.00905005,"about_ca_system_score_codex":0.001741127,"about_ca_system_score_gemma":0.00066947326,"threshold_uncertainty_score":0.017994702},"labels":[],"label_agreement":null},{"id":"W2294971926","doi":"10.1504/ijcnds.2015.072398","title":"On social networking in intermittently connected networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Routing (electronic design automation); Delay-tolerant networking; Task (project management); Routing protocol; Wireless Routing Protocol","score_opus":0.04511118189151455,"score_gpt":0.2877352204639491,"score_spread":0.24262403857243456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294971926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04192923,0.061991714,0.8223409,0.011312137,0.002045374,0.00042592472,0.0005002335,0.00031596093,0.059138585],"genre_scores_gemma":[0.7603332,0.08952418,0.122244135,0.0024353452,0.0069721797,0.0014944769,0.00070740137,0.00016388569,0.01612517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713564,0.0015852543,0.00011330728,0.00039846046,0.0005649421,0.00020237982],"domain_scores_gemma":[0.9860275,0.01191115,0.00082643493,0.00042562085,0.00048730287,0.0003219524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636847,0.0015062992,0.0017116603,0.0036223256,0.0018690395,0.0031180691,0.001740876,0.0025106526,0.003134152],"category_scores_gemma":[0.010964778,0.0006127032,0.0010559849,0.0044021397,0.00390225,0.005836908,0.0027824328,0.0029082114,0.00048407813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006233586,0.00007738781,0.0016290417,0.0006114403,0.00012407504,0.00056427607,0.00051431014,0.097396225,0.000925549,0.85748214,0.006729738,0.03388349],"study_design_scores_gemma":[0.000032111864,0.000110388704,0.0010135296,0.00025028727,0.000055212065,0.000493369,0.00020048567,0.26153386,0.0003070558,0.7075079,0.028428782,0.0000669662],"about_ca_topic_score_codex":0.0021376263,"about_ca_topic_score_gemma":0.001698348,"teacher_disagreement_score":0.0036223256,"about_ca_system_score_codex":0.0025070237,"about_ca_system_score_gemma":0.00081891584,"threshold_uncertainty_score":0.018189847},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04280833214941708,"score_gpt":0.2906900152742017,"score_spread":0.2478816831247846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312087731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80225515,0.027253112,0.119943775,0.0016131018,0.001056733,0.00062215683,0.0015314423,0.0014245094,0.044299886],"genre_scores_gemma":[0.9682418,0.005247767,0.02353193,0.00011137253,0.00010235353,0.00017580962,0.00086876634,0.000061047656,0.0016590636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961874,0.00095580675,0.00039786426,0.000333077,0.0018862971,0.00023964111],"domain_scores_gemma":[0.99409336,0.0034554328,0.00056451466,0.00043902415,0.0012860069,0.00016162399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030219331,0.001002626,0.00072004955,0.0027607635,0.0007016774,0.0012658072,0.001304098,0.0008770971,0.00068289455],"category_scores_gemma":[0.007313526,0.00019485864,0.00037630036,0.0024241125,0.0005028342,0.0025346435,0.00080617005,0.00046245963,0.00018538637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002621506,0.00091356214,0.014421799,0.0020023354,0.0007197272,0.00060958526,0.0005058174,0.57026654,0.03760944,0.03090347,0.00924405,0.3301821],"study_design_scores_gemma":[0.00015164293,0.0041768793,0.0078022815,0.00016354797,0.00029845617,0.0011795342,0.0007263643,0.9313176,0.027123034,0.010396669,0.016515635,0.00014827245],"about_ca_topic_score_codex":0.0017000256,"about_ca_topic_score_gemma":0.001082426,"teacher_disagreement_score":0.0030219331,"about_ca_system_score_codex":0.001602735,"about_ca_system_score_gemma":0.0009546962,"threshold_uncertainty_score":0.015981734},"labels":[],"label_agreement":null},{"id":"W2323960072","doi":"10.3724/sp.j.1001.2013.04227","title":"Periodic Intermittently Connected-Based Data Delivery in Opportunistic Networks","year":2014,"lang":"en","type":"article","venue":"Journal of Software","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Poultry Industry Council","funders":"","keywords":"Computer science; Node (physics); Probability distribution; Computer network; Topology (electrical circuits); Mathematics; Physics; Statistics","score_opus":0.03399711179871112,"score_gpt":0.2473832626205214,"score_spread":0.21338615082181028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323960072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16398755,0.011503349,0.44280374,0.016590426,0.0012039727,0.0007315481,0.000793064,0.0009834621,0.36140287],"genre_scores_gemma":[0.9095934,0.004335212,0.061178144,0.00078164187,0.00028707334,0.0003754447,0.00018796895,0.00005166081,0.02320954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989868,0.00033031436,0.00006782424,0.00018728695,0.00032052954,0.00010713126],"domain_scores_gemma":[0.9981824,0.000808909,0.00026452894,0.00015344533,0.00045798783,0.00013270737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015406345,0.00030131073,0.00025263362,0.0009170744,0.0017028077,0.0030017688,0.0007606173,0.0007507195,0.0030645996],"category_scores_gemma":[0.0040245745,0.00027689507,0.00026906066,0.0014760948,0.0019192657,0.0039380905,0.0015217396,0.00093932607,0.0004659602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012935414,0.00009211637,0.0086786905,0.00081389653,0.0000720384,0.0006035418,0.006131608,0.026613584,0.0036317322,0.6955293,0.018033456,0.23967077],"study_design_scores_gemma":[0.00013617148,0.00023686109,0.010939553,0.00081944565,0.00013962915,0.0011393608,0.008680842,0.16278514,0.007352262,0.48705938,0.32052934,0.00018208209],"about_ca_topic_score_codex":0.010569636,"about_ca_topic_score_gemma":0.00837077,"teacher_disagreement_score":0.010569636,"about_ca_system_score_codex":0.0022376645,"about_ca_system_score_gemma":0.0033793382,"threshold_uncertainty_score":0.02101624},"labels":[],"label_agreement":null},{"id":"W2331188672","doi":"10.1109/glocomw.2013.6855651","title":"Relative interpersonal-influence-aware routing in buffer constrained Delay-Tolerant Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Selfishness; Interpersonal ties; Computer network; Computer science; Network packet; Node (physics); Interpersonal communication; Routing (electronic design automation); Computer security; Psychology; Social psychology; Engineering","score_opus":0.01142551098254724,"score_gpt":0.22019333326249382,"score_spread":0.20876782227994659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331188672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21013017,0.0006113872,0.7862983,0.00021899055,0.00004487491,0.00006727886,0.000061022423,0.00028905403,0.002278988],"genre_scores_gemma":[0.97631186,0.00016644437,0.02300237,0.000022579416,0.000019706855,0.000026392701,0.00003112722,0.000013437409,0.00040616214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914706,0.0002896324,0.00003956546,0.00015655474,0.00029370593,0.00007345736],"domain_scores_gemma":[0.99741733,0.0014875226,0.0005267633,0.00016635346,0.00025879891,0.00014320324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068974,0.00063404324,0.00077335106,0.0010668931,0.0006589872,0.0010369937,0.0016047736,0.00049723603,0.00036674232],"category_scores_gemma":[0.00597687,0.00033255573,0.0004465575,0.00096003816,0.0007340274,0.0015634036,0.00091887714,0.0003806823,0.0000667903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658171,0.00006056856,0.0029206618,0.00011692054,0.000081199236,0.00026529058,0.00029270767,0.9339615,0.0071930857,0.021352997,0.00034929052,0.033279113],"study_design_scores_gemma":[0.0000049340747,0.000041695883,0.0004972556,0.000004212071,0.000021581593,0.000068853486,0.00003689066,0.9924581,0.001139243,0.00543806,0.00027357912,0.00001552138],"about_ca_topic_score_codex":0.0025296202,"about_ca_topic_score_gemma":0.0028736182,"teacher_disagreement_score":0.0025296202,"about_ca_system_score_codex":0.0010662813,"about_ca_system_score_gemma":0.0005198536,"threshold_uncertainty_score":0.0077364445},"labels":[],"label_agreement":null},{"id":"W2340938240","doi":"10.1109/mcom.2016.7452273","title":"Scalable and mobile context data retrieval and distribution for community response heterogeneous wireless networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Context (archaeology); Overhead (engineering); Computer network; Distributed computing; Wireless; Exploit; Mobile device; Vehicular ad hoc network; Mobile computing; Context awareness; Wireless ad hoc network; Computer security; Telecommunications; Database; World Wide Web","score_opus":0.06299934078735824,"score_gpt":0.2997655513209078,"score_spread":0.23676621053354957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340938240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10312608,0.0011280278,0.88778496,0.000545501,0.000110040426,0.00039245383,0.00019847894,0.0032261584,0.0034883588],"genre_scores_gemma":[0.8614936,0.00038330042,0.1352348,0.00013319196,0.00007837691,0.00021883521,0.00031205927,0.00008331999,0.0020626183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938476,0.00012230512,0.000048960857,0.00011595175,0.00021782774,0.000110200286],"domain_scores_gemma":[0.9990388,0.00025814574,0.00010196186,0.00028719057,0.00021447537,0.00009941876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085513643,0.00047388434,0.00059334864,0.0009750764,0.0008730033,0.00090954936,0.001613874,0.00051510386,0.0010841257],"category_scores_gemma":[0.0029605196,0.00023914539,0.00029375657,0.00087007723,0.00034336775,0.0017870449,0.0024672025,0.0006762007,0.00034695512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086402235,0.0005166975,0.0039041727,0.00032276195,0.00013652709,0.00067672355,0.0009001576,0.22206491,0.10401296,0.023511406,0.014668628,0.628421],"study_design_scores_gemma":[0.000074315816,0.00013351941,0.0010117472,0.000016426215,0.00004413669,0.00022262288,0.00033253475,0.9656241,0.015045107,0.008873465,0.008583263,0.000038865368],"about_ca_topic_score_codex":0.0045242333,"about_ca_topic_score_gemma":0.0048632873,"teacher_disagreement_score":0.0045242333,"about_ca_system_score_codex":0.0008408417,"about_ca_system_score_gemma":0.00069065765,"threshold_uncertainty_score":0.008995771},"labels":[],"label_agreement":null},{"id":"W2344469604","doi":"10.1109/tnet.2016.2523242","title":"On the Distance-Sensitive and Load-Balanced Information Storage and Retrieval for 3D Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hubei Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Data retrieval; Graph; Constraint (computer-aided design); Focus (optics); Wireless sensor network; Key (lock); Graph theory; Path (computing); Data mining; Distributed computing; Theoretical computer science; Computer network","score_opus":0.01837742692926666,"score_gpt":0.22367623441328024,"score_spread":0.20529880748401358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344469604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05903558,0.0019931952,0.93338954,0.00057109643,0.00006214453,0.00010375637,0.00012539564,0.00047432218,0.004244982],"genre_scores_gemma":[0.7595481,0.0026702187,0.2329438,0.00029576308,0.00009912478,0.00013782996,0.00019801951,0.00012395396,0.0039832154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950147,0.00015736138,0.000032074404,0.00007788534,0.00017306517,0.00005816278],"domain_scores_gemma":[0.99907184,0.00040899732,0.00011211823,0.00019339823,0.00017043538,0.00004325937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006639994,0.0005487527,0.00072497124,0.0010143714,0.00064890215,0.0010589422,0.0013576723,0.00062417844,0.0015887794],"category_scores_gemma":[0.002459701,0.00025812353,0.00033332995,0.0014462018,0.0010506616,0.0033155112,0.00155041,0.0004975221,0.00044702494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049266045,0.00016079057,0.0010139284,0.00040322426,0.00005517159,0.00020883538,0.00041747798,0.5989666,0.051291008,0.10802397,0.0052836128,0.2336827],"study_design_scores_gemma":[0.000014035015,0.00009979808,0.00023598506,0.00001292933,0.0000105332465,0.00014246623,0.00007577084,0.97235864,0.006327855,0.018284548,0.0024128957,0.000024475496],"about_ca_topic_score_codex":0.00238876,"about_ca_topic_score_gemma":0.0022738327,"teacher_disagreement_score":0.00238876,"about_ca_system_score_codex":0.0009602783,"about_ca_system_score_gemma":0.00075753545,"threshold_uncertainty_score":0.006967306},"labels":[],"label_agreement":null},{"id":"W2347505770","doi":"","title":"A Mobility Support Proposal in Next Generation Network","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Next-generation network; Listing (finance); Computer network; Telecommunications; World Wide Web; The Internet","score_opus":0.029596347465680517,"score_gpt":0.2511404168869265,"score_spread":0.221544069421246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347505770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09865923,0.010127853,0.74689794,0.023920693,0.0039809407,0.00046855194,0.00019671851,0.0009794065,0.11476864],"genre_scores_gemma":[0.8214958,0.005240787,0.1458168,0.002236553,0.0020394358,0.0005058962,0.00029821612,0.00007418898,0.022292495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937975,0.00016990035,0.000034671357,0.00008220138,0.00022209006,0.00011140966],"domain_scores_gemma":[0.9989064,0.0003427431,0.00010141723,0.00012019063,0.00039481683,0.00013436805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013080294,0.00031499096,0.00019685309,0.0006615994,0.0012437743,0.001466559,0.00085526356,0.001734222,0.0020552531],"category_scores_gemma":[0.003442719,0.00019987888,0.00019810637,0.00054605835,0.00094217015,0.003225411,0.0010713235,0.0010308723,0.00043685295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022693454,0.00007353055,0.0015999789,0.00023097741,0.000017962404,0.00073465117,0.0006565129,0.009344667,0.01012354,0.81967026,0.016609885,0.140711],"study_design_scores_gemma":[0.00010760724,0.0006621835,0.0018151806,0.0002741011,0.0000856735,0.0026599262,0.0009615996,0.1492216,0.019284459,0.3266675,0.49812,0.00014019567],"about_ca_topic_score_codex":0.0010649485,"about_ca_topic_score_gemma":0.0013780535,"teacher_disagreement_score":0.0020552531,"about_ca_system_score_codex":0.0007599627,"about_ca_system_score_gemma":0.0009493206,"threshold_uncertainty_score":0.006917596},"labels":[],"label_agreement":null},{"id":"W2394293923","doi":"","title":"\"Light Barrier\" can't Resist the Human Advancements——In memory of 242nd Xangshen Science Conference","year":2013,"lang":"en","type":"article","venue":"Journal of Communication University of China","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subject (documents); Astronautics; Solar System; Speed of light (cellular automaton); Computer science; Aerospace engineering; Physics; Engineering; Astronomy; Optics","score_opus":0.015848236564997675,"score_gpt":0.2281011678793411,"score_spread":0.21225293131434342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394293923","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015907789,0.13785058,0.015534899,0.49469706,0.15326284,0.0000708545,0.0003976348,0.00059270667,0.18168569],"genre_scores_gemma":[0.27491596,0.08692431,0.011606087,0.08599171,0.05650942,0.00015232846,0.00060281705,0.0010135793,0.48228362],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990619,0.00018893628,0.000054959477,0.0001868313,0.00032168275,0.00018578938],"domain_scores_gemma":[0.99834025,0.00035532555,0.00014667764,0.00015919839,0.0006444379,0.00035409082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001952861,0.0008203208,0.0007523012,0.0010642811,0.0052395226,0.0055479356,0.001029908,0.00294873,0.01797013],"category_scores_gemma":[0.0033199214,0.00032369283,0.00079614593,0.00073920266,0.0049005086,0.0120902145,0.003763972,0.008140183,0.0050377627],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080284415,0.00003945281,0.0011301081,0.00047709118,0.000033906847,0.00030280446,0.0019496345,0.00034994193,0.0009842085,0.2696871,0.6609612,0.0640042],"study_design_scores_gemma":[0.0000064123283,0.000027716042,0.0003854779,0.0001986373,0.000010197329,0.0002771635,0.0013001689,0.00039451878,0.00042446368,0.029385932,0.9675568,0.000032607873],"about_ca_topic_score_codex":0.0024199858,"about_ca_topic_score_gemma":0.0026476006,"teacher_disagreement_score":0.01797013,"about_ca_system_score_codex":0.0027552054,"about_ca_system_score_gemma":0.0021282558,"threshold_uncertainty_score":0.060116053},"labels":[],"label_agreement":null},{"id":"W2398016043","doi":"10.1007/978-1-4614-7079-3","title":"Cooperative Networking in a Heterogeneous Wireless Medium","year":2013,"lang":"en","type":"book","venue":"SpringerBriefs in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless; Computer science; Wireless network; Computer network; Telecommunications","score_opus":0.01785269142045934,"score_gpt":0.2328219237301977,"score_spread":0.21496923230973836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398016043","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03954404,0.035189867,0.8200803,0.0009909859,0.0013113775,0.00005575207,0.000043080134,0.00039284793,0.102391705],"genre_scores_gemma":[0.71550304,0.03585726,0.123889424,0.00040753992,0.0016547301,0.00019214435,0.00012783665,0.00012954736,0.122238465],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99985206,0.000027821712,0.0000048715387,0.000024620102,0.00007327004,0.000017239197],"domain_scores_gemma":[0.99973506,0.00016896651,0.000015276246,0.000031507414,0.000030142324,0.000019011904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195379,0.0004449611,0.00031716694,0.0003980878,0.00028569574,0.0008617464,0.00074180093,0.0005366174,0.0017415375],"category_scores_gemma":[0.00053761475,0.00023425864,0.00017961307,0.0006897049,0.00060116575,0.0012159182,0.0009946029,0.0006156303,0.000474216],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084226995,0.000103891856,0.00044910697,0.0004841323,0.00006856872,0.0007109463,0.00038770068,0.15067756,0.033095676,0.32546526,0.016980333,0.47149262],"study_design_scores_gemma":[0.000035585294,0.00022111906,0.000640714,0.00015103564,0.00008009654,0.0010531931,0.00018895576,0.56934714,0.007683697,0.26535383,0.15518557,0.000059061967],"about_ca_topic_score_codex":0.00027785395,"about_ca_topic_score_gemma":0.000404356,"teacher_disagreement_score":0.0017415375,"about_ca_system_score_codex":0.00025730825,"about_ca_system_score_gemma":0.00017785313,"threshold_uncertainty_score":0.0058259964},"labels":[],"label_agreement":null},{"id":"W2409850475","doi":"10.1007/978-3-319-20454-3_5","title":"Conclusion and Future Research Directions","year":2015,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.03044889073115445,"score_gpt":0.25465624868146647,"score_spread":0.22420735795031202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409850475","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025303266,0.2587005,0.011301702,0.50341505,0.06607484,0.00024237599,0.0017621411,0.00064774713,0.1553253],"genre_scores_gemma":[0.058519155,0.43479556,0.033466194,0.19390199,0.037341427,0.00077858026,0.004323011,0.0004452947,0.23642887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959372,0.0013076771,0.00025230137,0.0007457911,0.001034467,0.00072257675],"domain_scores_gemma":[0.98073226,0.004603899,0.0005477763,0.0010127119,0.009610401,0.003493025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011332443,0.0010780257,0.0012581701,0.0028329836,0.0029942608,0.0118308235,0.0033640538,0.005701556,0.12035278],"category_scores_gemma":[0.016736219,0.00037913743,0.0013521216,0.0035347978,0.0030400788,0.01395142,0.0038038872,0.005088358,0.037870858],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003894287,0.0003122339,0.0012118435,0.0025507922,0.000052745374,0.00026265686,0.0008516225,0.0005768334,0.0005930257,0.14795402,0.48694962,0.3582952],"study_design_scores_gemma":[0.00006980009,0.00012256793,0.00066007074,0.0034537227,0.00007558714,0.00025431422,0.004570236,0.0004384804,0.00050474826,0.116214775,0.87359613,0.000039603598],"about_ca_topic_score_codex":0.0069252886,"about_ca_topic_score_gemma":0.008619748,"teacher_disagreement_score":0.12035278,"about_ca_system_score_codex":0.004431699,"about_ca_system_score_gemma":0.017377203,"threshold_uncertainty_score":0.40262014},"labels":[],"label_agreement":null},{"id":"W2433003374","doi":"10.3390/s16060821","title":"A New Cellular Architecture for Information Retrieval from Sensor Networks through Embedded Service and Security Protocols","year":2016,"lang":"en","type":"article","venue":"Sensors","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Wonkwang University","keywords":"SCADA; Computer science; Interconnectivity; Protocol (science); Computer network; Communications protocol; Cellular network; Information exchange; Computer security; Embedded system; Telecommunications; Engineering","score_opus":0.016762503421757086,"score_gpt":0.24514282150330347,"score_spread":0.22838031808154638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2433003374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013884009,0.003097622,0.94967484,0.0010730668,0.00066433195,0.00031655582,0.00014473037,0.004162697,0.026982252],"genre_scores_gemma":[0.48308912,0.0071349614,0.42620686,0.001295311,0.00068701565,0.0008320592,0.0010581105,0.00036895685,0.079327606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912494,0.000147941,0.00009021813,0.00014020578,0.00040614096,0.00009055974],"domain_scores_gemma":[0.99916315,0.00010605162,0.000057658497,0.0002873584,0.00033707122,0.000048775535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000921564,0.0005307566,0.00044457975,0.0013336532,0.00088875927,0.0029829934,0.0016039304,0.0011194785,0.0037726525],"category_scores_gemma":[0.0015774289,0.0003259168,0.0004200968,0.0013695674,0.00086230243,0.003779388,0.0017553204,0.0014049768,0.0024413501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037352418,0.00015731379,0.0010780816,0.00041475997,0.00009617251,0.00052947877,0.00073689024,0.021142866,0.053370066,0.5661326,0.023396777,0.3325715],"study_design_scores_gemma":[0.000070514805,0.00050636864,0.0008089208,0.00016542061,0.00014421943,0.001224108,0.00031927085,0.32049248,0.0400677,0.11024211,0.52583385,0.00012508343],"about_ca_topic_score_codex":0.0030578964,"about_ca_topic_score_gemma":0.0029268044,"teacher_disagreement_score":0.0037726525,"about_ca_system_score_codex":0.0013842487,"about_ca_system_score_gemma":0.0014968963,"threshold_uncertainty_score":0.012620747},"labels":[],"label_agreement":null},{"id":"W2464916371","doi":"10.1109/vtcspring.2016.7504479","title":"Social-Aware Energy-Efficient Data Dissemination with D2D Communications","year":2016,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Dissemination; Exploit; Efficient energy use; Data transmission; Energy consumption; Mobile device; Information Dissemination; Scheduling (production processes); Computer network; Mobile telephony; Transmission (telecommunications); Popularity; Distributed computing; Computer security; Mobile radio; Telecommunications; World Wide Web; Engineering","score_opus":0.05887772651769166,"score_gpt":0.30721734729533534,"score_spread":0.24833962077764368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464916371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04292722,0.0009764999,0.9486771,0.0005808165,0.000080030884,0.00015427268,0.0001207017,0.00041655375,0.0060667805],"genre_scores_gemma":[0.8962835,0.00062662,0.099654354,0.00012605939,0.000056205026,0.00016009276,0.000108588974,0.00003877483,0.0029457067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993923,0.00020920995,0.000032621054,0.000102613485,0.00018318405,0.000080006204],"domain_scores_gemma":[0.9985337,0.0008398698,0.00017393388,0.00016947152,0.00019351208,0.00008945207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076642097,0.0005738274,0.0007326601,0.000861013,0.0008917956,0.0008698264,0.0012576459,0.000726965,0.0009457375],"category_scores_gemma":[0.002866225,0.00025595762,0.0004320073,0.0012897392,0.00045787622,0.0013316098,0.0014817344,0.00044312023,0.00022562513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040210554,0.00023477232,0.002303697,0.0005538646,0.00015622692,0.00053765887,0.0006360095,0.6936391,0.03987195,0.05331948,0.008750462,0.19959463],"study_design_scores_gemma":[0.00004813889,0.00008437985,0.00036236248,0.000012301591,0.000032016167,0.00016985516,0.000121555204,0.9731459,0.0051759365,0.01365413,0.0071725165,0.00002100016],"about_ca_topic_score_codex":0.002346462,"about_ca_topic_score_gemma":0.0034201415,"teacher_disagreement_score":0.002346462,"about_ca_system_score_codex":0.00076738675,"about_ca_system_score_gemma":0.0009104728,"threshold_uncertainty_score":0.0055677295},"labels":[],"label_agreement":null},{"id":"W2465852873","doi":"10.1007/978-3-319-20445-1_4","title":"Performance Analysis of WiFi Offloading in Vehicular Environments","year":2015,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network","score_opus":0.012400922334151571,"score_gpt":0.18621192082377314,"score_spread":0.17381099848962156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465852873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71315587,0.0082391165,0.22566094,0.0009129211,0.00035158606,0.00016941817,0.0007563995,0.0014284309,0.049325228],"genre_scores_gemma":[0.99483204,0.00063423614,0.0025059048,0.000031714633,0.000057369703,0.000014138676,0.000109580535,0.000037291255,0.0017777391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998862,0.0002183913,0.000026712134,0.00010671493,0.00035475462,0.00043143323],"domain_scores_gemma":[0.9982862,0.0011216075,0.00009682809,0.00009812543,0.00032452762,0.00007260989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777728,0.0011610792,0.00084758474,0.0011219719,0.0006523047,0.0013595128,0.0006652974,0.00061651133,0.0026836605],"category_scores_gemma":[0.0034846673,0.00022566279,0.0003798427,0.0014832577,0.00061691186,0.0006899192,0.0008310066,0.0004900556,0.00037053123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058687327,0.000090428206,0.0030669803,0.00019206027,0.00006411238,0.00023346387,0.000105088104,0.92015606,0.008857108,0.0106582185,0.0023018415,0.05368777],"study_design_scores_gemma":[0.0000061831074,0.00014243176,0.0015648023,0.000015530371,0.000027670043,0.0001417553,0.00007747966,0.9933153,0.002032965,0.0020483616,0.0006126787,0.000014804212],"about_ca_topic_score_codex":0.012896176,"about_ca_topic_score_gemma":0.009972848,"teacher_disagreement_score":0.012896176,"about_ca_system_score_codex":0.0016335539,"about_ca_system_score_gemma":0.0010151622,"threshold_uncertainty_score":0.025642216},"labels":[],"label_agreement":null},{"id":"W2473961292","doi":"10.1007/978-3-319-24717-5_3","title":"Secure Health Data Collection in MHN","year":2015,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upload; Computer science; Data aggregator; Intuition; Data collection; Health data; Cloud computing; Computer network; Computer security; World Wide Web; Health care; Wireless sensor network","score_opus":0.09323885677302297,"score_gpt":0.2896378611564897,"score_spread":0.19639900438346675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473961292","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068115215,0.022443293,0.8205381,0.003317772,0.002079153,0.00016139956,0.00023993073,0.00076544535,0.14364333],"genre_scores_gemma":[0.42416334,0.046293896,0.2489578,0.002033397,0.003153255,0.00036520674,0.0006964415,0.00033100392,0.27400565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969196,0.00006241621,0.000021925911,0.000045671644,0.00015260497,0.000025405361],"domain_scores_gemma":[0.9996661,0.00019001252,0.00002128172,0.00006894627,0.000042769756,0.000010889768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004811878,0.00036544277,0.0003256742,0.00029907952,0.0003774488,0.001196734,0.00056026096,0.000682769,0.0056150025],"category_scores_gemma":[0.0011853459,0.00022361989,0.00023578102,0.0005551925,0.0007428313,0.0021496508,0.0012323563,0.0009989381,0.0014756367],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007661432,0.000032876073,0.00024923202,0.00040340066,0.000018695086,0.00020169483,0.0002859853,0.01978222,0.0034441827,0.5001047,0.03157047,0.4438299],"study_design_scores_gemma":[0.00001515941,0.000059896116,0.000487151,0.0004053899,0.000028538903,0.0008731051,0.00019335737,0.1359762,0.0063228556,0.49145275,0.36414686,0.000038773913],"about_ca_topic_score_codex":0.0006467584,"about_ca_topic_score_gemma":0.00070111064,"teacher_disagreement_score":0.0056150025,"about_ca_system_score_codex":0.0007963853,"about_ca_system_score_gemma":0.00039048173,"threshold_uncertainty_score":0.018784046},"labels":[],"label_agreement":null},{"id":"W2486094321","doi":"10.1016/j.comcom.2016.07.009","title":"Organized topology based routing protocol in incompletely predictable ad-hoc networks","year":2016,"lang":"en","type":"article","venue":"Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Nanjing University of Information Science and Technology; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Topology (electrical circuits); Routing protocol; Network topology; Computer network; Distributed computing; Routing (electronic design automation); Node (physics); Routing table; Wireless ad hoc network; Mathematics; Telecommunications","score_opus":0.04124923082441778,"score_gpt":0.286514547669909,"score_spread":0.24526531684549124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486094321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14175567,0.0006754231,0.85185117,0.0004185259,0.00017539244,0.00014190025,0.00019703415,0.0005847279,0.0042002075],"genre_scores_gemma":[0.93111324,0.0003602091,0.065915205,0.0000624072,0.000049533734,0.00010440709,0.00022551997,0.00003141022,0.0021380398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995875,0.00012771011,0.000035718145,0.00005851709,0.00015166776,0.000038910217],"domain_scores_gemma":[0.9986313,0.00053353026,0.00025511323,0.00027553926,0.00021838231,0.00008621604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007308832,0.00027502677,0.00045537777,0.0006434047,0.0007170396,0.0009429456,0.0011306895,0.0004562946,0.00047284632],"category_scores_gemma":[0.0018731037,0.00024160363,0.00019823464,0.00065638626,0.00051363936,0.0012232803,0.0010111964,0.000528876,0.0001164699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049134745,0.00018806815,0.0027866957,0.00024156188,0.00012326613,0.00063785084,0.0005192297,0.7404124,0.028992709,0.12330367,0.0033366282,0.09896658],"study_design_scores_gemma":[0.000029553526,0.00020601634,0.0005573632,0.000012975487,0.00004154374,0.00018520451,0.00009701398,0.95903873,0.0053854324,0.03132097,0.0031059103,0.000019434518],"about_ca_topic_score_codex":0.0006265228,"about_ca_topic_score_gemma":0.0011596219,"teacher_disagreement_score":0.0011306895,"about_ca_system_score_codex":0.00043264363,"about_ca_system_score_gemma":0.00073676865,"threshold_uncertainty_score":0.0038653612},"labels":[],"label_agreement":null},{"id":"W2495546859","doi":"10.1145/2933057.2933117","title":"How Asynchrony Affects Rumor Spreading Time","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Rumor; Asynchrony (computer programming); Asynchronous communication; Computer science; Gossip; Bounded function; Node (physics); Binary logarithm; Computer network; Theoretical computer science; Combinatorics; Mathematics; Physics","score_opus":0.015879866141530818,"score_gpt":0.22126221873930407,"score_spread":0.20538235259777327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495546859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73567915,0.0019043565,0.2467252,0.0033082059,0.00021118269,0.00009304875,0.00041772288,0.0011020089,0.010559171],"genre_scores_gemma":[0.99230254,0.0002607735,0.00662839,0.000084180996,0.000047928672,0.000029625,0.00006250458,0.00008009024,0.0005038786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968252,0.0013526515,0.00016359243,0.0007242988,0.0005187852,0.00041540514],"domain_scores_gemma":[0.91020477,0.07096253,0.0074939188,0.0064098635,0.003146252,0.001782797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052474714,0.0006038006,0.00080446334,0.0011089193,0.0012589152,0.0024476128,0.0015146047,0.0015372619,0.0025449793],"category_scores_gemma":[0.06614055,0.00066970143,0.0006546564,0.00078055635,0.0019676453,0.005786786,0.0014874054,0.0021967054,0.00048906746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025764487,0.00040592818,0.05222623,0.0008013071,0.0004416418,0.0015264911,0.00349262,0.5105633,0.05365546,0.28952816,0.005862265,0.07892006],"study_design_scores_gemma":[0.00022287457,0.00030539784,0.010588237,0.000057047968,0.0002260898,0.0007001522,0.00067979546,0.80214125,0.010879825,0.17100798,0.0030642245,0.00012711974],"about_ca_topic_score_codex":0.002638021,"about_ca_topic_score_gemma":0.0014895734,"teacher_disagreement_score":0.0052474714,"about_ca_system_score_codex":0.0013825236,"about_ca_system_score_gemma":0.0011529444,"threshold_uncertainty_score":0.027751625},"labels":[],"label_agreement":null},{"id":"W2496185103","doi":"10.1007/978-3-319-42836-9_38","title":"Towards Scheduling to Minimize the Total Penalties of Tardiness of Delivered Data in Maritime CPSs (Invited Paper)","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tardiness; Computer science; Initialization; Upload; Scheduling (production processes); Crossover; Real-time computing; Network packet; Heuristic; Mathematical optimization; Job shop scheduling; Distributed computing; Operations research; Computer network; Schedule; Artificial intelligence; Operating system; Engineering","score_opus":0.029934476985492817,"score_gpt":0.25278164550679105,"score_spread":0.22284716852129824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496185103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024486396,0.0019324662,0.96262467,0.0009766378,0.00061580207,0.00009391262,0.0001384422,0.00037636654,0.008755343],"genre_scores_gemma":[0.45700213,0.0032640398,0.51407254,0.000488921,0.00069759705,0.00018155444,0.00038012912,0.0006818916,0.023231218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997137,0.000065328764,0.000013229151,0.00007082395,0.000072370574,0.00006449837],"domain_scores_gemma":[0.9995529,0.00019169819,0.000047522804,0.000036340105,0.000119251934,0.000052222367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009132696,0.0010598187,0.00076529087,0.00043738674,0.00049305573,0.0011502912,0.0013689538,0.00080313865,0.003146003],"category_scores_gemma":[0.0015723536,0.00045153525,0.00066473393,0.00088983704,0.00047280686,0.0008610032,0.0009511531,0.0015017512,0.0005640024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001508837,0.00011116164,0.00041220695,0.0003986056,0.00007737787,0.00009347341,0.00016890664,0.7979621,0.010519627,0.056489527,0.0122910915,0.12132501],"study_design_scores_gemma":[0.000012202733,0.00008627765,0.00022549121,0.000030700612,0.000019117919,0.000036002526,0.00004971567,0.96039635,0.001502988,0.03056174,0.007069432,0.000010112601],"about_ca_topic_score_codex":0.0048273276,"about_ca_topic_score_gemma":0.004460145,"teacher_disagreement_score":0.0048273276,"about_ca_system_score_codex":0.0013111102,"about_ca_system_score_gemma":0.0017588414,"threshold_uncertainty_score":0.010524392},"labels":[],"label_agreement":null},{"id":"W2507319665","doi":"10.1109/icufn.2016.7537104","title":"ACPM: An associative connectivity prediction model for AANET","year":2016,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Network topology; Joins; Topology (electrical circuits); Wireless ad hoc network; Distributed computing; Cluster analysis; Computer network; Artificial intelligence; Engineering","score_opus":0.04334768705881492,"score_gpt":0.26628747022384297,"score_spread":0.22293978316502805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507319665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045258798,0.00047120487,0.9460195,0.0006072664,0.00017273937,0.00008716068,0.00064336817,0.0012859016,0.005454124],"genre_scores_gemma":[0.89744097,0.00044959126,0.09431432,0.00023393922,0.00014673648,0.00026154093,0.0007609943,0.00009354041,0.0062983027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964774,0.00008252139,0.00002225851,0.0001088463,0.00008817585,0.000050415318],"domain_scores_gemma":[0.99921393,0.00037299792,0.000088420464,0.000068710724,0.00020360704,0.000052327476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072514184,0.00059290713,0.0006785551,0.00058853696,0.0005867662,0.0008817944,0.001694187,0.0009965441,0.0023674436],"category_scores_gemma":[0.002428881,0.00035511688,0.0006022379,0.00075311237,0.0004521641,0.0014393124,0.0007538437,0.0011685387,0.00041867152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047980247,0.00003118456,0.0008491852,0.000019538747,0.00001802677,0.000044307995,0.000026982429,0.97429895,0.00039622645,0.0066764774,0.0012234572,0.016367625],"study_design_scores_gemma":[0.0000014487755,0.0000049485475,0.000041398096,0.0000010937266,0.000001906011,0.0000052737582,0.0000016916641,0.9984315,0.000035541747,0.0012886261,0.00018520105,0.0000013190117],"about_ca_topic_score_codex":0.022510255,"about_ca_topic_score_gemma":0.014346427,"teacher_disagreement_score":0.022510255,"about_ca_system_score_codex":0.0010009778,"about_ca_system_score_gemma":0.0011188943,"threshold_uncertainty_score":0.0447585},"labels":[],"label_agreement":null},{"id":"W2507894885","doi":"10.1109/tvt.2015.2476504","title":"GeoMobCon: A Mobility-Contact-Aware Geocast Scheme for Urban VANETs","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Scheme (mathematics); Computer network; Computer science; Geocast; Wireless ad hoc network; Vehicular ad hoc network; Telecommunications; Wireless","score_opus":0.028799427883868155,"score_gpt":0.24998355233053432,"score_spread":0.22118412444666616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507894885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064718954,0.0016952485,0.9152838,0.0005067991,0.0006360494,0.0005882909,0.00045276847,0.0025721015,0.013546005],"genre_scores_gemma":[0.88575083,0.0009810545,0.1047462,0.00019323155,0.000105313564,0.0002180103,0.00082353473,0.00010569057,0.007076139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972314,0.000056579287,0.000015035604,0.00003668338,0.00010697961,0.00006149524],"domain_scores_gemma":[0.99963677,0.000059843955,0.00005359821,0.0000786052,0.00011089974,0.00006015999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041389826,0.00047454907,0.00066621613,0.0008741345,0.0007878461,0.0006127703,0.0015108623,0.0005268714,0.0011157288],"category_scores_gemma":[0.0010321229,0.00018441476,0.0002344602,0.0008997678,0.0004190337,0.0008297086,0.0017339685,0.00054917316,0.0002855242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010535074,0.00028794273,0.0024563826,0.0004280848,0.00014144937,0.0005451423,0.0005801661,0.34800664,0.055776376,0.10533191,0.021903891,0.46348855],"study_design_scores_gemma":[0.00009763777,0.0002431858,0.0007249408,0.00003738577,0.00004044278,0.00040632425,0.00015120053,0.9354037,0.014191608,0.010503027,0.03813927,0.00006123631],"about_ca_topic_score_codex":0.0057802578,"about_ca_topic_score_gemma":0.008877953,"teacher_disagreement_score":0.0057802578,"about_ca_system_score_codex":0.0008663482,"about_ca_system_score_gemma":0.0011094376,"threshold_uncertainty_score":0.011493206},"labels":[],"label_agreement":null},{"id":"W2512240773","doi":"10.1109/tmc.2016.2604260","title":"How to Download More Data from Neighbors? A Metric for D2D Data Offloading Opportunity","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Mobile device; Metric (unit); Object (grammar); Download; Mobile computing; Distributed computing; Operating system","score_opus":0.10744815447260204,"score_gpt":0.3154034379914188,"score_spread":0.20795528351881676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512240773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41104707,0.0048995735,0.5641713,0.0018866631,0.0002483118,0.00056621,0.0010215756,0.0009246704,0.01523452],"genre_scores_gemma":[0.94138795,0.00039926096,0.05697317,0.000056553632,0.00004226133,0.00013584428,0.00024378745,0.00004379392,0.0007174412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978363,0.0005786502,0.0003015455,0.00034950147,0.00074729446,0.00018683431],"domain_scores_gemma":[0.98959595,0.006380007,0.0011997193,0.00074380817,0.0010919985,0.0009884654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016237468,0.0008461052,0.00087057526,0.0019377051,0.00095526397,0.0017686842,0.0009341959,0.001036897,0.0014078438],"category_scores_gemma":[0.0135175735,0.000279473,0.00042162254,0.0021941294,0.0010163723,0.0038594236,0.0016007158,0.0006499202,0.00023301117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001880976,0.0006535404,0.065922044,0.00131354,0.00037291273,0.0008631992,0.0009116875,0.45372036,0.04925206,0.04998371,0.005785604,0.36934036],"study_design_scores_gemma":[0.00010083136,0.001446771,0.027702203,0.00008502098,0.00020666297,0.0021045418,0.0012652015,0.9102704,0.020774873,0.022832021,0.01304754,0.00016388255],"about_ca_topic_score_codex":0.0014573704,"about_ca_topic_score_gemma":0.002079742,"teacher_disagreement_score":0.0019377051,"about_ca_system_score_codex":0.0010419402,"about_ca_system_score_gemma":0.000703566,"threshold_uncertainty_score":0.008587301},"labels":[],"label_agreement":null},{"id":"W2518839699","doi":"10.22215/etd/2012-09705","title":"Distributed communication in disruption tolerant network","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Humanities; Philosophy","score_opus":0.018564263665325743,"score_gpt":0.2654027344287505,"score_spread":0.24683847076342477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518839699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067309014,0.0039908835,0.9002623,0.0026163294,0.00082683394,0.000197845,0.00022133617,0.0010525116,0.023522994],"genre_scores_gemma":[0.9055427,0.0021405409,0.06500864,0.00034121962,0.0002756072,0.0002513964,0.00027767534,0.000075613294,0.02608664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947053,0.00015381003,0.000025056126,0.0001504079,0.00012589253,0.00007426257],"domain_scores_gemma":[0.99945956,0.00023015149,0.000056836958,0.00007604523,0.0001165616,0.000060845927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054417516,0.0003025814,0.0004856974,0.00045566433,0.00078315026,0.0012019125,0.0007291092,0.0004783196,0.002429216],"category_scores_gemma":[0.0015282371,0.00016570017,0.00019596952,0.0007072328,0.00056216656,0.0009825694,0.0010899652,0.000659307,0.00050598924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072878954,0.00014856226,0.0025185966,0.00035407738,0.00008878312,0.00077256956,0.0007968359,0.52760327,0.015753811,0.21654114,0.029401943,0.20529161],"study_design_scores_gemma":[0.000054283017,0.00011575296,0.0005823273,0.000028972594,0.000026565,0.00022430354,0.00018999667,0.9024753,0.0025420499,0.060202375,0.033536118,0.000021910619],"about_ca_topic_score_codex":0.002519324,"about_ca_topic_score_gemma":0.0019327244,"teacher_disagreement_score":0.002519324,"about_ca_system_score_codex":0.0010709357,"about_ca_system_score_gemma":0.0007310932,"threshold_uncertainty_score":0.008126557},"labels":[],"label_agreement":null},{"id":"W2527374865","doi":"","title":"PReFilter: A Privacy-preserving Relay Filtering Scheme for Delay Tolerant Networks","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Relay; Computer science; Scheme (mathematics); Computer network; Information privacy; Computer security; Mathematics","score_opus":0.026001459496330016,"score_gpt":0.23836201883226385,"score_spread":0.21236055933593384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527374865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01935902,0.0004483052,0.9750397,0.00041362346,0.00013054689,0.00017515146,0.0005116536,0.0020086376,0.0019133856],"genre_scores_gemma":[0.63353723,0.0006805218,0.34910798,0.0006999064,0.00027367484,0.00026010865,0.0011584405,0.00020378268,0.014078364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979132,0.00044568162,0.0001290376,0.00050536235,0.00067461765,0.00033202535],"domain_scores_gemma":[0.9962883,0.001113852,0.00025127808,0.0018397386,0.00036014835,0.00014675439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028518466,0.0008986468,0.0018749653,0.00089865277,0.0011876815,0.001856534,0.0024741774,0.0020329722,0.0041513816],"category_scores_gemma":[0.0046106223,0.0004384721,0.00077767053,0.001259504,0.0011080026,0.003956704,0.0032098591,0.0022101903,0.001065231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003705801,0.0004779021,0.0008858284,0.00055846525,0.00020384655,0.0005653835,0.00067416276,0.11433039,0.088509575,0.19369684,0.023063578,0.57332814],"study_design_scores_gemma":[0.00034063647,0.000981625,0.0005786106,0.00006918134,0.0001135161,0.00090259296,0.00012985276,0.75305563,0.061224006,0.16084439,0.021570686,0.00018938421],"about_ca_topic_score_codex":0.001179507,"about_ca_topic_score_gemma":0.0014141721,"teacher_disagreement_score":0.0041513816,"about_ca_system_score_codex":0.0012050718,"about_ca_system_score_gemma":0.0015766616,"threshold_uncertainty_score":0.0150821805},"labels":[],"label_agreement":null},{"id":"W2531097752","doi":"10.1145/2983576.2983581","title":"Prizm","year":2016,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software deployment; Point (geometry); Wireless; Lifelog; Raspberry pi; World Wide Web; Computer network; Operating system; Internet of Things","score_opus":0.012732164947704808,"score_gpt":0.2019240847643472,"score_spread":0.1891919198166424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531097752","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06595548,0.004004781,0.54651064,0.0020916022,0.0010013562,0.0012570762,0.005423853,0.12893537,0.2448198],"genre_scores_gemma":[0.31739014,0.0035682525,0.4032905,0.00317046,0.00040706154,0.001188085,0.013295894,0.004246289,0.2534433],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957067,0.000054309592,0.000027985952,0.00012432833,0.00016076153,0.00006188695],"domain_scores_gemma":[0.99940217,0.00009824131,0.00004220449,0.00023421094,0.0001388607,0.00008427397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043857645,0.00066076353,0.0003672577,0.00064363895,0.0005709678,0.0019162537,0.0016953424,0.0009319151,0.024251474],"category_scores_gemma":[0.0014243929,0.00042933633,0.00030378267,0.0004330024,0.00036218326,0.0027288857,0.0020950383,0.0009398015,0.014948496],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009524376,0.00039907222,0.0049956944,0.0010541638,0.00006447173,0.00083647534,0.001505444,0.0034909907,0.063196845,0.042143777,0.18598445,0.6953761],"study_design_scores_gemma":[0.00005228867,0.0003482494,0.0019945027,0.0000956388,0.000040752486,0.0012985199,0.00017831949,0.014996535,0.02501572,0.0064279158,0.9494832,0.000068418056],"about_ca_topic_score_codex":0.00084404706,"about_ca_topic_score_gemma":0.0012175327,"teacher_disagreement_score":0.024251474,"about_ca_system_score_codex":0.00032872809,"about_ca_system_score_gemma":0.00058596226,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2532634282","doi":"10.1109/globalsip.2013.6736883","title":"Contact graph based routing in opportunistic networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Resource consumption; Graph; Bandwidth (computing); Routing (electronic design automation); Distributed computing; Theoretical computer science","score_opus":0.018993647207459063,"score_gpt":0.21829534882815432,"score_spread":0.19930170162069527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532634282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07419752,0.00074511266,0.917102,0.0007280437,0.00010057515,0.00030241784,0.00041130412,0.0011598567,0.0052532274],"genre_scores_gemma":[0.8354725,0.00061684794,0.16046743,0.00017129869,0.00006574994,0.00024901668,0.00046663388,0.00009447931,0.0023961205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879754,0.0005474767,0.00005724075,0.00019045545,0.0002991551,0.000108017266],"domain_scores_gemma":[0.9942532,0.003926958,0.0005472722,0.0007207038,0.0003730709,0.00017871022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001908374,0.0005655168,0.0007940438,0.0015023949,0.0013755589,0.0013739504,0.0016950794,0.0011563606,0.001066824],"category_scores_gemma":[0.0076289386,0.00035690615,0.00044618818,0.0017041554,0.0011787085,0.0024612783,0.0014962507,0.00066757173,0.0002200973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010888961,0.00008784131,0.0020746135,0.00013507223,0.000059409995,0.0002309374,0.00019689082,0.89044076,0.0017300213,0.047998957,0.0032298593,0.053706743],"study_design_scores_gemma":[0.000014611635,0.000031271262,0.00036662232,0.000008721378,0.000010946917,0.0000961126,0.000057593552,0.9512822,0.0007039954,0.04470818,0.0027062404,0.000013456428],"about_ca_topic_score_codex":0.00771209,"about_ca_topic_score_gemma":0.00886113,"teacher_disagreement_score":0.00771209,"about_ca_system_score_codex":0.0016483777,"about_ca_system_score_gemma":0.001156702,"threshold_uncertainty_score":0.015334427},"labels":[],"label_agreement":null},{"id":"W2536851316","doi":"10.1007/s12083-016-0519-3","title":"Energy-efficient content distribution via mobile users cooperations in cellular networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cellular network; Content distribution; Computer network","score_opus":0.020146689667411097,"score_gpt":0.23368420626595274,"score_spread":0.21353751659854164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536851316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43379906,0.0009516512,0.55825716,0.00029314333,0.000061489496,0.000049783182,0.000046442292,0.0002480701,0.006293145],"genre_scores_gemma":[0.9926715,0.00011166897,0.0062888605,0.000013636668,0.000013984851,0.000011134564,0.000009693705,0.000007479621,0.0008720953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996792,0.00011078574,0.000011015292,0.000041314426,0.00009625314,0.00006144652],"domain_scores_gemma":[0.9990176,0.000609336,0.00007705788,0.000069368936,0.00018155543,0.000045108845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046132147,0.00026496718,0.0004633525,0.000440198,0.00055239734,0.0006071511,0.00059126865,0.00049590075,0.00061376375],"category_scores_gemma":[0.0017924366,0.00020413229,0.00016980665,0.0007054244,0.00047951748,0.00054334797,0.0006199081,0.00023287216,0.00015103156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007194456,0.0001645544,0.0026752248,0.00012657559,0.00008399552,0.00046655347,0.00040376218,0.7662891,0.06726525,0.0496024,0.0015820448,0.110621125],"study_design_scores_gemma":[0.000012170796,0.000053031996,0.0003263742,0.000003067578,0.000017783172,0.00007154954,0.000053920223,0.98534364,0.0044266516,0.009078041,0.00060607085,0.000007741913],"about_ca_topic_score_codex":0.0010807419,"about_ca_topic_score_gemma":0.0013248206,"teacher_disagreement_score":0.0010807419,"about_ca_system_score_codex":0.00042946075,"about_ca_system_score_gemma":0.000339202,"threshold_uncertainty_score":0.0031160116},"labels":[],"label_agreement":null},{"id":"W2539389090","doi":"10.1109/hpcc.2011.169","title":"HPCC 2011/FTDCS 2011 Keynotes","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.05517219382811196,"score_gpt":0.21640101894258165,"score_spread":0.16122882511446968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539389090","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033380564,0.0045409515,0.004802526,0.11515963,0.3436224,0.00060206355,0.009034696,0.0017685273,0.51713115],"genre_scores_gemma":[0.012237361,0.002095689,0.0011160775,0.011006653,0.026864238,0.00022493424,0.004166718,0.0007561689,0.94153214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860865,0.00009338943,0.000041788175,0.00015491697,0.0007005303,0.0004007571],"domain_scores_gemma":[0.99700266,0.00031218745,0.000120609235,0.00025737943,0.0013162736,0.000990787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027402253,0.0013101103,0.0006484437,0.0013729844,0.004893921,0.009309067,0.001397627,0.0053842408,0.21068917],"category_scores_gemma":[0.004742854,0.0004414881,0.0009041508,0.0015613947,0.00073745253,0.0037405612,0.0027133345,0.0068686623,0.110069476],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006180117,0.000021114482,0.000029379597,0.00003370341,0.0000019251916,0.000048477264,0.000013673301,0.00008390351,0.0002217645,0.0028875782,0.991574,0.005022598],"study_design_scores_gemma":[0.000018843604,0.000027115802,0.00025932468,0.000040696206,0.000004663621,0.00002391314,0.00008650609,0.00019052796,0.00052639126,0.0011856699,0.9976229,0.000013374215],"about_ca_topic_score_codex":0.013390619,"about_ca_topic_score_gemma":0.023922553,"teacher_disagreement_score":0.21068917,"about_ca_system_score_codex":0.0047447043,"about_ca_system_score_gemma":0.0039300164,"threshold_uncertainty_score":0.7048255},"labels":[],"label_agreement":null},{"id":"W2540934986","doi":"10.1016/j.procs.2016.09.356","title":"Epidemiology-based Task Assignment Algorithm for Distributed Systems","year":2016,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Context (archaeology); Population; Task analysis; Assignment problem; Distributed computing; Machine learning; Artificial intelligence; Medicine; Mathematical optimization","score_opus":0.035793028223503574,"score_gpt":0.27088973294342217,"score_spread":0.2350967047199186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540934986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013498429,0.00019444531,0.98341364,0.0003904302,0.00006247261,0.00013407893,0.000042893047,0.0002725256,0.0019910478],"genre_scores_gemma":[0.45244512,0.00033469492,0.5392297,0.00030317265,0.00010353913,0.0008990306,0.00028645233,0.00014451865,0.0062538544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908125,0.00031717317,0.000070771304,0.00020435924,0.0001849806,0.00014149665],"domain_scores_gemma":[0.9964006,0.0021285845,0.0004047285,0.00019813445,0.0006280474,0.00023995314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001809222,0.0010024799,0.0012327202,0.0008925012,0.0009969325,0.0012804491,0.0019850223,0.0014419237,0.0038642224],"category_scores_gemma":[0.008182324,0.00043472828,0.00061322545,0.00080217223,0.00078723,0.0016133639,0.0020929507,0.0014580674,0.00067554886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012233535,0.00011843767,0.00092432724,0.00009356583,0.0000324328,0.000049726143,0.00011194253,0.93301386,0.0013960447,0.013407277,0.0019858633,0.0487442],"study_design_scores_gemma":[0.000032156335,0.000026703343,0.000060938073,0.0000072690254,0.0000049681666,0.000017722932,0.000017651382,0.99271387,0.00022690548,0.006091002,0.00079700287,0.0000038156318],"about_ca_topic_score_codex":0.0029092003,"about_ca_topic_score_gemma":0.002476126,"teacher_disagreement_score":0.0038642224,"about_ca_system_score_codex":0.0015336454,"about_ca_system_score_gemma":0.0021507118,"threshold_uncertainty_score":0.012927115},"labels":[],"label_agreement":null},{"id":"W2547319434","doi":"10.13189/csit.2016.040501","title":"Response Time Analysis of Mobile Application DNUN in New Relic Monitoring Platform","year":2016,"lang":"en","type":"article","venue":"Computer Science and Information Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Real-time computing; Embedded system","score_opus":0.007885694433269308,"score_gpt":0.2297758517844748,"score_spread":0.22189015735120549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547319434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878043,0.00027709175,0.008601394,0.00007308925,0.000032525895,0.00008328542,0.00020876164,0.0012081384,0.0017114732],"genre_scores_gemma":[0.9960663,0.00005340427,0.0029381753,0.000021979738,0.000007887143,0.000033528304,0.00018381327,0.00006741578,0.0006275188],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9973476,0.0004970224,0.00012720756,0.00054245605,0.0011400492,0.00034556814],"domain_scores_gemma":[0.99293023,0.0030414374,0.0008145804,0.00079529115,0.0020210089,0.00039742055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001652159,0.00069214875,0.0005173728,0.0013400652,0.0003516261,0.0006655735,0.00066842453,0.00040311518,0.0009735827],"category_scores_gemma":[0.007222667,0.00021643343,0.00023863657,0.00075781415,0.00035982445,0.0006484326,0.00044438802,0.0007737944,0.00033392376],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010365437,0.0018761819,0.16492991,0.0015528126,0.0003977282,0.0031976057,0.003058883,0.18865831,0.36959794,0.0029370792,0.0068150805,0.24661294],"study_design_scores_gemma":[0.000071173265,0.002717427,0.10347675,0.000042261563,0.00014575478,0.0009341227,0.0006999252,0.7927348,0.094628856,0.0006490837,0.0037997938,0.00010003887],"about_ca_topic_score_codex":0.003520669,"about_ca_topic_score_gemma":0.0019782637,"teacher_disagreement_score":0.003520669,"about_ca_system_score_codex":0.00085645134,"about_ca_system_score_gemma":0.00044891922,"threshold_uncertainty_score":0.008737624},"labels":[],"label_agreement":null},{"id":"W2548982118","doi":"","title":"The Case for an Adaptive Integration Framework for Data Aggregation/Dissemination in Service-Oriented Architectures","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Provisioning; Distributed computing; Quality of service; Computer network; Resource (disambiguation); Service (business); Wireless ad hoc network; Resource management (computing); Wireless; Telecommunications","score_opus":0.05566303460624462,"score_gpt":0.33730156934122424,"score_spread":0.28163853473497963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548982118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052018915,0.001549845,0.9470378,0.01811946,0.000467089,0.00018199196,0.000030843014,0.0010091856,0.026401846],"genre_scores_gemma":[0.21124476,0.0014179137,0.7674902,0.0028939673,0.0008195957,0.0007262331,0.00013716126,0.00032902806,0.014941166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959009,0.0014488384,0.00024317927,0.000515474,0.0014198495,0.00047174454],"domain_scores_gemma":[0.99506676,0.0015280454,0.00028052385,0.0015015037,0.0009447053,0.00067846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011041403,0.00075946323,0.0007229053,0.0009354282,0.0020355212,0.0077577024,0.0035643748,0.0055486015,0.0045331954],"category_scores_gemma":[0.011520806,0.0008014365,0.0011883576,0.0010475448,0.0061693164,0.015073867,0.0042944895,0.0065007946,0.0015560256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003212427,0.00005129866,0.00035371745,0.00005991441,0.000018057583,0.00019265445,0.00045130102,0.005852407,0.0009806127,0.96100014,0.0042601475,0.026747499],"study_design_scores_gemma":[0.000082831175,0.00011834551,0.00029259527,0.00020311038,0.000040286584,0.00042896564,0.00041529597,0.097119264,0.0010971606,0.7377016,0.16244334,0.000057109788],"about_ca_topic_score_codex":0.004176209,"about_ca_topic_score_gemma":0.003215521,"teacher_disagreement_score":0.011041403,"about_ca_system_score_codex":0.002615737,"about_ca_system_score_gemma":0.0037454597,"threshold_uncertainty_score":0.05839324},"labels":[],"label_agreement":null},{"id":"W2555731728","doi":"10.1007/978-3-319-49580-4","title":"Testbeds and Research Infrastructures for the Development of Networks and Communities","year":2016,"lang":"en","type":"book","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Development (topology); Data science","score_opus":0.051072875788124306,"score_gpt":0.28740392462737085,"score_spread":0.23633104883924655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555731728","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022375392,0.017965395,0.75050324,0.009507619,0.0043910136,0.0018119806,0.0033935523,0.007710184,0.1823416],"genre_scores_gemma":[0.17012662,0.018145572,0.74792737,0.0007797305,0.00082912156,0.001806461,0.0077433763,0.0010937321,0.051548053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983065,0.0006527735,0.00008350362,0.00025830042,0.0005128068,0.00018603545],"domain_scores_gemma":[0.99674004,0.0009614595,0.00015191034,0.0011614985,0.00034661114,0.0006385559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043148454,0.00073803315,0.0006780283,0.0016719565,0.001240139,0.0027404388,0.0023419366,0.0013239527,0.012564889],"category_scores_gemma":[0.0044777975,0.0006057702,0.0006104739,0.0027304953,0.0015629877,0.006536753,0.003928572,0.001490221,0.0030461345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017633132,0.0002561541,0.00059895753,0.0008593579,0.00005535789,0.00027685153,0.0004004777,0.014523691,0.011022312,0.66409785,0.10209283,0.20563972],"study_design_scores_gemma":[0.00012998671,0.0003065037,0.00084717944,0.0003794266,0.00003908783,0.00044341618,0.00039265843,0.025160285,0.007790591,0.2635001,0.7009651,0.000045703753],"about_ca_topic_score_codex":0.000890631,"about_ca_topic_score_gemma":0.0014947299,"teacher_disagreement_score":0.012564889,"about_ca_system_score_codex":0.0014218532,"about_ca_system_score_gemma":0.0020710148,"threshold_uncertainty_score":0.04203379},"labels":[],"label_agreement":null},{"id":"W2555769812","doi":"10.1002/dac.3232","title":"An altruism‐based trust‐dependent message forwarding protocol for opportunistic networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Node (physics); Routing protocol; Overhead (engineering); Routing (electronic design automation); Altruism (biology); Protocol (science); Computer security; Distributed computing","score_opus":0.05598276550066567,"score_gpt":0.3529024678468463,"score_spread":0.29691970234618065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555769812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10059299,0.00019429334,0.8921022,0.0003849221,0.00010079748,0.00022431547,0.00010390197,0.00050866156,0.0057879235],"genre_scores_gemma":[0.9190159,0.000094060495,0.07722404,0.00007348599,0.000020065117,0.00016797129,0.000109634035,0.000024476054,0.0032703658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919957,0.00026571876,0.000067392786,0.00008955236,0.00027815052,0.00009968428],"domain_scores_gemma":[0.9979887,0.0008632041,0.00034321746,0.00026589178,0.00036468715,0.00017432221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013597291,0.00033004477,0.000394532,0.00045850847,0.00080816983,0.0006043242,0.0011556438,0.00046336267,0.0006838249],"category_scores_gemma":[0.003763842,0.000171435,0.00033661776,0.0003508583,0.000530534,0.00078754773,0.0016650312,0.00054395763,0.00014175792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013478773,0.00042596163,0.007208609,0.00046533844,0.00025689913,0.0016153293,0.0027184838,0.40794984,0.06789957,0.22155344,0.01049123,0.2780674],"study_design_scores_gemma":[0.00005714467,0.00018694908,0.0005743645,0.000022400722,0.00005986117,0.00033556842,0.0001527182,0.9528642,0.008663595,0.028051682,0.008983399,0.000048003894],"about_ca_topic_score_codex":0.0020037605,"about_ca_topic_score_gemma":0.0022004836,"teacher_disagreement_score":0.0020037605,"about_ca_system_score_codex":0.0007993212,"about_ca_system_score_gemma":0.0011953771,"threshold_uncertainty_score":0.0071910024},"labels":[],"label_agreement":null},{"id":"W2560925213","doi":"","title":"Moving Networks for 5G Communication Systems","year":2015,"lang":"en","type":"article","venue":"電腦與通訊","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Bridging (networking); Orchestration; Key (lock); Cellular network; Telecommunications; Computer network; Node (physics); Distributed computing; Engineering; Computer security","score_opus":0.06030355866406539,"score_gpt":0.26762192981239263,"score_spread":0.20731837114832724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560925213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005636475,0.18086639,0.64609885,0.01957189,0.007252654,0.0002495819,0.00041602558,0.00068536913,0.13922282],"genre_scores_gemma":[0.29960072,0.27559498,0.33215117,0.00547279,0.00964657,0.00068490853,0.0008188879,0.00022817081,0.07580183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995334,0.00014456957,0.000024818639,0.000075239775,0.0001774736,0.000044568482],"domain_scores_gemma":[0.9997025,0.0001246557,0.000041191342,0.000044908204,0.000067148525,0.000019576963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050016085,0.00080286316,0.00046521882,0.00056007784,0.00076833065,0.0015191018,0.0008724585,0.0018404874,0.0075194156],"category_scores_gemma":[0.0012680533,0.00024952213,0.00031018318,0.0009608453,0.0008772079,0.0025391248,0.001145606,0.0022410098,0.0023257479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016985641,0.0000098066,0.00012202633,0.00037071668,0.000011823323,0.00018634176,0.0000949956,0.009880495,0.0017868519,0.8977003,0.018707322,0.07111235],"study_design_scores_gemma":[0.000008460348,0.00006708813,0.00026029217,0.0003142437,0.000018807032,0.0005906697,0.00011487428,0.031419117,0.0010185133,0.40958482,0.55657125,0.000031936026],"about_ca_topic_score_codex":0.001397241,"about_ca_topic_score_gemma":0.0016105812,"teacher_disagreement_score":0.0075194156,"about_ca_system_score_codex":0.0012128281,"about_ca_system_score_gemma":0.0006204347,"threshold_uncertainty_score":0.025155008},"labels":[],"label_agreement":null},{"id":"W2561984156","doi":"10.1109/cisis.2016.143","title":"A Centrality-Based History Prediction Routing Protocol for Opportunistic Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Centrality; Computer network; Routing protocol; Wireless Routing Protocol; Zone Routing Protocol; Routing (electronic design automation); Task (project management); Distributed computing; Overhead (engineering); Protocol (science); Dynamic Source Routing; Enhanced Interior Gateway Routing Protocol; Engineering; Mathematics","score_opus":0.07238688208014794,"score_gpt":0.2771664240806042,"score_spread":0.20477954200045628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561984156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051214483,0.00086492795,0.94034237,0.00068313855,0.00022939147,0.000340211,0.00018848402,0.001044719,0.005092251],"genre_scores_gemma":[0.8197784,0.0007922882,0.17244658,0.00026007762,0.00009196915,0.00033476803,0.00045612844,0.00006007443,0.0057798037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972934,0.00006388864,0.000019097823,0.000045958182,0.000113086186,0.000028688071],"domain_scores_gemma":[0.9992906,0.00030527002,0.00010683721,0.000097368174,0.00014121878,0.000058722286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056614354,0.0003036301,0.00036689808,0.0006315055,0.00067010394,0.00046614127,0.0011270795,0.00044654924,0.00066248176],"category_scores_gemma":[0.002223645,0.000139952,0.00022867885,0.0006395135,0.00037408402,0.00095834193,0.0011420518,0.0006000781,0.00013167986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053848664,0.00028128884,0.0039703795,0.00041308353,0.00016487805,0.0010529878,0.0011631522,0.21840326,0.06930402,0.14711067,0.014241073,0.5433567],"study_design_scores_gemma":[0.000080988655,0.00038992587,0.00092972565,0.00003255361,0.00007750879,0.0007507343,0.00017099804,0.93065494,0.014216189,0.029378515,0.023242824,0.00007516674],"about_ca_topic_score_codex":0.0028766487,"about_ca_topic_score_gemma":0.0046923845,"teacher_disagreement_score":0.0028766487,"about_ca_system_score_codex":0.000601168,"about_ca_system_score_gemma":0.000905928,"threshold_uncertainty_score":0.005719781},"labels":[],"label_agreement":null},{"id":"W2563333291","doi":"10.1002/wcm.2761","title":"Caching algorithms for broadcasting and multicasting in disruption tolerant networks","year":2016,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Broadcasting (networking); Multicast; Computer network; Data access; Distributed computing; TRACE (psycholinguistics); Unicast; Information-centric networking; Algorithm; Database","score_opus":0.03888650886099922,"score_gpt":0.30082579341358723,"score_spread":0.261939284552588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563333291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14906698,0.0016033686,0.84497285,0.00041702457,0.0000664223,0.00018347586,0.00008335228,0.00060561276,0.0030008939],"genre_scores_gemma":[0.8698512,0.0004286946,0.12815043,0.00007262708,0.000032423894,0.000117189855,0.00008455637,0.000042687847,0.0012202284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991326,0.00035813625,0.00006718651,0.00010259797,0.00020525866,0.00013426242],"domain_scores_gemma":[0.9953715,0.0029602267,0.00054433505,0.0003465048,0.00061286654,0.0001646382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022113337,0.00054830464,0.0010864302,0.0013227402,0.0013240014,0.001293899,0.0021502974,0.0012646387,0.0009235475],"category_scores_gemma":[0.008594427,0.00034885842,0.0004641223,0.0014788031,0.00094919855,0.0017224647,0.001012194,0.0006571377,0.00017345248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027865323,0.00011532086,0.0018458115,0.000117593794,0.0000689343,0.00011567973,0.00032687627,0.8772883,0.004628648,0.05102792,0.0015182969,0.06266789],"study_design_scores_gemma":[0.000023318717,0.000045283214,0.0001234438,0.0000061425476,0.000013249113,0.000038775805,0.00003181654,0.9880923,0.0007888527,0.010346104,0.0004834101,0.0000073106617],"about_ca_topic_score_codex":0.008325477,"about_ca_topic_score_gemma":0.0059326184,"teacher_disagreement_score":0.008325477,"about_ca_system_score_codex":0.0023841588,"about_ca_system_score_gemma":0.0010639193,"threshold_uncertainty_score":0.01729834},"labels":[],"label_agreement":null},{"id":"W2567675696","doi":"10.1007/978-3-319-47063-4_9","title":"A Centrality-Based ACK Forwarding Mechanism for Efficient Routing in Infrastructureless Opportunistic Networks","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Acknowledgement; Routing protocol; Centrality; The Internet; Routing (electronic design automation); Internet privacy; World Wide Web","score_opus":0.024876421354314723,"score_gpt":0.2377114687409758,"score_spread":0.21283504738666106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567675696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022461297,0.0007506116,0.96877104,0.00034256506,0.00043798634,0.00016929583,0.00010028246,0.0011600653,0.0058068987],"genre_scores_gemma":[0.6916704,0.0009176317,0.29471904,0.0002102072,0.00036404084,0.00023442793,0.00026643707,0.00023185812,0.011385927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994529,0.0001147942,0.00003969002,0.0000888003,0.00022549363,0.000078295314],"domain_scores_gemma":[0.99818015,0.00082691165,0.00013498652,0.0003378922,0.0004100695,0.000110071545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012963859,0.0004922281,0.0006471663,0.0011320389,0.0010225353,0.0014913633,0.0026129521,0.00082279625,0.0030271672],"category_scores_gemma":[0.004596232,0.00027326224,0.0003742738,0.0010726878,0.00066397287,0.0017507726,0.0014777917,0.0010502551,0.0006657179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007569773,0.0004372246,0.00095860055,0.0004269892,0.00011303205,0.00030278703,0.0004668439,0.16393988,0.058933076,0.30565777,0.01888537,0.44912156],"study_design_scores_gemma":[0.00009252636,0.00021734563,0.00029815963,0.00003619281,0.0000940784,0.00031007864,0.00006765255,0.9188516,0.010957541,0.054980986,0.014031692,0.00006213798],"about_ca_topic_score_codex":0.0017727552,"about_ca_topic_score_gemma":0.0032144515,"teacher_disagreement_score":0.0030271672,"about_ca_system_score_codex":0.0009805458,"about_ca_system_score_gemma":0.0010568706,"threshold_uncertainty_score":0.010126889},"labels":[],"label_agreement":null},{"id":"W2578457835","doi":"","title":"Extended wifi network design model for ubiquitous emergency events","year":2016,"lang":"en","type":"article","venue":"Constellation (Université du Québec à Chicoutimi)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Event (particle physics); Computer science; Natural disaster; Computer security; Architecture; Focus (optics); The Internet; Telecommunications network; Network architecture; Emergency management; Work (physics); Computer network; Information exchange; Telecommunications; World Wide Web; Engineering; Geography","score_opus":0.026345262227952804,"score_gpt":0.20984325472841825,"score_spread":0.18349799250046545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578457835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027208844,0.0004900741,0.9241705,0.00062457845,0.00016083744,0.00025102345,0.00043826722,0.00035976214,0.046296034],"genre_scores_gemma":[0.6892994,0.0015446022,0.24742807,0.00025472828,0.000115002746,0.0010641367,0.0007282503,0.00014817656,0.059417635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994393,0.0001614234,0.000029949137,0.000088926885,0.00018044183,0.00009989197],"domain_scores_gemma":[0.9995864,0.000102337064,0.000049085476,0.000048552585,0.00017911982,0.000034507204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055557577,0.00079992577,0.00022915249,0.0005535268,0.0006350899,0.0014612769,0.0015440139,0.0010200994,0.005091162],"category_scores_gemma":[0.0012146166,0.0002851064,0.00057630264,0.0005364538,0.0004387617,0.0015727931,0.00081472326,0.00075919443,0.0009010908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000838488,0.000065977576,0.001143232,0.00015020686,0.000028875766,0.00048333535,0.00032916944,0.73970497,0.005292642,0.2035973,0.004986788,0.04413367],"study_design_scores_gemma":[0.000016739077,0.000068877605,0.00027633563,0.00003154806,0.000030035122,0.00018305823,0.00013039945,0.9472001,0.00087616424,0.024028324,0.027141066,0.000017289878],"about_ca_topic_score_codex":0.015725216,"about_ca_topic_score_gemma":0.021122389,"teacher_disagreement_score":0.015725216,"about_ca_system_score_codex":0.0017312536,"about_ca_system_score_gemma":0.0014633734,"threshold_uncertainty_score":0.031267405},"labels":[],"label_agreement":null},{"id":"W2585002304","doi":"10.1109/glocom.2016.7841992","title":"Mobile Data Offloading in Heterogeneous Networks for Passengers on a Subway Train","year":2016,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Node (physics); Context (archaeology); Selection (genetic algorithm); Computer network; Mobile device; Mobile computing; Mobile broadband; Distributed computing; World Wide Web; Wireless; Engineering; Telecommunications; Artificial intelligence","score_opus":0.05588764714186149,"score_gpt":0.28213881404433494,"score_spread":0.22625116690247343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585002304","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9006202,0.0001734779,0.09639425,0.00018497014,0.00003398047,0.000040318188,0.000049487095,0.00015219917,0.0023510193],"genre_scores_gemma":[0.9981281,0.000036464608,0.0014814534,0.000009461749,0.0000036156948,0.0000045146003,0.000013122315,0.000004029155,0.00031922522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978715,0.000053885415,0.0000050122144,0.000037740287,0.00002514851,0.00009109972],"domain_scores_gemma":[0.99963737,0.00016158387,0.000048186623,0.000034766057,0.000048629623,0.00006947846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035520777,0.0004483498,0.00032724187,0.00037840984,0.00072775286,0.0005986163,0.00046382268,0.0002948379,0.00048752426],"category_scores_gemma":[0.0008275026,0.00015786289,0.00029625522,0.00047407573,0.00039791406,0.0007493372,0.0005743806,0.00027650935,0.00008294473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003960987,0.00011359256,0.008177223,0.000040476996,0.000045016557,0.00077882403,0.00021873374,0.9320278,0.015210929,0.004512253,0.00078023877,0.037698835],"study_design_scores_gemma":[0.000005045704,0.000060057348,0.0011897334,0.000001529028,0.000013462859,0.000043591222,0.00014759848,0.99623483,0.001231482,0.000831915,0.00023542662,0.0000054105453],"about_ca_topic_score_codex":0.016979085,"about_ca_topic_score_gemma":0.02633635,"teacher_disagreement_score":0.016979085,"about_ca_system_score_codex":0.0011303384,"about_ca_system_score_gemma":0.00037778032,"threshold_uncertainty_score":0.033760548},"labels":[],"label_agreement":null},{"id":"W2601577395","doi":"10.1007/s11276-017-1494-1","title":"Community-aware single-copy content forwarding in Mobile Social Network","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Relay; Computer network; Latency (audio); Node (physics); Overhead (engineering); Markov chain; Distributed computing; Machine learning; Telecommunications","score_opus":0.08015620380598135,"score_gpt":0.2787713535608037,"score_spread":0.19861514975482233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601577395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17898473,0.0012102489,0.81376666,0.00080132973,0.00019908865,0.00027683776,0.00026976774,0.00058520347,0.0039061313],"genre_scores_gemma":[0.94178534,0.0004505982,0.05389543,0.00009459312,0.00013274765,0.00009911761,0.00015912954,0.000057667763,0.0033253967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988404,0.00029673477,0.00004506133,0.00027801874,0.00034282537,0.00019710588],"domain_scores_gemma":[0.992706,0.0050959447,0.00060380367,0.00048102302,0.0007041356,0.00040912794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021108615,0.0008634676,0.0021209961,0.0022759498,0.002064968,0.0016806977,0.004019873,0.0020264555,0.0013251303],"category_scores_gemma":[0.009501649,0.0007659551,0.0008215444,0.0023992963,0.0013021004,0.0030980455,0.0022766483,0.00089859194,0.00024959876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046811844,0.0003957415,0.003195693,0.00030492642,0.00015402924,0.00048263118,0.0005446318,0.8388878,0.008321364,0.06392296,0.0050369105,0.07828522],"study_design_scores_gemma":[0.00001283533,0.00002873299,0.00011380787,0.000004471005,0.000016340085,0.000054182117,0.000033594413,0.9901635,0.00040577105,0.008802102,0.00035596537,0.000008732374],"about_ca_topic_score_codex":0.008036969,"about_ca_topic_score_gemma":0.0093488125,"teacher_disagreement_score":0.008036969,"about_ca_system_score_codex":0.0017804549,"about_ca_system_score_gemma":0.0017798423,"threshold_uncertainty_score":0.015980363},"labels":[],"label_agreement":null},{"id":"W2602717178","doi":"10.1109/vtcfall.2016.7881227","title":"Social-Aware Data Dissemination via Opportunistic Device-to-Device Communications","year":2016,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Exploit; Closeness; Partition (number theory); Dissemination; Distributed computing; Selection (genetic algorithm); Computer network; Incentive; Betweenness centrality; Computer security; Telecommunications; Machine learning","score_opus":0.13667592469765188,"score_gpt":0.3702126672213238,"score_spread":0.2335367425236719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602717178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048075743,0.000390697,0.94584954,0.0004954913,0.00004930588,0.00020899426,0.00006222625,0.00027514118,0.0045928867],"genre_scores_gemma":[0.93387365,0.000309353,0.06377809,0.0001223366,0.000048126913,0.00015950725,0.000044847624,0.000014401578,0.0016495924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904984,0.00044501256,0.00004132127,0.00013290277,0.00025103294,0.000079885715],"domain_scores_gemma":[0.99668556,0.0021426328,0.00035301107,0.00042995423,0.00026726385,0.000121596284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014336687,0.00047739857,0.00053098204,0.0008309397,0.00092490186,0.0008638926,0.0011412575,0.0007971799,0.00060959655],"category_scores_gemma":[0.004667614,0.00025867144,0.00039675747,0.0007353619,0.00072345324,0.0015592864,0.0016830099,0.0005259632,0.000120265526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005968355,0.00036300416,0.0052430243,0.0006955109,0.00022065284,0.0012890872,0.001499014,0.3806765,0.07394922,0.25750756,0.00568846,0.27227116],"study_design_scores_gemma":[0.00009292316,0.00021868716,0.00086799014,0.000025801615,0.00006708789,0.00055747037,0.00022331747,0.9112571,0.010369112,0.064778045,0.011489163,0.00005343064],"about_ca_topic_score_codex":0.0008011688,"about_ca_topic_score_gemma":0.0011642422,"teacher_disagreement_score":0.0014336687,"about_ca_system_score_codex":0.00047217385,"about_ca_system_score_gemma":0.0007107909,"threshold_uncertainty_score":0.0075820684},"labels":[],"label_agreement":null},{"id":"W2606243197","doi":"10.1109/access.2017.2693689","title":"Survey on Social-Aware Data Dissemination Over Mobile Wireless Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dissemination; Computer science; Data science; Information Dissemination; Popularity; Leverage (statistics); Exploit; World Wide Web; Computer security; Internet privacy; Telecommunications; Artificial intelligence","score_opus":0.12726653406351188,"score_gpt":0.3962448573436882,"score_spread":0.26897832328017635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606243197","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007543322,0.87224096,0.07743011,0.003782754,0.0010090211,0.00017558706,0.00030489752,0.00021552558,0.037297845],"genre_scores_gemma":[0.054355804,0.9233434,0.015678657,0.0007823816,0.0015490063,0.00013871271,0.00034491086,0.000040083673,0.0037670536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989329,0.00034277362,0.00011132618,0.00015235972,0.00036035525,0.000100228885],"domain_scores_gemma":[0.9949941,0.00391091,0.0002250673,0.00018758076,0.00059002195,0.000092335635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015978874,0.0009437087,0.0011296307,0.0031545565,0.0006195968,0.0017424886,0.0011823841,0.0012623492,0.0036741702],"category_scores_gemma":[0.0054229246,0.00052159256,0.00060009153,0.007336385,0.0006030285,0.0045148088,0.0009884476,0.001068714,0.0009768324],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009728413,0.00015220344,0.0020537837,0.012962426,0.00014237844,0.00020127812,0.00036994083,0.012621498,0.0021900968,0.08699439,0.025436344,0.85677844],"study_design_scores_gemma":[0.000024763138,0.00038310597,0.0034410178,0.0058350684,0.00026453516,0.0014088281,0.0007161534,0.03095744,0.002258745,0.049519397,0.90508837,0.00010251446],"about_ca_topic_score_codex":0.0014349383,"about_ca_topic_score_gemma":0.0011621541,"teacher_disagreement_score":0.0036741702,"about_ca_system_score_codex":0.0010086528,"about_ca_system_score_gemma":0.0011055003,"threshold_uncertainty_score":0.012291372},"labels":[],"label_agreement":null},{"id":"W2607714025","doi":"10.1109/pst.2016.7906936","title":"Exploiting known vulnerabilities of a smart thermostat","year":2016,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Thermostat; Exploit; Computer security; Computer science; Vulnerability (computing); The Internet; Internet privacy; Engineering; World Wide Web","score_opus":0.027445803260019577,"score_gpt":0.23472155814361234,"score_spread":0.20727575488359276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607714025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91794837,0.0003879529,0.065926254,0.00059007254,0.000054425804,0.00008754647,0.00014723963,0.0008591283,0.013998968],"genre_scores_gemma":[0.9924694,0.00009079398,0.0063547227,0.00004243481,0.0000045847996,0.000014760096,0.000029133133,0.000016373657,0.0009778403],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999355,0.00018010823,0.00003662186,0.00010441913,0.00020581014,0.00011798119],"domain_scores_gemma":[0.9972759,0.0010149687,0.00047208104,0.00091977627,0.00018916378,0.00012809622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054459594,0.00036023255,0.00033062583,0.00042367022,0.00049978483,0.0007933215,0.0005404016,0.0009542729,0.0021101597],"category_scores_gemma":[0.0021000996,0.00019788586,0.00031624598,0.00031023522,0.0010553062,0.0026569813,0.0012663269,0.00064113375,0.000315191],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013218949,0.0007916909,0.077832036,0.0008576931,0.00039322124,0.007211869,0.0044412147,0.16109115,0.38926685,0.20043649,0.006649958,0.1497059],"study_design_scores_gemma":[0.000046646484,0.0012407791,0.016499124,0.00012334248,0.0002350532,0.006087671,0.00110955,0.57246035,0.3306903,0.047869187,0.02348469,0.00015334535],"about_ca_topic_score_codex":0.00047049395,"about_ca_topic_score_gemma":0.0006018471,"teacher_disagreement_score":0.0021101597,"about_ca_system_score_codex":0.00033177895,"about_ca_system_score_gemma":0.00030135384,"threshold_uncertainty_score":0.007059157},"labels":[],"label_agreement":null},{"id":"W260792670","doi":"10.1007/978-3-642-11723-7","title":"Ad Hoc Networks: First International Conference, ADHOCNETS 2009, Niagara Falls, Ontario, Canada, September 22-25, 2009. Revised Selected Papers","year":2010,"lang":"en","type":"book","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wireless ad hoc network; Scope (computer science); Vehicular ad hoc network; Variety (cybernetics); Mobile ad hoc network; Computer science; Wireless network; Computer security; Telecommunications; Engineering; Computer network; Wireless; Artificial intelligence","score_opus":0.011658286937101636,"score_gpt":0.19967502677285273,"score_spread":0.1880167398357511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W260792670","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004711715,0.23289573,0.09480577,0.016528776,0.06258072,0.0006913574,0.011704498,0.0048339264,0.5712475],"genre_scores_gemma":[0.005328383,0.08040764,0.009262507,0.00073395617,0.0030342247,0.00009004517,0.0045743696,0.0006842245,0.89588475],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924517,0.000055249373,0.000035011893,0.00011708534,0.00047602033,0.00007147005],"domain_scores_gemma":[0.9977307,0.0003449051,0.00005666958,0.00013251316,0.0014541938,0.00028122225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013774072,0.0019538444,0.0016933447,0.0019880629,0.0012234965,0.0033818462,0.0016998337,0.0012119464,0.09329992],"category_scores_gemma":[0.0022540402,0.00086418,0.00033125334,0.0038538051,0.0009146481,0.0031268871,0.0010765858,0.0024580678,0.06559154],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041984247,0.000025370076,0.00017610726,0.0003842329,0.000012223929,0.000050181472,0.000067815155,0.00067058497,0.00076544355,0.0024673159,0.87113947,0.12419919],"study_design_scores_gemma":[0.000013037529,0.00003536594,0.0005889539,0.00029427427,0.000016870095,0.00017858187,0.00008971529,0.0017066962,0.00054562476,0.0015293,0.9949852,0.000016433567],"about_ca_topic_score_codex":0.03931266,"about_ca_topic_score_gemma":0.13352607,"teacher_disagreement_score":0.09329992,"about_ca_system_score_codex":0.0027348737,"about_ca_system_score_gemma":0.0039300015,"threshold_uncertainty_score":0.31211936},"labels":[],"label_agreement":null},{"id":"W2610137697","doi":"","title":"Data Acquisition and Preparation for Social Network Analysis Based on Email: Lessons Learned","year":2009,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Social network analysis; Data collection; Social network (sociolinguistics); Computer science; Situation awareness; Information sharing; Descriptive statistics; Social media; World Wide Web; Knowledge management; Engineering","score_opus":0.09734179078473493,"score_gpt":0.3608016867227839,"score_spread":0.26345989593804897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610137697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10601447,0.00081602443,0.76334393,0.025831236,0.0031408125,0.031312365,0.027019756,0.015955888,0.026565492],"genre_scores_gemma":[0.1078581,0.00062594336,0.8520396,0.0016390187,0.0007192412,0.016578063,0.008655005,0.0020886736,0.009796454],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.96105963,0.025975484,0.003176309,0.0023119359,0.0065426184,0.000934136],"domain_scores_gemma":[0.7574258,0.12649216,0.0061810557,0.03477714,0.07024587,0.004878013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04505735,0.001217644,0.0012251373,0.004552283,0.0021237382,0.0053118626,0.0033820951,0.001309141,0.017320845],"category_scores_gemma":[0.17897695,0.0008279864,0.00095286063,0.004916365,0.0014332251,0.0058727777,0.0035936623,0.0034279062,0.014129147],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008076814,0.0009788984,0.018652434,0.0021857722,0.00008614052,0.0009986944,0.01910793,0.002851954,0.011317852,0.0050053587,0.10142853,0.83657885],"study_design_scores_gemma":[0.0008482638,0.0027932746,0.105793245,0.0073303133,0.00022989027,0.0014318842,0.07803736,0.06424017,0.042994544,0.055623833,0.6397463,0.0009309073],"about_ca_topic_score_codex":0.00729575,"about_ca_topic_score_gemma":0.009372199,"teacher_disagreement_score":0.04505735,"about_ca_system_score_codex":0.0015480001,"about_ca_system_score_gemma":0.0062044254,"threshold_uncertainty_score":0.23828882},"labels":[],"label_agreement":null},{"id":"W2610687538","doi":"","title":"On the Suitability of Mobile Cloud Computing at the Tactical Edge","year":2014,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cloud computing; Situation awareness; Command and control; Computer security; Computer science; Control (management); Information Operations; Engineering; Telecommunications; Operating system","score_opus":0.02089196646419648,"score_gpt":0.25089603222861934,"score_spread":0.23000406576442287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610687538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8099182,0.002640924,0.011715376,0.018485967,0.000366282,0.00027830742,0.0005950875,0.00011978217,0.15588],"genre_scores_gemma":[0.9973247,0.00034755876,0.0011214811,0.00016617138,0.000029486058,0.000012530355,0.00004985298,0.000010820998,0.0009374154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980684,0.00072752027,0.00005701983,0.00015801443,0.00045242044,0.0005366731],"domain_scores_gemma":[0.9899828,0.0052392255,0.00042754525,0.00043412446,0.0032717444,0.0006446269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033431689,0.000248174,0.00016134414,0.0008853754,0.0019677577,0.0035311852,0.0008962273,0.0009775409,0.0062361774],"category_scores_gemma":[0.012506608,0.00013682574,0.00018100996,0.0015866108,0.0009679585,0.0034753575,0.0012484726,0.0008439111,0.0007580149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050921203,0.00059445173,0.20472422,0.00095324276,0.0001367065,0.0032065196,0.0029927953,0.13782705,0.019909482,0.19767043,0.051792685,0.37510028],"study_design_scores_gemma":[0.00036388802,0.0023101596,0.19989587,0.0014411953,0.00024566826,0.0024095578,0.02695976,0.4833645,0.037507337,0.07454154,0.17073548,0.00022503444],"about_ca_topic_score_codex":0.027647885,"about_ca_topic_score_gemma":0.032256074,"teacher_disagreement_score":0.027647885,"about_ca_system_score_codex":0.0034150698,"about_ca_system_score_gemma":0.0018402465,"threshold_uncertainty_score":0.0549739},"labels":[],"label_agreement":null},{"id":"W2613130183","doi":"10.1109/wcnc.2017.7925488","title":"A Coalitional Graph Game for Device-to-Device Data Dissemination with Power Budget Constraints","year":2017,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Budget constraint; Wireless; Scheduling (production processes); Graph; Dissemination; Mobile device; Constraint (computer-aided design); Distributed computing; Incentive; Mobile social network; Wireless network; Computer network; Data transmission; Social graph; Game theory; Power consumption; Mobile computing; Power (physics); Social media; Theoretical computer science; Mathematical optimization; Telecommunications; Engineering; World Wide Web","score_opus":0.055734408384097836,"score_gpt":0.3337411321261587,"score_spread":0.27800672374206087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613130183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010127671,0.00019649354,0.9791245,0.00036983268,0.00005756238,0.00018781616,0.0001595537,0.00010333382,0.009673232],"genre_scores_gemma":[0.6927906,0.00083839404,0.2914609,0.00034121715,0.00007298975,0.00083461945,0.0003453745,0.00011500818,0.01320089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988115,0.0005946744,0.000042244163,0.00017804718,0.0002242102,0.00014939324],"domain_scores_gemma":[0.99851507,0.00097135094,0.00012008696,0.00007356803,0.0001504663,0.00016947674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015395838,0.0014790158,0.0012270912,0.0009171085,0.00087854796,0.0014222893,0.0023534365,0.0017414587,0.0039415653],"category_scores_gemma":[0.0038849046,0.00049832044,0.0009736935,0.0014552674,0.0011542074,0.002170402,0.0017461368,0.0017012189,0.00044651324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007538081,0.00006499993,0.00020156085,0.00013105963,0.000043605312,0.0003078903,0.00017429271,0.84771776,0.0016165663,0.13184749,0.0029049288,0.014914567],"study_design_scores_gemma":[0.000025082592,0.000031502168,0.00005375463,0.000010545336,0.000012158937,0.00006632394,0.000034030116,0.9689474,0.00019447529,0.028549531,0.0020632301,0.000011942175],"about_ca_topic_score_codex":0.008211111,"about_ca_topic_score_gemma":0.007715313,"teacher_disagreement_score":0.008211111,"about_ca_system_score_codex":0.0022828183,"about_ca_system_score_gemma":0.0027153846,"threshold_uncertainty_score":0.016563058},"labels":[],"label_agreement":null},{"id":"W2613533596","doi":"10.5555/2500039.2500041","title":"A realistic implementation for simulating side-channel in mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Annual Simulation Symposium","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Defence Research and Development Canada","funders":"","keywords":"Computer science; Channel (broadcasting); Wireless ad hoc network; Mobile ad hoc network; Computer network; Payload (computing); Frame (networking); Side channel attack; Vehicular ad hoc network; Mobile telephony; Mobile radio; Wireless; Computer security; Telecommunications; Network packet","score_opus":0.019709121679916994,"score_gpt":0.3043268495108016,"score_spread":0.28461772783088457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613533596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06270656,0.0001322909,0.92201704,0.00037257327,0.00020189928,0.00034105047,0.00056765147,0.0015735491,0.012087248],"genre_scores_gemma":[0.6540584,0.00030996915,0.3397333,0.00018408516,0.000038618007,0.0007336736,0.00056435453,0.00024788856,0.004129719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954873,0.00020385151,0.000026058795,0.000036923917,0.00013382811,0.000050550465],"domain_scores_gemma":[0.998569,0.00082517177,0.00009053984,0.00022389108,0.00022278288,0.00006848476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076961855,0.00046766025,0.00035524246,0.00034877163,0.0004996377,0.00071574963,0.0016862906,0.0011576511,0.0035867693],"category_scores_gemma":[0.0032996552,0.0003421918,0.00050157047,0.00035153126,0.0005186427,0.0010489657,0.00070995756,0.0010959806,0.0005678689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004366338,0.000052274925,0.000709751,0.00005572826,0.000017516753,0.00006730848,0.00009138627,0.9748359,0.001987074,0.014814174,0.0007476324,0.006577669],"study_design_scores_gemma":[0.000017810891,0.000037930997,0.00007471711,0.0000071599075,0.0000056231456,0.000021022895,0.000020913412,0.99462056,0.0009430393,0.0019459539,0.0022980843,0.000007211371],"about_ca_topic_score_codex":0.004607361,"about_ca_topic_score_gemma":0.0041586426,"teacher_disagreement_score":0.004607361,"about_ca_system_score_codex":0.0006049699,"about_ca_system_score_gemma":0.0008355595,"threshold_uncertainty_score":0.011998951},"labels":[],"label_agreement":null},{"id":"W2623923837","doi":"","title":"Modelization and trust establishment in ambient networks","year":2006,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science","score_opus":0.012351083863527396,"score_gpt":0.20974484817075792,"score_spread":0.19739376430723052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623923837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023339253,0.00019858894,0.96896285,0.00090817385,0.000081731276,0.000084895706,0.000091342496,0.00016999402,0.006163159],"genre_scores_gemma":[0.8660612,0.00054627744,0.124386564,0.00016098314,0.00014732589,0.00035701026,0.00028649124,0.00009449019,0.00795962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448675,0.002453163,0.0004238655,0.0008071363,0.0013404114,0.0004886499],"domain_scores_gemma":[0.9908703,0.004824294,0.00074698037,0.0018445129,0.0011880178,0.00052578165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045039374,0.0007770209,0.0010527867,0.0008197509,0.0014003615,0.0049878443,0.0026628014,0.001992507,0.0019548528],"category_scores_gemma":[0.01602689,0.00073937385,0.0012577658,0.0014056232,0.0031469485,0.0069381,0.0045587076,0.003719962,0.0003869684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009130965,0.0000578674,0.00057990523,0.000074037955,0.00003820653,0.00018193433,0.0006203144,0.21632995,0.00091446575,0.77162474,0.0009372947,0.0085500255],"study_design_scores_gemma":[0.000023131435,0.00002862039,0.00008471115,0.0000149042,0.000022677004,0.0000485444,0.00010479762,0.6619484,0.00046128765,0.33422455,0.0030224374,0.00001592483],"about_ca_topic_score_codex":0.0062730913,"about_ca_topic_score_gemma":0.004107024,"teacher_disagreement_score":0.0062730913,"about_ca_system_score_codex":0.0027903002,"about_ca_system_score_gemma":0.0022179794,"threshold_uncertainty_score":0.023819387},"labels":[],"label_agreement":null},{"id":"W2734628372","doi":"10.1109/tvt.2017.2725449","title":"Truthful Mechanisms for Message Dissemination via Device-to-Device Communications","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.027828999900472596,"score_gpt":0.30397785800815913,"score_spread":0.2761488581076865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734628372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014888762,0.00066566846,0.98015666,0.00056869216,0.0001096246,0.00021585077,0.00011505345,0.0003616253,0.0029181193],"genre_scores_gemma":[0.8532502,0.00096376525,0.14089413,0.00035384585,0.00017139905,0.00045264562,0.00015605317,0.00008050484,0.0036774748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99281186,0.0032375655,0.00043948763,0.0013146468,0.001375481,0.00082104164],"domain_scores_gemma":[0.9751729,0.017378774,0.0027192284,0.002916679,0.0012943806,0.0005181408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010121918,0.0014906931,0.0018817711,0.0014617097,0.0011872624,0.0034008569,0.0043875407,0.0034722262,0.004328525],"category_scores_gemma":[0.026999556,0.00091386936,0.0017881673,0.0019533816,0.0024592152,0.0061333464,0.0028759595,0.003149364,0.00064477144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068149203,0.00028449917,0.000987796,0.0006620749,0.00019841421,0.0005434051,0.0003943107,0.480694,0.008156757,0.42136988,0.0040975153,0.081929855],"study_design_scores_gemma":[0.00019676356,0.00017865264,0.0001860014,0.00005530591,0.00006626015,0.00023035098,0.000051029503,0.8445855,0.0024465201,0.14861725,0.003328078,0.00005831255],"about_ca_topic_score_codex":0.0009929881,"about_ca_topic_score_gemma":0.0007553412,"teacher_disagreement_score":0.010121918,"about_ca_system_score_codex":0.0021397308,"about_ca_system_score_gemma":0.0025713695,"threshold_uncertainty_score":0.053530455},"labels":[],"label_agreement":null},{"id":"W2735305329","doi":"10.1002/cpe.4207","title":"Targeted content dissemination in mobile social networks taking account of resource limitation","year":2017,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Exploit; Relay; Computer network; Mobile social network; Scheduling (production processes); Overhead (engineering); Limiting; Mobile computing; Computer security","score_opus":0.05854052715219711,"score_gpt":0.3522446911425863,"score_spread":0.2937041639903892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735305329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17515853,0.0006764595,0.8166169,0.00044684837,0.000061182305,0.00016893684,0.000064033564,0.0005115284,0.0062955627],"genre_scores_gemma":[0.9235021,0.00023847233,0.07431932,0.000054331205,0.000031953074,0.00008122827,0.00004710403,0.000027731146,0.0016979686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940586,0.0002452593,0.000026531665,0.00008783428,0.0001579114,0.00007664624],"domain_scores_gemma":[0.99782395,0.0013820408,0.00020087663,0.00022150823,0.0002575787,0.00011411252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010701546,0.00038943713,0.0006490861,0.0007906669,0.0007477115,0.00075254636,0.00082256075,0.000627339,0.000746227],"category_scores_gemma":[0.003383793,0.0002775971,0.00048803666,0.0006774108,0.0003741707,0.001191524,0.0009396573,0.00041683827,0.00012720183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025584974,0.00017019469,0.002763683,0.00023258642,0.00011222502,0.0008644931,0.00048758113,0.7686224,0.030244071,0.05940104,0.0026430124,0.13420284],"study_design_scores_gemma":[0.000018610175,0.00004704126,0.0002913351,0.0000074640343,0.000024876581,0.00010624494,0.000061920604,0.9820057,0.002227015,0.013341425,0.001860392,0.0000080063355],"about_ca_topic_score_codex":0.0025492022,"about_ca_topic_score_gemma":0.0023417918,"teacher_disagreement_score":0.0025492022,"about_ca_system_score_codex":0.0009351933,"about_ca_system_score_gemma":0.00072571216,"threshold_uncertainty_score":0.006785333},"labels":[],"label_agreement":null},{"id":"W2740454704","doi":"10.1109/icc.2017.7997366","title":"Group joining time for Cognitive Personal Area Networks (CPANs) with independent node arrivals","year":2017,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rendezvous; Computer science; Node (physics); Group (periodic table); Distributed computing; Computer network; Topology (electrical circuits); Mathematics; Combinatorics; Physics; Structural engineering; Engineering","score_opus":0.03235699251996232,"score_gpt":0.2521453339825091,"score_spread":0.21978834146254678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740454704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21262051,0.0009924924,0.78121144,0.0005154173,0.00017816942,0.00013910257,0.00012988271,0.00035979782,0.003853173],"genre_scores_gemma":[0.97056836,0.00044848022,0.02625734,0.00008237105,0.00006740474,0.000113260845,0.00010979093,0.00007832036,0.0022745894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818134,0.00038388284,0.00008251823,0.00037539485,0.00061356707,0.000363358],"domain_scores_gemma":[0.9864287,0.009505653,0.0018429516,0.0006655123,0.00096445176,0.0005928409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041212062,0.0007535029,0.00094551,0.0011534798,0.0017575886,0.0014751724,0.0023518766,0.0010155085,0.0016400901],"category_scores_gemma":[0.018610658,0.00062561914,0.00066974293,0.0011372523,0.0013510437,0.0027227274,0.0014366166,0.0016916872,0.00028565055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079917343,0.00017538619,0.004231411,0.0002084845,0.00008803804,0.0003421641,0.00088132167,0.8353252,0.00959294,0.105823986,0.0019730553,0.040558886],"study_design_scores_gemma":[0.000013821272,0.00007973469,0.00049199344,0.0000060514344,0.000027661334,0.00011443937,0.00011391648,0.98471886,0.0010861501,0.012715213,0.0006097897,0.000022468783],"about_ca_topic_score_codex":0.005076293,"about_ca_topic_score_gemma":0.004229958,"teacher_disagreement_score":0.005076293,"about_ca_system_score_codex":0.0024724915,"about_ca_system_score_gemma":0.002144209,"threshold_uncertainty_score":0.021795273},"labels":[],"label_agreement":null},{"id":"W2743010497","doi":"10.1007/s11277-017-4587-3","title":"On Erasure Coding in Intermittently Connected Networks","year":2017,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Linear network coding; Erasure code; Erasure; Coding (social sciences); Routing (electronic design automation); Geographic routing; Overhead (engineering); Path (computing); Routing protocol; Decoding methods; Distributed computing; Dynamic Source Routing; Network packet; Telecommunications","score_opus":0.052926430022632184,"score_gpt":0.3009416010826056,"score_spread":0.2480151710599734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743010497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086947024,0.016971365,0.84373516,0.0055438234,0.0013122493,0.0000955675,0.00041569656,0.00021038199,0.044768795],"genre_scores_gemma":[0.9174118,0.023622504,0.03885674,0.0009215334,0.0020435948,0.0002262173,0.00027677312,0.00013980015,0.016501106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988431,0.0004806351,0.000048131486,0.00012466343,0.00031570805,0.00018778541],"domain_scores_gemma":[0.98811615,0.010253603,0.00041856442,0.00046446105,0.00057923986,0.00016809508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024498214,0.0011541772,0.0013234151,0.0019305861,0.0010100901,0.0019993666,0.0017152515,0.0017918736,0.0030610296],"category_scores_gemma":[0.013643713,0.00076930545,0.0006761937,0.0025099171,0.0033127079,0.004440999,0.0026365998,0.0024733087,0.00033332835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012334021,0.000045663917,0.00062915776,0.00019307598,0.000047369344,0.00020875862,0.00024059856,0.37783742,0.0012095772,0.59305,0.004310896,0.02210409],"study_design_scores_gemma":[0.00001784525,0.000029062545,0.000226849,0.00006597749,0.000023523315,0.000081867605,0.000059823746,0.67641187,0.00028767544,0.32062832,0.002144389,0.000022918473],"about_ca_topic_score_codex":0.004625257,"about_ca_topic_score_gemma":0.0040061795,"teacher_disagreement_score":0.004625257,"about_ca_system_score_codex":0.0019252442,"about_ca_system_score_gemma":0.0010482026,"threshold_uncertainty_score":0.013968706},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; 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","score_opus":0.041851710472918635,"score_gpt":0.2931014631230441,"score_spread":0.25124975265012545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752406850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07961163,0.0007658866,0.9127372,0.0005057449,0.0003583591,0.00014781638,0.00020918158,0.0011071891,0.004557003],"genre_scores_gemma":[0.91462153,0.00027214765,0.08262729,0.00010166002,0.000066522676,0.000056656838,0.00018685947,0.00003325009,0.002034078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958926,0.00007399397,0.000031506122,0.00009388927,0.00012288122,0.0000885119],"domain_scores_gemma":[0.99931574,0.00018454398,0.00008200867,0.00015309406,0.00019488385,0.00006980207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757337,0.00053088187,0.0009195046,0.000660631,0.0011171317,0.00072102697,0.0017453143,0.00071590993,0.0009623647],"category_scores_gemma":[0.0014464097,0.0002963281,0.00033575148,0.0009214336,0.00044035222,0.0012363136,0.0015691791,0.0005850044,0.00026506497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006808408,0.00033710396,0.0035401804,0.00015520993,0.00011813133,0.000662151,0.00031295643,0.6146309,0.031215468,0.031040736,0.0114954505,0.30581084],"study_design_scores_gemma":[0.000015491396,0.000074092684,0.00027544922,0.000005742733,0.000019927327,0.00014185728,0.000045533565,0.99278885,0.001711628,0.003568658,0.0013330224,0.000019876403],"about_ca_topic_score_codex":0.0053155217,"about_ca_topic_score_gemma":0.009116574,"teacher_disagreement_score":0.0053155217,"about_ca_system_score_codex":0.00072341046,"about_ca_system_score_gemma":0.0010522914,"threshold_uncertainty_score":0.010569155},"labels":[],"label_agreement":null},{"id":"W2756795309","doi":"10.3390/s17102166","title":"Design and Analysis of an Efficient Energy Algorithm in Wireless Social Sensor Networks","year":2017,"lang":"en","type":"article","venue":"Sensors","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health; Fundamental Research Funds for the Central Universities; King Saud University; National Natural Science Foundation of China","keywords":"Computer science; Asynchronous communication; Distributed computing; Correctness; Mobile ad hoc network; Wireless ad hoc network; Computer network; Rollback; Wireless; Algorithm; Database transaction; Network packet","score_opus":0.021093118686601218,"score_gpt":0.25364214718286626,"score_spread":0.23254902849626505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756795309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008492342,0.0002510037,0.98877114,0.00012843499,0.000028605073,0.00006137252,0.000013891908,0.00012473432,0.002128471],"genre_scores_gemma":[0.66715705,0.0008591049,0.32725435,0.00013375518,0.00006363724,0.0005202346,0.00010788185,0.00007859463,0.0038254717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994717,0.00016377385,0.0000287828,0.00009893433,0.00017945317,0.000057301353],"domain_scores_gemma":[0.9995022,0.000264438,0.000057351375,0.00003226618,0.00012399905,0.00001977747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081864354,0.00059747463,0.000550509,0.00068048853,0.0005102893,0.0008647191,0.00094430504,0.00066357624,0.0013550435],"category_scores_gemma":[0.002236166,0.00028406124,0.00044752657,0.00071653177,0.00062035635,0.0011708896,0.00082675496,0.0004188428,0.00024430547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042100506,0.000031628646,0.00060537807,0.00010126284,0.000030234483,0.000046728244,0.00005365253,0.8840681,0.0025234998,0.04310768,0.0009444115,0.06844543],"study_design_scores_gemma":[0.000004055129,0.000019486832,0.000045995024,0.0000035302132,0.0000034107024,0.000009674855,0.000009713648,0.9941912,0.00031954166,0.004768539,0.0006227986,0.0000020526045],"about_ca_topic_score_codex":0.0019416385,"about_ca_topic_score_gemma":0.0018681003,"teacher_disagreement_score":0.0019416385,"about_ca_system_score_codex":0.00096342806,"about_ca_system_score_gemma":0.0011717248,"threshold_uncertainty_score":0.006990254},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search and rescue; Computer science; Wireless; Provisioning; Drone; Cellular network; Computer network; Wireless network; Mobile telephony; Mobile radio; Telecommunications","score_opus":0.1033413420705414,"score_gpt":0.32547622165849477,"score_spread":0.22213487958795336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762470713","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011637157,0.41566542,0.20141095,0.012537805,0.008569967,0.0003170681,0.00055731443,0.000885643,0.3484186],"genre_scores_gemma":[0.19943228,0.53093517,0.05127575,0.0061781034,0.009300272,0.000362894,0.0013556099,0.00020417986,0.2009557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961495,0.00007465166,0.000022118818,0.00006515227,0.0001700324,0.000052980697],"domain_scores_gemma":[0.9994836,0.00017172824,0.000036561374,0.000053100182,0.00022589401,0.000029054298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038833442,0.0007066547,0.0003741889,0.0011394585,0.00055412384,0.001266687,0.00070560124,0.0015038507,0.014142618],"category_scores_gemma":[0.00078875315,0.0002741458,0.00025751686,0.0020264091,0.00051170716,0.0018502902,0.0009741956,0.0012246,0.0064546335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001857481,0.000097037504,0.0011234129,0.0014630416,0.00004159588,0.0005668921,0.00019350587,0.009713449,0.017039707,0.09348131,0.15591006,0.7201842],"study_design_scores_gemma":[0.000010731027,0.00012139807,0.00086388044,0.00038657,0.00002536941,0.0006371155,0.0001438785,0.021604871,0.0042635547,0.022286888,0.9496241,0.000031683805],"about_ca_topic_score_codex":0.0015047273,"about_ca_topic_score_gemma":0.0014592044,"teacher_disagreement_score":0.014142618,"about_ca_system_score_codex":0.00062951795,"about_ca_system_score_gemma":0.0004396036,"threshold_uncertainty_score":0.047311723},"labels":[],"label_agreement":null},{"id":"W2764305667","doi":"10.1109/ihtc.2017.8058182","title":"Ad-hoc messaging infrastructure for P2P communication in disaster management","year":2017,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Node (physics); Mobile ad hoc network; Phone; Wireless network; Mobile phone; Wireless; Computer security; Network packet; Telecommunications; Engineering","score_opus":0.01871729751024716,"score_gpt":0.2785751746458659,"score_spread":0.25985787713561875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764305667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016144551,0.005339839,0.8956226,0.0021467826,0.0011181799,0.001025055,0.0004203308,0.008640888,0.0695418],"genre_scores_gemma":[0.5024512,0.0063808463,0.42731252,0.0009510535,0.0009488493,0.0011938096,0.0018679337,0.0009319734,0.057961907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990752,0.0002384391,0.00006135413,0.00016949241,0.00035892223,0.00009662905],"domain_scores_gemma":[0.99915624,0.00019269652,0.00007355884,0.00023100484,0.00023770532,0.00010868183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086905225,0.00059436774,0.00042140274,0.0007820018,0.0012248614,0.002017576,0.0021466704,0.0011185596,0.008842314],"category_scores_gemma":[0.0017153289,0.00045079942,0.00030914633,0.0011045582,0.00057223806,0.002869005,0.0014243522,0.0012071392,0.00468771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043587456,0.00050224096,0.0017995394,0.00163016,0.00012813015,0.0020298709,0.0009053055,0.025763126,0.063473895,0.18992235,0.12643151,0.586978],"study_design_scores_gemma":[0.0001691026,0.0009806973,0.0024437085,0.000393394,0.00016189956,0.00195941,0.00078695425,0.21005604,0.042432133,0.09094163,0.64951545,0.0001594686],"about_ca_topic_score_codex":0.0013594015,"about_ca_topic_score_gemma":0.0014196951,"teacher_disagreement_score":0.008842314,"about_ca_system_score_codex":0.00074459537,"about_ca_system_score_gemma":0.0008795002,"threshold_uncertainty_score":0.029580534},"labels":[],"label_agreement":null},{"id":"W2765369521","doi":"10.1145/3122984","title":"Adaptive Message Routing and Replication in Mobile Opportunistic Networks for Connected Communities","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Internet Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Computer network; Distributed computing; Replication (statistics); Routing protocol; Geographic routing; Routing (electronic design automation); Wireless Routing Protocol","score_opus":0.04737434155444009,"score_gpt":0.29194426477388224,"score_spread":0.24456992321944215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765369521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03759884,0.00050128216,0.9572872,0.0003740189,0.0001161193,0.00029492588,0.00009703066,0.0006402295,0.0030903593],"genre_scores_gemma":[0.76867735,0.00041184624,0.22534753,0.0002021455,0.00012411093,0.0006369025,0.0002263391,0.00007864198,0.0042952313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985738,0.00044636428,0.00010733419,0.00032154183,0.00040433093,0.00014659321],"domain_scores_gemma":[0.9965035,0.0016654202,0.0004982003,0.0007361393,0.00039055516,0.00020618255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014657394,0.0005493818,0.0008517523,0.0009036405,0.0014902353,0.0010702657,0.0020845036,0.0009999431,0.0008274458],"category_scores_gemma":[0.0068987007,0.00037854858,0.0005688401,0.0007712653,0.001092879,0.0022243601,0.0026909616,0.0010065065,0.00026341257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038530302,0.00020310811,0.0027602017,0.00039048298,0.00012513998,0.0012343868,0.0011532076,0.5716687,0.03845898,0.21625979,0.005770805,0.16158989],"study_design_scores_gemma":[0.00002583696,0.0000818837,0.0002191984,0.000013048223,0.000017947501,0.00023441587,0.000081204256,0.9527991,0.0027712274,0.038467024,0.0052528204,0.00003636212],"about_ca_topic_score_codex":0.0027503096,"about_ca_topic_score_gemma":0.0034806826,"teacher_disagreement_score":0.0027503096,"about_ca_system_score_codex":0.001041188,"about_ca_system_score_gemma":0.001293941,"threshold_uncertainty_score":0.0077516437},"labels":[],"label_agreement":null},{"id":"W2768178335","doi":"10.1145/3161587.3161589","title":"Are Wearables Ready for Secure and Direct Internet Communication?","year":2017,"lang":"en","type":"article","venue":"GetMobile Mobile Computing and Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Wearable computer; The Internet; Wearable technology; Computer science; Internet of Things; Internet privacy; Secure communication; Computer security; World Wide Web; Embedded system; Encryption","score_opus":0.05312394892608113,"score_gpt":0.3249480057086223,"score_spread":0.2718240567825412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768178335","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26482213,0.12800471,0.10125231,0.19653657,0.013531265,0.00022948127,0.0011241866,0.0016472031,0.2928522],"genre_scores_gemma":[0.8921626,0.049794305,0.014103561,0.009938853,0.002171338,0.00014411994,0.00037932617,0.00016947876,0.031136457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991529,0.00027005642,0.000042140317,0.00012578977,0.00024318122,0.00016587599],"domain_scores_gemma":[0.9979272,0.00059786096,0.00041846503,0.00033922383,0.0004879613,0.00022923127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086613407,0.0004902881,0.00041131742,0.0003684774,0.0006004935,0.0028774817,0.0005630152,0.0016445866,0.013865917],"category_scores_gemma":[0.0052696285,0.00037086572,0.0003486167,0.00047425894,0.0015817304,0.006699092,0.0008829722,0.0010804753,0.0070262826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007529868,0.00023401933,0.018794244,0.002427185,0.000116915915,0.0017018638,0.0039653117,0.0007294698,0.024329329,0.15459573,0.06719004,0.7251629],"study_design_scores_gemma":[0.000077558885,0.0008184035,0.027201472,0.0030125983,0.00017326097,0.007961694,0.016058277,0.0021543591,0.017613573,0.15834358,0.76640403,0.00018121437],"about_ca_topic_score_codex":0.0004771136,"about_ca_topic_score_gemma":0.00061601796,"teacher_disagreement_score":0.013865917,"about_ca_system_score_codex":0.00032972335,"about_ca_system_score_gemma":0.0004995334,"threshold_uncertainty_score":0.046386123},"labels":[],"label_agreement":null},{"id":"W2772369882","doi":"10.1109/iccke.2017.8167918","title":"Congestion- and selfishness-aware social routing in delay tolerant networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Selfishness; Computer network; Computer science; Relay; Routing protocol; Node (physics); Delay-tolerant networking; Overhead (engineering); Network congestion; Routing (electronic design automation); Distributed computing; Network packet; Wireless Routing Protocol","score_opus":0.02449010914390757,"score_gpt":0.26312201024909077,"score_spread":0.2386319011051832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772369882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103169926,0.0011437836,0.8913232,0.0005401404,0.00014242297,0.00019701415,0.00008642789,0.00054793624,0.0028491996],"genre_scores_gemma":[0.9183513,0.00056693796,0.07910578,0.000102571474,0.00006311855,0.000120980636,0.00011738957,0.000031315725,0.0015405492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994823,0.0001629432,0.000039074785,0.00010329985,0.00015047866,0.00006190001],"domain_scores_gemma":[0.9989201,0.00049325376,0.00022679883,0.00010576083,0.0001670663,0.00008705035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086744723,0.0005380469,0.0006636176,0.0008158677,0.0009108533,0.000851898,0.0013201677,0.00059895276,0.0004767612],"category_scores_gemma":[0.0021448713,0.0002549131,0.00052450906,0.0006882364,0.000534661,0.0013978546,0.0009795743,0.0004554103,0.000098356526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019561703,0.00017562813,0.0049483557,0.00033719777,0.00015756977,0.00049784296,0.000534583,0.77527773,0.016088724,0.044636853,0.003377747,0.15377219],"study_design_scores_gemma":[0.000016794225,0.00008297732,0.0005144616,0.0000133848,0.00003509442,0.0001746494,0.000094788746,0.9827863,0.0025538118,0.011217093,0.002487662,0.000022934679],"about_ca_topic_score_codex":0.0027161941,"about_ca_topic_score_gemma":0.002820626,"teacher_disagreement_score":0.0027161941,"about_ca_system_score_codex":0.0009739056,"about_ca_system_score_gemma":0.0008024016,"threshold_uncertainty_score":0.00706625},"labels":[],"label_agreement":null},{"id":"W2781398886","doi":"10.1504/ijssc.2017.10010065","title":"A* search based next hop selection for routing in opportunistic networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Space-Based and Situated Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Geographic routing; Routing protocol; Hop (telecommunications); Node (physics); Routing (electronic design automation); Distributed computing; Dynamic Source Routing; Benchmark (surveying); Wireless Routing Protocol; Geography; Engineering","score_opus":0.04688670825946679,"score_gpt":0.3033245187005038,"score_spread":0.25643781044103703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781398886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030776225,0.002012978,0.95930433,0.00035251555,0.00021166784,0.00018612831,0.00014855187,0.0006927103,0.006314912],"genre_scores_gemma":[0.6544684,0.001655838,0.33698174,0.00027599747,0.000101857826,0.00034160636,0.00034528703,0.0000599098,0.005769337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958247,0.00014764699,0.00003266344,0.000057405337,0.0001308332,0.000049043687],"domain_scores_gemma":[0.9988563,0.0006870667,0.0001445083,0.00010027272,0.00016700402,0.00004479998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006411426,0.00037003632,0.0005228404,0.00090546854,0.0007448959,0.00062811584,0.0010175854,0.0006223488,0.0012418436],"category_scores_gemma":[0.0021026405,0.00016286479,0.00034565318,0.0010098496,0.00043529578,0.0008089958,0.0006525211,0.0005343958,0.00029766827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065260427,0.00033668548,0.0034827362,0.00067351025,0.00022624814,0.00055878714,0.00031403778,0.38361773,0.034541104,0.082598776,0.012445644,0.4805521],"study_design_scores_gemma":[0.000045002816,0.0002455043,0.0005458941,0.000037457165,0.000038989616,0.00046634497,0.00008262284,0.9681199,0.0052451086,0.015976764,0.009168011,0.000028447552],"about_ca_topic_score_codex":0.0023139964,"about_ca_topic_score_gemma":0.0035282734,"teacher_disagreement_score":0.0023139964,"about_ca_system_score_codex":0.00045022502,"about_ca_system_score_gemma":0.0010912031,"threshold_uncertainty_score":0.0046010017},"labels":[],"label_agreement":null},{"id":"W2782496420","doi":"10.1007/s12083-017-0628-7","title":"Ad-hoc messaging infrastructure for peer-to-peer communication","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Peer-to-peer; Computer science; Wireless ad hoc network; Computer network; World Wide Web; Telecommunications; Wireless","score_opus":0.020752066582423605,"score_gpt":0.292478541460965,"score_spread":0.2717264748785414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782496420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021590501,0.0034213078,0.90885955,0.0013526573,0.0017355548,0.0011537079,0.0009369525,0.011712841,0.049236935],"genre_scores_gemma":[0.531941,0.0040365136,0.39942768,0.00049350644,0.0010632473,0.0010130389,0.0046385033,0.000673696,0.056712788],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897027,0.00015522557,0.00011506082,0.00018097034,0.00045352636,0.00012504132],"domain_scores_gemma":[0.9983668,0.0002444896,0.00016723512,0.00042438167,0.00061335746,0.00018377206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009446137,0.00059217017,0.00065242656,0.0012350102,0.0014376746,0.0022060734,0.002668114,0.0009151955,0.0060961],"category_scores_gemma":[0.0023885155,0.0003385778,0.00028144606,0.0013088108,0.00041025912,0.0024633573,0.0016177522,0.0012522348,0.00355504],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005286495,0.0005938554,0.0013947845,0.0016229452,0.00013756994,0.0010612089,0.0005908732,0.028708873,0.106061056,0.23013942,0.091764756,0.537396],"study_design_scores_gemma":[0.00016615342,0.0007923925,0.0024844122,0.0002800878,0.0002769007,0.0014554189,0.0005913974,0.31756186,0.088872254,0.08138076,0.5059417,0.0001967357],"about_ca_topic_score_codex":0.0011288287,"about_ca_topic_score_gemma":0.0014172373,"teacher_disagreement_score":0.0060961,"about_ca_system_score_codex":0.0008832369,"about_ca_system_score_gemma":0.0016457393,"threshold_uncertainty_score":0.02039349},"labels":[],"label_agreement":null},{"id":"W2783785065","doi":"10.1109/lwc.2018.2792023","title":"Optimal Epidemic Information Dissemination in Uncertain Dynamic Environment","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Markov chain; Computer science; Reliability (semiconductor); Dynamic programming; Markov decision process; Epidemic model; Markov process; Dissemination; Mathematical optimization; Stochastic programming; Continuous-time Markov chain; Stochastic process; Markov model; Stochastic modelling; Variable-order Markov model; Mathematics; Population; Machine learning; Algorithm","score_opus":0.017124376884706385,"score_gpt":0.2710108525983225,"score_spread":0.25388647571361617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783785065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06259998,0.00028900898,0.9336398,0.0005705943,0.000023964543,0.00004148176,0.00006526999,0.00007706366,0.0026927877],"genre_scores_gemma":[0.96974206,0.00029848795,0.027986364,0.000068467256,0.000015417458,0.00009075871,0.000042396652,0.000020692372,0.0017354029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992448,0.00030264142,0.00003451009,0.00014964574,0.00013847943,0.00012985783],"domain_scores_gemma":[0.99828184,0.0011827204,0.00024843993,0.000051472085,0.00016643813,0.00006905392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001382413,0.00060962065,0.00095372525,0.0004411173,0.00037392305,0.0010255289,0.0007964821,0.0010797246,0.00070899713],"category_scores_gemma":[0.0041248403,0.0005751876,0.0005186645,0.0004897878,0.0008552171,0.0013924444,0.0010753502,0.0009776475,0.00006773659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020869433,0.000010497423,0.00016754922,0.000023018132,0.00001044192,0.000036468475,0.000029533046,0.9796213,0.0007390687,0.016864864,0.00013967045,0.0023366953],"study_design_scores_gemma":[0.000003603535,0.00000874041,0.000039327886,0.0000018294598,0.0000029876292,0.0000046564683,0.000005344729,0.99539196,0.00013332267,0.0043280628,0.00007732788,0.0000029216596],"about_ca_topic_score_codex":0.0041649765,"about_ca_topic_score_gemma":0.001883938,"teacher_disagreement_score":0.0041649765,"about_ca_system_score_codex":0.001603864,"about_ca_system_score_gemma":0.0012853869,"threshold_uncertainty_score":0.011636853},"labels":[],"label_agreement":null},{"id":"W2786393035","doi":"10.1109/pimrc.2017.8292289","title":"Charging-aware mobility modeling for wirelessly chargeable intermittently connected MANETs","year":2017,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Mobility model; Routing protocol; Network packet; Wireless ad hoc network; Flooding (psychology); Grid; Routing (electronic design automation); Mobile computing; Distributed computing; Wireless; Skew; Telecommunications","score_opus":0.05612940791778428,"score_gpt":0.2874234261095351,"score_spread":0.2312940181917508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786393035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15988651,0.0011052483,0.82898706,0.001017622,0.00017133162,0.00009399127,0.00019317472,0.00026876395,0.008276345],"genre_scores_gemma":[0.97699225,0.0009327001,0.018100338,0.00008442463,0.00005569521,0.000080916434,0.000085414016,0.00003413309,0.0036340703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983466,0.00006780157,0.000010806216,0.000024466412,0.000032894503,0.00002933221],"domain_scores_gemma":[0.9996487,0.00017157421,0.00007794333,0.000032809814,0.000047448553,0.000021598493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037194914,0.0004540858,0.00045225635,0.0005479972,0.00040883393,0.00052224024,0.000836763,0.00074287836,0.00070268253],"category_scores_gemma":[0.0014475101,0.0002777239,0.0005783607,0.0004916026,0.00059679814,0.0008175031,0.0006027366,0.0005184957,0.00015187958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010245465,0.000009089262,0.0003835976,0.000012038515,0.000007638663,0.000056421686,0.00003470306,0.9880036,0.0006495887,0.009003933,0.0001666333,0.0016624578],"study_design_scores_gemma":[0.000001805714,0.000005783764,0.000067786066,0.000001901127,0.000002222929,0.0000112159705,0.000008857928,0.99764496,0.000046317862,0.0019806782,0.00022612362,0.0000023491507],"about_ca_topic_score_codex":0.0073729623,"about_ca_topic_score_gemma":0.004657415,"teacher_disagreement_score":0.0073729623,"about_ca_system_score_codex":0.0007234845,"about_ca_system_score_gemma":0.0005177327,"threshold_uncertainty_score":0.01466012},"labels":[],"label_agreement":null},{"id":"W2795481253","doi":"10.1109/noms.2018.8406248","title":"Protecting location privacy in opportunistic mobile social networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Obfuscation; Computer science; Internet privacy; Encryption; Computer security; Information privacy; Protocol (science); Privacy protection; Privacy software","score_opus":0.029000992391575088,"score_gpt":0.27338608611883675,"score_spread":0.24438509372726167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795481253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30328053,0.0013060096,0.6858336,0.0010742819,0.00008913038,0.00025694226,0.00019457788,0.0005545142,0.0074104886],"genre_scores_gemma":[0.98221844,0.00034227216,0.016193578,0.00006974169,0.000029855513,0.00007976092,0.00004266112,0.000011856556,0.0010118588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717206,0.0012034735,0.00017702361,0.00027726626,0.00078307476,0.00038715504],"domain_scores_gemma":[0.993624,0.00324653,0.0010263226,0.0015157189,0.0003939968,0.00019342637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002121404,0.0006079079,0.00069663953,0.0008372176,0.001789108,0.0013186052,0.0011097329,0.00091938325,0.00055573386],"category_scores_gemma":[0.007417457,0.00037889986,0.0005230154,0.0012643045,0.0015057242,0.0034308608,0.0033069332,0.0006092605,0.00016776197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001523263,0.00031469553,0.016884083,0.0007925211,0.00034539824,0.0054007974,0.004362285,0.41490507,0.03937199,0.2668978,0.0054213814,0.24378073],"study_design_scores_gemma":[0.00008891429,0.0002824117,0.0015598761,0.00007612912,0.00013673164,0.0020413129,0.0010934528,0.84120256,0.011697794,0.12838085,0.013358114,0.00008188341],"about_ca_topic_score_codex":0.0023763608,"about_ca_topic_score_gemma":0.0015516246,"teacher_disagreement_score":0.0023763608,"about_ca_system_score_codex":0.0008759429,"about_ca_system_score_gemma":0.0010423328,"threshold_uncertainty_score":0.0112192035},"labels":[],"label_agreement":null},{"id":"W2797377272","doi":"10.1109/access.2018.2817858","title":"IEEE Access Special Section Editorial: Trust Management in Pervasive Social Networking (TruPSN)","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Basic Research Program of Shaanxi Province; Higher Education Discipline Innovation Project; Aalto-Yliopisto; University of Massachusetts Dartmouth; Dartmouth College; Xidian University; National Natural Science Foundation of China; University of Nebraska-Lincoln","keywords":"Computer science; Special section; Section (typography); Ubiquitous computing; Trust management (information system); Internet privacy; World Wide Web; Computer security; Computer network; Human–computer interaction; Engineering; Engineering physics; Operating system","score_opus":0.04970068148565582,"score_gpt":0.32446553386052984,"score_spread":0.274764852374874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797377272","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009222112,0.008541425,0.000519258,0.03813149,0.94886124,0.000034926492,0.000055250326,0.00007372849,0.003690456],"genre_scores_gemma":[0.00073071965,0.0069055897,0.00015059147,0.012505205,0.9734581,0.000026768892,0.00003234875,0.000030395388,0.0061603375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972996,0.0004271071,0.0003638394,0.0005104919,0.0011142875,0.0002846767],"domain_scores_gemma":[0.9846917,0.0056741466,0.0009992233,0.00054347736,0.005767345,0.0023241746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004005624,0.0021345427,0.0026062166,0.0024224976,0.0027525744,0.008730813,0.003293006,0.0152319465,0.014819572],"category_scores_gemma":[0.013510041,0.0008979355,0.0021756203,0.0020436514,0.0029696743,0.0044699116,0.0015664115,0.016422315,0.01087075],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002998233,0.000025175377,0.00007452875,0.00026649612,0.000017955383,0.00014024675,0.0000168037,0.0000682893,0.000089451394,0.0010819858,0.98590523,0.012283942],"study_design_scores_gemma":[0.000024771478,0.00004503241,0.0002805348,0.00036666213,0.00004255504,0.00037606104,0.000037696493,0.0002862313,0.00014005146,0.0016934394,0.9966832,0.000023817682],"about_ca_topic_score_codex":0.0012188248,"about_ca_topic_score_gemma":0.0022828,"teacher_disagreement_score":0.0152319465,"about_ca_system_score_codex":0.0023239397,"about_ca_system_score_gemma":0.0020826745,"threshold_uncertainty_score":0.0495764},"labels":[],"label_agreement":null},{"id":"W2798155136","doi":"10.1016/j.engappai.2018.03.024","title":"A Generalized Stochastic Petri Net model of route learning for emergency egress situations","year":2018,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Forgetting; Petri net; Stochastic Petri net; Landmark; Point (geometry); Artificial intelligence; Element (criminal law); Net (polyhedron); Machine learning; Operations research; Distributed computing","score_opus":0.04587055125192737,"score_gpt":0.2913982034763978,"score_spread":0.2455276522244704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798155136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058967706,0.0003548823,0.9299373,0.00045172556,0.00016091274,0.00007116061,0.0005343249,0.0003637141,0.009158303],"genre_scores_gemma":[0.9488631,0.00039229277,0.040786147,0.00008195435,0.000056597844,0.00011305042,0.00029911974,0.000049630475,0.009358192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999519,0.000117075884,0.000026182022,0.0001486513,0.000104362975,0.00008471067],"domain_scores_gemma":[0.9994407,0.00026780568,0.00007942818,0.000035268502,0.00012420482,0.00005257834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063132984,0.0006255929,0.00081483397,0.00061950734,0.00047149402,0.0013100329,0.0018391659,0.0011141797,0.0030280163],"category_scores_gemma":[0.0013750821,0.00037466915,0.00081727677,0.00069721736,0.0007835851,0.0010597985,0.0006925453,0.00082817354,0.00029609486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031867705,0.000017669365,0.00032594553,0.000025474526,0.00001535892,0.00012623216,0.000033068063,0.9603834,0.00079315616,0.03494524,0.00028470822,0.003017948],"study_design_scores_gemma":[0.0000036396893,0.0000063093225,0.000050785944,0.0000024662534,0.00000688058,0.00001023365,0.0000049329037,0.9936733,0.000085332525,0.005935559,0.0002166,0.0000039112947],"about_ca_topic_score_codex":0.028683646,"about_ca_topic_score_gemma":0.02019119,"teacher_disagreement_score":0.028683646,"about_ca_system_score_codex":0.0016170447,"about_ca_system_score_gemma":0.002010082,"threshold_uncertainty_score":0.05703336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040588989843248276,"score_gpt":0.3177905462529564,"score_spread":0.2772015564097081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800057146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030380864,0.000674621,0.9644835,0.0003373995,0.00012401833,0.00009880619,0.0003058382,0.00034422937,0.0032507603],"genre_scores_gemma":[0.8598855,0.00092958176,0.13563812,0.00010883537,0.0001672991,0.00021636594,0.0006156354,0.0000570098,0.0023816524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860865,0.0003727233,0.00009432587,0.0003204568,0.00050940976,0.00009449803],"domain_scores_gemma":[0.9984536,0.0005574239,0.00030369486,0.00015488642,0.0004406158,0.00008962395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212094,0.00081438414,0.0005316918,0.0019511414,0.00068315235,0.0011647791,0.0010345712,0.00066529703,0.0007916888],"category_scores_gemma":[0.004220541,0.00018578609,0.0006506584,0.002407402,0.00048741672,0.002664632,0.0006394595,0.00072605145,0.00022040411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011422655,0.00010296858,0.0069444533,0.0002129101,0.00012400333,0.00032826088,0.00036447353,0.7108876,0.009496863,0.13863136,0.005318212,0.12747462],"study_design_scores_gemma":[0.0000054490924,0.00004388935,0.0008574143,0.000009501284,0.00002649118,0.0001127725,0.00005299365,0.97590065,0.0008049997,0.01937624,0.0027898701,0.000019667414],"about_ca_topic_score_codex":0.010955918,"about_ca_topic_score_gemma":0.010233797,"teacher_disagreement_score":0.010955918,"about_ca_system_score_codex":0.0019949423,"about_ca_system_score_gemma":0.0011035643,"threshold_uncertainty_score":0.021784306},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20635482282759307,"score_gpt":0.3427392126485317,"score_spread":0.13638438982093862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808038031","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06498672,0.15403621,0.62441945,0.034077328,0.0026028045,0.0002247663,0.00045586767,0.0004775519,0.11871938],"genre_scores_gemma":[0.8342898,0.083803855,0.06653548,0.0019637563,0.0022397158,0.00017283717,0.00018301036,0.00008502611,0.010726573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991172,0.00026957566,0.000031862022,0.00014801718,0.00025721028,0.00017600524],"domain_scores_gemma":[0.9941696,0.004256507,0.00025411276,0.00044167906,0.00053706754,0.00034103062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021868215,0.0005053631,0.0008414228,0.00082167157,0.0010674024,0.0057396325,0.0023344017,0.001579567,0.0023870787],"category_scores_gemma":[0.004712895,0.00036135694,0.00029446822,0.0020876674,0.0026106453,0.007891835,0.001739308,0.0022870775,0.00040002892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058662677,0.000115872754,0.0013505482,0.00042549765,0.000029670902,0.0001296083,0.00024773658,0.021353442,0.0010084404,0.8436848,0.007977454,0.12361817],"study_design_scores_gemma":[0.000014001245,0.000058640013,0.0005082472,0.00021572178,0.000023010103,0.00036410708,0.0008898138,0.12018341,0.0008860727,0.8213702,0.055447306,0.000039348175],"about_ca_topic_score_codex":0.0018018623,"about_ca_topic_score_gemma":0.0023419322,"teacher_disagreement_score":0.0057396325,"about_ca_system_score_codex":0.0013853506,"about_ca_system_score_gemma":0.0016878961,"threshold_uncertainty_score":0.011565149},"labels":[],"label_agreement":null},{"id":"W2808368287","doi":"10.1109/tgcn.2018.2847451","title":"Energy-Aware Incentivized Data Dissemination via Wireless D2D Communications With Weighted Social Communities","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Computer network; Wireless; Tracing; Distributed computing; Efficient energy use; Dissemination; Computer security; Telecommunications","score_opus":0.06169316606139112,"score_gpt":0.2919893410656361,"score_spread":0.23029617500424499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808368287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07440615,0.00076605944,0.9190738,0.0006474908,0.00008767989,0.00025613006,0.00012767426,0.0005240893,0.0041109514],"genre_scores_gemma":[0.9203198,0.00029469922,0.076669976,0.00013453652,0.000048852176,0.00016861018,0.00010357857,0.000033576405,0.002226496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982516,0.0007191353,0.00007016092,0.00032259064,0.00047315346,0.0001632177],"domain_scores_gemma":[0.9964561,0.001879468,0.0004736206,0.0005859457,0.00036704808,0.00023781676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022882093,0.00072131254,0.0008901186,0.001144927,0.0011704548,0.0013672009,0.0021893545,0.001350668,0.0010180669],"category_scores_gemma":[0.0073200995,0.00033103488,0.00063326483,0.0014987804,0.0007660157,0.0025781267,0.0033752278,0.0009116438,0.0002285631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006959481,0.00062385836,0.0037575588,0.0004074466,0.00017212442,0.00061595225,0.00047683425,0.56056124,0.020762362,0.08714311,0.0062110685,0.31857243],"study_design_scores_gemma":[0.00006195177,0.0000870175,0.00033504225,0.0000115694065,0.000025581438,0.0001337774,0.000060624905,0.97177964,0.002789275,0.021283181,0.0034103643,0.000021923324],"about_ca_topic_score_codex":0.002199507,"about_ca_topic_score_gemma":0.0023220575,"teacher_disagreement_score":0.0022882093,"about_ca_system_score_codex":0.0009380896,"about_ca_system_score_gemma":0.001124781,"threshold_uncertainty_score":0.012101352},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W2885021324","doi":"10.1007/s00224-018-9876-z","title":"Computing Parameters of Sequence-Based Dynamic Graphs","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Sequence (biology); Bounded function; Amortized analysis; Computer science; Maximization; Algorithm; Minification; Graph; Combinatorics; Mathematics; Discrete mathematics; Mathematical optimization; Data structure","score_opus":0.034709636403287086,"score_gpt":0.2690888536117062,"score_spread":0.23437921720841912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885021324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23984069,0.00025543402,0.7537508,0.00034256885,0.000059856528,0.00009548258,0.0004941,0.0007604583,0.0044006053],"genre_scores_gemma":[0.9449167,0.00019781844,0.052546505,0.000045423887,0.000034572393,0.00008966721,0.0004535422,0.00016896524,0.00154682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911004,0.00022444713,0.0000610315,0.00026890024,0.00022577384,0.00010979691],"domain_scores_gemma":[0.9911192,0.0056526517,0.0008067148,0.0011162234,0.0008573171,0.00044788135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012950383,0.0007552901,0.0009685161,0.0027453143,0.0007112026,0.0028817975,0.0023004375,0.0013516647,0.0035627817],"category_scores_gemma":[0.020546084,0.0006237235,0.00047216823,0.0025910323,0.0013934964,0.006922144,0.0016807601,0.0014264365,0.00046879658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027770005,0.000084321786,0.0029787652,0.00010537279,0.000045703608,0.0001014508,0.00027523274,0.77314454,0.004527148,0.18038958,0.0010854965,0.036984682],"study_design_scores_gemma":[0.0000098264845,0.000019257735,0.00024614052,0.0000122330375,0.000009240394,0.000032298896,0.000053059503,0.85218835,0.0011819833,0.14568256,0.0005520858,0.000012936099],"about_ca_topic_score_codex":0.0025287792,"about_ca_topic_score_gemma":0.0026031258,"teacher_disagreement_score":0.0035627817,"about_ca_system_score_codex":0.0022319888,"about_ca_system_score_gemma":0.00096640846,"threshold_uncertainty_score":0.016194284},"labels":[],"label_agreement":null},{"id":"W2888756410","doi":"10.1109/mnet.2017.1700058","title":"Exploiting Hotspot-2.0 for Traffic Offloading in Mobile Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Network","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China; VMware","keywords":"Hotspot (geology); Computer science; Computer network; Mobile computing; Cellular network; Mobile telephony; Mobile radio","score_opus":0.027726685487607396,"score_gpt":0.26212500325603616,"score_spread":0.23439831776842876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888756410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.697121,0.0006780521,0.27145457,0.00025206458,0.0003184299,0.00029117704,0.00020497067,0.010553628,0.019126048],"genre_scores_gemma":[0.98174644,0.00007332387,0.016613666,0.00006528661,0.000032691452,0.00003987352,0.00008286028,0.00007199548,0.001273918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995254,0.00011656494,0.000018330273,0.000071076494,0.00011119385,0.00015742189],"domain_scores_gemma":[0.99913955,0.00022651727,0.00006766746,0.0002803385,0.0001831711,0.0001027536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678166,0.0006346001,0.00033967223,0.00070498086,0.00052025064,0.00070360524,0.00092024833,0.00045135364,0.0019589607],"category_scores_gemma":[0.0011314001,0.0002454701,0.00019780945,0.00053323846,0.0005246343,0.0009403299,0.0008706241,0.00037223948,0.00033432068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015565986,0.0008644809,0.021225141,0.00042952652,0.00016921318,0.0012468105,0.0008617037,0.22433668,0.27595437,0.020387698,0.013345203,0.4396226],"study_design_scores_gemma":[0.00009291292,0.0009091883,0.009285282,0.000026284184,0.00006794213,0.0009731783,0.00025765417,0.8779898,0.09153719,0.0067318478,0.012040734,0.00008804212],"about_ca_topic_score_codex":0.0021483544,"about_ca_topic_score_gemma":0.0047256323,"teacher_disagreement_score":0.0021483544,"about_ca_system_score_codex":0.00048495102,"about_ca_system_score_gemma":0.0004325944,"threshold_uncertainty_score":0.0065534115},"labels":[],"label_agreement":null},{"id":"W2889144536","doi":"10.1109/tsc.2018.2867437","title":"Integrating Social Networks with Mobile Device-to-Device Services","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Cellular traffic; Bluetooth; Cellular network; Exploit; Mobile device; Mobile social network; Mobile computing; Computer security; World Wide Web; Telecommunications; Wireless","score_opus":0.015219584714113974,"score_gpt":0.25955373786770713,"score_spread":0.24433415315359316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889144536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34985855,0.0061191577,0.5910604,0.004223167,0.000682807,0.000654109,0.00065305695,0.0022132446,0.044535592],"genre_scores_gemma":[0.964563,0.00089160656,0.03200319,0.00015210868,0.00011331949,0.00007226336,0.0001375677,0.000035232995,0.002031582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850696,0.0007732138,0.000041310515,0.00019217064,0.00032682627,0.00015945749],"domain_scores_gemma":[0.9982686,0.0008432503,0.00015037981,0.00029187772,0.0003018298,0.0001440512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010812398,0.00096904224,0.000544241,0.0010821873,0.0009543788,0.0016754854,0.0009586781,0.0007273067,0.0014988355],"category_scores_gemma":[0.0039066616,0.00025310254,0.00049886224,0.0012563935,0.0008097652,0.0026792218,0.0026983311,0.00079776434,0.00038164938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005152054,0.00078026287,0.036652908,0.0007629979,0.00043314957,0.002096633,0.001522057,0.33454496,0.020298043,0.10943935,0.009459412,0.48349503],"study_design_scores_gemma":[0.000022002101,0.00027481536,0.0062603247,0.00006361064,0.00010306225,0.0005164936,0.00096235186,0.914261,0.003576978,0.04829078,0.025608078,0.000060497798],"about_ca_topic_score_codex":0.008371023,"about_ca_topic_score_gemma":0.00914962,"teacher_disagreement_score":0.008371023,"about_ca_system_score_codex":0.0009508527,"about_ca_system_score_gemma":0.00074899907,"threshold_uncertainty_score":0.016644597},"labels":[],"label_agreement":null},{"id":"W2906851779","doi":"10.1109/iaeac.2018.8577654","title":"Transmission Security Platform for Transportation Information based on BeiDou Navigation Satellite System","year":2018,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Satellite; Computer science; Satellite broadcasting; Transmission (telecommunications); Satellite navigation; Remote sensing; Telecommunications; Global Positioning System; Real-time computing; Engineering; Aerospace engineering; Geology","score_opus":0.013346698237665574,"score_gpt":0.23155346142457764,"score_spread":0.21820676318691207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906851779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38536,0.0005078898,0.56981057,0.0011268737,0.00019084741,0.00033879085,0.00018144563,0.0013454892,0.041138157],"genre_scores_gemma":[0.9774343,0.00022821498,0.016243523,0.000043060223,0.000021433814,0.0001037093,0.00009009596,0.000015103688,0.005820459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997377,0.00005054117,0.0000119175,0.000045500437,0.00008792011,0.000066450004],"domain_scores_gemma":[0.99984324,0.00003384689,0.00002400287,0.000031800515,0.000046923233,0.000020145359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022672991,0.0003074079,0.0002289579,0.00041948375,0.00093952386,0.0007552728,0.00041164926,0.00039336554,0.0032069723],"category_scores_gemma":[0.0004403791,0.00013515068,0.00033383653,0.0002331263,0.0004068819,0.0015271774,0.00080265396,0.00039982895,0.00034351033],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007094973,0.0001905859,0.0064824303,0.00037195635,0.000078957324,0.0029345201,0.0013588242,0.18858193,0.11235057,0.5611021,0.009547352,0.11629128],"study_design_scores_gemma":[0.00012802302,0.0007719164,0.003085886,0.00007786731,0.00011040716,0.0011619919,0.0005026938,0.8620969,0.039988134,0.06271418,0.029279485,0.00008259917],"about_ca_topic_score_codex":0.0022791633,"about_ca_topic_score_gemma":0.0014716288,"teacher_disagreement_score":0.0032069723,"about_ca_system_score_codex":0.00075840764,"about_ca_system_score_gemma":0.0009076811,"threshold_uncertainty_score":0.010728359},"labels":[],"label_agreement":null},{"id":"W2910043623","doi":"10.1007/978-3-030-10546-4_4","title":"Deep Reinforcement Learning for Mobile Social Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reinforcement learning; Leverage (statistics); Exploit; Mobile edge computing; Mobile social network; Distributed computing; Scheme (mathematics); Mobile device; Computation; Artificial intelligence; Social network (sociolinguistics); Cellular network; Enhanced Data Rates for GSM Evolution; Computer network; Mobile computing; Computer security; Social media; World Wide Web","score_opus":0.008181572318135724,"score_gpt":0.19463869922975574,"score_spread":0.18645712691162003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910043623","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018727703,0.0032458066,0.9697165,0.0015543458,0.0002465639,0.00002734939,0.00017651233,0.00053110666,0.0057741595],"genre_scores_gemma":[0.85339785,0.0033031774,0.11179743,0.00035839516,0.00040189797,0.00014832155,0.00043321587,0.00018180744,0.029977875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978954,0.00007660024,0.0000087877015,0.00004710894,0.000041373678,0.00003659985],"domain_scores_gemma":[0.99905807,0.0006696562,0.00006355142,0.00006371327,0.00009495765,0.00005008099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501721,0.00067802117,0.000877378,0.0003525174,0.0002650968,0.00083507283,0.0010828814,0.001110843,0.0033450841],"category_scores_gemma":[0.0030352569,0.00037765465,0.00032987053,0.00048008785,0.0007208315,0.0011974957,0.0011589002,0.001938742,0.00054455106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038780567,0.000046176596,0.0004870089,0.00008469218,0.00003754829,0.000037565518,0.000048113743,0.82143587,0.00046349614,0.048283927,0.0069641583,0.122072674],"study_design_scores_gemma":[0.0000021459418,0.000006376196,0.00004827437,0.000006684414,0.00000236282,0.00000404154,0.0000033401088,0.9764266,0.00006514937,0.02278854,0.0006444525,0.000002025774],"about_ca_topic_score_codex":0.0066415844,"about_ca_topic_score_gemma":0.0075280997,"teacher_disagreement_score":0.0066415844,"about_ca_system_score_codex":0.0011417957,"about_ca_system_score_gemma":0.0005303209,"threshold_uncertainty_score":0.013205886},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032907040016810114,"score_gpt":0.2986533073082599,"score_spread":0.2657462672914498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910804566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69330513,0.0027198964,0.0032438498,0.0075369924,0.00017327195,0.000063311105,0.00021410192,0.000044139222,0.2926994],"genre_scores_gemma":[0.9935781,0.0006382642,0.00024959733,0.00025051113,0.000018348203,0.00001655783,0.000018211425,0.000010159586,0.0052202763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99907184,0.00046569805,0.000025061614,0.00008850541,0.000085271786,0.00026367506],"domain_scores_gemma":[0.9992411,0.00031088095,0.00013426317,0.000065871165,0.00009526897,0.00015256029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011361804,0.0002450709,0.00015785053,0.0010211724,0.008420706,0.005536191,0.00047846526,0.00040514776,0.005578264],"category_scores_gemma":[0.0011924327,0.00014881976,0.000094225106,0.000954091,0.013278136,0.0041688564,0.004601556,0.0012301093,0.0002683416],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007798315,0.000035839952,0.012048375,0.00010747183,0.000008839139,0.0005497828,0.38296023,0.00047177562,0.00046846285,0.57555276,0.008920925,0.018797526],"study_design_scores_gemma":[0.000010054347,0.000029031047,0.008081788,0.000389159,0.000010247888,0.00045233298,0.5650754,0.00046563664,0.00046625338,0.015545601,0.40945643,0.000018019462],"about_ca_topic_score_codex":0.035741217,"about_ca_topic_score_gemma":0.04354616,"teacher_disagreement_score":0.035741217,"about_ca_system_score_codex":0.00597476,"about_ca_system_score_gemma":0.0034404802,"threshold_uncertainty_score":0.07106632},"labels":[],"label_agreement":null},{"id":"W2913871634","doi":"10.1109/iisa.2018.8633587","title":"A Flexible On-Board Unit Architecture for Sensor Data and Fleet Management Services","year":2018,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Architecture; Computer science; Dedicated short-range communications; Embedded system; On board; Software architecture; Computer network; Software; Transfer (computing); Operating system; Engineering; Wireless","score_opus":0.048499109525452805,"score_gpt":0.2923280354139768,"score_spread":0.24382892588852398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913871634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06122464,0.0008315091,0.8784939,0.0006392772,0.00038537045,0.00047271908,0.00035646584,0.016732268,0.040863868],"genre_scores_gemma":[0.69368935,0.0006694106,0.26940876,0.0005842176,0.00013847419,0.00036737788,0.0014415752,0.0008415951,0.032859154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994803,0.00009557565,0.000035007975,0.00008685224,0.00018563708,0.00011668346],"domain_scores_gemma":[0.999579,0.000036039408,0.000028694563,0.00012330008,0.00012816937,0.000104660794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044330826,0.0005609898,0.0003082875,0.0005609898,0.0006571343,0.0015659558,0.0019041381,0.00083443045,0.00642827],"category_scores_gemma":[0.0007185206,0.00031775318,0.00032520198,0.00066421117,0.00036449538,0.0018387273,0.001548654,0.00096492626,0.0027817634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011322005,0.0006806811,0.0076663326,0.00059404154,0.00020721664,0.0015229349,0.0012218317,0.08344426,0.14270839,0.097117804,0.08219351,0.58151084],"study_design_scores_gemma":[0.00012292204,0.0009562589,0.0047306297,0.00011626654,0.0001317152,0.0010079304,0.0004350714,0.621428,0.046616353,0.014576355,0.30969784,0.00018068371],"about_ca_topic_score_codex":0.00488278,"about_ca_topic_score_gemma":0.0044535943,"teacher_disagreement_score":0.00642827,"about_ca_system_score_codex":0.00068342226,"about_ca_system_score_gemma":0.00071229733,"threshold_uncertainty_score":0.0215047},"labels":[],"label_agreement":null},{"id":"W2921537655","doi":"10.1049/iet-net.2018.5106","title":"Energy aware routing for efficient green communication in opportunistic networks","year":2019,"lang":"en","type":"article","venue":"IET Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Routing protocol; Routing (electronic design automation); Overhead (engineering); Dynamic Source Routing; Link-state routing protocol; Static routing; Geographic routing; Node (physics); Distributed computing; Engineering","score_opus":0.017761572566061347,"score_gpt":0.23535436014917632,"score_spread":0.21759278758311498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921537655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043706037,0.0011580136,0.9434156,0.0004627773,0.00017135423,0.00013183142,0.000104905885,0.00034596337,0.010503529],"genre_scores_gemma":[0.90044475,0.0009899334,0.09290561,0.000182504,0.00005646296,0.0001536442,0.000115630064,0.000049011865,0.005102509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969554,0.00010184194,0.000015824658,0.00003800706,0.00009214422,0.000056659585],"domain_scores_gemma":[0.9992969,0.0003792633,0.00009868693,0.00009983613,0.00009130427,0.000034128167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006902069,0.00034394814,0.00036540203,0.00042387669,0.0006649015,0.00078494305,0.0006869766,0.00045400183,0.0008954782],"category_scores_gemma":[0.0015097708,0.00018148003,0.00025123518,0.0005382672,0.0005424127,0.0009842287,0.001031509,0.0004451435,0.00016240127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002522037,0.00015642786,0.0018314286,0.000513814,0.0001019696,0.00091250445,0.0005924688,0.5385231,0.03670006,0.22627702,0.008284521,0.18585454],"study_design_scores_gemma":[0.00002261709,0.00009873389,0.0005289925,0.000036581187,0.000022897751,0.00032464493,0.00020106055,0.91643363,0.004900048,0.06176325,0.015637064,0.0000305057],"about_ca_topic_score_codex":0.0016015894,"about_ca_topic_score_gemma":0.0034676178,"teacher_disagreement_score":0.0016015894,"about_ca_system_score_codex":0.00055345526,"about_ca_system_score_gemma":0.0008809453,"threshold_uncertainty_score":0.0040156245},"labels":[],"label_agreement":null},{"id":"W2922641481","doi":"10.1007/978-3-030-11437-4_4","title":"Design of Energy-Aware PRoPHET and Spray-and-Wait Routing Protocols for Opportunistic Networks","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science","score_opus":0.07872782037894596,"score_gpt":0.2708251965212098,"score_spread":0.19209737614226383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922641481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010690621,0.0006716447,0.9817291,0.00019686861,0.00011543745,0.00021059094,0.000064777894,0.00043533617,0.0058856597],"genre_scores_gemma":[0.52289253,0.0017450613,0.46181166,0.00025086463,0.00011399682,0.0007464752,0.00021573048,0.00015417796,0.01206945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996942,0.000052375453,0.00002308346,0.00005556573,0.00011617907,0.000058556165],"domain_scores_gemma":[0.99965847,0.00013334045,0.0000395622,0.000035784306,0.00010852823,0.000024268957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075314863,0.00057409605,0.0005313169,0.0003626065,0.0005664315,0.001054691,0.0020749588,0.00064363563,0.0021605387],"category_scores_gemma":[0.0011304966,0.00048053786,0.00041995087,0.00038724902,0.0003500054,0.0007124202,0.00085023796,0.0005626177,0.00046724718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024231986,0.00018933,0.00079057337,0.00042339272,0.00011516686,0.0002500751,0.00021305021,0.6372427,0.034490976,0.093442336,0.007860514,0.22473952],"study_design_scores_gemma":[0.000024325416,0.000114578885,0.00009973763,0.000016694412,0.000029654257,0.000103344435,0.000036814417,0.97850066,0.0046467846,0.011302838,0.005110457,0.0000140763495],"about_ca_topic_score_codex":0.0016637683,"about_ca_topic_score_gemma":0.004000398,"teacher_disagreement_score":0.0021605387,"about_ca_system_score_codex":0.0007534106,"about_ca_system_score_gemma":0.0014489493,"threshold_uncertainty_score":0.0072277784},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007866064945703086,"score_gpt":0.22707378055882735,"score_spread":0.21920771561312427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936076319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055264175,0.008325299,0.8907246,0.0008770778,0.0008007401,0.00025335472,0.000080650796,0.0006817841,0.04299237],"genre_scores_gemma":[0.80732936,0.008077069,0.16407837,0.0006007127,0.00036231012,0.00031291644,0.00017122646,0.00014433928,0.018923696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990564,0.00032713334,0.000046642803,0.000186523,0.00027904185,0.00010416199],"domain_scores_gemma":[0.999132,0.0004213281,0.00007018918,0.000110591696,0.00021262998,0.000053321593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006815234,0.00059463375,0.0006087341,0.0010571772,0.0009102208,0.001368536,0.0007870473,0.0010232428,0.0025353152],"category_scores_gemma":[0.0020088493,0.0002598473,0.00045970536,0.0011652074,0.00068206264,0.0025427432,0.0012751209,0.001260263,0.0008520197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006176142,0.00027052357,0.005481926,0.0011754533,0.00019266616,0.0028488678,0.0016917386,0.18045124,0.031474512,0.39945146,0.009511948,0.36683202],"study_design_scores_gemma":[0.00004873883,0.00074537884,0.002323692,0.00022333475,0.00015373423,0.0050118687,0.001096446,0.75406885,0.02372752,0.1133293,0.09914726,0.0001238955],"about_ca_topic_score_codex":0.00067091105,"about_ca_topic_score_gemma":0.00069544086,"teacher_disagreement_score":0.0025353152,"about_ca_system_score_codex":0.000523761,"about_ca_system_score_gemma":0.00042092075,"threshold_uncertainty_score":0.008481443},"labels":[],"label_agreement":null},{"id":"W2951233675","doi":"10.48550/arxiv.0909.4369","title":"Exploration of Periodically Varying Graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Business; Mathematics","score_opus":0.08491253895343238,"score_gpt":0.2768327009408591,"score_spread":0.19192016198742673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951233675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6338215,0.0005252179,0.3534267,0.0018369523,0.000040977768,0.00012075145,0.0006315439,0.000429768,0.009166613],"genre_scores_gemma":[0.93296653,0.00045900495,0.062141716,0.00012643998,0.00006311165,0.00012203143,0.0007151136,0.00009307473,0.0033130753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865806,0.0005205784,0.000042685657,0.00034297907,0.0001926892,0.00024294514],"domain_scores_gemma":[0.9866279,0.01036458,0.0012102991,0.0010027747,0.00032106452,0.00047340494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010549151,0.00058594864,0.00080160535,0.0007417451,0.000943279,0.0016760023,0.0016556777,0.0010666669,0.002368196],"category_scores_gemma":[0.012041225,0.0004677135,0.00097586453,0.0013617896,0.0014463355,0.0036178571,0.0016520473,0.0013862137,0.00019974302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035118472,0.0000885171,0.0033903008,0.00018962998,0.0000797746,0.0004172156,0.00047582766,0.8180704,0.003392675,0.15243332,0.0021842425,0.01892696],"study_design_scores_gemma":[0.000030644136,0.000030909054,0.00066539657,0.000011231282,0.000016252194,0.00012367868,0.00011635368,0.7907424,0.0009780333,0.20573983,0.0015324934,0.000012761239],"about_ca_topic_score_codex":0.0027740349,"about_ca_topic_score_gemma":0.0021178578,"teacher_disagreement_score":0.0027740349,"about_ca_system_score_codex":0.0014629685,"about_ca_system_score_gemma":0.00068839645,"threshold_uncertainty_score":0.010614634},"labels":[],"label_agreement":null},{"id":"W2951356300","doi":"10.48550/arxiv.1310.5788","title":"Forbidden minors for graphs with no first obstruction to parametric Feynman integration","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Feynman diagram; Combinatorics; Mathematics; Planar graph; Parametric statistics; Feynman integral; Octahedron; Graph; Discrete mathematics; Physics; Quantum mechanics; Mathematical physics","score_opus":0.06500545824141932,"score_gpt":0.17991425016358706,"score_spread":0.11490879192216774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951356300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8057004,0.00020237712,0.16617602,0.00036141917,0.000052282623,0.000097727294,0.00047065085,0.0003187637,0.026620347],"genre_scores_gemma":[0.9631834,0.00017808816,0.029155293,0.00010964392,0.000031497628,0.00013557875,0.0006370996,0.000096147065,0.00647338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996792,0.000051488907,0.0000230566,0.00006930962,0.00008113053,0.000095824136],"domain_scores_gemma":[0.99861073,0.0005401769,0.00030739722,0.00019582579,0.00017799524,0.00016791499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024046717,0.0004355519,0.00030445243,0.0008796092,0.0011414945,0.0010801577,0.0006100516,0.0006101697,0.0037874323],"category_scores_gemma":[0.0018153985,0.00030870104,0.00054770714,0.0005538962,0.0011375655,0.0016200321,0.0011116836,0.0010452723,0.00046977494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020757985,0.000074162686,0.0034319442,0.00012565164,0.000027430071,0.00090171676,0.0011448888,0.009314207,0.026418341,0.9313538,0.0026974913,0.024302766],"study_design_scores_gemma":[0.00003560834,0.00009047167,0.002745056,0.00003973166,0.00003104494,0.0011031496,0.00067669974,0.03307895,0.012944388,0.9349601,0.014256703,0.00003799877],"about_ca_topic_score_codex":0.00096733565,"about_ca_topic_score_gemma":0.0014438673,"teacher_disagreement_score":0.0037874323,"about_ca_system_score_codex":0.0005649092,"about_ca_system_score_gemma":0.00035573082,"threshold_uncertainty_score":0.012670219},"labels":[],"label_agreement":null},{"id":"W2951557894","doi":"10.48550/arxiv.1610.06468","title":"Ten Blue Links on Mars","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mars Exploration Program; Premise; Computer science; Latency (audio); Exploration of Mars; Recall; Martian; Operations research; Astrobiology; Engineering; Telecommunications; Psychology","score_opus":0.0674830938876234,"score_gpt":0.18262146944136165,"score_spread":0.11513837555373825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951557894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7411458,0.0046775937,0.029356284,0.010596,0.0011691508,0.00020877132,0.006488079,0.005392353,0.20096605],"genre_scores_gemma":[0.9318573,0.0013360349,0.014031983,0.0009624241,0.00022137736,0.00007980278,0.0045290636,0.00034492117,0.046637114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995623,0.00010056404,0.000009169047,0.00009480249,0.00011652034,0.00011663308],"domain_scores_gemma":[0.9989466,0.00032789572,0.00008964973,0.00018384724,0.00021541982,0.00023661561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047312744,0.00039824305,0.0002997538,0.00071791554,0.002831334,0.0014824261,0.0006006111,0.0010508723,0.013080513],"category_scores_gemma":[0.0027207716,0.0002198674,0.00022838818,0.0014685917,0.0004695694,0.0020707115,0.0014404127,0.0011572983,0.003299578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022889352,0.0004279323,0.0309146,0.00085274543,0.00022095762,0.0017318892,0.006598939,0.072629526,0.015407379,0.053432893,0.3036906,0.5118035],"study_design_scores_gemma":[0.00011605993,0.0008061093,0.022863835,0.00023845585,0.00011909479,0.0010836133,0.008478264,0.093919255,0.009069046,0.034818918,0.828364,0.00012326492],"about_ca_topic_score_codex":0.015485515,"about_ca_topic_score_gemma":0.030370422,"teacher_disagreement_score":0.015485515,"about_ca_system_score_codex":0.00077875215,"about_ca_system_score_gemma":0.0006584147,"threshold_uncertainty_score":0.04375863},"labels":[],"label_agreement":null},{"id":"W2952324612","doi":"10.48550/arxiv.1506.04729","title":"Optimal Forwarding in Opportunistic Delay Tolerant Networks with Meeting Rate Estimations","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Computer network; Distributed computing; A priori and a posteriori; Node (physics); Network topology; Telecommunications","score_opus":0.08570599335468317,"score_gpt":0.20132700938346365,"score_spread":0.11562101602878049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952324612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12136309,0.0003242478,0.87622476,0.00025393307,0.000023482273,0.00007805486,0.00019106426,0.00033022263,0.0012111329],"genre_scores_gemma":[0.91571563,0.00019954976,0.08278609,0.000044461285,0.000024571189,0.00009676311,0.00022525748,0.000045366018,0.0008623481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910396,0.00034751766,0.00005057536,0.0002349631,0.00016198985,0.00010095649],"domain_scores_gemma":[0.9920615,0.0059334245,0.0011428415,0.0004043846,0.00032731483,0.00013041767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025505181,0.00072885293,0.0010122196,0.0010033537,0.0007307614,0.00090798945,0.0017265872,0.00095626287,0.0006713716],"category_scores_gemma":[0.0145213995,0.00062962837,0.00043867072,0.00095692236,0.0010098264,0.0017633161,0.0010616321,0.00074974145,0.00015041816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054823053,0.000022437904,0.0009876812,0.000037548012,0.000014615793,0.00004588674,0.00006193348,0.98107153,0.00071769767,0.0055096974,0.00027257673,0.011203476],"study_design_scores_gemma":[0.0000075947296,0.000012146523,0.00018051629,0.0000029694004,0.000003602843,0.000019630199,0.000020889462,0.9912452,0.00039309025,0.007948663,0.0001600114,0.0000056410504],"about_ca_topic_score_codex":0.0061100004,"about_ca_topic_score_gemma":0.0043174685,"teacher_disagreement_score":0.0061100004,"about_ca_system_score_codex":0.0014056413,"about_ca_system_score_gemma":0.00117035,"threshold_uncertainty_score":0.013488531},"labels":[],"label_agreement":null},{"id":"W2952844013","doi":"10.48550/arxiv.1012.0009","title":"Time-Varying Graphs and Dynamic Networks","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Formalism (music); Randomness; Theoretical computer science; Formal description; Property (philosophy); Data science; Epistemology; Mathematics","score_opus":0.031401256821180994,"score_gpt":0.17325099783572334,"score_spread":0.14184974101454234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952844013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07198901,0.011472634,0.8828833,0.0063049416,0.00025825124,0.00007502542,0.0004988982,0.00032418323,0.02619375],"genre_scores_gemma":[0.8612797,0.010314849,0.120929286,0.0007384894,0.0005608326,0.00015266638,0.00034171966,0.000080570004,0.005601776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916565,0.00034871043,0.000035083605,0.0002407324,0.00014522349,0.00006459432],"domain_scores_gemma":[0.9940502,0.004323985,0.0006827987,0.00047575176,0.0002625079,0.00020477289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015241904,0.00054255046,0.00044229478,0.0021975092,0.00078307715,0.0019512353,0.0008596759,0.0011715837,0.0019261781],"category_scores_gemma":[0.0057982425,0.00026003318,0.0006807564,0.0029566418,0.003974523,0.004816168,0.001034052,0.0017742486,0.00017252813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007566524,0.000006799595,0.00053690316,0.000047562244,0.000010770516,0.000039028346,0.00016796218,0.014279673,0.00024180212,0.9764549,0.00050631573,0.0077007753],"study_design_scores_gemma":[0.0000052824926,0.000014481532,0.00073025527,0.000025372821,0.000010518342,0.00008978194,0.00014982958,0.04323773,0.00016962831,0.9442932,0.011260932,0.00001290146],"about_ca_topic_score_codex":0.0028821854,"about_ca_topic_score_gemma":0.0022779992,"teacher_disagreement_score":0.0028821854,"about_ca_system_score_codex":0.002115473,"about_ca_system_score_gemma":0.0005267258,"threshold_uncertainty_score":0.015348911},"labels":[],"label_agreement":null},{"id":"W2954340273","doi":"10.1109/uemcon47517.2019.8993022","title":"A Hierarchical P2P Overlay for Hierarchical Mobile Ad hoc Networks (MANETs)","year":2019,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Overlay network; Overlay; Distributed computing; Mobile ad hoc network; Underlay; Network topology; Software deployment; Wireless ad hoc network; Vehicular ad hoc network; Topology (electrical circuits); Wireless; The Internet; Telecommunications; Engineering","score_opus":0.011526237475755314,"score_gpt":0.24165261374901198,"score_spread":0.23012637627325666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954340273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027564444,0.00071977574,0.9594485,0.0005165468,0.0001937893,0.0003678041,0.0002540294,0.0017479854,0.0091871675],"genre_scores_gemma":[0.49030015,0.00074133836,0.50470424,0.00014946832,0.00007462515,0.00023249038,0.0004597207,0.000078453304,0.0032594714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965334,0.000083784864,0.00002432681,0.00005924692,0.00014030829,0.00003905465],"domain_scores_gemma":[0.99961144,0.000078824356,0.00003620656,0.00009548697,0.000115186725,0.000062767525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003766874,0.00036179123,0.00026415347,0.00050022476,0.00096459175,0.0007496518,0.0008074097,0.0005095978,0.0009952859],"category_scores_gemma":[0.0012503029,0.00019210804,0.0002868973,0.00065734034,0.00043487604,0.0011549003,0.0014285349,0.000745192,0.0004274949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024438198,0.00033516687,0.0031844648,0.00092956185,0.000120828074,0.0021096931,0.00082735973,0.32756025,0.1113302,0.16185859,0.032616545,0.3588829],"study_design_scores_gemma":[0.00004604388,0.00028638483,0.0013600665,0.0000464511,0.000066412606,0.0010850227,0.0002783926,0.8844141,0.016133556,0.034066524,0.062157393,0.00005969412],"about_ca_topic_score_codex":0.0038607991,"about_ca_topic_score_gemma":0.006122694,"teacher_disagreement_score":0.0038607991,"about_ca_system_score_codex":0.00050329097,"about_ca_system_score_gemma":0.0010501131,"threshold_uncertainty_score":0.007676661},"labels":[],"label_agreement":null},{"id":"W2956370112","doi":"10.1109/icc.2019.8761511","title":"Big Data Analytics for User Association Characterization in Large-Scale WiFi System","year":2019,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Big data; Analytics; Scale (ratio); Association (psychology); Data science; Data mining","score_opus":0.04513756551583335,"score_gpt":0.24627468799858296,"score_spread":0.20113712248274962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956370112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6302467,0.0020974479,0.22386079,0.0034346725,0.00034048528,0.00059704756,0.12208715,0.012896511,0.004439226],"genre_scores_gemma":[0.8025147,0.0005217265,0.095512964,0.0002589822,0.00019644898,0.00040015098,0.09956514,0.00017119704,0.0008587726],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804294,0.0003473483,0.000252966,0.0005434686,0.0005899489,0.00022328431],"domain_scores_gemma":[0.9936212,0.0024770857,0.0010275354,0.0014061257,0.0009435326,0.0005245548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017434318,0.0017608879,0.0011056324,0.0055421535,0.00090185826,0.0016874702,0.0017342658,0.0014412634,0.00084252993],"category_scores_gemma":[0.00845293,0.00049381936,0.0010446691,0.0064680106,0.00055786734,0.0028534336,0.0018061959,0.0016837929,0.00073322584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008363181,0.0014534215,0.47109014,0.00074170955,0.00083077827,0.0016100266,0.0010224986,0.24022879,0.012088703,0.0064600795,0.038699597,0.22493795],"study_design_scores_gemma":[0.00002531452,0.00013827556,0.1074475,0.000051839586,0.00005962138,0.00039157696,0.00091699127,0.8690147,0.004207312,0.009472503,0.008207257,0.00006715313],"about_ca_topic_score_codex":0.012283748,"about_ca_topic_score_gemma":0.01190441,"teacher_disagreement_score":0.012283748,"about_ca_system_score_codex":0.0009681724,"about_ca_system_score_gemma":0.00086791354,"threshold_uncertainty_score":0.024424493},"labels":[],"label_agreement":null},{"id":"W2957462724","doi":"10.18280/isi.240113","title":"Storage Allocation Plan for Routing Nodes in Delay Tolerant Network","year":2019,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"People's Government of Jilin Province","keywords":"Computer network; Computer science; Plan (archaeology); Routing (electronic design automation); Distributed computing; Geography","score_opus":0.01667660059119405,"score_gpt":0.222727222751293,"score_spread":0.20605062216009895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957462724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10665141,0.00032901997,0.8880936,0.00024769994,0.00008521258,0.00012306625,0.00015535444,0.00035097852,0.003963755],"genre_scores_gemma":[0.9136876,0.00018885643,0.08317332,0.000060540173,0.000020207373,0.00010078723,0.00012796068,0.000034998353,0.0026057453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995902,0.00009938487,0.000028977865,0.000097295706,0.00010029923,0.00008380402],"domain_scores_gemma":[0.9996792,0.00008326068,0.000049246883,0.000050841216,0.00010481312,0.000032628617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006883119,0.00044038016,0.0003395398,0.00051216537,0.0007880042,0.0008266962,0.00082947774,0.00034313198,0.0015871283],"category_scores_gemma":[0.0011413688,0.00018612547,0.00018079713,0.0005980016,0.0004351311,0.0013970861,0.00059907685,0.00026707127,0.00017745642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044737908,0.00008573138,0.0022764832,0.00010505331,0.000035150282,0.00017755335,0.00033943303,0.80054617,0.022179639,0.052876897,0.0035737683,0.11735675],"study_design_scores_gemma":[0.000025180716,0.00010086118,0.0005212955,0.000009728699,0.00002367134,0.00011977242,0.00016118523,0.9600739,0.008847803,0.027186755,0.0028985704,0.000031353513],"about_ca_topic_score_codex":0.0031231702,"about_ca_topic_score_gemma":0.003330163,"teacher_disagreement_score":0.0031231702,"about_ca_system_score_codex":0.0010261148,"about_ca_system_score_gemma":0.0012722871,"threshold_uncertainty_score":0.0074449778},"labels":[],"label_agreement":null},{"id":"W2961901264","doi":"10.1109/tcc.2019.2926702","title":"Quantifying the Influence of Intermittent Connectivity on Mobile Edge Computing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China; Natural Science Foundation of Guangdong Province; China Postdoctoral Science Foundation","keywords":"Computer science; Mobile edge computing; Distributed computing; Edge computing; Enhanced Data Rates for GSM Evolution; Task (project management); Cloud computing; Mobile computing; Software deployment; Mobile cloud computing; Key (lock); Markov chain; Computer network; Artificial intelligence; Computer security; Machine learning","score_opus":0.031585158470400436,"score_gpt":0.2763040435565951,"score_spread":0.24471888508619466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961901264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8417381,0.0008308354,0.1490436,0.00066936173,0.000048328093,0.00006306671,0.00014918817,0.00014357579,0.007313924],"genre_scores_gemma":[0.9974821,0.00012980578,0.0021667273,0.00001638079,0.00000900068,0.000008299006,0.000019276087,0.000008781077,0.00015952977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.00027270897,0.000032782253,0.00009787289,0.00019131688,0.00020678654],"domain_scores_gemma":[0.9888571,0.008607075,0.0011020959,0.00053598394,0.0006170856,0.00028066858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013091611,0.00050099613,0.00038410563,0.00071758515,0.00049745664,0.001068797,0.0006972515,0.0006674118,0.0008663863],"category_scores_gemma":[0.01411141,0.00026855888,0.00021153332,0.0007387481,0.00086109876,0.0020502089,0.0010460643,0.0006265467,0.000086104366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007544801,0.000048033293,0.006559881,0.000055722146,0.000021525333,0.00018135703,0.00011352659,0.9709918,0.0034003844,0.011579165,0.00033467516,0.0066383905],"study_design_scores_gemma":[0.000003182481,0.00004387263,0.0013597979,0.000007209562,0.000010251624,0.000056884062,0.00005858921,0.99366575,0.0007303066,0.003832614,0.00022422623,0.000007227061],"about_ca_topic_score_codex":0.005536194,"about_ca_topic_score_gemma":0.004265394,"teacher_disagreement_score":0.005536194,"about_ca_system_score_codex":0.0013213262,"about_ca_system_score_gemma":0.0008678309,"threshold_uncertainty_score":0.011007965},"labels":[],"label_agreement":null},{"id":"W2964284010","doi":"10.1109/iwcmc.2019.8766720","title":"Cluster Aware Mobility Encounter Dataset Enlargement","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Gnowit (Canada)","funders":"","keywords":"Computer science; Cluster (spacecraft); Data mining; Synthetic data; Statistical model; Machine learning; Artificial intelligence","score_opus":0.02944996651813995,"score_gpt":0.2767360278044718,"score_spread":0.24728606128633188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964284010","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3537333,0.00075620983,0.088914886,0.0024762698,0.001123736,0.0025694612,0.52258766,0.012496253,0.015342208],"genre_scores_gemma":[0.34191224,0.00029582574,0.054361846,0.00028167368,0.000109105764,0.0012576862,0.59837973,0.00029002287,0.003111892],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985044,0.00027520934,0.00019318463,0.00036841884,0.00047663736,0.0001822558],"domain_scores_gemma":[0.9974611,0.00046861556,0.0002077884,0.00085970026,0.0007605845,0.00024230915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012576089,0.0006610583,0.0005489112,0.0016941798,0.0007804526,0.00089432497,0.0019595537,0.0011871662,0.001976536],"category_scores_gemma":[0.005768182,0.00019246664,0.000716174,0.0026857085,0.00034295407,0.0012080473,0.0014282118,0.0010529206,0.0011432992],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019234281,0.0016065456,0.0861979,0.002085754,0.00059918035,0.0017818448,0.0009922142,0.17006333,0.017112195,0.022708805,0.50870824,0.18622056],"study_design_scores_gemma":[0.00041856922,0.00078264833,0.081273556,0.00024014736,0.00017715294,0.0022243692,0.0016428443,0.46922693,0.026748288,0.014701138,0.40231273,0.0002516389],"about_ca_topic_score_codex":0.0062048165,"about_ca_topic_score_gemma":0.008768919,"teacher_disagreement_score":0.0062048165,"about_ca_system_score_codex":0.0008878515,"about_ca_system_score_gemma":0.0012104893,"threshold_uncertainty_score":0.012337387},"labels":[],"label_agreement":null},{"id":"W2964324021","doi":"10.1007/s12652-019-01337-8","title":"Pareto set based optimized routing in opportunistic network","year":2019,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Node (physics); Forwarder; Dynamic Source Routing; Geographic routing; Routing (electronic design automation)","score_opus":0.043042037318494285,"score_gpt":0.272122891674471,"score_spread":0.22908085435597672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964324021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06706402,0.00048434414,0.92103446,0.0003824067,0.00011663123,0.00016603807,0.0001590033,0.00024904546,0.010343978],"genre_scores_gemma":[0.8743641,0.00043352955,0.114518344,0.00018528546,0.00006783917,0.00022972228,0.00019299153,0.00011834137,0.009889825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884653,0.0004862882,0.00003991792,0.00013029747,0.00026283186,0.00023417786],"domain_scores_gemma":[0.9975643,0.001638593,0.00020035988,0.00011403279,0.0003079687,0.00017464437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002583278,0.0010741169,0.0022047511,0.0017998907,0.0010777012,0.0020622567,0.0022506285,0.0014240971,0.0032781402],"category_scores_gemma":[0.004068667,0.0007922344,0.0008995381,0.0016719738,0.001158196,0.0015506513,0.0017028627,0.00093826174,0.00031498584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057098227,0.00004662551,0.00018987873,0.000029696732,0.000028840543,0.000027921109,0.000032435728,0.9749674,0.00030825826,0.01566578,0.0007785198,0.007867456],"study_design_scores_gemma":[0.0000044657704,0.000015619808,0.000033166678,0.0000032303426,0.000004492224,0.0000056228087,0.000009788526,0.9953732,0.00004660528,0.0043776976,0.00012344218,0.0000026037455],"about_ca_topic_score_codex":0.005741467,"about_ca_topic_score_gemma":0.0063600317,"teacher_disagreement_score":0.005741467,"about_ca_system_score_codex":0.0027810626,"about_ca_system_score_gemma":0.0020850266,"threshold_uncertainty_score":0.02017814},"labels":[],"label_agreement":null},{"id":"W2968301960","doi":"10.1109/stict.2019.8789379","title":"A new routing metric for real-time applications in smart cities","year":2019,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Routing (electronic design automation); Geographic routing; Computer network; Node (physics); Metric (unit); Static routing; Metrics; Dynamic Source Routing; Link-state routing protocol; Policy-based routing; Transmission delay; Routing table; Distributed computing; Destination-Sequenced Distance Vector routing; Multipath routing; Network packet; Routing protocol; Engineering","score_opus":0.017353072456296154,"score_gpt":0.24512273645717475,"score_spread":0.22776966400087859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968301960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049489653,0.0005993287,0.99221075,0.00019486657,0.0001519663,0.000029692515,0.00003982045,0.00011787591,0.0017067735],"genre_scores_gemma":[0.31315255,0.0018066124,0.6809598,0.00015515939,0.00015327614,0.00016350523,0.00025258987,0.00009896554,0.003257449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992409,0.00026306254,0.000053664324,0.000101464735,0.00030356352,0.000037413818],"domain_scores_gemma":[0.999169,0.000277616,0.00012524858,0.00007122631,0.0003177033,0.00003917864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089605,0.000756612,0.0004969408,0.00107974,0.000445207,0.000992948,0.0008251211,0.00079189177,0.0008033036],"category_scores_gemma":[0.0025676005,0.00020403304,0.0005015984,0.0015248001,0.0005139731,0.0023124097,0.0006643482,0.00067693385,0.00024894945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049290207,0.000046834848,0.0011850958,0.00023622642,0.000042345102,0.000088742854,0.00011090244,0.7551929,0.007599046,0.11696994,0.0050818077,0.11339687],"study_design_scores_gemma":[0.000004071689,0.000041452957,0.00018389263,0.0000081898,0.000007126307,0.00008803453,0.000021043266,0.98415726,0.0011185389,0.008731872,0.005625765,0.000012849024],"about_ca_topic_score_codex":0.0016631205,"about_ca_topic_score_gemma":0.0020647803,"teacher_disagreement_score":0.0016631205,"about_ca_system_score_codex":0.00087388215,"about_ca_system_score_gemma":0.0011131522,"threshold_uncertainty_score":0.006340444},"labels":[],"label_agreement":null},{"id":"W2979425925","doi":"10.1049/iet-com.2019.0657","title":"T_CAFE: A Trust based Security approach for Opportunistic IoT","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Identifier; Network packet; Internet of Things; Routing protocol; Computer security; Unique identifier; The Internet; Latency (audio); Telecommunications; World Wide Web","score_opus":0.04525479578256403,"score_gpt":0.27883538552086534,"score_spread":0.23358058973830131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979425925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03251946,0.00070299796,0.9574054,0.000959534,0.00016397706,0.00047507335,0.000074915035,0.0007830877,0.0069155204],"genre_scores_gemma":[0.89558226,0.00048288272,0.09982538,0.0002465524,0.000067548266,0.00021113938,0.00008276164,0.000035782803,0.003465664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819213,0.000542912,0.00016738854,0.0002550867,0.000558889,0.0002835241],"domain_scores_gemma":[0.9975291,0.00064977555,0.0004930256,0.0005816623,0.00045733922,0.00028908034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017731839,0.000501352,0.0007018694,0.0009240175,0.0015379493,0.0015690603,0.0016726444,0.0016311177,0.0012350644],"category_scores_gemma":[0.004623776,0.00025514068,0.0008268566,0.0005511012,0.0015463282,0.004114868,0.0029624712,0.0014571804,0.00031229528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084529555,0.00057083956,0.007013637,0.00075353996,0.00044306478,0.0028953901,0.0027385396,0.17474833,0.052163035,0.40714705,0.013439311,0.33724192],"study_design_scores_gemma":[0.000095369185,0.0007015227,0.0011573612,0.000116010895,0.00014324284,0.0022253876,0.000620341,0.8563299,0.014945299,0.089106776,0.034390125,0.00016857155],"about_ca_topic_score_codex":0.0026899483,"about_ca_topic_score_gemma":0.0022391523,"teacher_disagreement_score":0.0026899483,"about_ca_system_score_codex":0.0013718774,"about_ca_system_score_gemma":0.0017300401,"threshold_uncertainty_score":0.009953678},"labels":[],"label_agreement":null},{"id":"W3000506826","doi":"10.1109/indis49552.2019.00006","title":"SCinet DTN-as-a-Service Framework","year":2019,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada)","funders":"","keywords":"Computer science; Workflow; Provisioning; Software-defined networking; Virtualization; Debugging; Wide area network; Modular design; Data transmission; Computer network; Distributed computing; Operating system; Cloud computing; Database","score_opus":0.011652985969701048,"score_gpt":0.2362722193511522,"score_spread":0.22461923338145115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000506826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086542545,0.00056653423,0.7601378,0.0014023114,0.00059986353,0.0007549048,0.008202162,0.17315122,0.04653092],"genre_scores_gemma":[0.25665274,0.0018184745,0.58189166,0.003105423,0.00032417843,0.0030931095,0.06381261,0.038869556,0.050432242],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871385,0.00021156644,0.00012191184,0.00020255173,0.00052726857,0.00022277632],"domain_scores_gemma":[0.9989272,0.00021761861,0.000070505295,0.00027665083,0.00029077294,0.00021726917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025056314,0.0012366364,0.00078941527,0.0009915654,0.00090690097,0.0031868645,0.003985025,0.0014068392,0.0152533045],"category_scores_gemma":[0.00373798,0.00065597857,0.0015349655,0.0008995553,0.000843066,0.0036193498,0.0035267249,0.0035457134,0.007452382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024812766,0.0005773233,0.0036367672,0.0011209425,0.00022820638,0.0010488908,0.00067089323,0.15149617,0.027764829,0.27486378,0.38192335,0.15418762],"study_design_scores_gemma":[0.00028050595,0.00013704615,0.0007046614,0.00011233465,0.000043538956,0.00028193218,0.0001087525,0.5571927,0.011095945,0.04972388,0.38016656,0.00015213845],"about_ca_topic_score_codex":0.013033378,"about_ca_topic_score_gemma":0.008305981,"teacher_disagreement_score":0.0152533045,"about_ca_system_score_codex":0.0027363903,"about_ca_system_score_gemma":0.003370778,"threshold_uncertainty_score":0.051027417},"labels":[],"label_agreement":null},{"id":"W3002955662","doi":"10.1145/1066328.1071915","title":"A Concise Guide to the Major Internet Bodies","year":2005,"lang":"en","type":"article","venue":"Ubiquity","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"The Internet; Computer science; World Wide Web","score_opus":0.02087166387250317,"score_gpt":0.2759323128286866,"score_spread":0.2550606489561834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002955662","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012166351,0.09321522,0.02937543,0.031352755,0.027448177,0.0013154536,0.008395119,0.0048091253,0.8028721],"genre_scores_gemma":[0.003056777,0.04430498,0.022545349,0.011218266,0.0051455097,0.0008738866,0.006915626,0.0010255547,0.904914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990395,0.00022139325,0.00010659412,0.000111534035,0.0004185826,0.00010231122],"domain_scores_gemma":[0.99804735,0.0004523509,0.0001729829,0.00017039933,0.0008399484,0.00031691778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011977296,0.0016062473,0.0008099461,0.0041416488,0.001894871,0.005278336,0.0013987375,0.0023033065,0.14560062],"category_scores_gemma":[0.004223165,0.00083726464,0.00039149838,0.0045600035,0.00089291163,0.007281425,0.0025680596,0.0036940954,0.22953023],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001556714,0.000049352577,0.00010280536,0.00016465502,0.0000014805116,0.000051902345,0.00011182855,0.000100359925,0.00030856425,0.012214403,0.8859286,0.10095055],"study_design_scores_gemma":[0.0000010406421,0.0000046915816,0.00006248294,0.00008751694,3.648788e-7,0.000045970293,0.000041695155,0.000023312346,0.000022774664,0.0012092718,0.99849856,0.000002339057],"about_ca_topic_score_codex":0.0025651788,"about_ca_topic_score_gemma":0.0054657306,"teacher_disagreement_score":0.14560062,"about_ca_system_score_codex":0.0010699547,"about_ca_system_score_gemma":0.0032052607,"threshold_uncertainty_score":0.4870826},"labels":[],"label_agreement":null},{"id":"W3003275070","doi":"10.1109/icpads47876.2019.00137","title":"An Adaptive Probability Prediction Routing Scheme in Urban DTNs","year":2019,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Node (physics); Predictability; Computer network; Routing protocol; Latency (audio); Routing (electronic design automation); Overhead (engineering); Geographic routing; Dynamic Source Routing; Zone Routing Protocol; Scheme (mathematics); Distributed computing; Mathematics; Engineering","score_opus":0.02378600007173991,"score_gpt":0.23061001339171147,"score_spread":0.20682401331997155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003275070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04463094,0.00088333787,0.94975936,0.0004426084,0.00017242832,0.00010841584,0.00012949247,0.0006333476,0.0032400133],"genre_scores_gemma":[0.93344057,0.00064807816,0.063421056,0.000120058365,0.000076767625,0.000094837145,0.0001714219,0.00002583886,0.0020013356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995921,0.00010212551,0.0000251165,0.000098616256,0.000121112455,0.000060930128],"domain_scores_gemma":[0.99949944,0.00018941205,0.00008609108,0.00007419605,0.00011201058,0.000038769598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065281405,0.00049529277,0.0005686545,0.00059974904,0.0008706129,0.00050990516,0.0012731089,0.00048839406,0.0006768097],"category_scores_gemma":[0.0016985356,0.00023261739,0.00033898605,0.0008452781,0.00053112704,0.0011374712,0.001061399,0.00053589855,0.00016863988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017112121,0.00004564187,0.0014746479,0.00011403752,0.000044903634,0.0002677857,0.0002270428,0.8084876,0.008866518,0.030033087,0.0044520213,0.14581564],"study_design_scores_gemma":[0.000009150462,0.00006154515,0.00023469533,0.000006625194,0.000013630065,0.00011594542,0.000036581012,0.9905571,0.0008819846,0.0060901125,0.0019751957,0.000017451817],"about_ca_topic_score_codex":0.0055227866,"about_ca_topic_score_gemma":0.0058701425,"teacher_disagreement_score":0.0055227866,"about_ca_system_score_codex":0.0007487469,"about_ca_system_score_gemma":0.00082564214,"threshold_uncertainty_score":0.010981262},"labels":[],"label_agreement":null},{"id":"W3006670546","doi":"10.48550/arxiv.2002.05884","title":"Performance Modeling of Epidemic Routing in Mobile Social Networks with Emphasis on Scalability","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scalability; Routing (electronic design automation); Node (physics); Ordinary differential equation; Static routing; Ode; Independent and identically distributed random variables; Routing protocol; Dynamic Source Routing; Computer network; Event (particle physics); Class (philosophy); Distributed computing; Random variable; Differential equation; Mathematics; Artificial intelligence; Engineering; Statistics","score_opus":0.09232007450649359,"score_gpt":0.20066974969585138,"score_spread":0.1083496751893578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006670546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26002562,0.00099383,0.7239967,0.0012348627,0.000100213736,0.00012574259,0.00029134267,0.00038374128,0.012847897],"genre_scores_gemma":[0.98780096,0.00035688095,0.009504413,0.000051062027,0.000032178934,0.000060599385,0.000063796426,0.000023621098,0.0021064994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993755,0.00024806068,0.000024503082,0.00010679209,0.00014158842,0.00010355423],"domain_scores_gemma":[0.9986045,0.00083462737,0.00020428178,0.00008410591,0.00021648554,0.000055990666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012456124,0.00089281803,0.0006252454,0.0006388044,0.00044449177,0.0009675029,0.0009880959,0.0010059098,0.00078127004],"category_scores_gemma":[0.004369108,0.0003275665,0.0005119726,0.00060433144,0.0008112407,0.0015566057,0.0007913132,0.00056855695,0.00014235581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010978168,0.000009345286,0.00040673072,0.000011056096,0.0000076091205,0.00004293182,0.000025774929,0.99051476,0.0005599872,0.006914537,0.00012342255,0.001372783],"study_design_scores_gemma":[8.5308807e-7,0.000005012691,0.00006434229,0.0000010084469,0.0000015083965,0.0000061625233,0.0000043441505,0.998351,0.00005276163,0.0014597152,0.000051699993,0.000001577211],"about_ca_topic_score_codex":0.0066720787,"about_ca_topic_score_gemma":0.0024766899,"teacher_disagreement_score":0.0066720787,"about_ca_system_score_codex":0.0016902616,"about_ca_system_score_gemma":0.0007316261,"threshold_uncertainty_score":0.013266504},"labels":[],"label_agreement":null},{"id":"W3009032439","doi":"10.1002/dac.4364","title":"Message trust‐based secure multipath routing protocol for opportunistic networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Communication source; Encryption; Latency (audio); Routing protocol; Multipath propagation; Routing (electronic design automation); Multipath routing; Disjoint sets; Wireless Routing Protocol; Telecommunications; Channel (broadcasting)","score_opus":0.08319818159866635,"score_gpt":0.34025056688206723,"score_spread":0.2570523852834009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009032439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0751924,0.0011854575,0.9138253,0.00071602594,0.00028777705,0.00037052916,0.00022713467,0.0017756697,0.006419778],"genre_scores_gemma":[0.9278319,0.00035912526,0.068602085,0.00010814583,0.000047627458,0.00024655354,0.00020893222,0.00003119689,0.0025644323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992637,0.00019079783,0.00007235828,0.0000758155,0.00028776494,0.000109513945],"domain_scores_gemma":[0.998727,0.00043100317,0.00028241248,0.00020901825,0.00028082417,0.00006973494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082767056,0.0003934145,0.00043508358,0.0006263942,0.000601199,0.00067998026,0.0007643951,0.0004984739,0.00075376325],"category_scores_gemma":[0.0027209362,0.00017303225,0.0003400022,0.00052206154,0.0004303587,0.0010854774,0.0014101067,0.00068864645,0.0001985076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011531112,0.00022345768,0.0035496585,0.00075110194,0.0002953616,0.0016286997,0.0010503428,0.35410252,0.0907475,0.15073599,0.014983741,0.38077852],"study_design_scores_gemma":[0.00010364921,0.0003954353,0.00071444194,0.000045464105,0.00008454771,0.0006382486,0.00014124617,0.91691613,0.020587018,0.031046163,0.0292485,0.00007919823],"about_ca_topic_score_codex":0.00177295,"about_ca_topic_score_gemma":0.0015999883,"teacher_disagreement_score":0.00177295,"about_ca_system_score_codex":0.0007734303,"about_ca_system_score_gemma":0.0012294134,"threshold_uncertainty_score":0.005611658},"labels":[],"label_agreement":null},{"id":"W3010459667","doi":"10.3390/electronics9030455","title":"Efficient Opportunistic Routing Protocol for Sensor Network in Emergency Applications","year":2020,"lang":"en","type":"article","venue":"Electronics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Seneca Polytechnic","funders":"","keywords":"Computer network; Computer science; Routing protocol; Network packet; Wireless Routing Protocol; Zone Routing Protocol; Wireless sensor network; Routing (electronic design automation); Protocol (science); Distributed computing","score_opus":0.04048176684474429,"score_gpt":0.29757546856577194,"score_spread":0.25709370172102763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010459667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045488358,0.0076086433,0.9118034,0.0011721387,0.00083875377,0.00062683906,0.00064403936,0.0018829409,0.029934924],"genre_scores_gemma":[0.77801996,0.00562844,0.19193047,0.0005858333,0.00019324225,0.0008406886,0.0011626623,0.00011981039,0.021518951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997757,0.000057908164,0.000020435127,0.000025750758,0.000090673624,0.000029622553],"domain_scores_gemma":[0.999724,0.000089929796,0.000033949782,0.00003641457,0.00009968781,0.000016055397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033859687,0.0003267272,0.0002786211,0.00039649356,0.000559512,0.000475219,0.00071082957,0.00032436286,0.00094743265],"category_scores_gemma":[0.00069655816,0.00012698429,0.00019849189,0.00053489854,0.00023205871,0.00066839333,0.0005357948,0.00039567833,0.0002897042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006411354,0.000218601,0.0020409373,0.0017300771,0.00019909219,0.0019483955,0.0007136086,0.1394696,0.14395276,0.13398024,0.06220812,0.51289743],"study_design_scores_gemma":[0.0001481832,0.00055563217,0.0022100816,0.0001862017,0.00019838562,0.003217087,0.00045466732,0.64066213,0.03807299,0.058207363,0.2559406,0.00014669822],"about_ca_topic_score_codex":0.0011359055,"about_ca_topic_score_gemma":0.0024588024,"teacher_disagreement_score":0.0011359055,"about_ca_system_score_codex":0.00032736702,"about_ca_system_score_gemma":0.00075514615,"threshold_uncertainty_score":0.0031695366},"labels":[],"label_agreement":null},{"id":"W3019135886","doi":"10.1109/jiot.2020.3039261","title":"The Covering-Assignment Problem for Swarm-Powered <i>Ad Hoc</i> Clouds: A Distributed 3-D Mapping Usecase","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless ad hoc network; Swarm behaviour; Distributed computing; Computer network; Artificial intelligence; Wireless; Telecommunications","score_opus":0.03327758241993026,"score_gpt":0.23888861892884775,"score_spread":0.2056110365089175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019135886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32237676,0.0009709599,0.6541832,0.0018005208,0.00018339584,0.00046065229,0.0010575621,0.00043333872,0.018533722],"genre_scores_gemma":[0.86965513,0.0005464465,0.12277437,0.00019534999,0.00008857906,0.00025890928,0.0005925463,0.0001434073,0.0057453695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993131,0.0002693594,0.000024912373,0.00012471378,0.000085936095,0.00018201245],"domain_scores_gemma":[0.99827766,0.0011385535,0.00018266922,0.00011005165,0.00008475455,0.00020637638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010363068,0.0013295125,0.0011234226,0.00046226132,0.0010425474,0.0014618092,0.0015057407,0.0018481701,0.0044339923],"category_scores_gemma":[0.0028102107,0.00057107996,0.0010508997,0.0011752488,0.00091468776,0.0015755346,0.0013397402,0.0009681304,0.00034077337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011029024,0.00007968104,0.00045125597,0.000099548124,0.000027887334,0.00019421424,0.000089086156,0.97683525,0.00072845863,0.009985491,0.0018612633,0.009537581],"study_design_scores_gemma":[0.000029881465,0.000044780798,0.00023929727,0.000008213039,0.000010532675,0.00006748448,0.000085868305,0.9881781,0.000333435,0.009863353,0.0011314279,0.000007560047],"about_ca_topic_score_codex":0.008606625,"about_ca_topic_score_gemma":0.0058604884,"teacher_disagreement_score":0.008606625,"about_ca_system_score_codex":0.0015680037,"about_ca_system_score_gemma":0.0011723344,"threshold_uncertainty_score":0.01711303},"labels":[],"label_agreement":null},{"id":"W3049739154","doi":"10.1016/j.comnet.2020.107482","title":"Real-time dissemination of emergency warning messages in 5G enabled selfish vehicular social networks","year":2020,"lang":"en","type":"article","venue":"Computer Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health; King Saud University","keywords":"Computer science; Computer network; Selfishness; Overhead (engineering); Node (physics); Reputation; Dissemination; Distributed computing; Vehicular ad hoc network; Wireless ad hoc network; Computer security; Wireless; Telecommunications","score_opus":0.01459281520450111,"score_gpt":0.2434643021491746,"score_spread":0.2288714869446735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049739154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67684484,0.0018915923,0.31149825,0.00096195086,0.00028841672,0.00014284038,0.00024238347,0.00067226315,0.0074573867],"genre_scores_gemma":[0.9972276,0.00009018311,0.001996513,0.000025833779,0.000014347268,0.000007302732,0.000030005856,0.0000035044702,0.00060459273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995426,0.000140124,0.000023313833,0.0000659855,0.00013142622,0.0000965473],"domain_scores_gemma":[0.9982919,0.0009702031,0.00017854631,0.00010674031,0.000371379,0.00008117912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079727144,0.00032600848,0.00044915828,0.00063907384,0.00039786435,0.0006089929,0.00048781387,0.00046499516,0.0005886604],"category_scores_gemma":[0.0037771983,0.00014913909,0.00012902323,0.0004929136,0.00027682827,0.0007013885,0.0008355973,0.0003052811,0.000118997705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003092715,0.00031466305,0.012304059,0.0005625572,0.00020774735,0.0013362757,0.0019029458,0.5795273,0.08432111,0.033676922,0.007404607,0.27534905],"study_design_scores_gemma":[0.000030991567,0.0003275752,0.002748766,0.000015969164,0.00006142507,0.00023370615,0.00037729053,0.9822817,0.0059612915,0.0052323486,0.0027082672,0.000020679689],"about_ca_topic_score_codex":0.0019083485,"about_ca_topic_score_gemma":0.0031831884,"teacher_disagreement_score":0.0019083485,"about_ca_system_score_codex":0.0004009364,"about_ca_system_score_gemma":0.0004781008,"threshold_uncertainty_score":0.0042164326},"labels":[],"label_agreement":null},{"id":"W3083347998","doi":"10.17504/protocols.io.bjgekjte","title":"nCoV-2019 McGill RT Protocol, Lunascript v1","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University; McGill Genome Centre","funders":"","keywords":"Coronavirus disease 2019 (COVID-19); Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); 2019-20 coronavirus outbreak; Protocol (science); Computer science; Medicine; Virology; Internal medicine","score_opus":0.05615540053905445,"score_gpt":0.2920019625202905,"score_spread":0.23584656198123605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083347998","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015403907,0.005884091,0.3864564,0.0042379657,0.0037594489,0.007228815,0.2165838,0.04040738,0.32003823],"genre_scores_gemma":[0.12804964,0.003123239,0.20445846,0.004189935,0.00073073205,0.016000342,0.31447887,0.009546621,0.31942222],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977641,0.000737266,0.00019778516,0.00032317778,0.0006486227,0.00032902777],"domain_scores_gemma":[0.9977604,0.0006092364,0.00016155817,0.00082475523,0.00049188937,0.0001521526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002472281,0.0011011038,0.00083913846,0.0015491872,0.0014904964,0.0018889561,0.0024004756,0.0016752181,0.0928904],"category_scores_gemma":[0.006056847,0.0010338514,0.0005181654,0.001647274,0.00076575874,0.0014018741,0.001768584,0.002351513,0.08707784],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023033018,0.00014125185,0.0006203851,0.001212378,0.00006356158,0.0003981223,0.00037830745,0.0014631688,0.1156936,0.05168783,0.741915,0.08412308],"study_design_scores_gemma":[0.00026753507,0.00019444629,0.00072528666,0.00020118599,0.000053397413,0.0004309255,0.00009859868,0.0049613793,0.07538303,0.017491106,0.90009344,0.00009974618],"about_ca_topic_score_codex":0.006056933,"about_ca_topic_score_gemma":0.011190846,"teacher_disagreement_score":0.0928904,"about_ca_system_score_codex":0.0018031294,"about_ca_system_score_gemma":0.0046118065,"threshold_uncertainty_score":0.31074935},"labels":[],"label_agreement":null},{"id":"W3088025856","doi":"10.1007/978-981-15-9031-3_16","title":"Key Nodes Recognition in Opportunistic Network","year":2020,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Geomechanica (Canada)","funders":"","keywords":"Computer science; Key (lock); Computer network; Cache; Routing (electronic design automation); Focus (optics); Distributed computing; Computer security","score_opus":0.08039091138959764,"score_gpt":0.27574760584098,"score_spread":0.19535669445138237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088025856","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033049066,0.003401141,0.920747,0.0005103765,0.0004982017,0.000086397806,0.00008925137,0.0006916374,0.040926922],"genre_scores_gemma":[0.81873435,0.0029135656,0.13731652,0.00026476666,0.00019941581,0.00013093546,0.00018173041,0.000112361326,0.040146425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997327,0.000053028696,0.000012427871,0.00006363273,0.000081324426,0.00005694294],"domain_scores_gemma":[0.99958354,0.00022668146,0.000030230765,0.000075032665,0.00005681799,0.0000276208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036037562,0.00030397504,0.0003774236,0.00042862626,0.000482722,0.00088480196,0.00091746385,0.00048169057,0.002107693],"category_scores_gemma":[0.0015062956,0.00020337578,0.00015576744,0.0007222993,0.00064001285,0.0016978525,0.0011016577,0.0005733395,0.0005589502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000337083,0.00006566488,0.0012786062,0.0002436076,0.000022911787,0.00041777187,0.0004726591,0.12542516,0.019959396,0.47240028,0.016001044,0.3633758],"study_design_scores_gemma":[0.000014947994,0.00006770868,0.00043712696,0.000034184923,0.000020355405,0.0005900846,0.00018679141,0.77136177,0.0073497193,0.19407983,0.025830131,0.000027339256],"about_ca_topic_score_codex":0.0013724543,"about_ca_topic_score_gemma":0.0012748939,"teacher_disagreement_score":0.002107693,"about_ca_system_score_codex":0.00057949295,"about_ca_system_score_gemma":0.0004736852,"threshold_uncertainty_score":0.007050872},"labels":[],"label_agreement":null},{"id":"W3088674957","doi":"","title":"Avoiding Border Effect in Mobile Network Simulation","year":2013,"lang":"en","type":"article","venue":"International Conference on Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Mobile telephony; Computer network; Mobile computing; Mobile radio","score_opus":0.023750935591884247,"score_gpt":0.30602243209996427,"score_spread":0.28227149650808003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088674957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26488632,0.00031716388,0.72371286,0.00043176734,0.000114491864,0.00012200005,0.00013196711,0.0005864508,0.00969686],"genre_scores_gemma":[0.9611466,0.00009325359,0.037294254,0.00007036888,0.000016262204,0.00007685491,0.00006964623,0.00006552324,0.0011671616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991441,0.00051912817,0.000028488907,0.000075798904,0.00013062572,0.00010184208],"domain_scores_gemma":[0.99336374,0.005180844,0.00033063238,0.0004989606,0.00040976366,0.00021613021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017514578,0.0004579371,0.0009835126,0.00060860993,0.00087191345,0.00083226507,0.001234742,0.001338349,0.001969115],"category_scores_gemma":[0.010648692,0.0005142846,0.0006122473,0.00048643598,0.00095458387,0.0014314634,0.0018768552,0.0011584476,0.00020221618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006082976,0.000027673857,0.00063720625,0.000016929745,0.000015072426,0.000034072134,0.0000397215,0.9864508,0.00041703513,0.009474737,0.00015451822,0.0026713344],"study_design_scores_gemma":[0.0000058095984,0.000008826728,0.000029703826,0.0000018979532,0.0000029199878,0.0000027933409,0.0000041211188,0.9979457,0.00013404181,0.0017762729,0.00008650726,0.0000012952573],"about_ca_topic_score_codex":0.0066197566,"about_ca_topic_score_gemma":0.0034564822,"teacher_disagreement_score":0.0066197566,"about_ca_system_score_codex":0.000763068,"about_ca_system_score_gemma":0.00095255516,"threshold_uncertainty_score":0.013162434},"labels":[],"label_agreement":null},{"id":"W3091797351","doi":"10.5210/spir.v2020i0.11355","title":"DISSOLVED CLOUDS: ERICSSON'S VAUDREUIL DATA CENTRE AND INFRASTRUCTURALABANDONMENT","year":2020,"lang":"en","type":"article","venue":"AoIR Selected Papers of Internet Research","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Obsolescence; Abandonment (legal); Scale (ratio); Futures contract; Cloud computing; Qualitative property; Business; Marketing; Computer science; Geography; Political science; Finance","score_opus":0.06712885771388946,"score_gpt":0.3070761321502375,"score_spread":0.23994727443634803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091797351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8177243,0.003299512,0.014322677,0.032754995,0.0004739677,0.00008355423,0.00027696035,0.00020453779,0.13085954],"genre_scores_gemma":[0.98054916,0.0005801247,0.0011794574,0.00084116356,0.000020734864,0.000016160406,0.000052136988,0.000065224274,0.016695933],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9959836,0.0015787244,0.00006594648,0.00044412108,0.00086647196,0.0010611864],"domain_scores_gemma":[0.9959319,0.0016181585,0.00041242092,0.00043295807,0.00085025164,0.0007542782],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0032925552,0.00034864713,0.00031615346,0.00087475183,0.01972886,0.012452403,0.0018431023,0.0018904399,0.003814646],"category_scores_gemma":[0.0066154175,0.00033443258,0.0002858712,0.0018060086,0.019953042,0.005795242,0.0050906595,0.002933897,0.0005496256],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015789086,0.000044321954,0.0152425915,0.00011889959,0.000015297039,0.0032495207,0.6619212,0.0016103578,0.0013696097,0.25402445,0.019791946,0.042453967],"study_design_scores_gemma":[0.000013236149,0.00005027194,0.0051518544,0.00028271525,0.000011268954,0.00071049936,0.4324294,0.0013639351,0.0011848463,0.012504278,0.5462301,0.00006765849],"about_ca_topic_score_codex":0.6716064,"about_ca_topic_score_gemma":0.76064837,"teacher_disagreement_score":0.98027116,"about_ca_system_score_codex":0.050461974,"about_ca_system_score_gemma":0.024223575,"threshold_uncertainty_score":0.6606551},"labels":[],"label_agreement":null},{"id":"W3093166033","doi":"10.1002/dac.4646","title":"Random forest classifier‐based safe and reliable routing for opportunistic IoT networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Network packet; Routing protocol; Packet forwarding; Latency (audio); Distributed computing","score_opus":0.05667167923689002,"score_gpt":0.2830995292083495,"score_spread":0.2264278499714595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093166033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12067368,0.00070081826,0.87064886,0.00073934597,0.00022347497,0.00027189133,0.0005936235,0.0027340844,0.0034142048],"genre_scores_gemma":[0.8213443,0.0002803401,0.17422166,0.00017780178,0.00012375048,0.00019772367,0.001278489,0.000097737044,0.0022781005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.00017900152,0.000053657193,0.00016739266,0.00027908638,0.0001880091],"domain_scores_gemma":[0.9971648,0.0012672557,0.00032972824,0.00036646414,0.00077521586,0.000096584095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002170137,0.00071290135,0.00086687226,0.0015127842,0.00078482454,0.0007139777,0.0012561417,0.0008390245,0.0010785552],"category_scores_gemma":[0.00422548,0.00026349345,0.00068566087,0.00082369766,0.0003493663,0.001001918,0.00049981964,0.00089915894,0.0004986357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024651297,0.00020976922,0.0067027165,0.00008711637,0.00009450604,0.00022726943,0.000056810335,0.6662052,0.0058671916,0.005256782,0.008380936,0.3066651],"study_design_scores_gemma":[0.0000049478804,0.000028423736,0.0003433323,0.000003769782,0.0000060646234,0.000025919873,0.000008104937,0.9972293,0.00053590955,0.001440276,0.0003692668,0.000004715559],"about_ca_topic_score_codex":0.012995353,"about_ca_topic_score_gemma":0.011915454,"teacher_disagreement_score":0.012995353,"about_ca_system_score_codex":0.0010091696,"about_ca_system_score_gemma":0.0017272317,"threshold_uncertainty_score":0.025839448},"labels":[],"label_agreement":null},{"id":"W3094830184","doi":"10.3390/info11110504","title":"Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks","year":2020,"lang":"en","type":"article","venue":"Information","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Computer network; Computer science; Geocast; Routing protocol; Network packet; Wireless Routing Protocol; Dynamic Source Routing; Distributed computing","score_opus":0.04004653720944708,"score_gpt":0.2589569634157565,"score_spread":0.21891042620630946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094830184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106579386,0.0015887544,0.8842267,0.0003820842,0.0002670464,0.00034937932,0.00019917118,0.00086198165,0.0055454643],"genre_scores_gemma":[0.91401756,0.0009118417,0.08201631,0.00014810308,0.00003772868,0.00021808976,0.00025796774,0.000028386234,0.0023641372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998447,0.000028644276,0.000011096836,0.000017004902,0.00007411868,0.000024428748],"domain_scores_gemma":[0.9996246,0.00013933831,0.00007898086,0.000045066485,0.00008622282,0.000025713445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003735518,0.00028720463,0.00039569248,0.00043487587,0.00048991875,0.00037354484,0.00068621064,0.00027900818,0.00037575743],"category_scores_gemma":[0.00092475995,0.000107341475,0.0002483378,0.00041090517,0.0003379496,0.0005790725,0.000693981,0.0003860978,0.0000611227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008243909,0.00025190588,0.0043648933,0.0007121212,0.00021309621,0.0012874887,0.0006788692,0.31041422,0.21284917,0.1067537,0.012775956,0.3488741],"study_design_scores_gemma":[0.00014299671,0.0005008861,0.0012863697,0.000045158235,0.00012836662,0.000876406,0.00021397877,0.91668147,0.03898105,0.018128503,0.022946918,0.00006778136],"about_ca_topic_score_codex":0.0020513057,"about_ca_topic_score_gemma":0.0043271095,"teacher_disagreement_score":0.0020513057,"about_ca_system_score_codex":0.0004235612,"about_ca_system_score_gemma":0.0011110642,"threshold_uncertainty_score":0.0040786862},"labels":[],"label_agreement":null},{"id":"W3114879400","doi":"","title":"Proceedings of the Edge Intelligence Workshop, Montréal, Canada, March 2--3, 2020","year":2020,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.021979474989648962,"score_gpt":0.20037115846591025,"score_spread":0.17839168347626128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114879400","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011327757,0.019856667,0.029381277,0.049223837,0.02651782,0.0005119968,0.027280843,0.00525061,0.8306492],"genre_scores_gemma":[0.014377193,0.004532749,0.0061067063,0.0016097944,0.00053138216,0.00006885123,0.013284333,0.00043008025,0.9590589],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934703,0.000065467546,0.0000130556045,0.000069738504,0.00028997005,0.00021472371],"domain_scores_gemma":[0.99862313,0.00009484348,0.000022685588,0.000072902054,0.00068078964,0.0005055165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784947,0.0014342285,0.0007508837,0.0010585983,0.0020054623,0.004517774,0.0018637753,0.0014338953,0.16001885],"category_scores_gemma":[0.0015054869,0.00044438272,0.0004660848,0.001230452,0.0008350215,0.0017452652,0.0014676654,0.0014823993,0.066636644],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010498069,0.00004367932,0.0004137996,0.00005232843,0.0000072461753,0.000058846832,0.00004783151,0.00038892936,0.00050326233,0.0024918222,0.9637872,0.032100137],"study_design_scores_gemma":[0.000025069641,0.000017465383,0.001298873,0.000062592604,0.00001403498,0.000030899977,0.0002598643,0.0015386211,0.0006718476,0.0014167178,0.994651,0.000013005946],"about_ca_topic_score_codex":0.46478608,"about_ca_topic_score_gemma":0.74835515,"teacher_disagreement_score":0.53521395,"about_ca_system_score_codex":0.0056710616,"about_ca_system_score_gemma":0.012314965,"threshold_uncertainty_score":0.92416143},"labels":[],"label_agreement":null},{"id":"W3117320684","doi":"10.1787/7fbaed62-en","title":"Data localisation trends and challenges","year":2020,"lang":"en","type":"paratext","venue":"OECD digital economy papers","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Privacy Analytics (Canada)","funders":"","keywords":"Data governance; Relevance (law); Context (archaeology); Accountability; Corporate governance; Proportionality (law); Information privacy; Computer science; Data Protection Act 1998; Work (physics); Data science; Data quality; Computer security; Political science; Internet privacy; Business; Engineering; Law; Geography","score_opus":0.07990367543617717,"score_gpt":0.24725054184195802,"score_spread":0.16734686640578084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117320684","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027253704,0.12527703,0.054151382,0.57761836,0.005964377,0.0001451437,0.005773459,0.002239178,0.20157745],"genre_scores_gemma":[0.4266784,0.3089634,0.061817124,0.071765624,0.009972293,0.0004187238,0.015749691,0.0024755977,0.10215918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9806215,0.0043279445,0.0020372607,0.0033009131,0.00796807,0.0017442821],"domain_scores_gemma":[0.9286408,0.031599488,0.0056751724,0.005392154,0.0256959,0.002996601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021647671,0.0006605428,0.0010312815,0.0090184,0.002799247,0.017083803,0.004759289,0.0056380494,0.024705168],"category_scores_gemma":[0.056365907,0.00079252134,0.0011927078,0.019054366,0.008633613,0.042980015,0.011136345,0.0063234363,0.01466218],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012202534,0.00004297617,0.005226129,0.0024525207,0.000022928538,0.00028270917,0.0022517436,0.002649048,0.0007515602,0.51292133,0.1617805,0.3114965],"study_design_scores_gemma":[0.000005154512,0.000022463455,0.0014334157,0.0006995291,0.0000055300475,0.00056852115,0.003761905,0.00074281875,0.00046200896,0.02349908,0.9687603,0.000039221297],"about_ca_topic_score_codex":0.011746051,"about_ca_topic_score_gemma":0.0059898505,"teacher_disagreement_score":0.024705168,"about_ca_system_score_codex":0.01080682,"about_ca_system_score_gemma":0.007378376,"threshold_uncertainty_score":0.114485204},"labels":[],"label_agreement":null},{"id":"W3118097934","doi":"10.1109/isncc49221.2020.9297217","title":"Internet-of-Things (IoT) Shortest Path Algorithms and Communication Case Studies for Maintaining Connectivity in Harsh Environements","year":2020,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Shortest path problem; Computer network; Network packet; Pathfinding; Distributed computing; Path (computing); Node (physics); Wireless; Dijkstra's algorithm; Graph; Theoretical computer science; Telecommunications","score_opus":0.08402513057490472,"score_gpt":0.29768474946555307,"score_spread":0.21365961889064833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118097934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28724173,0.0069871848,0.6553233,0.0022053688,0.0002474354,0.00046937214,0.00045390442,0.00025382574,0.04681784],"genre_scores_gemma":[0.75905365,0.0054528075,0.22633491,0.00012054463,0.00012243653,0.0002581795,0.00040690415,0.00005939753,0.00819121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987884,0.0005349979,0.00008053381,0.00013331896,0.00029457905,0.0001681994],"domain_scores_gemma":[0.996822,0.0024351156,0.00018997093,0.00017970055,0.00024988336,0.00012330913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014278562,0.00087395083,0.00065131753,0.0011346271,0.0018471208,0.001519601,0.0013097859,0.0022977195,0.0017397659],"category_scores_gemma":[0.004897064,0.0003343133,0.0013005176,0.0033647222,0.0015235839,0.0029475035,0.0010892531,0.0011661424,0.00022613857],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013512402,0.00026961233,0.0027432207,0.00043466335,0.00007721856,0.001643973,0.00062947575,0.787213,0.0016712712,0.15591785,0.0049864706,0.044278134],"study_design_scores_gemma":[0.000046227422,0.00023862981,0.0010766372,0.000066819615,0.000055672182,0.0009109807,0.00094874814,0.90916556,0.0019577611,0.07117171,0.0143077625,0.000053499905],"about_ca_topic_score_codex":0.0040554106,"about_ca_topic_score_gemma":0.004910997,"teacher_disagreement_score":0.0040554106,"about_ca_system_score_codex":0.001389313,"about_ca_system_score_gemma":0.00057432236,"threshold_uncertainty_score":0.010080218},"labels":[],"label_agreement":null},{"id":"W3120942553","doi":"10.1155/2021/6682311","title":"Ferry Node Identification Model for the Security of Mobile Ad Hoc Network","year":2021,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Geomechanica (Canada)","funders":"Natural Science Foundation of Inner Mongolia; National Natural Science Foundation of China","keywords":"Computer science; Node (physics); Computer network; Identification (biology); Wireless ad hoc network; Mobile ad hoc network; Computer security; Wireless; Network packet; Telecommunications","score_opus":0.021596191311871495,"score_gpt":0.25909357363239016,"score_spread":0.23749738232051867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120942553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026645567,0.00044216504,0.9680417,0.0002948034,0.00009492536,0.00008363229,0.000106667314,0.00020042683,0.0040901112],"genre_scores_gemma":[0.93397725,0.0009101772,0.053537507,0.00014452233,0.00011007259,0.00026471884,0.00022367242,0.00004789981,0.010784168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902,0.0002135533,0.000037668775,0.00024936692,0.00031455836,0.00016490069],"domain_scores_gemma":[0.9989293,0.00042039042,0.00020904365,0.00007807733,0.00030216353,0.00006115108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407526,0.00091848185,0.0007121375,0.0012548597,0.00085074396,0.0008996525,0.0022291713,0.0010936258,0.001857729],"category_scores_gemma":[0.004069301,0.0002657317,0.0007860901,0.0009432026,0.0010526468,0.003162189,0.0010188003,0.0011785193,0.00037095675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062792526,0.000027477188,0.0013068286,0.000055272183,0.000021315991,0.000106119696,0.00013973232,0.9382751,0.0013054024,0.043178916,0.0012566431,0.014264335],"study_design_scores_gemma":[0.0000024890005,0.000019529973,0.00019988185,0.0000038305,0.000006658434,0.00002883275,0.000023093913,0.99198335,0.00017032094,0.00696454,0.000589742,0.000007756175],"about_ca_topic_score_codex":0.010771248,"about_ca_topic_score_gemma":0.008255361,"teacher_disagreement_score":0.010771248,"about_ca_system_score_codex":0.0019731356,"about_ca_system_score_gemma":0.0011565243,"threshold_uncertainty_score":0.021417081},"labels":[],"label_agreement":null},{"id":"W3133893905","doi":"10.1016/j.iot.2021.100384","title":"Reinforcement learning-based fuzzy geocast routing protocol for opportunistic networks","year":2021,"lang":"en","type":"article","venue":"Internet of Things","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless Routing Protocol; Dynamic Source Routing; Reinforcement learning; Zone Routing Protocol; Routing protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Path vector protocol; Destination-Sequenced Distance Vector routing; Static routing; Distributed computing; Routing (electronic design automation); Artificial intelligence","score_opus":0.03674563940649983,"score_gpt":0.287546307133943,"score_spread":0.2508006677274432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133893905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063791044,0.00027417918,0.93187696,0.00024726457,0.00011506571,0.00006264737,0.000063108324,0.00030772868,0.0032620302],"genre_scores_gemma":[0.97786456,0.00007189096,0.020893436,0.000044513516,0.000015422373,0.000028492233,0.000029685327,0.0000083834475,0.0010436985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999757,0.000052123454,0.000014432245,0.000046835943,0.000077904806,0.000051700077],"domain_scores_gemma":[0.9993573,0.0003148633,0.00007351376,0.000044320495,0.0001623748,0.00004763019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054650067,0.00028676464,0.0005407306,0.0003157152,0.00051452336,0.00040986255,0.0009409393,0.00043512546,0.00078175263],"category_scores_gemma":[0.0013075529,0.00011791044,0.00021028532,0.00031181274,0.0004881488,0.0005392537,0.00056590047,0.00057290145,0.00008563876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003426778,0.00015230545,0.0014157121,0.000080498656,0.00007074868,0.00019939442,0.00014938766,0.8602495,0.011796133,0.028661773,0.0026942568,0.094187595],"study_design_scores_gemma":[0.00001261309,0.00003661453,0.00013494889,0.0000020846012,0.000008024451,0.000030027952,0.0000105157405,0.9947189,0.00072072615,0.0039673448,0.00035185486,0.000006303511],"about_ca_topic_score_codex":0.0061249435,"about_ca_topic_score_gemma":0.006645068,"teacher_disagreement_score":0.0061249435,"about_ca_system_score_codex":0.00076412415,"about_ca_system_score_gemma":0.00085817376,"threshold_uncertainty_score":0.0121786},"labels":[],"label_agreement":null},{"id":"W3135522743","doi":"10.1155/2021/6666211","title":"A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy","year":2021,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Geomechanica (Canada)","funders":"H2020 European Research Council; Natural Science Foundation of Inner Mongolia; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Node (physics); Routing (electronic design automation); Routing algorithm; The Internet; Algorithm; Geographic routing; Static routing; IP forwarding; Distributed computing; Routing protocol; World Wide Web","score_opus":0.03862385346765099,"score_gpt":0.28548820255587504,"score_spread":0.24686434908822405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135522743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02426016,0.00023925005,0.97181094,0.0002010624,0.00008133865,0.000111377645,0.00010334055,0.0005162215,0.0026762953],"genre_scores_gemma":[0.6547738,0.0007081585,0.33694586,0.00016316217,0.00007579544,0.0003744322,0.00065073447,0.00010135608,0.006206714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970704,0.000052435946,0.000019865349,0.0000732599,0.00010070212,0.00004664261],"domain_scores_gemma":[0.9995245,0.00017295877,0.00007161544,0.00005507824,0.00014720399,0.00002868802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045402694,0.0005360459,0.0005728105,0.00087000127,0.0009982346,0.00069882517,0.0011390407,0.0005574955,0.0014675502],"category_scores_gemma":[0.001922417,0.00022541614,0.00044785,0.000940808,0.00034517734,0.0014457825,0.00081451796,0.0005971156,0.00028658428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013172008,0.00007270439,0.0026079759,0.000106415944,0.000043385546,0.00015191051,0.00021977113,0.74238765,0.005089619,0.02107029,0.0057322825,0.22238618],"study_design_scores_gemma":[0.000009684685,0.000025202058,0.0001596568,0.0000049476844,0.00000836596,0.00006064271,0.000027971846,0.9940024,0.00049847027,0.003946265,0.0012480625,0.000008312057],"about_ca_topic_score_codex":0.0109516615,"about_ca_topic_score_gemma":0.01171372,"teacher_disagreement_score":0.0109516615,"about_ca_system_score_codex":0.00098936,"about_ca_system_score_gemma":0.0013313721,"threshold_uncertainty_score":0.021775842},"labels":[],"label_agreement":null},{"id":"W3136871187","doi":"10.5539/cis.v14n2p42","title":"Monitor Potential Attack Locations in a Specific Area within DTN Network","year":2021,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Delay-tolerant networking; Scope (computer science); Transmission (telecommunications); Routing (electronic design automation); Computer security; Routing protocol; Telecommunications; Optimized Link State Routing Protocol","score_opus":0.024579045741187626,"score_gpt":0.24254053382720217,"score_spread":0.21796148808601454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136871187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.792628,0.0006653144,0.19061919,0.0003129485,0.00014196994,0.00033724756,0.0011743323,0.0015557316,0.012565264],"genre_scores_gemma":[0.95487833,0.00041438953,0.040702302,0.000046483154,0.000015317966,0.00010427646,0.0007354303,0.000038412563,0.0030649784],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960476,0.000068914494,0.00002574864,0.00010946976,0.00015002408,0.000041162184],"domain_scores_gemma":[0.99871814,0.00038651444,0.000390516,0.0001354775,0.0002652331,0.00010407956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029392212,0.0003892469,0.00033508072,0.001121927,0.00045129794,0.0006639203,0.00052670774,0.0005536719,0.0010297442],"category_scores_gemma":[0.0021226772,0.00012328285,0.00015172326,0.00063286,0.00021245929,0.001317877,0.00067687,0.0002973781,0.00037781367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084683247,0.00042376385,0.3062049,0.0006742963,0.00020429683,0.0025318395,0.0025634402,0.27367008,0.13398549,0.018161222,0.0039574336,0.25677633],"study_design_scores_gemma":[0.000026602798,0.0009930071,0.06594847,0.00008859146,0.00020147399,0.0022819773,0.0015757512,0.80260456,0.09628703,0.008702888,0.021194436,0.00009512112],"about_ca_topic_score_codex":0.0012515653,"about_ca_topic_score_gemma":0.0021368708,"teacher_disagreement_score":0.0012515653,"about_ca_system_score_codex":0.00035482598,"about_ca_system_score_gemma":0.00033821134,"threshold_uncertainty_score":0.0034447908},"labels":[],"label_agreement":null},{"id":"W3136878226","doi":"10.3233/jhs-210648","title":"A fuzzy-based check-and-spray geocast routing protocol for opportunistic networks","year":2021,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Geocast; Routing protocol; Flooding (psychology); Latency (audio); Wireless Routing Protocol; Dynamic Source Routing; Zone Routing Protocol; Routing (electronic design automation); Telecommunications","score_opus":0.03715383016495805,"score_gpt":0.2875374564092956,"score_spread":0.2503836262443376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136878226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05393032,0.00045806944,0.937726,0.00029036222,0.00013737353,0.0003456473,0.00017864387,0.0004947478,0.006438853],"genre_scores_gemma":[0.82530725,0.00043437505,0.16994144,0.0001638857,0.000033991815,0.00028164408,0.00019813312,0.000016884751,0.0036223433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984217,0.000023590432,0.000013756096,0.000025776575,0.00007401135,0.000020674663],"domain_scores_gemma":[0.99977535,0.0000737555,0.000044784363,0.000021793023,0.000062046965,0.000022153825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035380587,0.00025394882,0.00028252092,0.00042034333,0.0005484902,0.00042487856,0.00090205256,0.00043871754,0.00072123075],"category_scores_gemma":[0.0007962097,0.00010544224,0.00031729275,0.00035253656,0.00040395703,0.0005034572,0.00050665135,0.00037163196,0.000090977475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005641208,0.00027339978,0.00306436,0.0004964306,0.00013663291,0.0012802185,0.0006696517,0.4089067,0.09516313,0.10228178,0.008317052,0.37884656],"study_design_scores_gemma":[0.00009258851,0.00030898175,0.00089770503,0.00003267704,0.000066826455,0.00049276825,0.000106016465,0.9558702,0.012299304,0.013730631,0.016048687,0.00005362804],"about_ca_topic_score_codex":0.0056564156,"about_ca_topic_score_gemma":0.007747442,"teacher_disagreement_score":0.0056564156,"about_ca_system_score_codex":0.0006181146,"about_ca_system_score_gemma":0.001135609,"threshold_uncertainty_score":0.011246979},"labels":[],"label_agreement":null},{"id":"W3147447633","doi":"10.1109/iros.2011.6048238","title":"Optimal control of multi-input SMA actuator arrays using graph theory: Expanding wavefront &amp;amp; simultaneous operations","year":2011,"lang":"en","type":"article","venue":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Software deployment; Computer science; Terrain; Search and rescue; Actuator; Robot; Graph; Search algorithm; Distributed computing; Real-time computing; Artificial intelligence; Theoretical computer science; Algorithm","score_opus":0.15006773220985,"score_gpt":0.31401556386792734,"score_spread":0.16394783165807733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147447633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015195914,0.00009964231,0.98020554,0.00010239346,0.000026923457,0.00002221826,0.00001543279,0.00010311568,0.004228785],"genre_scores_gemma":[0.9214846,0.00015228162,0.07450656,0.00005906269,0.000025580353,0.00009933318,0.000026575573,0.00003417289,0.003611806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997873,0.000053900683,0.0000070688893,0.000042389238,0.00007539889,0.000033972243],"domain_scores_gemma":[0.99956864,0.00024135373,0.00008174166,0.000018275801,0.00006763534,0.000022345563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041391028,0.00065324875,0.00047553398,0.00040532605,0.00036079105,0.0006813893,0.0006289279,0.00044135473,0.0014424559],"category_scores_gemma":[0.0010197845,0.00032421912,0.0003499907,0.0003788659,0.0006827413,0.00064838777,0.00075697765,0.00055337773,0.00019029516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047407546,0.00001842057,0.00012086272,0.000029092243,0.000012957918,0.00002687305,0.000040247003,0.9645268,0.0025332042,0.007980475,0.00040043078,0.024263307],"study_design_scores_gemma":[0.000004305716,0.000018949848,0.00003503784,0.0000018113838,0.0000017707448,0.0000033999936,0.0000057243265,0.9975073,0.0002864289,0.0019288253,0.0002040153,0.0000024271146],"about_ca_topic_score_codex":0.004018533,"about_ca_topic_score_gemma":0.0043359273,"teacher_disagreement_score":0.004018533,"about_ca_system_score_codex":0.0005922223,"about_ca_system_score_gemma":0.00057395955,"threshold_uncertainty_score":0.007990301},"labels":[],"label_agreement":null},{"id":"W3154426907","doi":"10.1007/s00607-021-00940-y","title":"Fast-MICDTN: a new decentralized control mechanism for content-centric disruption tolerant networks","year":2021,"lang":"en","type":"article","venue":"Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Decentralised system; Computer science; Distributed computing; Mechanism (biology); Control (management); Computer network; Artificial intelligence","score_opus":0.039549783023194986,"score_gpt":0.255667243213561,"score_spread":0.216117460190366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154426907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017163334,0.0006232828,0.96766704,0.00050492364,0.0005032456,0.0002719337,0.00036684697,0.007540928,0.0053584836],"genre_scores_gemma":[0.73143595,0.00049754186,0.25554448,0.00061870296,0.00029704793,0.0003440169,0.00078168995,0.00040849973,0.01007202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988201,0.00019134986,0.00010105214,0.00026648433,0.00046575948,0.0001551389],"domain_scores_gemma":[0.99744844,0.00053479115,0.0003215531,0.00073897885,0.00067052385,0.0002857534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021045462,0.00070758676,0.00084379537,0.0010886716,0.0012095113,0.0020538012,0.0031510752,0.000979697,0.002583751],"category_scores_gemma":[0.0040381043,0.00035537814,0.0003401904,0.0010995955,0.00082339626,0.0023724807,0.0025990424,0.0013383911,0.0005515779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016409815,0.00043611665,0.0023624669,0.00048674791,0.00018622485,0.00034787698,0.00042564812,0.32334763,0.056694124,0.10177571,0.0470982,0.46519828],"study_design_scores_gemma":[0.0000700374,0.00013441339,0.00030625644,0.000016825381,0.000034355642,0.00013567836,0.000039100676,0.94785565,0.010691433,0.016982343,0.023682075,0.000051772524],"about_ca_topic_score_codex":0.0037594317,"about_ca_topic_score_gemma":0.0063022794,"teacher_disagreement_score":0.0037594317,"about_ca_system_score_codex":0.0016985607,"about_ca_system_score_gemma":0.0019539376,"threshold_uncertainty_score":0.012323916},"labels":[],"label_agreement":null},{"id":"W3158361046","doi":"10.1109/wcnc49053.2021.9417387","title":"Energy Balance and Cache Optimization Routing Algorithm Based on Communication Willingness","year":2021,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Geomechanica (Canada)","funders":"Natural Science Foundation of Inner Mongolia; National Natural Science Foundation of China; CERN","keywords":"Computer science; Cache; Computer network; Latency (audio); Energy consumption; Distributed computing; Overhead (engineering); Cache algorithms; CPU cache; Telecommunications; Engineering","score_opus":0.012667137603162001,"score_gpt":0.21545467508848548,"score_spread":0.20278753748532347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158361046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17101994,0.0006460032,0.8182825,0.00036145563,0.000082791055,0.00014657239,0.00012442772,0.00076898263,0.008567335],"genre_scores_gemma":[0.906054,0.00027337504,0.08946931,0.000062580315,0.000028801622,0.00013612691,0.0001752932,0.00005164238,0.003748846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976736,0.000041540072,0.000017225575,0.00005801923,0.0000738174,0.000042083877],"domain_scores_gemma":[0.99967134,0.00010776518,0.000045657027,0.00003609564,0.00011478459,0.000024373832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035127648,0.00043785354,0.0005261134,0.0007629113,0.0006505176,0.0006662866,0.0010582343,0.00036400263,0.0010009649],"category_scores_gemma":[0.0009989928,0.00017889624,0.0003110073,0.0008533384,0.00021878186,0.0013240176,0.00051060965,0.00028340524,0.000115244286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029363937,0.00018890362,0.004923623,0.00013781383,0.000116314026,0.00019027396,0.00024582547,0.73196435,0.01786046,0.02815159,0.0046151904,0.21131203],"study_design_scores_gemma":[0.00002660246,0.000049270206,0.0003687013,0.000004347498,0.000022635535,0.00009024851,0.000045109908,0.9927206,0.0019980953,0.0032491556,0.0014126394,0.000012591268],"about_ca_topic_score_codex":0.004084645,"about_ca_topic_score_gemma":0.0060745473,"teacher_disagreement_score":0.004084645,"about_ca_system_score_codex":0.0006484743,"about_ca_system_score_gemma":0.00097650336,"threshold_uncertainty_score":0.008121729},"labels":[],"label_agreement":null},{"id":"W3158907118","doi":"10.1038/s41598-021-88529-5","title":"Dilations and degeneracy in network controllability","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Controllability; Degeneracy (biology); Network controllability; Computer science; Operationalization; Degenerate energy levels; CLARITY; Set (abstract data type); Topology (electrical circuits); Theoretical computer science; Complex network; Perspective (graphical); Distributed computing; Mathematics; Artificial intelligence; Betweenness centrality; Epistemology; Physics","score_opus":0.013470884146684667,"score_gpt":0.23271273164041892,"score_spread":0.21924184749373427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158907118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19665109,0.0015623223,0.74145865,0.0032966507,0.0002350322,0.0001013557,0.00018827461,0.0002496511,0.05625696],"genre_scores_gemma":[0.9629743,0.0007689861,0.03153182,0.00024006201,0.00018695337,0.00011060176,0.00006030013,0.000060704137,0.0040662796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842787,0.00046694995,0.000106444975,0.00035091786,0.0004191872,0.00022872988],"domain_scores_gemma":[0.9944047,0.0033308857,0.00085109234,0.00068234187,0.00029001216,0.00044105249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023080804,0.00044086276,0.0009106034,0.0011084926,0.0015241229,0.0019303352,0.00076857564,0.0013285638,0.0043779905],"category_scores_gemma":[0.008871787,0.0003529056,0.0008050369,0.00053796946,0.0058525987,0.0045578354,0.0032696212,0.0019466117,0.00023945593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026992948,0.000013053721,0.00032334673,0.000045631885,0.000008944294,0.0001354528,0.00024404,0.022462223,0.0016847554,0.9691148,0.00046468017,0.0054760934],"study_design_scores_gemma":[0.000017147617,0.000033613098,0.0003155602,0.000022308726,0.000005641454,0.00012245426,0.00009263736,0.08397651,0.0005510059,0.9121413,0.0027063172,0.000015468815],"about_ca_topic_score_codex":0.00063717697,"about_ca_topic_score_gemma":0.00034966323,"teacher_disagreement_score":0.0043779905,"about_ca_system_score_codex":0.0014504147,"about_ca_system_score_gemma":0.00056004873,"threshold_uncertainty_score":0.014645815},"labels":[],"label_agreement":null},{"id":"W3158982156","doi":"10.1007/978-3-030-75100-5_48","title":"Energy-Efficient Fuzzy Geocast Routing Protocol for Opportunistic Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Routing protocol; Computer science; Zone Routing Protocol; Wireless Routing Protocol; Geocast; Fuzzy logic; Path vector protocol; Routing (electronic design automation); Artificial intelligence","score_opus":0.036418971617513354,"score_gpt":0.2585854654789049,"score_spread":0.22216649386139153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158982156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06675384,0.0015975852,0.91533184,0.00033985125,0.00025978047,0.00007586694,0.00018803196,0.0003583188,0.015094918],"genre_scores_gemma":[0.9064704,0.000796424,0.082792334,0.00008480198,0.000063559375,0.000049787137,0.0001312422,0.000023220278,0.009588132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992967,0.000007000202,0.0000035726268,0.000011332863,0.00003302887,0.000015413221],"domain_scores_gemma":[0.9999069,0.00003595547,0.0000093733115,0.00001268446,0.000027070893,0.000007930492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017206286,0.00019547237,0.00028974784,0.0003137235,0.00042506246,0.00038724474,0.00073846406,0.00029860143,0.001119655],"category_scores_gemma":[0.0003419583,0.0000828686,0.00013994212,0.00035471746,0.00022917913,0.0005284512,0.00042987365,0.0003793314,0.00011872987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055488286,0.00012285885,0.000743801,0.00026641504,0.00007213819,0.00041954414,0.0002549057,0.2924937,0.10035173,0.17317279,0.01121362,0.42033362],"study_design_scores_gemma":[0.00002818281,0.00012815672,0.0005819867,0.000019618697,0.000037068265,0.00038441096,0.000097170036,0.9265384,0.01768257,0.039934527,0.014537927,0.000029921159],"about_ca_topic_score_codex":0.0017680109,"about_ca_topic_score_gemma":0.0032655736,"teacher_disagreement_score":0.0017680109,"about_ca_system_score_codex":0.00048649876,"about_ca_system_score_gemma":0.0004493707,"threshold_uncertainty_score":0.0037455559},"labels":[],"label_agreement":null},{"id":"W3175104038","doi":"10.1155/2021/5581259","title":"Evaluation of Congestion Aware Social Metrics for Centrality‐Based Routing","year":2021,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Centrality; Routing (electronic design automation); Computer network; Statistics","score_opus":0.10593286804499885,"score_gpt":0.35156451441191133,"score_spread":0.24563164636691248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175104038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8580155,0.0009832566,0.13404585,0.00040930987,0.00016172562,0.0003869182,0.00037204183,0.0005993915,0.005026015],"genre_scores_gemma":[0.9854453,0.000081370854,0.014026665,0.000008288943,0.000010070605,0.000041806594,0.00014659192,0.000011033657,0.00022888982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982565,0.0007561902,0.0000911546,0.00014575219,0.000618817,0.00013156264],"domain_scores_gemma":[0.9901391,0.0062103206,0.000999992,0.0006806764,0.0016087529,0.00036115714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028435425,0.00077202194,0.00050227065,0.002432368,0.00048466033,0.0010197927,0.00084111415,0.00053514435,0.00053043873],"category_scores_gemma":[0.015396856,0.00015090547,0.00025376584,0.0014862806,0.0005503375,0.0014795272,0.0006270563,0.00043422382,0.00007053736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049484253,0.0005138621,0.028154135,0.00026932295,0.00019997172,0.0002283566,0.00035865096,0.8175414,0.016140295,0.01934479,0.0016243833,0.11512992],"study_design_scores_gemma":[0.0000138495025,0.0004037997,0.0053045326,0.00001232845,0.000025591764,0.000090976144,0.00011972316,0.98768103,0.0036423984,0.0020749476,0.0006058079,0.00002507376],"about_ca_topic_score_codex":0.004670344,"about_ca_topic_score_gemma":0.004711204,"teacher_disagreement_score":0.004670344,"about_ca_system_score_codex":0.0015413946,"about_ca_system_score_gemma":0.0008337409,"threshold_uncertainty_score":0.015038252},"labels":[],"label_agreement":null},{"id":"W3189664302","doi":"10.32920/ryerson.14655078.v1","title":"Congestion aware overlay network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Network packet; Network congestion; Overhead (engineering); Wireless ad hoc network; Distributed computing; Wireless network; Packet loss; Wireless; Telecommunications","score_opus":0.024040905619419135,"score_gpt":0.24320318782741135,"score_spread":0.21916228220799222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189664302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16346645,0.005173119,0.8050328,0.00097565935,0.00065412966,0.0006045327,0.0006544323,0.0059650335,0.017473852],"genre_scores_gemma":[0.9229099,0.0016157127,0.06966274,0.00013038817,0.00014658454,0.00013405264,0.0004993427,0.00006834631,0.004832845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999438,0.00012131316,0.000041007726,0.00013411659,0.00016711243,0.00009845568],"domain_scores_gemma":[0.9990828,0.0002758592,0.0000964487,0.00014739201,0.00031360498,0.000083925326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005957908,0.00046934703,0.00078345666,0.00089943875,0.0011602483,0.0009306198,0.0011060596,0.00046479263,0.0015347718],"category_scores_gemma":[0.0022675088,0.00021673244,0.00036868753,0.00081171317,0.00033920363,0.0016634245,0.0013596456,0.0005412053,0.00026562836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087939313,0.00038452516,0.0056523937,0.0009284425,0.00025804414,0.001257211,0.00063265604,0.3447501,0.08301157,0.045638286,0.027416002,0.48919126],"study_design_scores_gemma":[0.000067337154,0.00027503612,0.0014572309,0.000028012322,0.00015123864,0.00067525415,0.00019155623,0.9430164,0.014498369,0.013426637,0.026144482,0.00006843292],"about_ca_topic_score_codex":0.003868202,"about_ca_topic_score_gemma":0.0037618913,"teacher_disagreement_score":0.003868202,"about_ca_system_score_codex":0.0008458094,"about_ca_system_score_gemma":0.0012169391,"threshold_uncertainty_score":0.0076913834},"labels":[],"label_agreement":null},{"id":"W3190625697","doi":"10.1109/icc42927.2021.9500645","title":"Energy Efficient Multi-Objectives Optimized Routing for Opportunistic Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Routing protocol; Network packet; Routing (electronic design automation); Node (physics); Context (archaeology); Computer network; Set (abstract data type); Routing table; Dynamic Source Routing; Energy consumption; Zone Routing Protocol; Protocol (science); Engineering","score_opus":0.03126460544287175,"score_gpt":0.25775125624014195,"score_spread":0.2264866507972702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190625697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02459808,0.00072654296,0.97087765,0.00017126834,0.000057914447,0.00006504886,0.00004478727,0.00019208145,0.0032666384],"genre_scores_gemma":[0.72004724,0.0007454683,0.27465567,0.00016583201,0.00005614282,0.00020391674,0.00014577081,0.00006112277,0.0039188983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995859,0.0001619691,0.0000200114,0.00005030059,0.00012577759,0.000055915854],"domain_scores_gemma":[0.99956685,0.00023482864,0.00008414691,0.0000344024,0.000057957717,0.000021927055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090583734,0.00062874355,0.00054435176,0.00060944376,0.00047620304,0.0006000875,0.0008813609,0.00041162458,0.0005497131],"category_scores_gemma":[0.0011167342,0.00024305296,0.000398674,0.0005894922,0.00033938815,0.0008241699,0.0006470735,0.00044841715,0.00009607877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009256249,0.000087921784,0.0007889195,0.00016189406,0.00009732277,0.00017504707,0.00009584171,0.8461246,0.006834748,0.040569182,0.0018770829,0.10309487],"study_design_scores_gemma":[0.0000106272855,0.00004848316,0.00018070167,0.0000093050485,0.0000130499375,0.00005811015,0.000022344864,0.9873942,0.0010132256,0.009137904,0.002102149,0.000009899619],"about_ca_topic_score_codex":0.0016355912,"about_ca_topic_score_gemma":0.002863645,"teacher_disagreement_score":0.0016355912,"about_ca_system_score_codex":0.00064501946,"about_ca_system_score_gemma":0.0007980908,"threshold_uncertainty_score":0.004790604},"labels":[],"label_agreement":null},{"id":"W3191227460","doi":"10.1109/icmcis52405.2021.9486396","title":"Performance Evaluation of Kubernetes Distributions (K8s, K3s, KubeEdge) in an Adaptive and Federated Cloud Infrastructure for Disadvantaged Tactical Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Cloud computing; Disadvantaged; Computer science; Computer security; Operating system","score_opus":0.030544970062472285,"score_gpt":0.2899364164920409,"score_spread":0.2593914464295686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191227460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881245,0.0001778868,0.0066139596,0.000118170436,0.000046795667,0.000102583,0.00020084661,0.0008857366,0.003729432],"genre_scores_gemma":[0.9966538,0.000046077566,0.0026588507,0.000021367816,0.0000022989245,0.000016663824,0.00015616439,0.000014405488,0.00043050712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998895,0.00025418572,0.00008910726,0.00017790911,0.00022845138,0.0003553091],"domain_scores_gemma":[0.9974189,0.000978618,0.00023511799,0.00032393876,0.00057907874,0.0004644051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020314993,0.0006770545,0.00043904598,0.0008800988,0.0007273943,0.001083628,0.0011046577,0.0004530315,0.0014851721],"category_scores_gemma":[0.003533644,0.0001403829,0.000232804,0.00089873886,0.00083507155,0.0017797033,0.0011781192,0.00059499295,0.00023184421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010401421,0.0018917744,0.033916764,0.00041843238,0.00031374453,0.0007082122,0.00042778757,0.7677842,0.044467982,0.010656211,0.0077473,0.121266134],"study_design_scores_gemma":[0.00032222513,0.0032333827,0.014511421,0.000035221983,0.000069753034,0.00037523152,0.00066456216,0.9386656,0.03821311,0.0017821091,0.0020473625,0.00007999985],"about_ca_topic_score_codex":0.008455528,"about_ca_topic_score_gemma":0.0061120423,"teacher_disagreement_score":0.008455528,"about_ca_system_score_codex":0.0022108236,"about_ca_system_score_gemma":0.00076901156,"threshold_uncertainty_score":0.016812623},"labels":[],"label_agreement":null},{"id":"W3197178084","doi":"10.32920/ryerson.14660685.v1","title":"Resource-Aware Topology Adaptation in P2P Overlay Adhoc Network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Computer science; Overlay network; Computer network; Overlay; Mobile ad hoc network; Adaptation (eye); Wireless ad hoc network; Distributed computing; Software deployment; Network topology; Resource (disambiguation); Peer-to-peer; Abstraction; Wireless network; Topology (electrical circuits); Wireless; The Internet; Network packet; Telecommunications; Mathematics","score_opus":0.03318987751051307,"score_gpt":0.252495818043315,"score_spread":0.21930594053280195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197178084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28337917,0.0014317227,0.7068302,0.00049574376,0.00014227496,0.00012267992,0.00010836784,0.0015487643,0.005941036],"genre_scores_gemma":[0.96945333,0.0002820351,0.029398551,0.00003347351,0.000026386604,0.00003208811,0.000052354964,0.000027079459,0.0006947276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.00021073206,0.00002856287,0.00009168981,0.00014792716,0.00006173977],"domain_scores_gemma":[0.9987381,0.00070670195,0.00012417941,0.00017170049,0.00018225936,0.0000769974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007840284,0.00029220906,0.00046202407,0.000523235,0.00063003384,0.00062351074,0.000821892,0.00042446278,0.00034119454],"category_scores_gemma":[0.0028066211,0.00021808667,0.00015851163,0.00068243005,0.00046604394,0.00095529493,0.00063746364,0.00038915747,0.00009812709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016029706,0.00010325106,0.002838786,0.000099213605,0.000047638452,0.00051868334,0.0003128856,0.8510619,0.027203215,0.010886783,0.0023580652,0.10440933],"study_design_scores_gemma":[0.0000067859796,0.000035610254,0.00039109876,0.0000023609766,0.000008073928,0.00009036194,0.00005574263,0.9933078,0.0020974837,0.0030892114,0.0009082057,0.0000071173927],"about_ca_topic_score_codex":0.0033526744,"about_ca_topic_score_gemma":0.0022115484,"teacher_disagreement_score":0.0033526744,"about_ca_system_score_codex":0.0004539724,"about_ca_system_score_gemma":0.0004378903,"threshold_uncertainty_score":0.0066663027},"labels":[],"label_agreement":null},{"id":"W3200860590","doi":"10.1007/s11036-021-01820-7","title":"A Local Betweenness Centrality Based Forwarding Technique for Social Opportunistic IoT Networks","year":2021,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Betweenness centrality; Computer science; Centrality; Computer network; Node (physics); Routing protocol; Routing (electronic design automation); Distributed computing","score_opus":0.023525002026098037,"score_gpt":0.2711044848980232,"score_spread":0.24757948287192516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200860590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024095314,0.00038681933,0.9704724,0.0002597418,0.00014957054,0.0001542372,0.00011976352,0.00057732954,0.0037849124],"genre_scores_gemma":[0.6688726,0.0005166406,0.32169154,0.00017423049,0.00022746011,0.00019518993,0.0003942872,0.0001304956,0.007797523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999335,0.00013963804,0.000025543486,0.00011229224,0.0003126672,0.000074870135],"domain_scores_gemma":[0.9981998,0.0008219565,0.00011561707,0.00030577084,0.00043904997,0.00011770575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579223,0.0004830767,0.0008072112,0.0017136593,0.001890456,0.0009897858,0.0017344201,0.00080303114,0.0020602567],"category_scores_gemma":[0.0038391359,0.00023531099,0.0006804616,0.0014565318,0.0006020043,0.0015026518,0.0015374406,0.0007235104,0.00048655234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004415842,0.00049320096,0.0048355483,0.0003627647,0.0002532245,0.00082746835,0.0013917763,0.23208408,0.043523453,0.15023467,0.016926661,0.5486255],"study_design_scores_gemma":[0.000035739224,0.00013508876,0.0007362265,0.000026905616,0.000096864525,0.0005080532,0.00020295884,0.96140623,0.0060755145,0.02182978,0.0089019295,0.0000446964],"about_ca_topic_score_codex":0.0052808733,"about_ca_topic_score_gemma":0.013840798,"teacher_disagreement_score":0.0052808733,"about_ca_system_score_codex":0.000939034,"about_ca_system_score_gemma":0.0012797919,"threshold_uncertainty_score":0.010500312},"labels":[],"label_agreement":null},{"id":"W3208714418","doi":"10.1109/ds-rt52167.2021.9576145","title":"An algorithm for threading assignment in large-scale wireless network mobile simulations","year":2021,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Compute Canada","keywords":"Synchronizing; Computer science; Thread (computing); Synchronization (alternating current); Multithreading; Parallel computing; Threading (protein sequence); Wireless; Wireless network; Distributed computing; Algorithm; Real-time computing; Computer network; Transmission (telecommunications)","score_opus":0.018025419979357728,"score_gpt":0.28025701051828544,"score_spread":0.2622315905389277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208714418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034740714,0.000056934136,0.99392974,0.00006148591,0.000034321783,0.00012446949,0.000032869662,0.0016237064,0.00066237047],"genre_scores_gemma":[0.049840458,0.000059054375,0.9481519,0.000040788906,0.000020036596,0.00056257,0.00015842642,0.0002973835,0.000869302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986364,0.0005327429,0.00014004251,0.00020825856,0.0003167624,0.00016582946],"domain_scores_gemma":[0.99683553,0.0016518065,0.00022136416,0.00042038373,0.0006036021,0.00026735658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033232032,0.0014568301,0.0011794453,0.0009053322,0.00167424,0.0016267085,0.0029408238,0.0014321363,0.0046302103],"category_scores_gemma":[0.007522316,0.0010283759,0.0014231747,0.0010765832,0.0010053474,0.001559809,0.0023136279,0.002253474,0.0012767189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004141747,0.00026059218,0.0024595303,0.00027118318,0.00015980654,0.00021237842,0.00060032017,0.76553136,0.006944795,0.038882762,0.0049365126,0.17932653],"study_design_scores_gemma":[0.000064989326,0.000026891828,0.00005946173,0.000010258092,0.00001155343,0.000019749545,0.000018784805,0.9892203,0.0009324142,0.007678492,0.001949386,0.000007804443],"about_ca_topic_score_codex":0.0051429425,"about_ca_topic_score_gemma":0.0047933925,"teacher_disagreement_score":0.0051429425,"about_ca_system_score_codex":0.0013094591,"about_ca_system_score_gemma":0.0026296435,"threshold_uncertainty_score":0.017574966},"labels":[],"label_agreement":null},{"id":"W3215475368","doi":"10.1109/tnse.2021.3130948","title":"Efficient Allocation of Resource-Intensive Mobile Cyber–Physical Social System Applications on a Heterogeneous Mobile Ad Hoc Cloud","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Hankuk University of Foreign Studies","keywords":"Computer science; Resource allocation; Distributed computing; Cloud computing; Computer network; Wireless ad hoc network; Resource management (computing); Key (lock); Mobile computing; Latency (audio); Wireless; Computer security; Telecommunications","score_opus":0.008915757605798961,"score_gpt":0.21762097491286891,"score_spread":0.20870521730706995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215475368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69863945,0.00040126426,0.29374626,0.00025145308,0.00006168341,0.00032153013,0.00004712619,0.00035406265,0.006177103],"genre_scores_gemma":[0.9848437,0.00006323601,0.014538264,0.000023715947,0.0000075859016,0.000032529326,0.000014939839,0.000009286589,0.00046664325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943656,0.000120183795,0.000023312694,0.000081093356,0.000115076335,0.00022365943],"domain_scores_gemma":[0.9990225,0.00031181495,0.0001409038,0.00013407478,0.00016498887,0.0002257532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008604984,0.00045274766,0.00065490504,0.00048277265,0.0009066154,0.0009515125,0.0010525003,0.00030861187,0.0008934609],"category_scores_gemma":[0.0016270215,0.00025454708,0.00031808898,0.0005135542,0.00044213078,0.0009792253,0.0013008057,0.00037717234,0.00014030101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005331493,0.00039890385,0.005012531,0.000063209365,0.00007126618,0.00032285,0.00016839843,0.8868223,0.019905508,0.010019036,0.0014307213,0.07525212],"study_design_scores_gemma":[0.000007969636,0.000034729193,0.0003833189,0.0000013445682,0.0000064563283,0.000013350396,0.000033596487,0.9976427,0.000998662,0.00067445054,0.00019938822,0.0000040128994],"about_ca_topic_score_codex":0.007202886,"about_ca_topic_score_gemma":0.00857813,"teacher_disagreement_score":0.007202886,"about_ca_system_score_codex":0.0012827634,"about_ca_system_score_gemma":0.0018597346,"threshold_uncertainty_score":0.014321923},"labels":[],"label_agreement":null},{"id":"W3215600871","doi":"10.1109/tvt.2009.2020502","title":"SMART: A Secure Multi-Layer Credit Based Incentive Scheme for Delay-Tolerant Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Ontario Tech University","funders":"","keywords":"Computer network; Computer science; Network packet; Node (physics); Scheme (mathematics); Bundle; Packet forwarding; Wireless; Incentive; Distributed computing; Path (computing); Engineering; Telecommunications","score_opus":0.02123544391243508,"score_gpt":0.25432672724216643,"score_spread":0.23309128332973134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215600871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04323741,0.0005172257,0.94736433,0.00090687216,0.000311209,0.00047830632,0.00031385873,0.0012382724,0.005632447],"genre_scores_gemma":[0.8890572,0.0002889283,0.10314585,0.0002424804,0.0001102797,0.00025093765,0.00021227999,0.0000375588,0.00665441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921024,0.00019199264,0.00007656462,0.000102156024,0.00030670097,0.00011225863],"domain_scores_gemma":[0.9987237,0.00032752627,0.00025103765,0.00030531312,0.00021754293,0.0001748982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015168107,0.00051732006,0.00060938275,0.00061358564,0.00081778714,0.0008898468,0.0017336599,0.00091281545,0.003530856],"category_scores_gemma":[0.0030774188,0.0002310577,0.00032339548,0.0007294147,0.00086734316,0.0023488197,0.0022162336,0.0010660975,0.00059479446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002324775,0.00043750665,0.0028934998,0.00047302188,0.00011170537,0.00061535614,0.000501337,0.23567967,0.0460632,0.32591,0.021554178,0.36343572],"study_design_scores_gemma":[0.00026259344,0.00034843394,0.0005100172,0.000029898745,0.000042927582,0.00036265535,0.000056250694,0.90718216,0.010288992,0.057627313,0.0232096,0.00007925526],"about_ca_topic_score_codex":0.0008922406,"about_ca_topic_score_gemma":0.0010048533,"teacher_disagreement_score":0.003530856,"about_ca_system_score_codex":0.0011071212,"about_ca_system_score_gemma":0.001204412,"threshold_uncertainty_score":0.011811912},"labels":[],"label_agreement":null},{"id":"W4205435039","doi":"10.1109/milcom52596.2021.9653050","title":"Towards a COTS-Enabled Federated Cloud Architecture for Adaptive C2 in Coalition Tactical Operations: A Performance Analysis of Kubernetes","year":2021,"lang":"en","type":"article","venue":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"North Atlantic Treaty Organization","keywords":"Computer science; Cloud computing; Architecture; Orchestration; Shared resource; Edge computing; Computer security; Distributed computing; Operating system","score_opus":0.055173593541204144,"score_gpt":0.2873469117640775,"score_spread":0.23217331822287335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205435039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97677666,0.00025158635,0.017871605,0.00012974908,0.00003549586,0.00007539569,0.000091225316,0.0004761602,0.004292062],"genre_scores_gemma":[0.99322295,0.00004797569,0.0060853264,0.000018167782,0.0000021166168,0.000010900717,0.00006229409,0.000012809931,0.00053743494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993919,0.00012977865,0.000030203677,0.00008439584,0.0001776349,0.00018606358],"domain_scores_gemma":[0.99884605,0.00031368167,0.00008432232,0.00024036273,0.00035265792,0.0001629162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300064,0.00046670856,0.00031190997,0.0005610444,0.00057549967,0.0013544855,0.0008264427,0.00038322457,0.0016894508],"category_scores_gemma":[0.0023215406,0.00011677205,0.00024029506,0.0005809961,0.00058817357,0.0012562422,0.00078573485,0.00052526983,0.00020333505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046686707,0.0007975186,0.024156053,0.00025780933,0.00019054954,0.0005441229,0.00027996337,0.7753956,0.05146916,0.023574537,0.0042197076,0.114446364],"study_design_scores_gemma":[0.00004060771,0.0005564012,0.0045660962,0.000011844686,0.000025752648,0.000118630516,0.00014480458,0.98047936,0.011613381,0.001388818,0.0010381044,0.000016097823],"about_ca_topic_score_codex":0.009417445,"about_ca_topic_score_gemma":0.006328238,"teacher_disagreement_score":0.009417445,"about_ca_system_score_codex":0.0014249472,"about_ca_system_score_gemma":0.0007996636,"threshold_uncertainty_score":0.018725276},"labels":[],"label_agreement":null},{"id":"W4206480403","doi":"10.1109/tmc.2022.3141930","title":"On the Impact of Recharging Behavior on Mobility","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Node (physics); Probability density function; Bounded function; Distortion (music); Inversion (geology); Regular polygon; Topology (electrical circuits); Mathematical optimization; Mathematics; Computer network; Mathematical analysis; Physics; Geometry; Statistics; Acoustics; Bandwidth (computing)","score_opus":0.031142329604661827,"score_gpt":0.2882260434484933,"score_spread":0.25708371384383144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206480403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5105304,0.0038346655,0.42525542,0.010103793,0.0004165657,0.00013720304,0.00036756953,0.00038345758,0.04897085],"genre_scores_gemma":[0.9935369,0.00096062524,0.0037199473,0.00014015657,0.00008330415,0.000024116775,0.000025892878,0.000033744313,0.0014752347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999273,0.00031642427,0.000021534586,0.00009319347,0.00012686802,0.00016893224],"domain_scores_gemma":[0.9925781,0.005759244,0.0006169181,0.0004491337,0.00040648793,0.00019015966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011507806,0.00067410443,0.0005893919,0.00072028185,0.00094630086,0.0013293979,0.0009536225,0.0012155547,0.00226684],"category_scores_gemma":[0.018694231,0.00027861103,0.00055823673,0.00070982095,0.001847359,0.0035686775,0.0014653458,0.0011115358,0.00028375644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000960321,0.000050295457,0.0051313555,0.00010005996,0.000035993595,0.0006326361,0.00030879537,0.8665533,0.0039153583,0.10889513,0.0014967978,0.012784189],"study_design_scores_gemma":[0.000005617028,0.000038401384,0.001281812,0.000022310109,0.000017683473,0.00017586208,0.00011990521,0.97659063,0.0005939663,0.020390024,0.00074566377,0.000018172757],"about_ca_topic_score_codex":0.009724007,"about_ca_topic_score_gemma":0.0050908043,"teacher_disagreement_score":0.009724007,"about_ca_system_score_codex":0.0014286702,"about_ca_system_score_gemma":0.0007087482,"threshold_uncertainty_score":0.019334853},"labels":[],"label_agreement":null},{"id":"W4206752690","doi":"10.1155/2021/1018904","title":"Escape Path Obstacle-Based Mobility Model (EPOM) for Campus Delay-Tolerant Network","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Petroleum Technology Development Fund","keywords":"Pedestrian; Mobility model; Computer science; Obstacle; Path (computing); Social force model; Random walk; Collision avoidance; Collision; Movement (music); Simulation; Distributed computing; Real-time computing; Computer network; Transport engineering; Computer security; Geography; Mathematics; Engineering; Statistics","score_opus":0.01578662847922987,"score_gpt":0.24799915478265794,"score_spread":0.23221252630342806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206752690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20947626,0.00063488784,0.77966976,0.0007592028,0.0001444885,0.00012038412,0.0009305439,0.0004883659,0.007776083],"genre_scores_gemma":[0.96958816,0.00041272736,0.024586596,0.00007155718,0.00002997714,0.00017342664,0.00039976134,0.000038776692,0.0046990197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998493,0.000042072083,0.0000068289305,0.000037703172,0.000035059533,0.000029010154],"domain_scores_gemma":[0.99974555,0.000104529885,0.00006042386,0.000021069261,0.00004934046,0.000019033076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003103154,0.0004784441,0.00038947724,0.00062258315,0.00029569367,0.00044195386,0.0010970733,0.0007238315,0.0010391744],"category_scores_gemma":[0.0010573898,0.00017975442,0.00043169365,0.00063530204,0.00035467953,0.0007015995,0.0004651869,0.00046716633,0.00019688068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016753036,0.000013213369,0.00044223107,0.000011263032,0.000005876474,0.00004179671,0.000026606904,0.9908584,0.00043890346,0.005218133,0.00033969744,0.0025872965],"study_design_scores_gemma":[0.0000016767831,0.00000893129,0.000083585,0.0000013898264,0.0000017417337,0.00000920677,0.000006200345,0.99869835,0.000038741076,0.000993329,0.00015470633,0.0000020337545],"about_ca_topic_score_codex":0.0075209816,"about_ca_topic_score_gemma":0.004925181,"teacher_disagreement_score":0.0075209816,"about_ca_system_score_codex":0.00078562665,"about_ca_system_score_gemma":0.0004806155,"threshold_uncertainty_score":0.014954388},"labels":[],"label_agreement":null},{"id":"W4210383480","doi":"10.1109/globecom46510.2021.9685074","title":"High Altitude Platform Station (HAPS) Assisted Computing for Intelligent Transportation Systems","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Carleton University","funders":"","keywords":"Computer science; Distributed computing; Edge computing; Computation; Computer network; Edge device; Enhanced Data Rates for GSM Evolution; Fog computing; Real-time computing; Cloud computing; Telecommunications; Operating system","score_opus":0.09351272335842241,"score_gpt":0.31930240771299667,"score_spread":0.22578968435457425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210383480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40027314,0.0027334534,0.53832525,0.0017925058,0.0006636657,0.00018159319,0.00046047496,0.0027558408,0.052814115],"genre_scores_gemma":[0.95736915,0.00057930604,0.03775274,0.000094710995,0.000053508396,0.0000330257,0.0002687641,0.00004099639,0.0038078167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999331,0.000014635712,0.0000018838733,0.000009375114,0.000018433399,0.000022436256],"domain_scores_gemma":[0.99987316,0.000030285732,0.000008381244,0.000028228085,0.00003417586,0.000025764175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001312271,0.00026439133,0.00014786216,0.00012658232,0.00035347228,0.0006429134,0.00044291903,0.00022468806,0.0028766599],"category_scores_gemma":[0.0003763721,0.000070689945,0.00015401375,0.00034670168,0.00024323448,0.0009005334,0.000749959,0.00051924767,0.00035083774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004927869,0.00016858768,0.00967336,0.00029246596,0.00011798468,0.000538318,0.00031214298,0.5829492,0.03692472,0.08642167,0.035336837,0.246772],"study_design_scores_gemma":[0.000023776543,0.00012787723,0.0015332095,0.000016284826,0.000020020252,0.000055346212,0.00010309205,0.9587068,0.005132211,0.012353492,0.021913445,0.000014412294],"about_ca_topic_score_codex":0.006804318,"about_ca_topic_score_gemma":0.009311772,"teacher_disagreement_score":0.006804318,"about_ca_system_score_codex":0.00044685238,"about_ca_system_score_gemma":0.0009033904,"threshold_uncertainty_score":0.01352942},"labels":[],"label_agreement":null},{"id":"W4210911128","doi":"10.1007/978-1-4614-6170-8_100072","title":"Smartphone Proximity Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01868906558581808,"score_gpt":0.20186141219559983,"score_spread":0.18317234660978177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210911128","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008995565,0.06367609,0.192199,0.0027736023,0.005499065,0.00020173007,0.00077567983,0.001887949,0.72399133],"genre_scores_gemma":[0.11730181,0.054787718,0.041202784,0.0009592182,0.0016764916,0.00021520267,0.0011465354,0.00026351496,0.7824467],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998356,0.00002230211,0.000007046682,0.00004159984,0.000070577364,0.000022893346],"domain_scores_gemma":[0.9998579,0.000038573467,0.000009406235,0.000031154505,0.000046944242,0.00001592033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013425553,0.00070105144,0.00035511688,0.0006234694,0.0005890701,0.0013732453,0.0008282725,0.0008744848,0.029666144],"category_scores_gemma":[0.00058640336,0.0002891774,0.00018887741,0.0012087086,0.00029168554,0.0021157216,0.0014321472,0.0008172114,0.011996828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005414729,0.000033805463,0.00022006666,0.00054916495,0.000015652082,0.00020346126,0.0002469606,0.004783393,0.0040009893,0.13223995,0.16475303,0.6928994],"study_design_scores_gemma":[0.0000048735633,0.000048898604,0.00029514305,0.00018825241,0.000014976255,0.0006111081,0.00016870283,0.0074846977,0.0017036109,0.028133133,0.9613298,0.000016906386],"about_ca_topic_score_codex":0.0015259564,"about_ca_topic_score_gemma":0.0035006646,"teacher_disagreement_score":0.029666144,"about_ca_system_score_codex":0.00065408973,"about_ca_system_score_gemma":0.00040759234,"threshold_uncertainty_score":0.099243164},"labels":[],"label_agreement":null},{"id":"W4214832132","doi":"10.1007/978-3-030-87049-2_14","title":"Geocommunity Based Data Forwarding in Social Delay Tolerant Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network","score_opus":0.05233188502029449,"score_gpt":0.26052865086232824,"score_spread":0.20819676584203375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214832132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05066502,0.00415934,0.9122297,0.0014096283,0.00071062497,0.00014983829,0.0002542955,0.0006360065,0.029785566],"genre_scores_gemma":[0.8650147,0.0036885678,0.102036834,0.00029572225,0.0003477349,0.0001562199,0.0003405538,0.00007937373,0.028040333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972373,0.0000528105,0.000012143368,0.00006714112,0.000094374394,0.000049800157],"domain_scores_gemma":[0.99946886,0.00030347647,0.000046893496,0.000066207416,0.00008055924,0.000033964952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053401466,0.00040310976,0.00061627576,0.00080731744,0.0009390161,0.0014456292,0.0014926981,0.0010214492,0.002519379],"category_scores_gemma":[0.0013942012,0.00019823748,0.00034474602,0.001471903,0.00072978006,0.0015825522,0.0012567214,0.0006525317,0.00047994827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022149157,0.00014824265,0.0010914037,0.00036768013,0.00005632729,0.0003974865,0.0004510627,0.28668433,0.01168576,0.39416432,0.017508486,0.28722346],"study_design_scores_gemma":[0.000020261978,0.00012175112,0.00037531235,0.000039383405,0.000036247904,0.0003036847,0.000187084,0.83381605,0.004891044,0.12739782,0.032785602,0.000025752244],"about_ca_topic_score_codex":0.0020150996,"about_ca_topic_score_gemma":0.0026158977,"teacher_disagreement_score":0.002519379,"about_ca_system_score_codex":0.0010693128,"about_ca_system_score_gemma":0.00063373364,"threshold_uncertainty_score":0.008428156},"labels":[],"label_agreement":null},{"id":"W4229779962","doi":"10.32920/ryerson.14663643","title":"RAIMA: a Framework for the Design and Analysis of Self-Adaptive Egocentric Social Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Semantics (computer science); Inference; Social network (sociolinguistics); Context (archaeology); Visualization; Matching (statistics); Data science; Distributed computing; Human–computer interaction; World Wide Web; Artificial intelligence; Social media","score_opus":0.04404787783576872,"score_gpt":0.2737052772332902,"score_spread":0.22965739939752147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229779962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000548951,0.00014342663,0.99727976,0.0001383709,0.000025458083,0.0000787138,0.00007718353,0.0003546696,0.0013534484],"genre_scores_gemma":[0.045074802,0.0004923094,0.95028484,0.00012313064,0.00006997623,0.00065441726,0.00032988007,0.0002076139,0.0027630818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747986,0.0011375904,0.00019990625,0.00046302474,0.00056672277,0.00015292375],"domain_scores_gemma":[0.99705935,0.0013091061,0.00037124465,0.0006307933,0.00045997225,0.00016960433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045805536,0.0013614253,0.0009818156,0.002039967,0.0012032103,0.0040609455,0.0039374996,0.0014642237,0.0038530403],"category_scores_gemma":[0.00959742,0.0010293022,0.0026234128,0.001579448,0.0024202461,0.004365152,0.0033695034,0.0025453847,0.0013147077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031783522,0.000039759612,0.000757433,0.00024596558,0.0000946938,0.00022989744,0.00059221993,0.15004742,0.0016555758,0.78897595,0.0038584217,0.05347081],"study_design_scores_gemma":[0.000020162635,0.000035982128,0.00017723629,0.0000854805,0.000034251905,0.00013796214,0.00014646257,0.57460916,0.00097509066,0.36302078,0.060725566,0.00003192927],"about_ca_topic_score_codex":0.005441365,"about_ca_topic_score_gemma":0.006629851,"teacher_disagreement_score":0.005441365,"about_ca_system_score_codex":0.0019250995,"about_ca_system_score_gemma":0.0023701694,"threshold_uncertainty_score":0.02422458},"labels":[],"label_agreement":null},{"id":"W4230310343","doi":"10.32920/ryerson.14648133","title":"Formation and inter-piconet communications in cognitive personal area networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"McMaster University","keywords":"Bridging (networking); Computer science; Computer network; Rendezvous; Network packet; Node (physics); Bridge (graph theory); Distributed computing; Probabilistic logic; Topology (electrical circuits); Engineering","score_opus":0.0790001440025739,"score_gpt":0.2953940891710378,"score_spread":0.21639394516846394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230310343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06516275,0.0011557445,0.9240629,0.00021524663,0.00011345848,0.000037373447,0.000022379343,0.00015437228,0.00907587],"genre_scores_gemma":[0.9321159,0.0011523075,0.06085809,0.00011462747,0.00008470886,0.000076612785,0.000032744127,0.000028344219,0.00553671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935883,0.00018858931,0.0000205546,0.00009838294,0.00023037291,0.00010316984],"domain_scores_gemma":[0.9993286,0.00034106697,0.00009072422,0.000114050286,0.000095363306,0.000030147778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007880451,0.0004376904,0.00036631007,0.0005645397,0.00070929044,0.0011802657,0.000887506,0.0007209507,0.0007538853],"category_scores_gemma":[0.0022311,0.00025838724,0.00046192762,0.00061744684,0.00085925916,0.0013763555,0.0010650788,0.0006109998,0.0001619763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012155679,0.00010037425,0.0026483922,0.0001345008,0.000066752356,0.00037112934,0.0006314067,0.5916539,0.017466934,0.30327046,0.0013200562,0.082214504],"study_design_scores_gemma":[0.0000080260525,0.00006449813,0.00056672166,0.000010136867,0.000017497605,0.00016775537,0.00008097682,0.9659841,0.002499219,0.027469782,0.0031116486,0.00001960826],"about_ca_topic_score_codex":0.002161026,"about_ca_topic_score_gemma":0.0020530333,"teacher_disagreement_score":0.002161026,"about_ca_system_score_codex":0.0010392328,"about_ca_system_score_gemma":0.0009111376,"threshold_uncertainty_score":0.007540226},"labels":[],"label_agreement":null},{"id":"W4231894427","doi":"10.32920/ryerson.14657526.v1","title":"A history-based energy-efficient routing protocol for opportunistic networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Network packet; Overhead (engineering); Enhanced Interior Gateway Routing Protocol; Energy consumption; Protocol (science); Energy (signal processing); Routing (electronic design automation); Wireless Routing Protocol; Engineering; Medicine; Mathematics; Electrical engineering","score_opus":0.07569004943726862,"score_gpt":0.2882568192028428,"score_spread":0.21256676976557418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231894427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03345771,0.00086379086,0.9567237,0.00036565927,0.00023846241,0.00031887714,0.00024279165,0.001088564,0.006700436],"genre_scores_gemma":[0.6739897,0.0013123455,0.31322005,0.0002581393,0.00013477459,0.00052557414,0.00067576434,0.000121961944,0.009761764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996737,0.00007029927,0.00002634599,0.000049217924,0.00014806574,0.00003241858],"domain_scores_gemma":[0.99931514,0.00027843696,0.0000970448,0.00014050235,0.00012423031,0.00004463122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250315,0.00032756745,0.0003750746,0.00046881248,0.0006050576,0.0006215175,0.0011940724,0.00038744955,0.0010091931],"category_scores_gemma":[0.0017034383,0.00019839521,0.00023954292,0.00048482782,0.00047924902,0.0012022302,0.0009530212,0.0006014383,0.00017968501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004543884,0.00020182718,0.0028624898,0.00058869313,0.00015337064,0.00087670813,0.0006240603,0.25457513,0.06479449,0.20312382,0.012376567,0.45936844],"study_design_scores_gemma":[0.00006691707,0.0002804139,0.0008865202,0.000060556547,0.00007639487,0.00073751237,0.000150855,0.8791689,0.022968858,0.051127154,0.04438009,0.00009584147],"about_ca_topic_score_codex":0.0012817248,"about_ca_topic_score_gemma":0.0021599238,"teacher_disagreement_score":0.0012817248,"about_ca_system_score_codex":0.00045368492,"about_ca_system_score_gemma":0.00089086994,"threshold_uncertainty_score":0.0033761263},"labels":[],"label_agreement":null},{"id":"W4233487381","doi":"10.1007/978-1-4939-7131-2_100678","title":"Mobile Social Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.025280976358846474,"score_gpt":0.2373651693174317,"score_spread":0.21208419295858524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233487381","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030301271,0.01710482,0.047343146,0.004871372,0.0034877334,0.00012636273,0.000597476,0.0005232652,0.92291564],"genre_scores_gemma":[0.052559417,0.026572468,0.017502625,0.0011365762,0.0020250226,0.00021670762,0.0010215893,0.00021238382,0.89875317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984515,0.00003123568,0.000005152366,0.000037614165,0.00006251156,0.000018408835],"domain_scores_gemma":[0.9998659,0.000047379544,0.00000871427,0.000026064654,0.000030756833,0.000021203998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017138547,0.0006489593,0.0003042943,0.000882099,0.0009048329,0.002175854,0.0006796735,0.00096491707,0.041092157],"category_scores_gemma":[0.0007189356,0.00021265265,0.00021798586,0.0014388348,0.0005540665,0.003332742,0.0014916471,0.00085065525,0.01598647],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014244545,0.000026239511,0.00012010054,0.00027168726,0.0000091173515,0.00011971254,0.00031701583,0.0017770821,0.0008360587,0.42810598,0.21223463,0.3561682],"study_design_scores_gemma":[0.0000020589846,0.000009662252,0.00011629249,0.00009365561,0.0000042432434,0.00019615704,0.0001048607,0.001802346,0.00019266318,0.05975919,0.9377128,0.0000061277124],"about_ca_topic_score_codex":0.0009807036,"about_ca_topic_score_gemma":0.0019993675,"teacher_disagreement_score":0.041092157,"about_ca_system_score_codex":0.0008505308,"about_ca_system_score_gemma":0.00053309265,"threshold_uncertainty_score":0.13746697},"labels":[],"label_agreement":null},{"id":"W4235154236","doi":"10.1002/9780470512494.biblio","title":"Bibliography","year":2007,"lang":"en","type":"other","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Humanities; Library science; Art; Computer science","score_opus":0.018229290421968945,"score_gpt":0.2491533797717851,"score_spread":0.23092408934981615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235154236","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005461841,0.034334764,0.007612868,0.0032229242,0.011425659,0.00015700996,0.009882239,0.0013958729,0.9314225],"genre_scores_gemma":[0.0037211129,0.033858906,0.004887634,0.0014455721,0.0021248395,0.00012268488,0.012618448,0.00067788287,0.940543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952877,0.000048918435,0.000032425996,0.00007185671,0.0002795257,0.00003855147],"domain_scores_gemma":[0.99842924,0.00035414533,0.00005438946,0.0001815579,0.0008452673,0.00013533863],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00048212858,0.0009212128,0.00086591626,0.007413056,0.00137836,0.0027289144,0.0015195726,0.0008354552,0.38796818],"category_scores_gemma":[0.0037157407,0.00028284622,0.00041413904,0.01201332,0.0004144597,0.0025232898,0.0011586596,0.0010311459,0.28959045],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008057097,0.000017058599,0.000066638364,0.00025606732,0.0000029286953,0.000020724718,0.000024265375,0.00018611147,0.000070353206,0.005297504,0.89041567,0.103634566],"study_design_scores_gemma":[0.0000018003401,0.000002996479,0.00008858505,0.00019688514,0.000005162768,0.000037427548,0.000021298825,0.00006660542,0.00006881459,0.0019413057,0.99756575,0.0000034699285],"about_ca_topic_score_codex":0.009666815,"about_ca_topic_score_gemma":0.01914561,"teacher_disagreement_score":0.6120318,"about_ca_system_score_codex":0.0013439787,"about_ca_system_score_gemma":0.002003525,"threshold_uncertainty_score":0.8729891},"labels":[],"label_agreement":null},{"id":"W4235721904","doi":"10.32920/ryerson.14660685","title":"Resource-Aware Topology Adaptation in P2P Overlay Adhoc Network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Computer science; Overlay network; Computer network; Mobile ad hoc network; Overlay; Distributed computing; Wireless ad hoc network; Adaptation (eye); Software deployment; Network topology; Peer-to-peer; Wireless network; Abstraction; Resource (disambiguation); Topology (electrical circuits); Wireless; The Internet; Network packet; Telecommunications; Mathematics","score_opus":0.03318987751051307,"score_gpt":0.252495818043315,"score_spread":0.21930594053280195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235721904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28337917,0.0014317227,0.7068302,0.00049574376,0.00014227496,0.00012267992,0.00010836784,0.0015487643,0.005941036],"genre_scores_gemma":[0.96945333,0.0002820351,0.029398551,0.00003347351,0.000026386604,0.00003208811,0.000052354964,0.000027079459,0.0006947276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994593,0.00021073206,0.00002856287,0.00009168981,0.00014792716,0.00006173977],"domain_scores_gemma":[0.9987381,0.00070670195,0.00012417941,0.00017170049,0.00018225936,0.0000769974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007840284,0.00029220906,0.00046202407,0.000523235,0.00063003384,0.00062351074,0.000821892,0.00042446278,0.00034119454],"category_scores_gemma":[0.0028066211,0.00021808667,0.00015851163,0.00068243005,0.00046604394,0.00095529493,0.00063746364,0.00038915747,0.00009812709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016029706,0.00010325106,0.002838786,0.000099213605,0.000047638452,0.00051868334,0.0003128856,0.8510619,0.027203215,0.010886783,0.0023580652,0.10440933],"study_design_scores_gemma":[0.0000067859796,0.000035610254,0.00039109876,0.0000023609766,0.000008073928,0.00009036194,0.00005574263,0.9933078,0.0020974837,0.0030892114,0.0009082057,0.0000071173927],"about_ca_topic_score_codex":0.0033526744,"about_ca_topic_score_gemma":0.0022115484,"teacher_disagreement_score":0.0033526744,"about_ca_system_score_codex":0.0004539724,"about_ca_system_score_gemma":0.0004378903,"threshold_uncertainty_score":0.0066663027},"labels":[],"label_agreement":null},{"id":"W4236971713","doi":"10.1007/978-1-4939-7131-2_101083","title":"Smartphone Proximity Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.023826404362383268,"score_gpt":0.2142096080112156,"score_spread":0.19038320364883235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236971713","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009419221,0.066986226,0.18053065,0.0032661106,0.006710375,0.00020631243,0.00080561027,0.0018501366,0.7302254],"genre_scores_gemma":[0.13242048,0.060208283,0.03951796,0.0010942098,0.0021729728,0.00023564203,0.001229275,0.00027439545,0.7628468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983287,0.000022327202,0.0000071331,0.00004356139,0.00007020593,0.000023862345],"domain_scores_gemma":[0.99984145,0.00004440595,0.000010455383,0.00003519285,0.000049909435,0.000018450966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014264131,0.0006958512,0.00035091583,0.00059723575,0.0005912323,0.0014316365,0.0008205164,0.00089088856,0.029718684],"category_scores_gemma":[0.00065809,0.0002850058,0.00019390915,0.0011678231,0.00029506933,0.0022224244,0.0014655092,0.00086800166,0.0118085565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005996421,0.00003580094,0.00022719674,0.00062337844,0.00001672998,0.00020608169,0.00025082997,0.0050033075,0.003901531,0.1536273,0.17243038,0.6636175],"study_design_scores_gemma":[0.000004840732,0.000050032108,0.00028854437,0.00018865612,0.000014847941,0.00058534165,0.0001647303,0.00717402,0.0015582079,0.030409874,0.9595449,0.000016037404],"about_ca_topic_score_codex":0.0013776722,"about_ca_topic_score_gemma":0.0029927723,"teacher_disagreement_score":0.029718684,"about_ca_system_score_codex":0.0006805482,"about_ca_system_score_gemma":0.0004142565,"threshold_uncertainty_score":0.09941894},"labels":[],"label_agreement":null},{"id":"W4237008187","doi":"10.1353/mdr.2006.0012","title":"SuperGaming: Ubiquitous Play and Performance for Massively Scaled Community","year":2005,"lang":"en","type":"article","venue":"Modern Drama","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Massively parallel; History; Parallel computing","score_opus":0.028504680620274475,"score_gpt":0.24286654263049495,"score_spread":0.21436186201022048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237008187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3467946,0.0020446624,0.5880777,0.0016712694,0.00058990903,0.0004457269,0.0007341992,0.024739178,0.034902718],"genre_scores_gemma":[0.9346551,0.00031724805,0.056008466,0.00019952182,0.00011980382,0.00012055626,0.00037377156,0.00037070195,0.007834965],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960667,0.000089261026,0.000011754257,0.000075213575,0.00011158916,0.00010554757],"domain_scores_gemma":[0.99881846,0.0003776175,0.00005235118,0.00030908693,0.00012278928,0.00031971541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085437734,0.00081063097,0.0008196669,0.0005874918,0.0015338208,0.0015901453,0.002407687,0.00082321273,0.011279084],"category_scores_gemma":[0.0027024676,0.00038055622,0.00024926435,0.00077863596,0.0011235436,0.0031607163,0.0042423527,0.0011759744,0.0010735978],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052972697,0.0011573987,0.008812442,0.00038496032,0.00018580823,0.0010165564,0.0027295833,0.1033196,0.044903558,0.15785931,0.0753908,0.59894276],"study_design_scores_gemma":[0.00024376865,0.00048778544,0.0022247108,0.00003519911,0.00006386635,0.00044828947,0.0008799883,0.86964756,0.009942252,0.08665365,0.029301737,0.00007132127],"about_ca_topic_score_codex":0.002745625,"about_ca_topic_score_gemma":0.004824602,"teacher_disagreement_score":0.011279084,"about_ca_system_score_codex":0.0006418594,"about_ca_system_score_gemma":0.0007246238,"threshold_uncertainty_score":0.037732244},"labels":[],"label_agreement":null},{"id":"W4237072601","doi":"10.1561/1300000059","title":"Duality of the Max-Plus and Min-Plus Network Calculus","year":2017,"lang":"en","type":"article","venue":"Foundations and Trends® in Networking","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Routing (electronic design automation); Multipath routing; Wireless network; Wireless; Dynamic Source Routing; Routing protocol; Telecommunications","score_opus":0.04802966345836785,"score_gpt":0.2996034039564728,"score_spread":0.25157374049810494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237072601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013850864,0.0010256133,0.9285907,0.0012367293,0.0002328806,0.000053004085,0.00023972006,0.00020935173,0.054561157],"genre_scores_gemma":[0.65940464,0.0029236702,0.3104397,0.0011838742,0.0010485543,0.0004275544,0.00038720554,0.00026543406,0.023919456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666685,0.0010541168,0.00021068509,0.0007070698,0.0010304656,0.00033085977],"domain_scores_gemma":[0.9967687,0.0017567085,0.00028855,0.0003578376,0.0005877467,0.00024060422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039907824,0.00067755283,0.00090312614,0.001342225,0.0013288909,0.004898195,0.0014109234,0.0008487824,0.004194989],"category_scores_gemma":[0.0063001444,0.0005031981,0.0015429519,0.0013034168,0.0046278615,0.007076241,0.0026852973,0.0028386144,0.0008948884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006841298,0.000004456135,0.000030741583,0.000008931009,0.000002474547,0.00001671429,0.000044206325,0.0015713271,0.0001098831,0.99628496,0.00021159141,0.001707838],"study_design_scores_gemma":[0.0000063739712,0.000012596452,0.000055332282,0.000010753631,0.000007474112,0.000057116926,0.00003160933,0.025723308,0.00032995845,0.9652102,0.008545364,0.000010017275],"about_ca_topic_score_codex":0.0022952666,"about_ca_topic_score_gemma":0.0011380207,"teacher_disagreement_score":0.004898195,"about_ca_system_score_codex":0.002892495,"about_ca_system_score_gemma":0.002027062,"threshold_uncertainty_score":0.021105528},"labels":[],"label_agreement":null},{"id":"W4241742544","doi":"10.1109/infocom.2007.210","title":"Efficient Network Coded Data Transmissions in Disruption Tolerant Networks","year":2008,"lang":"en","type":"article","venue":"2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Linear network coding; Routing protocol; Erasure code; Network packet; Delay-tolerant networking; Data transmission; Zone Routing Protocol; Distributed computing; Wireless Routing Protocol; Decoding methods; Algorithm","score_opus":0.12371046640362339,"score_gpt":0.29850440841706094,"score_spread":0.17479394201343756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241742544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03810901,0.0005036005,0.95736223,0.00026947798,0.00004895102,0.00008146269,0.000055433335,0.00025646665,0.0033133717],"genre_scores_gemma":[0.7829704,0.00071039685,0.21385315,0.00012207712,0.000039283805,0.00021708684,0.00008218929,0.000051822095,0.0019535252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990645,0.00034516782,0.000041433308,0.00007874217,0.0003808438,0.00008932004],"domain_scores_gemma":[0.9967001,0.0021871491,0.00036040135,0.00036790658,0.00031956204,0.000064884836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016496128,0.00040597707,0.00040931863,0.0006830638,0.0005535642,0.00070280774,0.0009852246,0.00065447076,0.0005759776],"category_scores_gemma":[0.0071758763,0.00025114464,0.0001942991,0.0010624704,0.0013595324,0.0014501067,0.0010821507,0.0006773036,0.00016087345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020684347,0.0000624974,0.00058311067,0.00019409996,0.00002237261,0.00023422281,0.00032322406,0.75553894,0.023463592,0.1612295,0.0014197989,0.056721807],"study_design_scores_gemma":[0.0000262082,0.00007146958,0.00013428845,0.000025320496,0.000010709365,0.00016201787,0.000050812123,0.9405276,0.007183123,0.048976406,0.0028087934,0.00002327671],"about_ca_topic_score_codex":0.0017691887,"about_ca_topic_score_gemma":0.0016406063,"teacher_disagreement_score":0.0017691887,"about_ca_system_score_codex":0.0011412101,"about_ca_system_score_gemma":0.0010254141,"threshold_uncertainty_score":0.008724093},"labels":[],"label_agreement":null},{"id":"W4242449892","doi":"10.22215/etd/2019-13649","title":"A Hierarchical P2P Overlay for Hierarchical Mobile Ad hoc Networks (MANETs)","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Overlay network; Overlay; Computer science; Distributed computing; Mobile ad hoc network; Software deployment; Network topology; Underlay; Wireless ad hoc network; Vehicular ad hoc network; Topology (electrical circuits); Engineering; The Internet; Wireless; Telecommunications; World Wide Web","score_opus":0.01300859513628227,"score_gpt":0.2648952432117846,"score_spread":0.2518866480755023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242449892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065545015,0.0017897388,0.88959354,0.0014766866,0.0004250246,0.0006006253,0.0006685855,0.0022372066,0.037663653],"genre_scores_gemma":[0.5062719,0.002107249,0.4711008,0.00015193275,0.00014388682,0.00019914146,0.00076768,0.00010218587,0.019155199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980444,0.00003677962,0.000013122334,0.00004088283,0.00008152891,0.000023314915],"domain_scores_gemma":[0.99973625,0.000045556033,0.000015109369,0.000070659575,0.00009241427,0.000040025894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032123373,0.00020935186,0.00021233637,0.0004219062,0.0010610844,0.0007739666,0.0005612781,0.00044127903,0.0022095123],"category_scores_gemma":[0.0008676767,0.00016272074,0.00022642832,0.00074206083,0.00028458986,0.0011137617,0.0010519079,0.00044337098,0.000733134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027550562,0.0003589356,0.002216588,0.00065795763,0.00005984331,0.0006981318,0.00068682537,0.12465735,0.06542009,0.13209382,0.041677542,0.6311974],"study_design_scores_gemma":[0.00009298762,0.0004669631,0.0027682115,0.00011280943,0.00012568405,0.0008576132,0.00076599215,0.72697365,0.032250427,0.08225121,0.15326555,0.00006886786],"about_ca_topic_score_codex":0.0035847551,"about_ca_topic_score_gemma":0.007031338,"teacher_disagreement_score":0.0035847551,"about_ca_system_score_codex":0.00037029636,"about_ca_system_score_gemma":0.0012288409,"threshold_uncertainty_score":0.007391572},"labels":[],"label_agreement":null},{"id":"W4243190313","doi":"10.1007/978-1-4614-6170-8_100986","title":"Almost Network Data","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.06640724913339659,"score_gpt":0.24528529556666112,"score_spread":0.17887804643326455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243190313","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071150227,0.008471773,0.33568528,0.009340238,0.0048555466,0.00014489617,0.0035521463,0.0025821105,0.6282529],"genre_scores_gemma":[0.23164302,0.013859665,0.11276315,0.004546997,0.0037043262,0.00047961937,0.0069375294,0.0017419179,0.62432384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.0000805179,0.000025768984,0.00010661194,0.00031512283,0.00004242421],"domain_scores_gemma":[0.9990363,0.0002380159,0.000039170154,0.0004650236,0.00017345975,0.000048104772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005439298,0.00060162,0.00044198078,0.0009095624,0.0007643638,0.0025766054,0.0010679949,0.0007467819,0.037201878],"category_scores_gemma":[0.0035402991,0.00029052707,0.00024188342,0.001647373,0.0011803197,0.006132495,0.0019851679,0.0016039747,0.012017724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000544476,0.000016098578,0.00012839699,0.00015328774,0.000010927846,0.000040652936,0.000110165,0.0026853597,0.0012089611,0.69809115,0.101431824,0.19606873],"study_design_scores_gemma":[0.000008893547,0.000013615829,0.000116120056,0.000080309306,0.0000076442075,0.00014222633,0.000061522864,0.0073973364,0.001443621,0.40048763,0.5902294,0.000011809651],"about_ca_topic_score_codex":0.0008154813,"about_ca_topic_score_gemma":0.00079303654,"teacher_disagreement_score":0.037201878,"about_ca_system_score_codex":0.00088587246,"about_ca_system_score_gemma":0.0006275271,"threshold_uncertainty_score":0.12445271},"labels":[],"label_agreement":null},{"id":"W4245122991","doi":"10.32920/ryerson.14662074","title":"A centrality-based history prediction routing protocol for opportunistic networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Centrality; Computer science; Computer network; Routing protocol; Node (physics); Protocol (science); Task (project management); Routing (electronic design automation); Distributed computing; Engineering; Mathematics","score_opus":0.09792758185350045,"score_gpt":0.29903132019693174,"score_spread":0.2011037383434313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245122991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049149938,0.00068127975,0.9418313,0.0007071488,0.00024698215,0.0004163551,0.00021514406,0.0011027999,0.0056490363],"genre_scores_gemma":[0.7673897,0.00073052716,0.22280762,0.0002863747,0.00010973609,0.00044607278,0.0005414469,0.00007530343,0.0076131057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969625,0.00007596827,0.000019018782,0.000050130762,0.00012353527,0.000034990375],"domain_scores_gemma":[0.9993119,0.0002887011,0.0000948565,0.000116075615,0.0001270959,0.000061316314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064813596,0.00028963046,0.00035390168,0.0005738999,0.0006533453,0.0005613934,0.0012729446,0.00052696356,0.00088737527],"category_scores_gemma":[0.0023605365,0.00014750671,0.00023894166,0.0006044504,0.00042400905,0.0009340473,0.0012364214,0.00075088406,0.00017286898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057779683,0.0003361456,0.003035172,0.00043847586,0.00015427014,0.0009984002,0.0011548247,0.20674239,0.067988425,0.21113524,0.017891837,0.48954704],"study_design_scores_gemma":[0.00009939244,0.00034336268,0.0007366153,0.0000330559,0.00006508588,0.00056544115,0.00013636466,0.9216773,0.0137789035,0.035233583,0.027267061,0.00006383941],"about_ca_topic_score_codex":0.00256534,"about_ca_topic_score_gemma":0.0037630764,"teacher_disagreement_score":0.00256534,"about_ca_system_score_codex":0.00067159906,"about_ca_system_score_gemma":0.0010208727,"threshold_uncertainty_score":0.0051007867},"labels":[],"label_agreement":null},{"id":"W4245212803","doi":"10.32920/ryerson.14662074.v1","title":"A centrality-based history prediction routing protocol for opportunistic networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Centrality; Computer science; Computer network; Routing protocol; Node (physics); Protocol (science); Task (project management); Routing (electronic design automation); Distributed computing; Engineering","score_opus":0.09792758185350045,"score_gpt":0.29903132019693174,"score_spread":0.2011037383434313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245212803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049149938,0.00068127975,0.9418313,0.0007071488,0.00024698215,0.0004163551,0.00021514406,0.0011027999,0.0056490363],"genre_scores_gemma":[0.7673897,0.00073052716,0.22280762,0.0002863747,0.00010973609,0.00044607278,0.0005414469,0.00007530343,0.0076131057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969625,0.00007596827,0.000019018782,0.000050130762,0.00012353527,0.000034990375],"domain_scores_gemma":[0.9993119,0.0002887011,0.0000948565,0.000116075615,0.0001270959,0.000061316314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064813596,0.00028963046,0.00035390168,0.0005738999,0.0006533453,0.0005613934,0.0012729446,0.00052696356,0.00088737527],"category_scores_gemma":[0.0023605365,0.00014750671,0.00023894166,0.0006044504,0.00042400905,0.0009340473,0.0012364214,0.00075088406,0.00017286898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057779683,0.0003361456,0.003035172,0.00043847586,0.00015427014,0.0009984002,0.0011548247,0.20674239,0.067988425,0.21113524,0.017891837,0.48954704],"study_design_scores_gemma":[0.00009939244,0.00034336268,0.0007366153,0.0000330559,0.00006508588,0.00056544115,0.00013636466,0.9216773,0.0137789035,0.035233583,0.027267061,0.00006383941],"about_ca_topic_score_codex":0.00256534,"about_ca_topic_score_gemma":0.0037630764,"teacher_disagreement_score":0.00256534,"about_ca_system_score_codex":0.00067159906,"about_ca_system_score_gemma":0.0010208727,"threshold_uncertainty_score":0.0051007867},"labels":[],"label_agreement":null},{"id":"W4247989590","doi":"10.1007/978-3-319-47922-4_1","title":"Introduction","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.016355537905974844,"score_gpt":0.2028557917863735,"score_spread":0.18650025388039865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247989590","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035222413,0.005314251,0.008101948,0.0024513933,0.005131624,0.00010536456,0.0009380183,0.00064382906,0.97696143],"genre_scores_gemma":[0.0014827125,0.0030781198,0.0016744412,0.0010011679,0.0008660648,0.00005640559,0.0007424291,0.00020125629,0.9908975],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995672,0.000041471518,0.00001565963,0.00009494337,0.00022860643,0.000052044325],"domain_scores_gemma":[0.9994497,0.000085667234,0.000020895008,0.000088423105,0.0002406718,0.0001147192],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046107243,0.00084661326,0.000485866,0.001422355,0.0010688377,0.0035605058,0.0014943976,0.001562255,0.4301769],"category_scores_gemma":[0.0017686875,0.00031235037,0.00043810115,0.0014845817,0.0006501839,0.0035783723,0.002186324,0.001695403,0.34736654],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021316217,0.000036721307,0.00008552335,0.00022209382,0.0000027483966,0.00004529942,0.00015190382,0.00026608031,0.0006063774,0.07044705,0.66656506,0.26154977],"study_design_scores_gemma":[0.00000106572,0.0000042958923,0.00004096986,0.00006197058,6.351796e-7,0.00003282472,0.000022596705,0.000033529606,0.000069853246,0.0047361357,0.9949941,0.00000207083],"about_ca_topic_score_codex":0.0016040724,"about_ca_topic_score_gemma":0.002714135,"teacher_disagreement_score":0.5698231,"about_ca_system_score_codex":0.0010929717,"about_ca_system_score_gemma":0.001317136,"threshold_uncertainty_score":0.8127835},"labels":[],"label_agreement":null},{"id":"W4249321756","doi":"10.1109/wsc.2014.7020078","title":"Simulation implementation and performance analysis for situational awareness data dissemination in a tactical MANET","year":2014,"lang":"en","type":"article","venue":"Proceedings of the Winter Simulation Conference 2014","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Mobile ad hoc network; Computer science; Situation awareness; Network topology; Dissemination; Wireless ad hoc network; Computer network; Distributed computing; Bandwidth (computing); Vehicular ad hoc network; Wireless; Information Dissemination; Telecommunications; World Wide Web; Network packet; Engineering","score_opus":0.05870596376254019,"score_gpt":0.3517198239617911,"score_spread":0.2930138601992509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249321756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7731661,0.00022406399,0.20636518,0.00061651424,0.00012483234,0.00042399124,0.000853852,0.0012166537,0.017008878],"genre_scores_gemma":[0.96775514,0.00013078847,0.03062529,0.000042489886,0.000007946157,0.00018414113,0.00028997465,0.00003890288,0.000925383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933535,0.00031779349,0.00004396381,0.00005631643,0.0001406359,0.000105825784],"domain_scores_gemma":[0.9957968,0.0030026252,0.0001868606,0.00033852673,0.0005453938,0.00012988267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012530665,0.0005216149,0.0005724418,0.0007198694,0.00060462725,0.0006992082,0.00093844417,0.0007520037,0.0018956204],"category_scores_gemma":[0.0046307067,0.00023468585,0.00039493878,0.0008019682,0.0004889957,0.0006048163,0.0005920911,0.0008589817,0.00016842135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008175254,0.00012902069,0.0020998993,0.000028868522,0.000019232288,0.000049464605,0.000060083967,0.9893721,0.0010219321,0.0033719083,0.00027197652,0.0034936897],"study_design_scores_gemma":[0.0000121727935,0.000036395424,0.0001904445,0.0000028175707,0.0000042415586,0.0000063525463,0.000018565242,0.9986953,0.0005037747,0.0003304927,0.0001961074,0.0000033394322],"about_ca_topic_score_codex":0.0133213485,"about_ca_topic_score_gemma":0.0070844744,"teacher_disagreement_score":0.0133213485,"about_ca_system_score_codex":0.00096323073,"about_ca_system_score_gemma":0.0011121305,"threshold_uncertainty_score":0.026487589},"labels":[],"label_agreement":null},{"id":"W4250257738","doi":"10.1109/netgames.2013.6820601","title":"Network performance measurement framework for real-time multiplayer mobile games","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Latency (audio); Sequential game; Frame (networking); Real-time communication; Real-time computing; Game design; Session (web analytics); Game theory; Computer network; Multimedia; Telecommunications","score_opus":0.03052385288977861,"score_gpt":0.23789960399891294,"score_spread":0.20737575110913434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250257738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025914465,0.00006056711,0.99477345,0.000044522454,0.000021676837,0.00014276647,0.00008563354,0.0013932289,0.00088676665],"genre_scores_gemma":[0.36032003,0.0003021951,0.63427216,0.000093510214,0.00010041994,0.0012809575,0.00068042165,0.00036894545,0.0025814332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643916,0.0009790872,0.00032817904,0.00049490435,0.0015298706,0.00022883118],"domain_scores_gemma":[0.99681795,0.00084211404,0.0005977918,0.0005474577,0.00096508855,0.00022945958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040735314,0.002170493,0.0011041278,0.0024449378,0.0007721054,0.002467436,0.003745264,0.0009435685,0.0017878023],"category_scores_gemma":[0.008447416,0.0006017846,0.0010225183,0.0011091073,0.0010509067,0.0020842578,0.0017510852,0.0020469208,0.0009084598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028216225,0.00063338917,0.005425038,0.0003853329,0.00022152979,0.0003735402,0.0007451375,0.7121136,0.018757775,0.14155452,0.0056683905,0.1138396],"study_design_scores_gemma":[0.000011700146,0.00007948182,0.00070238754,0.000026847163,0.00002337791,0.00007335404,0.00005242512,0.9814612,0.0028515155,0.01028968,0.0043942556,0.000033785636],"about_ca_topic_score_codex":0.01178808,"about_ca_topic_score_gemma":0.008400282,"teacher_disagreement_score":0.01178808,"about_ca_system_score_codex":0.0023240247,"about_ca_system_score_gemma":0.0019613944,"threshold_uncertainty_score":0.02343893},"labels":[],"label_agreement":null},{"id":"W4250377010","doi":"10.22215/etd/2012-07431","title":"Improved socially selfish routing for delay tolerant networks","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"Society for the Study of Amphibians and Reptiles","keywords":"Humanities; Computer science; Political science; Art","score_opus":0.01705337118805243,"score_gpt":0.25671408959674125,"score_spread":0.23966071840868883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250377010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10834066,0.0007747004,0.87141895,0.00093810615,0.00029457992,0.00016009161,0.00014336595,0.0006824871,0.017247105],"genre_scores_gemma":[0.9078512,0.0005829264,0.07892207,0.00019879277,0.00010793651,0.00010121216,0.0001574818,0.00010391049,0.011974427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995184,0.00016435557,0.000016559448,0.000083508494,0.00014658991,0.000070621405],"domain_scores_gemma":[0.9992725,0.0003079,0.00007708593,0.00014883577,0.00012470502,0.00006897941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071010576,0.00047481334,0.00046074775,0.00047271582,0.0006285342,0.0008348655,0.00079717534,0.00037514934,0.0022834376],"category_scores_gemma":[0.002324542,0.00017389299,0.00029536994,0.00040831315,0.00051439804,0.0010941812,0.0013459072,0.0006314173,0.00037023533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003352563,0.00021306793,0.0011719262,0.00021482099,0.00008986889,0.00024347074,0.00044298658,0.51952296,0.026311297,0.27450758,0.01291222,0.1640346],"study_design_scores_gemma":[0.000036936548,0.00016128835,0.0002940277,0.000015469961,0.000028054912,0.00013231371,0.00008008077,0.935345,0.0026935001,0.05306794,0.008124864,0.000020505104],"about_ca_topic_score_codex":0.0010810596,"about_ca_topic_score_gemma":0.0020638276,"teacher_disagreement_score":0.0022834376,"about_ca_system_score_codex":0.001016155,"about_ca_system_score_gemma":0.0007875549,"threshold_uncertainty_score":0.007638812},"labels":[],"label_agreement":null},{"id":"W4250391907","doi":"10.1109/mobiqw.2006.361735","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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Network delay; Network packet; Mobility model; Wireless network; Delay-tolerant networking; Wireless WAN; Mobile computing; Distributed computing; Wireless; Routing protocol; Key distribution in wireless sensor networks; Telecommunications; Optimized Link State Routing Protocol","score_opus":0.037436286161153666,"score_gpt":0.32536700894627096,"score_spread":0.2879307227851173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250391907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96482974,0.00095276313,0.023893625,0.0012521625,0.00013530579,0.00036750792,0.0018069803,0.00024752476,0.006514383],"genre_scores_gemma":[0.9891766,0.00021892428,0.008651096,0.000059764443,0.000038243954,0.00013867093,0.0011610654,0.000024633233,0.00053106167],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99357855,0.0039943415,0.0003409134,0.0006865937,0.0010706359,0.00032896973],"domain_scores_gemma":[0.82923806,0.13962086,0.0109405555,0.006663219,0.008955919,0.004581405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016030876,0.0005324462,0.00046081337,0.003263676,0.0014185983,0.001512144,0.002308846,0.0012572412,0.0030684187],"category_scores_gemma":[0.084972315,0.00020267868,0.0003633115,0.0027702253,0.0017911803,0.005390365,0.0014673574,0.0013893633,0.0004893848],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004576941,0.0024525402,0.4558139,0.0012402983,0.00059721264,0.0005568232,0.0027846128,0.32231447,0.0017570156,0.046108462,0.01812485,0.14367284],"study_design_scores_gemma":[0.00028140636,0.0031556946,0.05535295,0.00014877842,0.00016892666,0.00084403105,0.004870568,0.90160763,0.0021362926,0.020125862,0.011216675,0.00009113205],"about_ca_topic_score_codex":0.0042111306,"about_ca_topic_score_gemma":0.0037678399,"teacher_disagreement_score":0.016030876,"about_ca_system_score_codex":0.0032624137,"about_ca_system_score_gemma":0.0009524072,"threshold_uncertainty_score":0.084780395},"labels":[],"label_agreement":null},{"id":"W4250891886","doi":"10.1109/glocom.2013.6831036","title":"Program","year":2013,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Acoustics, Chinese Academy of Sciences; Fundação para a Ciência e a Tecnologia; University of Texas at El Paso; University of California, Irvine; University of California, Davis; University of California, Los Angeles; College of Engineering, Michigan State University; University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Lobachevsky State University of Nizhny Novgorod; Alfaisal University; Nile University; Shanghai University of Electric Power; Université de Sfax; Instituto de Telecomunicações; Dalian Maritime University; University of Chinese Academy of Sciences; Tokyo University of Agriculture and Technology; Bangladesh University of Engineering and Technology; Université Paris-Est Créteil Val-de-Marne; Shenzhen University; Università degli Studi di Messina; Xiamen University; University of Mumbai; Iran Telecommunication Research Center; Nanjing Institute of Technology; Nanjing University; People's Liberation Army University of Science and Technology; Peking University; Freie Universität Berlin; Universidade Federal de Minas Gerais; Korea Advanced Institute of Science and Technology; National University of Defense Technology; Zhejiang Sci-Tech University; National Taiwan University; Universidade Estadual de Campinas; Oulun Yliopisto; Università di Bologna; National Chiao Tung University; Tokyo University of Agriculture; Université Paris Descartes; University of North Carolina at Charlotte; National Central University; University of British Columbia; Jilin University; Universidade Federal do Rio Grande do Sul; Chinese University of Hong Kong; Zhejiang University; Southwest Jiaotong University; Università degli Studi di Firenze; Waseda University; Kungliga Tekniska Högskolan; University of Wisconsin-Madison; Qatar University; University College London; Tongji University; National Sun Yat-sen University; Orta Doğu Teknik Üniversitesi; Queen's University; Universität zu Lübeck; University of Wollongong; King Abdulaziz University; Industrial Technology Research Institute; King Fahd University of Petroleum and Minerals; Samsung; University of Hong Kong; Imperial College London; University of Toronto; University of Surrey; Universidad de Murcia; Intel Corporation; Harbin Engineering University; Lunds Universitet; Centre National de la Recherche Scientifique; Universidade Federal de Uberlândia; Research, Development and Engineering Command; Johns Hopkins University; University of Warwick; Dalian University of Technology; Indian Institute of Science; Technische Universität Dresden; Macquarie University; Concordia University; Stony Brook University; Technische Universität Berlin; Ajou University; University at Buffalo; Ulsan National Institute of Science and Technology; Nantong University; Bar-Ilan University; Gwangju Institute of Science and Technology; Universitat Pompeu Fabra; Sun Yat-sen University; Chinese Academy of Sciences; Academia Sinica; George Washington University; Chongqing University; Beihang University; University of Twente; University of South Australia; University of Electronic Science and Technology of China; Deakin University; Technische Universiteit Delft; York University; University of Technology Sydney; University of New South Wales; University of Thessaly; Kansai University; Beijing University of Technology; Nanyang Technological University; Nanjing University of Aeronautics and Astronautics; Southeast University; Universidad Carlos III de Madrid; National University of Singapore; Technische Universität München; Durham University; Shanghai Educational Development Foundation; Queen's University Belfast; University of Melbourne; University of Manchester; Indian Institute of Technology Madras; University of Southampton; Tennessee Tech University; Universidade Federal do Pará; Aristotle University of Thessaloniki; University of Carthage; Institut Mines-Télécom; École Polytechnique Fédérale de Lausanne; South Dakota School of Mines and Technology; Central China Normal University; Universidade de Aveiro; Xidian University; University of Southern California; Institute for Infocomm Research; Posts and Telecommunications Institute of Technology; University of Science and Technology Beijing; Beijing University of Posts and Telecommunications; King's College London; Pontifícia Universidade Católica de Minas Gerais; Singapore University of Technology and Design; Samsung Advanced Institute of Technology; Princeton University; Deutsches Zentrum für Luft- und Raumfahrt; Arizona State University; National Institute of Information and Communications Technology; Universidade Federal de Santa Catarina; Cisco Systems; Università degli Studi di Cagliari; University of Cyprus; University of Oklahoma; Institut national de recherche en informatique et en automatique (INRIA); Korea University; Institute of Computing Technology, Chinese Academy of Sciences; Hong Kong University of Science and Technology; ZTE Corporation; University of Sydney; University of South Florida; Missouri University of Science and Technology; University of Minnesota; Lahore University of Management Sciences; Università degli Studi di Parma; Middlesex University; Université Paris-Sud; Kingston University; Universitat Politècnica de Catalunya; University of Alberta; Aalborg Universitet; Old Dominion University; Universidade de Vigo; Michigan Technological University; Heriot-Watt University; Université de Sherbrooke; State University of New York; McMaster University; New Mexico State University; Beijing Jiaotong University; University of Pittsburgh; Iowa State University; Syracuse University; University of Massachusetts Dartmouth; King Abdullah University of Science and Technology; University of Oxford; Helsingin Yliopisto; Université du Québec à Montréal; Monash University; Technische Universität Kaiserslautern; Georgia State University; Università degli Studi di Trento; Dartmouth College; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Louisiana State University; Guangdong University of Petrochemical Technology; University of Texas at Arlington; Haute école Spécialisée de Suisse Occidentale; University of South Carolina; Alexandria University; McGill University; University of Engineering and Technology, Lahore; Tel Aviv University; West Virginia University; Università degli Studi di Roma Tor Vergata; University of Ottawa; Department for Enterprise, Trade and Investment, UK Government; University of Texas at Austin; Kyung Hee University; Indian National Science Academy; Pennsylvania State University; University of Notre Dame; Hong Kong Polytechnic University; University of Wyoming; Keio University; Universidad del Cauca; Memorial University of Newfoundland; Harbin Institute of Technology; University of Memphis; National Tsing Hua University; South Dakota State University; Universidade Federal do Amazonas; University of Tehran; Politecnico di Torino; Virginia Polytechnic Institute and State University; Trinity College Dublin; University of Washington; University of Bristol; Northwestern University; Rensselaer Polytechnic Institute; University of Central Florida; Université du Luxembourg; North Carolina State University; Huazhong University of Science and Technology; Universidade da Beira Interior; Army Research Laboratory; Georgia Institute of Technology; LG Electronics; University of Science and Technology of China; Tsinghua University; University of Pennsylvania; Research Institute, Georgia Institute of Technology; Rice University; Cyprus University of Technology; Michigan State University; Zhejiang Wanli University; Université Européenne de Bretagne; Auburn University; Shanghai Jiao Tong University; Ministry of Education, India; Rutgers, The State University of New Jersey; Victoria University; Utah State University; Mitsubishi Electric Research Laboratories; Università di Catania; Chongqing University of Technology; Commonwealth Scientific and Industrial Research Organisation; University of Nebraska-Lincoln; Massachusetts Institute of Technology; U.S. Department of Homeland Security; George Mason University; University of California, Santa Barbara; Baylor University; Aalto-Yliopisto; University of Waterloo; University of West Florida; Southern Methodist University; Towson University; Qualcomm; Centro Nacional de Investigaciones Cardiovasculares; City University of Hong Kong; Queen Mary University of London; Wayne State University; De La Salle University; Università Politecnica delle Marche; University of Edinburgh; Colorado State University; Ecole Supérieure des Communications de Tunis; Purdue University; Technische Universität Braunschweig","keywords":"Computer science","score_opus":0.011815767022057442,"score_gpt":0.22676614347867455,"score_spread":0.2149503764566171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250891886","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019647798,0.00068516174,0.015940433,0.008436459,0.0037512304,0.00037946508,0.0075646504,0.003074079,0.95820373],"genre_scores_gemma":[0.008279863,0.0005817669,0.0057694153,0.002047879,0.00049039157,0.00030438366,0.0047920356,0.00066455547,0.9770697],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919254,0.00013220368,0.000031553445,0.000201137,0.00030575693,0.00013684524],"domain_scores_gemma":[0.9978872,0.00025617753,0.000072521085,0.00032861115,0.00096744765,0.00048801428],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012005131,0.0005903685,0.0004948329,0.0012634234,0.0017744142,0.003165544,0.0015379596,0.0012344521,0.67502916],"category_scores_gemma":[0.0037175983,0.00026232834,0.00048682513,0.0014086947,0.0004847795,0.0023796514,0.0027207253,0.0013004291,0.37737152],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007974835,0.00008649232,0.00054312515,0.000112924696,0.0000050838335,0.000052716325,0.000233885,0.00020194995,0.00046602433,0.05336178,0.77873147,0.16612484],"study_design_scores_gemma":[0.0000052684645,0.000014776508,0.00024531689,0.00002830178,0.0000015224982,0.000041279938,0.00007589632,0.000088112756,0.00015737396,0.004207176,0.99513185,0.0000030784067],"about_ca_topic_score_codex":0.0027047251,"about_ca_topic_score_gemma":0.00415896,"teacher_disagreement_score":0.32497084,"about_ca_system_score_codex":0.0015349633,"about_ca_system_score_gemma":0.0026834768,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4251247182","doi":"10.1109/glocom.2014.7417371","title":"An Adaptive Frame Length Aggregation Scheme in Vehicular Delay-Tolerant Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"Computer science; Frame (networking); Throughput; Transmission (telecommunications); Computer network; Transmission delay; Scheme (mathematics); Data aggregator; Wireless; Network topology; Data transmission; Topology (electrical circuits); Real-time computing; Wireless sensor network; Telecommunications; Engineering; Mathematics","score_opus":0.04197547281050776,"score_gpt":0.29732265974550753,"score_spread":0.2553471869349998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251247182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16656767,0.0017010613,0.8288122,0.00018791843,0.00018827611,0.00011967524,0.000055535023,0.00047986922,0.001887844],"genre_scores_gemma":[0.9404481,0.00034160356,0.058465153,0.000046354944,0.000048381356,0.000044442215,0.000058596404,0.000013642099,0.00053364236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947804,0.00013126704,0.000058549307,0.000075735494,0.00018055658,0.00007595588],"domain_scores_gemma":[0.9989796,0.00035095747,0.00018685388,0.00014094924,0.00028508203,0.000056530524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009591075,0.00047546392,0.00045829956,0.0008001842,0.0007091823,0.0005637218,0.0010331273,0.0003893989,0.00025050231],"category_scores_gemma":[0.002621587,0.00017045099,0.0002140683,0.0007175885,0.00040964337,0.0009578998,0.0005604812,0.00036454038,0.00007950892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063544244,0.000182959,0.0049223406,0.00021469043,0.00009204939,0.0005639348,0.00069975306,0.53237337,0.09601611,0.03133557,0.0024823314,0.33048147],"study_design_scores_gemma":[0.000029587118,0.0002885061,0.0013209521,0.00002050828,0.000055713906,0.00026914635,0.00008516358,0.97464246,0.013824654,0.0056868275,0.0037230344,0.000053502237],"about_ca_topic_score_codex":0.003769985,"about_ca_topic_score_gemma":0.0035149057,"teacher_disagreement_score":0.003769985,"about_ca_system_score_codex":0.0009985875,"about_ca_system_score_gemma":0.0005162056,"threshold_uncertainty_score":0.0074961185},"labels":[],"label_agreement":null},{"id":"W4251565148","doi":"10.32920/ryerson.14663643.v1","title":"RAIMA: a Framework for the Design and Analysis of Self-Adaptive Egocentric Social Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Semantics (computer science); Social network (sociolinguistics); Context (archaeology); Inference; Visualization; Matching (statistics); Data science; Distributed computing; Human–computer interaction; World Wide Web; Artificial intelligence; Social media","score_opus":0.04404787783576872,"score_gpt":0.2737052772332902,"score_spread":0.22965739939752147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251565148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000548951,0.00014342663,0.99727976,0.0001383709,0.000025458083,0.0000787138,0.00007718353,0.0003546696,0.0013534484],"genre_scores_gemma":[0.045074802,0.0004923094,0.95028484,0.00012313064,0.00006997623,0.00065441726,0.00032988007,0.0002076139,0.0027630818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747986,0.0011375904,0.00019990625,0.00046302474,0.00056672277,0.00015292375],"domain_scores_gemma":[0.99705935,0.0013091061,0.00037124465,0.0006307933,0.00045997225,0.00016960433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045805536,0.0013614253,0.0009818156,0.002039967,0.0012032103,0.0040609455,0.0039374996,0.0014642237,0.0038530403],"category_scores_gemma":[0.00959742,0.0010293022,0.0026234128,0.001579448,0.0024202461,0.004365152,0.0033695034,0.0025453847,0.0013147077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031783522,0.000039759612,0.000757433,0.00024596558,0.0000946938,0.00022989744,0.00059221993,0.15004742,0.0016555758,0.78897595,0.0038584217,0.05347081],"study_design_scores_gemma":[0.000020162635,0.000035982128,0.00017723629,0.0000854805,0.000034251905,0.00013796214,0.00014646257,0.57460916,0.00097509066,0.36302078,0.060725566,0.00003192927],"about_ca_topic_score_codex":0.005441365,"about_ca_topic_score_gemma":0.006629851,"teacher_disagreement_score":0.005441365,"about_ca_system_score_codex":0.0019250995,"about_ca_system_score_gemma":0.0023701694,"threshold_uncertainty_score":0.02422458},"labels":[],"label_agreement":null},{"id":"W4251842006","doi":"10.1007/978-1-4939-7131-2_100021","title":"Almost Network Data","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.0844839093837426,"score_gpt":0.2605157526739513,"score_spread":0.17603184329020866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251842006","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072532273,0.009284294,0.3308713,0.011022435,0.0059619625,0.0001512354,0.003959165,0.0027679044,0.62872833],"genre_scores_gemma":[0.24294019,0.015240189,0.11337333,0.005218446,0.0046521123,0.000521412,0.007858111,0.0019416022,0.60825455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938095,0.00008773684,0.000028002076,0.00012027766,0.00033839067,0.00004464902],"domain_scores_gemma":[0.998871,0.00029270383,0.00004403836,0.0005397811,0.00019581558,0.000056657573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059572863,0.0006318956,0.00046933896,0.00092621404,0.0007980851,0.0027598774,0.0011123196,0.00079695164,0.037301928],"category_scores_gemma":[0.0041907025,0.00030547328,0.00025574418,0.0017030232,0.0012476417,0.006680942,0.0020839234,0.0017616451,0.012937012],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055596865,0.000016590204,0.00012797167,0.00016208159,0.000011357015,0.00003856279,0.00010731333,0.0026954205,0.0010743422,0.7134574,0.104917705,0.17733572],"study_design_scores_gemma":[0.000008920844,0.000013612993,0.000110514084,0.00008036644,0.00000768456,0.00013305154,0.0000584117,0.006995191,0.0012867677,0.42412892,0.56716496,0.000011583891],"about_ca_topic_score_codex":0.00076116045,"about_ca_topic_score_gemma":0.00069277274,"teacher_disagreement_score":0.037301928,"about_ca_system_score_codex":0.00092270406,"about_ca_system_score_gemma":0.00064014306,"threshold_uncertainty_score":0.12478739},"labels":[],"label_agreement":null},{"id":"W4252613091","doi":"10.32920/ryerson.14657526","title":"A history-based energy-efficient routing protocol for opportunistic networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Network packet; Enhanced Interior Gateway Routing Protocol; Overhead (engineering); Energy consumption; Wireless Routing Protocol; Protocol (science); Dynamic Source Routing; Energy (signal processing); Routing (electronic design automation); Engineering; Electrical engineering; Medicine; Mathematics","score_opus":0.07569004943726862,"score_gpt":0.2882568192028428,"score_spread":0.21256676976557418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252613091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03345771,0.00086379086,0.9567237,0.00036565927,0.00023846241,0.00031887714,0.00024279165,0.001088564,0.006700436],"genre_scores_gemma":[0.6739897,0.0013123455,0.31322005,0.0002581393,0.00013477459,0.00052557414,0.00067576434,0.000121961944,0.009761764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996737,0.00007029927,0.00002634599,0.000049217924,0.00014806574,0.00003241858],"domain_scores_gemma":[0.99931514,0.00027843696,0.0000970448,0.00014050235,0.00012423031,0.00004463122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250315,0.00032756745,0.0003750746,0.00046881248,0.0006050576,0.0006215175,0.0011940724,0.00038744955,0.0010091931],"category_scores_gemma":[0.0017034383,0.00019839521,0.00023954292,0.00048482782,0.00047924902,0.0012022302,0.0009530212,0.0006014383,0.00017968501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004543884,0.00020182718,0.0028624898,0.00058869313,0.00015337064,0.00087670813,0.0006240603,0.25457513,0.06479449,0.20312382,0.012376567,0.45936844],"study_design_scores_gemma":[0.00006691707,0.0002804139,0.0008865202,0.000060556547,0.00007639487,0.00073751237,0.000150855,0.8791689,0.022968858,0.051127154,0.04438009,0.00009584147],"about_ca_topic_score_codex":0.0012817248,"about_ca_topic_score_gemma":0.0021599238,"teacher_disagreement_score":0.0012817248,"about_ca_system_score_codex":0.00045368492,"about_ca_system_score_gemma":0.00089086994,"threshold_uncertainty_score":0.0033761263},"labels":[],"label_agreement":null},{"id":"W4253687311","doi":"10.1002/dac.982","title":"Call for Papers: ‘<i>Ubiquitous Wireless Mesh Networks</i>’","year":2008,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Citation; Library science; Computer science","score_opus":0.03266889711511964,"score_gpt":0.2930557389204899,"score_spread":0.2603868418053703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253687311","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024837867,0.004157355,0.0023915644,0.2449655,0.6879156,0.00018825413,0.0007576498,0.00083092914,0.058544826],"genre_scores_gemma":[0.0042231213,0.005195994,0.0023458786,0.112035416,0.254141,0.00031995217,0.0017596615,0.0011996261,0.61877924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955237,0.0005739582,0.00031621926,0.0006195271,0.0024239833,0.0005425987],"domain_scores_gemma":[0.96978563,0.006928801,0.0016839886,0.0018150429,0.014407373,0.0053792745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004994665,0.0017822353,0.0022635993,0.0028298616,0.0031783641,0.00858458,0.0035478636,0.01700729,0.22894232],"category_scores_gemma":[0.031295504,0.00069188664,0.0020110311,0.002826657,0.0015533831,0.005541197,0.0031974732,0.007014718,0.17026521],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010387309,0.0000053223303,0.000023237319,0.00003403682,0.0000028149445,0.0000146073,0.0000028029435,0.00001599292,0.00003862,0.0003661523,0.9941703,0.0053157867],"study_design_scores_gemma":[0.000016581984,0.000018221092,0.00019758251,0.000056193257,0.000008993673,0.000033979206,0.000022446895,0.0001313163,0.00010789316,0.0010193982,0.9983752,0.000012260416],"about_ca_topic_score_codex":0.0017761346,"about_ca_topic_score_gemma":0.0047975117,"teacher_disagreement_score":0.22894232,"about_ca_system_score_codex":0.0024362933,"about_ca_system_score_gemma":0.0029536546,"threshold_uncertainty_score":0.76588833},"labels":[],"label_agreement":null},{"id":"W4253747709","doi":"10.22215/etd/2012-06964","title":"A DTN-based RFID protocol","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Protocol (science); Humanities; Telecommunications; Art; Medicine","score_opus":0.023047011861560936,"score_gpt":0.29543798038626756,"score_spread":0.2723909685247066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253747709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016446944,0.002167305,0.91433716,0.0012844162,0.001550193,0.00067428855,0.0010057294,0.0048155165,0.057718534],"genre_scores_gemma":[0.3855641,0.0037756409,0.5161741,0.0011109646,0.00032535443,0.0008560592,0.0032592895,0.00047458374,0.08845994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992261,0.00013630616,0.00009507766,0.00014498083,0.00033127057,0.00006632366],"domain_scores_gemma":[0.9993204,0.000151655,0.000043325173,0.00022758427,0.00019333366,0.00006370708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095385115,0.000409399,0.0004430839,0.00061523693,0.0007855023,0.0015817552,0.0013078998,0.000958154,0.005764913],"category_scores_gemma":[0.0017738163,0.0002874328,0.00032060806,0.0010571949,0.0005246208,0.0021354244,0.0016284372,0.0010510549,0.00276194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009597956,0.00025374416,0.00069276907,0.0007786584,0.00006924031,0.000739304,0.00044798528,0.040631797,0.0829239,0.42962584,0.040057655,0.40281937],"study_design_scores_gemma":[0.00025695516,0.0003811498,0.00045911802,0.00019115892,0.0001150033,0.0015672722,0.00013934336,0.34173346,0.0499911,0.107311144,0.4977073,0.00014698418],"about_ca_topic_score_codex":0.0016167616,"about_ca_topic_score_gemma":0.0016027786,"teacher_disagreement_score":0.005764913,"about_ca_system_score_codex":0.0009156116,"about_ca_system_score_gemma":0.0014032138,"threshold_uncertainty_score":0.0192855},"labels":[],"label_agreement":null},{"id":"W4253884266","doi":"10.32920/ryerson.14655078","title":"Congestion aware overlay network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Network packet; Network congestion; Overhead (engineering); Wireless ad hoc network; Wireless network; Distributed computing; Overlay network; Wireless; The Internet; Telecommunications","score_opus":0.024040905619419135,"score_gpt":0.24320318782741135,"score_spread":0.21916228220799222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253884266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16346645,0.005173119,0.8050328,0.00097565935,0.00065412966,0.0006045327,0.0006544323,0.0059650335,0.017473852],"genre_scores_gemma":[0.9229099,0.0016157127,0.06966274,0.00013038817,0.00014658454,0.00013405264,0.0004993427,0.00006834631,0.004832845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999438,0.00012131316,0.000041007726,0.00013411659,0.00016711243,0.00009845568],"domain_scores_gemma":[0.9990828,0.0002758592,0.0000964487,0.00014739201,0.00031360498,0.000083925326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005957908,0.00046934703,0.00078345666,0.00089943875,0.0011602483,0.0009306198,0.0011060596,0.00046479263,0.0015347718],"category_scores_gemma":[0.0022675088,0.00021673244,0.00036868753,0.00081171317,0.00033920363,0.0016634245,0.0013596456,0.0005412053,0.00026562836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087939313,0.00038452516,0.0056523937,0.0009284425,0.00025804414,0.001257211,0.00063265604,0.3447501,0.08301157,0.045638286,0.027416002,0.48919126],"study_design_scores_gemma":[0.000067337154,0.00027503612,0.0014572309,0.000028012322,0.00015123864,0.00067525415,0.00019155623,0.9430164,0.014498369,0.013426637,0.026144482,0.00006843292],"about_ca_topic_score_codex":0.003868202,"about_ca_topic_score_gemma":0.0037618913,"teacher_disagreement_score":0.003868202,"about_ca_system_score_codex":0.0008458094,"about_ca_system_score_gemma":0.0012169391,"threshold_uncertainty_score":0.0076913834},"labels":[],"label_agreement":null},{"id":"W4255480926","doi":"10.1109/twc.2011.09.2016-cl1310-filler","title":"Call for papers: Context-aware networking and communications [future special issue]","year":2013,"lang":"en","type":"paratext","venue":"IEEE Communications Letters","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Context (archaeology); Computer network; Telecommunications; Call control","score_opus":0.04222633249207839,"score_gpt":0.28356853358060213,"score_spread":0.24134220108852375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255480926","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004312769,0.01618218,0.0028924742,0.047314517,0.7513377,0.0006070714,0.0009989672,0.0010711176,0.1791646],"genre_scores_gemma":[0.0024261537,0.018796975,0.0014818496,0.01548682,0.33434507,0.000400211,0.0017071851,0.000617571,0.6247382],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99772686,0.00022766014,0.00017441149,0.00034028527,0.0011594705,0.0003712626],"domain_scores_gemma":[0.9881279,0.0014989419,0.00064417184,0.0005575885,0.006018907,0.003152447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036809512,0.0022322447,0.002262697,0.0028342947,0.0027771138,0.009293797,0.0028667701,0.011297386,0.2851488],"category_scores_gemma":[0.008129164,0.00081971136,0.0018733641,0.0026302338,0.0007438567,0.006327219,0.0024478994,0.0053350916,0.25895175],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019804127,0.000026223574,0.000053825806,0.000098247154,0.000004395328,0.000043473807,0.000004823844,0.000026571886,0.0001238971,0.00081652857,0.9705062,0.028276015],"study_design_scores_gemma":[0.000013149398,0.000042282743,0.00024027243,0.0001203848,0.000009317386,0.00007951253,0.000021477526,0.00017339081,0.00008462426,0.00077966397,0.9984232,0.000012696793],"about_ca_topic_score_codex":0.001209312,"about_ca_topic_score_gemma":0.0026613544,"teacher_disagreement_score":0.2851488,"about_ca_system_score_codex":0.0017928274,"about_ca_system_score_gemma":0.0027238282,"threshold_uncertainty_score":0.95391774},"labels":[],"label_agreement":null},{"id":"W4255963852","doi":"10.1007/978-1-4939-7131-2_100673","title":"Mobile Community","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.04231229615216855,"score_gpt":0.24767429342375802,"score_spread":0.20536199727158946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255963852","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012795868,0.0023631104,0.007967998,0.0026550204,0.0011984265,0.00006875269,0.00030413264,0.0005442452,0.9836187],"genre_scores_gemma":[0.013441484,0.0022678664,0.00286284,0.0008214284,0.00058104686,0.00008831843,0.00047019485,0.00025268918,0.97921413],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997317,0.00004269953,0.000006760661,0.00006903949,0.0000984648,0.000051276882],"domain_scores_gemma":[0.9996518,0.000052005813,0.00001570376,0.00007166392,0.00010004108,0.000108824024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030827665,0.00063982833,0.0003447748,0.0014694282,0.0022412296,0.003454937,0.0011702591,0.0014638822,0.1679084],"category_scores_gemma":[0.0012122322,0.00028047452,0.00032329003,0.0016950655,0.0007134961,0.0061723255,0.0034546345,0.001440377,0.08471041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000311231,0.000048792255,0.0001110309,0.00015908509,0.0000036730303,0.0000928429,0.0007010914,0.00019040528,0.00096607656,0.27070346,0.432184,0.29480836],"study_design_scores_gemma":[0.0000024751082,0.000006140621,0.000052165968,0.000042083317,0.0000011382147,0.00009093664,0.00013070148,0.00012873234,0.00013322254,0.011839287,0.98757046,0.0000028056709],"about_ca_topic_score_codex":0.0013724733,"about_ca_topic_score_gemma":0.0034113992,"teacher_disagreement_score":0.1679084,"about_ca_system_score_codex":0.0010135405,"about_ca_system_score_gemma":0.0009946139,"threshold_uncertainty_score":0.5617095},"labels":[],"label_agreement":null},{"id":"W4256106808","doi":"10.4108/icst.qshine2008.3931","title":"DTN Based Dominating Set Routing Technique for Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Roaming; Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Delay-tolerant networking; Routing (electronic design automation); Vehicular ad hoc network; Ad hoc wireless distribution service; Wireless network; Geocast; Wireless; Routing protocol; Distributed computing; Telecommunications","score_opus":0.03098235861945877,"score_gpt":0.260940381535487,"score_spread":0.2299580229160282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256106808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006373518,0.0017838419,0.9860947,0.00033024093,0.00044924885,0.00015463577,0.00008824336,0.0002934351,0.004432118],"genre_scores_gemma":[0.27711564,0.0046049957,0.7071531,0.00046251732,0.0004373062,0.00048276948,0.0006359083,0.0000681936,0.009039588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942786,0.00020238517,0.000037492693,0.00008184285,0.00021779227,0.000032536245],"domain_scores_gemma":[0.9996747,0.00011684737,0.000032205124,0.000049162336,0.00010058819,0.000026515123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005753343,0.00047761522,0.00061460986,0.0006589118,0.0005753258,0.0005072796,0.0015722945,0.0005541938,0.0011162747],"category_scores_gemma":[0.0009484568,0.00016130383,0.0003882994,0.0009994983,0.00041614365,0.0008311155,0.00057068793,0.00074796774,0.00040673028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027054574,0.00020483989,0.0011925187,0.0012301774,0.00022574762,0.00046963902,0.0005176119,0.2557011,0.06258408,0.13497089,0.018836688,0.52379614],"study_design_scores_gemma":[0.000073488554,0.00058058155,0.0005285986,0.00009153799,0.00013149668,0.0011231219,0.00012207108,0.8456143,0.016852608,0.048466045,0.08635102,0.00006509464],"about_ca_topic_score_codex":0.0007535718,"about_ca_topic_score_gemma":0.001444372,"teacher_disagreement_score":0.0015722945,"about_ca_system_score_codex":0.0005223164,"about_ca_system_score_gemma":0.00058277696,"threshold_uncertainty_score":0.0037896633},"labels":[],"label_agreement":null},{"id":"W4283830182","doi":"","title":"Research Efforts in Mobile Edge Network Environments","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Telecommunications","score_opus":0.02893705148276766,"score_gpt":0.2716455599020187,"score_spread":0.24270850841925107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283830182","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040757816,0.47849518,0.21334182,0.0255515,0.004241731,0.00027737708,0.0005145735,0.0005577344,0.23626223],"genre_scores_gemma":[0.29923192,0.5339563,0.0997203,0.005030119,0.004640291,0.00023108994,0.0012217595,0.00024510178,0.055723257],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877816,0.00029680543,0.000048401078,0.00033139126,0.00035177762,0.0001933803],"domain_scores_gemma":[0.99644816,0.0017778274,0.0001743884,0.00035571912,0.0009841099,0.00025978696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019008216,0.0008338852,0.00062402023,0.0025809803,0.0011899768,0.0040356005,0.0014102457,0.0018984862,0.0064771487],"category_scores_gemma":[0.005356867,0.00045777668,0.0005650796,0.005807279,0.0012701876,0.00738462,0.0020072926,0.0019459114,0.002319443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012262487,0.00018579267,0.0029436215,0.0019278697,0.00005797451,0.0005228475,0.001172956,0.012724218,0.0041759764,0.4134143,0.020929525,0.5418222],"study_design_scores_gemma":[0.000020320713,0.00020425311,0.0020259046,0.0014021947,0.000073095325,0.0013286042,0.0022829813,0.034123305,0.0057826196,0.13427334,0.818426,0.0000572585],"about_ca_topic_score_codex":0.0019405652,"about_ca_topic_score_gemma":0.001367109,"teacher_disagreement_score":0.0064771487,"about_ca_system_score_codex":0.0015791669,"about_ca_system_score_gemma":0.0018470918,"threshold_uncertainty_score":0.021668196},"labels":[],"label_agreement":null},{"id":"W4287826244","doi":"10.23638/dmtcs-22-1-8","title":"A method for eternally dominating strong grids","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Dawson College; McGill University","funders":"Université de Montréal; Mitacs","keywords":"Computer science; Mathematics; Economics","score_opus":0.02819944101800446,"score_gpt":0.3007906537627427,"score_spread":0.27259121274473824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287826244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053105243,0.00020292685,0.9833007,0.00029078242,0.00014517279,0.00016448977,0.00016544048,0.00072327344,0.009696766],"genre_scores_gemma":[0.1698922,0.0005588757,0.79886293,0.00054500706,0.00019992255,0.0007535725,0.00060798455,0.00089238776,0.0276872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837303,0.00038872453,0.00014049938,0.00039275343,0.000489046,0.0002158755],"domain_scores_gemma":[0.9966017,0.0014743085,0.00017429955,0.0010468122,0.00048171316,0.0002211346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016812531,0.0010896018,0.0008952761,0.0015852607,0.0014204044,0.0022143037,0.00305452,0.0012189948,0.01654278],"category_scores_gemma":[0.007432445,0.00064475357,0.0018375497,0.0013783764,0.0017051623,0.004377425,0.0056494544,0.0030851583,0.0043700393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036114373,0.00011264365,0.001350651,0.0003418803,0.000074547825,0.0003972922,0.00081327034,0.056596782,0.009137058,0.76045287,0.011110927,0.15925086],"study_design_scores_gemma":[0.00014125346,0.0001441788,0.00025494606,0.0001069953,0.000054896806,0.0004341728,0.00034019578,0.30819637,0.0064750444,0.62115186,0.06263982,0.000060354127],"about_ca_topic_score_codex":0.0019654862,"about_ca_topic_score_gemma":0.0025354922,"teacher_disagreement_score":0.01654278,"about_ca_system_score_codex":0.001155794,"about_ca_system_score_gemma":0.0010834468,"threshold_uncertainty_score":0.055341125},"labels":[],"label_agreement":null},{"id":"W4298531839","doi":"","title":"Research challenges towards the Future Internet","year":2011,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"The Internet; Computer science; Data science; World Wide Web","score_opus":0.07821706926133014,"score_gpt":0.26743337245530246,"score_spread":0.1892163031939723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298531839","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010018751,0.24119465,0.025977507,0.5744319,0.008269492,0.00007655683,0.0005318118,0.00040853096,0.13909075],"genre_scores_gemma":[0.3579193,0.47479087,0.04038945,0.05454312,0.020635234,0.00038271223,0.0011870007,0.00026167516,0.04989065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978255,0.000703039,0.00009312754,0.00031138642,0.00068244606,0.00038457286],"domain_scores_gemma":[0.98660696,0.0064225052,0.00057440187,0.00076723186,0.0031051533,0.0025237158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009548105,0.0006080985,0.00117639,0.0025563901,0.0027550403,0.012201792,0.0033330147,0.010689955,0.028636344],"category_scores_gemma":[0.0107273515,0.0005564152,0.00064441544,0.0033641912,0.006772419,0.034684766,0.0038590995,0.00680846,0.006365262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010410528,0.00010901206,0.0005010831,0.0007418874,0.000022693504,0.00018459026,0.00050228735,0.002519615,0.00062744255,0.78459924,0.110896006,0.09919192],"study_design_scores_gemma":[0.000024650211,0.000046172405,0.00027832965,0.00075157615,0.000018579525,0.0002441479,0.0029812625,0.0061760326,0.00036538707,0.52343607,0.46563822,0.000039603518],"about_ca_topic_score_codex":0.0031953598,"about_ca_topic_score_gemma":0.0032837729,"teacher_disagreement_score":0.028636344,"about_ca_system_score_codex":0.004430937,"about_ca_system_score_gemma":0.0064544072,"threshold_uncertainty_score":0.095798075},"labels":[],"label_agreement":null},{"id":"W4301047919","doi":"10.1109/tc.2012.208","title":"Measuring Temporal Lags in Delay-Tolerant Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network","score_opus":0.041300068570715824,"score_gpt":0.2315653517016009,"score_spread":0.19026528313088506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301047919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15722735,0.00062377035,0.83851326,0.00045366454,0.00013048846,0.000073963805,0.00028875849,0.00041173556,0.0022770357],"genre_scores_gemma":[0.94590694,0.0005574826,0.0521838,0.00009092533,0.00007801488,0.00009183881,0.0002444233,0.000056184395,0.0007904707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850476,0.00039920036,0.000110970606,0.00041899743,0.0003868478,0.00017931976],"domain_scores_gemma":[0.9891328,0.006474829,0.0023331481,0.0008657951,0.00069068494,0.0005026469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002592006,0.00077659666,0.0005891496,0.0013798781,0.0006244007,0.0018093331,0.001270095,0.0009463816,0.0012568336],"category_scores_gemma":[0.0189962,0.00048253222,0.00043134482,0.00150087,0.0018946299,0.0044594756,0.0020356548,0.0012879126,0.00021006048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034449762,0.000097738106,0.0102036,0.00024652688,0.00005780418,0.00025664986,0.0005780504,0.7081872,0.007838394,0.22886486,0.0007607925,0.042563844],"study_design_scores_gemma":[0.000028682542,0.00010293029,0.0016460124,0.000035546425,0.000020795851,0.000084389314,0.0001650738,0.8292007,0.0034857618,0.16327652,0.0019137667,0.000039813032],"about_ca_topic_score_codex":0.0028742165,"about_ca_topic_score_gemma":0.0013404845,"teacher_disagreement_score":0.0028742165,"about_ca_system_score_codex":0.0016073334,"about_ca_system_score_gemma":0.0008890913,"threshold_uncertainty_score":0.013708055},"labels":[],"label_agreement":null},{"id":"W4301868280","doi":"10.48550/arxiv.1506.04729","title":"Optimal Forwarding in Opportunistic Delay Tolerant Networks with Meeting\\n Rate Estimations","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Latency (audio); Computer network; Distributed computing; A priori and a posteriori; Node (physics); Network topology; Telecommunications","score_opus":0.08329102492060382,"score_gpt":0.20060984588186073,"score_spread":0.11731882096125691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301868280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0884384,0.00029802593,0.90906835,0.00027086574,0.000023924307,0.000066298286,0.00015680378,0.00037322266,0.0013041275],"genre_scores_gemma":[0.8963405,0.000201571,0.1016763,0.00005267419,0.000029386656,0.000091129994,0.00024054798,0.000052534167,0.0013153554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937004,0.00021390559,0.00003548631,0.00016961669,0.00012246601,0.00008853437],"domain_scores_gemma":[0.9949614,0.0037001842,0.00070594,0.0002822173,0.0002439319,0.00010627225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061876,0.0005960492,0.00082646747,0.0009044795,0.00068428024,0.0009055402,0.0015972886,0.00075997325,0.0006865646],"category_scores_gemma":[0.010699328,0.0005544004,0.0003704682,0.00084931526,0.0008339595,0.0014643756,0.00096813496,0.0006672579,0.00014960469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069019494,0.000022842867,0.0010890834,0.00003267618,0.000014958377,0.000039957195,0.000062086605,0.9733794,0.0007045808,0.006711694,0.0004060627,0.017467571],"study_design_scores_gemma":[0.000006440428,0.000009903782,0.00015489875,0.0000029532582,0.0000032048144,0.00001447167,0.000018708757,0.9925262,0.00039383877,0.0066670002,0.0001976637,0.0000047686335],"about_ca_topic_score_codex":0.007422866,"about_ca_topic_score_gemma":0.0059643555,"teacher_disagreement_score":0.007422866,"about_ca_system_score_codex":0.001454405,"about_ca_system_score_gemma":0.0013212708,"threshold_uncertainty_score":0.014759302},"labels":[],"label_agreement":null},{"id":"W4306677954","doi":"10.18280/ijsse.120404","title":"CSCRT Protocol with Energy Efficient Secured CH Clustering for Smart Dust Network Using Quantum Key Distribution","year":2022,"lang":"en","type":"article","venue":"International Journal of Safety and Security Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Routing protocol; Encryption; Wireless sensor network; Distributed computing; Routing (electronic design automation)","score_opus":0.010487771226682555,"score_gpt":0.22987490114504067,"score_spread":0.21938712991835813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306677954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087219365,0.0009356771,0.89481395,0.0011088761,0.00029031947,0.001178079,0.00029218657,0.0014993409,0.012662241],"genre_scores_gemma":[0.94675213,0.0002759301,0.04546941,0.0002243441,0.00004764437,0.00048058183,0.00024605496,0.00003942451,0.0064645153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.00023465995,0.000091513204,0.00015521352,0.0003441937,0.00014369942],"domain_scores_gemma":[0.99875736,0.0003437307,0.00017120445,0.0002539298,0.00040225202,0.0000714056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087610947,0.00032812942,0.00057380996,0.00072659453,0.0011975459,0.00096744305,0.0012754459,0.00070441474,0.0024820275],"category_scores_gemma":[0.0018385758,0.00017405555,0.00029194844,0.00074992905,0.00089263136,0.0016333876,0.0017454339,0.00062291406,0.0003923721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026595916,0.00049342366,0.004139309,0.0010675713,0.00027017205,0.0016728037,0.001883097,0.1903843,0.13266136,0.33764797,0.025205463,0.3019149],"study_design_scores_gemma":[0.0003900491,0.00096260215,0.0009991666,0.000069720656,0.00010610032,0.0013151258,0.0004244472,0.8694181,0.050636586,0.047827397,0.027719185,0.00013160397],"about_ca_topic_score_codex":0.0022232654,"about_ca_topic_score_gemma":0.0033102385,"teacher_disagreement_score":0.0024820275,"about_ca_system_score_codex":0.0014133077,"about_ca_system_score_gemma":0.0019832596,"threshold_uncertainty_score":0.010254264},"labels":[],"label_agreement":null},{"id":"W4308196315","doi":"10.3233/jhs-222018","title":"Double Q-learning based routing protocol for opportunistic networks","year":2022,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Reinforcement learning; Computer network; Routing protocol; Node (physics); Overhead (engineering); Zone Routing Protocol; Protocol (science); Hop (telecommunications); Estimator; Wireless Routing Protocol; Routing (electronic design automation); Distributed computing; Artificial intelligence; Statistics; Mathematics","score_opus":0.040243057454725284,"score_gpt":0.28748773119484383,"score_spread":0.24724467374011855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308196315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044819014,0.00028629552,0.9921445,0.00030184234,0.00011108004,0.00019208968,0.000037686146,0.00048166304,0.00196289],"genre_scores_gemma":[0.67652756,0.00056573737,0.3149737,0.0008221161,0.00014052694,0.001312938,0.00029459238,0.00008145752,0.0052814335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984463,0.0005564118,0.00013021322,0.00023049467,0.00048486268,0.00015174404],"domain_scores_gemma":[0.99711704,0.0015152821,0.0003648154,0.00028765656,0.00056839397,0.00014683376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022392524,0.000637279,0.0010361243,0.0007032664,0.00088146294,0.0009615308,0.0021674186,0.0010768361,0.001555504],"category_scores_gemma":[0.0053435904,0.00026099492,0.00048861594,0.00084940466,0.0010213354,0.001291069,0.0019173595,0.0015372144,0.0003787861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042440326,0.00027087374,0.0017530259,0.0003983506,0.0001675444,0.00065151794,0.0005305896,0.49638674,0.011370517,0.13259423,0.014271964,0.34118038],"study_design_scores_gemma":[0.00006370552,0.000113435635,0.00016198558,0.000016391197,0.000018817187,0.00017327462,0.00003020394,0.9662959,0.0012803769,0.025986983,0.0058323597,0.000026545398],"about_ca_topic_score_codex":0.0025064277,"about_ca_topic_score_gemma":0.0027031165,"teacher_disagreement_score":0.0025064277,"about_ca_system_score_codex":0.0010286268,"about_ca_system_score_gemma":0.0019319124,"threshold_uncertainty_score":0.011842489},"labels":[],"label_agreement":null},{"id":"W4312873628","doi":"10.1007/978-981-19-4775-9_9","title":"Research on Intelligent Access of Space-Air-Ground Integrated Network","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Access network; Computer science; Access technology; Variety (cybernetics); Robustness (evolution); Computer network; Wireless; Telecommunications; Artificial intelligence","score_opus":0.04798654576373696,"score_gpt":0.2981829290695948,"score_spread":0.25019638330585786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312873628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11023997,0.121132016,0.50949395,0.0048499457,0.0019855592,0.000109772685,0.00017443378,0.0005279657,0.2514865],"genre_scores_gemma":[0.7949412,0.08135125,0.058021188,0.0005957005,0.0010996923,0.00005519224,0.0003284141,0.00005486644,0.063552484],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978215,0.00003108712,0.000008701241,0.000063710206,0.00007643752,0.000037967424],"domain_scores_gemma":[0.99969804,0.000117793184,0.000020358457,0.000038122344,0.00010414751,0.000021511061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035708552,0.0003774245,0.0003027049,0.00042142745,0.00028978018,0.001745074,0.00079649204,0.0005075485,0.0039739246],"category_scores_gemma":[0.0007032898,0.00013653927,0.0002296306,0.0011205967,0.00047698483,0.003244449,0.00036103738,0.0006665435,0.0005946661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014077904,0.00012349841,0.0016143732,0.0005034736,0.000045587563,0.00020247974,0.000301371,0.037589725,0.026136067,0.43828544,0.009863356,0.48519388],"study_design_scores_gemma":[0.000033094144,0.00046844556,0.0028288935,0.00024534157,0.000116568735,0.00091857195,0.0007085287,0.42062718,0.03077302,0.27027568,0.27295196,0.000052760668],"about_ca_topic_score_codex":0.0012442707,"about_ca_topic_score_gemma":0.000981005,"teacher_disagreement_score":0.0039739246,"about_ca_system_score_codex":0.0008353286,"about_ca_system_score_gemma":0.0006024405,"threshold_uncertainty_score":0.013294101},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07624539177131777,"score_gpt":0.2821979077412448,"score_spread":0.20595251596992703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313195381","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049831524,0.13137166,0.2878558,0.20592983,0.0073524723,0.000101005346,0.0004962697,0.0015750045,0.3154865],"genre_scores_gemma":[0.58451754,0.15136364,0.15579009,0.013541261,0.004530755,0.00015886345,0.0008049518,0.00036092746,0.08893199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961156,0.00012891694,0.0000108627255,0.000045763187,0.0001370322,0.00006590998],"domain_scores_gemma":[0.99920684,0.00022959856,0.00006526949,0.000111389956,0.00020153004,0.00018534593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132481,0.00035226645,0.00017051227,0.00052051106,0.0010905521,0.003173722,0.0007380205,0.0016528945,0.0052016024],"category_scores_gemma":[0.0011729705,0.0001300462,0.00013403744,0.0007868768,0.0014515158,0.007218691,0.0018797894,0.0014192023,0.0011023224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034949924,0.00001843436,0.00063811423,0.000195247,0.000011161764,0.00007750372,0.0005616744,0.003477128,0.002028454,0.77734685,0.05031554,0.16529503],"study_design_scores_gemma":[0.0000033173853,0.00003381146,0.00030881708,0.00019911668,0.0000065084873,0.00016733585,0.0010890086,0.0046191826,0.000723896,0.23173101,0.7611056,0.000012375958],"about_ca_topic_score_codex":0.0014908505,"about_ca_topic_score_gemma":0.002116515,"teacher_disagreement_score":0.0052016024,"about_ca_system_score_codex":0.0011985805,"about_ca_system_score_gemma":0.0017610573,"threshold_uncertainty_score":0.0174011},"labels":[],"label_agreement":null},{"id":"W4315783220","doi":"10.1109/gcwkshps56602.2022.10008500","title":"Reinforcement Learning Based Congestion Control Mechanism for Opportunistic Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Reinforcement learning; Node (physics); Routing protocol; Network congestion; Latency (audio); Overhead (engineering); Distributed computing; Routing (electronic design automation); Network packet; Artificial intelligence","score_opus":0.020016650652758032,"score_gpt":0.23579036335192052,"score_spread":0.21577371269916248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04374949,0.00026748615,0.95119804,0.00029693384,0.00013297902,0.00012316977,0.00003562681,0.0009127124,0.003283547],"genre_scores_gemma":[0.96677154,0.000078626064,0.031375743,0.00010528176,0.000042042455,0.00010571489,0.000026082309,0.000029603085,0.0014654213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00019369784,0.00004187596,0.00013695548,0.00019157433,0.00011607388],"domain_scores_gemma":[0.99782526,0.0010695095,0.00032634035,0.0001748299,0.00041776005,0.00018628071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001508198,0.00056874065,0.00054309994,0.00056552165,0.00075312273,0.0005732813,0.001970251,0.0005382916,0.0012228108],"category_scores_gemma":[0.0039083506,0.00022846462,0.00028067382,0.00030185847,0.00087240874,0.0011923533,0.00086098106,0.00091734325,0.00013779174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031624266,0.00034570452,0.0027633174,0.00014003424,0.00010850107,0.0003599988,0.00032626258,0.79983926,0.012750128,0.05087017,0.003616397,0.12856394],"study_design_scores_gemma":[0.000026733556,0.00005870435,0.00015630909,0.0000043634504,0.0000115915645,0.00004551427,0.0000130801,0.9904931,0.0011416688,0.006892456,0.0011434951,0.000013046152],"about_ca_topic_score_codex":0.0045440835,"about_ca_topic_score_gemma":0.0035840333,"teacher_disagreement_score":0.0045440835,"about_ca_system_score_codex":0.0009987558,"about_ca_system_score_gemma":0.0011252987,"threshold_uncertainty_score":0.009035289},"labels":[],"label_agreement":null},{"id":"W4323528601","doi":"10.1007/978-3-031-26254-8_59","title":"Explainable Prediction of Intelligent DTN Routing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network","score_opus":0.03554365030554885,"score_gpt":0.22592937038203936,"score_spread":0.19038572007649052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323528601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06158691,0.0010813638,0.91252583,0.0032959972,0.00041209615,0.000040611572,0.00093918625,0.0008839801,0.019234011],"genre_scores_gemma":[0.91160345,0.00083124056,0.07948083,0.00025182584,0.0002630968,0.000068453664,0.00068235735,0.00017818938,0.0066404566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968493,0.00011171471,0.00001844894,0.00007628635,0.00007030408,0.00003830924],"domain_scores_gemma":[0.9969171,0.0021349029,0.00020073695,0.000389659,0.00026781816,0.00008974311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000712754,0.00046737902,0.0004599811,0.00048760697,0.00035605027,0.0010525611,0.0013066939,0.00088842394,0.005349128],"category_scores_gemma":[0.0072954493,0.00033612712,0.0005046235,0.0004261839,0.00086091424,0.0023949847,0.0009155732,0.0012955127,0.00045721087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009478053,0.000033174714,0.001540358,0.000099237586,0.000035498524,0.00016509459,0.00016230796,0.58969575,0.00135222,0.37653697,0.005891319,0.024393316],"study_design_scores_gemma":[0.0000041173366,0.000004708025,0.00013796706,0.000007707817,0.0000052187534,0.000017746985,0.0000084997455,0.8412785,0.00018663224,0.1574805,0.00086408755,0.000004307798],"about_ca_topic_score_codex":0.0044124126,"about_ca_topic_score_gemma":0.004681658,"teacher_disagreement_score":0.005349128,"about_ca_system_score_codex":0.0010752702,"about_ca_system_score_gemma":0.0005239829,"threshold_uncertainty_score":0.017894626},"labels":[],"label_agreement":null},{"id":"W4323844509","doi":"10.18280/isi.280106","title":"An Adaptive Secure and Efficient Bio-Inspired Routing Protocol for Effective Cooperation in FANETs","year":2023,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Zone Routing Protocol; Protocol (science); Routing protocol; Computer network; Routing (electronic design automation); Psychology; Link-state routing protocol; Medicine","score_opus":0.021100704053207697,"score_gpt":0.27378726389454483,"score_spread":0.25268655984133714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323844509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06574264,0.0006576176,0.9256812,0.0004164474,0.00020211405,0.00020469904,0.00006094774,0.00033924647,0.006695074],"genre_scores_gemma":[0.8402003,0.00045803536,0.15451208,0.00014827607,0.000034142548,0.0002548945,0.00010574088,0.000028111097,0.0042584143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997323,0.00008612002,0.000014762259,0.000046036712,0.00008799967,0.00003282254],"domain_scores_gemma":[0.9997546,0.00009824428,0.000035375462,0.000030558087,0.000063079104,0.000018144254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005057154,0.00035408308,0.00037439726,0.0004817117,0.00056881114,0.0005598227,0.00081659097,0.00055213174,0.00075855147],"category_scores_gemma":[0.0012457839,0.00011841432,0.00032997492,0.0003825732,0.0004499931,0.0008038461,0.0007457937,0.00044684493,0.00013330378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025631452,0.00013823446,0.0011318746,0.00018450212,0.00008263509,0.00040302638,0.00030591743,0.7232047,0.03286069,0.08870038,0.004096842,0.14863491],"study_design_scores_gemma":[0.000014184965,0.000118598466,0.00014524946,0.000008780615,0.000012670339,0.00011493411,0.000033973585,0.9880531,0.0021245352,0.0063381186,0.003025129,0.0000107425685],"about_ca_topic_score_codex":0.0012830812,"about_ca_topic_score_gemma":0.0018058221,"teacher_disagreement_score":0.0012830812,"about_ca_system_score_codex":0.00045471668,"about_ca_system_score_gemma":0.00078504736,"threshold_uncertainty_score":0.003299296},"labels":[],"label_agreement":null},{"id":"W4362502973","doi":"10.1007/978-3-031-29419-8","title":"Ubiquitous Networking","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Université Hassan II de Casablanca; Avignon Université; Université de Tunis; Università della Calabria; Università degli Studi di Salerno; Università di Bologna; Politechnika Warszawska; Universiteit Gent; Qatar University; Universidad Pública de Navarra; Università degli Studi Mediterranea di Reggio Calabria; Hankuk University of Foreign Studies; Incheon National University; La Rochelle Université; King Abdullah University of Science and Technology; Cairo University; Independent University, Bangladesh; European Commission; University of Carthage; Joint Research Centre; Indian National Science Academy; Universidade Federal do ABC; Università degli Studi di Milano; Insight SFI Research Centre for Data Analytics; Kent State University; McGill University; Université Mohammed V de Rabat; Indian Institute of Information Technology, Allahabad; King's College London; Institut National des Sciences Appliquées de Lyon; Université du Québec à Montréal; Université de Lorraine; University of the West of England; University of Louisville; Université de Technologie de Troyes; Georgia State University; Imperial College London; Università degli Studi di Napoli Federico II; University of Glasgow; Jackson State University","keywords":"Computer science; World Wide Web; Computer network","score_opus":0.024777909864119284,"score_gpt":0.25122653151824875,"score_spread":0.22644862165412946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362502973","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018807128,0.023491116,0.07254411,0.0015739499,0.0059476946,0.0001594922,0.00081620103,0.004043875,0.88954276],"genre_scores_gemma":[0.0064105396,0.010770911,0.010118609,0.0004614565,0.0008076577,0.00006366397,0.00094996084,0.00036452917,0.97005266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997924,0.000019330759,0.000007058969,0.000048097674,0.00010764941,0.000025554642],"domain_scores_gemma":[0.99977225,0.000029485696,0.000008752606,0.00006118435,0.00007118571,0.00005717669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029550373,0.0010844325,0.0006401867,0.0011668019,0.0007757476,0.0021365627,0.0007734026,0.00088984054,0.122494034],"category_scores_gemma":[0.000566041,0.00036273303,0.00030197907,0.0015377532,0.00028429425,0.002199028,0.0014586617,0.0010296126,0.09414473],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003799344,0.00004853793,0.00010616066,0.00018055092,0.000008440872,0.00007890846,0.00006059938,0.0006470977,0.0027318879,0.030378096,0.4545713,0.5111504],"study_design_scores_gemma":[0.0000041439052,0.00002271016,0.00019527662,0.000081269056,0.0000064619417,0.00018839535,0.000028604512,0.0014459197,0.00064711575,0.007167867,0.99020493,0.0000074278523],"about_ca_topic_score_codex":0.00093055714,"about_ca_topic_score_gemma":0.0027492049,"teacher_disagreement_score":0.122494034,"about_ca_system_score_codex":0.0004905924,"about_ca_system_score_gemma":0.00042219122,"threshold_uncertainty_score":0.40978342},"labels":[],"label_agreement":null},{"id":"W4376288712","doi":"10.22214/ijraset.2023.51956","title":"Stingray Device for Cyber-Surveillance using a Software-Defined Radio as an IMSI Catcher","year":2023,"lang":"en","type":"article","venue":"International Journal for Research in Applied Science and Engineering Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer security; Service (business); Computer science; Software; Handover; Law enforcement; Telecommunications; Business; Law","score_opus":0.10087738014946368,"score_gpt":0.40100530133596357,"score_spread":0.3001279211864999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376288712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39796636,0.001890905,0.3929468,0.0015441892,0.0017738177,0.0019485339,0.0018711385,0.050972924,0.14908528],"genre_scores_gemma":[0.89406073,0.00032754376,0.0508236,0.0008604011,0.00018535562,0.0004201442,0.0012910268,0.0004446136,0.051586565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943155,0.00009514439,0.000041663727,0.000120848425,0.0002275805,0.000083148334],"domain_scores_gemma":[0.99932075,0.00010807292,0.00008877467,0.00017913268,0.00020395548,0.00009942007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053172855,0.00056905573,0.00037215187,0.0008823121,0.00042270348,0.00071837916,0.00087582646,0.0006416549,0.018065585],"category_scores_gemma":[0.000647426,0.00015205405,0.00030007918,0.000306171,0.00034157335,0.0010877273,0.0009232945,0.0006944163,0.0045527956],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021621387,0.0010927642,0.019545564,0.0008369458,0.00018834414,0.002771067,0.0013370198,0.0026956792,0.38710067,0.026385935,0.1126225,0.44326147],"study_design_scores_gemma":[0.0005450285,0.004220479,0.020059444,0.00020664567,0.00037824863,0.00709544,0.00047934108,0.08103495,0.45868507,0.0022011285,0.42480546,0.00028862472],"about_ca_topic_score_codex":0.00042359717,"about_ca_topic_score_gemma":0.0003788,"teacher_disagreement_score":0.018065585,"about_ca_system_score_codex":0.0003502736,"about_ca_system_score_gemma":0.00031720623,"threshold_uncertainty_score":0.060435355},"labels":[],"label_agreement":null},{"id":"W4376626946","doi":"10.56553/popets-2023-0086","title":"DPrio: Efficient Differential Privacy with High Utility for Prio","year":2023,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Differential privacy; Computer science; Computer security; Overhead (engineering); Server; Implementation; Differential (mechanical device); Internet privacy; Computer network; Data mining","score_opus":0.024016534598809418,"score_gpt":0.2476793243323904,"score_spread":0.22366278973358097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376626946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019718187,0.0002124169,0.97298694,0.0005441896,0.00007258342,0.00026880606,0.00010655761,0.0014761947,0.0046139867],"genre_scores_gemma":[0.6649366,0.00023309531,0.32601926,0.0007080612,0.00013198794,0.0004703494,0.00028051905,0.00029427314,0.006925867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98819387,0.0041737324,0.0006726147,0.0015925536,0.004281199,0.0010860676],"domain_scores_gemma":[0.97642946,0.007894718,0.0017150134,0.011621507,0.0016034879,0.0007357163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009657265,0.0007869614,0.001612007,0.0011002115,0.0020315815,0.0035620434,0.004077931,0.0019612368,0.0023922713],"category_scores_gemma":[0.026500534,0.0008845486,0.0012552172,0.0016184049,0.0041042496,0.006851564,0.013713571,0.0048247967,0.0012824984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014499546,0.0004803809,0.0037717526,0.0005086789,0.00018568634,0.0010057896,0.0023368632,0.064379066,0.052425362,0.6713593,0.008622643,0.1934746],"study_design_scores_gemma":[0.00023057393,0.0005753963,0.00072936155,0.00009758274,0.000112938746,0.0015085702,0.00050244137,0.60691607,0.04496405,0.31864694,0.02555074,0.00016527544],"about_ca_topic_score_codex":0.0005362634,"about_ca_topic_score_gemma":0.0005406824,"teacher_disagreement_score":0.009657265,"about_ca_system_score_codex":0.0018015492,"about_ca_system_score_gemma":0.002445917,"threshold_uncertainty_score":0.051073074},"labels":[],"label_agreement":null},{"id":"W4376849847","doi":"10.56801/rebicte.v7i.118","title":"Performance Evaluation of Routing Protocols for Opportunistic Networks: An Energy Efficiency Perspective","year":2021,"lang":"en","type":"article","venue":"Research Briefs on Information and Communication Technology Evolution","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Rhodes University","keywords":"Computer science; Computer network; Routing protocol; Link-state routing protocol; Interior gateway protocol; Routing (electronic design automation); Node (physics); Efficient energy use; Distance-vector routing protocol; Energy consumption; Energy (signal processing); Distributed computing; Engineering; Electrical engineering","score_opus":0.08665888118092814,"score_gpt":0.3828920393089491,"score_spread":0.296233158128021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376849847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70962435,0.010718267,0.24077958,0.0016413318,0.00060689595,0.0014071229,0.0013460928,0.0019175657,0.03195875],"genre_scores_gemma":[0.95470726,0.002836711,0.03859069,0.00010059463,0.00008196299,0.00042112084,0.0006797897,0.00013003357,0.0024518229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99180144,0.0030348697,0.00059481524,0.00050009234,0.0034735955,0.00059507735],"domain_scores_gemma":[0.98036754,0.01358066,0.0016384161,0.0015461774,0.0026128837,0.0002544495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008470529,0.0015334755,0.0010496791,0.002106418,0.0008827027,0.0018694005,0.0015108163,0.0011368494,0.0011566057],"category_scores_gemma":[0.02245799,0.0003462574,0.00048527052,0.002383722,0.00088884734,0.0033498853,0.0011711407,0.00072612794,0.00024681387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000691767,0.00045263272,0.006697902,0.00065241056,0.00024137604,0.0001753118,0.00020767494,0.8794426,0.010208611,0.0128777595,0.0025608835,0.085791096],"study_design_scores_gemma":[0.00004814857,0.0011358031,0.0026140455,0.00006166964,0.00008813892,0.00016972948,0.00028394102,0.97944725,0.009222534,0.0037510432,0.0031291905,0.00004857936],"about_ca_topic_score_codex":0.0035590474,"about_ca_topic_score_gemma":0.0024610301,"teacher_disagreement_score":0.008470529,"about_ca_system_score_codex":0.0024298145,"about_ca_system_score_gemma":0.0015660812,"threshold_uncertainty_score":0.044797003},"labels":[],"label_agreement":null},{"id":"W4377971988","doi":"10.1007/978-3-031-32733-9_17","title":"Cops &amp; Robber on Periodic Temporal Graphs: Characterization and Improved Bounds","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Characterization (materials science); Combinatorics; Upper and lower bounds; Graph; Discrete mathematics; Class (philosophy); Mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.02222898925234212,"score_gpt":0.2362001053712595,"score_spread":0.21397111611891736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377971988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12107907,0.004520454,0.7071939,0.004993728,0.00060164405,0.00050621777,0.002213976,0.002407312,0.15648377],"genre_scores_gemma":[0.67556965,0.005169889,0.20310123,0.0017255757,0.0015628544,0.001020885,0.0033342072,0.0025243082,0.10599139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773407,0.0003957822,0.000093910494,0.0006489014,0.0005558209,0.00057150447],"domain_scores_gemma":[0.9847408,0.010254184,0.0012483381,0.0016377642,0.0009109068,0.0012080106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018058273,0.0022150108,0.002677697,0.0042316117,0.002649044,0.0044878223,0.0055562286,0.0023556915,0.024406416],"category_scores_gemma":[0.017261056,0.0017114638,0.002111213,0.0052938233,0.0034728732,0.013204208,0.0054281917,0.005751583,0.0028157616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050527387,0.0003189208,0.0014913173,0.00075534853,0.00011775512,0.00040706166,0.00073328486,0.12493711,0.0054933624,0.75396574,0.041622903,0.06965193],"study_design_scores_gemma":[0.000042599848,0.000089710884,0.0007724065,0.00010435884,0.00008134788,0.00029912585,0.00021942529,0.4283735,0.002619832,0.5567839,0.010564034,0.000049762486],"about_ca_topic_score_codex":0.006476624,"about_ca_topic_score_gemma":0.007846704,"teacher_disagreement_score":0.024406416,"about_ca_system_score_codex":0.0036959173,"about_ca_system_score_gemma":0.002295828,"threshold_uncertainty_score":0.081647575},"labels":[],"label_agreement":null},{"id":"W4385307930","doi":"10.22323/1.444.1053","title":"Pacific Ocean Neutrino Experiment: Expected performance of the first cluster of strings","year":2023,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Narodowym Centrum Nauki; European Commission; Canada First Research Excellence Fund; National Science Foundation","keywords":"Detector; Neutrino; Neutrino detector; Deep sea; Sea trial; Ocean observations; Event (particle physics); Calibration; Physics; Remote sensing; Environmental science; Meteorology; Oceanography; Neutrino oscillation; Geography; Geology; Particle physics; Optics; Astrophysics","score_opus":0.016578475262866408,"score_gpt":0.216684662961567,"score_spread":0.2001061876987006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385307930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7196467,0.0020365461,0.09897392,0.010295405,0.0012793862,0.0014267795,0.024280222,0.010027596,0.13203345],"genre_scores_gemma":[0.8697164,0.0010608876,0.08715305,0.0007531229,0.000115900955,0.0005338768,0.031086907,0.0006806394,0.00889909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983278,0.00045790907,0.00003085937,0.00023671384,0.00058509706,0.00036174155],"domain_scores_gemma":[0.9970663,0.000531988,0.0001362868,0.00035026358,0.0010421542,0.0008728958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006918009,0.0010818018,0.00066566427,0.00059883884,0.0010187081,0.001993641,0.0013036422,0.0012092135,0.0029408238],"category_scores_gemma":[0.006961125,0.0003238231,0.0005633058,0.0011042014,0.0006450041,0.0023135848,0.0016844815,0.0016448739,0.0013136575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010579238,0.0016241072,0.13344748,0.001097568,0.0006785512,0.000801775,0.00068183156,0.3418812,0.047984246,0.067281,0.15472303,0.23922004],"study_design_scores_gemma":[0.0014132112,0.0037747533,0.04818883,0.00026998523,0.00026675433,0.00023737573,0.00044477187,0.797725,0.044137713,0.02255749,0.080743544,0.00024062203],"about_ca_topic_score_codex":0.01913118,"about_ca_topic_score_gemma":0.015698042,"teacher_disagreement_score":0.01913118,"about_ca_system_score_codex":0.0022482611,"about_ca_system_score_gemma":0.0033748397,"threshold_uncertainty_score":0.038039684},"labels":[],"label_agreement":null},{"id":"W4385694460","doi":"10.1109/bsc57238.2023.10201831","title":"A Buffer Occupancy Estimation Model for Opportunistic Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Buffer (optical fiber); Computer science; Computer network; Buffer overflow; Occupancy; Node (physics); Network congestion; Routing (electronic design automation); Real-time computing; Telecommunications; Engineering","score_opus":0.06262032557898624,"score_gpt":0.2933804284568055,"score_spread":0.23076010287781928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385694460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014640025,0.0003348881,0.98216015,0.00019200255,0.000060154,0.000039749928,0.00010249379,0.0001985369,0.0022720944],"genre_scores_gemma":[0.9392329,0.00061489013,0.05545568,0.00014794647,0.0001007813,0.00018544013,0.0001818659,0.000056338675,0.004024144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988955,0.00028330565,0.000057398396,0.00023039922,0.00031756575,0.00021581429],"domain_scores_gemma":[0.9981134,0.0010167976,0.00032688564,0.00014310106,0.00030641837,0.00009347853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015035815,0.0008127224,0.0006753036,0.0007006026,0.0005125043,0.0011317434,0.00208884,0.0008262344,0.0012452833],"category_scores_gemma":[0.005196879,0.00041921905,0.0004431082,0.0008398944,0.00093309156,0.0023397193,0.0010270375,0.0010149456,0.00015754798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006223221,0.00002473621,0.0007465892,0.000047328915,0.00001488366,0.000077503166,0.00006207851,0.9411152,0.0012761691,0.045373406,0.00081131386,0.010388587],"study_design_scores_gemma":[0.0000023312746,0.000012942271,0.00008900171,0.00000390121,0.000005517429,0.000017120086,0.00000682654,0.9940685,0.00017691954,0.0052624317,0.00034884733,0.0000055287906],"about_ca_topic_score_codex":0.008430845,"about_ca_topic_score_gemma":0.00518975,"teacher_disagreement_score":0.008430845,"about_ca_system_score_codex":0.0014105533,"about_ca_system_score_gemma":0.001491768,"threshold_uncertainty_score":0.016763508},"labels":[],"label_agreement":null},{"id":"W4387933279","doi":"10.1109/wisee58383.2023.10289495","title":"Analysis of Bundle Protocol Security Policies for Safeguarding Space Missions against Threats","year":2023,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer security; Safeguarding; Provisioning; Computer science; Context (archaeology); Cryptographic protocol; Protocol (science); Cryptography; Security service; Bundle; Security policy; Information security; Computer network","score_opus":0.05274724851775938,"score_gpt":0.3434996183810837,"score_spread":0.29075236986332437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387933279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15715493,0.00063416705,0.8247811,0.00088287366,0.00009108986,0.00042099608,0.00021787376,0.00063233444,0.015184677],"genre_scores_gemma":[0.89812684,0.0006305346,0.09847309,0.00010030379,0.00004270809,0.00019887538,0.00021038305,0.00012718535,0.00209006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967174,0.0011868598,0.00023218391,0.00030737495,0.0010767385,0.0004795027],"domain_scores_gemma":[0.9860049,0.0076946192,0.0017695599,0.002058112,0.0021097134,0.00036305684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056531415,0.00059013837,0.0004871431,0.001530141,0.0008241134,0.0024115304,0.0006682255,0.00091588555,0.0026871585],"category_scores_gemma":[0.019378796,0.00040164625,0.0005981284,0.00068708626,0.0012636774,0.0044972054,0.0010900866,0.0013369482,0.0005075952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003852821,0.00024116696,0.008771058,0.00031441025,0.000080585065,0.00029612315,0.0006887691,0.3758026,0.020146487,0.5193911,0.0037129612,0.070169404],"study_design_scores_gemma":[0.000015408137,0.00017496104,0.001086689,0.000060787417,0.000031462445,0.00018609733,0.00023414698,0.9106323,0.0053829104,0.07675976,0.005411508,0.000023984034],"about_ca_topic_score_codex":0.0012999696,"about_ca_topic_score_gemma":0.0010938315,"teacher_disagreement_score":0.0056531415,"about_ca_system_score_codex":0.0018115349,"about_ca_system_score_gemma":0.0032555507,"threshold_uncertainty_score":0.029897034},"labels":[],"label_agreement":null},{"id":"W4388145604","doi":"10.1109/lnet.2023.3328918","title":"Energy Sustainability in Dense Radio Access Networks via High Altitude Platform Stations","year":2023,"lang":"en","type":"article","venue":"IEEE Networking Letters","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Base station; Efficient energy use; Computer network; Energy consumption; Quality of service; Scalability; Radio access network; Heterogeneous network; Wireless network; Wireless; Telecommunications; Mobile station; Engineering; Database","score_opus":0.024869310640625322,"score_gpt":0.26370565361794096,"score_spread":0.23883634297731565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388145604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5685551,0.0005957874,0.42203182,0.00019963013,0.000034308385,0.000061735904,0.000051575735,0.0001469595,0.008323069],"genre_scores_gemma":[0.98431754,0.00013151424,0.014542711,0.000016092277,0.000006312744,0.000011642548,0.000020261692,0.000004928594,0.00094902894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998977,0.00003296048,0.0000022524766,0.00002001205,0.00001925177,0.00002771948],"domain_scores_gemma":[0.9998888,0.00005541296,0.000019404846,0.000010288651,0.000012466792,0.000013545964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023615743,0.00037408294,0.00021939896,0.00023740361,0.0003685424,0.0006238251,0.00042711242,0.00028918017,0.0006645021],"category_scores_gemma":[0.00043895203,0.00016598575,0.00018244697,0.00028653155,0.00031073965,0.0005768674,0.0006480702,0.00017548585,0.00005810113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009643797,0.000054428612,0.0028232469,0.000054463708,0.000026389527,0.00031614836,0.00006136288,0.92656696,0.011265735,0.009977756,0.0003390149,0.04841816],"study_design_scores_gemma":[0.000008225931,0.000065367945,0.00085992593,0.0000049063756,0.000012573852,0.000056658984,0.000088546214,0.9914807,0.0019318049,0.0048631015,0.0006238099,0.0000043401633],"about_ca_topic_score_codex":0.0030882792,"about_ca_topic_score_gemma":0.0061661215,"teacher_disagreement_score":0.0030882792,"about_ca_system_score_codex":0.0004864072,"about_ca_system_score_gemma":0.0003834241,"threshold_uncertainty_score":0.0061405897},"labels":[],"label_agreement":null},{"id":"W4388421829","doi":"10.18280/isi.280524","title":"Optimizing Cluster Head Selection in Mobile Ad Hoc Networks: A Connectivity Probability Approach Using Poisson Distribution and Residual Energy","year":2023,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Mustansiriyah University","keywords":"Poisson distribution; Computer science; Selection (genetic algorithm); Cluster (spacecraft); Mobile ad hoc network; Distribution (mathematics); Wireless ad hoc network; Computer network; Artificial intelligence; Mathematics; Statistics; Telecommunications; Wireless","score_opus":0.02556329164896465,"score_gpt":0.24340548663409192,"score_spread":0.21784219498512727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388421829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015035563,0.00065115996,0.982809,0.00014811635,0.00003261728,0.000062732084,0.000016588821,0.00013950917,0.0011046734],"genre_scores_gemma":[0.7754711,0.0023725901,0.21896023,0.00014401058,0.00020508534,0.00023471928,0.00011494967,0.00008231976,0.002415064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882513,0.0004293212,0.000053421856,0.00015837917,0.00045479133,0.00007885179],"domain_scores_gemma":[0.9984187,0.00093475427,0.00018613109,0.00009629997,0.0003185872,0.00004553428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082499,0.0007103264,0.00066693017,0.0013420664,0.0004863453,0.0009183322,0.001676497,0.00069166016,0.00039386834],"category_scores_gemma":[0.004379267,0.00039992845,0.0006184593,0.0014345715,0.00057471,0.0016490332,0.0008680997,0.00046221793,0.00016059664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082049846,0.00007494837,0.0037571397,0.00013438509,0.00009326942,0.0001676595,0.00015418923,0.8756573,0.004936317,0.021288335,0.00085018674,0.09280416],"study_design_scores_gemma":[0.0000064072096,0.00005668437,0.00047282747,0.000006516039,0.000019336145,0.00007985289,0.000032105905,0.99313086,0.0012635919,0.004145591,0.000772923,0.00001321511],"about_ca_topic_score_codex":0.0020514326,"about_ca_topic_score_gemma":0.0020066986,"teacher_disagreement_score":0.002082499,"about_ca_system_score_codex":0.0009115478,"about_ca_system_score_gemma":0.0011576854,"threshold_uncertainty_score":0.011013448},"labels":[],"label_agreement":null},{"id":"W4390189735","doi":"10.1109/milcom58377.2023.10356285","title":"IoT in Coalition Federated Operations: Multi-National C2 Integration and Technical Interoperability Experiments","year":2023,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Interoperability; Computer science; Exploit; Situation awareness; Internet of Things; Domain (mathematical analysis); Task (project management); Computer security; World Wide Web; Systems engineering; Engineering","score_opus":0.08467669254365007,"score_gpt":0.34068686347396127,"score_spread":0.2560101709303112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390189735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97460043,0.0000330903,0.017945904,0.00021651937,0.000030259847,0.00021718259,0.00012026743,0.00025913876,0.0065773036],"genre_scores_gemma":[0.98550713,0.00002205482,0.013386441,0.000077277895,0.0000046845066,0.00014974155,0.00020203402,0.000023478557,0.000627137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846387,0.0007515113,0.000058873247,0.00013545825,0.00033978064,0.0002503878],"domain_scores_gemma":[0.99464226,0.0027235176,0.00041869364,0.0011981282,0.0005444994,0.0004729418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386535,0.00040383457,0.00036575246,0.0005362715,0.0009355248,0.0010135256,0.0007741957,0.00096888887,0.0013138158],"category_scores_gemma":[0.007634966,0.00014882884,0.00037648928,0.0006142158,0.001068605,0.002414546,0.0017921696,0.0014275971,0.00017806287],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009230164,0.023955341,0.036227245,0.00040893487,0.00043332815,0.0013266532,0.004742117,0.6101567,0.06077341,0.121482216,0.00897,0.1222939],"study_design_scores_gemma":[0.0004711195,0.003778124,0.008208898,0.00003473143,0.0000644461,0.00017881117,0.002185688,0.9343728,0.024861874,0.021662386,0.00412577,0.000055411347],"about_ca_topic_score_codex":0.0042532985,"about_ca_topic_score_gemma":0.0022866945,"teacher_disagreement_score":0.004386535,"about_ca_system_score_codex":0.0010334059,"about_ca_system_score_gemma":0.0010797442,"threshold_uncertainty_score":0.023198485},"labels":[],"label_agreement":null},{"id":"W4390580944","doi":"10.5383/juspn.17.01.003","title":"From Collective Memory to Map Services","year":2022,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Collective memory; Refugee; Alienation; Group cohesiveness; Palimpsest; Crowdsourcing; Point (geometry); Context (archaeology); Cohesion (chemistry); Quality (philosophy); Computer science; Affect (linguistics); Social group; Psychology; Social psychology; Sociology; Business; Internet privacy; Public relations; World Wide Web; Political science; Geography; Communication; Epistemology","score_opus":0.011504995477134511,"score_gpt":0.2194003465203374,"score_spread":0.2078953510432029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390580944","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20028074,0.0068857074,0.523956,0.010444781,0.0015302944,0.00096388574,0.001998092,0.04018553,0.21375501],"genre_scores_gemma":[0.8833407,0.0017949775,0.07574143,0.00070722966,0.0002867381,0.0002130129,0.0009715231,0.00080789195,0.03613653],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919623,0.0002044389,0.000031446136,0.00010482196,0.00029885868,0.00016416477],"domain_scores_gemma":[0.99887437,0.00028128162,0.00006324948,0.00041523518,0.00017157725,0.00019432351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066546066,0.0007108824,0.00036183713,0.00072461995,0.0011249675,0.002984487,0.002045142,0.0014473977,0.008892141],"category_scores_gemma":[0.0027483015,0.00019881842,0.0004961932,0.0010129812,0.00087968796,0.0035395457,0.004642507,0.001080234,0.002736134],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007847528,0.00044752265,0.005754715,0.0016687483,0.00017631892,0.0018162804,0.0077773673,0.010917406,0.021028934,0.09401014,0.08524107,0.77037674],"study_design_scores_gemma":[0.000120114855,0.0003691845,0.003973135,0.0003335221,0.00017614485,0.0016844166,0.010683894,0.0929969,0.035111982,0.14337906,0.71100587,0.0001658374],"about_ca_topic_score_codex":0.0070332424,"about_ca_topic_score_gemma":0.0053682434,"teacher_disagreement_score":0.008892141,"about_ca_system_score_codex":0.00059935043,"about_ca_system_score_gemma":0.0008521569,"threshold_uncertainty_score":0.029747188},"labels":[],"label_agreement":null},{"id":"W4392158745","doi":"10.1109/globecom54140.2023.10437218","title":"Task Offloading and Resource Management for CBTC via Multi-Hop Ad Hoc Network and MEC","year":2023,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Vehicular ad hoc network; Mobile ad hoc network; Hop (telecommunications); Resource management (computing); Task (project management); Distributed computing; Operating system; Wireless; Engineering","score_opus":0.027357188654576075,"score_gpt":0.24878545380499698,"score_spread":0.2214282651504209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049580794,0.0006378226,0.94102454,0.00025302087,0.0001351473,0.000113990965,0.000046045665,0.0005641044,0.0076446324],"genre_scores_gemma":[0.925394,0.0002903832,0.06979884,0.00011399779,0.000048044203,0.00010440185,0.00006688903,0.000028212422,0.004155113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997296,0.000044186905,0.000012852342,0.000065666725,0.00008031511,0.00006741928],"domain_scores_gemma":[0.99980444,0.00005546089,0.000027393824,0.000030097739,0.00005646524,0.0000260634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478236,0.0004997198,0.00041085578,0.0003395341,0.0006035218,0.000551855,0.00088204263,0.0004955083,0.0010569078],"category_scores_gemma":[0.0005215813,0.00015298584,0.00023184618,0.00043137275,0.00033536644,0.0007555625,0.0008006746,0.0004103381,0.0001686119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018527571,0.00013260847,0.0012640413,0.00013986093,0.00004254637,0.0003580366,0.00014771383,0.7766252,0.025772901,0.013811772,0.0045110947,0.17700884],"study_design_scores_gemma":[0.000005637731,0.00002947617,0.00017662812,0.0000041699386,0.0000067710994,0.000040128478,0.000024724228,0.9956382,0.001549737,0.0014380302,0.0010799686,0.0000066542652],"about_ca_topic_score_codex":0.0054103243,"about_ca_topic_score_gemma":0.008090186,"teacher_disagreement_score":0.0054103243,"about_ca_system_score_codex":0.0005188128,"about_ca_system_score_gemma":0.001041645,"threshold_uncertainty_score":0.010757625},"labels":[],"label_agreement":null},{"id":"W4392158895","doi":"10.1109/upcon59197.2023.10434592","title":"Ad Hoc Networks: Adaptable Connectivity for Contemporary Business Needs","year":2023,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobile ad hoc network; Computer network; Telecommunications; Wireless","score_opus":0.05976028168347003,"score_gpt":0.2551662625552378,"score_spread":0.19540598087176775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158895","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016812658,0.10663899,0.5284681,0.04593741,0.010404653,0.0005657282,0.0006984521,0.00324343,0.28723058],"genre_scores_gemma":[0.32192752,0.20145094,0.30718648,0.010125211,0.012650879,0.0010387299,0.0018863389,0.00082018337,0.1429137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987313,0.0002899155,0.00006805235,0.00016658676,0.00063049735,0.00011350949],"domain_scores_gemma":[0.9989722,0.00044584472,0.00009203479,0.00015161096,0.00023575874,0.00010252908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011421867,0.00075611245,0.00050831784,0.0009589042,0.0011488502,0.0039438014,0.0015753366,0.0024421865,0.006461031],"category_scores_gemma":[0.0036722927,0.00039372646,0.0002929343,0.0016998539,0.001456235,0.007256193,0.0021228762,0.0020554066,0.0035664877],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004084169,0.00006678336,0.0012788029,0.00086630345,0.000039237642,0.0008276486,0.0007155584,0.013189322,0.005634293,0.49230295,0.10901215,0.37602612],"study_design_scores_gemma":[0.000011907879,0.000059692848,0.0004517567,0.00041137423,0.000021166474,0.0013291771,0.00046774987,0.012187757,0.0005779425,0.1303032,0.85414547,0.000032727483],"about_ca_topic_score_codex":0.0006948066,"about_ca_topic_score_gemma":0.0008398276,"teacher_disagreement_score":0.006461031,"about_ca_system_score_codex":0.0008279498,"about_ca_system_score_gemma":0.0010129199,"threshold_uncertainty_score":0.021614254},"labels":[],"label_agreement":null},{"id":"W4392159259","doi":"10.1109/globecom54140.2023.10437700","title":"Deep Q-Network Dueling-Based Opportunistic Data Transmission in Blockchain-Enabled M2M Communication","year":2023,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blockchain; Computer science; Computer network; Transmission (telecommunications); Data transmission; Telecommunications; Computer security","score_opus":0.061258700064292,"score_gpt":0.28381830684908876,"score_spread":0.22255960678479675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392159259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10142273,0.00052244664,0.8897918,0.000595392,0.00007803188,0.00012877939,0.0001128849,0.00014986972,0.007198136],"genre_scores_gemma":[0.9753264,0.00017808442,0.022004858,0.00006488776,0.000014577089,0.000071565744,0.000038252027,0.000015743743,0.002285632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998971,0.00042193185,0.00004410805,0.00016179337,0.00018831613,0.00021297012],"domain_scores_gemma":[0.9980956,0.0011754142,0.00023049151,0.00014585369,0.00021325356,0.0001395037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019945996,0.00046550448,0.0010522151,0.0005218076,0.00096653425,0.0009808588,0.0014482519,0.0009337888,0.0028203856],"category_scores_gemma":[0.0036084533,0.00034550525,0.00041925404,0.0008521923,0.0013052865,0.0022676252,0.0017565232,0.00078111776,0.00018671666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013422896,0.00004802664,0.0005818708,0.00007620251,0.000021790138,0.00015958944,0.00009097365,0.92365676,0.0015506347,0.056224737,0.0008210758,0.016634144],"study_design_scores_gemma":[0.000010609645,0.000026351116,0.000054733882,0.0000044709673,0.0000036335887,0.000022140483,0.0000125099705,0.98420334,0.00022857256,0.015066662,0.0003616255,0.0000053914323],"about_ca_topic_score_codex":0.0047626393,"about_ca_topic_score_gemma":0.005177323,"teacher_disagreement_score":0.0047626393,"about_ca_system_score_codex":0.0016061263,"about_ca_system_score_gemma":0.001628686,"threshold_uncertainty_score":0.011653304},"labels":[],"label_agreement":null},{"id":"W4392315491","doi":"","title":"Usage of Internet of Thing in mobile Telecommunication Networks and Related Fields","year":2023,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Telecommunications; The Internet; Mobile telephony; Computer science; Mobile radio; World Wide Web","score_opus":0.01677640647236664,"score_gpt":0.2318651053565466,"score_spread":0.21508869888417997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392315491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8108668,0.035104807,0.033922084,0.0046053543,0.0010570266,0.000096947195,0.0017675848,0.00028898087,0.112290435],"genre_scores_gemma":[0.97994894,0.008484382,0.0042979373,0.00032495992,0.00045238406,0.00003052106,0.0007479858,0.000061565515,0.005651375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900764,0.00035616785,0.00007073364,0.0001750843,0.00027121181,0.00011917506],"domain_scores_gemma":[0.9933848,0.003800747,0.0010424223,0.00044398973,0.00092748506,0.00040051786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084990787,0.00026502882,0.00023606782,0.0034515793,0.00064191513,0.002335877,0.00039307275,0.0008842196,0.0029716175],"category_scores_gemma":[0.0052507534,0.00011026386,0.00022380633,0.006045928,0.00058795133,0.0030428302,0.0007432653,0.0005498064,0.0005882072],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038527354,0.00022443851,0.19929998,0.0013889552,0.000121307574,0.0013096221,0.005949933,0.0034592182,0.01560124,0.1399823,0.013499222,0.61877847],"study_design_scores_gemma":[0.000024636596,0.0007546679,0.3304881,0.0019927877,0.00046573483,0.016997557,0.020506011,0.041268867,0.0133528365,0.10148099,0.47244725,0.00022052776],"about_ca_topic_score_codex":0.0006599818,"about_ca_topic_score_gemma":0.00075247674,"teacher_disagreement_score":0.0034515793,"about_ca_system_score_codex":0.00045910827,"about_ca_system_score_gemma":0.0002760118,"threshold_uncertainty_score":0.0099410415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02564544004550459,"score_gpt":0.2788105216645401,"score_spread":0.2531650816190355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392796562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063315365,0.00006872964,0.99247557,0.000085030275,0.000008300176,0.000020807758,0.000011953803,0.00022254608,0.0007755689],"genre_scores_gemma":[0.57213163,0.00021350439,0.4252374,0.0001583013,0.00004266245,0.00016957954,0.00007982018,0.000120144905,0.0018470403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946886,0.00013809711,0.00002558348,0.00014763682,0.00013711171,0.00008271186],"domain_scores_gemma":[0.99933594,0.00033836896,0.00008172209,0.000069978174,0.00010635246,0.000067602254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009204188,0.0006949003,0.0007324723,0.00066027977,0.0006358284,0.0011491736,0.0020644777,0.00096122886,0.0012436629],"category_scores_gemma":[0.0026535098,0.0004997265,0.0006367265,0.000556966,0.0012415177,0.0019213689,0.0018387135,0.0011733678,0.0002620064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006236153,0.000058961115,0.0010204979,0.00004581809,0.000029673307,0.00010768048,0.0002876635,0.8661676,0.0057899863,0.044633962,0.0009932112,0.08080257],"study_design_scores_gemma":[0.000002935204,0.000010983732,0.0000465683,0.000001628588,0.0000025011689,0.0000067766587,0.000011100865,0.9958752,0.0002939897,0.00348852,0.0002559352,0.0000037985126],"about_ca_topic_score_codex":0.0091709485,"about_ca_topic_score_gemma":0.008361778,"teacher_disagreement_score":0.0091709485,"about_ca_system_score_codex":0.0009919518,"about_ca_system_score_gemma":0.0013424405,"threshold_uncertainty_score":0.018235147},"labels":[],"label_agreement":null},{"id":"W4393687055","doi":"10.5281/zenodo.1464105","title":"The Virtual Macaque Brain: A macaque connectome for large-scale network simulations in TheVirtualBrain","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital; Robarts Clinical Trials; Baycrest Hospital","funders":"","keywords":"Macaque; Connectome; Scale (ratio); Neuroscience; Computer science; Functional connectivity; Psychology; Geography; Cartography","score_opus":0.027371536649938046,"score_gpt":0.26173678393453986,"score_spread":0.2343652472846018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393687055","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011104556,0.0008707296,0.0022517378,0.0004950551,0.0001546056,0.00009723756,0.97778785,0.0054871417,0.0017510807],"genre_scores_gemma":[0.009526259,0.00024382083,0.0025108273,0.000121812845,0.000022571478,0.0002980272,0.9860042,0.000307656,0.0009648295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996979,0.000057595462,0.00002064662,0.000097518656,0.000074936834,0.000051357118],"domain_scores_gemma":[0.99914587,0.0002525505,0.000076334545,0.000251932,0.00014845573,0.00012493836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398352,0.0029213366,0.001052124,0.0024878522,0.00089556444,0.0013115773,0.0034837553,0.0024626262,0.015187031],"category_scores_gemma":[0.0031468363,0.000809698,0.0018205512,0.0025442578,0.0005404235,0.0008160737,0.002130787,0.002200154,0.013337762],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027493798,0.00016994098,0.0034750432,0.0012877473,0.000360132,0.00031619615,0.00012765736,0.009756117,0.0014699097,0.0016718507,0.970769,0.010321439],"study_design_scores_gemma":[0.0019308547,0.0002345852,0.025018971,0.000926031,0.0004518588,0.0011997407,0.00029552006,0.046863146,0.004831305,0.016961437,0.90108436,0.00020220368],"about_ca_topic_score_codex":0.030798933,"about_ca_topic_score_gemma":0.06800804,"teacher_disagreement_score":0.030798933,"about_ca_system_score_codex":0.0010675173,"about_ca_system_score_gemma":0.0013549152,"threshold_uncertainty_score":0.06123936},"labels":[],"label_agreement":null},{"id":"W4394514796","doi":"10.6084/m9.figshare.22751909","title":"Using sentinel nodes to evaluate changing connectivity in a protected area network","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Geography","score_opus":0.1562121230702764,"score_gpt":0.32592729794188713,"score_spread":0.16971517487161072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394514796","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7230138,0.0001372014,0.27334002,0.00016271298,0.000036103258,0.00008758216,0.00063170446,0.0005046503,0.002086193],"genre_scores_gemma":[0.95221525,0.0000476189,0.046804167,0.000024502107,0.0000062773715,0.000042068445,0.00035548388,0.00002390965,0.0004807461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995202,0.00019089559,0.000022640384,0.00012908994,0.00008619154,0.000051005813],"domain_scores_gemma":[0.9960808,0.0023092402,0.0007775334,0.00029883717,0.00036456942,0.00016907034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015613165,0.00039280416,0.00031282092,0.0011381063,0.00033033724,0.00051894167,0.00071613,0.00038251685,0.0008777685],"category_scores_gemma":[0.0075666634,0.00024001801,0.00032690357,0.0005898429,0.0005099173,0.0014918455,0.0006483912,0.00030510157,0.000091111695],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025167468,0.00007881758,0.081416704,0.000086334316,0.00014755651,0.00010363123,0.0002915607,0.8743203,0.0072494578,0.006788775,0.0008419163,0.028423188],"study_design_scores_gemma":[0.000008290506,0.00008165418,0.0056757703,0.000006151839,0.000019649478,0.00004586749,0.000080136655,0.9902138,0.0012336901,0.0023274664,0.00029703422,0.000010630369],"about_ca_topic_score_codex":0.010457326,"about_ca_topic_score_gemma":0.020512683,"teacher_disagreement_score":0.010457326,"about_ca_system_score_codex":0.0010238414,"about_ca_system_score_gemma":0.0004851255,"threshold_uncertainty_score":0.020792961},"labels":[],"label_agreement":null},{"id":"W4396813610","doi":"10.1093/mnras/stae1982","title":"<scp>trace</scp>: a code for time-reversible astrophysical close encounters","year":2024,"lang":"en","type":"preprint","venue":"Monthly Notices of the Royal Astronomical Society","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Yale University","keywords":"TRACE (psycholinguistics); Algorithm; Computer science; Philosophy","score_opus":0.010864409052128305,"score_gpt":0.21980853102329226,"score_spread":0.20894412197116397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396813610","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03300092,0.00019433473,0.7177952,0.00036993454,0.0002221602,0.0002456073,0.003063486,0.21877572,0.026332662],"genre_scores_gemma":[0.36933085,0.00022849189,0.5294611,0.00045387878,0.00008369691,0.0007572272,0.006552886,0.06897901,0.024152922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995977,0.0000682842,0.000032721495,0.000060707975,0.00018260542,0.000057928675],"domain_scores_gemma":[0.99885845,0.00042562143,0.00010300358,0.00025741945,0.00024953875,0.000105952975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009347662,0.0008731356,0.00055479206,0.00056358427,0.000566816,0.001055921,0.0032901964,0.0010596425,0.037763476],"category_scores_gemma":[0.0040901224,0.00058988255,0.00070920226,0.0005796211,0.0010052688,0.001935158,0.0024432044,0.0019225708,0.0066051944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010186303,0.00033899114,0.0053278455,0.0009064133,0.0002772568,0.0011067197,0.00094732025,0.3560152,0.021051947,0.10975544,0.19740154,0.3058527],"study_design_scores_gemma":[0.00018591335,0.000051116764,0.0004025157,0.000055335695,0.000012315498,0.00010307491,0.00003551177,0.9242997,0.011900974,0.013218998,0.049687598,0.00004691803],"about_ca_topic_score_codex":0.005390002,"about_ca_topic_score_gemma":0.0045732497,"teacher_disagreement_score":0.037763476,"about_ca_system_score_codex":0.0007067493,"about_ca_system_score_gemma":0.0016369995,"threshold_uncertainty_score":0.12633139},"labels":[],"label_agreement":null},{"id":"W4399069338","doi":"10.1007/s11432-023-3936-7","title":"Two-layer Lagrange-based relay network topology and trajectory design for solar system explorations","year":2024,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Relay; Topology (electrical circuits); Trajectory; Computer science; Layer (electronics); Network topology; Mathematics; Computer network; Physics; Materials science; Combinatorics; Nanotechnology","score_opus":0.05049100717536228,"score_gpt":0.2904594974816352,"score_spread":0.2399684903062729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399069338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01467663,0.00012853804,0.98302746,0.000086536274,0.000018927818,0.000031459076,0.000043113527,0.00011744624,0.001869886],"genre_scores_gemma":[0.8854754,0.00034808586,0.11123475,0.000037810514,0.00001809734,0.00012236583,0.00010650183,0.00004252022,0.002614464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997787,0.0000866812,0.000012250166,0.000043178818,0.000050489958,0.000028690447],"domain_scores_gemma":[0.9995505,0.0001750492,0.00007636342,0.000041205625,0.00012588987,0.000030925195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064651034,0.0005555721,0.0006129877,0.00049966626,0.0003565717,0.0007518586,0.0011091833,0.00054715323,0.0017746971],"category_scores_gemma":[0.0017514945,0.0003484006,0.00035913594,0.00054661947,0.0003253217,0.0012142475,0.0009272153,0.0005147252,0.00033051553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005110668,0.00001578155,0.00028575296,0.000047508544,0.000011620572,0.000044852062,0.000044608954,0.96986234,0.002804261,0.0075015645,0.00043426242,0.018896302],"study_design_scores_gemma":[0.0000026624762,0.000022957924,0.0000335482,0.0000024606975,0.0000026143975,0.000012528266,0.0000076013575,0.9983726,0.00030160774,0.0010413488,0.00019699817,0.0000029912335],"about_ca_topic_score_codex":0.0022509454,"about_ca_topic_score_gemma":0.0024831838,"teacher_disagreement_score":0.0022509454,"about_ca_system_score_codex":0.0006614928,"about_ca_system_score_gemma":0.0008185702,"threshold_uncertainty_score":0.0059369802},"labels":[],"label_agreement":null},{"id":"W4399291542","doi":"10.3390/drones8060238","title":"Analysis of Unmanned Aerial Vehicle-Assisted Cellular Vehicle-to-Everything Communication Using Markovian Game in a Federated Learning Environment","year":2024,"lang":"en","type":"article","venue":"Drones","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Markov process; Human–computer interaction; Aeronautics; Aerospace engineering; Real-time computing; Simulation; Engineering; Mathematics","score_opus":0.022798592908114635,"score_gpt":0.24681994628485704,"score_spread":0.2240213533767424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399291542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17583781,0.00044985034,0.8117515,0.0007327176,0.000069755195,0.00014059848,0.00014818653,0.000108429136,0.010761196],"genre_scores_gemma":[0.9884399,0.00019538062,0.008144483,0.000056533663,0.000016528174,0.00005628888,0.000027359385,0.00001548436,0.0030480092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867094,0.000452566,0.000029452542,0.00020578952,0.00027031617,0.00037100803],"domain_scores_gemma":[0.9961649,0.002404923,0.0006380402,0.00009743218,0.00045663735,0.00023809898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017217835,0.0011031785,0.00110941,0.00076230883,0.00076380745,0.001371978,0.0014069015,0.0012499599,0.0021444529],"category_scores_gemma":[0.004781549,0.00055939174,0.0008227551,0.00056932913,0.0016577889,0.0018095236,0.0013135631,0.0011017544,0.00014906915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042972282,0.000029687699,0.000536163,0.000029917948,0.000026338517,0.00013276219,0.000064795124,0.9695118,0.0006948808,0.026915988,0.0003312119,0.0016833533],"study_design_scores_gemma":[0.0000033856763,0.000013344779,0.00008270777,0.000002125502,0.0000045216266,0.000010956093,0.000019804575,0.9965575,0.000086371605,0.0031463061,0.00006914151,0.0000038098283],"about_ca_topic_score_codex":0.015505395,"about_ca_topic_score_gemma":0.008412473,"teacher_disagreement_score":0.015505395,"about_ca_system_score_codex":0.0030331048,"about_ca_system_score_gemma":0.002251919,"threshold_uncertainty_score":0.030830324},"labels":[],"label_agreement":null},{"id":"W4399477586","doi":"10.1145/3626232.3653253","title":"CCSM: Building Cross-Cluster Security Models for Edge-Core Environments Involving Multiple Kubernetes Clusters","year":2024,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"Universitas Brawijaya","keywords":"Cluster (spacecraft); Computer science; Core (optical fiber); Enhanced Data Rates for GSM Evolution; Computer network; Artificial intelligence; Telecommunications","score_opus":0.03781211360132044,"score_gpt":0.28004976090033656,"score_spread":0.24223764729901612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399477586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06670778,0.00014982092,0.9252252,0.0004725253,0.00008235442,0.00027072,0.0004914508,0.002237495,0.004362712],"genre_scores_gemma":[0.64144605,0.0001923992,0.35277224,0.00018512645,0.000037478705,0.00035547043,0.0010290763,0.00030717417,0.0036749984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989089,0.00032132017,0.00006739169,0.0002524044,0.00027651968,0.0001734846],"domain_scores_gemma":[0.9974088,0.0011136914,0.00024785177,0.00049473724,0.00056953705,0.00016531222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033908,0.001172278,0.0005389428,0.0009364702,0.0012386681,0.0017593907,0.0022246714,0.0010665227,0.0025946097],"category_scores_gemma":[0.005232943,0.0007736517,0.0017388362,0.00056273723,0.00090320583,0.0025024144,0.0022414352,0.0016270161,0.0005486097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007233926,0.000051286872,0.0024636195,0.000037991053,0.000044275803,0.00009272551,0.00009938626,0.9731083,0.0010461265,0.01090498,0.0012306619,0.010848416],"study_design_scores_gemma":[0.0000033792337,0.0000085220245,0.000100983125,0.0000032745938,0.000005098828,0.00000966974,0.000019661265,0.99632627,0.0003040062,0.0026961057,0.0005196783,0.0000034031752],"about_ca_topic_score_codex":0.024607513,"about_ca_topic_score_gemma":0.029674342,"teacher_disagreement_score":0.024607513,"about_ca_system_score_codex":0.0022549133,"about_ca_system_score_gemma":0.0035300679,"threshold_uncertainty_score":0.04892856},"labels":[],"label_agreement":null},{"id":"W4399526294","doi":"10.1109/tmc.2024.3412751","title":"Bridge the Present and Future: A Cross-Layer Matching Game in Dynamic Cloud-Aided 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":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Aeronautical Science Foundation of China; National Natural Science Foundation of China; Natural Science Foundation of Xiamen City","keywords":"Computer science; Cloud computing; Bridge (graph theory); Enhanced Data Rates for GSM Evolution; Matching (statistics); Layer (electronics); Mobile telephony; Distributed computing; Computer network; Telecommunications; Mobile radio; Operating system","score_opus":0.015787920957551466,"score_gpt":0.2856436364600143,"score_spread":0.2698557155024628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399526294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28780198,0.000528582,0.5172411,0.014933338,0.0005272448,0.0009659755,0.00053966,0.0014384727,0.1760237],"genre_scores_gemma":[0.9029099,0.00024122086,0.076948024,0.0011044946,0.00005838709,0.000219694,0.00024561892,0.00013537846,0.018137446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982343,0.00083692063,0.0000743228,0.00024703136,0.00022582844,0.00038157153],"domain_scores_gemma":[0.99628097,0.0017259335,0.00024281544,0.0003162112,0.00021055892,0.0012235574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003846092,0.00078275596,0.00072025985,0.0005084717,0.0028396402,0.0039854166,0.0023420292,0.0044591795,0.014172186],"category_scores_gemma":[0.008262368,0.0004403405,0.00080316275,0.000486801,0.001478418,0.009320323,0.0053462246,0.0026608051,0.0015055392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003153776,0.0009982196,0.005652614,0.00034174416,0.00022505515,0.002283954,0.003216462,0.16423143,0.0124225635,0.6363035,0.038094882,0.1330759],"study_design_scores_gemma":[0.00018366949,0.00043882176,0.0007705587,0.000072678624,0.00006886338,0.00036382757,0.001983797,0.68696135,0.002513895,0.27779505,0.028775433,0.00007198784],"about_ca_topic_score_codex":0.0036846166,"about_ca_topic_score_gemma":0.004041836,"teacher_disagreement_score":0.014172186,"about_ca_system_score_codex":0.0016762089,"about_ca_system_score_gemma":0.0019950336,"threshold_uncertainty_score":0.047410727},"labels":[],"label_agreement":null},{"id":"W4399911340","doi":"10.1140/epjqt/s40507-025-00305-w","title":"A reconfigurable entanglement distribution network suitable for connecting multiple ground nodes with a satellite","year":2025,"lang":"en","type":"preprint","venue":"EPJ Quantum Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; National Research Council Canada; University of Waterloo","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada; Canada Excellence Research Chairs, Government of Canada","keywords":"Quantum entanglement; Satellite; Computer science; Distribution (mathematics); Computer network; Telecommunications; Physics; Aerospace engineering; Engineering; Mathematics; Quantum mechanics","score_opus":0.02445769258068441,"score_gpt":0.2570194107843137,"score_spread":0.23256171820362925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399911340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715856,0.00017111146,0.112070024,0.00025020554,0.00007293468,0.000052490617,0.00012679838,0.00027796306,0.015392917],"genre_scores_gemma":[0.99030966,0.000049476224,0.008174442,0.000014373665,0.000004287222,0.000021093794,0.000028242934,0.000008739829,0.001389757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994135,0.000016518023,0.000001465155,0.000011920905,0.000010719596,0.000018109555],"domain_scores_gemma":[0.99984014,0.000058999387,0.00003213102,0.000031785014,0.000013528601,0.00002331299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014575441,0.00012844433,0.00014110398,0.000222904,0.00039622298,0.0004897434,0.00042666195,0.00038284206,0.0027258964],"category_scores_gemma":[0.0003751488,0.00011617696,0.00016787366,0.00027520696,0.0005350199,0.0005996639,0.0004931761,0.000304905,0.00015569526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003802782,0.00016500338,0.0018757369,0.00008689945,0.00003721969,0.0004968528,0.00011574008,0.8249569,0.06841807,0.08520739,0.0012301336,0.01702982],"study_design_scores_gemma":[0.00007186281,0.00028099952,0.0010908915,0.000009218022,0.000020042933,0.00013720877,0.00008179666,0.9778266,0.007761906,0.009979885,0.0027210822,0.000018586692],"about_ca_topic_score_codex":0.00090393896,"about_ca_topic_score_gemma":0.0010073498,"teacher_disagreement_score":0.0027258964,"about_ca_system_score_codex":0.0005362194,"about_ca_system_score_gemma":0.00025395537,"threshold_uncertainty_score":0.009119034},"labels":[],"label_agreement":null},{"id":"W4400031672","doi":"10.1016/j.dam.2024.06.008","title":"On cop-win dynamic graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Indifference graph; Graph; Discrete mathematics","score_opus":0.010982075287346188,"score_gpt":0.24721741445034295,"score_spread":0.23623533916299677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400031672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17691912,0.0006298776,0.7734595,0.0010884992,0.0002484894,0.0003417043,0.0008226191,0.00080391695,0.045686282],"genre_scores_gemma":[0.8245184,0.0013109422,0.13917477,0.0006719841,0.00027442691,0.00030801605,0.0018669431,0.00056175404,0.031312812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986524,0.00017270539,0.00006530653,0.00048126891,0.00026996233,0.00035833882],"domain_scores_gemma":[0.996912,0.0012122653,0.00047787966,0.00052172656,0.0005268958,0.0003491524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005318953,0.00088429154,0.00088049384,0.00233179,0.0019456466,0.0029531212,0.0015515743,0.0012395451,0.008642568],"category_scores_gemma":[0.005789074,0.0006470078,0.0007545541,0.002317847,0.0022875553,0.0067379903,0.0029958782,0.0021351248,0.001625087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014268125,0.00006538906,0.0019393752,0.00021159563,0.0000377217,0.0007988936,0.00075480825,0.037391637,0.0048940107,0.8826931,0.006751751,0.06431911],"study_design_scores_gemma":[0.00002008524,0.000038531878,0.0007450565,0.000058587473,0.000025981055,0.0006879569,0.0004646241,0.09884005,0.0029957977,0.874741,0.021344654,0.000037655587],"about_ca_topic_score_codex":0.0044130036,"about_ca_topic_score_gemma":0.0035926192,"teacher_disagreement_score":0.008642568,"about_ca_system_score_codex":0.0013990792,"about_ca_system_score_gemma":0.0007969539,"threshold_uncertainty_score":0.028912246},"labels":[],"label_agreement":null},{"id":"W4400908911","doi":"10.1109/siu61531.2024.10600775","title":"Multi-Tier Non-Terrestrial Networking for Disaster Communications: A Layered Clustering Approach","year":2024,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cluster analysis; Computer network; Artificial intelligence","score_opus":0.09837559756573337,"score_gpt":0.3164515869597405,"score_spread":0.21807598939400713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400908911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030149592,0.0005268681,0.96595263,0.00020669219,0.000028066406,0.00007154769,0.0000389471,0.00023264662,0.002793095],"genre_scores_gemma":[0.63430065,0.000813438,0.3593849,0.00012528681,0.000040599334,0.00012733068,0.00014701308,0.00007303728,0.00498775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996631,0.00012056638,0.000016779522,0.000060113114,0.000072577706,0.00006685267],"domain_scores_gemma":[0.9995896,0.00010632155,0.00007086041,0.00006591797,0.00011959321,0.000047663892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057710905,0.00050643896,0.00038300816,0.0006796301,0.00073789636,0.00082723727,0.0013617423,0.00050704565,0.0008150448],"category_scores_gemma":[0.0008968171,0.00027487025,0.0005840554,0.0006765308,0.00031181928,0.0010124303,0.000854333,0.00036703105,0.00024849508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059170772,0.0000920542,0.0027413843,0.000095145115,0.000111191264,0.00016000688,0.00024501662,0.87622553,0.018029837,0.023604585,0.0017396425,0.07689649],"study_design_scores_gemma":[0.0000017686683,0.000027917813,0.00038696997,0.0000046954497,0.000012619561,0.000045950226,0.00005385966,0.9946296,0.0010857687,0.0029196911,0.0008185665,0.000012577197],"about_ca_topic_score_codex":0.007007753,"about_ca_topic_score_gemma":0.01044582,"teacher_disagreement_score":0.007007753,"about_ca_system_score_codex":0.0010936976,"about_ca_system_score_gemma":0.0008295327,"threshold_uncertainty_score":0.013933897},"labels":[],"label_agreement":null},{"id":"W4401121038","doi":"10.1093/mnras/stae1837","title":"Adapting <scp>arepo-rt</scp> for exascale computing: GPU acceleration and efficient communication","year":2024,"lang":"en","type":"article","venue":"Monthly Notices of the Royal Astronomical Society","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Aeronautics and Space Administration; National Science Foundation","keywords":"Exascale computing; Petascale computing; Scalability; Speedup; Porting; Computer science; Parallel computing; Supercomputer; Physics; Context (archaeology); Node (physics); Computational science; Software; Operating system","score_opus":0.01759796181269018,"score_gpt":0.22965263157333712,"score_spread":0.21205466976064694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401121038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15540966,0.0005460009,0.6403107,0.0031859358,0.0017510462,0.00065818394,0.002314215,0.104234606,0.09158969],"genre_scores_gemma":[0.5352624,0.00038760185,0.42148468,0.0013563727,0.0002877063,0.0008214877,0.0066634836,0.013881273,0.019855011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924433,0.00016979374,0.0000433877,0.000089363224,0.0003089782,0.00014417521],"domain_scores_gemma":[0.9981589,0.0002921358,0.00012579389,0.00065701664,0.00060014793,0.00016596226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009496599,0.0010025955,0.00045550714,0.00035680033,0.00053614477,0.0014238803,0.003355049,0.0010116103,0.008024688],"category_scores_gemma":[0.0029693055,0.00040074153,0.0006128498,0.0006504026,0.0008133251,0.001563945,0.0019229904,0.002398833,0.003568686],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011921306,0.0010913931,0.009011621,0.0007502214,0.00030616854,0.0008912457,0.00048772656,0.39570543,0.111271925,0.06319747,0.2629817,0.15311298],"study_design_scores_gemma":[0.00018035642,0.00008820991,0.000903914,0.000032442196,0.000015023132,0.00006154428,0.000033994915,0.9157313,0.030628094,0.006686053,0.045596946,0.000042064275],"about_ca_topic_score_codex":0.0049711363,"about_ca_topic_score_gemma":0.0052776677,"teacher_disagreement_score":0.008024688,"about_ca_system_score_codex":0.00076600874,"about_ca_system_score_gemma":0.001524234,"threshold_uncertainty_score":0.026845276},"labels":[],"label_agreement":null},{"id":"W4401509030","doi":"10.1109/iccworkshops59551.2024.10615288","title":"Federated Learning Empowered Routing for Opportunistic Network Environments","year":2024,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network; Policy-based routing; Distributed computing; Routing protocol; Static routing","score_opus":0.02654833678105408,"score_gpt":0.256534357327697,"score_spread":0.22998602054664294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401509030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05078519,0.00017358422,0.945307,0.00015874072,0.00004950312,0.000047265137,0.000028442926,0.0005643439,0.002886027],"genre_scores_gemma":[0.9119181,0.00015379438,0.08590619,0.00009782593,0.000016636426,0.00006672891,0.00005163428,0.000029086501,0.0017600482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996592,0.00010538664,0.000017470518,0.000060507722,0.00008501587,0.000072395065],"domain_scores_gemma":[0.99897337,0.00052220863,0.00011847757,0.00018802658,0.00012635998,0.00007151271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009806126,0.00035540172,0.0004439819,0.00032046717,0.0005763785,0.00081599515,0.00097026856,0.00075244525,0.00076089206],"category_scores_gemma":[0.0022819324,0.0001431131,0.00027284957,0.0003188827,0.00069889915,0.001428624,0.0015550836,0.00082432386,0.00011510798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007062391,0.00008175908,0.00088232127,0.0000477458,0.000025658175,0.00014455584,0.00009616922,0.90474904,0.0035132132,0.03293471,0.0008480601,0.056606047],"study_design_scores_gemma":[0.0000048369716,0.000039028495,0.00008544239,0.0000033441966,0.0000045154816,0.000036984755,0.000019684067,0.9852629,0.0010666506,0.012471433,0.0010000723,0.0000050997382],"about_ca_topic_score_codex":0.0015882198,"about_ca_topic_score_gemma":0.0018895593,"teacher_disagreement_score":0.0015882198,"about_ca_system_score_codex":0.0005789141,"about_ca_system_score_gemma":0.0009216273,"threshold_uncertainty_score":0.005186081},"labels":[],"label_agreement":null},{"id":"W4402157106","doi":"10.1109/icc51166.2024.10622386","title":"On the Interplay Between Network Metrics and Performance of Mobile Edge Offloading","year":2024,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Ministère de la Défense Nationale; Innovation for Defence Excellence and Security","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Computer network; Cellular network; Mobile edge computing; Distributed computing; Server; Artificial intelligence","score_opus":0.02081403042680259,"score_gpt":0.2634370539922633,"score_spread":0.24262302356546073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402157106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8946818,0.0015327495,0.08946393,0.00058777287,0.00008133996,0.000060384158,0.00026124882,0.0003841083,0.012946705],"genre_scores_gemma":[0.9958832,0.00017120724,0.0035318097,0.000018727083,0.0000059810727,0.000007740799,0.000046987483,0.000018272016,0.00031614798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964213,0.0001075413,0.00001525353,0.00006109441,0.000087457396,0.00008646668],"domain_scores_gemma":[0.9977456,0.001608384,0.00020474709,0.00009447148,0.00027795986,0.000068897665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007366507,0.00070861075,0.00028232165,0.00071905483,0.0003170847,0.0007420495,0.00031075653,0.00037999864,0.0008263107],"category_scores_gemma":[0.004229189,0.00011639551,0.00012938643,0.00069541234,0.00033677617,0.0008229629,0.00032663252,0.00033918794,0.00012423283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016718626,0.00006817024,0.0058867666,0.000077150034,0.000028706094,0.0001119075,0.000037631242,0.95841795,0.008802505,0.0022810446,0.0005560747,0.023564823],"study_design_scores_gemma":[0.000004189213,0.00013618114,0.0036984705,0.0000132048,0.000017488846,0.000057272675,0.00006475402,0.9895191,0.0047897426,0.0013318906,0.00035619995,0.000011443899],"about_ca_topic_score_codex":0.006097868,"about_ca_topic_score_gemma":0.0079333875,"teacher_disagreement_score":0.006097868,"about_ca_system_score_codex":0.00072052144,"about_ca_system_score_gemma":0.00047494823,"threshold_uncertainty_score":0.012124717},"labels":[],"label_agreement":null},{"id":"W4402187506","doi":"10.32920/26871397.v1","title":"Efficient Geocast Routing Protocols for Opportunistic Networks","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Geocast; Computer network; Computer science; Routing (electronic design automation); Routing protocol; Link-state routing protocol","score_opus":0.060252128957500733,"score_gpt":0.3151469626803658,"score_spread":0.25489483372286503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402187506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040019643,0.00089688523,0.9505019,0.0003328685,0.00015847581,0.00021753839,0.00013762433,0.00047877053,0.0072562746],"genre_scores_gemma":[0.80443,0.0012709292,0.1873343,0.00019690768,0.00008545816,0.00029829703,0.00035255862,0.00004880547,0.005982783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997048,0.000054936034,0.000018025607,0.000035306763,0.00015218327,0.000034769033],"domain_scores_gemma":[0.9994253,0.00024084824,0.000096578515,0.00010766634,0.00010629029,0.000023348786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006118448,0.00032137526,0.00031460257,0.00043173396,0.00043198964,0.0006694851,0.00082578656,0.00040845212,0.0009063369],"category_scores_gemma":[0.0015838651,0.000150415,0.00024411548,0.00044007087,0.00047302555,0.0010171604,0.0008287276,0.0005552124,0.00014965364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002330814,0.00010031635,0.00077606377,0.00022137663,0.000056952525,0.00023128805,0.00023183085,0.6120613,0.026959443,0.18233989,0.0067923935,0.16999607],"study_design_scores_gemma":[0.000036991805,0.00008177295,0.0002629495,0.000020676129,0.000019283249,0.00011128144,0.00007476428,0.94038916,0.006373524,0.03812561,0.014488191,0.00001588048],"about_ca_topic_score_codex":0.0023421317,"about_ca_topic_score_gemma":0.0035053235,"teacher_disagreement_score":0.0023421317,"about_ca_system_score_codex":0.00085069373,"about_ca_system_score_gemma":0.0009321443,"threshold_uncertainty_score":0.00617224},"labels":[],"label_agreement":null},{"id":"W4402189324","doi":"10.32920/26871397","title":"Efficient Geocast Routing Protocols for Opportunistic Networks","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Geocast; Computer network; Computer science; Routing (electronic design automation); Routing protocol; Link-state routing protocol","score_opus":0.060252128957500733,"score_gpt":0.3151469626803658,"score_spread":0.25489483372286503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402189324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040019643,0.00089688523,0.9505019,0.0003328685,0.00015847581,0.00021753839,0.00013762433,0.00047877053,0.0072562746],"genre_scores_gemma":[0.80443,0.0012709292,0.1873343,0.00019690768,0.00008545816,0.00029829703,0.00035255862,0.00004880547,0.005982783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997048,0.000054936034,0.000018025607,0.000035306763,0.00015218327,0.000034769033],"domain_scores_gemma":[0.9994253,0.00024084824,0.000096578515,0.00010766634,0.00010629029,0.000023348786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006118448,0.00032137526,0.00031460257,0.00043173396,0.00043198964,0.0006694851,0.00082578656,0.00040845212,0.0009063369],"category_scores_gemma":[0.0015838651,0.000150415,0.00024411548,0.00044007087,0.00047302555,0.0010171604,0.0008287276,0.0005552124,0.00014965364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002330814,0.00010031635,0.00077606377,0.00022137663,0.000056952525,0.00023128805,0.00023183085,0.6120613,0.026959443,0.18233989,0.0067923935,0.16999607],"study_design_scores_gemma":[0.000036991805,0.00008177295,0.0002629495,0.000020676129,0.000019283249,0.00011128144,0.00007476428,0.94038916,0.006373524,0.03812561,0.014488191,0.00001588048],"about_ca_topic_score_codex":0.0023421317,"about_ca_topic_score_gemma":0.0035053235,"teacher_disagreement_score":0.0023421317,"about_ca_system_score_codex":0.00085069373,"about_ca_system_score_gemma":0.0009321443,"threshold_uncertainty_score":0.00617224},"labels":[],"label_agreement":null},{"id":"W4402475412","doi":"10.1109/ccece59415.2024.10667328","title":"Extreme Edge Computing Challenges on the Edge-Cloud Continuum","year":2024,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar University","keywords":"Cloud computing; Enhanced Data Rates for GSM Evolution; Computer science; Edge computing; Operating system; Artificial intelligence","score_opus":0.08566203151675922,"score_gpt":0.2571651919094352,"score_spread":0.171503160392676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475412","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17732665,0.021179354,0.45720217,0.10983607,0.003081015,0.00013370128,0.0004981126,0.000908515,0.22983442],"genre_scores_gemma":[0.9548902,0.0053491937,0.028087072,0.0031787292,0.0007915415,0.00006077058,0.00007125545,0.00008805101,0.0074832193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988594,0.00030366215,0.000029190607,0.00015436708,0.00038909417,0.00026430824],"domain_scores_gemma":[0.9977458,0.001300988,0.00010315008,0.00028171614,0.00027551714,0.0002928569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014676313,0.00026986946,0.0005273329,0.0003535375,0.0016839787,0.0035032055,0.0012360469,0.0017047874,0.0032237037],"category_scores_gemma":[0.0032067178,0.00021066541,0.00027277807,0.00055066467,0.0024952355,0.0065565086,0.0035463837,0.004018896,0.0006124913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010308012,0.000054655087,0.0008122282,0.00014576789,0.000015146427,0.00041049838,0.0003887913,0.029103257,0.0025309592,0.9072584,0.018792931,0.04038424],"study_design_scores_gemma":[0.000019141065,0.00004885913,0.0006814103,0.00012654423,0.000009374648,0.00064972154,0.0012817302,0.1448654,0.0016598881,0.7731852,0.077434376,0.000038348142],"about_ca_topic_score_codex":0.0011871204,"about_ca_topic_score_gemma":0.0015578668,"teacher_disagreement_score":0.0035032055,"about_ca_system_score_codex":0.0012397239,"about_ca_system_score_gemma":0.0008833905,"threshold_uncertainty_score":0.010784388},"labels":[],"label_agreement":null},{"id":"W4403192778","doi":"10.1016/j.polgeo.2024.103210","title":"Crypto/Space: Computational parasitism, virtual land grabs, and the production of Web3 Exit zones","year":2024,"lang":"en","type":"article","venue":"Political Geography","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Northumbria University","keywords":"Production (economics); Space (punctuation); Parasitism; Economic geography; Geography; International trade; Business; Computer science; Economics; Ecology; Biology; Microeconomics; Operating system; Host (biology)","score_opus":0.00954069084042232,"score_gpt":0.24134963859481717,"score_spread":0.23180894775439487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403192778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59363484,0.0011441774,0.07684068,0.007609478,0.00009010318,0.000067604364,0.00006996501,0.00017906891,0.3203641],"genre_scores_gemma":[0.9902172,0.00017056435,0.002667041,0.00011081764,0.000008576886,0.000018844703,0.000013686467,0.000035650704,0.006757567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9985656,0.00081953953,0.000033005435,0.00013619098,0.00021431246,0.000231492],"domain_scores_gemma":[0.9966196,0.0015479504,0.0006699667,0.0005876399,0.00018829045,0.00038653432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018140734,0.0002794991,0.00018692865,0.0010270625,0.0039841826,0.0074253846,0.00069284404,0.0012579281,0.0076853083],"category_scores_gemma":[0.0053604324,0.00025658897,0.00022765725,0.0010299545,0.019837137,0.007976207,0.0067846156,0.001370627,0.0006531893],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040086004,0.000015438196,0.0036319194,0.000039084585,0.0000048145857,0.0006064261,0.016386064,0.0011478099,0.0006624629,0.9638307,0.000989819,0.012645425],"study_design_scores_gemma":[0.000041235515,0.00009428521,0.0058305827,0.00028009067,0.000020408894,0.0016613206,0.0461852,0.00972697,0.00311652,0.73502696,0.19796045,0.000056030363],"about_ca_topic_score_codex":0.002451494,"about_ca_topic_score_gemma":0.003418291,"teacher_disagreement_score":0.0076853083,"about_ca_system_score_codex":0.0023477403,"about_ca_system_score_gemma":0.0012724919,"threshold_uncertainty_score":0.025709927},"labels":[],"label_agreement":null},{"id":"W4403407849","doi":"10.1109/icc51166.2024.10622909","title":"SocialNetView: Optimization of Wireless Communication for Social Media Interaction","year":2024,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless; Social media; Human–computer interaction; Telecommunications; World Wide Web","score_opus":0.046023991445067004,"score_gpt":0.30264822397597785,"score_spread":0.2566242325309108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403407849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07137304,0.0006299405,0.91715664,0.00018088712,0.00009438186,0.00023101705,0.00017084711,0.0026600705,0.007503116],"genre_scores_gemma":[0.8542028,0.00026474497,0.14066637,0.000081863036,0.000040306713,0.00031916602,0.0002094371,0.00026065193,0.003954676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994999,0.00017077725,0.000020741987,0.00008298259,0.00014907763,0.00007647412],"domain_scores_gemma":[0.99943334,0.0002977139,0.000067744375,0.00005012733,0.00010803398,0.000042912667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005925713,0.0013481253,0.00064779946,0.00075362285,0.000394798,0.0005801166,0.00079975656,0.0005577857,0.0029987837],"category_scores_gemma":[0.0016837262,0.0002680069,0.00041050932,0.0005384717,0.0002979093,0.0007734402,0.00069183484,0.00039975863,0.0005842614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033599394,0.00046552057,0.00462682,0.00023445635,0.00014322226,0.00017591372,0.0001296932,0.6819307,0.025818119,0.0038345011,0.0056539774,0.27665097],"study_design_scores_gemma":[0.000022214914,0.00014627317,0.0007105861,0.00000614144,0.0000230166,0.00005822475,0.000030605017,0.9934221,0.0027872648,0.0006243605,0.002158147,0.000011148096],"about_ca_topic_score_codex":0.0038313293,"about_ca_topic_score_gemma":0.006013298,"teacher_disagreement_score":0.0038313293,"about_ca_system_score_codex":0.0005566152,"about_ca_system_score_gemma":0.00059017696,"threshold_uncertainty_score":0.010031879},"labels":[],"label_agreement":null},{"id":"W4403599845","doi":"10.1109/tvt.2024.3481300","title":"Connectivity Analysis for V2I Communications in Cognitive Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Cognitive radio; Cognition; Computer science; Computer network; Telecommunications; Wireless; Psychology; Neuroscience","score_opus":0.03266512983851454,"score_gpt":0.29430016428247985,"score_spread":0.2616350344439653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403599845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20794404,0.002798228,0.76732945,0.0006772513,0.0000705194,0.000113278205,0.00032508574,0.00022423931,0.020517964],"genre_scores_gemma":[0.98959816,0.0010448919,0.007703547,0.000053831063,0.00004566623,0.000058868794,0.00015665966,0.000025470395,0.0013128641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952364,0.00012275463,0.000018495497,0.0000754026,0.00014652709,0.00011324237],"domain_scores_gemma":[0.9982034,0.0011691616,0.00020114379,0.00006006107,0.00030986144,0.00005645256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061789487,0.0005344246,0.00040559735,0.0018676425,0.00067213306,0.0008146627,0.00095713703,0.0006229129,0.0015329665],"category_scores_gemma":[0.004717897,0.0002209737,0.000537502,0.0013592344,0.0007475698,0.0011485147,0.0007078933,0.0005009883,0.00018623305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057988913,0.00002021393,0.002757292,0.00008408868,0.000027878365,0.00031183605,0.00015211094,0.920042,0.002327759,0.058132716,0.0011422168,0.014943884],"study_design_scores_gemma":[0.0000015748217,0.000021009339,0.0008555901,0.000010288674,0.000009537044,0.00014982694,0.00006151442,0.9898662,0.00030028855,0.008174682,0.0005420062,0.0000075341127],"about_ca_topic_score_codex":0.008115116,"about_ca_topic_score_gemma":0.005110865,"teacher_disagreement_score":0.008115116,"about_ca_system_score_codex":0.0014774392,"about_ca_system_score_gemma":0.00069688587,"threshold_uncertainty_score":0.016135752},"labels":[],"label_agreement":null},{"id":"W4404645681","doi":"10.1186/s13638-024-02417-w","title":"Advanced security framework for low Earth orbit satellites in space information network","year":2024,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deanship of Scientific Research, Princess Nourah Bint Abdulrahman University; Princess Nourah Bint Abdulrahman University","keywords":"Computer science; Low earth orbit; Orbit (dynamics); Space (punctuation); Medium Earth orbit; Geocentric orbit; Earth's orbit; Earth (classical element); Computer security; Astrobiology; Satellite; Astronomy; Aerospace engineering; Spacecraft; Physics; Operating system","score_opus":0.02252281261499204,"score_gpt":0.2811193895422874,"score_spread":0.2585965769272953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404645681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020439096,0.0009398886,0.96506274,0.00092886906,0.00014578612,0.00019227312,0.000106287254,0.00042462247,0.011760453],"genre_scores_gemma":[0.7806676,0.0011556396,0.21064383,0.00026696292,0.00015002565,0.0003981258,0.0002280782,0.000043104905,0.006446633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989794,0.00032154456,0.000048155274,0.00013875194,0.000359703,0.00015253256],"domain_scores_gemma":[0.9992099,0.00025904083,0.00010377857,0.00012040006,0.00021935253,0.00008746477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018051699,0.00046778042,0.00029322715,0.0006703569,0.0007837315,0.0014130312,0.0008380214,0.0008472924,0.002153077],"category_scores_gemma":[0.0017175424,0.0001873053,0.000567943,0.00029980007,0.00088713184,0.001423679,0.0013792595,0.0009736189,0.00039688114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006678296,0.000075085176,0.00095327187,0.00009968157,0.000026061656,0.0003896319,0.00025403412,0.22664267,0.007113286,0.73106384,0.0035688933,0.029746678],"study_design_scores_gemma":[0.000014040058,0.00006652061,0.0002217635,0.000026915232,0.000013211532,0.00012033936,0.000050664836,0.9329024,0.001172365,0.05533496,0.0100627085,0.000014175135],"about_ca_topic_score_codex":0.006413547,"about_ca_topic_score_gemma":0.0051170876,"teacher_disagreement_score":0.006413547,"about_ca_system_score_codex":0.0014687596,"about_ca_system_score_gemma":0.002842999,"threshold_uncertainty_score":0.012752414},"labels":[],"label_agreement":null},{"id":"W4405002387","doi":"10.3390/s24237650","title":"Context-Aware Trust and Reputation Routing Protocol for Opportunistic IoT Networks","year":2024,"lang":"en","type":"article","venue":"Sensors","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Reputation; Routing protocol; Network packet; Latency (audio); Context (archaeology); Reputation system; Low latency (capital markets); Routing (electronic design automation); Protocol (science); Packet loss; Computer security; Distributed computing; Telecommunications","score_opus":0.04170181233166667,"score_gpt":0.30947528337528846,"score_spread":0.2677734710436218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405002387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073660456,0.0010701631,0.9190435,0.0004192534,0.00016088002,0.00017837131,0.00010516083,0.00091491005,0.0044473135],"genre_scores_gemma":[0.94693327,0.00035240458,0.051173214,0.000088879475,0.000036834936,0.00009812078,0.00011237561,0.000024165602,0.0011807531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.00014170226,0.00005347479,0.000097687174,0.00017194149,0.00008088849],"domain_scores_gemma":[0.9990355,0.00030219942,0.00022820063,0.00015150596,0.00019259004,0.000090093294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008119282,0.00045164893,0.0006035411,0.00049350667,0.0006897023,0.0007022748,0.00093793776,0.00043551723,0.00030232331],"category_scores_gemma":[0.002402119,0.00021049194,0.0003389967,0.00052537397,0.0003966994,0.0014262749,0.0014041328,0.0006694532,0.00010323621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072909,0.00030010112,0.0075940755,0.0004453702,0.00030552244,0.0020409788,0.0013257944,0.46325958,0.08353156,0.115522586,0.010918627,0.31402677],"study_design_scores_gemma":[0.000037127575,0.00016394598,0.00093498774,0.000018400458,0.00006512539,0.0005756135,0.000118476724,0.9705119,0.0069429334,0.014418939,0.006153178,0.00005934294],"about_ca_topic_score_codex":0.0023115857,"about_ca_topic_score_gemma":0.0029805552,"teacher_disagreement_score":0.0023115857,"about_ca_system_score_codex":0.00065500836,"about_ca_system_score_gemma":0.0010665664,"threshold_uncertainty_score":0.004752457},"labels":[],"label_agreement":null},{"id":"W4405093675","doi":"10.3138/cjc-2024-0012","title":"<b>The Private is Political: Networked Privacy and Social Media</b>. <i>By Alice E. Marwick</i>","year":2024,"lang":"en","type":"article","venue":"Canadian Journal of Communication","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Big data; Philosophy; Computer science; Operating system","score_opus":0.020020408133112802,"score_gpt":0.2419647829300504,"score_spread":0.22194437479693757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405093675","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007244602,0.06074755,0.0025996894,0.7630682,0.026840784,0.000022007565,0.000116157295,0.00014092037,0.14574018],"genre_scores_gemma":[0.050282907,0.11037467,0.003572512,0.2626483,0.033140402,0.0001067853,0.0001921299,0.0004936099,0.5391887],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988661,0.00047555935,0.000026164746,0.00013961631,0.00038027627,0.00011220723],"domain_scores_gemma":[0.99735296,0.0016275314,0.00013655866,0.00010364796,0.000377375,0.00040191304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013652386,0.0006414577,0.000375149,0.0007168777,0.0045135473,0.007095471,0.0006727159,0.00554396,0.020263148],"category_scores_gemma":[0.0046657226,0.00034331178,0.00032946287,0.000930813,0.0039564446,0.0076241246,0.0022303383,0.0062192935,0.007045581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008120452,0.0000033834845,0.00007508869,0.000052319967,0.000003087333,0.000038661743,0.00036587002,0.00004292181,0.00010538298,0.04301556,0.9440175,0.01227207],"study_design_scores_gemma":[0.0000014738952,0.0000041278417,0.00011410601,0.0001362205,0.0000020201396,0.00009153151,0.0005423818,0.00014275771,0.000113615846,0.01681555,0.9820274,0.000008776008],"about_ca_topic_score_codex":0.014291644,"about_ca_topic_score_gemma":0.0444178,"teacher_disagreement_score":0.020263148,"about_ca_system_score_codex":0.002904664,"about_ca_system_score_gemma":0.0021285242,"threshold_uncertainty_score":0.06778693},"labels":[],"label_agreement":null},{"id":"W4405601265","doi":"10.1109/smc-it61443.2024.00024","title":"On the Role of Delay Tolerant Networks and Contact Graph Routing in Direct-to-Satellite IoT","year":2024,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"H2020 Marie Skłodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Computer network; Satellite; Internet of Things; Routing (electronic design automation); Routing protocol; Distributed computing; Computer security; Engineering","score_opus":0.009685438729725599,"score_gpt":0.21643469070191973,"score_spread":0.20674925197219413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405601265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25631505,0.0020722023,0.7128637,0.0013108279,0.00017863371,0.00011983296,0.000114061804,0.00040446076,0.02662126],"genre_scores_gemma":[0.95759743,0.0014427035,0.038803473,0.00009592242,0.00004718858,0.000026588625,0.000054263037,0.000030689833,0.0019017834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978083,0.00009514088,0.0000061724036,0.00002682515,0.000068632966,0.000022338203],"domain_scores_gemma":[0.9990866,0.0006679217,0.00006456667,0.000067165296,0.000072360985,0.000041287574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061865855,0.00030173102,0.00019362979,0.0002826532,0.00026018074,0.00074767024,0.000573493,0.00033114443,0.0007886194],"category_scores_gemma":[0.0024520538,0.00014525368,0.00018833556,0.0003569902,0.00057432696,0.0011288373,0.0004758865,0.00037188642,0.00007872302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055861186,0.000030778952,0.0011196482,0.0000531181,0.000016462849,0.00006658259,0.000048121106,0.9411922,0.0018465777,0.03335499,0.0004446822,0.021770975],"study_design_scores_gemma":[0.0000052016453,0.00006683598,0.00020487259,0.000007692021,0.000008382098,0.000031756914,0.000039455193,0.9876815,0.0009714553,0.009318853,0.0016586912,0.0000053002236],"about_ca_topic_score_codex":0.004674174,"about_ca_topic_score_gemma":0.004326148,"teacher_disagreement_score":0.004674174,"about_ca_system_score_codex":0.0006857354,"about_ca_system_score_gemma":0.00055826065,"threshold_uncertainty_score":0.009293914},"labels":[],"label_agreement":null},{"id":"W4405754909","doi":"10.1109/tcc.2024.3521657","title":"Understanding Serverless Inference in Mobile-Edge Networks: A Benchmark Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Inference; Benchmark (surveying); Enhanced Data Rates for GSM Evolution; Mobile edge computing; Distributed computing; Artificial intelligence","score_opus":0.07639356632476259,"score_gpt":0.281413566683511,"score_spread":0.2050200003587484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405754909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78041536,0.0023837395,0.19616225,0.0020509695,0.00034670305,0.00027771934,0.0030449857,0.0030341588,0.012284137],"genre_scores_gemma":[0.9515258,0.0005191026,0.044830408,0.00020336958,0.000053522297,0.00011536465,0.001715823,0.00018162029,0.000854998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987835,0.00036848336,0.00006651478,0.00026775157,0.00025363537,0.0002601342],"domain_scores_gemma":[0.99558145,0.0024889212,0.00023571173,0.0008582967,0.0006018771,0.00023374539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002023966,0.0012609978,0.00071765797,0.0007791778,0.0006886599,0.001415095,0.002671734,0.0011842179,0.0016136249],"category_scores_gemma":[0.009842037,0.00032813067,0.00037315956,0.001053632,0.0009631948,0.0039750156,0.0013011149,0.0019130053,0.0003597675],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061272277,0.0005195689,0.0075115613,0.00043171484,0.00010032402,0.00020356663,0.00014376976,0.9142731,0.0055390294,0.019763548,0.009576004,0.04132509],"study_design_scores_gemma":[0.000013333906,0.00006778513,0.0005345093,0.00001039151,0.000009181292,0.0000267005,0.00005873172,0.99075073,0.0024943098,0.0054226248,0.0006044577,0.000007197398],"about_ca_topic_score_codex":0.008230117,"about_ca_topic_score_gemma":0.0077743945,"teacher_disagreement_score":0.008230117,"about_ca_system_score_codex":0.0017066094,"about_ca_system_score_gemma":0.0011839162,"threshold_uncertainty_score":0.016364455},"labels":[],"label_agreement":null},{"id":"W4407098172","doi":"10.3390/a18020076","title":"Broadcasting in Stars of Cliques and Path-Connected Cliques","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Path (computing); Stars; Clique; Computer network; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.010648348919158964,"score_gpt":0.25848931393942465,"score_spread":0.24784096502026567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407098172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16091241,0.00041738476,0.8265481,0.0006407539,0.000051597086,0.00026088362,0.00067984115,0.00037799848,0.010111014],"genre_scores_gemma":[0.6495868,0.0005527643,0.3403409,0.00019526508,0.00006255002,0.00025745292,0.0009946688,0.00014975964,0.007859729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992036,0.00029638468,0.0000314264,0.0002222452,0.00012846259,0.00011789189],"domain_scores_gemma":[0.9960044,0.0024262194,0.000482648,0.0004491876,0.00033791634,0.00029957722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013094628,0.00028221993,0.00057178445,0.00053525326,0.0009141659,0.0011309216,0.0008707519,0.0007162812,0.0034977167],"category_scores_gemma":[0.005843907,0.00042815236,0.0005436051,0.0010545392,0.0008819468,0.002517866,0.0010830712,0.0008096815,0.0005108928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056945,0.00017558144,0.003928982,0.00042836738,0.00010558598,0.0003353489,0.0008429662,0.3835142,0.016190967,0.5112676,0.011295243,0.07134568],"study_design_scores_gemma":[0.00010170577,0.0001997223,0.0012971889,0.000031661984,0.000038945946,0.0002890212,0.00032302216,0.6872721,0.005309251,0.29113272,0.013978489,0.000026166677],"about_ca_topic_score_codex":0.0026933376,"about_ca_topic_score_gemma":0.0036429898,"teacher_disagreement_score":0.0034977167,"about_ca_system_score_codex":0.0010299751,"about_ca_system_score_gemma":0.0011076544,"threshold_uncertainty_score":0.011701047},"labels":[],"label_agreement":null},{"id":"W4408145391","doi":"10.1109/mcom.001.2400476","title":"Advancing Ubiquitous Wireless Connectivity Through Channel Twinning","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Wireless; Ubiquitous computing; Channel (broadcasting); Wireless network; Telecommunications; Human–computer interaction","score_opus":0.03230287786345041,"score_gpt":0.30132671265214606,"score_spread":0.2690238347886956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408145391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017663414,0.00022061891,0.9761881,0.00015515715,0.000039755825,0.000017027072,0.000019586942,0.0003200925,0.005376338],"genre_scores_gemma":[0.8756918,0.00069848355,0.12043669,0.00012274437,0.000064065374,0.000054825196,0.00006049205,0.00007836544,0.0027924571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995772,0.0001212558,0.000014943685,0.00008729997,0.00013069955,0.00006864013],"domain_scores_gemma":[0.9995328,0.00016961065,0.00004304392,0.00014565559,0.000063829255,0.000045016255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046874073,0.0004734983,0.00041771916,0.0003639419,0.00044805583,0.0011080708,0.00078225974,0.0006619554,0.0016179611],"category_scores_gemma":[0.001435472,0.00029719275,0.0003318318,0.00045258712,0.0012192845,0.0027876215,0.0027053594,0.0012199177,0.0003200144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015906575,0.00006281047,0.0011021951,0.00012354398,0.000038506045,0.00040763782,0.00051326124,0.32449216,0.045944184,0.46403646,0.0021661308,0.16095403],"study_design_scores_gemma":[0.00001187091,0.000107652835,0.00021771369,0.00002461904,0.00002198151,0.00025570364,0.00010807892,0.87320393,0.009861916,0.10246937,0.01368741,0.00002979532],"about_ca_topic_score_codex":0.0010648643,"about_ca_topic_score_gemma":0.0012080093,"teacher_disagreement_score":0.0016179611,"about_ca_system_score_codex":0.00049257214,"about_ca_system_score_gemma":0.0004612357,"threshold_uncertainty_score":0.005412638},"labels":[],"label_agreement":null},{"id":"W4408145423","doi":"10.1109/mcom.001.2400381","title":"Strategic Demand-Planning in Wireless Networks: Can Generative-AI Save Spectrum and Energy?","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless; Telecommunications; Computer network; Wireless network; Radio networks","score_opus":0.03454872214299163,"score_gpt":0.28363727844644726,"score_spread":0.24908855630345564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408145423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028979862,0.0037406657,0.9103296,0.007293739,0.00053147424,0.00007404851,0.00020169285,0.0006045041,0.04824441],"genre_scores_gemma":[0.83736575,0.0055109155,0.14148082,0.0014099382,0.0003525002,0.00014956953,0.00029139235,0.0002863184,0.013152846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.00018509412,0.00001899886,0.000078791134,0.00011809769,0.00010017422],"domain_scores_gemma":[0.99851865,0.0008780755,0.00009542469,0.00022468744,0.00015988709,0.00012332691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011071771,0.0005914307,0.00049078604,0.000346971,0.0008017397,0.0021735022,0.0018161208,0.00094767904,0.004369195],"category_scores_gemma":[0.0037191438,0.0003707837,0.0003942186,0.0009398126,0.0017730894,0.0053848946,0.0016089281,0.0020270564,0.000993519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013041747,0.00009756627,0.00091023545,0.00030066862,0.0000363312,0.00022553404,0.0005423893,0.13817583,0.0046244,0.7101369,0.010581461,0.13423821],"study_design_scores_gemma":[0.000022396825,0.00006490398,0.00028459073,0.000081565806,0.000021486972,0.00017342505,0.00051304355,0.478972,0.0036037655,0.47427836,0.041936874,0.000047685848],"about_ca_topic_score_codex":0.0027333237,"about_ca_topic_score_gemma":0.0045758947,"teacher_disagreement_score":0.004369195,"about_ca_system_score_codex":0.0012916715,"about_ca_system_score_gemma":0.0012374457,"threshold_uncertainty_score":0.01461643},"labels":[],"label_agreement":null},{"id":"W4408258686","doi":"10.1109/ccwc62904.2025.10903555","title":"First Responder Communication Systems: A Technical Analysis of Interoperability and Situational Awareness Optimization","year":2025,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interoperability; Situation awareness; Computer science; Situational ethics; Knowledge management; First responder; Engineering; World Wide Web; Psychology","score_opus":0.019421272976351392,"score_gpt":0.27730374953122733,"score_spread":0.25788247655487595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408258686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050246302,0.0046211444,0.88886344,0.0054117073,0.00018995735,0.00013774128,0.00012991876,0.0002721237,0.050127592],"genre_scores_gemma":[0.8979918,0.0048570554,0.08774047,0.0004084794,0.0003816215,0.00020172831,0.00016923308,0.00018074964,0.008068959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977596,0.0007743929,0.000083977706,0.0002532118,0.0008148116,0.00031403036],"domain_scores_gemma":[0.9974612,0.0012741226,0.00038214133,0.00038902785,0.00040767004,0.00008587858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282144,0.0008964365,0.0007299665,0.0012779412,0.00081880623,0.0037327188,0.00094723894,0.0011336927,0.0024623254],"category_scores_gemma":[0.0060440064,0.00042843565,0.0005868454,0.0011703968,0.0015314238,0.005433634,0.0017021562,0.0015425517,0.000411418],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074166535,0.00010648992,0.0025132592,0.00023338683,0.000106400585,0.00018797921,0.0003104784,0.2947232,0.005777281,0.6056075,0.0029479926,0.08741184],"study_design_scores_gemma":[0.000014361891,0.00016917159,0.0026641674,0.00009898606,0.00007206026,0.000334726,0.0006491618,0.6945968,0.0053975843,0.274782,0.02116342,0.000057529636],"about_ca_topic_score_codex":0.0016046285,"about_ca_topic_score_gemma":0.0007207752,"teacher_disagreement_score":0.0037327188,"about_ca_system_score_codex":0.0020906914,"about_ca_system_score_gemma":0.0016291218,"threshold_uncertainty_score":0.015169084},"labels":[],"label_agreement":null},{"id":"W4409102121","doi":"10.1109/jiot.2025.3557024","title":"A Perpetual Compression Scheme for Delay Tolerant Communication","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Scheme (mathematics); Computer network; Compression (physics); Data compression; Algorithm; Mathematics","score_opus":0.01999646469495136,"score_gpt":0.2840711948919197,"score_spread":0.2640747301969683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409102121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05553541,0.0013933209,0.93872607,0.00027982553,0.00019295159,0.000098221164,0.00012326051,0.00047004476,0.0031809201],"genre_scores_gemma":[0.7049434,0.00091358466,0.2880422,0.00033190526,0.00021104264,0.00017216736,0.00021293758,0.00005914631,0.0051136343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968493,0.00005781462,0.0000243943,0.00005946344,0.00014282468,0.00003065096],"domain_scores_gemma":[0.99917847,0.00025144478,0.00009183695,0.0003022513,0.00013815881,0.000037863814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045965367,0.00032159072,0.00033189348,0.0005604391,0.0005446912,0.00052708137,0.00097554235,0.00041781474,0.0012622242],"category_scores_gemma":[0.0017259669,0.00015105058,0.00016506985,0.0007814417,0.00061877025,0.001241438,0.0010086659,0.00054194237,0.00032136514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007786021,0.00015846782,0.0011913468,0.00032122098,0.000047999874,0.00049026014,0.0006809564,0.1052675,0.17660347,0.1782716,0.004944187,0.53124446],"study_design_scores_gemma":[0.00008279443,0.00061411207,0.0007253074,0.00007086256,0.00004330973,0.0013714355,0.00012921957,0.83744687,0.088838965,0.045895778,0.02470038,0.00008097251],"about_ca_topic_score_codex":0.00044467507,"about_ca_topic_score_gemma":0.0005047707,"teacher_disagreement_score":0.0012622242,"about_ca_system_score_codex":0.00041824413,"about_ca_system_score_gemma":0.0005521136,"threshold_uncertainty_score":0.0042225122},"labels":[],"label_agreement":null},{"id":"W4409581005","doi":"10.1109/tsc.2025.3562318","title":"Puncturable Signature and Applications in Privacy-Aware Data Reporting for VDTNs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Computer security; Signature (topology); Internet privacy","score_opus":0.03553210325108668,"score_gpt":0.3032572500796363,"score_spread":0.2677251468285496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409581005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016476493,0.0011813646,0.97687143,0.00048984046,0.00019021216,0.00017032746,0.000089437795,0.0008193373,0.0037116485],"genre_scores_gemma":[0.6853698,0.0020868294,0.30561706,0.00051109167,0.0002046977,0.00030745796,0.0002920789,0.000092220136,0.0055188634],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99625826,0.0010082381,0.0005494755,0.0006135775,0.0012870947,0.00028342748],"domain_scores_gemma":[0.99493057,0.0013920099,0.00074294285,0.0018375408,0.00093375705,0.00016311341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021479311,0.00070456945,0.0006481162,0.0010388279,0.000918625,0.0015181423,0.0015331812,0.0014568772,0.0017944213],"category_scores_gemma":[0.007245155,0.00035440188,0.0009809266,0.0021066254,0.0016092629,0.0036228315,0.002693526,0.001726611,0.00094021927],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008753495,0.00015998594,0.0027678085,0.00091246964,0.00011477554,0.0019518067,0.001295683,0.07887744,0.10745022,0.38195744,0.0058458652,0.4177912],"study_design_scores_gemma":[0.00011933394,0.000977448,0.0009262817,0.0002131846,0.0001406029,0.004538908,0.0004101688,0.5968881,0.19523208,0.115280606,0.08502595,0.00024743457],"about_ca_topic_score_codex":0.0005011621,"about_ca_topic_score_gemma":0.00027685968,"teacher_disagreement_score":0.0021479311,"about_ca_system_score_codex":0.00089855003,"about_ca_system_score_gemma":0.0012997375,"threshold_uncertainty_score":0.011359453},"labels":[],"label_agreement":null},{"id":"W4410500114","doi":"10.3390/cryst15050474","title":"Tailoring the Luminescence Properties of Strontium Aluminate Phosphors for Unique Smartphone Detectable Optical Tags","year":2025,"lang":"en","type":"article","venue":"Crystals","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Phosphor; Strontium; Persistent luminescence; Luminescence; Aluminate; Strontium oxide; Materials science; Optoelectronics; Chemistry; Metallurgy; Thermoluminescence","score_opus":0.019589161560688934,"score_gpt":0.23230407607783252,"score_spread":0.21271491451714358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410500114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97865933,0.0014335597,0.016873509,0.00012325624,0.00003719999,0.000062140236,0.00012338183,0.00016344003,0.0025241985],"genre_scores_gemma":[0.98793274,0.00067786576,0.009855386,0.00006433604,0.0000112993785,0.000032856562,0.000070700975,0.000039972994,0.0013149227],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998934,0.000014216099,0.0000077470395,0.000028683751,0.000033646535,0.000022299826],"domain_scores_gemma":[0.99988055,0.000035499153,0.000032468855,0.000009139015,0.000029370842,0.000013103549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018473947,0.0002879177,0.00014999679,0.00017190675,0.00008864224,0.0003829691,0.00023218886,0.00029105606,0.00080389134],"category_scores_gemma":[0.0003527487,0.00014672228,0.00014701161,0.00011027744,0.00019495009,0.00033536166,0.000233604,0.000344008,0.00032280313],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023076649,0.0000043108726,0.000056456574,0.000033730408,0.0000019634579,0.000024136287,0.000013569284,0.00007620537,0.9980202,0.00012948093,0.00001787734,0.001598989],"study_design_scores_gemma":[0.0000042459337,0.000059317514,0.0001403215,0.0000024772667,0.000003796069,0.000056309626,0.00001331704,0.0007127371,0.9981041,0.000017480614,0.00088280113,0.000003061859],"about_ca_topic_score_codex":0.0001872044,"about_ca_topic_score_gemma":0.00045112675,"teacher_disagreement_score":0.00080389134,"about_ca_system_score_codex":0.00021877,"about_ca_system_score_gemma":0.00015296876,"threshold_uncertainty_score":0.002689302},"labels":[],"label_agreement":null},{"id":"W4411203111","doi":"10.1109/jiot.2025.3566853","title":"Guest Editorial Special Issue on Near-Field Communications (NFCs) in Internet of Everything","year":2025,"lang":"en","type":"editorial","venue":"IEEE Internet of Things Journal","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Field (mathematics); The Internet; Telecommunications; Computer network; World Wide Web; Mathematics","score_opus":0.014224497239408756,"score_gpt":0.28453784416223726,"score_spread":0.2703133469228285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411203111","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003163284,0.002124465,0.000111075235,0.011103341,0.9846036,0.000017481012,0.00003224736,0.00004446084,0.0019317359],"genre_scores_gemma":[0.00036571143,0.002488141,0.00008630123,0.006596968,0.9783811,0.000019155685,0.000031636977,0.000038312304,0.01199272],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99591124,0.00047865225,0.00038591918,0.0005671222,0.0022941863,0.00036289205],"domain_scores_gemma":[0.9852984,0.0033774558,0.0010746428,0.0003849524,0.0066350014,0.0032295592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053176177,0.0038077359,0.00405444,0.0039521772,0.003278857,0.009029269,0.002403954,0.01273027,0.03174957],"category_scores_gemma":[0.012937183,0.001134128,0.0026243986,0.001484227,0.0018656702,0.0040249433,0.0017460239,0.01389619,0.01946997],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004512879,0.000020700181,0.000029499835,0.0001997787,0.00001432408,0.00011015586,0.0000073332994,0.000034986544,0.00012975275,0.00031398266,0.99274313,0.006351168],"study_design_scores_gemma":[0.00006621823,0.000057802965,0.00028529787,0.00026412023,0.00004864787,0.00024658538,0.000033173797,0.00025676796,0.00017722641,0.0009872159,0.99755883,0.000018123457],"about_ca_topic_score_codex":0.00088041875,"about_ca_topic_score_gemma":0.003037337,"teacher_disagreement_score":0.03174957,"about_ca_system_score_codex":0.002429587,"about_ca_system_score_gemma":0.0023941863,"threshold_uncertainty_score":0.106212914},"labels":[],"label_agreement":null},{"id":"W4413457108","doi":"10.1109/smartnets65254.2025.11106831","title":"Cryptoscape: Navigating Data Encryption for Hyperscale Growth","year":2025,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Encryption; Computer security","score_opus":0.03927154930683379,"score_gpt":0.31684309406345557,"score_spread":0.27757154475662177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413457108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0853638,0.0011247114,0.86932564,0.0025925224,0.00017839424,0.0002607642,0.00019808875,0.006595554,0.03436065],"genre_scores_gemma":[0.6021251,0.0011668814,0.3843889,0.00044358743,0.00006385494,0.00014182586,0.0005031271,0.00055768585,0.010608973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945337,0.00007699421,0.00002472386,0.0000910773,0.00025178012,0.00010207102],"domain_scores_gemma":[0.99940765,0.00007635477,0.00006365835,0.0002188831,0.0001224906,0.000111070636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008753701,0.00045316215,0.00024544576,0.0005319501,0.00069974584,0.0019382243,0.001283704,0.00071049866,0.0021956384],"category_scores_gemma":[0.0015206352,0.00025239625,0.00035614992,0.0005201302,0.0011842884,0.005836139,0.0034462563,0.0016663427,0.00080651965],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038160972,0.00023855531,0.0076274322,0.00027805596,0.00006239876,0.00082433753,0.000881096,0.062145997,0.06115402,0.4567108,0.02815335,0.38154235],"study_design_scores_gemma":[0.00005686246,0.00021652268,0.0029226537,0.00013260012,0.00003913254,0.0011455786,0.0006692133,0.55603766,0.053705204,0.12717552,0.257814,0.00008499139],"about_ca_topic_score_codex":0.0024103664,"about_ca_topic_score_gemma":0.0027863903,"teacher_disagreement_score":0.0024103664,"about_ca_system_score_codex":0.0011559294,"about_ca_system_score_gemma":0.0012312838,"threshold_uncertainty_score":0.00838691},"labels":[],"label_agreement":null},{"id":"W4414530209","doi":"10.22323/1.501.1202","title":"Development of monitoring and control strategies for biofouling and sedimentation for the Pacific Ocean Neutrino Experiment","year":2025,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; UK Research and Innovation; Deutsche Forschungsgemeinschaft; Canada First Research Excellence Fund; National Science Foundation","keywords":"Pathfinder; Biofouling; Pacific ocean; Deposition (geology); Software deployment; Shore","score_opus":0.03028986801230629,"score_gpt":0.28854512874501265,"score_spread":0.2582552607327064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414530209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28606278,0.008280982,0.6700855,0.0046592723,0.0005494414,0.002057883,0.001054072,0.002891433,0.024358654],"genre_scores_gemma":[0.7227474,0.0035211376,0.2683169,0.00049278646,0.0000651987,0.0004915011,0.0008083593,0.0000740741,0.00348267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986848,0.00022921462,0.00006597127,0.00027822235,0.00054397964,0.00019783594],"domain_scores_gemma":[0.99694484,0.00046008854,0.00043564025,0.00024845905,0.0016186261,0.00029229515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034410362,0.0011518213,0.0007946713,0.0013978867,0.0010316265,0.0021022053,0.0019256575,0.0011686789,0.0010767253],"category_scores_gemma":[0.0039855414,0.00041273359,0.00046273018,0.00078145467,0.0005641102,0.0026071712,0.0013492004,0.0012530182,0.00043078596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005364698,0.00094981823,0.09579557,0.0010858433,0.00019405814,0.00030819737,0.00052767654,0.0580488,0.18831284,0.009833384,0.00606282,0.63834447],"study_design_scores_gemma":[0.00018482491,0.0020892348,0.059076242,0.00067311106,0.00034507192,0.00025425135,0.0024638455,0.69629216,0.168009,0.0121742785,0.05823111,0.00020694315],"about_ca_topic_score_codex":0.023473553,"about_ca_topic_score_gemma":0.023064775,"teacher_disagreement_score":0.023473553,"about_ca_system_score_codex":0.001682527,"about_ca_system_score_gemma":0.0042912285,"threshold_uncertainty_score":0.046673834},"labels":[],"label_agreement":null},{"id":"W4414576648","doi":"","title":"Traveling waves in periodic metric graphs via spatial dynamics","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Centre International de Mathématiques et Informatique de Toulouse; Agence Nationale de la Recherche","keywords":"Traveling wave; Metric (unit); Pulse (music); Limit (mathematics); Nonlinear system; Wave propagation; Manifold (fluid mechanics); Center manifold","score_opus":0.028352379761488234,"score_gpt":0.25552435996945183,"score_spread":0.2271719802079636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414576648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5846209,0.00061913044,0.392542,0.00075579435,0.000066067536,0.00004845627,0.00008961907,0.0001525884,0.021105437],"genre_scores_gemma":[0.97970897,0.00032381873,0.016003676,0.000068173744,0.000025087014,0.000042272546,0.000039248436,0.00002345563,0.0037653607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99993205,0.000024008252,0.0000028905495,0.000009370357,0.00001996129,0.0000117454065],"domain_scores_gemma":[0.9998419,0.00005009792,0.000040229133,0.000016108197,0.000030906966,0.000020742238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015288929,0.0002393142,0.0001577753,0.0004375033,0.00033676173,0.000541805,0.00033421838,0.00029917562,0.0011507235],"category_scores_gemma":[0.00066121836,0.00014717977,0.00021709231,0.00022509655,0.0008358995,0.00104225,0.0006456074,0.00037177367,0.00008999124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015244699,0.000011487347,0.00057684176,0.000035873887,0.000010424813,0.00016327614,0.00017638509,0.100024015,0.0071600503,0.88515997,0.0005697678,0.0060966415],"study_design_scores_gemma":[0.000010601668,0.00002690293,0.00043918978,0.000008552429,0.000006176013,0.00008652949,0.00011172234,0.7404791,0.0010019774,0.2557628,0.0020573246,0.00000913642],"about_ca_topic_score_codex":0.0015044938,"about_ca_topic_score_gemma":0.0010232072,"teacher_disagreement_score":0.0015044938,"about_ca_system_score_codex":0.0006335187,"about_ca_system_score_gemma":0.00034317124,"threshold_uncertainty_score":0.0045965314},"labels":[],"label_agreement":null},{"id":"W4415424932","doi":"10.1386/adch_00118_1","title":"Pedagogies for cohabitation with interplanetary infrastructures of telecommunications","year":2025,"lang":"en","type":"article","venue":"Art Design & Communication in Higher Education","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Situated; Space (punctuation); Discipline; Tacit knowledge; Affordance; Interplanetary space","score_opus":0.04509219477998044,"score_gpt":0.31764517978776974,"score_spread":0.2725529850077893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415424932","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32673383,0.0020944763,0.10091343,0.05477145,0.000675499,0.00082035485,0.000041720414,0.0003200703,0.51362926],"genre_scores_gemma":[0.95254993,0.0011038948,0.019831587,0.001556428,0.00006662323,0.00032771376,0.000020849644,0.000086424814,0.024456503],"study_design_codex":"qualitative","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951975,0.0032245575,0.00009248998,0.00042464846,0.0005114331,0.0005492923],"domain_scores_gemma":[0.99356866,0.003817991,0.00050619565,0.00058978953,0.00039171032,0.0011256507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00753714,0.0005689231,0.00033054609,0.001287582,0.009641454,0.007930675,0.0015885434,0.0022893134,0.014313008],"category_scores_gemma":[0.009605269,0.00034374325,0.0005862885,0.0007734715,0.023292001,0.008234388,0.014942417,0.005238854,0.0014799999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017422377,0.00027630216,0.0025573373,0.00026922653,0.000006260516,0.0003688369,0.5394467,0.0004056977,0.0010740579,0.39043844,0.0059392857,0.059200462],"study_design_scores_gemma":[0.000028348877,0.00013461543,0.0019115385,0.0007269299,0.0000119832885,0.00037019653,0.44212246,0.001002534,0.0011387728,0.19171347,0.3608107,0.000028501008],"about_ca_topic_score_codex":0.0032578458,"about_ca_topic_score_gemma":0.007383537,"teacher_disagreement_score":0.014313008,"about_ca_system_score_codex":0.0042043896,"about_ca_system_score_gemma":0.010467337,"threshold_uncertainty_score":0.047881782},"labels":[],"label_agreement":null},{"id":"W4415727271","doi":"10.1016/j.dam.2025.10.032","title":"Cops &amp; Robber on periodic temporal graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Graph; Class (philosophy); Set (abstract data type); Sequence (biology); Representation (politics)","score_opus":0.018296448455811316,"score_gpt":0.2578047928780514,"score_spread":0.2395083444222401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415727271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35463157,0.0006783482,0.576681,0.0018011528,0.00030646502,0.00018416798,0.00075530144,0.0010044625,0.06395747],"genre_scores_gemma":[0.91500646,0.00042485853,0.039958328,0.0002770148,0.00012483868,0.00011333958,0.00044237977,0.00025949877,0.043393344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948835,0.000099328885,0.000021116759,0.00014563341,0.00011019353,0.00013532994],"domain_scores_gemma":[0.99668545,0.0017133217,0.00051286153,0.00037112998,0.0002755789,0.0004416187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012577,0.00049373606,0.00097164465,0.0012765093,0.0013762914,0.0015291957,0.0016903798,0.0011432219,0.013681279],"category_scores_gemma":[0.005656201,0.00050616794,0.0006053451,0.0010984647,0.0013771226,0.0024109604,0.0018415459,0.0009629104,0.00080817833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027240376,0.000082439015,0.0009194913,0.00013698681,0.00004732594,0.00048407714,0.0003079979,0.2734925,0.002626143,0.68562925,0.009252852,0.026748504],"study_design_scores_gemma":[0.000028716313,0.000034258253,0.0003845697,0.000018922921,0.000016535729,0.0001234252,0.00013425137,0.7203924,0.0006912716,0.27464953,0.0035124088,0.000013749963],"about_ca_topic_score_codex":0.009383716,"about_ca_topic_score_gemma":0.009240793,"teacher_disagreement_score":0.013681279,"about_ca_system_score_codex":0.001406177,"about_ca_system_score_gemma":0.0010985207,"threshold_uncertainty_score":0.0457685},"labels":[],"label_agreement":null},{"id":"W4416573669","doi":"10.1016/j.dam.2025.11.013","title":"Bounds on broadcast time in well-connected graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Upper and lower bounds; Vertex (graph theory); Graph; Connectivity; Binary logarithm; Time complexity","score_opus":0.007889908169945536,"score_gpt":0.23062912929525203,"score_spread":0.2227392211253065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416573669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17049149,0.020489337,0.698894,0.01964602,0.0014619215,0.00041966798,0.0039907773,0.002012421,0.08259437],"genre_scores_gemma":[0.8561839,0.020006234,0.084897846,0.003375431,0.0028990726,0.001180955,0.002666066,0.0017459594,0.027044581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576426,0.00090066966,0.00017851849,0.00076349376,0.0011574746,0.0012355624],"domain_scores_gemma":[0.8511752,0.12945852,0.004610464,0.0044344696,0.004787659,0.005533649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074946852,0.0042152135,0.0052214307,0.0064036422,0.003655122,0.008623208,0.007559598,0.003775085,0.017101284],"category_scores_gemma":[0.0609217,0.0021593804,0.002306819,0.008331865,0.006535821,0.017257506,0.0069454527,0.00921128,0.002229148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026236777,0.00048534846,0.003302978,0.002149826,0.00037202152,0.00044494012,0.0019755738,0.2958765,0.0103601795,0.60547477,0.025419021,0.051515248],"study_design_scores_gemma":[0.00020453622,0.00018141621,0.001037692,0.0003053335,0.00030617442,0.0002501527,0.0003734973,0.3929992,0.0022671479,0.5969154,0.0050691273,0.000090266825],"about_ca_topic_score_codex":0.004934189,"about_ca_topic_score_gemma":0.006514344,"teacher_disagreement_score":0.017101284,"about_ca_system_score_codex":0.007900677,"about_ca_system_score_gemma":0.0036964335,"threshold_uncertainty_score":0.057323635},"labels":[],"label_agreement":null},{"id":"W6889018442","doi":"10.25318/9810032801-eng","title":"Shelter-cost-to-income ratio by visible minority and immigrant status and period of immigration: Canada, provinces and territories, census metropolitan areas and census agglomerations with parts","year":2022,"lang":"en","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Census; Metropolitan area; Urban agglomeration; Immigration; Population; American Community Survey","score_opus":0.004956331559349084,"score_gpt":0.22414506316928307,"score_spread":0.219188731609934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6889018442","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018965385,0.00004201257,0.000012439956,0.000046261623,0.000008003105,0.000005784311,0.99940383,0.00004918296,0.00024293488],"genre_scores_gemma":[0.0012584373,0.000076175,0.000097682554,0.000038547507,0.000005312729,0.000040105624,0.9977652,0.000020450394,0.0006980828],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989716,0.000063821586,0.00009676602,0.00020117711,0.00034498266,0.00032162177],"domain_scores_gemma":[0.99535865,0.00058411463,0.0004018376,0.00045092282,0.002584716,0.00061972067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007887626,0.0021591112,0.0015289744,0.0044655297,0.0013658752,0.0023835045,0.0036949168,0.0019792223,0.024728041],"category_scores_gemma":[0.0069584725,0.0008056509,0.0013764388,0.013608329,0.00061156,0.0009696475,0.001239972,0.0021503505,0.018616093],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054817232,0.00002448494,0.0031236063,0.00036386796,0.00004112969,0.000018531216,0.000022715552,0.00076586957,0.00003119236,0.00035930073,0.9938055,0.0013889356],"study_design_scores_gemma":[0.00076024525,0.000029582612,0.060587544,0.0009355819,0.000104429746,0.00011260492,0.0003950541,0.0028766617,0.00041015088,0.0010845558,0.93261117,0.00009240852],"about_ca_topic_score_codex":0.9031949,"about_ca_topic_score_gemma":0.9306527,"teacher_disagreement_score":0.096805096,"about_ca_system_score_codex":0.010272407,"about_ca_system_score_gemma":0.01837011,"threshold_uncertainty_score":0.19475037},"labels":[],"label_agreement":null},{"id":"W6892251969","doi":"10.5061/dryad.pzgmsbchr","title":"SRP54 locus genotypes of white-tailed deer from Jamieson et al.","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Trent University","funders":"","keywords":"Heritability; Population; Trait; Locus (genetics); Allele frequency; Selection (genetic algorithm); Genotype; Single-nucleotide polymorphism","score_opus":0.033588223067630846,"score_gpt":0.24292068338590178,"score_spread":0.20933246031827094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892251969","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99300635,0.00010735011,0.0014201357,0.000053246207,0.000019488663,0.00006813886,0.0036426221,0.000021637918,0.0016609728],"genre_scores_gemma":[0.98600996,0.00008223137,0.0037104723,0.0002122182,0.000008835404,0.00011521225,0.00557571,0.000044161723,0.0042412668],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969554,0.000037198788,0.000025347612,0.00012084807,0.00007458537,0.00004646958],"domain_scores_gemma":[0.99958354,0.000056155237,0.000051312327,0.000072565774,0.00015631126,0.00008001724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043296092,0.00041335708,0.00022514763,0.00087193545,0.00084481825,0.00042678113,0.00047134372,0.00043084202,0.0023430276],"category_scores_gemma":[0.000864194,0.00016736222,0.00037357904,0.0005910703,0.00034800556,0.00012130951,0.00024884954,0.00030387857,0.00056778954],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007138697,0.00022993617,0.8702676,0.00006943593,0.00044290046,0.0022197927,0.0027510691,0.0005429193,0.082957126,0.0005135017,0.0040746937,0.035217166],"study_design_scores_gemma":[0.000025278503,0.000079829486,0.99386,0.000020762815,0.00006542615,0.0005684163,0.00031401354,0.00036627287,0.0011324412,0.000041682928,0.0035119515,0.000013973968],"about_ca_topic_score_codex":0.26353478,"about_ca_topic_score_gemma":0.48666564,"teacher_disagreement_score":0.26353478,"about_ca_system_score_codex":0.0009105218,"about_ca_system_score_gemma":0.00064696255,"threshold_uncertainty_score":0.5240017},"labels":[],"label_agreement":null},{"id":"W6922157595","doi":"10.7939/r3-061a-yq34","title":"Vehicular Delay Tolerant Networking for Fleet Management Applications","year":2023,"lang":"en","type":"dissertation","venue":"University of Alberta Library","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Throughput; Fleet management; Markov process; Data collection; Vehicle dynamics; Service (business); Wireless; Trajectory; Telecommunications network","score_opus":0.011413850559384986,"score_gpt":0.200901400172503,"score_spread":0.189487549613118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6922157595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10914697,0.016866496,0.73628813,0.0023514312,0.00062777015,0.00032354557,0.0004380883,0.0014402426,0.13251738],"genre_scores_gemma":[0.797754,0.019050557,0.11367194,0.00022856782,0.00020113087,0.00021863887,0.0006102319,0.00012070481,0.068144284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994147,0.000008573485,0.000001822108,0.0000060750776,0.000032619406,0.000009437375],"domain_scores_gemma":[0.9999312,0.000023173996,0.000005855393,0.0000076032115,0.00002547176,0.000006638739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017014182,0.00020850284,0.000100962665,0.00023767471,0.00030253813,0.0005930185,0.0002888765,0.0002269648,0.002757162],"category_scores_gemma":[0.00039151142,0.00009031561,0.00010940964,0.00046031317,0.00013281884,0.00029989728,0.00021654778,0.00031070854,0.0004893102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008835455,0.00010570006,0.0021910141,0.0003801059,0.000029105051,0.00019923541,0.00038464402,0.3456005,0.04150734,0.110326655,0.022193683,0.47699365],"study_design_scores_gemma":[0.000016545784,0.00018387396,0.003245754,0.000196285,0.000034020857,0.00017270411,0.00040058102,0.6641146,0.0166452,0.05278333,0.26217577,0.00003133595],"about_ca_topic_score_codex":0.005485358,"about_ca_topic_score_gemma":0.010293425,"teacher_disagreement_score":0.005485358,"about_ca_system_score_codex":0.0008076213,"about_ca_system_score_gemma":0.00076841627,"threshold_uncertainty_score":0.010906875},"labels":[],"label_agreement":null},{"id":"W6958023693","doi":"10.60692/exyhz-acs76","title":"A Wireless Mesh Opportunistic Network Routing Algorithm Based on Trust Relationships","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Node (physics); Wireless mesh network; Multipath routing; Geographic routing; Routing (electronic design automation); Policy-based routing; Dynamic Source Routing; Static routing; Wireless","score_opus":0.05077770344211726,"score_gpt":0.20847442009516123,"score_spread":0.15769671665304397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958023693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02806721,0.00026285267,0.9676196,0.00022150422,0.000069731315,0.0001416281,0.00006791866,0.00049960276,0.0030498821],"genre_scores_gemma":[0.65563124,0.00043144307,0.337649,0.00014154908,0.000042428695,0.00039140636,0.00029493062,0.00007111415,0.005347014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996001,0.0000902674,0.000031261723,0.00008616547,0.00013626892,0.000055919958],"domain_scores_gemma":[0.9995933,0.00014205348,0.00007243511,0.000047369296,0.00011741233,0.000027405442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044136037,0.00042216308,0.0005298811,0.0007369765,0.0007272224,0.0005917693,0.0010764535,0.000495289,0.0009081167],"category_scores_gemma":[0.0017738905,0.00020023594,0.00045723878,0.00071633066,0.00026575706,0.0011550307,0.0007323477,0.00036754765,0.00015264093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003478849,0.00018234707,0.004614398,0.00019947632,0.00017787822,0.00030228484,0.00037444284,0.5356166,0.017798835,0.038924884,0.007633033,0.39382794],"study_design_scores_gemma":[0.000033944198,0.00007566629,0.00035052747,0.000007937904,0.000027876478,0.00016506687,0.000047776095,0.98881066,0.0020236792,0.0052345176,0.0032049166,0.000017521234],"about_ca_topic_score_codex":0.0064581544,"about_ca_topic_score_gemma":0.0067346757,"teacher_disagreement_score":0.0064581544,"about_ca_system_score_codex":0.000879947,"about_ca_system_score_gemma":0.0012018494,"threshold_uncertainty_score":0.012841165},"labels":[],"label_agreement":null},{"id":"W6966557460","doi":"10.4230/lipics.sand.2025.12","title":"Restless Exploration and Token Dissemination in Vertex-Permuted Temporal Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Security token; Graph; Vertex (graph theory); Class (philosophy); Topological graph theory; Graph property; Base (topology)","score_opus":0.013628539163856566,"score_gpt":0.27549746770986394,"score_spread":0.26186892854600735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966557460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10603928,0.0004320652,0.8854681,0.00079375674,0.000054859072,0.00011687463,0.00041765222,0.00045141834,0.006225873],"genre_scores_gemma":[0.87538236,0.0006402366,0.11685697,0.0001995364,0.00006829926,0.0001719088,0.0004826728,0.00015637107,0.006041817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881566,0.00046259208,0.00006616781,0.0002710475,0.0001797734,0.00020474163],"domain_scores_gemma":[0.9923962,0.0049875113,0.00088438764,0.0010444168,0.00034966617,0.00033777504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823879,0.00054395886,0.00062379305,0.00069940183,0.0010838128,0.001494695,0.0013367878,0.0009786199,0.0026510493],"category_scores_gemma":[0.009412314,0.0003756353,0.0007648793,0.0013038403,0.0017037132,0.0053919097,0.0018270132,0.001244349,0.00029909777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068236765,0.000107555796,0.0013336409,0.0002565299,0.00006606154,0.0006391005,0.00067982863,0.41939387,0.008800921,0.5223587,0.004835471,0.04084592],"study_design_scores_gemma":[0.000056674293,0.00008827255,0.00032885274,0.000025006737,0.000034096327,0.00028470447,0.00019695511,0.6618344,0.0041473247,0.32687056,0.0061077033,0.00002538446],"about_ca_topic_score_codex":0.0019868673,"about_ca_topic_score_gemma":0.0017174174,"teacher_disagreement_score":0.0026510493,"about_ca_system_score_codex":0.0013734224,"about_ca_system_score_gemma":0.0009392577,"threshold_uncertainty_score":0.009964943},"labels":[],"label_agreement":null},{"id":"W6981712073","doi":"","title":"Extrusion foaming behavior of pet","year":2012,"lang":"en","type":"article","venue":"NPARC","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Extrusion; Polyethylene terephthalate; Differential scanning calorimetry; Crystallinity; Scanning electron microscope; Foaming agent; Extrusion moulding; Polyethylene","score_opus":0.02722321946169981,"score_gpt":0.255596903494168,"score_spread":0.22837368403246822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981712073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9973086,0.000480375,0.0012051825,0.000023630073,0.000009415346,0.00000944942,0.00015985653,0.000032054682,0.00077151874],"genre_scores_gemma":[0.99627787,0.00038357452,0.0015897478,0.000020884667,0.000005544324,0.000011503597,0.00024649643,0.000018323188,0.0014460022],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985194,0.000018858533,0.000012505497,0.000034684264,0.000051409777,0.000030622392],"domain_scores_gemma":[0.99975425,0.00010990396,0.000043061915,0.000016736463,0.000060813505,0.000015266389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017539386,0.00021674483,0.00022738219,0.0002123473,0.0001283536,0.0001561724,0.000108101194,0.00026076482,0.0016949672],"category_scores_gemma":[0.0005247361,0.00010624442,0.00017368718,0.00024097692,0.00011623324,0.00037993578,0.00014301023,0.00027550096,0.00018743589],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021000709,0.000019121026,0.00031081142,0.000052007024,0.000003912247,0.00014083499,0.00007685949,0.00028030213,0.994507,0.000045270666,0.000043254957,0.004310646],"study_design_scores_gemma":[0.0000039589786,0.0002852394,0.0020295377,0.0000071496124,0.0000070995093,0.00013173503,0.000030841158,0.0009992927,0.9955688,0.000014301769,0.00091590604,0.000006198749],"about_ca_topic_score_codex":0.0005011606,"about_ca_topic_score_gemma":0.0004650359,"teacher_disagreement_score":0.0016949672,"about_ca_system_score_codex":0.000111669055,"about_ca_system_score_gemma":0.000054966957,"threshold_uncertainty_score":0.0056702495},"labels":[],"label_agreement":null},{"id":"W6989402890","doi":"","title":"AnonDSR: Efficient Anonymous Dynamic Source Routing for Mobile Ad-Hoc Networks","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Anonymity; Link-state routing protocol; Routing (electronic design automation); Wireless ad hoc network; Optimized Link State Routing Protocol","score_opus":0.008767930778574311,"score_gpt":0.2341531705977605,"score_spread":0.22538523981918618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989402890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032525137,0.00048229255,0.9564101,0.00032994457,0.000114033195,0.00020615294,0.0001557839,0.0021758708,0.007600712],"genre_scores_gemma":[0.53787374,0.0010362937,0.44952944,0.00016667912,0.00012097599,0.00039501945,0.0007147437,0.00019700133,0.009966063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992866,0.00019323238,0.000038863873,0.000056481113,0.00036807067,0.00005679044],"domain_scores_gemma":[0.9992016,0.00028237188,0.000111283305,0.00017677071,0.00017734533,0.000050619776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010985358,0.0004913039,0.0003821465,0.0008232783,0.0006333258,0.00067702873,0.0012367599,0.00039570476,0.0014813527],"category_scores_gemma":[0.001656108,0.0001556261,0.00026398126,0.00061787985,0.0005368471,0.0013557044,0.0011677097,0.00044785236,0.0003804588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004899695,0.00028445257,0.0013359536,0.0005642371,0.00013641301,0.00057193224,0.00033651709,0.2588667,0.084456235,0.19431207,0.018168462,0.4404771],"study_design_scores_gemma":[0.00008873129,0.00025612864,0.00048170326,0.000028856626,0.000052727253,0.0005324609,0.000087460256,0.89238364,0.021325232,0.050735522,0.033972412,0.000055232078],"about_ca_topic_score_codex":0.0008405717,"about_ca_topic_score_gemma":0.0018037527,"teacher_disagreement_score":0.0014813527,"about_ca_system_score_codex":0.0005920389,"about_ca_system_score_gemma":0.00088323315,"threshold_uncertainty_score":0.0058096647},"labels":[],"label_agreement":null},{"id":"W6996774577","doi":"","title":"TC Space Data Link Protocol . Blue Book. Issue 2. September 2010 - CCSDS 232.0-B-2","year":2010,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; Center for Long-Term Cybersecurity, University of California Berkeley; Geo-Informatics and Space Technology Development Agency; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; European Organization for the Exploitation of Meteorological Satellites; Korea Aerospace Research Institute; National Commission for Science and Technology; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; National Oceanic and Atmospheric Administration; National Space Organization; China National Space Administration; Belgian Federal Science Policy Office; Chinese Academy of Sciences; U.S. Geological Survey; Indian Space Research Organisation; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration","keywords":"Retransmission; Protocol (science); Data link; Data system; Data transmission; Asynchronous communication; Space (punctuation); Transfer (computing)","score_opus":0.1237341029168473,"score_gpt":0.39163350935234303,"score_spread":0.2678994064354957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996774577","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001361249,0.017027143,0.06697904,0.0103963185,0.025634084,0.0010754911,0.027337678,0.01522693,0.834962],"genre_scores_gemma":[0.005550669,0.009080843,0.011485337,0.0026629935,0.0025286041,0.0004846528,0.02595989,0.00304057,0.93920654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990393,0.000088190616,0.00006409949,0.00007119507,0.00065614283,0.00008120023],"domain_scores_gemma":[0.9976814,0.00033725635,0.00009889396,0.00023466235,0.0014722522,0.00017544902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568039,0.0012928735,0.0008339933,0.0031554261,0.0010824038,0.0027608962,0.0015977245,0.002194146,0.20013775],"category_scores_gemma":[0.003266746,0.00065825187,0.0003302053,0.0031660707,0.00064844463,0.0032359788,0.0010500201,0.003221924,0.23494826],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032929805,0.000020204805,0.000033322733,0.0001332476,0.0000024765845,0.000022001239,0.00001768738,0.00021034603,0.0007241362,0.0066251825,0.9434931,0.048685424],"study_design_scores_gemma":[0.000008671254,0.000011839094,0.00010264518,0.00008543575,0.000002908173,0.00005100215,0.000013873959,0.00037002502,0.0003515564,0.0019055904,0.99708647,0.000009869478],"about_ca_topic_score_codex":0.0110939015,"about_ca_topic_score_gemma":0.014422094,"teacher_disagreement_score":0.20013775,"about_ca_system_score_codex":0.0022911963,"about_ca_system_score_gemma":0.0034029034,"threshold_uncertainty_score":0.6695275},"labels":[],"label_agreement":null},{"id":"W7011768837","doi":"","title":"Next Generation Space Internet (NGSI)End-to-End Resource Provisioning for Orbiting Missions - CCSDS 732.5-O-1-S","year":2003,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Space and Astronautical Science; Nuclear Physics; Canadian Space Agency; Indian Space Research Organisation; U.S. Geological Survey; National Space Organization; National Oceanic and Atmospheric Administration; Korea Aerospace Research Institute; European Organization for the Exploitation of Meteorological Satellites; European Space Agency; Agenzia Spaziale Italiana; Commonwealth Scientific and Industrial Research Organisation; Centre National d’Etudes Spatiales; National Aeronautics and Space Administration","keywords":"Provisioning; Resource (disambiguation); The Internet; Space (punctuation); Space exploration; Resource management (computing)","score_opus":0.16297981311346768,"score_gpt":0.3595540490009373,"score_spread":0.1965742358874696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011768837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05221698,0.0032897012,0.46896178,0.004362575,0.001875034,0.003208198,0.011661535,0.0142094055,0.4402149],"genre_scores_gemma":[0.40417898,0.010161454,0.30748957,0.0027943172,0.0011287328,0.0053452835,0.044431806,0.0021956537,0.22227421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908257,0.00014848965,0.00009338886,0.00006538147,0.00046451922,0.00014566176],"domain_scores_gemma":[0.99909604,0.00017087178,0.00007010464,0.00020979338,0.00037865186,0.00007448558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123827,0.0005841216,0.00039739793,0.0014655635,0.001168704,0.0025075257,0.00090920937,0.0014259979,0.014497733],"category_scores_gemma":[0.0017929606,0.00027954282,0.0002221883,0.0015244975,0.00064081885,0.001538164,0.00066925545,0.0010444527,0.005981274],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006764714,0.0003779283,0.0016991073,0.0008866079,0.000024835408,0.00044054366,0.0004095376,0.020892214,0.060747936,0.53145623,0.14913271,0.23325588],"study_design_scores_gemma":[0.00009560913,0.00048397278,0.001322247,0.0003934866,0.000023751694,0.00039952397,0.00021276035,0.032210603,0.033705767,0.023352796,0.9077439,0.00005576108],"about_ca_topic_score_codex":0.007717241,"about_ca_topic_score_gemma":0.008276748,"teacher_disagreement_score":0.014497733,"about_ca_system_score_codex":0.0019539923,"about_ca_system_score_gemma":0.0024983515,"threshold_uncertainty_score":0.048499703},"labels":[],"label_agreement":null},{"id":"W7020839418","doi":"","title":"A mobile device based identity validation system for online social networks","year":2012,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Android (operating system); Identity (music); Mobile device; Identity theft; Social network (sociolinguistics); Mobile apps; Mobile computing","score_opus":0.03104185172084682,"score_gpt":0.2781090209486405,"score_spread":0.24706716922779368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020839418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1404656,0.000796981,0.7305741,0.00076349196,0.00047635566,0.002693984,0.0011390724,0.09752629,0.02556413],"genre_scores_gemma":[0.82408774,0.00032201072,0.1433496,0.0004829348,0.00013443144,0.00069821114,0.0014140543,0.0010384115,0.028472714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874914,0.0003510214,0.00012071778,0.00020683015,0.0004330906,0.0001391275],"domain_scores_gemma":[0.9967018,0.00070626964,0.0002939028,0.0015145399,0.0005368954,0.0002465167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019744649,0.0005784654,0.0007075439,0.0009572396,0.00107458,0.0015804162,0.0014069484,0.0011338503,0.007825149],"category_scores_gemma":[0.0053627416,0.00047444797,0.00034178558,0.0004591514,0.00065357663,0.0027478742,0.0023237504,0.0013042942,0.0037768108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038694683,0.0011672854,0.019648496,0.0007139835,0.0001720474,0.0024571982,0.002670952,0.008277999,0.13736945,0.06589422,0.0701319,0.68762714],"study_design_scores_gemma":[0.00067056937,0.002435989,0.01814588,0.0004340063,0.00034507786,0.0039395243,0.0006188182,0.34985518,0.2464693,0.019572994,0.35699728,0.0005153751],"about_ca_topic_score_codex":0.0008128665,"about_ca_topic_score_gemma":0.0006185076,"teacher_disagreement_score":0.007825149,"about_ca_system_score_codex":0.00070952164,"about_ca_system_score_gemma":0.0008801755,"threshold_uncertainty_score":0.026177704},"labels":[],"label_agreement":null},{"id":"W7030365808","doi":"","title":"Next Generation Space Internet (NGSI) - CCSDS 730.0-G-1-S","year":2003,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Space and Astronautical Science; Nuclear Physics; Canadian Space Agency; Indian Space Research Organisation; U.S. Geological Survey; National Space Organization; National Oceanic and Atmospheric Administration; Korea Aerospace Research Institute; European Organization for the Exploitation of Meteorological Satellites; European Space Agency; Agenzia Spaziale Italiana; Commonwealth Scientific and Industrial Research Organisation; Centre National d’Etudes Spatiales; National Aeronautics and Space Administration","keywords":"The Internet; Scope (computer science); Principal (computer security); Satellite; Internet access; Software; Internet Connection Sharing; Network topology; Spacecraft","score_opus":0.1780114406969617,"score_gpt":0.35230530126971304,"score_spread":0.17429386057275134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030365808","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02340747,0.0069817984,0.2263998,0.0064090523,0.0028062484,0.0019542095,0.004463149,0.023784874,0.7037934],"genre_scores_gemma":[0.25295135,0.016114341,0.26925516,0.0044429707,0.0017445806,0.001838486,0.024579762,0.0028250562,0.42624834],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940765,0.00009548279,0.000033908018,0.000058762274,0.0002753606,0.00012885797],"domain_scores_gemma":[0.99923813,0.000056455596,0.00004877296,0.00018560218,0.0003336958,0.00013751005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082597305,0.00042244708,0.00031196975,0.001872494,0.001090908,0.0026239967,0.0010162712,0.0018459071,0.021547092],"category_scores_gemma":[0.0013345407,0.00023519344,0.0002701861,0.0016311854,0.0007540186,0.0021008432,0.0011625832,0.0011113939,0.015095744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023209992,0.00017526708,0.0013675906,0.00035277204,0.000022361688,0.00037111933,0.00022794135,0.0066625155,0.014682185,0.33474168,0.23413344,0.4070311],"study_design_scores_gemma":[0.000026771839,0.00010538148,0.0005273893,0.00010243138,0.000008892355,0.0002335931,0.00006226521,0.005940884,0.003903936,0.011750073,0.97731316,0.000025275205],"about_ca_topic_score_codex":0.008559096,"about_ca_topic_score_gemma":0.0063008345,"teacher_disagreement_score":0.021547092,"about_ca_system_score_codex":0.0024717483,"about_ca_system_score_gemma":0.0033004782,"threshold_uncertainty_score":0.07208216},"labels":[],"label_agreement":null},{"id":"W7035784967","doi":"","title":"Arbitragem de investimentos e o meio ambiente: reflexões sobre o caso Ethyl Corporation v. Canadá = Investment arbitration and the environment: reflections on the Ethyl Corporation v. Canada case","year":2019,"lang":"pt","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Corporation; Investment (military); Arbitration; Investment arbitration","score_opus":0.03380630315875,"score_gpt":0.24230218768268336,"score_spread":0.20849588452393336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035784967","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1699753,0.011466306,0.0062550968,0.138835,0.00045848254,0.00007453927,0.0002746215,0.000052118397,0.67260855],"genre_scores_gemma":[0.9525577,0.002724819,0.0007913202,0.010371196,0.00010555632,0.000025554693,0.0000283046,0.000028655402,0.033366833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99125016,0.0013688168,0.00018827383,0.00080993824,0.002888103,0.003494815],"domain_scores_gemma":[0.99246615,0.0037142287,0.00074132526,0.00037755034,0.0018208732,0.0008797496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060161715,0.0002395612,0.00045643488,0.00088620756,0.009357265,0.019882446,0.0018924061,0.0055750455,0.0071290187],"category_scores_gemma":[0.012561979,0.00035782196,0.00044714828,0.002443581,0.014980563,0.0045014066,0.0052013877,0.006590802,0.0002490133],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027014092,0.000009362139,0.0023103415,0.000032874657,0.000014053365,0.00031401828,0.0051165638,0.00052690424,0.00015844996,0.9722038,0.011770735,0.007515911],"study_design_scores_gemma":[0.00008783743,0.00004290128,0.015335035,0.00059479906,0.000107319865,0.00049413455,0.03892282,0.0023609719,0.00155424,0.23111117,0.7092444,0.00014426502],"about_ca_topic_score_codex":0.9107257,"about_ca_topic_score_gemma":0.9475154,"teacher_disagreement_score":0.08927429,"about_ca_system_score_codex":0.049149193,"about_ca_system_score_gemma":0.07779769,"threshold_uncertainty_score":0.35660404},"labels":[],"label_agreement":null},{"id":"W7039806047","doi":"","title":"Nieporte, Alberta (Birth, 1905-07-03)","year":2012,"lang":"en","type":"other","venue":"Spectrum Research Repository (Concordia University)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Natural (archaeology); Work (physics); Government (linguistics); Identification (biology)","score_opus":0.030396016828392367,"score_gpt":0.255097924256817,"score_spread":0.2247019074284246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039806047","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027802843,0.0025019015,0.0004459609,0.0017083392,0.0011651956,0.000043507116,0.0070749396,0.0003960739,0.9838839],"genre_scores_gemma":[0.002227345,0.0005301585,0.00015880317,0.000103927385,0.00001713338,0.0000036215074,0.0006410824,0.00006872666,0.99624926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996606,0.000009442384,0.0000077007935,0.000082551815,0.0001253256,0.00011434263],"domain_scores_gemma":[0.99945146,0.000032938955,0.000018351464,0.00003694054,0.0002613225,0.0001990746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003223987,0.0006985255,0.0006949204,0.0010615764,0.003776531,0.002887237,0.0010956946,0.0015062848,0.69668436],"category_scores_gemma":[0.0006647045,0.00027375325,0.00031061258,0.0019488911,0.0006697939,0.0007328109,0.0011021112,0.0014458363,0.40019763],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024746725,0.000078138546,0.002013843,0.0001794591,0.000016001834,0.0006295946,0.00025367158,0.0005010921,0.0011320714,0.013573841,0.7984767,0.18289809],"study_design_scores_gemma":[0.000009093258,0.000015560106,0.002238372,0.00006621693,0.000004036352,0.00012260278,0.00019117304,0.00007116959,0.00032496778,0.00040334987,0.99654573,0.00000777838],"about_ca_topic_score_codex":0.43130907,"about_ca_topic_score_gemma":0.77938914,"teacher_disagreement_score":0.69668436,"about_ca_system_score_codex":0.0062136822,"about_ca_system_score_gemma":0.0063889683,"threshold_uncertainty_score":0.8575972},"labels":[],"label_agreement":null},{"id":"W7106003782","doi":"10.1109/taes.2025.3633210","title":"Advancing Lunar Communication Through Interdomain Space Networks and Dynamic Orchestration","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Robustness (evolution); Telecommunications network; NASA Deep Space Network; Reliability (semiconductor); Dynamism; Testbed; Architecture; Space exploration; Orchestration","score_opus":0.006578868379275213,"score_gpt":0.24480366218757324,"score_spread":0.23822479380829803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106003782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14602897,0.0012132329,0.82892513,0.0008172638,0.000099513316,0.000041442356,0.00006860936,0.0005629705,0.022242853],"genre_scores_gemma":[0.9546971,0.00057967566,0.042304993,0.0000587639,0.000035056717,0.000029012997,0.000042958898,0.000021319765,0.0022312573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997402,0.000080638776,0.000008981757,0.000049852817,0.000068803245,0.00005155691],"domain_scores_gemma":[0.99970514,0.000072955365,0.000056001136,0.00007832352,0.00005406815,0.000033416567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003355169,0.00024365785,0.00016625646,0.0003464803,0.0005277523,0.0013688776,0.000718245,0.0004189013,0.0008945049],"category_scores_gemma":[0.00081440114,0.00010635349,0.00013418424,0.00046444964,0.00067158433,0.0014143727,0.0014050176,0.0005587166,0.00023529211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009062895,0.000041402123,0.003242511,0.00009478342,0.00004538174,0.00031396907,0.00048690292,0.62759733,0.026901944,0.23476452,0.0024606213,0.10395992],"study_design_scores_gemma":[0.0000075488765,0.000069526315,0.0012326549,0.000023610128,0.000022057213,0.00019567335,0.00048383733,0.8753651,0.0056900354,0.090796,0.026090482,0.000023494744],"about_ca_topic_score_codex":0.00145995,"about_ca_topic_score_gemma":0.00201879,"teacher_disagreement_score":0.00145995,"about_ca_system_score_codex":0.0005781697,"about_ca_system_score_gemma":0.0005291934,"threshold_uncertainty_score":0.0041949153},"labels":[],"label_agreement":null},{"id":"W71078055","doi":"","title":"YaKit: a locality based messaging system using iCon overlay","year":2011,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Locality; Premise; Context (archaeology); World Wide Web; Set (abstract data type); Overlay; Human–computer interaction; Icon; Key (lock); Architecture; Multimedia; Computer security","score_opus":0.2880823228437382,"score_gpt":0.4044995577841333,"score_spread":0.11641723494039513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71078055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09731268,0.0006755939,0.7264619,0.0009181979,0.00037269885,0.0008906064,0.0006428699,0.14913951,0.02358596],"genre_scores_gemma":[0.7041509,0.00048871734,0.2531311,0.00057384494,0.0002702544,0.0007838267,0.0017408704,0.0024367336,0.036423746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989361,0.00024458708,0.00008594481,0.00019879139,0.00040776044,0.00012674485],"domain_scores_gemma":[0.99803525,0.00044783676,0.00022070989,0.00060827256,0.00030775758,0.00038015202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001217135,0.0008596837,0.00079677126,0.0012378608,0.0015618615,0.0020741196,0.0027777003,0.0014399622,0.0051105134],"category_scores_gemma":[0.003102402,0.0005844435,0.00038052408,0.0007541587,0.00064318517,0.0049541667,0.0040672356,0.001397003,0.002658508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004320017,0.0012879764,0.010861971,0.001154451,0.0004113304,0.0029545308,0.0061841533,0.023755677,0.18471642,0.06984481,0.09901019,0.59549844],"study_design_scores_gemma":[0.00057809433,0.0017080258,0.006936669,0.00021966136,0.00039685622,0.0018645165,0.0016836345,0.56193995,0.105119705,0.03261949,0.28627658,0.00065687054],"about_ca_topic_score_codex":0.0037677148,"about_ca_topic_score_gemma":0.0033435663,"teacher_disagreement_score":0.0051105134,"about_ca_system_score_codex":0.0006735454,"about_ca_system_score_gemma":0.00083201565,"threshold_uncertainty_score":0.01709634},"labels":[],"label_agreement":null},{"id":"W7108227258","doi":"10.1109/tmc.2025.3638816","title":"LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Routing protocol; Routing (electronic design automation); Reinforcement learning; Transmission (telecommunications); Protocol (science); Adaptive routing; Dynamic Source Routing; Replication (statistics); Upper and lower bounds; Hierarchical routing","score_opus":0.04299475508212949,"score_gpt":0.2975966587367513,"score_spread":0.25460190365462176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108227258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022345372,0.00029935385,0.97352684,0.00019301673,0.000052291925,0.00007917947,0.000027779211,0.0012425309,0.0022337069],"genre_scores_gemma":[0.81088597,0.00026354758,0.18447046,0.00022385303,0.000045895205,0.00023983768,0.0000769682,0.00008793037,0.003705483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997614,0.0000800327,0.0000108412105,0.000043172757,0.000059323946,0.00004516301],"domain_scores_gemma":[0.99951255,0.00026125347,0.00008514831,0.000034842105,0.00006817213,0.000038021455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865103,0.0004962225,0.0007252576,0.00035646206,0.00034360992,0.0004984059,0.0012928451,0.0006981076,0.0010149794],"category_scores_gemma":[0.001135642,0.00021774572,0.0003262628,0.00024380752,0.00050603796,0.0005865196,0.00076843647,0.00070214196,0.00020236624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078256475,0.000107152395,0.0005895232,0.000044516284,0.000049538234,0.0000842996,0.00005616652,0.91858476,0.0019258959,0.0062456275,0.0015440978,0.070690095],"study_design_scores_gemma":[0.000008913422,0.00002907226,0.000035364388,0.0000019489464,0.0000036059535,0.000012726822,0.0000043421583,0.9984433,0.00022380354,0.0008462512,0.00038787123,0.0000027853598],"about_ca_topic_score_codex":0.0048050988,"about_ca_topic_score_gemma":0.004196561,"teacher_disagreement_score":0.0048050988,"about_ca_system_score_codex":0.00053575495,"about_ca_system_score_gemma":0.0010111791,"threshold_uncertainty_score":0.009554267},"labels":[],"label_agreement":null},{"id":"W7124321402","doi":"10.65109/isxz3795","title":"RASS: Risk-Aware Swarm Storage","year":2022,"lang":"","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Swarm behaviour; Routing (electronic design automation); Key (lock); Process (computing); Information sharing; Terrain","score_opus":0.017755162143471233,"score_gpt":0.22189040270470503,"score_spread":0.2041352405612338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124321402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12860954,0.0019651642,0.8481681,0.0011440858,0.00038953932,0.00029992964,0.00054172124,0.0074998857,0.011381983],"genre_scores_gemma":[0.90665364,0.0004247096,0.087165244,0.0001527066,0.00010778076,0.00014850656,0.00025913198,0.00016811927,0.0049201674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949944,0.00010646252,0.000042732132,0.00009833459,0.00018796868,0.00006491026],"domain_scores_gemma":[0.99793017,0.00054035016,0.00033056847,0.0007179157,0.0003157111,0.00016518093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094925234,0.0005864173,0.00088504935,0.00060251803,0.00092034263,0.0011311005,0.0023117561,0.00069303095,0.0030255588],"category_scores_gemma":[0.0030832083,0.0002715023,0.00039358475,0.0006373585,0.0008648847,0.0023345228,0.002633711,0.0005902036,0.0009055419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009977586,0.00027575847,0.0037490833,0.00041108334,0.00018137519,0.00072928757,0.00084046146,0.5639141,0.04681031,0.08009242,0.025485925,0.27651238],"study_design_scores_gemma":[0.00007736566,0.00024226775,0.0006936055,0.000027164038,0.00004268123,0.00035731,0.00012509097,0.9365435,0.011573836,0.036479864,0.013777868,0.0000594395],"about_ca_topic_score_codex":0.00179761,"about_ca_topic_score_gemma":0.0018255501,"teacher_disagreement_score":0.0030255588,"about_ca_system_score_codex":0.00077698275,"about_ca_system_score_gemma":0.0009189966,"threshold_uncertainty_score":0.010121524},"labels":[],"label_agreement":null},{"id":"W7130717935","doi":"10.1109/swc65939.2025.00154","title":"AquaFed: Leveraging Federated Learning for Real-Time Schistosomiasis Prevention Through Water Quality Monitoring","year":2025,"lang":"","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mastercard Foundation","keywords":"Software deployment; Scalability; Water quality; Wireless sensor network; Public health; Work (physics); Intervention (counseling)","score_opus":0.05839301682352087,"score_gpt":0.33170861397673607,"score_spread":0.2733155971532152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7130717935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28379288,0.0007215022,0.7024998,0.00060118735,0.00024101228,0.00013052934,0.00047066924,0.007185317,0.004357128],"genre_scores_gemma":[0.97762454,0.00006704462,0.021155968,0.00010190523,0.00001283448,0.000034237815,0.00017535471,0.000017306327,0.00081076584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997999,0.000037749014,0.000011569813,0.00007355705,0.000040037914,0.00003721406],"domain_scores_gemma":[0.99959093,0.00014212022,0.00005607164,0.00007469166,0.00009447027,0.000041659605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055002805,0.0004428768,0.00042775518,0.00030147796,0.0002695,0.00043382854,0.0008852928,0.0004583695,0.0006480656],"category_scores_gemma":[0.0015365419,0.00013407451,0.00020178397,0.00018466884,0.00031761144,0.0009518834,0.0008442976,0.0003957551,0.00013779908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064040313,0.00047471595,0.012994308,0.00015766647,0.00013654176,0.00036736802,0.00013101984,0.68044335,0.025516665,0.002817689,0.0043386654,0.2719817],"study_design_scores_gemma":[0.000024959307,0.00012038259,0.0011905666,0.0000071826266,0.000014763014,0.000044197885,0.000024456225,0.99145937,0.0041237804,0.0018131022,0.0011660283,0.000011131505],"about_ca_topic_score_codex":0.003959217,"about_ca_topic_score_gemma":0.0047712377,"teacher_disagreement_score":0.003959217,"about_ca_system_score_codex":0.00036492877,"about_ca_system_score_gemma":0.00063350383,"threshold_uncertainty_score":0.007872343},"labels":[],"label_agreement":null}]}