{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011927093,0.025919393,0.97031224,0.000044728888,0.00052731717,0.00090050075,0.0000056050008,0.00032588537,0.0019524125],"genre_scores_gemma":[0.7641336,0.0030114695,0.22771063,0.0004927977,0.0016244532,0.0005840788,0.0001734204,0.00026693175,0.0020026646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746126,0.000017313136,0.0006209121,0.0007220368,0.00033258917,0.00084586645],"domain_scores_gemma":[0.9976931,0.0011280996,0.00017008277,0.0006440101,0.00014686675,0.00021780597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044534967,0.0005509705,0.0006373249,0.0002747873,0.00007261894,0.00008942785,0.0006682806,0.0008851783,0.000015162148],"category_scores_gemma":[0.00006650904,0.00055161497,0.00022559175,0.0002565373,0.000026982554,0.00025132837,0.00013964277,0.0010706338,0.000004259725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009245895,0.000021798818,9.1505166e-7,0.000031097763,0.000017348413,0.000007387445,0.000030090716,0.5434387,0.000008201845,0.016367994,0.00005744843,0.4400098],"study_design_scores_gemma":[0.0002675668,0.00013545601,0.0000030743938,0.00009804791,0.00003167587,0.000028683386,4.3368196e-8,0.95207894,0.000023961615,0.038848992,0.0079306895,0.00055285665],"about_ca_topic_score_codex":0.0000018099545,"about_ca_topic_score_gemma":0.0000032208332,"teacher_disagreement_score":0.76412165,"about_ca_system_score_codex":0.00035552314,"about_ca_system_score_gemma":0.0001063453,"threshold_uncertainty_score":0.9996935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008801028,0.0021568849,0.9820972,0.001584959,0.00080260506,0.00050145335,0.0000032342343,0.00017202506,0.012672858],"genre_scores_gemma":[0.6580184,0.0010598849,0.33796155,0.0018229688,0.0003336306,0.000036644647,0.00001282642,0.000038549773,0.0007155551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755424,0.000069079484,0.00041285699,0.0009255456,0.0005106403,0.0005276374],"domain_scores_gemma":[0.99585974,0.0006903819,0.00023571689,0.0028711688,0.00017238918,0.00017061736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000990618,0.00038624072,0.00042137317,0.00021351755,0.0005046187,0.0005958005,0.004921642,0.00022832323,0.000010382266],"category_scores_gemma":[0.000013388408,0.0002740736,0.00007635209,0.0003936522,0.001868855,0.00028416805,0.002511702,0.00086118735,0.000020546619],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018712204,0.000024828285,0.0001657612,0.00001070253,0.000008779037,0.000023181712,0.00038685594,0.00030317128,8.4244135e-7,0.03618997,0.000040467898,0.9628436],"study_design_scores_gemma":[0.0001346064,0.00016189562,0.00026001866,0.00011794704,0.000006771642,0.00014049331,1.4043677e-7,0.88053274,0.0000023731038,0.112162925,0.0060778353,0.00040227227],"about_ca_topic_score_codex":0.00003712127,"about_ca_topic_score_gemma":0.00017285146,"teacher_disagreement_score":0.9624413,"about_ca_system_score_codex":0.00006341195,"about_ca_system_score_gemma":0.000347264,"threshold_uncertainty_score":0.99997115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024893552,0.0013809745,0.9840363,0.003552761,0.0011580408,0.000055893765,0.0000014617849,0.000022564038,0.0073026004],"genre_scores_gemma":[0.9880106,0.0005153862,0.010516444,0.0002591766,0.00010003907,0.0000025123852,0.0000028086222,0.0000058288233,0.00058723346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984551,0.00022612426,0.0006192622,0.00010633609,0.0004941722,0.0000989911],"domain_scores_gemma":[0.9979099,0.0002782866,0.0005778877,0.0004594765,0.00067286816,0.00010158116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011875372,0.00009288511,0.00018950916,0.00024580635,0.0000637533,0.0002868338,0.002008892,0.000039041894,0.0000067674555],"category_scores_gemma":[0.000022154796,0.00008024588,0.000057669335,0.00014558597,0.000066169654,0.0004792247,0.00031601771,0.00021434017,0.00001133812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002163237,0.000050590323,0.0010058276,0.000004956956,0.00010035394,0.0000111723875,0.000541169,0.0007192267,0.00001865317,0.13511339,0.00056334573,0.86184967],"study_design_scores_gemma":[0.0002125725,0.000051836756,0.0011300126,0.0002116124,0.00000815984,0.00033026809,0.000088447385,0.94133914,0.000011955047,0.009310432,0.047194064,0.00011148375],"about_ca_topic_score_codex":0.00009891155,"about_ca_topic_score_gemma":0.000033272878,"teacher_disagreement_score":0.9855212,"about_ca_system_score_codex":0.000060019167,"about_ca_system_score_gemma":0.00006665272,"threshold_uncertainty_score":0.37330544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70704657,0.000024237903,0.27043805,0.00016704408,0.00074533577,0.00010632301,0.0000014197387,0.000838946,0.020632066],"genre_scores_gemma":[0.98594457,0.0000031128363,0.013327462,0.00010145358,0.00007249806,0.000002019643,0.0000018834057,0.000007639704,0.0005393652],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990389,0.00001934954,0.00023589836,0.0002361402,0.00021049692,0.0002592462],"domain_scores_gemma":[0.99918765,0.000069477595,0.00009449607,0.00042778507,0.00008846906,0.0001321331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001800727,0.000109299996,0.00017514007,0.000053980868,0.000076835,0.00008128698,0.00046064533,0.00009206905,0.00011067066],"category_scores_gemma":[0.0000074983723,0.00009442438,0.000051930332,0.00018770494,0.00003509228,0.00031700492,0.000115329196,0.00017728757,0.00002830065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083944644,0.0005773641,0.027831208,0.00022274499,0.00017217753,0.0005857888,0.0027195937,0.00036939897,0.3834262,0.2117472,0.009286443,0.36297795],"study_design_scores_gemma":[0.00039904666,0.000029746507,0.015329402,0.00002470086,0.000005608873,0.000047792444,0.000013622122,0.96995544,0.013288553,0.0002493257,0.00049711234,0.0001596694],"about_ca_topic_score_codex":0.000032317334,"about_ca_topic_score_gemma":0.00002341652,"teacher_disagreement_score":0.969586,"about_ca_system_score_codex":0.000007214822,"about_ca_system_score_gemma":0.000062806874,"threshold_uncertainty_score":0.38505143},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08663589,0.008395087,0.9033064,0.000114664,0.00039635913,0.00070625776,0.000016160711,0.00022501858,0.0002041428],"genre_scores_gemma":[0.9376988,0.002690447,0.05862448,0.00022013597,0.0002980973,0.00015821341,0.00025115983,0.000030629697,0.000028081384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779856,0.00019069118,0.00063029694,0.0005316978,0.00016753832,0.0006812212],"domain_scores_gemma":[0.99442625,0.0009766611,0.0002174999,0.0039618094,0.00014220377,0.00027555303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015246277,0.00026071645,0.00040116068,0.00008492495,0.0011406528,0.00020280246,0.003259046,0.00015871967,0.0000021560575],"category_scores_gemma":[0.000008169662,0.00025521478,0.00007330494,0.00028765382,0.00013331333,0.00069433503,0.00498042,0.00037899785,0.0000033003137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005935183,0.00022253495,0.0010456791,0.0000326334,0.000028872584,4.694977e-7,0.0008033611,0.019665606,0.000054720178,0.013262657,0.00033630437,0.9645412],"study_design_scores_gemma":[0.00034520752,0.000047078895,0.000024049943,0.00011688545,0.000026215168,0.000023481598,0.00025332134,0.9922376,0.0000022857864,0.00016862965,0.006446425,0.00030876798],"about_ca_topic_score_codex":0.00006843489,"about_ca_topic_score_gemma":0.000009765875,"teacher_disagreement_score":0.972572,"about_ca_system_score_codex":0.000037205584,"about_ca_system_score_gemma":0.000059210077,"threshold_uncertainty_score":0.99999},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062590244,0.00006075417,0.9187725,0.0004049168,0.00025532665,0.000029871626,8.5148747e-7,0.00017537651,0.0796745],"genre_scores_gemma":[0.9811135,0.000008903369,0.005645665,0.001145006,0.00018567497,0.0000048998127,0.000024547562,0.000005510267,0.011866278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991791,0.000018187895,0.00015970408,0.00024819982,0.00019476042,0.00019999874],"domain_scores_gemma":[0.9994767,0.000030773557,0.000043968677,0.0003487296,0.00003991629,0.000059926904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007076882,0.00009381452,0.000084218926,0.000039376966,0.000067109606,0.00010184976,0.00031926043,0.000059645332,0.00011937641],"category_scores_gemma":[1.8941257e-7,0.00008103874,0.000033935787,0.00014906203,0.000018643881,0.00022957494,0.000086376676,0.00004425575,0.00006366881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030502563,0.00007739628,0.00053782586,0.0000037191537,0.0000073521273,0.00005072857,0.000024588117,0.0001748109,0.00009756886,0.5237882,0.20021975,0.27501503],"study_design_scores_gemma":[0.00014662495,0.000017934772,0.00076907227,0.000004996956,0.0000028775216,0.000013349674,0.0000023799964,0.9402281,0.000082384155,0.011344955,0.047248814,0.000138519],"about_ca_topic_score_codex":0.0003939065,"about_ca_topic_score_gemma":0.000063594394,"teacher_disagreement_score":0.9804876,"about_ca_system_score_codex":0.000017557953,"about_ca_system_score_gemma":0.000037736354,"threshold_uncertainty_score":0.3304664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063235047,0.0097119985,0.9777764,0.0033809715,0.0010600869,0.0008718912,0.00003230068,0.00007758599,0.0007652709],"genre_scores_gemma":[0.9499602,0.042910792,0.00096237013,0.00553042,0.00012998417,0.00020100476,0.00020545741,0.000012177069,0.00008762589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983894,0.000119285556,0.00057901145,0.00018123699,0.0004863585,0.0002446891],"domain_scores_gemma":[0.99781895,0.00027603467,0.00048176642,0.00019255372,0.0010531588,0.0001775582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011008518,0.00020806391,0.00020003448,0.0003380852,0.00042118912,0.0007551884,0.00062487304,0.00009385851,0.000043954235],"category_scores_gemma":[0.00006931931,0.00014758464,0.00011358404,0.0003809529,0.00019874603,0.001919423,0.00016280006,0.00023045673,0.000008212987],"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.00007994915,0.00008634611,0.0018290392,0.00016174167,0.00041482635,0.0000016555653,0.006369802,0.00007906052,0.000064575506,0.35468403,0.11462063,0.52160835],"study_design_scores_gemma":[0.0026195277,0.0005800785,0.0012426212,0.00082753046,0.00017365286,0.0005398711,0.0033553836,0.4606403,0.00014636506,0.10585022,0.42313847,0.00088598],"about_ca_topic_score_codex":0.000025739213,"about_ca_topic_score_gemma":0.0000035094974,"teacher_disagreement_score":0.97681403,"about_ca_system_score_codex":0.000017536573,"about_ca_system_score_gemma":0.000042106538,"threshold_uncertainty_score":0.7282299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012526626,0.00030296668,0.96964246,0.0005755495,0.00096284354,0.00040978665,0.000017373053,0.00061022374,0.014952155],"genre_scores_gemma":[0.9954368,0.000020608684,0.001075241,0.00068827416,0.0004389275,0.00007028063,0.000103516584,0.000036456735,0.0021299212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969366,0.00011826796,0.0006900313,0.00081312953,0.00053576246,0.00090616004],"domain_scores_gemma":[0.99871475,0.00011090679,0.00022135237,0.0003943877,0.00014224017,0.00041639764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008973665,0.00035879185,0.00054599973,0.0001556054,0.00037800858,0.00040288107,0.0012009811,0.00032688308,0.00008445979],"category_scores_gemma":[0.000008386288,0.00036304357,0.00013941065,0.0008194704,0.000118096345,0.00051281985,0.00049271644,0.0004824505,0.00004025737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005449472,0.000724662,0.00082221976,0.00003860061,0.000080993246,0.00053515285,0.0031185332,0.0038211849,0.000027650376,0.021831794,0.335299,0.6336457],"study_design_scores_gemma":[0.0009488202,0.00009443646,0.00015815899,0.000026198304,0.00001737251,0.00002663672,0.00048055992,0.98971546,0.0000016864913,0.00048674666,0.0075407377,0.00050316757],"about_ca_topic_score_codex":0.000054813365,"about_ca_topic_score_gemma":0.0000505193,"teacher_disagreement_score":0.9858943,"about_ca_system_score_codex":0.00025461733,"about_ca_system_score_gemma":0.00029041205,"threshold_uncertainty_score":0.99988216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026614778,0.00011515155,0.9938059,0.00015940762,0.0003047219,0.00027301573,0.000004695144,0.0001977481,0.0024778997],"genre_scores_gemma":[0.98107165,0.000055954013,0.01771513,0.0009234065,0.00007330621,0.000059780134,0.000022160144,0.000016829314,0.000061752246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979629,0.00008288309,0.0007246455,0.00032099578,0.00038894312,0.0005196584],"domain_scores_gemma":[0.99868953,0.00016646578,0.000309348,0.00023330556,0.00024348842,0.00035788823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083432393,0.00032224128,0.00033950314,0.00030014277,0.00047372933,0.0007294306,0.00028766686,0.00018282245,0.000014786131],"category_scores_gemma":[0.000003008891,0.00027589317,0.000056024095,0.000817881,0.00010393763,0.004858059,0.000010328045,0.0005515724,0.000006579067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010740058,0.00004002111,0.000041218278,0.00001868784,0.000016238066,0.000015479647,0.0005830392,0.8392237,5.572438e-7,0.00035356774,0.00015608688,0.15944403],"study_design_scores_gemma":[0.0011605165,0.00020116271,0.00005855543,0.0003436646,0.000035021698,0.000095536685,0.00017626007,0.99699414,0.000008252633,0.00009945389,0.0004563648,0.00037109476],"about_ca_topic_score_codex":0.00002964223,"about_ca_topic_score_gemma":0.000010314844,"teacher_disagreement_score":0.9784102,"about_ca_system_score_codex":0.00009557322,"about_ca_system_score_gemma":0.0002841932,"threshold_uncertainty_score":0.9999693},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58506215,0.000019527011,0.4128897,0.000028413942,0.00005372385,0.00007247995,0.0000013372531,0.000009529951,0.00186316],"genre_scores_gemma":[0.9993001,0.00005211661,0.00042252502,0.000019503963,0.000017891552,0.000003347988,7.2054104e-7,0.0000020516604,0.00018171663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993719,0.0000061907767,0.00019651861,0.0001530495,0.00021385623,0.000058472273],"domain_scores_gemma":[0.9995685,0.000041609477,0.00011224881,0.0000941751,0.00015455106,0.000028920122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108605076,0.000056880264,0.00013806198,0.00006063725,0.00004631109,0.000024862642,0.00017443998,0.000032897497,0.0000015027786],"category_scores_gemma":[0.0000012993468,0.000037464426,0.000033264958,0.00022413723,0.000044735425,0.00012774896,0.00008682712,0.00003677934,1.06575115e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013672217,0.000056798875,0.021722784,0.000028308566,0.0001275088,6.7633425e-7,0.0010198911,0.9649316,0.00017923987,0.00933458,0.000038801198,0.0025461284],"study_design_scores_gemma":[0.00010357164,0.000034409608,0.0004361747,0.000019103449,0.000026300884,0.000004262588,0.000042480897,0.99915874,0.00006017977,0.00006253323,0.000011162863,0.000041057217],"about_ca_topic_score_codex":0.00005705945,"about_ca_topic_score_gemma":0.0000010921704,"teacher_disagreement_score":0.414238,"about_ca_system_score_codex":0.000006931407,"about_ca_system_score_gemma":0.000011625833,"threshold_uncertainty_score":0.15277548},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002867419,0.00016210525,0.9819071,0.00019333772,0.0003770601,0.00019533608,0.0000011276977,0.00014630011,0.014150157],"genre_scores_gemma":[0.9503303,0.000013803853,0.048458304,0.00032846056,0.00018557567,0.000010292385,0.00003845163,0.0000064629658,0.00062835193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988897,0.00005701984,0.0002305389,0.0003722112,0.00019776335,0.00025275623],"domain_scores_gemma":[0.99881226,0.00008047047,0.00006185923,0.0008472751,0.000063499036,0.00013461767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074512826,0.000090550995,0.000119440825,0.00004721533,0.00003698848,0.00012472026,0.0007999966,0.00006166812,0.000009309288],"category_scores_gemma":[0.00001581063,0.000076603166,0.000010851377,0.0003243341,0.00002116036,0.00060783286,0.00056658936,0.00013366238,0.000037241527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015452366,0.00012362377,0.0065731606,0.000008533487,0.000008663855,0.00018325982,0.00053932646,0.02409303,0.000009599509,0.008087923,0.030957622,0.9293998],"study_design_scores_gemma":[0.00023127344,0.00003753363,0.000107387845,0.000014351081,0.0000016621925,0.000018413646,0.00007297733,0.9954095,0.0000038957637,0.00031558407,0.0036746892,0.0001127542],"about_ca_topic_score_codex":0.000049865637,"about_ca_topic_score_gemma":0.000025959851,"teacher_disagreement_score":0.97131646,"about_ca_system_score_codex":0.00002589776,"about_ca_system_score_gemma":0.00010415584,"threshold_uncertainty_score":0.31237864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32246685,0.0003925319,0.6697967,0.0014105914,0.00048827403,0.0007622307,0.000016295571,0.00008935376,0.004577135],"genre_scores_gemma":[0.9989071,0.000049547845,0.00045058876,0.00036104413,0.00012016622,0.000056407418,0.0000046278383,0.000008648724,0.000041852454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969874,0.0002880708,0.0003419684,0.0007419076,0.0008797178,0.0007609201],"domain_scores_gemma":[0.99803096,0.0006038279,0.00025979476,0.00016858475,0.00064427993,0.00029254635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033550768,0.00022456897,0.0002846609,0.00010722509,0.00096900924,0.0005050338,0.0005509184,0.00007702057,0.0000013884122],"category_scores_gemma":[0.00014547365,0.00017388994,0.000048433376,0.0012333958,0.0018756811,0.00092870055,0.0003886327,0.0003511818,0.000015296095],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021489714,0.00038991755,0.01805617,0.000017439206,0.000035358666,0.00040794746,0.008504731,0.0000544434,0.00013657256,0.022052683,0.00043735642,0.9496925],"study_design_scores_gemma":[0.002258325,0.00034759272,0.34564167,0.0004040018,0.000042430893,0.00009369459,0.004572633,0.6206321,0.00027356666,0.024947671,0.0000951264,0.0006911503],"about_ca_topic_score_codex":0.00004035887,"about_ca_topic_score_gemma":0.00023081228,"teacher_disagreement_score":0.9490013,"about_ca_system_score_codex":0.00010710515,"about_ca_system_score_gemma":0.0006289257,"threshold_uncertainty_score":0.7452934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005361101,0.00016777564,0.9813548,0.00069202256,0.00095640996,0.00020185977,0.000011894323,0.00021951184,0.016342137],"genre_scores_gemma":[0.25111446,0.0000103418915,0.7427599,0.0018551393,0.0007161834,0.00001683724,0.00009417525,0.000018193457,0.0034147908],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854183,0.000013484803,0.00025587116,0.0005367675,0.00022617841,0.00042588232],"domain_scores_gemma":[0.9979598,0.00014882236,0.00007998702,0.0013711223,0.00013016824,0.0003100854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835393,0.00014640142,0.00019186464,0.00004290541,0.00009823195,0.00023084885,0.0018215148,0.00009307793,0.000012103544],"category_scores_gemma":[0.000017155144,0.00012592268,0.000040641782,0.00023425848,0.000033694167,0.0006952486,0.0009917318,0.000120329016,0.000030070854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004016513,0.00015939253,0.00029579923,0.000013807387,0.00006665675,0.0000206251,0.00017560642,0.0008732369,0.00006580915,0.1459569,0.5919376,0.2603944],"study_design_scores_gemma":[0.00060281955,0.0000461262,0.00000527654,0.000013370249,0.000007339493,0.000025189054,0.000019818875,0.9375775,0.0000047383605,0.001070383,0.060446102,0.00018136259],"about_ca_topic_score_codex":0.00003138891,"about_ca_topic_score_gemma":0.000011446804,"teacher_disagreement_score":0.9367042,"about_ca_system_score_codex":0.000022959013,"about_ca_system_score_gemma":0.00016567219,"threshold_uncertainty_score":0.51349777},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039455146,0.000042197564,0.981396,0.0011750665,0.0005690275,0.00019368886,0.0000018420872,0.00026665872,0.015960932],"genre_scores_gemma":[0.8896848,0.0000015652665,0.105645,0.0021409583,0.0011895252,0.000026167196,0.00002052039,0.0000134360625,0.0012780132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988931,0.000047759906,0.00017132498,0.00032073958,0.00017815347,0.0003889512],"domain_scores_gemma":[0.9991481,0.00006851049,0.000053793094,0.00033675114,0.00011644525,0.0002764211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000380924,0.00013183072,0.00017234306,0.000037859332,0.00015713689,0.00018662198,0.00064613007,0.00012265907,0.000015077707],"category_scores_gemma":[0.00000357392,0.000106308005,0.00006722208,0.00016647222,0.0000362241,0.00021760656,0.00009251465,0.00012878925,0.000009406283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006928013,0.00011382105,0.00009088619,0.000006490203,0.00002519917,0.00002208148,0.0011479091,0.00610289,0.00001046054,0.1623658,0.16269882,0.66734636],"study_design_scores_gemma":[0.0005347883,0.00015418632,0.000023242706,0.0000022636361,0.000006139889,0.000011151585,0.00004211023,0.9449012,0.0000067722785,0.02171278,0.03243372,0.00017160944],"about_ca_topic_score_codex":0.000014153697,"about_ca_topic_score_gemma":0.000015931875,"teacher_disagreement_score":0.93879837,"about_ca_system_score_codex":0.00001894985,"about_ca_system_score_gemma":0.000122956,"threshold_uncertainty_score":0.43351147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028918957,0.000041427647,0.9460073,0.00033953186,0.00020947214,0.0001452664,0.0000016715857,0.000083802166,0.024252575],"genre_scores_gemma":[0.9901336,0.0000015379892,0.007480328,0.00008579069,0.000025274489,0.000004236638,0.000003822244,0.0000052147657,0.0022602128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992043,0.00004330836,0.00019130741,0.00018406416,0.00023605485,0.00014099329],"domain_scores_gemma":[0.99936306,0.00003136981,0.00008039834,0.0004368976,0.000058630307,0.000029620818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015011165,0.00008297207,0.000109512606,0.000023942188,0.000096083146,0.000062791274,0.000398683,0.00004438642,0.000008775759],"category_scores_gemma":[5.090535e-7,0.000045805824,0.000032415697,0.00019554609,0.000047885,0.00014774491,0.00007103559,0.00006842371,0.000010667004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039382387,0.00014814798,0.012050359,0.000105091654,0.000051523235,0.000058365535,0.0004591888,0.07024677,0.0004044198,0.88161206,0.012348046,0.022476627],"study_design_scores_gemma":[0.00018589672,0.00004596236,0.002535601,0.00003926299,0.0000064916408,0.000036717673,0.000055283766,0.99663264,0.000080631566,0.00006748976,0.00023302493,0.00008098419],"about_ca_topic_score_codex":0.00021144835,"about_ca_topic_score_gemma":0.00015955592,"teacher_disagreement_score":0.9612146,"about_ca_system_score_codex":0.000034307184,"about_ca_system_score_gemma":0.000075374264,"threshold_uncertainty_score":0.18679072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139554925,0.000032642274,0.98156965,0.0013843011,0.00076327584,0.00048406995,0.000005081972,0.00020459235,0.0016008961],"genre_scores_gemma":[0.9495962,0.0000028836912,0.047838736,0.0019954657,0.00023988998,0.00009399095,0.000019102077,0.000017495973,0.00019623169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977488,0.00013320429,0.00050472334,0.0006459617,0.00035087529,0.0006164728],"domain_scores_gemma":[0.99841523,0.00027742865,0.00011223339,0.00051327574,0.00041436238,0.00026744607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011645348,0.00024890873,0.0003942384,0.00008998737,0.00016747903,0.00015263715,0.0007576802,0.00025129222,0.000014030091],"category_scores_gemma":[0.000019740926,0.0002236273,0.00014487063,0.00041009573,0.00005766098,0.00034771615,0.0001985656,0.00020675873,0.000011995945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011852597,0.0015376993,0.0049004843,0.00013734458,0.000073675175,0.00033558163,0.002103034,0.10317236,0.000024680026,0.5561699,0.07097882,0.25938115],"study_design_scores_gemma":[0.0016663921,0.00011864761,0.000097731456,0.00001801263,0.000009231048,0.000005908199,0.00005001952,0.9730848,0.0000235262,0.023687236,0.00092945923,0.00030901685],"about_ca_topic_score_codex":0.00023841822,"about_ca_topic_score_gemma":0.0001470568,"teacher_disagreement_score":0.9356407,"about_ca_system_score_codex":0.00014395345,"about_ca_system_score_gemma":0.00057437207,"threshold_uncertainty_score":0.9119257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041136973,0.00030261412,0.93231165,0.0008174054,0.000064213215,0.000065262495,6.074413e-7,0.00007168179,0.025229618],"genre_scores_gemma":[0.9897093,0.000028444181,0.009438436,0.00026305497,0.000045106714,0.0000010598355,3.286809e-7,0.000002861769,0.0005114058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994724,0.00001692288,0.000120931436,0.0001466479,0.00012152823,0.00012160486],"domain_scores_gemma":[0.99968165,0.000010674521,0.000029532575,0.00015098881,0.000027797552,0.00009933044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012887514,0.000060797218,0.00008982118,0.00003348742,0.000052787025,0.000052874413,0.00017668762,0.000028710663,0.000026504593],"category_scores_gemma":[0.0000018593341,0.000044370317,0.0000138452715,0.0000723016,0.00003138789,0.00043328071,0.000085798754,0.000037573398,0.0000036257106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017835167,0.00009762064,0.00017678953,0.000032142765,0.000015169661,0.000012163696,0.0018044694,0.00011519295,0.0006724691,0.81668276,0.0007553134,0.17961806],"study_design_scores_gemma":[0.00015708378,0.00007514745,0.000044559536,0.000016106836,0.0000034343664,0.000012782205,0.00015962572,0.99527115,0.0010914049,0.0027206352,0.00035854155,0.00008951743],"about_ca_topic_score_codex":0.00001043056,"about_ca_topic_score_gemma":0.000008417504,"teacher_disagreement_score":0.995156,"about_ca_system_score_codex":0.00001606029,"about_ca_system_score_gemma":0.0000500169,"threshold_uncertainty_score":0.1809369},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03351376,0.00023307564,0.93066865,0.0002064574,0.0004660807,0.000039740065,1.750034e-7,0.00010145845,0.03477059],"genre_scores_gemma":[0.9804168,0.000021192745,0.017855715,0.00054504647,0.000078856894,0.0000015634407,6.131828e-7,0.0000032689975,0.00107698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944997,0.000013662395,0.00008425742,0.00012567976,0.0000961001,0.00023031764],"domain_scores_gemma":[0.99955547,0.000055672615,0.000018777486,0.00019539423,0.00001141376,0.00016326108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015411063,0.000063472486,0.00007450689,0.000025255516,0.00007084382,0.000056881832,0.0001404124,0.00003214209,0.000047081612],"category_scores_gemma":[0.0000017988499,0.000049573857,0.000014909613,0.00006985195,0.000017537943,0.00043389903,0.00014112503,0.00004847858,0.000064583175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039345887,0.00005423109,0.010841352,0.000008342689,0.00000810038,0.000013049885,0.000780857,0.0000020875427,0.0003707248,0.20280221,0.015751528,0.7693636],"study_design_scores_gemma":[0.0003771955,0.000062227504,0.00830196,0.000033052624,0.0000094634715,0.00014656899,0.00009604717,0.96635497,0.00038003863,0.0037076275,0.020184964,0.00034591462],"about_ca_topic_score_codex":0.000008864005,"about_ca_topic_score_gemma":5.330913e-7,"teacher_disagreement_score":0.9663529,"about_ca_system_score_codex":0.0000062623285,"about_ca_system_score_gemma":0.000011085671,"threshold_uncertainty_score":0.20215632},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007901525,0.00046245664,0.99628586,0.00033289203,0.0013592705,0.0009329664,0.000016645105,0.00016500916,0.00036589475],"genre_scores_gemma":[0.7459184,0.00007426039,0.25028166,0.0024466258,0.00092392875,0.0000592579,0.00008855847,0.0000650431,0.00014225197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961308,0.00005078629,0.00067237247,0.0016756175,0.0006677052,0.0008026958],"domain_scores_gemma":[0.997591,0.00049393927,0.0005472019,0.000673362,0.00049788196,0.00019656791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088272954,0.0005973581,0.0006360849,0.00059036934,0.00057603564,0.00055430975,0.001315007,0.0005611734,0.000012527057],"category_scores_gemma":[0.000013509583,0.00057611434,0.00017088822,0.000513377,0.0005494876,0.0006674202,0.0006075132,0.00063845917,0.000005068895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059017995,0.00006255846,0.000083272535,0.00008703019,0.000024000896,0.00008792147,0.00084991194,0.012730941,0.0000044751314,0.018558491,0.00009084605,0.9673615],"study_design_scores_gemma":[0.0006369044,0.00019376559,0.00008042413,0.00025709832,0.000025273372,0.00003277167,5.235484e-7,0.958095,0.000015553249,0.03914859,0.0008886821,0.0006254119],"about_ca_topic_score_codex":0.000015969088,"about_ca_topic_score_gemma":0.00001994649,"teacher_disagreement_score":0.96673614,"about_ca_system_score_codex":0.00026524405,"about_ca_system_score_gemma":0.0005297309,"threshold_uncertainty_score":0.999669},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035444155,0.00034106622,0.92508847,0.00016499376,0.00037832416,0.00013122198,2.8665823e-7,0.00012936552,0.03832211],"genre_scores_gemma":[0.9763519,0.00010492949,0.021850247,0.000651461,0.000044150358,0.000009409525,0.0000016495227,0.00001008197,0.0009761806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853593,0.00010566125,0.0002953441,0.00044639097,0.00017784226,0.00043882246],"domain_scores_gemma":[0.99913967,0.000117948446,0.00006046612,0.0004571793,0.000038883358,0.00018583667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043147992,0.00017298758,0.00024694632,0.00008194487,0.00008274128,0.000144178,0.00032314807,0.00013719204,0.00006057014],"category_scores_gemma":[0.0000068575464,0.00015183204,0.000034157852,0.0004086923,0.00006069732,0.00025282777,0.00011447268,0.00023474952,0.000013137157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021738517,0.00016601231,0.006631264,0.000015045042,0.000026441661,0.00035847662,0.0004994965,0.0011627256,0.00003639662,0.68170244,0.0036663143,0.30571362],"study_design_scores_gemma":[0.00067975145,0.000042590884,0.00053652225,0.000021922811,0.0000037875798,0.00007397657,0.000060272912,0.9930508,0.000036766924,0.0041762097,0.0010685093,0.00024887256],"about_ca_topic_score_codex":0.000019103245,"about_ca_topic_score_gemma":0.000038168047,"teacher_disagreement_score":0.9918881,"about_ca_system_score_codex":0.000021147402,"about_ca_system_score_gemma":0.00007250171,"threshold_uncertainty_score":0.6191531},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17032333,0.00028380164,0.82631373,0.000044348173,0.0011977797,0.00047822355,0.0000019797117,0.00026402218,0.0010927888],"genre_scores_gemma":[0.89185995,0.00018864693,0.105891004,0.0006289066,0.00043121137,0.00023573093,0.000013608864,0.000026609872,0.0007243105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778384,0.000054806056,0.00043071844,0.0008224684,0.00020730463,0.00070085656],"domain_scores_gemma":[0.99808896,0.0003966484,0.00015869265,0.0007932171,0.00017128505,0.000391204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042093726,0.00032129203,0.00035089135,0.0000547578,0.00037815934,0.00045291195,0.00076040515,0.00027419542,0.00006224369],"category_scores_gemma":[0.000009355,0.00026628774,0.00007971458,0.00025228775,0.00019102714,0.0007584875,0.00025362446,0.00049127365,0.0000028088582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040372648,0.00007644892,0.00016200493,0.000007861791,0.000013735886,0.000009565873,0.0018421796,0.0015063414,0.0020252508,0.009839353,0.00072385644,0.983753],"study_design_scores_gemma":[0.0004110314,0.00028801174,0.00005037365,0.000023019318,0.0000076192655,0.00003320135,0.0005588789,0.9911812,0.00047183238,0.000186028,0.006392275,0.00039654327],"about_ca_topic_score_codex":0.000013420755,"about_ca_topic_score_gemma":0.00016045856,"teacher_disagreement_score":0.98967487,"about_ca_system_score_codex":0.000013138747,"about_ca_system_score_gemma":0.00005882854,"threshold_uncertainty_score":0.99997896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14534532,0.00015387783,0.7696173,0.07954182,0.0028652754,0.0004223619,0.0000042367546,0.000025332894,0.0020244382],"genre_scores_gemma":[0.9864264,0.00080339145,0.0010416253,0.0040956433,0.00752886,0.0000037236728,0.0000037127036,0.0000071079367,0.00008952356],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978322,0.00089888036,0.0007249768,0.000012594216,0.00028283853,0.0002485054],"domain_scores_gemma":[0.9956485,0.002367375,0.0006006242,0.00092382403,0.0003682509,0.00009144439],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005486817,0.00013540173,0.00027308037,0.00007695119,0.0024381003,0.00031638905,0.002623004,0.000047976653,0.000009029111],"category_scores_gemma":[0.000050184906,0.00006448023,0.000082722305,0.00028136122,0.00052271003,0.0005361167,0.00077521376,0.0011939373,0.000005494159],"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.00025005653,0.000053764204,0.000028324455,0.00002492665,0.00010933898,7.3705803e-7,0.2853618,0.00046134982,4.0424518e-7,0.020193653,0.53749096,0.1560247],"study_design_scores_gemma":[0.0012834265,0.00031184658,0.00006320273,0.0000661304,0.0000561968,0.002106516,0.07349131,0.17749913,0.000003399622,0.003956451,0.74100924,0.00015315729],"about_ca_topic_score_codex":0.000022788787,"about_ca_topic_score_gemma":0.000114141905,"teacher_disagreement_score":0.8410811,"about_ca_system_score_codex":0.000037113405,"about_ca_system_score_gemma":0.00009897373,"threshold_uncertainty_score":0.9988606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018555855,0.0011263074,0.99189794,0.00003670583,0.00021252951,0.00031156445,0.0000017120973,0.00014141016,0.0044162227],"genre_scores_gemma":[0.86073333,0.0007872979,0.13214728,0.00038026308,0.0010242169,0.00005778,0.000016088235,0.0001642962,0.0046894546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979083,0.000023804057,0.00055329205,0.0006800222,0.00033195422,0.0005026289],"domain_scores_gemma":[0.99878764,0.00017426272,0.00018192691,0.00054917135,0.000106832675,0.00020016661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024118338,0.00045245385,0.0008137072,0.00017776889,0.000046725407,0.0000975885,0.0005606035,0.00040179348,0.000013408321],"category_scores_gemma":[0.0000024633714,0.00040910326,0.00012684437,0.00018592735,0.00010038551,0.00014782354,0.000338506,0.0009024529,0.0000030938595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049781658,0.00017311722,0.00039863845,0.00027796102,0.00037104142,0.00026774636,0.00018190224,0.0627338,0.000019498573,0.6591654,0.00036082987,0.2760003],"study_design_scores_gemma":[0.00040391998,0.00015076551,0.000833586,0.00022518421,0.000026387861,0.000040128,1.4885823e-7,0.99301755,0.000006640207,0.0016062482,0.003209372,0.00048007426],"about_ca_topic_score_codex":0.000049554485,"about_ca_topic_score_gemma":0.0000042024576,"teacher_disagreement_score":0.9302837,"about_ca_system_score_codex":0.00008509713,"about_ca_system_score_gemma":0.00006945282,"threshold_uncertainty_score":0.9998361},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009659622,0.000052089206,0.9865282,0.00007630926,0.00015692688,0.00005705437,0.0000032943965,0.000048491074,0.0034179662],"genre_scores_gemma":[0.9950219,0.000011457221,0.0042752917,0.000039498173,0.00009308679,0.0000017358434,0.0001449989,0.0000051717643,0.00040687565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896467,0.000046090314,0.00033109318,0.0002919022,0.00019727214,0.00016896371],"domain_scores_gemma":[0.99880844,0.0003751502,0.00010739074,0.0006191017,0.000058267553,0.000031675536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002404951,0.0000894186,0.00014168843,0.0000725368,0.000026896532,0.00003654158,0.00048313418,0.000072891875,0.000011983993],"category_scores_gemma":[0.0000030878025,0.00008106574,0.000019145096,0.00030300842,0.000022143218,0.00025827502,0.00021017253,0.000055116743,0.0000013380985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076721135,0.00011802056,0.0011363142,0.0000049717887,0.0000030046067,0.000012138479,0.000017825749,0.7814925,0.000032950484,0.02614402,0.0010266012,0.19000398],"study_design_scores_gemma":[0.00014142043,0.000014622486,0.00096594135,0.000028296074,0.000002883276,0.0000011164097,0.000005880571,0.9981319,0.00004928056,0.00032591642,0.000237501,0.00009529919],"about_ca_topic_score_codex":0.00020493683,"about_ca_topic_score_gemma":0.000103266575,"teacher_disagreement_score":0.9853623,"about_ca_system_score_codex":0.000019206653,"about_ca_system_score_gemma":0.000022384225,"threshold_uncertainty_score":0.33057648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5262617,0.002555829,0.43881315,0.0017430694,0.0009795037,0.0002803209,0.00001608208,0.000051321003,0.02929902],"genre_scores_gemma":[0.9942006,0.0014520867,0.002368182,0.0010040979,0.00023022998,0.0000013350748,0.0000027119106,0.000009967814,0.00073080685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99530727,0.002045965,0.00094307365,0.000017494494,0.0011063819,0.0005797909],"domain_scores_gemma":[0.99398553,0.0031094549,0.00073018135,0.001358385,0.0006313747,0.00018507334],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.010673612,0.00015568578,0.00030043416,0.00012504598,0.0033491806,0.00010704852,0.00361916,0.00006146922,0.000021079399],"category_scores_gemma":[0.000071757575,0.0000823529,0.000115072784,0.00077828614,0.0006566834,0.00061989494,0.0012711545,0.0022400871,0.00002805077],"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.00011595648,0.00012357628,0.00041340973,0.000036620335,0.00012638721,0.000017148388,0.08207374,0.003817905,0.0000032244416,0.00448893,0.88918227,0.01960085],"study_design_scores_gemma":[0.0021756869,0.002376685,0.0033061951,0.00039733778,0.0001805312,0.008019542,0.082347944,0.27933,0.000095326235,0.06761257,0.55324334,0.00091487257],"about_ca_topic_score_codex":0.0001249295,"about_ca_topic_score_gemma":0.0000937454,"teacher_disagreement_score":0.4679389,"about_ca_system_score_codex":0.00047900918,"about_ca_system_score_gemma":0.00030216767,"threshold_uncertainty_score":0.99794835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01710696,0.00509068,0.9754926,0.00046958652,0.00027249908,0.0008849877,0.0000049082028,0.00037237167,0.0003054175],"genre_scores_gemma":[0.66388476,0.0010206562,0.33438247,0.0002938742,0.000076871154,0.00019755214,0.00004929529,0.000027443453,0.00006711084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978617,0.00019917177,0.000638138,0.0005373989,0.00018390248,0.00057971507],"domain_scores_gemma":[0.9962383,0.0009109892,0.00033893387,0.0019679556,0.00031949693,0.00022431999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006524065,0.0002830361,0.00040806248,0.000090298374,0.0012351759,0.0005066436,0.001653804,0.00018160116,0.0000043547097],"category_scores_gemma":[0.000008112787,0.0002801094,0.00012966228,0.00039271676,0.00017665367,0.00033941574,0.0014494286,0.0004322092,0.000008732942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012969641,0.0000962775,0.00017190467,0.000010067397,0.00003888823,0.00000201662,0.0003564871,0.0019970974,0.000037861544,0.0017078114,0.00059167406,0.9949886],"study_design_scores_gemma":[0.0005511996,0.000081298764,0.00046644156,0.00013992265,0.000024967621,0.00003775575,0.00019032529,0.98892456,0.0000055548367,0.00014446017,0.00909168,0.00034180403],"about_ca_topic_score_codex":0.0000441307,"about_ca_topic_score_gemma":0.0000060944635,"teacher_disagreement_score":0.9946468,"about_ca_system_score_codex":0.00004921602,"about_ca_system_score_gemma":0.0000714784,"threshold_uncertainty_score":0.99996513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013062895,0.000024178004,0.9743043,0.000058400492,0.00015839335,0.00024339069,0.0000052544706,0.00018584884,0.011957328],"genre_scores_gemma":[0.88310903,0.0000015492815,0.116119094,0.00028173887,0.00023308073,0.00001369423,0.00011843042,0.000020191312,0.00010321548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978985,0.00027978414,0.0003499714,0.0005313761,0.00030021998,0.00064013316],"domain_scores_gemma":[0.99797934,0.00016775522,0.00019175625,0.0014585876,0.000057243546,0.00014532328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015942748,0.00026359086,0.00038814996,0.000094382754,0.00092816807,0.0008714459,0.0020108486,0.0001879315,0.000014291491],"category_scores_gemma":[0.000009191832,0.0002115303,0.000042275464,0.00051091524,0.00020552333,0.00097587466,0.0017179874,0.0009751928,0.0000023671346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005358644,0.00018408279,0.009587875,0.00010286891,0.000042266736,0.000033844968,0.0051178196,0.021585606,0.000023195782,0.008860871,0.0057057384,0.9487022],"study_design_scores_gemma":[0.00061412447,0.0000986592,0.00078891846,0.000022543178,0.000011342635,0.00005381343,0.0005913346,0.99558747,0.000002198835,0.00040233036,0.00152799,0.0002992848],"about_ca_topic_score_codex":0.00024640438,"about_ca_topic_score_gemma":0.00009754018,"teacher_disagreement_score":0.9740019,"about_ca_system_score_codex":0.000056479497,"about_ca_system_score_gemma":0.000197192,"threshold_uncertainty_score":0.86259556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019346202,0.000041632124,0.9489867,0.000539226,0.00042718646,0.00009438305,7.7577073e-7,0.00023829407,0.030325564],"genre_scores_gemma":[0.9674463,0.000001611394,0.029948173,0.0023931048,0.000099287885,0.0000061338674,0.0000134673355,0.0000027544886,0.00008913882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.000020185627,0.00019329065,0.000068151385,0.0002454869,0.00029188732],"domain_scores_gemma":[0.9994329,0.00002947696,0.000071562616,0.00025442682,0.000063718566,0.00014786918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025234502,0.000090537156,0.00008487634,0.00005590821,0.000110497094,0.00021082046,0.0003553525,0.000053607168,0.000056362987],"category_scores_gemma":[0.000001306497,0.00006958375,0.000034127617,0.0001711736,0.000012921146,0.002668913,0.00011605407,0.00007618793,0.00021429862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009441107,0.000045584682,0.0057333973,0.000042703203,0.000006657113,0.0000012575898,0.0011675867,0.00017045117,0.000019241395,0.04281401,0.0012957192,0.94869393],"study_design_scores_gemma":[0.00023080343,0.000028981694,0.0025359194,0.00002209358,0.0000030419587,0.000004184572,0.000107903805,0.9879708,0.00014553734,0.00024781423,0.008576865,0.00012605541],"about_ca_topic_score_codex":0.00006369569,"about_ca_topic_score_gemma":0.0000012605083,"teacher_disagreement_score":0.98780036,"about_ca_system_score_codex":0.000017854347,"about_ca_system_score_gemma":0.00006327787,"threshold_uncertainty_score":0.2837543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004151898,0.000046178975,0.9388909,0.00023086066,0.00024136604,0.00016389004,0.0000025098193,0.00021666683,0.056055747],"genre_scores_gemma":[0.75924844,0.0000029767245,0.23926811,0.00029030253,0.00003246031,0.000014156544,0.0000031672248,0.00000722909,0.0011331483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902165,0.000015281028,0.00018397995,0.0003036235,0.000114199465,0.00036127455],"domain_scores_gemma":[0.9993912,0.00005699464,0.00005294374,0.00032893888,0.00005775831,0.00011215624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021531517,0.00012537382,0.00014270091,0.000042805605,0.00011600069,0.000088844245,0.00052838743,0.000069391404,0.00007142829],"category_scores_gemma":[0.0000042214483,0.00009759395,0.000073807256,0.00015141038,0.000034026016,0.0001532247,0.00010573558,0.000096248004,0.00002049967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029424034,0.000097960125,0.0005165775,0.000028253438,0.000036524987,0.000029358322,0.0016859516,0.000054658318,0.00011443927,0.21602695,0.0018273738,0.7795525],"study_design_scores_gemma":[0.00024125706,0.00009749735,0.00044875673,0.000015421283,0.000007398466,0.000028477436,0.000047540423,0.9479586,0.00039161116,0.049911056,0.0006609864,0.00019140128],"about_ca_topic_score_codex":0.00006495945,"about_ca_topic_score_gemma":0.000036637553,"teacher_disagreement_score":0.94790393,"about_ca_system_score_codex":0.00001319827,"about_ca_system_score_gemma":0.00008374907,"threshold_uncertainty_score":0.39797658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014458707,0.00011000447,0.9917195,0.00058374734,0.0010575266,0.00029418466,0.0000013664996,0.00031468578,0.004473114],"genre_scores_gemma":[0.5539256,0.000003770748,0.44109106,0.0037343255,0.0007002932,0.000024184488,0.000012199409,0.000015769288,0.0004928104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980462,0.00003444082,0.0003818162,0.00034981992,0.00019943234,0.0009882502],"domain_scores_gemma":[0.99868256,0.00022563942,0.00016827263,0.00044492807,0.0001701128,0.00030847595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261154,0.00019743257,0.00024761015,0.00006243027,0.00031203905,0.00017495888,0.0004879057,0.0001131784,0.000031114643],"category_scores_gemma":[0.0000054331513,0.00018110308,0.00010220102,0.00037136307,0.000016795113,0.00081175246,0.00034938296,0.00016641556,0.000027550419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021524493,0.00004597253,0.0019954727,0.000016588923,0.000029001214,0.000009025503,0.00064678246,0.0001268696,0.0000085815245,0.008934874,0.0047717397,0.9834129],"study_design_scores_gemma":[0.00025793648,0.000011942977,0.0003242448,0.000021995209,0.000012073902,0.00006201342,0.0001287091,0.99157643,0.000027168073,0.00083017716,0.0064832317,0.0002640865],"about_ca_topic_score_codex":0.00005037807,"about_ca_topic_score_gemma":0.0000082019,"teacher_disagreement_score":0.99144953,"about_ca_system_score_codex":0.00003651087,"about_ca_system_score_gemma":0.000050929266,"threshold_uncertainty_score":0.7385169},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11177141,0.027836798,0.838979,0.0099106375,0.0003407058,0.000586372,0.000008112348,0.00033686546,0.010230069],"genre_scores_gemma":[0.98137486,0.015973547,0.002323974,0.00014386905,0.000069378846,0.00008719646,0.000005579377,0.000008131417,0.000013472782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988838,0.00026528258,0.00023367771,0.00025424693,0.000096241,0.00026675747],"domain_scores_gemma":[0.99832165,0.0003950127,0.00008257903,0.0010580361,0.0000485281,0.00009420536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047452364,0.0001197228,0.00019891135,0.000068624824,0.00048123786,0.00008915608,0.0009256221,0.000107246764,0.0000010899754],"category_scores_gemma":[0.0000046921896,0.00012768786,0.000026279231,0.00016235322,0.0002827322,0.00025888285,0.00074962364,0.00029615287,0.000002710192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027373865,0.00018232391,0.00035258706,0.000016596832,0.000013283353,0.0000012439767,0.006931081,0.00008821745,0.000010520288,0.3106382,0.00030348403,0.6814597],"study_design_scores_gemma":[0.00028516565,0.000029164223,0.0029761086,0.00003235454,0.00000670234,0.000010820148,0.00019981322,0.9771026,9.626377e-7,0.012174831,0.007014957,0.00016657307],"about_ca_topic_score_codex":0.000024158562,"about_ca_topic_score_gemma":0.0002110699,"teacher_disagreement_score":0.9770143,"about_ca_system_score_codex":0.000019570052,"about_ca_system_score_gemma":0.000031829266,"threshold_uncertainty_score":0.520696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009264575,0.000053317955,0.984122,0.00050029665,0.0010592816,0.00014628805,0.000002442851,0.00020122157,0.004650603],"genre_scores_gemma":[0.986195,0.000015983323,0.012867087,0.00046756587,0.00017821061,0.000010460909,0.000047147456,0.000009232403,0.00020926203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986595,0.000037610276,0.00033513352,0.00037136892,0.00019374615,0.00040265796],"domain_scores_gemma":[0.9990692,0.000094054514,0.00007100018,0.0005333784,0.00007786245,0.0001545064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029085117,0.00015452507,0.0001814433,0.000070448616,0.000090901725,0.0001603528,0.00058092235,0.00017409735,0.0001223681],"category_scores_gemma":[0.0000072162115,0.00013476127,0.000043577584,0.00057224976,0.000042902884,0.00032779953,0.00016887936,0.0003894046,0.000037373382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028658449,0.0003587713,0.020024505,0.000013553944,0.000025708729,0.00041541512,0.00025824935,0.0460125,0.00008509839,0.3480508,0.018319724,0.566407],"study_design_scores_gemma":[0.00032114587,0.000025356581,0.0015823285,0.000010103032,0.0000027783915,0.000043262666,0.0000055415617,0.9927263,0.00000967577,0.0010260857,0.004058488,0.0001888798],"about_ca_topic_score_codex":0.00005965358,"about_ca_topic_score_gemma":0.00022817201,"teacher_disagreement_score":0.9769305,"about_ca_system_score_codex":0.000027108721,"about_ca_system_score_gemma":0.000084352956,"threshold_uncertainty_score":0.5495405},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030048932,0.00010325662,0.83795106,0.0016497868,0.00018152398,0.000067891044,5.2584846e-7,0.0002891234,0.15675196],"genre_scores_gemma":[0.8661308,0.000002576797,0.12841137,0.00068966474,0.00022806719,0.0000042783154,0.0000035941785,0.0000070261867,0.004522589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989645,0.000030121702,0.0001824495,0.00029739767,0.00021846601,0.00030709125],"domain_scores_gemma":[0.99906576,0.00007428947,0.00004429687,0.00069928437,0.00003262226,0.00008375679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012059307,0.00011892462,0.00012590033,0.00005692002,0.000102676466,0.00016743822,0.0011063449,0.0000557219,0.0001269372],"category_scores_gemma":[0.000002493026,0.00009360185,0.000057662975,0.00022200804,0.00002556632,0.00016901598,0.0005794948,0.00013902147,0.000073390234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010114592,0.00017123639,0.0018923659,0.00002342978,0.00002045704,0.0002143082,0.00028960954,0.0016455231,0.00037984576,0.38795054,0.16267887,0.4447237],"study_design_scores_gemma":[0.00026254536,0.000031011583,0.0012201462,0.000015929834,0.0000036139775,0.00006232484,0.00000558775,0.8355393,0.00012674888,0.09506602,0.067419864,0.00024691058],"about_ca_topic_score_codex":0.00012435751,"about_ca_topic_score_gemma":0.000019870162,"teacher_disagreement_score":0.8631259,"about_ca_system_score_codex":0.000011780297,"about_ca_system_score_gemma":0.000040479976,"threshold_uncertainty_score":0.38169724},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024054354,0.00007685529,0.6236693,0.0057501076,0.00034700872,0.0001818865,0.000008909389,0.00023149513,0.34568003],"genre_scores_gemma":[0.9816789,0.00000282116,0.014909583,0.0029703712,0.00019486861,0.000006219807,0.00000393624,0.000014882654,0.00021838605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870867,0.000017903354,0.00016307906,0.00033240436,0.00021876345,0.0005591649],"domain_scores_gemma":[0.9989423,0.000054972093,0.000051959792,0.00035807028,0.0000503862,0.00054228347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021828692,0.0001382396,0.00012907213,0.00014635135,0.00033649727,0.00022178899,0.00042584154,0.00006269036,0.000020902971],"category_scores_gemma":[0.0000052008945,0.00013095941,0.000029644256,0.00029595773,0.00003745227,0.00021873931,0.000029525592,0.00021777685,0.00006510434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063015905,0.000030368747,0.0013297921,0.00001559257,0.000023614795,0.0026898053,0.00088180933,0.0030926089,0.000008891595,0.521998,0.001605327,0.4683179],"study_design_scores_gemma":[0.012472735,0.0033966005,0.007100285,0.005269959,0.000114267954,0.0034965654,0.005217381,0.7178217,0.0010530379,0.09084543,0.14531279,0.00789923],"about_ca_topic_score_codex":0.018651018,"about_ca_topic_score_gemma":0.046258118,"teacher_disagreement_score":0.95762455,"about_ca_system_score_codex":0.00019511799,"about_ca_system_score_gemma":0.00068997307,"threshold_uncertainty_score":0.98788387},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05835495,0.000030971274,0.939076,0.000120155884,0.0007847212,0.00032863108,0.0000015908249,0.00010538452,0.0011975975],"genre_scores_gemma":[0.94965184,0.000022673337,0.049252182,0.0006853216,0.00019711102,0.00004889718,0.00001567667,0.000014520858,0.00011177251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985585,0.000011260302,0.0004655699,0.00034355497,0.00024368089,0.00037739743],"domain_scores_gemma":[0.99885505,0.00009264433,0.0001942877,0.00050431484,0.00023625026,0.00011742777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047871305,0.00016400774,0.00022256267,0.00005852929,0.00017500077,0.00007314619,0.0004988666,0.00012630635,0.000024654275],"category_scores_gemma":[0.0000055325995,0.000141409,0.00008910365,0.0002047134,0.000051484185,0.00034850792,0.00014297527,0.0001747238,0.0000035179664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005649977,0.00022930012,0.003208125,0.00015869083,0.000066972156,0.000010714461,0.0004039838,0.10979493,0.0041402644,0.04902812,0.0024608348,0.83044153],"study_design_scores_gemma":[0.0004497839,0.00013803261,0.000053378193,0.000027256145,0.000013405611,0.000008618345,0.000020536021,0.9947672,0.0022209415,0.00033076073,0.0017830277,0.00018704354],"about_ca_topic_score_codex":0.000018528459,"about_ca_topic_score_gemma":0.0000081434355,"teacher_disagreement_score":0.89129686,"about_ca_system_score_codex":0.000013162733,"about_ca_system_score_gemma":0.00006709386,"threshold_uncertainty_score":0.5766491},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07114903,0.00029684935,0.9022831,0.00020113168,0.00028001762,0.00011305097,3.6319136e-7,0.00010115251,0.025575312],"genre_scores_gemma":[0.9882395,0.000051881674,0.010420224,0.0010291351,0.00009571836,0.0000019481695,0.0000015361312,0.0000052507635,0.00015477205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867254,0.000037434565,0.00030375525,0.00036630718,0.0001677464,0.00045221983],"domain_scores_gemma":[0.99919415,0.00018778232,0.00004816331,0.00033549272,0.000034713237,0.00019969043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010197688,0.00013740805,0.00018848499,0.00008070996,0.00007499028,0.000094947725,0.0003184168,0.00012341718,0.000028903713],"category_scores_gemma":[0.00000314146,0.00011913042,0.000031494208,0.00033753423,0.00005649112,0.00027085558,0.00021848487,0.00024193931,0.0000069328694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086831606,0.0002896844,0.06211999,0.000019576779,0.00002225169,0.0017513604,0.0012028114,0.0007293261,0.000012059519,0.17885108,0.005897895,0.7490171],"study_design_scores_gemma":[0.0003890195,0.000038348506,0.008013339,0.000013113415,0.0000021243025,0.00007793759,0.000026486125,0.98498124,0.0000099331355,0.0046739206,0.0015879299,0.00018659882],"about_ca_topic_score_codex":0.000115696894,"about_ca_topic_score_gemma":0.00038135436,"teacher_disagreement_score":0.9842519,"about_ca_system_score_codex":0.000023262148,"about_ca_system_score_gemma":0.000032580127,"threshold_uncertainty_score":0.48579976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06600384,0.000066850276,0.89709735,0.0010466645,0.0004512473,0.00018068752,2.2007146e-7,0.00014715112,0.03500597],"genre_scores_gemma":[0.97831565,0.0000022640254,0.018524084,0.0021737376,0.00009548779,0.000016868553,0.0000017831446,0.0000057290927,0.000864369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988382,0.000074095675,0.00021263667,0.0003356436,0.00018077421,0.00035864316],"domain_scores_gemma":[0.9990127,0.00035258225,0.000045529436,0.00037793152,0.00006643184,0.00014481561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029814237,0.00012296306,0.00016668226,0.00005629346,0.00006409797,0.00012118187,0.00037521037,0.000054782737,0.00039479116],"category_scores_gemma":[0.000005154837,0.00010312266,0.00003870603,0.00028944138,0.000038471302,0.00051359396,0.00023168104,0.00020237785,0.00028007358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018211958,0.00047320477,0.025345648,0.000009474274,0.000037597874,0.0002251326,0.00022869723,0.050841637,0.0000684281,0.35646152,0.053782415,0.51250803],"study_design_scores_gemma":[0.00035618403,0.000019933665,0.00566191,0.0000093821845,0.0000014574791,0.000020536856,0.0000053187473,0.9848426,0.000006236902,0.008716295,0.0002106449,0.00014949615],"about_ca_topic_score_codex":0.00053113885,"about_ca_topic_score_gemma":0.0000894032,"teacher_disagreement_score":0.93400097,"about_ca_system_score_codex":0.000023985891,"about_ca_system_score_gemma":0.00004931551,"threshold_uncertainty_score":0.43226862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02849933,0.000055636665,0.9676457,0.0002794321,0.00043820922,0.00015901905,0.000049051454,0.00018828396,0.0026853064],"genre_scores_gemma":[0.8919581,0.0000025679378,0.10661135,0.0006186571,0.00034098173,0.000017362128,0.000054522152,0.000010326398,0.00038609043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894184,0.000022214386,0.00020209707,0.00012864108,0.00018209146,0.0005231152],"domain_scores_gemma":[0.9992105,0.00024092043,0.0000717638,0.00028665602,0.000060515536,0.00012963873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002756622,0.000148171,0.0001846442,0.000038080227,0.00035805884,0.00013728808,0.0005382653,0.00009639565,0.000068026275],"category_scores_gemma":[0.0000028197635,0.00013539598,0.00008419028,0.00011696478,0.000055156495,0.00036191827,0.00026181506,0.00012932789,0.000009968358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007858705,0.0004875711,0.0012471954,0.00005146809,0.00010701381,0.000053169424,0.0026463277,0.00001870269,0.00089927315,0.8992413,0.037825663,0.057343703],"study_design_scores_gemma":[0.0008866534,0.00006028083,0.0009185248,0.000019190744,0.000019059098,0.0005210436,0.00029356268,0.9460178,0.00006196769,0.0015499376,0.049215347,0.00043665306],"about_ca_topic_score_codex":0.00007968529,"about_ca_topic_score_gemma":0.000017061493,"teacher_disagreement_score":0.9459991,"about_ca_system_score_codex":0.00004399301,"about_ca_system_score_gemma":0.000037600315,"threshold_uncertainty_score":0.5521288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006972957,0.00003139473,0.99046415,0.00069490157,0.0013609619,0.0004149539,0.0000048056627,0.00039186107,0.005939655],"genre_scores_gemma":[0.85003877,0.000031352505,0.14385106,0.0018179433,0.0005413759,0.00004613659,0.000023933644,0.000025898507,0.0036235412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777716,0.00008053696,0.000527391,0.00063802686,0.00026957935,0.00070730085],"domain_scores_gemma":[0.9970696,0.0013919069,0.00022248366,0.0007329258,0.00022519105,0.0003579094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007920525,0.00026806304,0.00039288838,0.000049723025,0.00026087416,0.00018943622,0.0007265674,0.00015071165,0.000020518468],"category_scores_gemma":[0.000079610014,0.00023116873,0.0001375595,0.00016976937,0.00008717523,0.00023731685,0.00019074022,0.00020090606,0.000031141255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003118894,0.00007133904,0.00037264376,0.000022660919,0.000031784908,0.000024228004,0.00011434218,0.0006167394,0.00010919405,0.19834328,0.0061385646,0.79412407],"study_design_scores_gemma":[0.00072633644,0.00011202215,0.00008581698,0.00004644433,0.000016128506,0.000022920383,0.000036208523,0.99119127,0.000027564969,0.0007406606,0.006657183,0.0003374203],"about_ca_topic_score_codex":0.000023734723,"about_ca_topic_score_gemma":0.000008895862,"teacher_disagreement_score":0.99057454,"about_ca_system_score_codex":0.000035705376,"about_ca_system_score_gemma":0.00007047159,"threshold_uncertainty_score":0.94267875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05841714,0.000008863032,0.92453253,0.0001971114,0.00020773875,0.00009154868,6.766593e-7,0.00025501693,0.016289357],"genre_scores_gemma":[0.9059548,3.2041194e-7,0.09266517,0.0009074925,0.000085206724,0.000006930121,0.00000486827,0.000011547984,0.0003637095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.000048431473,0.00019203917,0.00040324856,0.00032271422,0.00040189052],"domain_scores_gemma":[0.99906284,0.00008454303,0.00008564055,0.0005142361,0.0000735713,0.0001791783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029594934,0.00017882568,0.00018593484,0.000059080783,0.00019055119,0.0002509846,0.000533536,0.00006771848,0.00007235357],"category_scores_gemma":[0.000002537907,0.00013459554,0.0000518586,0.00019223076,0.00007622006,0.00024046312,0.00009242233,0.00015276225,0.0000420281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023406568,0.0010960782,0.082452856,0.00006826019,0.000116325624,0.000863355,0.0047796923,0.026455237,0.00064260676,0.05530341,0.005607217,0.8223809],"study_design_scores_gemma":[0.00045091775,0.00031709607,0.0008199867,0.00002962957,0.000011822951,0.00004307709,0.000033768767,0.99761087,0.00013361213,0.000043242806,0.00026733484,0.0002386431],"about_ca_topic_score_codex":0.000087466,"about_ca_topic_score_gemma":0.000031852065,"teacher_disagreement_score":0.97115564,"about_ca_system_score_codex":0.000025557627,"about_ca_system_score_gemma":0.00012876534,"threshold_uncertainty_score":0.54886466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037597708,0.000041918574,0.80379885,0.00054785796,0.00044592316,0.00002625174,2.1070481e-7,0.00015890753,0.1946041],"genre_scores_gemma":[0.8892225,0.0000037802863,0.1004112,0.0014315939,0.00014828728,0.0000019393779,0.000001656231,0.00000313451,0.008775926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994826,0.000013001699,0.000088023226,0.00013748978,0.00014482703,0.00013410694],"domain_scores_gemma":[0.99940974,0.000021021478,0.000017457563,0.00029840707,0.00005483395,0.00019852266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014263779,0.000050939223,0.00006238913,0.000021471687,0.000020639682,0.000050277216,0.0003501317,0.000027234559,0.000028278786],"category_scores_gemma":[0.0000029395987,0.00003936733,0.000019555797,0.000114866794,0.000018839273,0.00016276931,0.000119433746,0.000045724468,0.000320075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054632756,0.00008664706,0.00048602134,0.0000022563513,0.000007966144,0.00016891425,0.00038878826,0.00007944383,0.00000443868,0.31199008,0.33512825,0.35165173],"study_design_scores_gemma":[0.00020801519,0.000038785878,0.000021837475,0.0000026749906,0.0000012564406,0.000035359157,0.000023253604,0.9072903,0.00001303768,0.011322045,0.08095167,0.00009181252],"about_ca_topic_score_codex":0.000010900031,"about_ca_topic_score_gemma":0.0000017031027,"teacher_disagreement_score":0.9072108,"about_ca_system_score_codex":0.000009391872,"about_ca_system_score_gemma":0.00008678642,"threshold_uncertainty_score":0.41140231},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4299242,0.000050401202,0.56956667,0.000016358246,0.00006017112,0.0002786515,0.0000028870327,0.00007562523,0.000025054334],"genre_scores_gemma":[0.9688783,0.000083646,0.0307282,0.00007160549,0.00007163018,0.000051885854,0.000018698789,0.000009111212,0.0000869158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848354,0.00006596592,0.00045644285,0.0005111589,0.00024057843,0.00024232858],"domain_scores_gemma":[0.998524,0.00031269275,0.0001555102,0.00045771408,0.00045288668,0.000097201635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041367448,0.00017732498,0.0002906447,0.0001480431,0.00047205947,0.00013913999,0.00024453658,0.000090436304,0.000009194952],"category_scores_gemma":[0.000038495604,0.00017599599,0.00008643281,0.00043583786,0.00007187846,0.0008333529,0.000068031906,0.000073605246,0.000002475666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036054433,0.000056872737,0.015587327,0.000021329628,0.000061130115,0.0000010103444,0.0012192813,0.959774,0.00008692904,0.008453548,0.000004969086,0.014697543],"study_design_scores_gemma":[0.0010047052,0.000037155685,0.011868884,0.000008321284,0.00006398377,0.0000016454015,0.000008080267,0.9862968,0.00012704403,0.0003065628,0.000055713328,0.00022110519],"about_ca_topic_score_codex":0.000021442682,"about_ca_topic_score_gemma":0.000010513726,"teacher_disagreement_score":0.53895414,"about_ca_system_score_codex":0.000030710875,"about_ca_system_score_gemma":0.00010785558,"threshold_uncertainty_score":0.71769077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030708432,0.000008293246,0.9339071,0.0003767974,0.00030301206,0.00011003227,0.0000015152344,0.00016803356,0.034416817],"genre_scores_gemma":[0.99430144,0.0000067890783,0.004460821,0.00050066324,0.00007147135,0.000012550331,0.0000215662,0.000004551947,0.00062017556],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991181,0.000014846153,0.00020286346,0.00027321544,0.00022985764,0.00016110117],"domain_scores_gemma":[0.9995361,0.000053785865,0.00003171768,0.00027621843,0.00002706414,0.00007508902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019289745,0.00007967551,0.00009854362,0.000105461426,0.00006485216,0.000012353413,0.0002542137,0.00006466831,0.00006535165],"category_scores_gemma":[0.000002720569,0.000073813695,0.000027143373,0.00028250014,0.000023766994,0.00019190674,0.000012990335,0.00010466385,0.000027041422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002024398,0.001153433,0.7246774,0.00004181073,0.000019957748,0.00081974606,0.006735869,0.033469774,0.00009455836,0.087809175,0.032037687,0.112938195],"study_design_scores_gemma":[0.00033003808,0.000051495506,0.06364801,0.000017458236,0.0000014572558,0.0000057126654,0.000005534774,0.93517196,0.000032835476,0.0002083735,0.00045387115,0.00007327912],"about_ca_topic_score_codex":0.000037407804,"about_ca_topic_score_gemma":0.000030406889,"teacher_disagreement_score":0.963593,"about_ca_system_score_codex":0.000039773193,"about_ca_system_score_gemma":0.000079875914,"threshold_uncertainty_score":0.30100352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059183463,0.0006654618,0.9362546,0.0020289943,0.00055813964,0.00009219773,0.0000013776923,0.00007085804,0.0011448638],"genre_scores_gemma":[0.9475404,0.001095432,0.049426768,0.0014332355,0.0001923531,0.0000027558208,0.000003837079,0.0000073024976,0.00029793425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990866,0.000036612215,0.00021437967,0.00023377874,0.00018609325,0.00024249629],"domain_scores_gemma":[0.99878454,0.000453546,0.00007891725,0.0005620781,0.000044211592,0.000076720804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029307362,0.00012218255,0.00017230307,0.000009910243,0.000328581,0.00015560663,0.00083393225,0.00006390233,0.0000025975828],"category_scores_gemma":[0.000005450185,0.0000822801,0.00013308,0.00016032708,0.00020231817,0.00013110449,0.00058694463,0.00013013987,0.0000019830588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009767258,0.000069015,0.0046113417,0.000017704975,0.000097798176,0.00009412397,0.003890753,0.000055030596,0.0000931244,0.036096152,0.047901686,0.9070635],"study_design_scores_gemma":[0.0005699242,0.00011160438,0.0059882975,0.000027433469,0.000014075582,0.00010087611,0.0001708999,0.9366514,0.000010080009,0.010636926,0.045468837,0.0002496414],"about_ca_topic_score_codex":0.000030186366,"about_ca_topic_score_gemma":0.0000032463465,"teacher_disagreement_score":0.9365964,"about_ca_system_score_codex":0.000007672764,"about_ca_system_score_gemma":0.000028498356,"threshold_uncertainty_score":0.33552852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48101664,0.008718476,0.50158334,0.00006580149,0.0012211005,0.00035261788,6.761296e-7,0.00045072119,0.0065906574],"genre_scores_gemma":[0.9947971,0.0011682668,0.0026179655,0.00053028925,0.00050493306,0.000017203456,0.0000067031615,0.00003155647,0.00032596005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718225,0.00016406545,0.000593599,0.00082580023,0.00027929,0.00095498114],"domain_scores_gemma":[0.9987031,0.00028540823,0.0001520153,0.0005944229,0.00003931672,0.0002256857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006574577,0.0003480645,0.00047521802,0.000097245786,0.00035589506,0.00035406096,0.0006342661,0.00020417823,0.000045903485],"category_scores_gemma":[0.0000011442103,0.0003527269,0.00009217941,0.0006990021,0.00009154341,0.00020906444,0.00029913743,0.00055918447,0.000016435217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002186186,0.00006686111,0.0005123973,0.000007656303,0.000013318048,0.00016948434,0.00089179195,0.05610247,0.000002205115,0.00023476958,0.00046259363,0.9415146],"study_design_scores_gemma":[0.00060290325,0.00014211335,0.00043939197,0.00030867802,0.000006634225,0.000096554024,0.00007932422,0.98914945,0.0000024360493,0.00035998077,0.008383653,0.00042887198],"about_ca_topic_score_codex":0.000009216438,"about_ca_topic_score_gemma":0.000012828314,"teacher_disagreement_score":0.9410857,"about_ca_system_score_codex":0.000047897494,"about_ca_system_score_gemma":0.000050220864,"threshold_uncertainty_score":0.9998925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0631,0.00004600222,0.9217764,0.00030167444,0.00024154923,0.00010723919,9.2152834e-7,0.00011520467,0.014311016],"genre_scores_gemma":[0.99531585,0.0000044369367,0.0032415183,0.000211169,0.0000803523,0.000007162859,0.0000030624026,0.0000048554593,0.0011316001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918807,0.000056281013,0.00018160116,0.00021176174,0.00021075616,0.00015153602],"domain_scores_gemma":[0.99918634,0.00017581283,0.00006270952,0.00044424148,0.000059307575,0.00007161092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028396072,0.0000970533,0.00014654057,0.000051129802,0.000047974747,0.00002836765,0.00038719072,0.000053177908,0.000047534697],"category_scores_gemma":[0.0000042040265,0.00007335532,0.000040445408,0.00019321452,0.00002461203,0.0001267516,0.00006269656,0.00006902495,0.00007652173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039004502,0.00012183052,0.0044483747,0.000019261823,0.0000097689335,0.000013117561,0.0001134239,0.0012982449,0.000022629247,0.025193064,0.0053664222,0.9633549],"study_design_scores_gemma":[0.0007407696,0.0010111899,0.002509779,0.00005797979,0.000020401774,0.00002409173,0.0000058351675,0.98520446,0.008430694,0.00021818455,0.0015177086,0.00025890252],"about_ca_topic_score_codex":0.000027396387,"about_ca_topic_score_gemma":0.000007049522,"teacher_disagreement_score":0.9839062,"about_ca_system_score_codex":0.000018566348,"about_ca_system_score_gemma":0.000054886852,"threshold_uncertainty_score":0.29913428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008361831,0.000024581539,0.9916993,0.00023478849,0.0006769443,0.0062502692,0.0000017221557,0.00006235491,0.00021386927],"genre_scores_gemma":[0.77593005,0.0000018836693,0.22065239,0.00095429004,0.0016843178,0.00071932934,0.0000026181954,0.000038868224,0.000016234322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969296,0.00039125423,0.0011415925,0.00029157044,0.0005646626,0.00068133784],"domain_scores_gemma":[0.99666476,0.0012696263,0.0007729343,0.0005552227,0.0004501798,0.00028730277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028461234,0.00032364062,0.0004914238,0.00013891033,0.0005876235,0.00025487063,0.0016239254,0.0001322025,0.000008526328],"category_scores_gemma":[0.000045127097,0.00021770578,0.0002346017,0.0003359416,0.000121475816,0.00013608341,0.0002614208,0.00044850042,9.32352e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003575273,0.000054072163,0.00011326895,0.000022484075,0.000026725058,0.000017572753,0.00017171663,0.4634582,0.00002114609,0.0024113501,0.00082031335,0.5328474],"study_design_scores_gemma":[0.001346457,0.0003290854,0.00019708162,0.00023531867,0.00004584382,0.0003289177,0.000074338495,0.9936157,0.000031548003,0.00121139,0.0023192726,0.00026503348],"about_ca_topic_score_codex":0.000014452099,"about_ca_topic_score_gemma":8.550426e-7,"teacher_disagreement_score":0.7750939,"about_ca_system_score_codex":0.00008019556,"about_ca_system_score_gemma":0.00031735678,"threshold_uncertainty_score":0.8877784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008494855,0.0000022818836,0.9384747,0.0037829822,0.00021108604,0.054742496,0.000010327904,0.00017851415,0.0017480948],"genre_scores_gemma":[0.48296246,8.2390564e-8,0.093900934,0.010439763,0.00041170348,0.39668673,0.000017396716,0.00005204724,0.015528862],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848247,0.00015178062,0.00029886814,0.00042338326,0.00024420812,0.00039926736],"domain_scores_gemma":[0.998307,0.00053481804,0.00009588616,0.0007525229,0.000138186,0.00017157775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036862545,0.00019755219,0.0002099126,0.00007049619,0.00011971047,0.0007684819,0.000689538,0.00009281074,0.00004917818],"category_scores_gemma":[0.000009151882,0.00013521596,0.00008425829,0.00023587186,0.00002705501,0.00057563744,0.00014732423,0.00011255197,0.00009102804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010164698,0.0023557662,0.0013449531,0.004360432,0.00036609106,0.00021061426,0.0068139806,0.036616042,0.006595701,0.13129811,0.5284859,0.2713877],"study_design_scores_gemma":[0.00089470524,0.00018412374,0.000105238185,0.00007072591,0.0000045083893,0.000013810364,0.00005094177,0.9574077,0.000033344244,0.00093724485,0.040066734,0.00023089511],"about_ca_topic_score_codex":0.00011391445,"about_ca_topic_score_gemma":0.000017082486,"teacher_disagreement_score":0.9207917,"about_ca_system_score_codex":0.00002479358,"about_ca_system_score_gemma":0.00018019254,"threshold_uncertainty_score":0.7410489},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057151336,0.0062240767,0.935268,0.00010714615,0.0002442123,0.00019866845,0.000011843512,0.000014601569,0.0007801174],"genre_scores_gemma":[0.99580246,0.00080734584,0.0031768102,0.000044756474,0.0001516827,0.0000014262758,0.0000034252057,0.0000073294473,0.0000047568656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792355,0.0002567256,0.00088735676,0.00022569584,0.00031649604,0.00039016866],"domain_scores_gemma":[0.9966237,0.00092256494,0.0012838022,0.00047292162,0.00056508865,0.00013190306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010638753,0.00022529186,0.00051370065,0.00003141285,0.0003741409,0.0000775542,0.0009298768,0.00009969736,0.000008982513],"category_scores_gemma":[0.000028620832,0.00011650887,0.00035254945,0.00036794582,0.00038388753,0.0001710663,0.00027664698,0.0005235734,3.1683393e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010059967,0.00076366717,0.004988843,0.000016482032,0.00065129646,0.00005553961,0.004691676,0.8655102,0.000008078161,0.025597945,0.005066852,0.0916434],"study_design_scores_gemma":[0.00068664254,0.0012878199,0.026095735,0.00008458348,0.00003936332,0.00011466539,0.0012278872,0.9623998,0.0000022441066,0.007772815,0.00014982627,0.00013866629],"about_ca_topic_score_codex":0.00006476166,"about_ca_topic_score_gemma":0.000003368611,"teacher_disagreement_score":0.93865114,"about_ca_system_score_codex":0.00006981795,"about_ca_system_score_gemma":0.00012147713,"threshold_uncertainty_score":0.4751094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043392792,0.00027918132,0.9504018,0.00012177773,0.002685315,0.0020100467,0.000013135054,0.0007182548,0.00037771763],"genre_scores_gemma":[0.9953105,0.00007818274,0.001383057,0.00045796277,0.00097511325,0.0011637348,0.00021135292,0.000044065,0.00037606354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680173,0.00016950363,0.00086500205,0.0009299024,0.0002934018,0.00094045897],"domain_scores_gemma":[0.99738646,0.00048253435,0.00039567077,0.0008807194,0.00053739984,0.00031723556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006303627,0.00040092345,0.00052225194,0.00008320523,0.0004615716,0.00048721107,0.00083956623,0.0004244228,0.00006600394],"category_scores_gemma":[0.00001222407,0.00038208812,0.0002717924,0.0004438589,0.0001285858,0.00089350325,0.00030793768,0.0004917068,0.00002117348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009933297,0.0003944074,0.007460721,0.000060422008,0.00016838408,0.00001623062,0.000252144,0.120144665,0.000052939966,0.0071117696,0.02232155,0.84191746],"study_design_scores_gemma":[0.0010422397,0.00024701832,0.002428871,0.00014560507,0.000032638956,0.000022175058,0.00013550001,0.9944868,0.000008936574,0.00055544963,0.00051503524,0.00037970344],"about_ca_topic_score_codex":0.00009661712,"about_ca_topic_score_gemma":0.000018831452,"teacher_disagreement_score":0.95191765,"about_ca_system_score_codex":0.000119468095,"about_ca_system_score_gemma":0.00006204303,"threshold_uncertainty_score":0.9998631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006762616,0.000100842844,0.90167797,0.0001175647,0.00007984897,0.00020489066,8.260689e-7,0.00018524144,0.09695655],"genre_scores_gemma":[0.9287837,0.000008596188,0.06619144,0.0006036896,0.00021858064,0.00013183308,0.000003119795,0.000006231066,0.0040527675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933237,0.000014681093,0.00009673777,0.00014331866,0.00014570967,0.00026716117],"domain_scores_gemma":[0.9993933,0.00005179588,0.000035823166,0.0003323749,0.000034973615,0.00015172991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011403021,0.00007732411,0.000086211534,0.000020010086,0.0001151267,0.000054514694,0.00030183909,0.000038584596,0.00013253358],"category_scores_gemma":[2.594177e-7,0.000056858258,0.000023943892,0.00016647887,0.000035239016,0.00022298559,0.000064977976,0.00006049251,0.00022461358],"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.000008123326,0.0002463358,0.0015969588,0.0000076011393,0.000026696393,0.000035590234,0.0008038858,0.000034850975,0.000017390295,0.58345854,0.012748927,0.4010151],"study_design_scores_gemma":[0.00052387954,0.00019702013,0.00042124133,0.000010355364,0.00003123689,0.0012493031,0.00026887094,0.09601351,0.000081410835,0.0042206687,0.8963103,0.0006721998],"about_ca_topic_score_codex":0.000014614187,"about_ca_topic_score_gemma":0.0000056717263,"teacher_disagreement_score":0.9281075,"about_ca_system_score_codex":0.000016542705,"about_ca_system_score_gemma":0.000049096627,"threshold_uncertainty_score":0.28870282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074210837,0.0012605153,0.98862803,0.000057130244,0.0003184505,0.000915417,0.000016600554,0.00021996719,0.0011628337],"genre_scores_gemma":[0.92142,0.00017225614,0.07766264,0.0000487549,0.000053678737,0.00035014338,0.00003624444,0.000014216564,0.00024207213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983953,0.00028456087,0.0005757139,0.00028078546,0.00021602989,0.0002475709],"domain_scores_gemma":[0.9967875,0.0007746599,0.00039998846,0.0015486862,0.00039209434,0.00009708999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064937345,0.00015096093,0.00043151647,0.00010453353,0.00024346501,0.000040438354,0.0011320016,0.000121757825,0.0000064409137],"category_scores_gemma":[0.000018277744,0.0001451154,0.00010559159,0.00042216876,0.000105071726,0.000240306,0.00018647009,0.00012370513,0.000013724498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086938766,0.0013006781,0.0010838425,0.00024455215,0.00033536777,0.000017310545,0.0042212736,0.006945646,0.0011744205,0.040529158,0.013087765,0.93097305],"study_design_scores_gemma":[0.0008660689,0.00014838099,0.00013777883,0.000043741555,0.000008763824,0.00008328782,0.00006856377,0.9870015,0.00022340186,0.00020852362,0.011032219,0.0001777981],"about_ca_topic_score_codex":0.00020447341,"about_ca_topic_score_gemma":0.0000058694127,"teacher_disagreement_score":0.9800558,"about_ca_system_score_codex":0.00004795675,"about_ca_system_score_gemma":0.00014741703,"threshold_uncertainty_score":0.59176344},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019477993,0.0074627753,0.97129095,0.0011152294,0.00007774496,0.00026656475,2.0532684e-7,0.000010855973,0.0002976919],"genre_scores_gemma":[0.9610863,0.0021863147,0.036303353,0.00024329162,0.00015965888,0.000009421676,7.0752355e-7,0.0000049722253,0.000005989663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921453,0.000092964954,0.00035413523,0.00007653175,0.000097902564,0.00016394375],"domain_scores_gemma":[0.99847436,0.000888012,0.00017852975,0.00023052769,0.00017432922,0.000054248118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083383365,0.00007330667,0.00014888616,0.00005078695,0.00019921007,0.00008749686,0.00062485796,0.00003602906,0.0000019013033],"category_scores_gemma":[0.000007858518,0.000050123515,0.000034294622,0.00014883502,0.000059468133,0.0005987662,0.00014323922,0.00020852304,0.0000010340004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071917184,0.00003151806,0.0010544998,0.0000130308445,0.0000081117905,9.3442367e-7,0.0015233883,0.010088992,0.00003093317,0.0052711875,0.0003541345,0.9816161],"study_design_scores_gemma":[0.00027703404,0.00005933188,0.0007816002,0.00006829122,0.000007907987,0.00012417184,0.00067620905,0.9864399,0.0000045242928,0.010337527,0.0011511358,0.000072393945],"about_ca_topic_score_codex":0.000014862676,"about_ca_topic_score_gemma":0.0000062143213,"teacher_disagreement_score":0.98154366,"about_ca_system_score_codex":0.000018138235,"about_ca_system_score_gemma":0.000029269473,"threshold_uncertainty_score":0.20439777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009907103,0.00005099968,0.9215003,0.00035464249,0.0007511443,0.00008022975,2.722565e-7,0.0001475927,0.07612406],"genre_scores_gemma":[0.9832213,0.000015843361,0.014600058,0.0010603875,0.00033499132,0.00000661218,0.000003865729,0.000009270692,0.00074769167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984111,0.00007015811,0.00032454878,0.0002497911,0.0002041103,0.00074027386],"domain_scores_gemma":[0.9988906,0.00024933755,0.000061528066,0.00041325804,0.000025437008,0.00035984165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071685365,0.0001436856,0.00019155162,0.000067453315,0.0000764576,0.00010042295,0.00043478046,0.00011157234,0.00013588174],"category_scores_gemma":[0.000014787894,0.00012556718,0.000047191395,0.00032560123,0.00003813733,0.0005847868,0.00024500504,0.00026969746,0.00008214688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048459374,0.0001336034,0.022407165,0.0000029866708,0.0000066920516,0.00007752475,0.00015468652,0.00006181753,0.0000037316036,0.8380707,0.002693758,0.1363825],"study_design_scores_gemma":[0.0001812457,0.000019193223,0.002728845,0.000013262219,0.0000041528247,0.000059639082,0.00003144258,0.99434894,0.0000021756146,0.0007736088,0.001645023,0.00019248281],"about_ca_topic_score_codex":0.0000263498,"about_ca_topic_score_gemma":0.0000046417003,"teacher_disagreement_score":0.99428713,"about_ca_system_score_codex":0.000040466603,"about_ca_system_score_gemma":0.000058456782,"threshold_uncertainty_score":0.51204807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007598804,0.00036432574,0.9899297,0.00038202482,0.0038832705,0.00035856554,0.0000036015463,0.000046812096,0.004271843],"genre_scores_gemma":[0.7528408,0.000092290924,0.24460427,0.0012906177,0.0009353333,0.000025872601,0.0000046279965,0.000015425525,0.00019077383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975433,0.00007164638,0.00092565775,0.00031473156,0.0007204923,0.00042417922],"domain_scores_gemma":[0.9980316,0.00019967744,0.0006773395,0.0003671381,0.00055062486,0.00017360193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014225433,0.00021952804,0.00034395055,0.00016478785,0.0001157582,0.00016414636,0.0017883868,0.00006884758,0.000025421828],"category_scores_gemma":[0.000005188864,0.00019303031,0.00035238883,0.00018333342,0.000048266356,0.0003970872,0.0002718978,0.0002017163,0.0000042149277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015913482,0.0005033607,0.0005711467,0.000028297183,0.0008200683,0.00061976066,0.0004862588,0.62311953,0.0000012996779,0.03148289,0.018961314,0.32181475],"study_design_scores_gemma":[0.0027771243,0.000111243724,0.00014192473,0.00015366495,0.000067655106,0.00005735624,0.000014997884,0.96148306,0.0000026168186,0.027947497,0.0070502344,0.00019263696],"about_ca_topic_score_codex":0.000004191421,"about_ca_topic_score_gemma":0.0000041692906,"teacher_disagreement_score":0.7520809,"about_ca_system_score_codex":0.00012061183,"about_ca_system_score_gemma":0.00009321329,"threshold_uncertainty_score":0.78715473},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00467148,0.000031726762,0.9823406,0.00088060263,0.000690864,0.00013230306,3.5213964e-7,0.00008152878,0.011170587],"genre_scores_gemma":[0.9795883,0.0000051662396,0.01908231,0.0010562768,0.00024416993,0.000005058543,5.769025e-7,0.000005433036,0.000012671805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981532,0.00014047146,0.0002589813,0.0003069959,0.00059828855,0.00054202747],"domain_scores_gemma":[0.9979672,0.0008412641,0.00009851452,0.00076455815,0.00011235306,0.00021611455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022649702,0.00013767384,0.0001614022,0.000077127115,0.00035490832,0.0001664119,0.0016336379,0.000047414953,0.000073803116],"category_scores_gemma":[0.00002564259,0.000085285756,0.00005549276,0.00081965345,0.0015032731,0.0010477547,0.0005766878,0.00019435758,0.00009696513],"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.0000058104224,0.00004788277,0.000012232469,0.0000011727552,0.0000022645843,0.0000010993965,0.0003073228,0.0014685722,0.000037883205,0.9571469,0.00022996851,0.040738933],"study_design_scores_gemma":[0.000065522145,0.000098691904,0.000037105954,0.000024199999,0.0000030767737,0.000008030712,0.0000027781502,0.9096573,0.00036971684,0.08959914,0.000028253055,0.00010617304],"about_ca_topic_score_codex":7.1646264e-7,"about_ca_topic_score_gemma":1.7284219e-8,"teacher_disagreement_score":0.9749169,"about_ca_system_score_codex":0.000022517153,"about_ca_system_score_gemma":0.0000524683,"threshold_uncertainty_score":0.55388725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003570551,0.000026413369,0.9200616,0.00036914277,0.0010100299,0.00011162002,1.3792078e-7,0.00021941695,0.07463109],"genre_scores_gemma":[0.98958445,0.000013719213,0.005468629,0.0039999285,0.00031607994,0.000008606117,0.0000041908165,0.000011249094,0.0005931798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983945,0.00013351484,0.00033412065,0.0004251573,0.00018061834,0.0005321229],"domain_scores_gemma":[0.9986073,0.0006022674,0.00008309865,0.00052408146,0.000036940026,0.00014633563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056900014,0.00017723678,0.00025425892,0.000079815436,0.000091364534,0.00014726975,0.0006525798,0.0001134661,0.00007058747],"category_scores_gemma":[0.000015730237,0.00015269237,0.000057793568,0.00044939687,0.00003509268,0.00016757018,0.00020631566,0.00029033652,0.00006901355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022469083,0.000053629323,0.0018720762,0.000003363849,0.000009564914,0.000045266253,0.00005825458,0.024168625,0.0000018665612,0.7867851,0.0245551,0.16242464],"study_design_scores_gemma":[0.00043829647,0.0001128593,0.0011486253,0.00007691285,0.0000022020101,0.000010030115,0.000005103893,0.9866265,0.0000022027127,0.009409575,0.00196421,0.00020348058],"about_ca_topic_score_codex":0.000018201985,"about_ca_topic_score_gemma":0.000035273802,"teacher_disagreement_score":0.9860139,"about_ca_system_score_codex":0.000030701176,"about_ca_system_score_gemma":0.00002757846,"threshold_uncertainty_score":0.6226614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079880185,0.0003383107,0.9177315,0.00016335332,0.000059340477,0.00015866861,0.0000035742216,0.00005753328,0.0016075186],"genre_scores_gemma":[0.920666,0.000058052094,0.07810062,0.00040501388,0.0005407973,0.00003490829,0.000043617667,0.000013702327,0.00013728807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986898,0.000057288333,0.00029959145,0.0003105152,0.00017554821,0.00046728406],"domain_scores_gemma":[0.9994055,0.00014622984,0.00013201775,0.00014825631,0.00007560147,0.00009236705],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00041573745,0.00019740818,0.0004647857,0.00011583089,0.0013215791,0.00047506057,0.000255812,0.00012414083,0.000008787373],"category_scores_gemma":[0.000001147719,0.00019607558,0.00016439667,0.0004409297,0.00008943097,0.00023477367,0.00025882863,0.0001476081,3.1940647e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007200058,0.00016507709,0.004767974,0.00013779153,0.0032307385,0.000039906787,0.044728357,0.055032834,0.000017067001,0.049577843,0.0037799855,0.83845043],"study_design_scores_gemma":[0.00029293422,0.00001871823,0.00038215704,0.000009060676,0.00034811854,0.000017685381,0.0027116435,0.99373865,3.216294e-8,0.0021498417,0.00008968311,0.00024147493],"about_ca_topic_score_codex":0.0003972724,"about_ca_topic_score_gemma":0.00010471076,"teacher_disagreement_score":0.9387058,"about_ca_system_score_codex":0.000017885211,"about_ca_system_score_gemma":0.00001998172,"threshold_uncertainty_score":0.99997854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04030539,0.0034200451,0.9352983,0.0008565271,0.0020719804,0.000396662,0.000007416961,0.000677031,0.016966633],"genre_scores_gemma":[0.9722959,0.0019643782,0.020506183,0.0025684568,0.00090193475,0.0000289058,0.000032853088,0.000056000925,0.0016454358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663997,0.00013314481,0.00063557515,0.0009940236,0.0004929566,0.001104305],"domain_scores_gemma":[0.99772453,0.00026445813,0.00022399325,0.0010370095,0.00014287558,0.0006071534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000570017,0.00049480953,0.0005371842,0.00018533338,0.00046289287,0.0003038789,0.0010201946,0.0004321714,0.00007055434],"category_scores_gemma":[0.000009362077,0.00045644803,0.00021645773,0.0010925119,0.00031147472,0.00051114464,0.0004611136,0.0007266313,0.000059811588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003465671,0.0005351576,0.024061175,0.00005627138,0.0002385001,0.0020797057,0.0008221618,0.005982977,0.000049391034,0.06059063,0.0747964,0.83044106],"study_design_scores_gemma":[0.0009452986,0.00022240619,0.001386863,0.00006899839,0.00003841683,0.00031481407,0.00002496682,0.95461094,0.0000063652146,0.00975587,0.032026708,0.0005983773],"about_ca_topic_score_codex":0.000037463895,"about_ca_topic_score_gemma":0.000019438377,"teacher_disagreement_score":0.94862795,"about_ca_system_score_codex":0.000023481889,"about_ca_system_score_gemma":0.00008920419,"threshold_uncertainty_score":0.9997887},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026567688,0.0001282948,0.98383456,0.0035377594,0.0011078046,0.00047916305,0.000005795898,0.00036801407,0.010272918],"genre_scores_gemma":[0.98473525,0.000027651176,0.006592293,0.0072930814,0.0005446507,0.00003925444,0.000016012737,0.000013947332,0.0007378296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977692,0.000046215177,0.00044921492,0.00061446434,0.00035268447,0.000768247],"domain_scores_gemma":[0.99826115,0.00035381794,0.00014248326,0.0006757243,0.00019472273,0.0003720739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041539565,0.0002856229,0.00042239478,0.00007542979,0.00022348043,0.00043075753,0.0016649558,0.00020653111,0.00006444312],"category_scores_gemma":[0.000005771706,0.00023328405,0.00015784714,0.00032826973,0.000097305965,0.0006670821,0.00014241671,0.0002256574,0.000013552707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013073781,0.00017256443,0.00025170224,0.00000883408,0.000044730703,0.00008213075,0.00006204096,0.0062241456,0.000008746475,0.111505456,0.09930373,0.78220516],"study_design_scores_gemma":[0.0014324114,0.00028350798,0.0003300682,0.000021220108,0.000021439584,0.00002713906,0.00001548752,0.9857437,0.000029744866,0.0054829093,0.006280035,0.0003323503],"about_ca_topic_score_codex":0.000016660166,"about_ca_topic_score_gemma":0.000017484848,"teacher_disagreement_score":0.9844696,"about_ca_system_score_codex":0.000039246606,"about_ca_system_score_gemma":0.00015291775,"threshold_uncertainty_score":0.95130473},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044148024,0.000014556668,0.95261633,0.00020515124,0.00033428727,0.00007897137,0.0000061765245,0.000039029954,0.0025574702],"genre_scores_gemma":[0.95978725,0.000007553183,0.03898913,0.00051967404,0.000025857731,0.0000013742949,0.000002160365,0.000003878591,0.00066310144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901426,0.000067185385,0.0002877211,0.00021615405,0.00024049889,0.00017418852],"domain_scores_gemma":[0.9988752,0.00022832163,0.00011377275,0.0005193843,0.0001446561,0.00011864079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000409118,0.000084486084,0.00023231338,0.000053686264,0.000023694281,0.000040187188,0.0004159501,0.000039244096,0.000057350528],"category_scores_gemma":[0.00003172155,0.00007389337,0.000052381114,0.00022171915,0.000048518174,0.00032969887,0.00021398652,0.00004418198,0.000021382531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009306095,0.00045783227,0.1548267,0.00017922338,0.00015095476,0.000036155958,0.001036329,0.00222431,0.006515365,0.57314533,0.10599809,0.15533665],"study_design_scores_gemma":[0.0004597018,0.00028108814,0.049881354,0.00004465927,0.000007722038,0.000008885898,0.000012355724,0.93153393,0.0032657918,0.0026505527,0.011496333,0.00035760153],"about_ca_topic_score_codex":0.00025251677,"about_ca_topic_score_gemma":0.00007368447,"teacher_disagreement_score":0.92930967,"about_ca_system_score_codex":0.0000054319466,"about_ca_system_score_gemma":0.000029410772,"threshold_uncertainty_score":0.30132842},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014505035,0.000023371951,0.9826204,0.00041346296,0.00094428705,0.00022663765,0.0000017516167,0.000134046,0.001131015],"genre_scores_gemma":[0.9892307,0.000018161316,0.010263982,0.0002421812,0.00014104632,0.000021187854,0.000011137767,0.000010033604,0.00006160401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984046,0.000103415325,0.00055470265,0.00026625546,0.00030225632,0.0003687211],"domain_scores_gemma":[0.9991773,0.00020411276,0.0001695716,0.00024020612,0.00010060118,0.00010820804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079153245,0.00017905852,0.00023797725,0.00031385318,0.00017701568,0.00010651526,0.00033980326,0.0002003486,0.000003524449],"category_scores_gemma":[0.0000046220516,0.00018225421,0.00004402367,0.000709931,0.00004296331,0.00057037995,0.000008640085,0.00078480877,0.0000050493186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001592521,0.00006401235,0.00028813706,0.000012767063,0.000005822825,0.000019448868,0.0024507847,0.45112458,6.180977e-7,0.00093543384,0.00010247183,0.54498],"study_design_scores_gemma":[0.0004843755,0.00008899348,0.00019192367,0.00015728101,0.0000060903913,0.0000141422415,0.00028919365,0.99765086,0.000007440852,0.0003449764,0.00055520603,0.00020949886],"about_ca_topic_score_codex":0.000044299068,"about_ca_topic_score_gemma":0.00004947764,"teacher_disagreement_score":0.9747256,"about_ca_system_score_codex":0.00019550156,"about_ca_system_score_gemma":0.00012108293,"threshold_uncertainty_score":0.74321115},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19756445,0.0006303754,0.80105424,0.00027253357,0.00012507706,0.000098960714,0.0000021332467,0.00019469032,0.00005756661],"genre_scores_gemma":[0.9884993,0.00029101368,0.011032182,0.000112340786,0.000008164114,0.000025584994,0.000005657188,0.000009985205,0.000015815302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988552,0.00008539338,0.00036847807,0.0002563053,0.0001335081,0.00030112817],"domain_scores_gemma":[0.9987309,0.00009535328,0.00010718895,0.00086355495,0.00011391554,0.00008911063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002733773,0.00015422865,0.00034968415,0.00075144036,0.00016248929,0.000024340221,0.00048805954,0.00029517603,0.000010451629],"category_scores_gemma":[0.000002192516,0.00015101462,0.00012540237,0.0015164695,0.00014140535,0.00023457516,0.0000140522325,0.00038938547,0.0000028052668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020134436,0.0002613698,0.0006302129,0.000005716277,0.0009476299,0.000007400465,0.00027218641,0.8071111,0.0003135519,0.007991928,0.000013995215,0.18242481],"study_design_scores_gemma":[0.00020485457,0.000052150714,0.000058761332,0.000021974132,0.0003864904,0.000033943703,0.00006917345,0.9982073,0.00049353007,0.00029548907,0.00003248548,0.00014387384],"about_ca_topic_score_codex":0.000040418323,"about_ca_topic_score_gemma":0.000045115456,"teacher_disagreement_score":0.7909348,"about_ca_system_score_codex":0.000028895527,"about_ca_system_score_gemma":0.000017288672,"threshold_uncertainty_score":0.61581975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007191658,0.00017063128,0.99310166,0.0013013481,0.00051139086,0.00046795374,0.000009418191,0.00016967735,0.003548756],"genre_scores_gemma":[0.90823364,0.000024756248,0.08834275,0.0008563993,0.0002622716,0.00007675079,0.00023904818,0.000012711446,0.0019516612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986723,0.000025743726,0.00027227838,0.00048860256,0.00019092167,0.00035011847],"domain_scores_gemma":[0.998155,0.0002522904,0.000075515134,0.0012273109,0.00014185805,0.00014799963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034649286,0.00014024905,0.00016179352,0.000037694506,0.00014252207,0.00031107024,0.0013836528,0.00009669588,0.00011999356],"category_scores_gemma":[0.0000071206955,0.00011144962,0.000046670837,0.00016688507,0.00002704745,0.00094962923,0.0004304852,0.00009418158,0.00006214276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037055188,0.000059771228,0.00008847517,0.0000084718395,0.00002282069,0.000009246296,0.000048669237,0.00087883836,0.00002433598,0.022003893,0.25485396,0.7219978],"study_design_scores_gemma":[0.00015989595,0.000036915153,0.0001443678,0.000016265963,0.000009128086,0.000014611143,0.00001214072,0.9822893,0.00000890466,0.0017516569,0.015383037,0.00017375314],"about_ca_topic_score_codex":0.000025834026,"about_ca_topic_score_gemma":0.0000072289827,"teacher_disagreement_score":0.9814105,"about_ca_system_score_codex":0.00001398076,"about_ca_system_score_gemma":0.0000339157,"threshold_uncertainty_score":0.45447835},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054210785,0.030593365,0.96290874,0.002380689,0.0005565516,0.00066715997,0.000002113271,0.00027685915,0.0020723876],"genre_scores_gemma":[0.425749,0.054043982,0.48285416,0.03651223,0.00038141626,0.0000506097,0.00016608606,0.00006482376,0.00017769934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708396,0.0004493226,0.0010346335,0.0005092214,0.0004035631,0.00051927933],"domain_scores_gemma":[0.99266964,0.0009558234,0.0005238683,0.005322299,0.00026453394,0.00026384037],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002118364,0.00034167396,0.00059908984,0.00014910953,0.00023744645,0.0004568637,0.009237562,0.0001246985,0.00008140942],"category_scores_gemma":[0.000034116187,0.0003254503,0.00020131568,0.0008284617,0.00011360757,0.0011055593,0.0060563167,0.000529835,0.00013791093],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000619294,0.00015113199,0.0007216072,0.00042055477,0.00004841046,0.000029499632,0.00014161308,0.00005685101,0.0000035409457,0.0075338683,0.04261196,0.9482748],"study_design_scores_gemma":[0.0005711552,0.00005398231,0.0013014234,0.006872043,0.00007564732,0.00020976206,0.00000501503,0.68949175,0.000039211172,0.002131918,0.2984112,0.00083686685],"about_ca_topic_score_codex":0.00007591883,"about_ca_topic_score_gemma":0.000015955862,"teacher_disagreement_score":0.9474379,"about_ca_system_score_codex":0.00011205198,"about_ca_system_score_gemma":0.000105865234,"threshold_uncertainty_score":0.9999198},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019410852,0.000240482,0.93621427,0.003171782,0.00020872116,0.00011660959,5.93136e-7,0.00013261306,0.05797385],"genre_scores_gemma":[0.9690129,0.00006410078,0.02318521,0.0049809925,0.000049587758,0.0000034748286,0.000009558354,0.0000075245766,0.0026866097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989673,0.00006202068,0.00025583303,0.00020498715,0.00021883709,0.00029100437],"domain_scores_gemma":[0.9982418,0.00030154508,0.00007960644,0.0011742631,0.00008235598,0.000120437595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011084304,0.00010963356,0.000103673716,0.000034919733,0.0003220503,0.00017276139,0.0012131315,0.0000669478,0.000070478716],"category_scores_gemma":[0.0000033529743,0.00007053361,0.000049826198,0.00023638787,0.00012307853,0.00017791997,0.00030775016,0.00018241107,0.00011390048],"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.000006047132,0.000064737054,0.0001539107,0.000003595009,0.000021904529,0.000035361823,0.00020091099,0.000054020755,0.00030016204,0.8887596,0.0163738,0.094025925],"study_design_scores_gemma":[0.0006402275,0.00009590603,0.0036787991,0.00004619627,0.000038032653,0.00019186058,0.00067604583,0.81463915,0.00050255697,0.04308924,0.13579383,0.00060813327],"about_ca_topic_score_codex":0.000044220167,"about_ca_topic_score_gemma":0.000027634556,"teacher_disagreement_score":0.96707183,"about_ca_system_score_codex":0.000026657637,"about_ca_system_score_gemma":0.000077516605,"threshold_uncertainty_score":0.28762773},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025498588,0.00019648713,0.99390924,0.00042868283,0.0013187373,0.00029334144,0.0000011283769,0.00011121677,0.0011913325],"genre_scores_gemma":[0.9313566,0.000025227628,0.0681088,0.00023163696,0.00024313976,0.000016417876,0.0000050348804,0.0000032666328,0.000009882255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787587,0.000033205273,0.00049156084,0.0004063606,0.00066313415,0.0005298958],"domain_scores_gemma":[0.9975711,0.00026767972,0.00033770152,0.0012427908,0.0004137217,0.00016701083],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001544322,0.00014313783,0.00014788016,0.00011353153,0.0006531843,0.0011594259,0.0042921156,0.00005125593,0.0000018422085],"category_scores_gemma":[0.000036206893,0.00010019325,0.000028948682,0.0013044311,0.0004869714,0.0066437144,0.001587545,0.00017835919,0.000047226735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025271434,0.000022533322,0.0014030354,0.000014274336,0.000006758881,7.260292e-7,0.0004849636,0.004317767,0.000008987646,0.11901862,0.0025025178,0.8722173],"study_design_scores_gemma":[0.00009986962,0.00004226303,0.0025512986,0.000022293665,0.0000028622749,0.000019942941,0.000031732754,0.9904542,0.000006998504,0.0057392525,0.00089934125,0.00012994565],"about_ca_topic_score_codex":0.00007968554,"about_ca_topic_score_gemma":0.0000030963504,"teacher_disagreement_score":0.98613644,"about_ca_system_score_codex":0.00007971469,"about_ca_system_score_gemma":0.00049849896,"threshold_uncertainty_score":0.99987745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11954167,0.029086778,0.83687603,0.0005687171,0.0003353188,0.0005356986,0.0000024261885,0.0006897853,0.012363599],"genre_scores_gemma":[0.8920601,0.048470564,0.059160467,0.00020435678,0.000059067235,0.0000062876325,0.0000018437788,0.000007506305,0.000029816167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889505,0.00001544521,0.00048019644,0.00013708815,0.00016193047,0.00031027774],"domain_scores_gemma":[0.9991609,0.00019060694,0.000209466,0.00029511916,0.00005016659,0.000093756185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036042908,0.00018160664,0.00030080488,0.000075123586,0.00021580845,0.0002684022,0.00024588176,0.00012702499,0.0000011379051],"category_scores_gemma":[0.000008789805,0.00015067772,0.000017377022,0.00013340548,0.0002018451,0.00035497648,0.000532307,0.00017078967,0.0000020282257],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015157959,0.000013359034,0.00032396617,0.00023030648,0.00001490752,0.000008993344,0.0060517965,0.000028188473,5.456484e-7,0.022721836,0.00029912888,0.97030544],"study_design_scores_gemma":[0.00028009724,0.00019539747,0.00007660609,0.00013412327,0.000011955665,0.00030955684,0.005988714,0.96322984,0.0000036507474,0.007259772,0.022284266,0.00022605316],"about_ca_topic_score_codex":0.0000014727102,"about_ca_topic_score_gemma":0.000001174129,"teacher_disagreement_score":0.9700794,"about_ca_system_score_codex":0.0000075687085,"about_ca_system_score_gemma":0.000018136981,"threshold_uncertainty_score":0.61444587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010079999,0.04868661,0.92344666,0.0011252855,0.000527943,0.0010726834,0.000005290962,0.00012177992,0.024005761],"genre_scores_gemma":[0.94391537,0.049625736,0.0021558509,0.000433145,0.0029484762,0.0007649197,0.000033326527,0.000014277796,0.00010890634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880815,0.00006343831,0.00028493963,0.0003180135,0.00011780732,0.00040765968],"domain_scores_gemma":[0.9987416,0.00019426054,0.00010543712,0.0007302094,0.000023893044,0.00020457483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002907538,0.00016980582,0.00020205314,0.00006156443,0.00036469224,0.00011905292,0.0004496259,0.00009554794,0.000018181088],"category_scores_gemma":[7.4640207e-7,0.00016175317,0.00002429504,0.00041750047,0.00013622464,0.00029104186,0.0003282385,0.0002818663,0.000010807702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041555018,0.00015440947,0.0029293792,0.000004161699,0.000005089594,5.6127965e-7,0.00013067835,0.0028923454,6.067945e-7,0.027930206,0.0012449054,0.9647035],"study_design_scores_gemma":[0.0001559677,0.000034360917,0.0014869047,0.000021091702,0.000005999957,0.0000073590795,0.00003512801,0.33228305,4.8624713e-7,0.0011151489,0.66470706,0.0001474239],"about_ca_topic_score_codex":0.000014148526,"about_ca_topic_score_gemma":0.000037097678,"teacher_disagreement_score":0.9645561,"about_ca_system_score_codex":0.000025191106,"about_ca_system_score_gemma":0.000014866841,"threshold_uncertainty_score":0.6596103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5456097,0.003514865,0.44850907,0.000045794855,0.00058403413,0.0002755988,8.924073e-7,0.000116700074,0.0013433163],"genre_scores_gemma":[0.99554276,0.000084264015,0.002890189,0.0004313582,0.0009816495,0.00002468302,0.0000058380874,0.00001599391,0.000023260005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819773,0.00011048296,0.00038212538,0.00037559384,0.00018069992,0.0007533753],"domain_scores_gemma":[0.9990482,0.00035671628,0.00011761436,0.00019522762,0.000062393316,0.00021988305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066844764,0.00020873276,0.00032019324,0.00008107597,0.00043034888,0.0001787263,0.0002870549,0.00013250255,0.000007924653],"category_scores_gemma":[0.000010572525,0.00020893454,0.00006699637,0.000263814,0.000060752587,0.00047464704,0.00041490726,0.00032997265,0.0000042513707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000966745,0.00013511242,0.14004885,0.000039078077,0.000023293882,0.000045129866,0.011792347,0.0022786197,0.00009249029,0.0011797505,0.00032440032,0.8440313],"study_design_scores_gemma":[0.0005036385,0.00007652674,0.011454747,0.00011053728,0.000011422715,0.00006679122,0.00071190856,0.98411906,0.000028641016,0.000081959835,0.0025415998,0.00029316114],"about_ca_topic_score_codex":0.000040462623,"about_ca_topic_score_gemma":0.000004731707,"teacher_disagreement_score":0.98184043,"about_ca_system_score_codex":0.00004840135,"about_ca_system_score_gemma":0.000049463786,"threshold_uncertainty_score":0.8520103},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010632443,0.000049696555,0.9627297,0.00006193936,0.0001967159,0.000108959044,0.000025666099,0.00025221653,0.03551187],"genre_scores_gemma":[0.884695,0.000008160457,0.11394474,0.0005273934,0.00005401744,0.000020870599,0.000047397625,0.0000056747476,0.00069676875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917054,0.000025037732,0.00013980895,0.0002782324,0.0001379635,0.00024839028],"domain_scores_gemma":[0.9990884,0.000035461664,0.000035519763,0.00064889767,0.000031906784,0.00015979091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011076616,0.000104529885,0.00010566307,0.000034281737,0.00006606153,0.000043216805,0.00061895343,0.000042219588,0.000383979],"category_scores_gemma":[0.0000019331944,0.000079043704,0.000041325264,0.00020611142,0.000038807608,0.00017223322,0.00026641472,0.00012023931,0.000120652156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041826483,0.00046403316,0.0009400145,0.000023175602,0.00005334527,0.00062958745,0.0018079882,0.00005595192,0.00015290164,0.21222435,0.064858615,0.7187482],"study_design_scores_gemma":[0.0009549846,0.0004006326,0.00077214336,0.00004213369,0.000026122154,0.0002825907,0.00012393498,0.8616677,0.0010749699,0.026440952,0.107320555,0.00089330686],"about_ca_topic_score_codex":0.000044073597,"about_ca_topic_score_gemma":0.0000069286593,"teacher_disagreement_score":0.8836317,"about_ca_system_score_codex":0.0000071693858,"about_ca_system_score_gemma":0.000042656946,"threshold_uncertainty_score":0.4204301},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10978103,0.00008754641,0.87896407,0.00010830987,0.0005292414,0.00019076586,3.5017416e-7,0.00016991432,0.010168794],"genre_scores_gemma":[0.9783015,0.0000032428447,0.020563046,0.00018186533,0.00010612672,0.000032153053,9.657133e-7,0.0000059613308,0.0008051394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899733,0.0000372462,0.00020860111,0.00021383654,0.00016420083,0.00037878272],"domain_scores_gemma":[0.9993918,0.00005019168,0.000041147872,0.0003342682,0.000031846048,0.0001507511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032433096,0.0001053267,0.000118322394,0.00007466877,0.0000493722,0.00005802954,0.00026972187,0.00007774478,0.00007166743],"category_scores_gemma":[0.00000826041,0.00009073439,0.00003557579,0.00030836064,0.000026826881,0.00045275563,0.00010159423,0.00013507261,0.00012857723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023157234,0.0008318256,0.0471345,0.00003828217,0.000010266617,0.0000486358,0.0010749176,0.000032255135,0.0013271851,0.052235126,0.0010813349,0.8961625],"study_design_scores_gemma":[0.00069706433,0.000115798,0.024327919,0.00003730658,0.000011895705,0.00011117042,0.000070338516,0.9650174,0.0005464558,0.0026303327,0.0059335264,0.0005008073],"about_ca_topic_score_codex":0.000050483588,"about_ca_topic_score_gemma":0.00003926736,"teacher_disagreement_score":0.96498513,"about_ca_system_score_codex":0.0000516171,"about_ca_system_score_gemma":0.00003657783,"threshold_uncertainty_score":0.37000412},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047364016,0.000013692671,0.985483,0.00047199728,0.00045731082,0.0037211431,7.842783e-7,0.00010641529,0.0050092726],"genre_scores_gemma":[0.9424273,0.0000019592726,0.056305967,0.00022734702,0.00013892529,0.0008674195,2.0890644e-7,0.000006822122,0.000024063631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690604,0.0004973373,0.0006388672,0.0005612059,0.0007978056,0.0005987148],"domain_scores_gemma":[0.9956537,0.0021929834,0.00022332951,0.0013149241,0.00030515087,0.00030992943],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0077911564,0.00019849539,0.0005088465,0.00008724527,0.0007974552,0.0005817824,0.002721752,0.00006144791,0.000017534057],"category_scores_gemma":[0.00012806291,0.00011357855,0.00017087157,0.00076826924,0.008134728,0.00031704057,0.00096106285,0.00022598048,0.000022146907],"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.00022884026,0.000046780187,0.0000088907545,0.0000039825336,0.0000034167763,0.00006624793,0.00013865458,0.000014026605,0.000017343064,0.831326,0.000036028177,0.16810977],"study_design_scores_gemma":[0.0057756538,0.00014816286,0.00001640757,0.00003668511,0.0000140539005,0.0005583699,0.000003982677,0.90322,0.00032249556,0.089549966,0.00019041508,0.00016380404],"about_ca_topic_score_codex":0.000005241139,"about_ca_topic_score_gemma":7.625222e-7,"teacher_disagreement_score":0.9376909,"about_ca_system_score_codex":0.00002187574,"about_ca_system_score_gemma":0.00015154436,"threshold_uncertainty_score":0.99456453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013436511,0.000035459547,0.9837512,0.0001241142,0.0009148043,0.00041825764,0.00007182054,0.00041903942,0.00082881085],"genre_scores_gemma":[0.98060906,0.000010601185,0.017645357,0.0014152556,0.000056915353,0.000067764464,0.000031314386,0.000028823553,0.0001348901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976092,0.00024563263,0.00050850573,0.00069468684,0.0004091173,0.0005328564],"domain_scores_gemma":[0.99822915,0.0005302414,0.00015390007,0.00056630094,0.0002644693,0.00025595273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032865469,0.00034090402,0.0003287539,0.00021056981,0.0005332397,0.00014321672,0.0005357255,0.00015935407,0.00033948114],"category_scores_gemma":[0.0000012991121,0.00034560467,0.00020253076,0.000499781,0.00018392742,0.0002860519,0.000007817929,0.00045514453,0.00008699344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009864405,0.000770596,0.000020816065,0.000027720678,0.00011710629,0.00008755338,0.0011874824,0.90489596,0.000104369865,0.0033154516,0.0002816616,0.08909264],"study_design_scores_gemma":[0.0007745809,0.00032655572,0.000056315635,0.00011730054,0.000030027091,0.000038092705,0.0002397093,0.9965335,0.00032686713,0.001046496,0.000107588596,0.00040294332],"about_ca_topic_score_codex":0.00011159585,"about_ca_topic_score_gemma":0.000057373833,"teacher_disagreement_score":0.96717256,"about_ca_system_score_codex":0.00018960114,"about_ca_system_score_gemma":0.00038547898,"threshold_uncertainty_score":0.9998996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041762084,0.0020459145,0.9418198,0.0010948551,0.004161457,0.00029464313,0.000003835122,0.00018404196,0.008633405],"genre_scores_gemma":[0.9853289,0.00032435046,0.012665056,0.00034109544,0.0010578402,0.000018909517,0.000009893787,0.000012881257,0.0002410374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998259,0.00015136292,0.00039103898,0.00044567007,0.0001896293,0.00056326314],"domain_scores_gemma":[0.9981801,0.00035176493,0.00015477995,0.0010773161,0.000055688608,0.0001803754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082747056,0.00018808476,0.00027082468,0.000030019033,0.00023578326,0.00017827774,0.00084787677,0.00018051105,0.0000043978903],"category_scores_gemma":[0.0000059184827,0.00019050275,0.000039104307,0.0005094466,0.00018177919,0.00035414123,0.00016061674,0.00067104556,0.00000421753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028436576,0.00034673116,0.23444304,0.00009363022,0.000065253305,0.0001806541,0.0012601583,0.012323319,0.00004335593,0.47228295,0.12307372,0.15560281],"study_design_scores_gemma":[0.0011027419,0.000031530424,0.1148207,0.00028677037,0.000018223094,0.00002029521,0.000021231152,0.72110647,0.000008981633,0.10238162,0.059325434,0.00087601633],"about_ca_topic_score_codex":0.00003605086,"about_ca_topic_score_gemma":0.0018977515,"teacher_disagreement_score":0.94356686,"about_ca_system_score_codex":0.000024419676,"about_ca_system_score_gemma":0.00004085858,"threshold_uncertainty_score":0.77684766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031852167,0.00012170356,0.95825726,0.008779581,0.00013194652,0.0004655989,0.000020528103,0.00012258117,0.00024864025],"genre_scores_gemma":[0.9373495,0.000007069249,0.051765148,0.010204679,0.00036806325,0.000050439026,0.00007842649,0.000027895268,0.00014881068],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708414,0.00019653763,0.00069398835,0.00080617756,0.000528064,0.0006911056],"domain_scores_gemma":[0.9978547,0.0007641727,0.00046678723,0.0006028939,0.00017772477,0.00013373255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077387143,0.00037481965,0.0009904011,0.00037282665,0.00034232577,0.00019477247,0.0012157019,0.0002793983,0.000023082235],"category_scores_gemma":[0.000042276308,0.00033032743,0.00035027353,0.0018191204,0.00009847001,0.00046237477,0.00021093522,0.00035272122,0.000004063525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017025078,0.0023489369,0.010486913,0.00012618827,0.0033143556,0.00031671146,0.009236993,0.0035452384,0.033489134,0.022214102,0.6421306,0.2710883],"study_design_scores_gemma":[0.0030626277,0.0003921645,0.0101039875,0.00006661214,0.00093568675,0.000018875036,0.00014172315,0.9777027,0.00037203493,0.0024552548,0.0039005722,0.00084777],"about_ca_topic_score_codex":0.00009444071,"about_ca_topic_score_gemma":0.00003719096,"teacher_disagreement_score":0.97415745,"about_ca_system_score_codex":0.000082919556,"about_ca_system_score_gemma":0.00009901909,"threshold_uncertainty_score":0.9999149},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063254545,0.000018969997,0.96277535,0.002560673,0.00075290725,0.00016780528,0.0000022102952,0.00024764155,0.027148962],"genre_scores_gemma":[0.8681442,0.0000027261237,0.12625831,0.0029663066,0.000058742335,0.000019482919,0.000006933141,0.000009379168,0.0025338668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990879,0.000009538229,0.00016161246,0.00030586187,0.000134157,0.00030090718],"domain_scores_gemma":[0.99909556,0.00014363813,0.000048521044,0.00049508305,0.00009177154,0.0001254162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022386776,0.000113523376,0.00012547498,0.000043025793,0.00011932502,0.00013818915,0.0006571238,0.00007457552,0.000068576905],"category_scores_gemma":[0.0000032319592,0.00009579526,0.000045267258,0.000179126,0.00001630946,0.0002510736,0.00014129096,0.00014887241,0.000055140983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018498346,0.00013579713,0.00027301523,0.000082631595,0.000048005626,0.000047051937,0.0007614473,0.00013042532,0.0025007848,0.4547562,0.01872352,0.5225226],"study_design_scores_gemma":[0.00024023635,0.000019366122,0.00008082456,0.0000071851514,0.000005214003,0.000030195446,0.000020261588,0.96951735,0.000050872437,0.008249445,0.021631265,0.00014775555],"about_ca_topic_score_codex":0.000025196841,"about_ca_topic_score_gemma":0.00018539715,"teacher_disagreement_score":0.96938694,"about_ca_system_score_codex":0.000007094854,"about_ca_system_score_gemma":0.00007455438,"threshold_uncertainty_score":0.39064172},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039499835,0.000011744357,0.98422,0.0007692711,0.00056994916,0.00027290688,0.0000025982376,0.00036275838,0.009840763],"genre_scores_gemma":[0.88560694,0.0000012746766,0.10703491,0.006835177,0.00020968347,0.00003379317,0.000023719547,0.00001629932,0.00023822638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840546,0.00024276944,0.00032852968,0.00029557815,0.0002009511,0.00052671967],"domain_scores_gemma":[0.99754196,0.0009851279,0.00012203282,0.0009943442,0.00013682716,0.00021972747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016867346,0.00021249017,0.00031712,0.00006951037,0.0005712846,0.00021777005,0.001074652,0.00015423908,0.000025300076],"category_scores_gemma":[0.000024851852,0.00018653317,0.00016935634,0.00024264156,0.00006424526,0.00024605263,0.00020188304,0.0003845748,0.000016188362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013827873,0.0006438387,0.0015191567,0.0002474818,0.00012967996,0.0000069304833,0.00069956377,0.024118336,0.0001918986,0.33160767,0.08162773,0.55906945],"study_design_scores_gemma":[0.0007541241,0.00013305325,0.00006559743,0.000033066037,0.000011833549,0.0000032270952,0.000016410058,0.9800875,0.00012766781,0.009356886,0.009150566,0.00026002456],"about_ca_topic_score_codex":0.00004103775,"about_ca_topic_score_gemma":0.000016046706,"teacher_disagreement_score":0.9559692,"about_ca_system_score_codex":0.00003135616,"about_ca_system_score_gemma":0.000052142066,"threshold_uncertainty_score":0.76066023},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004156204,0.00011955394,0.9479276,0.0006254833,0.00049859245,0.0002734489,0.000001039729,0.00034036534,0.046057723],"genre_scores_gemma":[0.8607696,0.000011911528,0.13744293,0.00031290774,0.0004591287,0.000027948956,0.000014707189,0.000016556885,0.00094426086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806553,0.00006656067,0.00031968334,0.00042675712,0.0004139169,0.00070757844],"domain_scores_gemma":[0.998044,0.00012551971,0.00018219926,0.0011273246,0.00011493976,0.00040600254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006471933,0.0002185403,0.00021305574,0.00006900405,0.00026858423,0.00023504061,0.0010135762,0.000095737974,0.00009525503],"category_scores_gemma":[0.000010513092,0.00017080581,0.000045255056,0.00043590905,0.000066532164,0.0014101678,0.0005433656,0.00022254851,0.000057295856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008146683,0.0007337374,0.07536851,0.000118614764,0.00013974683,0.00008875612,0.0030412772,0.00006821894,0.00031605878,0.5049877,0.017744256,0.39731163],"study_design_scores_gemma":[0.0002837473,0.000056083478,0.0013471376,0.000058088892,0.000018277957,0.000069819114,0.000062409075,0.97458553,0.000042933636,0.0015285895,0.021557922,0.00038945474],"about_ca_topic_score_codex":0.000020616582,"about_ca_topic_score_gemma":0.000004170312,"teacher_disagreement_score":0.97451735,"about_ca_system_score_codex":0.000044244818,"about_ca_system_score_gemma":0.00012620646,"threshold_uncertainty_score":0.69652593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110690586,0.00013716587,0.8771511,0.000010323564,0.0004898667,0.0002644303,0.0000014018168,0.00008621001,0.011168937],"genre_scores_gemma":[0.98925275,0.0000022514641,0.010480167,0.000030185545,0.00011241049,0.0000034177685,0.0000012337302,0.000011300547,0.00010628728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985488,0.00025716427,0.00043878797,0.00025906332,0.00016898495,0.00032719277],"domain_scores_gemma":[0.99865043,0.0006179065,0.00019664482,0.00039199257,0.00007362738,0.00006937338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026780071,0.000120974735,0.0003035624,0.0001278353,0.0000706352,0.000044946068,0.00070954795,0.000060022525,0.000001777329],"category_scores_gemma":[0.000013783885,0.00011098401,0.00006803585,0.00017569847,0.0001732026,0.00010983871,0.00015613859,0.00011487518,0.000008123251],"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.000027200798,0.000047375357,0.00042292467,0.00014096005,0.000014760868,0.000009538708,0.007926973,0.0012719966,0.000053418247,0.95966583,0.0000793443,0.030339668],"study_design_scores_gemma":[0.00036011208,0.00008070198,0.0004841004,0.00033696982,0.000004425731,0.000013388309,0.00044483694,0.93255323,0.00009021908,0.06540983,0.0000722837,0.0001498867],"about_ca_topic_score_codex":0.000038587033,"about_ca_topic_score_gemma":0.0000010938877,"teacher_disagreement_score":0.93128127,"about_ca_system_score_codex":0.000018990077,"about_ca_system_score_gemma":0.000055361645,"threshold_uncertainty_score":0.45257965},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010684486,0.6239862,0.35193983,0.005900329,0.00041439827,0.0030621036,0.000025068448,0.0010201349,0.0029674773],"genre_scores_gemma":[0.9153225,0.061086856,0.019271819,0.0036871217,0.00021248801,0.00021524611,0.00012464105,0.000017824186,0.00006154897],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971439,0.0004587233,0.0009036165,0.00059394765,0.00027892282,0.0006208592],"domain_scores_gemma":[0.9950893,0.00084832497,0.0004425279,0.0032127902,0.00021568174,0.00019140427],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013729973,0.0003477466,0.00071392034,0.00004609211,0.0013278548,0.00028243812,0.0032990354,0.000117724965,0.000023015711],"category_scores_gemma":[0.000058274367,0.00032285374,0.00022024356,0.0007513434,0.00018991383,0.00026584332,0.0022381393,0.0004932499,0.000027646638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002560853,0.00018482006,0.00032643566,0.00013162657,0.000036611076,0.0000053523245,0.00020756335,0.000079830075,0.000014258019,0.013683928,0.014307042,0.97102],"study_design_scores_gemma":[0.0012335851,0.0007697684,0.0022767743,0.0055883895,0.00028038392,0.00022274647,0.00023160042,0.3936877,0.000015181943,0.010632222,0.5833193,0.0017423269],"about_ca_topic_score_codex":0.000015471125,"about_ca_topic_score_gemma":0.0000019467802,"teacher_disagreement_score":0.9692776,"about_ca_system_score_codex":0.000058504615,"about_ca_system_score_gemma":0.00009035082,"threshold_uncertainty_score":0.9999723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001562711,0.00007920516,0.97287726,0.002513033,0.000093102055,0.00033974196,0.0000013320459,0.00024890446,0.023831764],"genre_scores_gemma":[0.31521782,0.000049048027,0.6807753,0.0013697797,0.000036673693,0.00001863399,0.00001694005,0.000005103604,0.0025107367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902713,0.00005746279,0.00027133874,0.0002495334,0.00014140118,0.00025312713],"domain_scores_gemma":[0.9985629,0.0002912135,0.00009826817,0.00081257743,0.00010434455,0.00013070177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055566255,0.00011759939,0.00014545053,0.000046599405,0.00020726195,0.00015617002,0.00089062273,0.00006586348,0.000024152649],"category_scores_gemma":[0.000011917366,0.0001026336,0.000048801852,0.00013008436,0.000030986586,0.0002556619,0.00008201949,0.00007609327,0.000017645434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014036987,0.00008616675,0.000008394386,0.0000040870664,0.000007716268,0.0000060276548,0.00009970859,0.0019186034,0.000028238474,0.64040256,0.013753215,0.34367123],"study_design_scores_gemma":[0.00022793353,0.00014020783,0.00007009953,0.000012757103,0.0000073449355,0.000012672282,0.000010402964,0.9705119,0.000027512715,0.021323195,0.007508369,0.0001475635],"about_ca_topic_score_codex":0.000002709318,"about_ca_topic_score_gemma":0.0000011461444,"teacher_disagreement_score":0.96859336,"about_ca_system_score_codex":0.000022540959,"about_ca_system_score_gemma":0.00011381267,"threshold_uncertainty_score":0.4185277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014427337,0.000035018165,0.99216956,0.0002810698,0.000069811875,0.00041066133,0.0000017090634,0.000078274075,0.0055111595],"genre_scores_gemma":[0.68578196,0.00005116722,0.31328124,0.00026350928,0.0000127149115,0.000013861721,0.0000152071225,0.000005896902,0.0005744322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880785,0.00009793132,0.000387823,0.0002737127,0.00015223894,0.00028042708],"domain_scores_gemma":[0.99869233,0.00054261996,0.00012472243,0.0005197598,0.00001872017,0.00010183387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056470453,0.00012529225,0.00017934073,0.00006583477,0.00021954897,0.00003774478,0.0006213158,0.00006537135,0.000015443235],"category_scores_gemma":[0.000012592867,0.0001215211,0.00003649354,0.000113641596,0.00013172501,0.00016872791,0.00018701384,0.00009889859,0.000012193858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000978954,0.0009256759,0.005773481,0.000051048806,0.00007764053,0.00030916132,0.004130343,0.013098407,0.00061150367,0.65814036,0.005301655,0.31148282],"study_design_scores_gemma":[0.0005812992,0.000054101743,0.0005941891,0.00002062282,0.0000029175258,0.00005135647,0.000028478069,0.9952953,0.000039141967,0.0015802372,0.001599248,0.00015312969],"about_ca_topic_score_codex":0.000010105047,"about_ca_topic_score_gemma":0.0000022055283,"teacher_disagreement_score":0.98219687,"about_ca_system_score_codex":0.00004129715,"about_ca_system_score_gemma":0.00011934819,"threshold_uncertainty_score":0.49554867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07518156,0.00003310443,0.89423466,0.00038012385,0.0014147332,0.00015017675,5.285694e-7,0.00025128474,0.028353825],"genre_scores_gemma":[0.9137434,0.000007791874,0.08440286,0.00089939643,0.00037252263,0.000011533259,0.0000040760883,0.000016464355,0.00054196484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978285,0.000056132798,0.0004965929,0.00057931157,0.00028565124,0.0007538056],"domain_scores_gemma":[0.99863553,0.00019203716,0.00010653936,0.00074095617,0.00007007775,0.00025484065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075534894,0.0002464369,0.0002962304,0.00011710934,0.00014979305,0.00027115233,0.001001335,0.00017958721,0.00016186864],"category_scores_gemma":[0.0000073794718,0.00021635495,0.000091506205,0.00050219137,0.00007223749,0.00045790325,0.00039510004,0.0008203106,0.000070368704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047567675,0.00032443576,0.01183156,0.000008736945,0.00003717677,0.0011368623,0.0010144304,0.07473117,0.00032368585,0.36051294,0.004248741,0.5457827],"study_design_scores_gemma":[0.00061540445,0.000033583357,0.00041339855,0.0000165022,0.000003920095,0.000120068995,0.000027376876,0.99694026,0.000020359066,0.00051800587,0.0009874757,0.00030367044],"about_ca_topic_score_codex":0.00017483234,"about_ca_topic_score_gemma":0.00025751686,"teacher_disagreement_score":0.9222091,"about_ca_system_score_codex":0.000022315502,"about_ca_system_score_gemma":0.00010966326,"threshold_uncertainty_score":0.88226986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042660427,0.0019121467,0.9820836,0.0032426417,0.0022078059,0.00012581168,0.000011964026,0.000045271918,0.0061047045],"genre_scores_gemma":[0.76259273,0.00020998243,0.23662418,0.00013493997,0.0004071009,0.000002953408,0.0000027989458,0.000006725665,0.000018589511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909335,0.00002195874,0.00040460922,0.00013554785,0.00019531124,0.00014922186],"domain_scores_gemma":[0.9973934,0.0012716071,0.00047212015,0.00016633482,0.0005958202,0.00010070732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038445808,0.00009536058,0.00014349465,0.00023635341,0.00008432971,0.0002490535,0.0007514449,0.0000600905,9.971716e-7],"category_scores_gemma":[0.0002875468,0.000088003515,0.000038751907,0.00012546509,0.00014859783,0.0013090621,0.00046752932,0.0001892168,0.0000011197995],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050591036,0.00006797549,0.004681958,0.000003023169,0.00009103869,0.000050241917,0.0007190091,0.0000011756991,0.000026923626,0.0022964955,0.00015027226,0.9918613],"study_design_scores_gemma":[0.0021253007,0.00052763533,0.00073064223,0.00037083295,0.00006990157,0.008116307,0.00095340505,0.90057635,0.000042107928,0.019890146,0.06622955,0.0003678194],"about_ca_topic_score_codex":0.0000037469192,"about_ca_topic_score_gemma":8.6761617e-7,"teacher_disagreement_score":0.99149346,"about_ca_system_score_codex":0.000020089183,"about_ca_system_score_gemma":0.000054874552,"threshold_uncertainty_score":0.3588679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010454948,0.002085308,0.9181741,0.00039021924,0.00031531425,0.00004064142,1.0275794e-7,0.000079639496,0.07786918],"genre_scores_gemma":[0.9797718,0.00011744878,0.019702164,0.000112920614,0.00016602947,9.334362e-7,1.6374655e-7,0.0000046366836,0.00012388336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927294,0.000013512427,0.00018639531,0.0001368168,0.00016230372,0.00022802674],"domain_scores_gemma":[0.9992476,0.0002468229,0.000053539254,0.00036121372,0.0000344276,0.000056374534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005938162,0.00007590211,0.00010228553,0.000031238018,0.000060354552,0.000028166449,0.00046320268,0.000042649775,0.000010793619],"category_scores_gemma":[0.0000025314305,0.000048498092,0.000038292015,0.00014876967,0.000032984546,0.000093610004,0.00012318666,0.000090795256,0.000004555864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019690349,0.0000122126985,0.000056494435,0.0000069084886,0.000010753726,0.000010788549,0.0003331027,0.00043344594,0.00003138615,0.37029788,0.00045366524,0.6283514],"study_design_scores_gemma":[0.00020366545,0.000049630322,0.0028266774,0.00010541349,0.000008612728,0.000038805363,0.00021317854,0.98439234,0.00067329244,0.006023222,0.0052298806,0.00023527039],"about_ca_topic_score_codex":0.000006349611,"about_ca_topic_score_gemma":0.00000942545,"teacher_disagreement_score":0.9839589,"about_ca_system_score_codex":0.0000064030855,"about_ca_system_score_gemma":0.000017621713,"threshold_uncertainty_score":0.19776948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048994046,0.00003650582,0.94716984,0.0023459077,0.0009354692,0.00030533999,0.0000011350419,0.000025574203,0.00018619775],"genre_scores_gemma":[0.9885285,0.0000030919825,0.008135655,0.0020710393,0.0012420934,0.000002908126,0.0000047182566,0.000010614262,0.0000013668232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979025,0.00030757912,0.00081522425,0.00013313616,0.00046402137,0.0003775251],"domain_scores_gemma":[0.9975475,0.0011854391,0.00046673705,0.00037566788,0.00029801438,0.00012660482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046578576,0.00018620699,0.00025649086,0.00017072597,0.00047037395,0.00027512477,0.00092894863,0.00008709538,0.0000012766857],"category_scores_gemma":[0.00008023473,0.00010758488,0.00007956008,0.00052594696,0.000042569864,0.0002411041,0.00013082566,0.0004945539,0.0000010430545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037597172,0.000013289641,0.00048096155,0.000010925784,0.0000049612922,0.000001049774,0.00094506925,0.75187767,0.000002482682,0.0020958043,0.00036719738,0.24416298],"study_design_scores_gemma":[0.0005189533,0.00017156864,0.006414172,0.00036521498,0.000020582162,0.000043872275,0.0007243664,0.991045,0.0000026645012,0.00014735457,0.00042211515,0.0001241574],"about_ca_topic_score_codex":0.0000059260456,"about_ca_topic_score_gemma":0.0000023718048,"teacher_disagreement_score":0.9395345,"about_ca_system_score_codex":0.00010674574,"about_ca_system_score_gemma":0.00014412079,"threshold_uncertainty_score":0.4387184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25439087,0.000070899616,0.744066,0.00005564804,0.00007437294,0.00012003339,0.0000013073893,0.00006010218,0.0011607441],"genre_scores_gemma":[0.96937406,0.00007175053,0.027861463,0.00026536547,0.000011865106,0.000014954325,0.000005393999,0.0000069579373,0.0023881625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860394,0.000050950162,0.00042516025,0.00035982067,0.00022977187,0.00033036704],"domain_scores_gemma":[0.998974,0.000101574726,0.00012623017,0.00055228616,0.00012316494,0.00012269577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027485867,0.00015665527,0.000366891,0.0003941281,0.00005314104,0.00005540209,0.0006501468,0.00009232429,0.00015585497],"category_scores_gemma":[0.000004314615,0.00013180009,0.00012622598,0.0012284287,0.000056589306,0.00050396554,0.0002488645,0.00013379799,0.00006846669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032847995,0.0018278852,0.17128336,0.000112442816,0.0011131946,0.00006772374,0.0064182146,0.21501882,0.00064823113,0.00089360186,0.002843073,0.59974056],"study_design_scores_gemma":[0.00041832158,0.0000262128,0.043377474,0.00001465337,0.000043894077,0.0000014430376,0.00009125012,0.9557271,0.00007285169,0.00000790462,0.00005589006,0.0001630221],"about_ca_topic_score_codex":0.00087056094,"about_ca_topic_score_gemma":0.00015105265,"teacher_disagreement_score":0.74070823,"about_ca_system_score_codex":0.000023102784,"about_ca_system_score_gemma":0.00003659036,"threshold_uncertainty_score":0.53746516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064530405,0.000111067864,0.95560026,0.0016891678,0.00068146165,0.0002648444,0.0000037952868,0.00023245697,0.03496393],"genre_scores_gemma":[0.94932187,0.00007263024,0.047895506,0.0014588572,0.00007268976,0.000038277234,0.000045355588,0.000013331203,0.0010814902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831194,0.00015470537,0.00048036457,0.000424898,0.00018209877,0.00044599385],"domain_scores_gemma":[0.99746335,0.00032506502,0.0000922433,0.0017016546,0.00021255176,0.0002051606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005410493,0.00022923677,0.00029468245,0.00012494404,0.00022239849,0.00024941142,0.0019974934,0.0002044224,0.0001952551],"category_scores_gemma":[0.00001479051,0.00018425078,0.000060656017,0.00083963946,0.00019440791,0.0004091202,0.0005250219,0.0010342891,0.00007349334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004890337,0.00074201607,0.0073878774,0.000006452215,0.00007073937,0.00020544618,0.0020442698,0.002830518,0.0004231555,0.6860873,0.01809995,0.28205338],"study_design_scores_gemma":[0.00040559456,0.000046745652,0.00053624314,0.000020413661,0.0000044379585,0.000045540633,0.00006992545,0.98578453,0.000012588677,0.0006045737,0.012214004,0.0002553892],"about_ca_topic_score_codex":0.0003290875,"about_ca_topic_score_gemma":0.00278268,"teacher_disagreement_score":0.982954,"about_ca_system_score_codex":0.000029904477,"about_ca_system_score_gemma":0.00019925192,"threshold_uncertainty_score":0.75135285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047701728,0.00006202634,0.9448983,0.00023877302,0.0004597141,0.00022251409,9.279704e-7,0.00021850424,0.0061975024],"genre_scores_gemma":[0.8870325,0.0000073616975,0.11154664,0.0010215101,0.00019799905,0.000013470465,0.000008328086,0.000013722621,0.00015843798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790657,0.00018640977,0.00041594252,0.00061515236,0.00034601497,0.0005299159],"domain_scores_gemma":[0.99861413,0.00018287763,0.00012400863,0.0007203962,0.00010951777,0.00024904325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067593827,0.0002312361,0.00027911682,0.0001267508,0.000119680895,0.00017377207,0.00059081137,0.0001875058,0.000051646028],"category_scores_gemma":[0.0000074254435,0.00020101467,0.000064627784,0.0004532151,0.00006146276,0.00026689982,0.00012781817,0.00031564248,0.0000610191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075132826,0.00037163895,0.001739045,0.0000072777902,0.000019689489,0.00009988897,0.0007185831,0.5422217,0.00005882593,0.15222666,0.00075290503,0.30170867],"study_design_scores_gemma":[0.00047949736,0.00018129067,0.000604703,0.000042006046,0.000003973545,0.000022903992,0.00004325655,0.99710274,0.00002860377,0.00067399145,0.00052622054,0.00029079526],"about_ca_topic_score_codex":0.00009138782,"about_ca_topic_score_gemma":0.000038878,"teacher_disagreement_score":0.8393308,"about_ca_system_score_codex":0.000056034238,"about_ca_system_score_gemma":0.000055560853,"threshold_uncertainty_score":0.81971407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017291527,0.000115909745,0.89432263,0.000037112943,0.00010641457,0.00023975283,2.7855555e-7,0.00007558011,0.08781078],"genre_scores_gemma":[0.99332917,0.000011784891,0.005764723,0.00039748344,0.000027251248,0.000013000956,0.0000027296815,0.0000071255786,0.00044674025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989631,0.000111430614,0.00025940375,0.00028014407,0.00015668338,0.00022920358],"domain_scores_gemma":[0.99921674,0.00017774769,0.00010394691,0.00036854486,0.000052051473,0.000080953905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040310432,0.00011423817,0.00019314977,0.000092186056,0.000030042442,0.000018350804,0.0003892552,0.00010778789,0.00010009103],"category_scores_gemma":[0.000011566596,0.0000998656,0.00004001224,0.0004750488,0.000039326675,0.0001736514,0.0001537516,0.00012852794,0.000013802938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005167361,0.0006913281,0.015727937,0.00004693095,0.00006963837,0.00019352164,0.010566556,0.0029610822,0.00006114666,0.20379558,0.008174621,0.75719494],"study_design_scores_gemma":[0.00048794318,0.00017763839,0.004552443,0.0000427965,0.000005303951,0.000012597704,0.000104210434,0.9906591,0.0003100195,0.0030439177,0.0004603387,0.00014365882],"about_ca_topic_score_codex":0.00016424328,"about_ca_topic_score_gemma":0.000029079594,"teacher_disagreement_score":0.9876981,"about_ca_system_score_codex":0.000021009793,"about_ca_system_score_gemma":0.00004495123,"threshold_uncertainty_score":0.4072401},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29413286,0.0014180297,0.5187922,0.09081754,0.0031460694,0.0012748813,0.00003076331,0.0015100932,0.08887755],"genre_scores_gemma":[0.99749964,0.00006860554,0.00048025104,0.0012996552,0.0005254382,0.000039076083,0.000008721844,0.000015172221,0.000063416664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984971,0.00032819674,0.00024893795,0.0002675162,0.00034676545,0.00031146657],"domain_scores_gemma":[0.99804425,0.00046983268,0.00015699277,0.0011040012,0.00011469381,0.000110200235],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00067177624,0.00016757782,0.00018670611,0.000059190756,0.0016323891,0.00026879794,0.0017059192,0.00011509049,0.0000012805137],"category_scores_gemma":[0.0000061093847,0.00013155345,0.00006378059,0.0003566478,0.0002461121,0.00007631621,0.00046657526,0.00051002996,0.00002742407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025326946,0.00029968575,0.00004822838,0.0000053465283,0.000046432004,0.0000065691156,0.012331692,0.0012773053,0.000031636584,0.7597662,0.031654347,0.19450721],"study_design_scores_gemma":[0.00033400508,0.000049979608,0.00013767846,0.00004479392,0.000013380741,0.0000053090666,0.00040287332,0.97880656,0.000015332918,0.0023178023,0.017657548,0.0002147158],"about_ca_topic_score_codex":0.000023673752,"about_ca_topic_score_gemma":0.000015185932,"teacher_disagreement_score":0.9775293,"about_ca_system_score_codex":0.000069746355,"about_ca_system_score_gemma":0.00011434565,"threshold_uncertainty_score":0.99966735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022584358,0.0000059432796,0.97219217,0.00030533108,0.00029350273,0.0004934369,0.000005142909,0.00011392436,0.0040062177],"genre_scores_gemma":[0.61724395,0.0000025086504,0.38206962,0.00012357885,0.00007320627,0.000069760186,0.000015300351,0.000015699767,0.0003864022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885434,0.000017050563,0.00029199637,0.00030160084,0.0002627152,0.0002723268],"domain_scores_gemma":[0.99876267,0.00026518427,0.00015482873,0.000522689,0.00015172872,0.00014288157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002712438,0.00018145524,0.0002338469,0.00015836523,0.00017036204,0.00018338185,0.00042176954,0.000071437236,0.0000069060407],"category_scores_gemma":[0.000057564695,0.00013302836,0.00007697493,0.00049186987,0.000033584416,0.00022136318,0.0000655452,0.00007886092,0.00004654256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046834866,0.000117209,0.00028693612,0.0002729079,0.00006118193,0.0000034762977,0.002625987,0.00040521662,0.000023900748,0.85293174,0.0070203515,0.13620426],"study_design_scores_gemma":[0.00031075755,0.00039829424,0.00008879819,0.000102909995,0.000030946623,0.000016130089,0.00012868311,0.9273216,0.00010523048,0.069165796,0.0020735147,0.00025732664],"about_ca_topic_score_codex":0.000008306032,"about_ca_topic_score_gemma":0.000024501602,"teacher_disagreement_score":0.9269164,"about_ca_system_score_codex":0.000026180232,"about_ca_system_score_gemma":0.00001937652,"threshold_uncertainty_score":0.5424739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23535249,0.00005438958,0.7635708,0.00003653122,0.00009701791,0.00014770283,0.0000012845783,0.000036779093,0.0007030463],"genre_scores_gemma":[0.98903394,0.0000087282515,0.010701577,0.0001396003,0.000020428517,0.000010015503,0.0000069611565,0.000005423357,0.00007333083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866754,0.000040783852,0.00050819153,0.0003430287,0.00017993516,0.00026052032],"domain_scores_gemma":[0.9991349,0.00016643175,0.00011077568,0.00035453824,0.00009115064,0.00014218033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028680745,0.00013359128,0.00039312922,0.00034786982,0.00004272688,0.00008415027,0.00034484503,0.000054317938,0.00005726421],"category_scores_gemma":[0.000006197408,0.00011658041,0.000073949785,0.00066320616,0.000048274655,0.00018472556,0.0003173129,0.000115599585,0.0000055417245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067604497,0.0001862288,0.003850437,0.000037038717,0.00031817943,0.00003396737,0.0016145869,0.45945266,0.000070111935,0.023912305,0.0001656383,0.5103521],"study_design_scores_gemma":[0.00014927278,0.000043582546,0.0008210115,0.000029150073,0.000066838686,0.000005243039,0.00016856105,0.9976901,7.36926e-7,0.00089329045,0.0000018736736,0.00013033678],"about_ca_topic_score_codex":0.00028255815,"about_ca_topic_score_gemma":0.000015803833,"teacher_disagreement_score":0.7536814,"about_ca_system_score_codex":0.000019671852,"about_ca_system_score_gemma":0.000039637922,"threshold_uncertainty_score":0.4754011},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017442825,0.0013463254,0.9509059,0.0011677763,0.0007952259,0.0006200587,0.0000033038705,0.00057136413,0.04284572],"genre_scores_gemma":[0.80591494,0.001420647,0.18897851,0.0013514471,0.000701069,0.00022877831,0.00019754951,0.000041209092,0.001165882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758804,0.00025271412,0.0005644261,0.00066114235,0.00034540388,0.0005882924],"domain_scores_gemma":[0.9935809,0.00020040799,0.00021982765,0.0053447187,0.0002465261,0.000407654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062671024,0.0002936266,0.00031627712,0.00018148842,0.0006095817,0.00023942556,0.0037498726,0.0001432554,0.0000061452006],"category_scores_gemma":[0.0000051510106,0.00031180258,0.0000816479,0.0017058089,0.000117880496,0.00040653715,0.0007112914,0.00041454862,0.0002409147],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006147802,0.0008489591,0.0002127916,0.0000074460118,0.00003783992,0.000071115384,0.0010790998,0.0036909012,0.00017525449,0.014713909,0.009325238,0.969776],"study_design_scores_gemma":[0.00018482831,0.000067910456,0.000101162244,0.00001860627,0.000013399085,0.00049162377,0.000023526967,0.5902012,0.0000010176939,0.0006444407,0.40800962,0.00024265781],"about_ca_topic_score_codex":0.00001592025,"about_ca_topic_score_gemma":0.00011859453,"teacher_disagreement_score":0.9695333,"about_ca_system_score_codex":0.000114739356,"about_ca_system_score_gemma":0.00008918434,"threshold_uncertainty_score":0.9999334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061522255,0.00057900907,0.9959295,0.00024393071,0.0021030419,0.00012910049,0.000003925871,0.0000368412,0.00035944127],"genre_scores_gemma":[0.7632002,0.000019996536,0.23426984,0.0009214965,0.001499251,0.0000033077893,0.0000059862286,0.00001350104,0.00006641552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818635,0.0002838254,0.0005558037,0.00011253234,0.00032910897,0.000532401],"domain_scores_gemma":[0.99754256,0.0009796614,0.000532522,0.000402441,0.00022738351,0.00031545528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020030832,0.0001794004,0.0003111873,0.00011152355,0.00028441672,0.00007719522,0.000741082,0.00015202924,0.000011643427],"category_scores_gemma":[0.00003169635,0.00015064537,0.0002175374,0.00021163783,0.00004361397,0.0005000731,0.000104299324,0.00086219615,0.0000042380757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015391123,0.0014246122,0.0029152385,0.000019801453,0.00010181852,0.000053039286,0.0005936002,0.16932474,0.0000067614155,0.0016697068,0.03522318,0.7885136],"study_design_scores_gemma":[0.0009919265,0.00032772063,0.0024792098,0.00010575023,0.000024668943,0.00012186933,0.000035980294,0.99062335,0.000002067084,0.0002732853,0.004846469,0.00016770829],"about_ca_topic_score_codex":0.000005698302,"about_ca_topic_score_gemma":6.237054e-7,"teacher_disagreement_score":0.8212986,"about_ca_system_score_codex":0.00009478969,"about_ca_system_score_gemma":0.00010741866,"threshold_uncertainty_score":0.614314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030782723,0.00027730854,0.9852727,0.00044199868,0.0006151651,0.0003401108,0.000003526654,0.00024967498,0.009721213],"genre_scores_gemma":[0.8580183,0.00006707035,0.1374787,0.0018286197,0.00030265003,0.000047593236,0.000013380732,0.000014157255,0.0022295704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847966,0.000028785405,0.0002957096,0.0004625857,0.00022247822,0.0005107497],"domain_scores_gemma":[0.99892145,0.00015426349,0.000089204426,0.00047104337,0.00016191886,0.00020213566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018288825,0.00019616414,0.00024994364,0.000050857903,0.00032153097,0.000072501425,0.00063227036,0.00013647704,0.00005150506],"category_scores_gemma":[0.0000039055253,0.00016389144,0.00013499735,0.00028516742,0.00007785256,0.00033498637,0.00019599583,0.00017336641,0.000029779321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020978636,0.0005601643,0.0035130049,0.000040500297,0.00024120811,0.0008154828,0.0024834245,0.004038313,0.00004347785,0.4340085,0.37320632,0.18083982],"study_design_scores_gemma":[0.00057281076,0.000094830146,0.00009496618,0.000014665136,0.000005607382,0.00010679902,0.000016766879,0.9751965,0.000018164219,0.0012324349,0.022401446,0.000245055],"about_ca_topic_score_codex":0.000013766184,"about_ca_topic_score_gemma":0.000006301904,"teacher_disagreement_score":0.97115815,"about_ca_system_score_codex":0.000029741477,"about_ca_system_score_gemma":0.00012055023,"threshold_uncertainty_score":0.6683299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06758878,0.000034422028,0.92677045,0.00009545493,0.00089377165,0.00009850443,0.0000016705828,0.00006732936,0.004449642],"genre_scores_gemma":[0.9856455,0.000021101683,0.013751465,0.00051983027,0.000043816653,0.000004963954,0.0000032642129,8.377004e-7,0.000009272751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900776,0.000016621041,0.00027185958,0.00013198504,0.0002848664,0.00028692535],"domain_scores_gemma":[0.9994206,0.000032227374,0.00006269132,0.00024938246,0.000079468766,0.00015563467],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011023075,0.00007386389,0.00008132648,0.00021543051,0.000150493,0.00025168477,0.00038020566,0.00003350454,0.0000052238233],"category_scores_gemma":[0.00000514491,0.00006394578,0.000013851041,0.00069659867,0.00015939899,0.015072062,0.00026859684,0.00009035734,0.000036905836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034668305,0.00005214069,0.0165767,0.000017532147,0.0000012493547,4.4050455e-7,0.0034677475,0.00035409952,0.0000147750025,0.04627829,0.00044629557,0.93278724],"study_design_scores_gemma":[0.00012309472,0.000024365918,0.14294848,0.000008097547,4.9604427e-7,0.000019114294,0.00001719767,0.8545633,0.0000075323846,0.00024147962,0.0019826875,0.00006418402],"about_ca_topic_score_codex":0.0000046787873,"about_ca_topic_score_gemma":3.3934458e-7,"teacher_disagreement_score":0.9327231,"about_ca_system_score_codex":0.000050316732,"about_ca_system_score_gemma":0.00007372885,"threshold_uncertainty_score":0.9987036},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047764537,0.0087712,0.97552526,0.000021067304,0.00013835485,0.0008427124,0.0000024879207,0.00015204516,0.0140692415],"genre_scores_gemma":[0.98820835,0.006269414,0.0018651697,0.00029859782,0.00036087548,0.0027201804,0.000017693454,0.000018104123,0.0002416293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984581,0.00004164079,0.0003704736,0.00055483304,0.00012281818,0.00045215528],"domain_scores_gemma":[0.9988979,0.000108597626,0.000120640274,0.0006275207,0.00004868901,0.0001966141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023135822,0.00020596359,0.00024987746,0.00007297989,0.00020468282,0.000073913245,0.00057960086,0.0001488254,0.000042474483],"category_scores_gemma":[4.3490653e-7,0.00019311551,0.000054461263,0.0006029995,0.00012313193,0.00040332554,0.00023412381,0.00027222445,0.000013741118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006899538,0.00014158747,0.0019775655,0.000007781478,0.000005693439,0.000008656925,0.00008231695,0.059533592,5.580159e-7,0.026179617,0.00038726776,0.9116685],"study_design_scores_gemma":[0.0002450595,0.000091483365,0.00072846154,0.000022842647,0.000008680087,0.000015889487,0.00005587334,0.9006452,0.0000012915755,0.0040135165,0.09390564,0.0002660418],"about_ca_topic_score_codex":0.000056364155,"about_ca_topic_score_gemma":0.000062724976,"teacher_disagreement_score":0.9877307,"about_ca_system_score_codex":0.000018898885,"about_ca_system_score_gemma":0.000025927315,"threshold_uncertainty_score":0.7875022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054989634,0.00009690653,0.9876933,0.0011807004,0.0006203322,0.0008869515,0.0000015739887,0.00012728288,0.003893957],"genre_scores_gemma":[0.98152906,0.000018759773,0.016212435,0.0011780665,0.00017578957,0.00022923332,0.000009257455,0.000013878849,0.0006334982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811774,0.000080327474,0.00047355233,0.0004909001,0.00023033502,0.00060716376],"domain_scores_gemma":[0.99823904,0.0005886462,0.00010431961,0.000763435,0.00012534429,0.00017923435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011103159,0.00020064187,0.00027454435,0.00005666706,0.00026038388,0.0003463544,0.0009142394,0.00012710833,0.00007167078],"category_scores_gemma":[0.000022845381,0.00013406467,0.00013841287,0.0003224788,0.00008646771,0.0004110793,0.0002829674,0.00024543924,0.000026519238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017917806,0.00022719242,0.00321403,0.000051062867,0.000055934983,0.000037008853,0.0004671013,0.027836386,0.000033622844,0.17484376,0.015485286,0.7777307],"study_design_scores_gemma":[0.00027617422,0.000033952878,0.00061954826,0.00002586768,0.000008632715,0.000010328663,0.0001224927,0.98885745,0.000003902379,0.008308195,0.0015415695,0.00019186999],"about_ca_topic_score_codex":0.00013130378,"about_ca_topic_score_gemma":0.00001924976,"teacher_disagreement_score":0.9760301,"about_ca_system_score_codex":0.00004817749,"about_ca_system_score_gemma":0.000081313556,"threshold_uncertainty_score":0.5466998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028940596,0.00039628032,0.962852,0.00021766068,0.00029842192,0.000084596475,3.9941176e-7,0.000096686716,0.0071133776],"genre_scores_gemma":[0.9232375,0.000024563555,0.076142564,0.0004041633,0.00009168539,6.348873e-7,0.0000052730215,0.0000051887173,0.00008844016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871504,0.000019038516,0.00026080976,0.00045220763,0.00016158246,0.00039134733],"domain_scores_gemma":[0.99893767,0.00017954502,0.00004369344,0.0006821822,0.00002041504,0.00013650258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013034089,0.00010587128,0.00013380607,0.00008589596,0.00008552801,0.00013285512,0.00072788505,0.00007274121,0.00000796614],"category_scores_gemma":[0.0000069535645,0.00009305919,0.000012307154,0.00032344155,0.000036767095,0.00021943312,0.0008786197,0.00018908747,0.0000058584806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022795306,0.00012295564,0.008736133,0.0000145046115,0.000013715214,0.00037998613,0.00042348218,0.06884044,0.000022345528,0.066979565,0.0007676962,0.8536764],"study_design_scores_gemma":[0.00022124026,0.000009411742,0.0014344014,0.000025972213,0.000001876651,0.000023634657,0.00005915227,0.9974688,0.000003427928,0.00020778549,0.00041745033,0.00012681821],"about_ca_topic_score_codex":0.00003503219,"about_ca_topic_score_gemma":0.0000604922,"teacher_disagreement_score":0.9286284,"about_ca_system_score_codex":0.000016435511,"about_ca_system_score_gemma":0.000030361356,"threshold_uncertainty_score":0.37948436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027663177,0.0007798224,0.99353576,0.000056576562,0.0013426183,0.00056381954,0.000250565,0.00028732576,0.00041719005],"genre_scores_gemma":[0.9980337,0.00025202296,0.0011683551,0.000076470606,0.00007752333,0.0001404394,0.00016270869,0.000023430204,0.00006534212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727696,0.00020990024,0.00079982914,0.00071898196,0.00032205918,0.00067228853],"domain_scores_gemma":[0.9985594,0.00013020234,0.00020330085,0.000635645,0.0001301213,0.00034128927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034119166,0.00040511068,0.0005263621,0.00017089554,0.00033450162,0.00021263298,0.00048069458,0.0003327406,0.000031374006],"category_scores_gemma":[0.0000020456926,0.0003774464,0.000114488845,0.000761147,0.00010571285,0.0004508133,0.000009434296,0.00043370505,0.000031038355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017043043,0.0006159179,0.00062886364,0.000059201968,0.00010068357,0.00028602176,0.0004819018,0.9726516,0.000005123971,0.0031281048,0.0007474124,0.021124741],"study_design_scores_gemma":[0.0012099975,0.00022395089,0.00058321905,0.00013674588,0.000035293346,0.00018682067,0.00013387534,0.9964556,0.0000060762313,0.00016850501,0.00041121047,0.000448698],"about_ca_topic_score_codex":0.0004645068,"about_ca_topic_score_gemma":0.000089752546,"teacher_disagreement_score":0.9952674,"about_ca_system_score_codex":0.00016582034,"about_ca_system_score_gemma":0.00011568276,"threshold_uncertainty_score":0.99986774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25997353,0.00023909716,0.73626757,0.00007013103,0.00020326769,0.00003519649,4.4931292e-7,0.000021349537,0.0031893966],"genre_scores_gemma":[0.98301667,0.00003626812,0.016535098,0.00022890577,0.00007829166,0.000002169404,0.0000022274837,0.000003652693,0.000096716496],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891925,0.000052934807,0.00032760427,0.00021932066,0.00012095811,0.00035993662],"domain_scores_gemma":[0.9992903,0.00022131224,0.00005992751,0.0002558388,0.000044254823,0.00012840235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900354,0.000094486786,0.000302373,0.0001790156,0.000043730957,0.00004467646,0.00019003311,0.00010309897,0.000055464814],"category_scores_gemma":[0.000006613189,0.00008137823,0.000057301768,0.0005397729,0.00006024012,0.0003132368,0.00018976622,0.00012438316,0.0000021862165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029006986,0.00015816354,0.7689914,0.000010125067,0.00025804868,0.000019451343,0.0011633731,0.03452461,0.000045113156,0.062327273,0.00002803721,0.1324454],"study_design_scores_gemma":[0.00019132772,0.000012154411,0.0051845126,0.00000415886,0.0000533506,0.0000059551808,0.000028705139,0.9940532,0.000007655846,0.000274097,0.00008927237,0.00009561103],"about_ca_topic_score_codex":0.000118886666,"about_ca_topic_score_gemma":0.000040883744,"teacher_disagreement_score":0.95952857,"about_ca_system_score_codex":0.0000127902695,"about_ca_system_score_gemma":0.00001981927,"threshold_uncertainty_score":0.33185083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043443754,0.00009579576,0.9463552,0.00059414667,0.00013499346,0.00012125472,0.0000023401371,0.00012929105,0.00912319],"genre_scores_gemma":[0.97490823,0.00001887335,0.023714798,0.0007669715,0.00007023323,0.000012307256,0.000002577339,0.000007847047,0.0004981607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858993,0.000072673036,0.00027583132,0.00046702765,0.00019929803,0.0003952441],"domain_scores_gemma":[0.9989631,0.00018244397,0.000051523577,0.00055585906,0.00005418814,0.00019284214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045238016,0.00016306089,0.00024818088,0.00010584421,0.00008538062,0.000111785266,0.00040694137,0.00009139969,0.00006907108],"category_scores_gemma":[0.000012700198,0.00013665183,0.000040474788,0.00030489042,0.00011100708,0.0002953311,0.00027352435,0.00016397073,0.00003825817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038269056,0.00063592696,0.070171006,0.00011826848,0.000052539708,0.0001333187,0.00087980775,0.000071973576,0.0002179609,0.42134157,0.0052343705,0.50110495],"study_design_scores_gemma":[0.00038160305,0.000109183246,0.0032637406,0.000018631792,0.000003740595,0.000033716457,0.00007530913,0.9803812,0.000046270325,0.011611049,0.0038430577,0.00023247782],"about_ca_topic_score_codex":0.00050326134,"about_ca_topic_score_gemma":0.00020395951,"teacher_disagreement_score":0.98030925,"about_ca_system_score_codex":0.000032093503,"about_ca_system_score_gemma":0.000040227733,"threshold_uncertainty_score":0.55725},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018359262,0.49431512,0.5040007,0.0000038648163,0.00065139425,0.00066797296,0.000053284362,0.0000592348,0.000064858374],"genre_scores_gemma":[0.034974866,0.92970675,0.034003887,0.00011343196,0.00065871066,0.00009245789,0.00035165294,0.00007503715,0.000023174945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989179,0.0072114337,0.0014331432,0.001193941,0.0003564522,0.00062604086],"domain_scores_gemma":[0.9809013,0.014573124,0.0012103219,0.0029559825,0.00019243034,0.00016682767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013627543,0.00063768507,0.0024664148,0.00007431083,0.0003228736,0.00031108782,0.0035214694,0.00039116803,0.000003834094],"category_scores_gemma":[0.00008875344,0.00045951497,0.00030761017,0.00068262906,0.00028406593,0.00013439654,0.0028855104,0.00072280143,0.000007824171],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011110967,0.00003641011,0.001000238,0.0006102282,0.000104871906,0.0000038961834,0.00008872728,0.00015656129,2.604192e-8,0.000098726865,0.000513876,0.9973853],"study_design_scores_gemma":[0.0006062599,0.0001650093,0.0029958182,0.011940606,0.00027981988,0.00004157403,0.000015145785,0.5921377,1.7675036e-7,0.004738209,0.38548756,0.0015921268],"about_ca_topic_score_codex":0.0029485074,"about_ca_topic_score_gemma":0.00023268674,"teacher_disagreement_score":0.9957932,"about_ca_system_score_codex":0.000056027307,"about_ca_system_score_gemma":0.00039871197,"threshold_uncertainty_score":0.99978566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19366187,0.00019078048,0.8039623,0.0013000242,0.000537268,0.00029484637,0.000017218877,0.000011223842,0.000024513785],"genre_scores_gemma":[0.9818147,0.00011084276,0.0174539,0.00023275414,0.00026299144,0.000023914532,0.00008478955,0.0000072797475,0.00000884937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844944,0.000054921824,0.0005709989,0.00018097003,0.0005251077,0.0002185397],"domain_scores_gemma":[0.99825484,0.00029283494,0.0003348954,0.00011309626,0.00086864375,0.00013568276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822793,0.00013286689,0.00018720285,0.00012983516,0.000051326275,0.00015626824,0.00042112108,0.00009535927,0.000042471027],"category_scores_gemma":[0.000023717737,0.00011211808,0.00007988844,0.000118436146,0.000035751687,0.00043492313,0.000036586385,0.0002082169,0.0000014357361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000135457,0.000116696356,0.002385804,0.000007345134,0.000049534352,0.0000131739025,0.000076107106,0.063862845,0.00036147327,0.000046366542,0.0014408258,0.93150437],"study_design_scores_gemma":[0.0022611236,0.00023460077,0.011638581,0.00014616152,0.000017587607,0.000020192037,0.000024430978,0.984655,0.00020380001,0.00024895713,0.00043015106,0.00011940013],"about_ca_topic_score_codex":0.000011338878,"about_ca_topic_score_gemma":0.0000016594514,"teacher_disagreement_score":0.931385,"about_ca_system_score_codex":0.00011265882,"about_ca_system_score_gemma":0.00010999365,"threshold_uncertainty_score":0.45720428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009519067,0.00007574207,0.9716857,0.0025009213,0.00012268043,0.00045354833,0.000001548065,0.00009079726,0.015549997],"genre_scores_gemma":[0.93533653,0.000015310177,0.056016076,0.0009983481,0.00004802432,0.00002449777,0.000014435623,0.000011260339,0.007535539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998816,0.000045542885,0.0003129097,0.00029910734,0.00013478212,0.00039166032],"domain_scores_gemma":[0.99870795,0.00023715965,0.000051814462,0.00080415595,0.000084333056,0.00011460554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010564909,0.0001163329,0.00014794417,0.000105160645,0.00008137623,0.00011315727,0.000580059,0.00007337534,0.000021865852],"category_scores_gemma":[0.000004083125,0.00009735883,0.000046159537,0.00020899568,0.000049052247,0.00020788865,0.00022234078,0.0001304272,0.0000133002595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032240586,0.0004681723,0.00632602,0.0000472879,0.000047055408,0.000027270898,0.0059565078,0.00005330195,0.0019556985,0.3717707,0.027518142,0.58550745],"study_design_scores_gemma":[0.0014643227,0.00018917029,0.0015243044,0.000037417525,0.0000059810263,0.000010622739,0.0002709939,0.966328,0.0012951903,0.0017170423,0.026848765,0.00030818212],"about_ca_topic_score_codex":0.0000884558,"about_ca_topic_score_gemma":0.00014842121,"teacher_disagreement_score":0.9662747,"about_ca_system_score_codex":0.00004666656,"about_ca_system_score_gemma":0.000044224933,"threshold_uncertainty_score":0.39701778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036176032,0.000061616825,0.8923667,0.00045179753,0.0007882218,0.00009040368,4.72288e-7,0.0005266875,0.10535231],"genre_scores_gemma":[0.9449227,0.000033476477,0.05001876,0.001550253,0.00033467775,0.000011209046,0.000012275217,0.00001643209,0.0031002583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823856,0.000095975396,0.00038312384,0.0004935698,0.0002646159,0.0005241529],"domain_scores_gemma":[0.99842685,0.00025685452,0.000115427436,0.0007886353,0.000089948764,0.00032227245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003807775,0.00021180078,0.00026629944,0.000082102735,0.00018767366,0.00020710261,0.000840124,0.000116384675,0.00018154147],"category_scores_gemma":[0.000016272654,0.00018226028,0.0000852233,0.0003509196,0.00005592085,0.00030204369,0.00025118352,0.00017466609,0.000112202964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009697654,0.000100434656,0.0007430334,0.00001073246,0.000031800584,0.000105730556,0.00020332474,0.0004669708,0.000039403985,0.464753,0.030100444,0.50343543],"study_design_scores_gemma":[0.00025485418,0.00007117357,0.00019693103,0.000019673875,0.000008993121,0.00003488802,0.000019773572,0.98478407,0.0000057813013,0.003968975,0.0103595,0.00027537195],"about_ca_topic_score_codex":0.000016596025,"about_ca_topic_score_gemma":0.0000038329185,"teacher_disagreement_score":0.9843171,"about_ca_system_score_codex":0.000019107238,"about_ca_system_score_gemma":0.000063523854,"threshold_uncertainty_score":0.7432358},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1848976,0.0020563968,0.78827775,0.0030541164,0.0061975243,0.0012111621,0.00002513227,0.00056906446,0.0137112895],"genre_scores_gemma":[0.9752228,0.00007825928,0.005504768,0.0020642716,0.01677946,0.0000026791092,0.000010752827,0.000018013061,0.00031898794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767274,0.00006673196,0.00045121985,0.0007889728,0.00036582723,0.00065452023],"domain_scores_gemma":[0.9987451,0.00039569658,0.00020607817,0.00023558199,0.00012038306,0.0002971936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005011285,0.00035871638,0.00047136,0.00011579166,0.0006725249,0.00061097735,0.0004358379,0.00013894502,0.000005698677],"category_scores_gemma":[0.0000043943282,0.00032349082,0.00009401831,0.0001691103,0.00006891071,0.00015206775,0.0002156741,0.00024105055,0.000012180404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076296375,0.00013944718,0.00023116347,0.0002175752,0.000043290664,0.0000614217,0.005339424,0.00063539605,0.000037164755,0.014331472,0.0072479993,0.97163934],"study_design_scores_gemma":[0.00050485076,0.0007132847,0.00059686066,0.0002742134,0.000021530423,0.00019240311,0.0004854731,0.9566049,0.000022917811,0.0006246256,0.039551973,0.00040696582],"about_ca_topic_score_codex":0.000041845593,"about_ca_topic_score_gemma":0.0000041678604,"teacher_disagreement_score":0.97123235,"about_ca_system_score_codex":0.00003976128,"about_ca_system_score_gemma":0.000045902594,"threshold_uncertainty_score":0.99992174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041741105,0.00004016852,0.88007075,0.000079646685,0.00057972176,0.00034589652,0.000003888433,0.0002182475,0.114487566],"genre_scores_gemma":[0.84979385,0.0000035683192,0.14701739,0.0009956717,0.0001313741,0.00008391673,0.0000028361214,0.000010574182,0.001960818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986656,0.000021390833,0.00024223354,0.00041828214,0.00019892189,0.00045357624],"domain_scores_gemma":[0.99907386,0.000068286674,0.000057500274,0.00047432145,0.00008579076,0.00024025016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033923343,0.00015266798,0.00019311658,0.00006633917,0.00017992356,0.0001312172,0.0006526958,0.00007221436,0.00039789744],"category_scores_gemma":[0.000008380768,0.0001283969,0.00009282135,0.00020694552,0.0000347037,0.00023111896,0.0002567419,0.00008560144,0.000108063454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022941056,0.00010010681,0.00031924123,0.000016379008,0.000025425627,0.000039460487,0.00802642,0.000021507138,0.00008046101,0.08082331,0.005998387,0.90452635],"study_design_scores_gemma":[0.0008699609,0.0010317434,0.0008774539,0.000049886858,0.000029091203,0.00007068925,0.0008891705,0.95933026,0.0020509574,0.007254724,0.026718665,0.0008273727],"about_ca_topic_score_codex":0.00011582825,"about_ca_topic_score_gemma":0.000018272347,"teacher_disagreement_score":0.9593088,"about_ca_system_score_codex":0.000024969895,"about_ca_system_score_gemma":0.00016383869,"threshold_uncertainty_score":0.52358735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034256545,0.0000035477,0.7422894,0.0017755996,0.00050172454,0.000028290544,1.867961e-7,0.00017264385,0.2518029],"genre_scores_gemma":[0.9657887,8.7413997e-7,0.027847016,0.001025408,0.0002403687,0.0000020306338,7.426861e-7,0.0000032094601,0.0050916355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994536,0.000007947683,0.00009009367,0.00015699958,0.00012342396,0.00016794188],"domain_scores_gemma":[0.99959815,0.00002914502,0.000023677352,0.00024413955,0.00003245262,0.000072435505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012463344,0.000058130478,0.000068856876,0.000021897215,0.000112321824,0.00009247502,0.00044682674,0.000060417657,0.00020651192],"category_scores_gemma":[0.0000012912453,0.000047593738,0.000034265882,0.00011348385,0.000034991175,0.00015079053,0.000118628246,0.0001526999,0.00024328721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.208651e-7,0.000020386291,0.00025322393,9.488373e-7,0.0000033180147,0.000014428639,0.00011154701,1.5155217e-7,0.00033882572,0.70827657,0.046033412,0.24494655],"study_design_scores_gemma":[0.0003194585,0.000035737223,0.0014998562,0.0000019618437,0.000004873698,0.00005054221,0.000020139509,0.7895742,0.0002037293,0.052548446,0.15540788,0.00033318254],"about_ca_topic_score_codex":0.000011217566,"about_ca_topic_score_gemma":0.0000130634535,"teacher_disagreement_score":0.96236306,"about_ca_system_score_codex":0.0000024107985,"about_ca_system_score_gemma":0.0000375576,"threshold_uncertainty_score":0.31270462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027658618,0.000090141846,0.975327,0.00006202972,0.00056525884,0.0003904876,0.0000019355725,0.00022128857,0.02057596],"genre_scores_gemma":[0.9160826,0.000016154081,0.08269234,0.0003728605,0.00018788467,0.00008012332,0.000016612868,0.000023159144,0.00052822696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978665,0.000054855325,0.0005688832,0.0005719749,0.00023242226,0.0007053746],"domain_scores_gemma":[0.9987884,0.00017189234,0.00015923813,0.0005415987,0.00008598849,0.0002528425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008323963,0.00024188831,0.000336462,0.00014602725,0.00016831695,0.00011272147,0.0007882083,0.00016320763,0.000060054404],"category_scores_gemma":[0.000017437182,0.00022587461,0.00014310991,0.00030825954,0.00003978935,0.0005586554,0.00024057728,0.00022537947,0.000010794135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089182395,0.00036806546,0.057516538,0.00008535777,0.000087543194,0.0010537364,0.00249548,0.0004945276,0.000027707207,0.6097124,0.0075149653,0.3205545],"study_design_scores_gemma":[0.00051291834,0.00010632889,0.00027751166,0.00005485399,0.000012593769,0.000028841425,0.00017058334,0.9874116,0.00001774491,0.010425435,0.0006447724,0.00033679244],"about_ca_topic_score_codex":0.00010397588,"about_ca_topic_score_gemma":0.00003403604,"teacher_disagreement_score":0.9869171,"about_ca_system_score_codex":0.000045504094,"about_ca_system_score_gemma":0.00011914052,"threshold_uncertainty_score":0.92108995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017002524,0.000025677438,0.7376339,0.00032737604,0.0001657223,0.000023688499,1.2825578e-7,0.00016179014,0.2599615],"genre_scores_gemma":[0.95161766,0.000038466762,0.03551352,0.0010849006,0.00007101185,0.0000019810298,7.8393447e-7,0.000002769257,0.011668925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994547,0.000010600093,0.00009618179,0.00015971699,0.0001253787,0.0001534207],"domain_scores_gemma":[0.9995034,0.000031652504,0.000018525398,0.00033372763,0.000025572026,0.00008714589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006223579,0.00005409124,0.00006887648,0.00002315746,0.00009502186,0.000020165055,0.0003423941,0.000029911427,0.000095252704],"category_scores_gemma":[8.9357655e-7,0.000043178617,0.000027965329,0.00013240411,0.000029318262,0.00015651726,0.000089570814,0.00005153744,0.0002588772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004309726,0.00008775108,0.0022628945,0.0000029094422,0.000012267111,0.00073553727,0.00042724336,0.000025350144,0.000027960954,0.36636984,0.33644542,0.29359853],"study_design_scores_gemma":[0.0002811289,0.00007166036,0.001715512,0.0000048217444,0.0000018743581,0.0005840156,0.000009912328,0.89752644,0.000095403804,0.0068693007,0.09259169,0.00024823478],"about_ca_topic_score_codex":0.0000145269105,"about_ca_topic_score_gemma":8.469795e-7,"teacher_disagreement_score":0.9499174,"about_ca_system_score_codex":0.0000057603056,"about_ca_system_score_gemma":0.00004470624,"threshold_uncertainty_score":0.3327429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043018635,0.000025944684,0.89109856,0.00018045444,0.00027581255,0.0006345639,0.0000053955664,0.0004846042,0.06427606],"genre_scores_gemma":[0.9835078,0.00018625613,0.012750835,0.00025111614,0.00013834414,0.00003203367,0.000028924593,0.00002193519,0.003082735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976775,0.00007714049,0.0007498598,0.0005013407,0.00042749767,0.00056662783],"domain_scores_gemma":[0.99816525,0.00016964358,0.00042496642,0.0007598289,0.00020232274,0.0002779726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004716622,0.00025485206,0.00047641475,0.00009216245,0.00021934464,0.00005829636,0.0010030197,0.00015079144,0.0002516789],"category_scores_gemma":[0.0000029278083,0.00021984715,0.0001182475,0.00040164642,0.00014291987,0.00040583528,0.0003149117,0.00016654632,0.000048164493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028605695,0.0014082977,0.03518014,0.00093024835,0.0005062639,0.0037842349,0.005042795,0.0010818813,0.0034423966,0.49734908,0.02687257,0.42411602],"study_design_scores_gemma":[0.0002558866,0.00012891169,0.00051952526,0.00006527757,0.000015265829,0.00014715809,0.000037098558,0.99752736,0.00012709595,0.0005981592,0.0002916965,0.00028655955],"about_ca_topic_score_codex":0.00016515452,"about_ca_topic_score_gemma":0.0000071840404,"teacher_disagreement_score":0.9964455,"about_ca_system_score_codex":0.000017843697,"about_ca_system_score_gemma":0.00022554668,"threshold_uncertainty_score":0.8965106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023919193,0.00035486065,0.96633965,0.002171202,0.0007033562,0.00039517076,0.000006979839,0.00032002645,0.0057895686],"genre_scores_gemma":[0.9641536,0.000037733786,0.033204548,0.0018245487,0.00030960207,0.000029497482,0.000015036047,0.000022996077,0.0004024332],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979794,0.00024580813,0.00028097874,0.00060549093,0.00033063436,0.0005577101],"domain_scores_gemma":[0.9987191,0.00023380596,0.0002069646,0.0005204701,0.00016284865,0.0001568395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004144957,0.0003552007,0.0003518867,0.00003813362,0.00057821174,0.00023692785,0.0008267774,0.0002478082,0.000059733764],"category_scores_gemma":[0.0000025562092,0.00021256876,0.000088488094,0.0003323608,0.00027055372,0.0005595439,0.000350529,0.0005021704,0.000014194829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005256963,0.00047617545,0.01776238,0.00008937494,0.0005911954,0.0001839511,0.4019601,0.00026983776,0.000016305043,0.31188226,0.012808231,0.25343448],"study_design_scores_gemma":[0.00054242415,0.00022238448,0.004139526,0.000043646447,0.000048291484,0.00005518501,0.014789615,0.97322494,0.000035672285,0.0040415865,0.0023897127,0.00046701496],"about_ca_topic_score_codex":0.0010830181,"about_ca_topic_score_gemma":0.0016735983,"teacher_disagreement_score":0.9729551,"about_ca_system_score_codex":0.000025596915,"about_ca_system_score_gemma":0.00007794713,"threshold_uncertainty_score":0.8668303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011117307,0.000020069376,0.96573,0.011288606,0.00017389208,0.0001331556,0.000002392065,0.00019090151,0.02134923],"genre_scores_gemma":[0.7313855,0.0000041718395,0.2664787,0.0010906539,0.00020676726,0.0000119120905,0.000003542958,0.0000038654966,0.00081484986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992122,0.000021241629,0.00015413159,0.0002466683,0.00012298998,0.00024275466],"domain_scores_gemma":[0.99918497,0.00030944942,0.000038195423,0.00029158912,0.00005925689,0.000116523544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018244736,0.00008467131,0.00010843727,0.000022575554,0.00008935766,0.00011766286,0.0002460542,0.000055067543,0.000089799265],"category_scores_gemma":[0.00001768099,0.00006632007,0.00005169899,0.00009524225,0.000028143551,0.00044977304,0.00009395754,0.0000815131,0.000059107184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013411358,0.00012988142,0.000058237405,0.0000050706117,0.000012340725,0.000008459395,0.00016295153,0.000010100457,0.0000142559775,0.80381507,0.11299081,0.08277943],"study_design_scores_gemma":[0.000260891,0.000036853868,0.000037993155,0.0000033350702,0.000005053934,0.000025076997,0.000016013448,0.93961084,0.0001175324,0.010587914,0.049183525,0.000114984534],"about_ca_topic_score_codex":0.000004431003,"about_ca_topic_score_gemma":0.000010813251,"teacher_disagreement_score":0.9396007,"about_ca_system_score_codex":0.000013829944,"about_ca_system_score_gemma":0.000074518466,"threshold_uncertainty_score":0.2704454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16430515,0.001444729,0.83280736,0.000042173986,0.0006285123,0.00006930157,1.7780107e-7,0.000029529101,0.0006730497],"genre_scores_gemma":[0.97605646,0.000607023,0.022587946,0.00047732113,0.00023280652,3.3601594e-7,3.5622813e-7,0.000008978736,0.0000288013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835265,0.0000625569,0.0007142401,0.00026872847,0.00027354615,0.00032825678],"domain_scores_gemma":[0.99863166,0.00011709387,0.00056652026,0.00021579552,0.00023589483,0.0002330386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007807417,0.00018846677,0.00034673625,0.00015364937,0.00026944454,0.0002540376,0.00059518864,0.000075379794,0.000020126829],"category_scores_gemma":[0.0000035583093,0.00015575098,0.000080881524,0.00017773775,0.000099260855,0.00043199692,0.00039187766,0.0003309945,0.000003304709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013598934,0.00032255647,0.006583451,0.00011134091,0.00018122769,0.0004935451,0.018691983,0.0010880729,0.00010761066,0.0831296,0.00026335043,0.8888913],"study_design_scores_gemma":[0.00029563278,0.0006019379,0.0020823854,0.00035205757,0.000042236778,0.00071651174,0.0008486019,0.98498046,0.00028962674,0.008918659,0.0005860949,0.00028577494],"about_ca_topic_score_codex":0.000028235685,"about_ca_topic_score_gemma":0.000004197746,"teacher_disagreement_score":0.9838924,"about_ca_system_score_codex":0.000017687069,"about_ca_system_score_gemma":0.000032350195,"threshold_uncertainty_score":0.6351341},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016850504,0.00014725956,0.96365917,0.00026668867,0.0003206985,0.00017690106,0.0000013589864,0.00027312894,0.0349863],"genre_scores_gemma":[0.773466,0.000035018074,0.22477175,0.00039345477,0.00010508056,0.00001188713,0.000023319284,0.000009899998,0.0011836112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990008,0.000012028215,0.00028663132,0.0002139358,0.00012998341,0.00035663787],"domain_scores_gemma":[0.99858207,0.00043220725,0.000067899244,0.0006638981,0.00008551086,0.00016844815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007948576,0.000117488824,0.0001345802,0.00006311782,0.00014463866,0.00009389896,0.0006729582,0.00008489095,0.000020149004],"category_scores_gemma":[0.0000070617502,0.00011189673,0.000058715403,0.00017479231,0.00002724107,0.000191637,0.00014349389,0.000107335,0.0000108899785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007439655,0.000029204764,0.00007889097,0.000008339499,0.000014090066,0.000008351146,0.000079689264,0.00026881165,0.000037056758,0.5546431,0.0051334826,0.43969154],"study_design_scores_gemma":[0.00023367407,0.000035706147,0.00015550591,0.000017949927,0.000007045443,0.000016662827,0.00002007769,0.9675725,0.000038207134,0.006319609,0.025398787,0.00018427371],"about_ca_topic_score_codex":0.0000085912425,"about_ca_topic_score_gemma":0.000016405342,"teacher_disagreement_score":0.9673037,"about_ca_system_score_codex":0.00002787766,"about_ca_system_score_gemma":0.000040799903,"threshold_uncertainty_score":0.4563016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082258706,0.00031403985,0.9932223,0.00011928677,0.00027657603,0.00076976244,0.0000036069252,0.00037560635,0.0040962207],"genre_scores_gemma":[0.68032753,0.00003455776,0.31779686,0.00071633403,0.00012924509,0.0002919901,0.000013580466,0.000016010801,0.000673919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838734,0.000050269886,0.00037124372,0.00046356645,0.0002032785,0.0005243243],"domain_scores_gemma":[0.99857014,0.00049605744,0.00014549121,0.00051592855,0.00012293398,0.00014947346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063938054,0.00019961734,0.00025442027,0.00006981202,0.000424734,0.00008529602,0.0006111974,0.00015522099,0.000034610515],"category_scores_gemma":[0.000012533266,0.00017845792,0.00012811799,0.00031457187,0.000060076818,0.00024502398,0.00016420342,0.00019706895,0.000007301282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007629742,0.00022607166,0.0010713116,0.000057884903,0.000042236486,0.0002460595,0.000795854,0.016646188,0.0004301199,0.010586046,0.036197092,0.93362486],"study_design_scores_gemma":[0.0004553445,0.00016023572,0.000024905155,0.00003811656,0.0000053912495,0.0000605845,0.000029098635,0.99182993,0.0004821893,0.00031676464,0.0063386,0.00025886015],"about_ca_topic_score_codex":0.0000043696195,"about_ca_topic_score_gemma":0.000002852038,"teacher_disagreement_score":0.9751837,"about_ca_system_score_codex":0.000039448674,"about_ca_system_score_gemma":0.00013006995,"threshold_uncertainty_score":0.7277303},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12628466,0.00005875553,0.84195,0.000037299033,0.00021039606,0.000052658164,5.7305193e-8,0.000052886808,0.03135332],"genre_scores_gemma":[0.94067866,0.000037261758,0.058899183,0.00018917532,0.00010947719,7.323899e-7,5.4505534e-7,0.0000047548165,0.00008019649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986697,0.000020818552,0.0005036236,0.00021117185,0.00015913713,0.0004355537],"domain_scores_gemma":[0.9993481,0.00019414382,0.00009658885,0.0002525612,0.000040206018,0.00006839475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067978,0.00009076319,0.00019080388,0.00006907906,0.000061763676,0.000017372295,0.0003744577,0.00006305697,0.000007449424],"category_scores_gemma":[0.0000070924766,0.0000835032,0.00003482978,0.000410299,0.000017537377,0.00025384116,0.00014889697,0.00015976431,0.0000050829112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000201029,0.00003106038,0.09845232,0.000026188885,0.0000079365345,0.000028213492,0.0005205826,0.56342155,0.00004442492,0.07175451,0.00020709698,0.265486],"study_design_scores_gemma":[0.00013664356,0.000017154223,0.0007131312,0.00009526687,0.000001420969,0.0000076444085,0.0000309636,0.9980909,0.000021244588,0.0007702243,0.000015553274,0.00009981089],"about_ca_topic_score_codex":0.000046336587,"about_ca_topic_score_gemma":0.000018269295,"teacher_disagreement_score":0.814394,"about_ca_system_score_codex":0.000027026665,"about_ca_system_score_gemma":0.000039366543,"threshold_uncertainty_score":0.34051615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2685007,0.0000031071802,0.72087306,0.00008637191,0.00033128858,0.00008757724,8.64931e-7,0.00019724313,0.009919785],"genre_scores_gemma":[0.7888292,8.857566e-7,0.21038415,0.00032330057,0.000093099545,0.0000075932676,0.0000018096335,0.000008074369,0.00035191778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849755,0.00001966058,0.00033006823,0.0004597927,0.00024775308,0.00044516267],"domain_scores_gemma":[0.9988112,0.0001068456,0.00012820467,0.0007050269,0.00009972881,0.00014900048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008831012,0.00016517672,0.00017280498,0.000040826497,0.00030562375,0.00017305807,0.0007136459,0.000109492365,0.000029262726],"category_scores_gemma":[0.000015483292,0.00014263375,0.00005826408,0.00016738258,0.00005443975,0.00069384824,0.0004306848,0.00045318808,0.000028882992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008160684,0.00007398937,0.0044826563,0.000042170625,0.0000080348655,0.000009991596,0.0007696771,0.0071565737,0.007786955,0.01163356,0.00018759021,0.9678406],"study_design_scores_gemma":[0.00018038545,0.000017410339,0.00021946666,0.000008003053,0.0000036355395,0.000022907656,0.000016954027,0.9979246,0.00070168125,0.00068410346,0.000019391975,0.00020142444],"about_ca_topic_score_codex":0.00007332983,"about_ca_topic_score_gemma":0.000016194224,"teacher_disagreement_score":0.9907681,"about_ca_system_score_codex":0.000021541351,"about_ca_system_score_gemma":0.0001051878,"threshold_uncertainty_score":0.5816435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075290346,0.00009189727,0.9935512,0.00013559664,0.002652375,0.0009708569,0.000030253392,0.00031410562,0.0015008231],"genre_scores_gemma":[0.93672633,0.00008224025,0.06212275,0.0004754167,0.00005294547,0.00019161418,0.00000827237,0.00001658865,0.00032381993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803114,0.000109115754,0.00038372405,0.00070567615,0.00031520703,0.00045516333],"domain_scores_gemma":[0.998237,0.00013911653,0.00008028132,0.0013156008,0.00005513237,0.00017287699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002563016,0.0002278951,0.0002728364,0.000209213,0.00015693724,0.00025381197,0.0014143613,0.00008808237,0.000026595391],"category_scores_gemma":[7.532401e-8,0.00022311056,0.00006328796,0.00041238838,0.000033003947,0.0007440384,0.00003224086,0.00027161726,0.0003240038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027218732,0.0013605423,0.000017773764,0.00007232681,0.00027527768,0.00017277185,0.001952106,0.078067586,0.0000029053745,0.0025012142,0.01589471,0.8996556],"study_design_scores_gemma":[0.0007411996,0.000121905796,0.000027283446,0.000074110016,0.000016889653,0.000018726332,0.00043808183,0.99333054,0.000008122181,0.00005363806,0.004924423,0.00024507145],"about_ca_topic_score_codex":0.00013877127,"about_ca_topic_score_gemma":0.000041748917,"teacher_disagreement_score":0.93597347,"about_ca_system_score_codex":0.00009828866,"about_ca_system_score_gemma":0.00003983332,"threshold_uncertainty_score":0.9098185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24862577,0.00079664215,0.7437399,0.0011943812,0.00042733413,0.0004699095,0.0000144221285,0.00063215883,0.004099469],"genre_scores_gemma":[0.9807061,0.0002212427,0.016606126,0.0018274174,0.00026887938,0.00014667845,0.000053780303,0.00003969617,0.00013010464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770766,0.00021966535,0.000569678,0.0005944726,0.00028322893,0.0006252825],"domain_scores_gemma":[0.99709576,0.0005165758,0.00027129424,0.0016545581,0.00013717868,0.00032464662],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00084668,0.00029259332,0.00039878464,0.00009980918,0.001761661,0.0005726107,0.0028732137,0.00012541474,0.000005497315],"category_scores_gemma":[0.0000049682976,0.0003341959,0.00007140966,0.00056294946,0.00012001775,0.0005241139,0.0011880142,0.00042176966,0.000030507003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013178802,0.00025339998,0.0020866178,0.00023104173,0.00013179427,0.000010253513,0.013926486,0.00688149,0.0011311094,0.03755957,0.0048864875,0.93288857],"study_design_scores_gemma":[0.00024209895,0.000037595317,0.0001095006,0.00022496753,0.000031431453,0.000015307756,0.00048600975,0.9796309,0.000011660633,0.0005968238,0.018206175,0.0004075512],"about_ca_topic_score_codex":0.000049213973,"about_ca_topic_score_gemma":0.00004498704,"teacher_disagreement_score":0.9727494,"about_ca_system_score_codex":0.00006032939,"about_ca_system_score_gemma":0.00006149979,"threshold_uncertainty_score":0.999911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075386693,0.0008895469,0.98408824,0.00020047218,0.0004751601,0.00037412066,0.0000038837297,0.00026456977,0.0061653587],"genre_scores_gemma":[0.8526406,0.000028123412,0.1451844,0.0011776,0.00044354878,0.000048610975,0.000012546496,0.000024074554,0.00044045105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807435,0.00004187261,0.00030745534,0.0004103042,0.0002930432,0.00087295147],"domain_scores_gemma":[0.9986465,0.00020437989,0.00012523553,0.00053296954,0.00014861688,0.0003422831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005155597,0.00027182503,0.00030093145,0.000055052937,0.00024466545,0.00019921972,0.0005573887,0.00015628165,0.000050495844],"category_scores_gemma":[0.0000027358124,0.0001974711,0.00011054615,0.00027482375,0.000048639842,0.00095200096,0.0001423917,0.00022877788,0.000012510446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004003605,0.00088412996,0.0143960565,0.00013133707,0.0003983215,0.00026887166,0.003436949,0.004945145,0.00008651488,0.35456514,0.0482143,0.5722729],"study_design_scores_gemma":[0.0006982157,0.00013912946,0.00019339233,0.00006052912,0.000026735706,0.00011533374,0.00007106331,0.98837495,0.000024319572,0.00023886039,0.00967137,0.0003860889],"about_ca_topic_score_codex":0.000013168212,"about_ca_topic_score_gemma":0.000009326553,"teacher_disagreement_score":0.9834298,"about_ca_system_score_codex":0.000032059288,"about_ca_system_score_gemma":0.000083827224,"threshold_uncertainty_score":0.8052638},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029982118,0.00010962738,0.9681892,0.00024763503,0.00052243256,0.00020853744,0.000003627323,0.00034245785,0.00039436246],"genre_scores_gemma":[0.8689536,0.00012985939,0.1301149,0.00059825636,0.00003860676,0.0000096062695,0.000001481449,0.000019819494,0.00013386013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831814,0.00008016364,0.00031078572,0.00056125585,0.0003482744,0.00038135747],"domain_scores_gemma":[0.9990319,0.00019090498,0.00008143548,0.00038493902,0.00006694946,0.00024387441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115007926,0.00027377906,0.0002977837,0.00016993021,0.0006818037,0.000119171345,0.00035107572,0.00010091558,0.000012466935],"category_scores_gemma":[2.3311529e-7,0.00023622964,0.00009265599,0.00039743926,0.0002068398,0.00034905606,0.0000037509913,0.00031049942,0.000011262487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035275036,0.00027823908,0.00003506166,0.000033791133,0.00010734736,0.0005508638,0.0018641718,0.015377402,0.00017122168,0.00028262066,0.00059644756,0.9803501],"study_design_scores_gemma":[0.0018622841,0.00042889253,0.000038375892,0.00020330402,0.000027522967,0.0010676166,0.000023337343,0.9933961,0.0005795137,0.00011882242,0.0018904951,0.00036375245],"about_ca_topic_score_codex":0.000049853767,"about_ca_topic_score_gemma":0.0000042235256,"teacher_disagreement_score":0.9799863,"about_ca_system_score_codex":0.000040047158,"about_ca_system_score_gemma":0.00013785108,"threshold_uncertainty_score":0.9633165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000891482,0.0001762139,0.98660463,0.0008641636,0.0011597722,0.0003925527,0.0000048379093,0.00035685961,0.009549507],"genre_scores_gemma":[0.8592964,0.000074991935,0.13591985,0.0019321159,0.00032636468,0.00006031658,0.000017165836,0.000018993602,0.002353836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830765,0.000023512277,0.0003643201,0.00054363033,0.00022983325,0.00053107046],"domain_scores_gemma":[0.9985971,0.00018642328,0.00009663258,0.00074053975,0.00010891309,0.00027041094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047833024,0.00019620018,0.00024390833,0.00004603722,0.00022197547,0.0001767047,0.0007045272,0.00010973703,0.000045122317],"category_scores_gemma":[0.0000058423716,0.00017161919,0.0001297926,0.00022712367,0.000068016874,0.00029944736,0.00019981539,0.00012907946,0.00004028013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004064788,0.00025013997,0.00015140542,0.00003453021,0.0000378979,0.00007193324,0.00023650637,0.0005118879,0.000023077731,0.39277744,0.008610136,0.5972544],"study_design_scores_gemma":[0.0013725044,0.00029319985,0.00013834628,0.000053584667,0.000025869838,0.000047270583,0.000047335758,0.7534942,0.000027542847,0.09200703,0.15194467,0.00054846035],"about_ca_topic_score_codex":0.000010952564,"about_ca_topic_score_gemma":0.00002160068,"teacher_disagreement_score":0.8584049,"about_ca_system_score_codex":0.000069342284,"about_ca_system_score_gemma":0.00024365353,"threshold_uncertainty_score":0.69984275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012919161,0.00043139572,0.97904146,0.00022526494,0.0013794784,0.00060404633,0.000002091458,0.00027662434,0.016747706],"genre_scores_gemma":[0.4361877,0.00024487285,0.5549733,0.0016154052,0.00038395185,0.000362449,0.000023530634,0.000022108674,0.006186693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986799,0.000011841561,0.00022470678,0.00045413652,0.00018561404,0.00044385385],"domain_scores_gemma":[0.99893475,0.000076908196,0.00006519832,0.0006884621,0.000055576053,0.00017909495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029950656,0.00017021789,0.00016697608,0.000050651277,0.00015400538,0.00018072245,0.0007746082,0.00013265,0.00012486086],"category_scores_gemma":[9.85348e-7,0.00014395393,0.00010283752,0.00020524432,0.00004062546,0.00023206242,0.00030528157,0.00023089221,0.0000367236],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015707808,0.000097672775,0.000045058874,0.000020097357,0.000035647983,0.000027628885,0.00006711645,0.00006714146,0.000026472624,0.23363042,0.045791294,0.72017574],"study_design_scores_gemma":[0.0003815236,0.00009518738,0.000033146745,0.000007632121,0.000007765666,0.000009965409,0.000022890516,0.6913833,0.0000039464403,0.002855314,0.30502406,0.00017527226],"about_ca_topic_score_codex":9.968676e-7,"about_ca_topic_score_gemma":0.00001931317,"teacher_disagreement_score":0.72000045,"about_ca_system_score_codex":0.000009982065,"about_ca_system_score_gemma":0.000016970938,"threshold_uncertainty_score":0.5870271},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028437276,0.00007795088,0.977758,0.00063448306,0.00017078983,0.00009518418,0.0000030643962,0.000094905314,0.018321877],"genre_scores_gemma":[0.8686626,0.000013140238,0.13097703,0.00018208749,0.00005757878,0.000004068169,0.000010256464,0.0000058924434,0.00008734879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989812,0.00014042319,0.00029022407,0.00020049996,0.00019367023,0.00019400043],"domain_scores_gemma":[0.9985526,0.0002833331,0.00015621539,0.0008390651,0.000083039085,0.000085748754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004926792,0.00010091966,0.00023523005,0.00005032324,0.00011840862,0.000045831683,0.0008515531,0.000052230935,0.000020159763],"category_scores_gemma":[0.000012881687,0.000094714436,0.00006487543,0.00017561967,0.00017627203,0.000178329,0.0001760304,0.00012257391,0.000029808147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015274516,0.00011690217,0.00019896217,0.000017715678,0.000025997424,0.000002544927,0.00044146925,0.000022126927,0.00016526162,0.41993874,0.0019897902,0.5770652],"study_design_scores_gemma":[0.00062236027,0.000059382106,0.00038953594,0.000035218847,0.000008938414,0.0000132336245,0.000015578187,0.95096064,0.00059331104,0.04380327,0.0033631576,0.00013538761],"about_ca_topic_score_codex":0.00007046986,"about_ca_topic_score_gemma":0.0000041851586,"teacher_disagreement_score":0.9509385,"about_ca_system_score_codex":0.000013641082,"about_ca_system_score_gemma":0.000027715514,"threshold_uncertainty_score":0.38623425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4805295,0.0014172668,0.513403,0.003143434,0.00044234088,0.0001728119,0.0000021434996,0.000029580919,0.00085993245],"genre_scores_gemma":[0.95667124,0.00057660305,0.04241814,0.00019302375,0.00010175949,0.0000062901927,0.0000018745039,0.000010993083,0.00002009149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982385,0.00031150115,0.00074903946,0.00017040962,0.00024839197,0.0002821547],"domain_scores_gemma":[0.9973702,0.00065364945,0.00045838216,0.0011008945,0.00017717706,0.0002396901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165258,0.00015020058,0.00035053087,0.0001891956,0.00029089616,0.00022808235,0.0018402885,0.00011534735,0.000012143382],"category_scores_gemma":[0.00003272732,0.0001375505,0.00009594587,0.0003624815,0.00010301463,0.00040323156,0.0008117314,0.0011042478,0.0000012741483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103252314,0.0009277792,0.016584244,0.000044279113,0.00022502098,0.000296351,0.008590142,0.005800876,0.002862249,0.042354498,0.00060150377,0.9216098],"study_design_scores_gemma":[0.00063609774,0.00009656624,0.0028862094,0.00021045614,0.000035196244,0.0008132525,0.00008444376,0.9884898,0.00004182839,0.0027472817,0.00371656,0.00024230426],"about_ca_topic_score_codex":0.000023166369,"about_ca_topic_score_gemma":0.00024451205,"teacher_disagreement_score":0.9826889,"about_ca_system_score_codex":0.000025202926,"about_ca_system_score_gemma":0.000114398965,"threshold_uncertainty_score":0.56091464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011297555,0.013283667,0.97249943,0.0004774946,0.0015784026,0.00014272536,0.000041393778,0.000025126068,0.00065421016],"genre_scores_gemma":[0.99603415,0.0029516155,0.00028570276,0.00010901112,0.00049836485,0.0000032442854,0.00008997833,0.000006483323,0.00002143906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977131,0.00029932908,0.0010664538,0.00015280614,0.00054755167,0.00022079905],"domain_scores_gemma":[0.9962781,0.00042109593,0.0013819818,0.00035519485,0.0014120893,0.00015151888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053811,0.00015712208,0.00042276763,0.00012669164,0.00012618644,0.00033743464,0.0012384123,0.0001275436,0.000001946735],"category_scores_gemma":[0.000011874797,0.0001390385,0.00010766112,0.00024899165,0.00006750022,0.00046427324,0.00017930723,0.0003061628,7.122507e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011077852,0.0021207312,0.018806329,0.00010410245,0.0019202463,0.0003189824,0.003804843,0.30509624,0.00011075035,0.33154416,0.026124572,0.30894127],"study_design_scores_gemma":[0.0009922271,0.00011650999,0.0012323036,0.0010066206,0.00003207159,0.00034626244,0.0006553287,0.9914076,0.0000025865736,0.00036146006,0.0037025793,0.00014448108],"about_ca_topic_score_codex":0.000021586935,"about_ca_topic_score_gemma":0.0000026958205,"teacher_disagreement_score":0.9847366,"about_ca_system_score_codex":0.000057458426,"about_ca_system_score_gemma":0.00007607086,"threshold_uncertainty_score":0.56698257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031214412,0.000019028097,0.9617715,0.0015755703,0.00060785626,0.0007229815,0.0000743344,0.00031227505,0.0037020785],"genre_scores_gemma":[0.968649,0.000009375289,0.02947162,0.0005609659,0.00020262194,0.00007300428,0.00046930093,0.000016975107,0.0005470977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998229,0.000026548603,0.0003050875,0.00068403856,0.00034960252,0.00040567972],"domain_scores_gemma":[0.997625,0.00040504112,0.00021123531,0.0012349817,0.0003160462,0.000207678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062683754,0.00021753859,0.00025958888,0.000086382715,0.00022029312,0.00071760674,0.0025469102,0.00013811387,0.00009435591],"category_scores_gemma":[0.000008969164,0.00016051848,0.00003076749,0.0003272315,0.000058878115,0.0025240157,0.00043383206,0.00023265685,0.000011349839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061903223,0.0019198006,0.075509064,0.0014845504,0.0014987679,0.00032711227,0.005088757,0.00010989041,0.025195923,0.09286749,0.12830238,0.66150594],"study_design_scores_gemma":[0.0022226998,0.00009584405,0.00065332564,0.00008050623,0.000042077027,0.000024806694,0.00003834153,0.99283284,0.00091319304,0.00034518458,0.00245352,0.00029764415],"about_ca_topic_score_codex":0.000087025284,"about_ca_topic_score_gemma":0.00034335192,"teacher_disagreement_score":0.992723,"about_ca_system_score_codex":0.0000111837835,"about_ca_system_score_gemma":0.00013821058,"threshold_uncertainty_score":0.69198984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007561531,0.0014998835,0.9814248,0.003083371,0.0010095629,0.0004085289,0.0000028299116,0.0004854099,0.011329467],"genre_scores_gemma":[0.7266072,0.0002666409,0.25653327,0.0069580115,0.0004528658,0.00012432566,0.00006239367,0.00005278119,0.008942546],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978799,0.000087848166,0.00038731334,0.0005103886,0.0003456678,0.0007888346],"domain_scores_gemma":[0.9979205,0.00021843749,0.00012185358,0.0007641652,0.00025637672,0.0007186461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974051,0.0002194163,0.00030440226,0.00008048105,0.0001522426,0.00044474896,0.0010584558,0.00016821164,0.000051606607],"category_scores_gemma":[0.000030239189,0.00018408001,0.00013827081,0.00043481262,0.000065284774,0.0003565448,0.0002710039,0.00015632168,0.000044226777],"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.00016769166,0.00013942324,0.00020871691,0.000008261671,0.00006175375,0.000038720278,0.00045747834,0.00050725136,0.0000038574913,0.14056295,0.44789973,0.40994418],"study_design_scores_gemma":[0.0011728347,0.00010929988,0.000009484112,0.0000062458676,0.0000067743704,0.00001599805,0.000032318167,0.60034674,0.0000024186552,0.0032059443,0.39491305,0.00017891165],"about_ca_topic_score_codex":0.000004942402,"about_ca_topic_score_gemma":0.000013752849,"teacher_disagreement_score":0.725851,"about_ca_system_score_codex":0.000048050242,"about_ca_system_score_gemma":0.00023312967,"threshold_uncertainty_score":0.7506565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010011443,0.00092403457,0.9584199,0.0023078558,0.0023210393,0.0012918237,0.000043467437,0.00067795167,0.024002442],"genre_scores_gemma":[0.950822,0.000015022564,0.03538059,0.0034860743,0.0013348248,0.00065367337,0.000150929,0.00005964082,0.008097278],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955693,0.0001043947,0.0006755979,0.0011397033,0.0011616176,0.0013493891],"domain_scores_gemma":[0.9969506,0.00015844009,0.00016768265,0.0014416968,0.00056561886,0.000715953],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093495206,0.0004927953,0.00055627775,0.00021707169,0.00043024562,0.0014150215,0.0020363515,0.00028295204,0.00020925462],"category_scores_gemma":[0.000024311965,0.000498027,0.00019871283,0.0012628294,0.00006066859,0.000757604,0.0009358419,0.00044823767,0.00048013937],"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.000038916514,0.00024039345,0.0023595332,0.000021811333,0.000039096503,0.00032239474,0.0004163492,0.028916493,0.000014416758,0.008187201,0.5529825,0.40646085],"study_design_scores_gemma":[0.0006640543,0.0002924796,0.0014414486,0.00008226137,0.000029092187,0.00007794322,0.00016039285,0.2983468,0.0000259869,0.001363793,0.6965182,0.0009975957],"about_ca_topic_score_codex":0.00033901242,"about_ca_topic_score_gemma":0.00028204435,"teacher_disagreement_score":0.9408105,"about_ca_system_score_codex":0.00021228656,"about_ca_system_score_gemma":0.00018534821,"threshold_uncertainty_score":0.99974716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055871982,0.000066170265,0.93669915,0.0005470609,0.00020357578,0.00044138267,0.0000018938941,0.0001019933,0.0060667787],"genre_scores_gemma":[0.9946963,0.0000031481754,0.0032312775,0.00018814694,0.000056418052,0.00003275524,0.000048860402,0.0000044086023,0.0017386776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.00003565788,0.0003390276,0.00021994972,0.00023610995,0.00022525173],"domain_scores_gemma":[0.9993,0.00016400884,0.00010653367,0.0002503351,0.000118082324,0.00006105372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054546003,0.00010326029,0.000119408214,0.00011152686,0.00009234963,0.00028616883,0.00025317457,0.0000763138,0.000004204425],"category_scores_gemma":[0.000015784703,0.00009233367,0.00003286741,0.0002797267,0.000015511527,0.0002934046,0.000025496152,0.00006194076,0.0000073832493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085161584,0.00027454755,0.00092486036,0.000045890498,0.000007906683,0.0000095793375,0.0024436782,0.068836965,0.0011761062,0.31611577,0.0061558303,0.60392374],"study_design_scores_gemma":[0.0003409685,0.00007390545,0.006363801,0.000050723127,0.0000023793098,0.0000043413147,0.00012590516,0.99145275,0.0001334652,0.0003962518,0.000930291,0.00012523493],"about_ca_topic_score_codex":0.000018423523,"about_ca_topic_score_gemma":0.0000031323957,"teacher_disagreement_score":0.9388243,"about_ca_system_score_codex":0.000069232854,"about_ca_system_score_gemma":0.000032284748,"threshold_uncertainty_score":0.3765258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010708857,0.000025088426,0.8885572,0.00044558005,0.00055636885,0.000040381216,1.7183056e-7,0.00016592264,0.109138384],"genre_scores_gemma":[0.99265736,0.0000013521312,0.004078893,0.00056931056,0.00036261007,0.0000038483063,0.0000011185367,0.0000037164166,0.002321781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.000047234935,0.000119745775,0.00017284288,0.00016966421,0.00017679784],"domain_scores_gemma":[0.9996039,0.00003923084,0.000032995526,0.00022171337,0.000035654102,0.00006645686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024589282,0.000065694745,0.00010696026,0.000020637533,0.0001133608,0.00013986058,0.000357322,0.000053846154,0.000016103017],"category_scores_gemma":[0.0000014085265,0.000052730982,0.000037376292,0.00009342438,0.000019187602,0.00011126965,0.000086686894,0.000059796792,0.00016815907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.939377e-7,0.000015111153,0.00007763401,0.000006264583,0.0000071032205,0.000009045859,0.000087149376,0.000052134586,0.000016954153,0.90050906,0.028883282,0.07033548],"study_design_scores_gemma":[0.0001028852,0.000017357255,0.00009526502,0.0000031877462,0.0000021398846,0.000009462859,0.000008486662,0.9362664,0.0000048546435,0.0016249568,0.061777636,0.000087314715],"about_ca_topic_score_codex":0.00001822112,"about_ca_topic_score_gemma":5.871666e-7,"teacher_disagreement_score":0.9915865,"about_ca_system_score_codex":0.000008119729,"about_ca_system_score_gemma":0.00001950369,"threshold_uncertainty_score":0.21614006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35263187,0.00004087163,0.64571285,0.000062229214,0.0006184318,0.0007358598,5.400606e-7,0.000020173198,0.00017718294],"genre_scores_gemma":[0.99303067,0.000009776432,0.0053929198,0.00029277787,0.001176966,0.000068644906,9.11946e-7,0.000012010415,0.000015349138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840564,0.00006763081,0.00060404866,0.00020736591,0.00045794458,0.00025737213],"domain_scores_gemma":[0.99842036,0.00019775506,0.0006362821,0.00010572941,0.0005223026,0.00011759248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044347125,0.00015516783,0.00026839436,0.0001193892,0.00020415337,0.0005016087,0.0006928917,0.00008065866,0.000019069064],"category_scores_gemma":[0.0000063789685,0.00013289838,0.0001108803,0.00010644501,0.00005110433,0.00040972672,0.0002893894,0.00032808658,0.000002758676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025857398,0.00013843925,0.0012209915,0.000008228127,0.00009157021,0.00008107491,0.0007557042,0.04383119,0.00020182319,0.0064744786,0.00055792695,0.9466127],"study_design_scores_gemma":[0.00054965616,0.0001832774,0.00033627293,0.0002643028,0.0000053391864,0.00023426834,0.000095895666,0.99709755,0.000034401135,0.00069966185,0.00035443736,0.00014492056],"about_ca_topic_score_codex":0.000019017178,"about_ca_topic_score_gemma":2.198588e-7,"teacher_disagreement_score":0.9532664,"about_ca_system_score_codex":0.00006987279,"about_ca_system_score_gemma":0.00008044691,"threshold_uncertainty_score":0.5419439},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011861043,0.007671444,0.9788778,0.0008059499,0.0005977845,0.0001609443,7.3577837e-7,0.00001497604,0.000009317083],"genre_scores_gemma":[0.9874056,0.0001267945,0.011207624,0.00078164256,0.00041349602,0.000016590095,9.334843e-7,0.000012973074,0.00003436059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899966,0.00001717447,0.00028174132,0.00013950301,0.000102475264,0.00045944483],"domain_scores_gemma":[0.9986307,0.0004611944,0.0000849161,0.00016089139,0.0001618003,0.0005004798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017541202,0.00013481335,0.0001905011,0.000102383005,0.00018657399,0.0005791245,0.00048787598,0.000061277984,0.0000017623972],"category_scores_gemma":[0.0000060577604,0.00009542148,0.00008067345,0.0003004483,0.000018042807,0.0002971034,0.000024477647,0.00024122377,0.0000011748871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011574398,0.000018395502,0.00021928136,0.000034058463,0.00008467044,0.00008993833,0.00010478629,0.16304871,0.000021057765,0.003330171,0.0077486206,0.8252887],"study_design_scores_gemma":[0.00023527765,0.00022226504,0.00045533478,0.000039437862,0.000009907708,0.00009572218,0.0000019543047,0.9813796,0.0000057153397,0.0002578151,0.017168477,0.00012845294],"about_ca_topic_score_codex":0.00005599691,"about_ca_topic_score_gemma":0.00011302136,"teacher_disagreement_score":0.9755446,"about_ca_system_score_codex":0.0000450051,"about_ca_system_score_gemma":0.0002940903,"threshold_uncertainty_score":0.55845106},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29281363,0.00016724352,0.6944962,0.000023972934,0.00013236936,0.0000599471,2.1569107e-7,0.000024501234,0.01228192],"genre_scores_gemma":[0.98667395,0.000048566133,0.013000743,0.00014102065,0.000050349696,0.0000014676378,0.0000050769054,0.000002522258,0.00007632385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998933,0.000026730968,0.00029322953,0.00021219593,0.00033644636,0.00019836545],"domain_scores_gemma":[0.9993035,0.00011523234,0.00010439409,0.00026765073,0.00013449811,0.00007468473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017390965,0.00007864001,0.00018678678,0.00019560721,0.000069146416,0.000033208034,0.00018475029,0.000046419853,0.000033896762],"category_scores_gemma":[0.0000014579441,0.00006561643,0.000049428014,0.00092635694,0.000032298394,0.00018870409,0.00007813508,0.00005566341,0.0000015224737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007944777,0.00001528841,0.035873536,0.0000028757472,0.0001114824,0.0000032391736,0.00021501971,0.0024766056,0.000015651485,0.0014799375,0.00006630601,0.9597321],"study_design_scores_gemma":[0.00013527948,0.000032363096,0.037012305,0.000008563162,0.00018094212,0.000004571626,0.00001337057,0.9622232,0.00002882641,0.00007427396,0.00020476885,0.00008158181],"about_ca_topic_score_codex":0.000016339885,"about_ca_topic_score_gemma":0.000023075952,"teacher_disagreement_score":0.95974654,"about_ca_system_score_codex":0.000015664411,"about_ca_system_score_gemma":0.000032959975,"threshold_uncertainty_score":0.26757604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14804627,0.00013993442,0.82795775,0.0004948328,0.00065329,0.00027897715,0.000001049299,0.0000734146,0.02235448],"genre_scores_gemma":[0.99116266,0.0000017835928,0.0076113427,0.0006279053,0.00031487204,0.000010279059,0.0000047121216,0.0000059843,0.0002604864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783784,0.00029819936,0.00035928853,0.00029069907,0.00094535627,0.0002686334],"domain_scores_gemma":[0.9987384,0.00007967902,0.00012491015,0.00076318614,0.00022722832,0.000066604975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013178103,0.00011872166,0.00016096029,0.000023080667,0.000136738,0.0000894128,0.0008954858,0.00007337741,0.0000909794],"category_scores_gemma":[0.0000023151454,0.00007439838,0.00007562576,0.00036421412,0.000056811008,0.00020185103,0.00016177648,0.000107087,0.000010720637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023114913,0.0009138612,0.1594527,0.000007871184,0.00005662859,0.000016100339,0.0007108444,0.40488717,0.000060804057,0.0795106,0.115785204,0.2385751],"study_design_scores_gemma":[0.00031803016,0.000060488546,0.04569139,0.000009292698,0.000028490356,0.0000103602915,0.000015483627,0.9449742,0.000018582447,0.00789254,0.00087699335,0.00010414056],"about_ca_topic_score_codex":0.000073329094,"about_ca_topic_score_gemma":0.00009315345,"teacher_disagreement_score":0.84311634,"about_ca_system_score_codex":0.000032328553,"about_ca_system_score_gemma":0.00016643523,"threshold_uncertainty_score":0.3033878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008698549,0.00016237023,0.9689194,0.0001854586,0.0010259927,0.0005801977,0.0000051264965,0.00028971292,0.027961895],"genre_scores_gemma":[0.81689984,0.000051951414,0.17930737,0.00044754552,0.00009092398,0.00008783327,0.0000047565863,0.000013139473,0.0030966124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986302,0.00005692032,0.0002679244,0.000453346,0.0001797724,0.00041178713],"domain_scores_gemma":[0.9989607,0.0001663564,0.00010186363,0.0005075794,0.00013433753,0.00012917719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003053733,0.00016956743,0.0002314756,0.00005045299,0.00018435698,0.00020181955,0.0004953211,0.00010985214,0.000037782775],"category_scores_gemma":[0.0000053593158,0.00014145173,0.00007677168,0.00021538179,0.00003156466,0.00013638688,0.00014317161,0.000103051956,0.00009008522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050564624,0.00011634045,0.0009134872,0.00010151502,0.00014049004,0.00017714337,0.0005562765,0.000041767198,0.000002359826,0.95496595,0.008849952,0.034084156],"study_design_scores_gemma":[0.0006809135,0.00024908976,0.0014536965,0.00010124543,0.000018107681,0.00006222195,0.00043804335,0.9734738,0.00003204991,0.015895119,0.00704838,0.00054731854],"about_ca_topic_score_codex":0.000036174373,"about_ca_topic_score_gemma":0.000004248782,"teacher_disagreement_score":0.97343206,"about_ca_system_score_codex":0.000027463266,"about_ca_system_score_gemma":0.00003375295,"threshold_uncertainty_score":0.5768234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000300118,0.000011147568,0.9319487,0.000030533676,0.0002566547,0.063496076,0.000007832483,0.00045423416,0.0034946918],"genre_scores_gemma":[0.606196,0.000002045395,0.10820287,0.00036278283,0.00036253766,0.28458536,0.00002797891,0.000034085388,0.00022637668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979394,0.00004546525,0.0004791107,0.00061546196,0.00020970576,0.0007108189],"domain_scores_gemma":[0.9985987,0.0001466606,0.00018288619,0.00060848123,0.00018520972,0.00027804927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003685175,0.0002857415,0.00032838067,0.000051312414,0.00027132538,0.00015754536,0.0009582988,0.0002069937,0.00014578097],"category_scores_gemma":[0.0000037333689,0.00024156502,0.00014341557,0.0003225926,0.00007646035,0.00038907275,0.000292969,0.00021918482,0.000029196302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005477245,0.0017558468,0.0025514646,0.00027078533,0.00024662583,0.00018107667,0.00108861,0.031225836,0.00007219539,0.1284106,0.016674643,0.8169746],"study_design_scores_gemma":[0.0011138576,0.00026089422,0.00007812126,0.000038467555,0.000012119573,0.000019313387,0.00003377293,0.992742,0.00019350139,0.001347968,0.003803766,0.00035623962],"about_ca_topic_score_codex":0.000035697507,"about_ca_topic_score_gemma":0.000007980319,"teacher_disagreement_score":0.96151614,"about_ca_system_score_codex":0.000054226224,"about_ca_system_score_gemma":0.00011661105,"threshold_uncertainty_score":0.9850736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099263005,0.000023127066,0.9730172,0.00010221538,0.00046344125,0.00023400952,4.1502318e-7,0.00032966654,0.01590363],"genre_scores_gemma":[0.94087803,0.000021040601,0.057462946,0.0005837441,0.00015832185,0.000015265636,0.000007924887,0.000023096747,0.000849638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978027,0.00010079699,0.0005894667,0.00060917303,0.00025260492,0.00064530317],"domain_scores_gemma":[0.9985811,0.00014525223,0.0002400759,0.0007535753,0.0001123664,0.00016760384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054504425,0.0002517582,0.00029242612,0.000084148305,0.00017298278,0.00014992802,0.00080977805,0.00016961778,0.000057544923],"category_scores_gemma":[0.000018927314,0.00023529054,0.00006151731,0.0005618589,0.000068831134,0.0006760653,0.00041320134,0.0003227844,0.000032334883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003476366,0.00026432986,0.008830711,0.00004504311,0.00002814234,0.0002703708,0.0068754368,0.0006568969,0.00007704874,0.25926372,0.00046419524,0.72318935],"study_design_scores_gemma":[0.00031701723,0.000050168666,0.0007997333,0.000056593133,0.000009095066,0.000040407063,0.00020068276,0.9970998,0.000032167078,0.00093729765,0.00013677317,0.00032024842],"about_ca_topic_score_codex":0.0007714078,"about_ca_topic_score_gemma":0.000023013876,"teacher_disagreement_score":0.9964429,"about_ca_system_score_codex":0.00006413467,"about_ca_system_score_gemma":0.00015996123,"threshold_uncertainty_score":0.95948696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002012854,0.00027160387,0.93805605,0.00087121193,0.00021868214,0.00011109573,2.5533228e-7,0.00030771972,0.058150522],"genre_scores_gemma":[0.9612228,0.000049935104,0.036290687,0.0004647378,0.00013170674,0.000011799332,0.000020222717,0.000008193779,0.0017999135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990764,0.00006922178,0.00022924363,0.00024287793,0.00014363322,0.00023860527],"domain_scores_gemma":[0.9990174,0.00007967415,0.000088457266,0.0006961161,0.000059429683,0.000058909205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023973324,0.000115978044,0.00012147613,0.000047127694,0.00021253485,0.00022540629,0.0005042093,0.00007698593,0.000032355274],"category_scores_gemma":[0.0000014795319,0.0001008493,0.000045809982,0.00025980533,0.000050844672,0.0004917959,0.00014951373,0.00013645725,0.00002894356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017607666,0.00019067261,0.011146388,0.000006219562,0.000023007957,0.000010253738,0.00013466476,0.0125210965,0.000031533902,0.62409097,0.03660216,0.31522542],"study_design_scores_gemma":[0.0002134121,0.000026620559,0.0012171095,0.000013456018,0.0000055914534,0.000013517423,0.000017338609,0.9807904,0.000014447957,0.00954388,0.007989208,0.00015506982],"about_ca_topic_score_codex":0.000369748,"about_ca_topic_score_gemma":0.00019987609,"teacher_disagreement_score":0.9682692,"about_ca_system_score_codex":0.000024685307,"about_ca_system_score_gemma":0.000029620596,"threshold_uncertainty_score":0.41125152},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006748973,0.000041700372,0.98738885,0.0001537258,0.00016406886,0.000509138,0.000026606172,0.00015430142,0.010886694],"genre_scores_gemma":[0.5595821,0.0000031640739,0.43817022,0.00024005218,0.00022989974,0.000010059583,0.0003508634,0.0000096508165,0.0014039893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985063,0.000026174468,0.00023807203,0.0005793399,0.00022397588,0.0004261542],"domain_scores_gemma":[0.9981552,0.00057006185,0.00008708972,0.0008729365,0.00017487265,0.00013989188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080936257,0.00016339909,0.0001828333,0.000034111894,0.00022847115,0.0001581296,0.0007741518,0.000055406224,0.000007863259],"category_scores_gemma":[0.000013634261,0.00011806721,0.000023782157,0.0002180221,0.00005840468,0.00048806818,0.00024150028,0.00011644794,0.000004730961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004657704,0.000580079,0.0033307376,0.000055347176,0.00016525727,0.000126635,0.0006500718,0.0089344485,0.00009433607,0.054499213,0.21472485,0.71637326],"study_design_scores_gemma":[0.00039790527,0.000112852045,0.00014246005,0.000014350192,0.000012068212,0.000041788444,0.00007156557,0.9941985,0.00012194186,0.000113128,0.0045627546,0.00021067465],"about_ca_topic_score_codex":0.000009184331,"about_ca_topic_score_gemma":0.000016371194,"teacher_disagreement_score":0.98526406,"about_ca_system_score_codex":0.000019576162,"about_ca_system_score_gemma":0.000057936835,"threshold_uncertainty_score":0.48146412},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104457356,0.0000044259536,0.8947896,0.00025275102,0.00009269133,0.0002376326,0.000023178558,0.000035513513,0.00010689435],"genre_scores_gemma":[0.99061877,0.000002680383,0.008224863,0.00008948867,0.00006551459,0.000019367351,0.00093686464,0.0000054810234,0.000036998565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998639,0.0000763266,0.00037902288,0.00048724748,0.00024088973,0.00017755349],"domain_scores_gemma":[0.9980399,0.001084782,0.0001535365,0.00043992262,0.00021977429,0.000062072184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057492807,0.00012630971,0.00018473499,0.00022584695,0.00010731728,0.0002112242,0.00034472067,0.00006443446,0.0000452775],"category_scores_gemma":[0.00004390858,0.00012848977,0.000027088323,0.00035159572,0.000027945332,0.0011869187,0.00015458665,0.000068214096,0.000003127844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005351689,0.00004577058,0.11770217,0.000027863052,0.000046034173,5.2346553e-7,0.0006228311,0.4686886,0.0000119629285,0.007053014,0.000026810198,0.4057209],"study_design_scores_gemma":[0.0003953375,0.000053764907,0.102134496,0.000018497394,0.000045043147,4.2488261e-7,0.000032079573,0.896079,0.0000070648384,0.00088802114,0.00020929262,0.00013695558],"about_ca_topic_score_codex":0.000013696925,"about_ca_topic_score_gemma":0.00009663706,"teacher_disagreement_score":0.8865647,"about_ca_system_score_codex":0.00003049955,"about_ca_system_score_gemma":0.00005257695,"threshold_uncertainty_score":0.52396613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16332856,0.00020650786,0.8339746,0.0002903402,0.00010416322,0.00011396608,0.0000067565193,0.000060770228,0.0019143297],"genre_scores_gemma":[0.9929911,0.000026818198,0.006262975,0.00028646877,0.00011483311,0.0000034383024,0.000020531772,0.0000020191214,0.00029181415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999239,0.000020601805,0.0001905464,0.000187344,0.0001365434,0.00022592994],"domain_scores_gemma":[0.99964327,0.000032016404,0.00006738761,0.0001325618,0.000056172168,0.000068610316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015864045,0.00008567326,0.00016448955,0.000010613348,0.00010455372,0.00006307168,0.00016288266,0.000059561156,0.00003085037],"category_scores_gemma":[0.0000011829661,0.000071228525,0.00003970001,0.00013878055,0.00005327862,0.00018869282,0.00007941708,0.00006139656,0.0000031482546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010362616,0.000356651,0.0062065283,0.000016609609,0.000053327774,0.000029652576,0.00037306894,0.0021320716,0.00023076948,0.48642468,0.14703974,0.35703328],"study_design_scores_gemma":[0.00051819364,0.00029478307,0.014506406,0.000015824546,0.000012778263,0.000011324001,0.000036296326,0.97717905,0.00009751352,0.0037902705,0.0033596272,0.00017794792],"about_ca_topic_score_codex":0.000018543815,"about_ca_topic_score_gemma":0.0000011563625,"teacher_disagreement_score":0.975047,"about_ca_system_score_codex":0.000011988453,"about_ca_system_score_gemma":0.000025948048,"threshold_uncertainty_score":0.2904615},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016719234,0.008048057,0.8631687,0.022687573,0.0007966193,0.000219015,0.0000015452185,0.00022383756,0.10468744],"genre_scores_gemma":[0.81263614,0.0040008756,0.18173216,0.0007226103,0.0004325357,0.00005995255,0.000006605388,0.000012269779,0.00039684153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982212,0.00061135745,0.00024615478,0.0002930997,0.0002933404,0.00033480034],"domain_scores_gemma":[0.99459505,0.0003178294,0.000065999906,0.004626841,0.0002783689,0.000115926065],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001145597,0.0001266224,0.00013662945,0.000103908744,0.00046869874,0.0001663394,0.008009505,0.00008802847,0.00003362357],"category_scores_gemma":[0.0000023533116,0.00008926722,0.00007314698,0.00039882175,0.00035176022,0.00024376853,0.004235101,0.0006831076,0.00019295156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015090145,0.00008662956,0.000012970476,0.0000028356308,0.000017853674,0.0000036756232,0.007370351,4.8721404e-7,2.562708e-7,0.44960564,0.015837612,0.52706015],"study_design_scores_gemma":[0.00016414288,0.00012400492,0.003288129,0.000040956354,0.0000072595008,0.000054652697,0.00067014334,0.5402296,0.000007896127,0.031985383,0.42321894,0.00020888742],"about_ca_topic_score_codex":0.00004851929,"about_ca_topic_score_gemma":0.00006455207,"teacher_disagreement_score":0.81246895,"about_ca_system_score_codex":0.00002872942,"about_ca_system_score_gemma":0.0001054085,"threshold_uncertainty_score":0.99735767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019758802,0.00011333329,0.88234013,0.000051593564,0.0003975057,0.000118176904,2.4114095e-7,0.00017477595,0.097045414],"genre_scores_gemma":[0.9886954,0.000008918953,0.01041231,0.0004667754,0.00018110554,0.000010967623,0.0000013027205,0.0000074342024,0.00021583188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989216,0.000047409398,0.00025906076,0.00026959286,0.00013361931,0.00036872827],"domain_scores_gemma":[0.99955636,0.0000664611,0.000049746282,0.00019430599,0.0000308735,0.0001022494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030431765,0.00011037449,0.0001624583,0.000051866085,0.00012966574,0.00007941055,0.00038879085,0.00010436073,0.000089878195],"category_scores_gemma":[0.000002449324,0.000101466576,0.000042791118,0.00022394939,0.000032191238,0.0003174665,0.0001541478,0.00018878387,0.000012202706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029214762,0.0002057427,0.04132446,0.000010554665,0.000021194963,0.00029466284,0.0069794236,0.00021700787,0.000022450111,0.0355336,0.0027703675,0.91259134],"study_design_scores_gemma":[0.00029257312,0.000048898102,0.004327534,0.000020108957,0.000003062454,0.000012344697,0.00011138749,0.9932203,0.000022760663,0.0012787696,0.00051034463,0.00015190938],"about_ca_topic_score_codex":0.00010727628,"about_ca_topic_score_gemma":0.00003572509,"teacher_disagreement_score":0.9930033,"about_ca_system_score_codex":0.00002503109,"about_ca_system_score_gemma":0.000055242363,"threshold_uncertainty_score":0.41376868},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047616027,0.00018840838,0.9276355,0.00023756963,0.0001574799,0.023719199,0.0000036319225,0.0001628471,0.00027936633],"genre_scores_gemma":[0.90502924,0.000020092932,0.0706777,0.0001404671,0.00010756332,0.02397586,0.00001215614,0.00002108154,0.000015854153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998406,0.00009446465,0.00046269599,0.00046342972,0.00014770296,0.00042569096],"domain_scores_gemma":[0.9973828,0.00059579354,0.00022738575,0.0014024703,0.00019120464,0.00020030425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007813417,0.00023500585,0.0003245053,0.00007857912,0.0011962063,0.00038290658,0.0010098435,0.00015825038,0.000002103453],"category_scores_gemma":[0.000007692643,0.00021637992,0.000083662,0.00023730408,0.00020514915,0.00013329803,0.0012840183,0.0004938527,7.9674226e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003290293,0.00049932423,0.0009107902,0.00015901479,0.000073993935,0.0000066143734,0.0024324825,0.021487815,0.0004556037,0.08116905,0.00037471534,0.8923977],"study_design_scores_gemma":[0.0008877011,0.00012352486,0.000061174134,0.0001278741,0.000014410303,0.00007067214,0.000095734315,0.98039734,0.000018436624,0.00029540187,0.017641583,0.0002661524],"about_ca_topic_score_codex":0.000022349966,"about_ca_topic_score_gemma":0.000018266803,"teacher_disagreement_score":0.9589095,"about_ca_system_score_codex":0.000016609743,"about_ca_system_score_gemma":0.000071224335,"threshold_uncertainty_score":0.9200373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017652854,0.0000427615,0.97254497,0.00020328569,0.0010497479,0.00008098558,4.5686951e-7,0.000122047895,0.008302908],"genre_scores_gemma":[0.9709838,0.00013051805,0.027047612,0.0016332198,0.00017766826,0.000002999577,0.0000026805212,0.0000014513496,0.000020040678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884355,0.000012996489,0.00027708686,0.00018980348,0.00040121868,0.0002753333],"domain_scores_gemma":[0.99927795,0.000035146622,0.000098167686,0.00027648086,0.00014801383,0.00016426142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042671597,0.00009746365,0.00010536462,0.00017368658,0.0006502391,0.00039506453,0.00053337525,0.000031392497,0.0000034695115],"category_scores_gemma":[0.000002103024,0.00008268926,0.000023812503,0.0006892536,0.0002761902,0.009418488,0.0003282289,0.00008802427,0.00004571299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003097628,0.000011085483,0.0009502675,0.0000064710466,0.00000192996,0.0000069134867,0.002541101,0.0005806673,0.000008099611,0.044922885,0.0015633059,0.9494042],"study_design_scores_gemma":[0.00015538723,0.00003913582,0.00755768,0.000013127106,8.0590564e-7,0.00021797282,0.0000087314775,0.9728059,0.000010673882,0.00023914964,0.018830534,0.00012089054],"about_ca_topic_score_codex":0.0000036259858,"about_ca_topic_score_gemma":1.01323494e-7,"teacher_disagreement_score":0.97222525,"about_ca_system_score_codex":0.000021964883,"about_ca_system_score_gemma":0.00011546717,"threshold_uncertainty_score":0.6828176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026772514,0.000030762854,0.9877895,0.0019636739,0.0004330409,0.00092898624,0.000002860834,0.00041281877,0.0057610846],"genre_scores_gemma":[0.7832876,7.75459e-7,0.21345314,0.0017493917,0.00048197014,0.0002156589,0.00002078123,0.00002335682,0.0007673159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977421,0.000054963773,0.0004899255,0.0005811626,0.00029088734,0.0008409424],"domain_scores_gemma":[0.99856824,0.00030597326,0.00016313353,0.00043326584,0.0002940659,0.00023534376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000380539,0.0002800875,0.00033114012,0.00006551974,0.00049613294,0.00043316867,0.000741691,0.0002086278,0.00017609399],"category_scores_gemma":[0.000009906003,0.00023946332,0.00019178705,0.00027848367,0.00008305991,0.0004390217,0.00018179795,0.00023730114,0.00012378354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008063962,0.0005078317,0.0019106657,0.00007803055,0.0001295073,0.00004865293,0.00062746665,0.002225495,0.00021729222,0.18103452,0.100018,0.7131219],"study_design_scores_gemma":[0.0010062375,0.00007275758,0.00020070265,0.000020886022,0.000010518141,0.000007198264,0.00003255477,0.9963467,0.00003997807,0.00063087884,0.0012803354,0.00035125986],"about_ca_topic_score_codex":0.00007070068,"about_ca_topic_score_gemma":0.0000050564413,"teacher_disagreement_score":0.9941212,"about_ca_system_score_codex":0.000044640386,"about_ca_system_score_gemma":0.00014439077,"threshold_uncertainty_score":0.9765031},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041552287,0.00019711703,0.9054872,0.0014180903,0.0014410674,0.00018305934,6.1337465e-7,0.00014238454,0.049578194],"genre_scores_gemma":[0.9955146,0.000023797878,0.0027700914,0.00022573923,0.00047566486,0.000007936178,4.4942868e-7,0.0000044100443,0.0009773503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999061,0.00003400507,0.00017574629,0.00023612131,0.00016920103,0.00032395415],"domain_scores_gemma":[0.99956274,0.00008895505,0.00004449611,0.00020506087,0.000021230104,0.00007749115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000342994,0.00009085966,0.00013320374,0.000047881134,0.00014993895,0.00026602607,0.00036883354,0.00007393474,0.000006231757],"category_scores_gemma":[0.0000022374961,0.00007932527,0.000015883381,0.00017609046,0.00005182308,0.00021937687,0.0002859715,0.00021880315,0.000006688099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053179847,0.000027944365,0.015690666,0.000022564282,0.000009586549,0.000084631676,0.0009758456,0.00078275916,0.000056700977,0.8932204,0.008508363,0.0806152],"study_design_scores_gemma":[0.0001667753,0.000011740447,0.00420514,0.00001526278,0.0000021936748,0.000043560118,0.000095241536,0.981718,0.0000029035914,0.011822409,0.0017664239,0.00015032888],"about_ca_topic_score_codex":0.00034840583,"about_ca_topic_score_gemma":0.00021391438,"teacher_disagreement_score":0.9809353,"about_ca_system_score_codex":0.000007339472,"about_ca_system_score_gemma":0.000028493156,"threshold_uncertainty_score":0.32347906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014647916,0.00004476905,0.9588869,0.000027165679,0.00097921,0.039281193,0.00014428789,0.00036885517,0.00012110405],"genre_scores_gemma":[0.8900768,0.000004476286,0.0013970771,0.000044448396,0.00015799716,0.10812534,0.00003953446,0.00001681194,0.0001375072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812514,0.00014718086,0.0005316141,0.0004113536,0.00020384071,0.000580846],"domain_scores_gemma":[0.9986844,0.000244205,0.00023595801,0.00033200072,0.00020239328,0.00030102333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036736403,0.000287815,0.000369881,0.000071200644,0.00045699935,0.00021744621,0.00024876822,0.00020657292,0.0000060432703],"category_scores_gemma":[0.0000014077035,0.00025006558,0.00014908671,0.00023836907,0.000044996883,0.00050096464,0.0000058470737,0.00023441635,0.0000088203315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029416743,0.005849451,0.0012525843,0.0012901573,0.0017587418,0.00006973617,0.0029054552,0.81687015,0.00010000769,0.029554736,0.013738289,0.12366902],"study_design_scores_gemma":[0.0020351056,0.0003838295,0.000049549264,0.00014286817,0.000043587937,0.00006485653,0.00038806064,0.9937394,0.000010675394,0.000027960543,0.002805593,0.00030851402],"about_ca_topic_score_codex":0.000033663568,"about_ca_topic_score_gemma":0.000004093203,"teacher_disagreement_score":0.95748985,"about_ca_system_score_codex":0.00008554086,"about_ca_system_score_gemma":0.00004695212,"threshold_uncertainty_score":0.9999952},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016218306,0.000029321056,0.96878,0.011971098,0.0012580145,0.0008308149,0.000083734456,0.000047861497,0.0007808655],"genre_scores_gemma":[0.9788073,0.000027215508,0.019161766,0.001860055,0.000065515094,8.762379e-7,0.000038022077,0.000009626933,0.000029676583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588215,0.0004442408,0.0015529218,0.0004297458,0.0011682239,0.0005226952],"domain_scores_gemma":[0.99637437,0.0010477797,0.0015118093,0.0004999471,0.0004168066,0.00014926727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022748276,0.00035663636,0.0004530787,0.0012528013,0.0011856407,0.0007736735,0.00185892,0.00009369235,0.0000025357663],"category_scores_gemma":[0.0004963827,0.00024189202,0.00027945626,0.0016193495,0.0016535631,0.00051754084,0.00078295614,0.00033580608,0.0000013331858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002879765,0.00003109156,0.00019687483,0.00006453605,0.0000412038,1.734872e-7,0.003281197,0.009843454,0.0005711527,0.00002430502,0.00001934571,0.9856387],"study_design_scores_gemma":[0.0011449653,0.00027289832,0.0020473697,0.0007779414,0.000020520887,0.0000849702,0.0009952964,0.98836935,0.0009729635,0.0041900026,0.0008616938,0.0002620245],"about_ca_topic_score_codex":0.5529957,"about_ca_topic_score_gemma":0.13960205,"teacher_disagreement_score":0.98537666,"about_ca_system_score_codex":0.00007728331,"about_ca_system_score_gemma":0.0005285808,"threshold_uncertainty_score":0.98640704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012926502,0.00036271402,0.993656,0.0002915548,0.0038978774,0.0003884169,0.000015044211,0.00006084142,0.00003494603],"genre_scores_gemma":[0.88619536,0.000030563628,0.11205169,0.000060262028,0.0015747213,0.000021207694,0.00000389193,0.000014410766,0.00004787564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975686,0.00034794412,0.00080286304,0.00027563682,0.0005599527,0.00044499288],"domain_scores_gemma":[0.9958986,0.0020229938,0.00093556766,0.0003157274,0.0006684054,0.0001586851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026853986,0.00021898522,0.0004927611,0.0002370497,0.00087550486,0.00033669706,0.000881646,0.00030038747,0.000014184062],"category_scores_gemma":[0.000031376625,0.00014760972,0.00037465495,0.001349926,0.00006987881,0.00029803152,0.000053719858,0.0012374229,0.0000031078753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014221054,0.00015008634,0.0015013969,0.000019545509,0.0032657343,0.00005494294,0.0023722427,0.8557206,0.00004137572,0.11787022,0.0067431545,0.012118489],"study_design_scores_gemma":[0.00032681733,0.000062220526,0.0005561568,0.000037804475,0.00039851558,0.0001921247,0.00012541849,0.99235845,0.000002971464,0.0054620323,0.00030872022,0.00016877231],"about_ca_topic_score_codex":0.000024862746,"about_ca_topic_score_gemma":0.000004768472,"teacher_disagreement_score":0.8849027,"about_ca_system_score_codex":0.00008699984,"about_ca_system_score_gemma":0.0003404354,"threshold_uncertainty_score":0.6733764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04094738,0.000114189235,0.95249027,0.0001266584,0.00031382352,0.00011710541,0.0000010566825,0.00009561965,0.0057939086],"genre_scores_gemma":[0.9094283,0.000008084831,0.08994363,0.0003575194,0.00014832402,0.0000011694987,0.0000039170113,0.0000100812795,0.00009897856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979798,0.000036816564,0.0007380007,0.00036398647,0.00029567507,0.00058570056],"domain_scores_gemma":[0.9986215,0.0005523396,0.00015091474,0.0004073753,0.00009430219,0.00017356248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113545,0.00017432329,0.0003204392,0.00014262738,0.00006111877,0.00005187327,0.0006039149,0.00012782401,0.000026545336],"category_scores_gemma":[0.000017062392,0.00015282373,0.00007150706,0.00050277123,0.00006742916,0.00020888617,0.00026850897,0.0002858537,0.0000034541874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000820356,0.00094479404,0.018953605,0.000029702906,0.000060310078,0.0005742387,0.0010303744,0.07568582,0.00023645596,0.2800062,0.00023120292,0.62216526],"study_design_scores_gemma":[0.00031335838,0.00007797945,0.0040354673,0.00010122814,0.0000057712923,0.00003381195,0.000085054264,0.9942565,0.000023162489,0.00084533816,0.000036675876,0.00018566713],"about_ca_topic_score_codex":0.00013235943,"about_ca_topic_score_gemma":0.000449321,"teacher_disagreement_score":0.91857064,"about_ca_system_score_codex":0.000035311034,"about_ca_system_score_gemma":0.0000756925,"threshold_uncertainty_score":0.62319714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09449883,0.00043480002,0.90273315,0.0006272425,0.00019085914,0.0001119373,0.0000026204987,0.000041251104,0.0013593242],"genre_scores_gemma":[0.9849841,0.0007145679,0.014002055,0.00019416626,0.00006144304,0.000007111157,0.000007856555,0.000008660401,0.000020064144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975988,0.00057600916,0.000959647,0.0001974876,0.00028429297,0.00038372364],"domain_scores_gemma":[0.99594975,0.0020034346,0.0005230845,0.0011490233,0.00025263164,0.00012208433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164212,0.00014437438,0.00048917806,0.00079675484,0.00035668135,0.00004060057,0.0017868638,0.00009413043,0.000008735804],"category_scores_gemma":[0.00012891051,0.00014356792,0.00012185612,0.0055644037,0.0001011286,0.0002202,0.00015846614,0.0010254162,0.0000032987114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045497858,0.00056166435,0.101446,0.000003886977,0.00043732132,0.00009139582,0.002439016,0.8615688,0.000098352735,0.016724845,0.0011383551,0.0154448245],"study_design_scores_gemma":[0.0002988172,0.000040682622,0.038815025,0.00017486037,0.000056885085,0.00010663419,0.000025203128,0.9593243,0.0000031008492,0.000988557,0.000032075397,0.00013388193],"about_ca_topic_score_codex":0.000059837876,"about_ca_topic_score_gemma":0.00027447368,"teacher_disagreement_score":0.8904852,"about_ca_system_score_codex":0.00017031275,"about_ca_system_score_gemma":0.0002802952,"threshold_uncertainty_score":0.585453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048151785,0.0046982993,0.9554618,0.00068918127,0.00020567674,0.00016574195,6.108355e-7,0.00025905352,0.033704486],"genre_scores_gemma":[0.9460613,0.0023126474,0.048624847,0.0016511831,0.00017850184,0.00003737097,0.000005891095,0.000010173684,0.0011180935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861664,0.000038235536,0.00031926244,0.00043806533,0.00016812154,0.00041967037],"domain_scores_gemma":[0.99902016,0.000058750218,0.000061621875,0.0007026315,0.000029501645,0.00012734612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027800817,0.000151377,0.00018973756,0.00006610878,0.00006468859,0.0002469793,0.0006455449,0.00010348651,0.0001877287],"category_scores_gemma":[8.879924e-7,0.00013037116,0.000050014078,0.00033835726,0.000043312673,0.00067003665,0.00020291204,0.00021168927,0.00014040654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008642791,0.00006567555,0.00009217681,0.0000021453072,0.0000053601966,0.000044408305,0.000109375585,0.013149686,0.0000036270562,0.056246106,0.013624009,0.9166488],"study_design_scores_gemma":[0.00021467202,0.000049546754,0.00012819972,0.000009699971,0.0000016938872,0.000016304984,0.000050322888,0.7873111,0.00000621122,0.0017125242,0.21033038,0.0001693419],"about_ca_topic_score_codex":0.000003982202,"about_ca_topic_score_gemma":0.000087170876,"teacher_disagreement_score":0.9412461,"about_ca_system_score_codex":0.000030076431,"about_ca_system_score_gemma":0.000076845456,"threshold_uncertainty_score":0.53163815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009975354,0.000088310175,0.9883479,0.0003542533,0.00034433353,0.00040494621,0.00002644489,0.00007161351,0.00038686075],"genre_scores_gemma":[0.975538,0.000014873811,0.02386148,0.00011504057,0.00006030001,0.000009514947,0.00025884592,0.0000054689913,0.00013645334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998762,0.00003040504,0.00039664676,0.00039481287,0.00019626261,0.00021983798],"domain_scores_gemma":[0.9990811,0.00012527118,0.00012605278,0.0005003269,0.0000946645,0.0000726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027865227,0.0001156332,0.00016960589,0.000095135925,0.00006977737,0.00013215186,0.00055427046,0.00007826716,0.000004615926],"category_scores_gemma":[0.000005856614,0.00010505743,0.000029663457,0.00029767182,0.000012962041,0.00059990695,0.000020089263,0.00007122576,0.0000019614258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000394124,0.0002156965,0.0005955521,0.00004447157,0.000015318485,0.000044401437,0.00073044916,0.00202502,0.0010569735,0.050101288,0.0029670086,0.9421644],"study_design_scores_gemma":[0.0002006825,0.00005654214,0.0027160218,0.000091507056,0.000011160694,0.0000050856534,0.0001584973,0.9954679,0.00010921787,0.00062066264,0.00042022503,0.00014246634],"about_ca_topic_score_codex":0.00006925606,"about_ca_topic_score_gemma":0.000047308367,"teacher_disagreement_score":0.9934429,"about_ca_system_score_codex":0.00004783769,"about_ca_system_score_gemma":0.00006005936,"threshold_uncertainty_score":0.42841175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002903336,0.00084246293,0.9888436,0.0030125338,0.00018622831,0.0003122017,0.0000064140554,0.00015049869,0.0037426858],"genre_scores_gemma":[0.99181575,0.0007450341,0.0054573407,0.0006524685,0.00017822532,0.000058322952,0.0010506542,0.000014955574,0.000027241442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977445,0.00069749466,0.0005000798,0.00051639206,0.00018574383,0.00035576144],"domain_scores_gemma":[0.9966949,0.00084692,0.00026740125,0.0019846873,0.00009575193,0.00011031808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037836,0.00019701288,0.00026753944,0.00010270296,0.0005378706,0.0003298002,0.0023955072,0.0002394034,0.000038623664],"category_scores_gemma":[0.000027084001,0.0002161336,0.00003764471,0.0005461749,0.00010949697,0.00090938894,0.0019004537,0.00061577925,0.0000023944697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000425437,0.00030159188,0.00223217,0.000031342322,0.000021589773,0.00000179387,0.0022155687,0.00812241,0.0000016348664,0.021279601,0.019333394,0.9464164],"study_design_scores_gemma":[0.00039669638,0.00003159255,0.0009811429,0.00008313958,0.000009553069,0.0000025816894,0.00008632471,0.97747076,7.205316e-7,0.0046164133,0.016086213,0.0002348771],"about_ca_topic_score_codex":0.00005657431,"about_ca_topic_score_gemma":0.00015696167,"teacher_disagreement_score":0.9889124,"about_ca_system_score_codex":0.000041790638,"about_ca_system_score_gemma":0.00003577962,"threshold_uncertainty_score":0.88136727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110707514,0.00032877832,0.8849149,0.00030186525,0.00062594254,0.0016133988,0.0000015399263,0.00019078286,0.0013153179],"genre_scores_gemma":[0.97895426,0.000013299082,0.018902522,0.00089741696,0.0001206595,0.00082043814,0.0000037340126,0.000018861516,0.00026880702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978074,0.00008820827,0.00053375633,0.00061097805,0.0002453558,0.00071430305],"domain_scores_gemma":[0.9982083,0.00076362956,0.0001260231,0.00053898053,0.00014348881,0.00021956487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007442393,0.00024539625,0.00041118296,0.00009925639,0.00015676476,0.0002107489,0.00051806594,0.00014676541,0.00006985082],"category_scores_gemma":[0.000009893586,0.00020105689,0.00013514631,0.00028428264,0.00004396258,0.00017159188,0.00016596245,0.00021855772,0.000041096282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034240715,0.000263558,0.00067980826,0.000008916161,0.00002357772,0.00002174501,0.00017741071,0.88783675,0.000034314704,0.01239972,0.00189867,0.0966213],"study_design_scores_gemma":[0.001512438,0.00018233803,0.00025346043,0.00003076495,0.000007659905,0.000013970852,0.000042590258,0.99621755,0.000025821282,0.0005853213,0.00084580184,0.00028230378],"about_ca_topic_score_codex":0.00020555974,"about_ca_topic_score_gemma":0.000047874346,"teacher_disagreement_score":0.86824673,"about_ca_system_score_codex":0.00009356388,"about_ca_system_score_gemma":0.00007386419,"threshold_uncertainty_score":0.81988615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001427794,0.00045462712,0.99442756,0.00049057737,0.0006303728,0.0017604729,0.00009820423,0.00027129272,0.000439121],"genre_scores_gemma":[0.991693,0.0001974893,0.0024388079,0.0010610793,0.0018048331,0.0021401804,0.0005380958,0.000038806844,0.00008767437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971508,0.00003731817,0.0006624438,0.0010911769,0.0002498255,0.0008084329],"domain_scores_gemma":[0.99653757,0.0006377573,0.00041133718,0.0017522587,0.00022267911,0.00043837793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007782729,0.00034759773,0.00044663376,0.00006183012,0.00075487484,0.0007089808,0.0027175867,0.00032798963,0.000026926667],"category_scores_gemma":[0.00000284218,0.00031740547,0.000088547466,0.000443234,0.00023997056,0.0007744165,0.00090571784,0.0005665049,0.0000058262854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044774322,0.00025526958,0.0032720116,0.00008421566,0.00010046051,0.0000098720575,0.000059406586,0.08286519,0.000028838713,0.019824775,0.01171634,0.88173884],"study_design_scores_gemma":[0.0006403615,0.00005474744,0.00027470285,0.000023781726,0.000062927946,0.000025280375,0.000058342936,0.91384554,0.000003816374,0.0009603772,0.083706565,0.0003435465],"about_ca_topic_score_codex":0.000057042023,"about_ca_topic_score_gemma":0.00027839196,"teacher_disagreement_score":0.9919887,"about_ca_system_score_codex":0.0000139835465,"about_ca_system_score_gemma":0.000108699765,"threshold_uncertainty_score":0.9999278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012089814,0.000005897453,0.96793514,0.00018006291,0.00009258743,0.020846939,8.114105e-7,0.00030914042,0.009420428],"genre_scores_gemma":[0.8606933,6.0775176e-7,0.12478281,0.00091978995,0.00021483649,0.011715722,0.000003833011,0.000018194783,0.0016509057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988876,0.00003396139,0.00022755329,0.00042657784,0.00014894216,0.00027538167],"domain_scores_gemma":[0.99925864,0.000098319026,0.00012115816,0.00027249145,0.0001030183,0.00014635717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001669833,0.00016612023,0.00016854948,0.0000674653,0.00012333857,0.0004345609,0.0003375493,0.00006706109,0.00007082161],"category_scores_gemma":[0.0000015183215,0.00012086776,0.000023334376,0.00016401974,0.000040716714,0.0007564176,0.000097809534,0.00012298296,0.000008514362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001799242,0.00039230936,0.0027065538,0.0002505329,0.00005612129,0.000036533675,0.00193482,0.0005184632,0.000024590197,0.019172767,0.027956916,0.9467705],"study_design_scores_gemma":[0.00074265955,0.00066859054,0.000082217055,0.000109159126,0.000005640671,0.00010368908,0.00007741047,0.98025364,0.00013814714,0.00023650333,0.017389486,0.00019285522],"about_ca_topic_score_codex":0.00003089488,"about_ca_topic_score_gemma":0.00004192365,"teacher_disagreement_score":0.9797352,"about_ca_system_score_codex":0.000017311273,"about_ca_system_score_gemma":0.000016426779,"threshold_uncertainty_score":0.4928844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035120195,0.0000436918,0.99422425,0.0005686262,0.0002832224,0.00040895838,0.000031920677,0.00013853725,0.00078879273],"genre_scores_gemma":[0.90022403,0.000010314169,0.09610761,0.0010811912,0.00019575727,0.00005668934,0.0001104296,0.00002324185,0.0021907608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838555,0.000019972289,0.00021773981,0.000496255,0.00029070408,0.0005897846],"domain_scores_gemma":[0.99908954,0.00008495215,0.000083481755,0.000523735,0.000015332014,0.00020298532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013113546,0.00023072181,0.0002273513,0.000031273554,0.00020668334,0.00012310216,0.0005197111,0.00010355594,0.00003811352],"category_scores_gemma":[0.0000019624292,0.00016988911,0.00007357383,0.0002443885,0.00008717565,0.00019082605,0.000160147,0.00016442145,0.000026217294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047022366,0.0006429523,0.0013565483,0.000031982883,0.00028745757,0.00020197936,0.00041902144,0.6638122,0.00011765664,0.16896911,0.019708538,0.14398234],"study_design_scores_gemma":[0.0036224406,0.0008715633,0.0010827739,0.00007857724,0.000039975555,0.000077853125,0.000019682353,0.93457246,0.000033564105,0.019064104,0.039910007,0.0006269881],"about_ca_topic_score_codex":0.000017568073,"about_ca_topic_score_gemma":0.00003804523,"teacher_disagreement_score":0.89811665,"about_ca_system_score_codex":0.00009653067,"about_ca_system_score_gemma":0.000094239156,"threshold_uncertainty_score":0.6927877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007008389,0.00033217383,0.85411173,0.0043994705,0.0006315169,0.0004432089,0.000002696097,0.00022118888,0.13915716],"genre_scores_gemma":[0.98607963,0.00016415,0.006575433,0.0024915866,0.000072830524,0.00001651771,0.000009349544,0.00000585466,0.004584626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983795,0.000063183026,0.00038544333,0.00043349963,0.0003023554,0.00043599616],"domain_scores_gemma":[0.99901646,0.00003653463,0.00007633015,0.00059039553,0.000050889692,0.0002294123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029143709,0.00016505657,0.00023993642,0.00014597595,0.000083396124,0.00015986008,0.00062523683,0.00007408707,0.000023133092],"category_scores_gemma":[0.0000014131921,0.00014656366,0.000046612055,0.0003595945,0.00001986419,0.00020971487,0.00010010755,0.00014316605,0.00006335328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059413687,0.000072845425,0.000271439,0.000030222809,0.000008214461,0.0009032374,0.00015397508,0.00008497397,8.9675456e-7,0.7563368,0.004118483,0.23801295],"study_design_scores_gemma":[0.00054254604,0.00019461864,0.0025477444,0.00010058588,0.000007683321,0.000084130064,0.00041877816,0.97991544,8.167874e-7,0.0077246325,0.008133724,0.00032928208],"about_ca_topic_score_codex":0.000088628396,"about_ca_topic_score_gemma":0.000010925728,"teacher_disagreement_score":0.9853788,"about_ca_system_score_codex":0.00007988719,"about_ca_system_score_gemma":0.00007304911,"threshold_uncertainty_score":0.59766924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007823987,0.00008352222,0.973719,0.000190477,0.000809202,0.00029591232,0.000003974639,0.0003974487,0.02442225],"genre_scores_gemma":[0.837144,0.000014658553,0.1597858,0.0015034513,0.0001316899,0.000041536085,0.000023702272,0.000019397945,0.0013357395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837565,0.00003934746,0.00038626613,0.00048020482,0.0001852981,0.0005332517],"domain_scores_gemma":[0.9985484,0.0002593033,0.00014671871,0.00063078833,0.00014272747,0.0002720977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004927399,0.00020396276,0.0002279449,0.00006817876,0.0002400059,0.00011038517,0.00070923194,0.00012700954,0.0001932899],"category_scores_gemma":[0.00001326388,0.00018176028,0.00013270117,0.00021579383,0.000056535268,0.00022415005,0.00010884352,0.00013322657,0.000029329458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044299937,0.00016554879,0.00050635386,0.000017922512,0.000029361621,0.00005619762,0.00020539881,0.00038026148,0.000004108865,0.25685525,0.007522116,0.7342132],"study_design_scores_gemma":[0.0004319056,0.0001356124,0.00014600248,0.000020280451,0.000016533499,0.0000074966842,0.00002190644,0.992745,0.000012083524,0.0035738242,0.0026357756,0.00025362283],"about_ca_topic_score_codex":0.00000977701,"about_ca_topic_score_gemma":0.000006836166,"teacher_disagreement_score":0.9923647,"about_ca_system_score_codex":0.000028062193,"about_ca_system_score_gemma":0.00014296443,"threshold_uncertainty_score":0.7411969},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007566322,0.00007106123,0.98944294,0.00014381373,0.0022537555,0.00027064444,5.617301e-7,0.000080458245,0.00017042318],"genre_scores_gemma":[0.9110295,0.000006779652,0.088399075,0.00020715567,0.000327753,0.000007382166,0.0000013493677,0.00000690517,0.000014058009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900836,0.00009746049,0.00026380437,0.00025158792,0.00015886778,0.00021994798],"domain_scores_gemma":[0.99902743,0.00014760974,0.00015580448,0.00052819605,0.000060783394,0.0000801684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038937625,0.00012027107,0.00015795694,0.00002876227,0.0001319933,0.00010557602,0.00062328577,0.000084025254,0.0000054437937],"category_scores_gemma":[3.7321223e-7,0.00008568625,0.000043561562,0.00019124348,0.000069044625,0.0001396948,0.0003945175,0.00021821889,0.000001839154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069985244,0.000025572472,0.003916655,0.000033923832,0.000040078863,0.000012636742,0.00048188705,0.010665045,0.00006743739,0.07331624,0.011693996,0.8997395],"study_design_scores_gemma":[0.00023421254,0.000040288414,0.0032938858,0.000024628072,0.000007681714,0.00005645942,0.000011030868,0.99539036,0.00004121896,0.0002844485,0.00051761494,0.00009814874],"about_ca_topic_score_codex":0.000012653884,"about_ca_topic_score_gemma":0.000005397911,"teacher_disagreement_score":0.98472536,"about_ca_system_score_codex":0.000008261236,"about_ca_system_score_gemma":0.000045657707,"threshold_uncertainty_score":0.3494184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005199191,0.002983503,0.9892109,0.00044012006,0.00014418975,0.0012542835,0.0000074215923,0.00014364634,0.0006167237],"genre_scores_gemma":[0.98720896,0.00018909105,0.009714414,0.0015163285,0.00037319053,0.0008686532,0.000037778012,0.000016137401,0.00007544695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998715,0.000030401505,0.0002717844,0.0003987397,0.0001390802,0.00044499544],"domain_scores_gemma":[0.99884236,0.000062077044,0.00009909433,0.00051223295,0.000097582255,0.00038668333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009259033,0.0001751163,0.00021247934,0.00005657702,0.000512605,0.00027837334,0.0003650246,0.00008199361,0.000028928713],"category_scores_gemma":[5.4478136e-7,0.00016366465,0.000044356784,0.00041035272,0.000031287473,0.00019799774,0.00022481443,0.00016567232,0.000020530444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016658108,0.000039255894,0.00038172174,0.00002041336,0.000012414665,0.0000021427825,0.00050887367,0.084249325,0.000018199153,0.012989665,0.011708619,0.8900677],"study_design_scores_gemma":[0.00012583031,0.00006844324,0.00026802003,0.00004650226,0.000006774081,0.000028069828,0.00050466025,0.95160794,0.0000017092397,0.00053737994,0.046561692,0.00024300204],"about_ca_topic_score_codex":0.0001257618,"about_ca_topic_score_gemma":0.00001319501,"teacher_disagreement_score":0.98200977,"about_ca_system_score_codex":0.000060644135,"about_ca_system_score_gemma":0.00006268458,"threshold_uncertainty_score":0.66740507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014148653,0.000029816836,0.99198693,0.00054099766,0.00031876657,0.000471861,0.0000033475123,0.00025997212,0.0049734362],"genre_scores_gemma":[0.8045672,0.00000671349,0.1884703,0.006430926,0.00015079402,0.000047950085,0.00006454428,0.0000046054924,0.00025692093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989378,0.000008081689,0.0003198895,0.00020039133,0.00020298809,0.0003308606],"domain_scores_gemma":[0.99914694,0.00008784027,0.00011410883,0.0003982861,0.00011766776,0.000135133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002305368,0.00014651,0.00015806106,0.00007774984,0.00015289291,0.00020096736,0.00041751305,0.00011699547,0.000028177643],"category_scores_gemma":[0.0000049098476,0.00012232509,0.000086448854,0.00024314711,0.000017349403,0.0007544685,0.00005500872,0.00010147354,0.000021055155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006052894,0.00027168935,0.00009022371,0.000015580363,0.000008142801,0.000002242106,0.000109843095,0.015808031,0.00022147139,0.0655021,0.023838518,0.89407164],"study_design_scores_gemma":[0.00090649957,0.00025947703,0.00019485451,0.000017156379,0.0000037903483,0.000003473546,0.00000952075,0.975264,0.000035286932,0.00052542554,0.02260481,0.00017569272],"about_ca_topic_score_codex":0.0000063215216,"about_ca_topic_score_gemma":9.609163e-7,"teacher_disagreement_score":0.95945597,"about_ca_system_score_codex":0.000026168571,"about_ca_system_score_gemma":0.00007346401,"threshold_uncertainty_score":0.49882725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017781848,0.000060479255,0.9526486,0.0045475275,0.00030400962,0.000119942,1.9569214e-7,0.00020424799,0.040336847],"genre_scores_gemma":[0.8571328,0.000023724582,0.13942343,0.0024463919,0.00033314465,0.000007525528,0.0000018523851,0.000009746929,0.0006213694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981385,0.00008429672,0.00045393882,0.00044641903,0.00027107328,0.0006057621],"domain_scores_gemma":[0.99891144,0.00027554514,0.00008661856,0.0004808051,0.00004661894,0.00019898961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000651677,0.00017586375,0.00022939744,0.00008185632,0.000096492724,0.00018539661,0.00045874066,0.00014152502,0.00011482328],"category_scores_gemma":[0.000010303112,0.00015364603,0.00006376005,0.00039890507,0.000038052443,0.00070223596,0.0002509937,0.00040886618,0.0001309877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000235744,0.00027829266,0.0026907965,0.000003503512,0.000017329632,0.0005584064,0.00036988294,0.01184693,0.000004492531,0.37971663,0.016824305,0.58766586],"study_design_scores_gemma":[0.00036620887,0.000029749956,0.00027746198,0.000018783998,0.0000034471807,0.00015992306,0.000023608425,0.99242765,0.000005641388,0.0004109404,0.006062426,0.00021414617],"about_ca_topic_score_codex":0.00004086487,"about_ca_topic_score_gemma":0.00008207664,"teacher_disagreement_score":0.98058075,"about_ca_system_score_codex":0.00006134761,"about_ca_system_score_gemma":0.00011506581,"threshold_uncertainty_score":0.6265504},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016952942,0.0000986289,0.9778392,0.0035120356,0.0008670481,0.00016533265,0.000023668483,0.00039356557,0.016931029],"genre_scores_gemma":[0.8212072,0.000043636825,0.13099259,0.03695069,0.0073681907,0.0000052125943,0.0006425108,0.00002532437,0.0027646055],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979936,0.00007743066,0.00035565818,0.0007142459,0.00033130124,0.00052775367],"domain_scores_gemma":[0.9983063,0.00010062227,0.000086678534,0.0011766641,0.00007770226,0.0002520763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031191608,0.00020165318,0.00026406161,0.000035411333,0.000319003,0.00036634764,0.0017280187,0.00014330512,0.0002276324],"category_scores_gemma":[0.0000053351387,0.0001877651,0.000046087527,0.0006233116,0.000020910604,0.00045837197,0.00061111315,0.00014658844,0.0001669777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018736524,0.00006556054,0.00014276359,6.9462175e-7,0.00002348008,0.000056042336,0.00012171144,0.0020961496,0.0000047725307,0.06451811,0.79466575,0.13828625],"study_design_scores_gemma":[0.00018357138,0.000058033045,0.0011698056,0.000010321991,0.000012259991,0.0000046017813,0.000010315771,0.9096276,0.0000012053059,0.003193334,0.08546823,0.0002606964],"about_ca_topic_score_codex":0.000024544532,"about_ca_topic_score_gemma":0.000013770071,"teacher_disagreement_score":0.9075315,"about_ca_system_score_codex":0.00002016535,"about_ca_system_score_gemma":0.00006290462,"threshold_uncertainty_score":0.7656838},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050331308,0.00036318705,0.9855902,0.00023151755,0.0004098614,0.0003792042,0.0000052123473,0.00034094058,0.00764672],"genre_scores_gemma":[0.8408251,0.00003228351,0.15563428,0.0028297221,0.0003296304,0.000012835198,0.0000138388705,0.000014405405,0.00030794682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979472,0.000050231567,0.00038390615,0.00064782606,0.00028890403,0.00068193226],"domain_scores_gemma":[0.9985485,0.00017138619,0.000119461365,0.0006897562,0.00015578055,0.0003151155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045620516,0.0002815571,0.0003432339,0.0000865376,0.0002899784,0.0002693353,0.00082876964,0.00018100133,0.00004649406],"category_scores_gemma":[0.000002911016,0.00024457418,0.00018290324,0.00027551153,0.00003607854,0.0010420636,0.000095962896,0.00020011349,0.000009186704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021690456,0.00024324229,0.00016666373,0.000005630083,0.00007360114,0.00009224424,0.0002491578,0.016809203,0.000094852185,0.29309812,0.019070145,0.6698802],"study_design_scores_gemma":[0.0006587881,0.0005717506,0.00022785722,0.000029597053,0.000017759761,0.00002286336,0.00003505677,0.9933827,0.00004286832,0.0028672884,0.0017646728,0.00037881255],"about_ca_topic_score_codex":0.000017322445,"about_ca_topic_score_gemma":0.0000074527707,"teacher_disagreement_score":0.97657347,"about_ca_system_score_codex":0.000048651356,"about_ca_system_score_gemma":0.000084544525,"threshold_uncertainty_score":0.9973446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050493125,0.0005494468,0.9449404,0.0002795006,0.0004918898,0.000261675,0.000002828625,0.00013272653,0.0028484124],"genre_scores_gemma":[0.9027051,0.00019464808,0.09468671,0.0008135287,0.00009506374,0.00005181476,0.00002347005,0.000013421677,0.0014162925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981341,0.000035501063,0.0004193867,0.0005979157,0.00023898836,0.00057415117],"domain_scores_gemma":[0.99844414,0.00021701012,0.000109785426,0.0008888068,0.00012823522,0.00021203645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077384274,0.00021053696,0.00040080075,0.0002596012,0.00012841808,0.00018299627,0.0007980685,0.00023729457,0.00011452954],"category_scores_gemma":[0.000008209224,0.00018439096,0.00024666122,0.0012685339,0.00004977981,0.00036838703,0.00020914807,0.00036902828,0.000018862153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003010314,0.0009788645,0.046772175,0.000056090867,0.0014288287,0.0011879978,0.00079307595,0.293895,0.00034691658,0.08550009,0.050265715,0.5184742],"study_design_scores_gemma":[0.00047749048,0.000051137577,0.00088611274,0.0000083107125,0.00010148003,0.00000913494,0.000013916888,0.9814759,0.000014344697,0.00094952487,0.01575173,0.00026094794],"about_ca_topic_score_codex":0.00006501312,"about_ca_topic_score_gemma":0.00082350656,"teacher_disagreement_score":0.85221195,"about_ca_system_score_codex":0.000022718712,"about_ca_system_score_gemma":0.00009376513,"threshold_uncertainty_score":0.7519245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009277928,0.000212003,0.98348576,0.005705165,0.00048416157,0.00023726009,0.000011590795,0.00016981603,0.00041631248],"genre_scores_gemma":[0.7523169,0.000013192332,0.24479666,0.0023169306,0.00039944577,0.00007587479,0.0000378114,0.000015868876,0.000027324308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875206,0.0001184942,0.00029219262,0.00020155369,0.00017021813,0.0004654565],"domain_scores_gemma":[0.9980071,0.00036507804,0.00015766101,0.001263854,0.00008159528,0.00012467813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041595893,0.00015631448,0.00017852314,0.00006864839,0.00079413515,0.00014954222,0.0020791849,0.00007573339,0.000002661996],"category_scores_gemma":[0.0000014392991,0.00016514889,0.00010153819,0.00022708278,0.00013160432,0.0005651679,0.00038366028,0.0002065203,0.000033126915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000414446,0.00035636255,0.00054066227,0.00005350265,0.00008653751,0.0000036321378,0.006135828,0.000021789614,0.007780962,0.013734802,0.006263493,0.9650183],"study_design_scores_gemma":[0.0003055736,0.000009731256,0.000107793494,0.000021825224,0.000024853209,0.000008756744,0.0001251378,0.98633873,0.00022068112,0.000111958514,0.012486699,0.0002382465],"about_ca_topic_score_codex":0.00002934533,"about_ca_topic_score_gemma":0.0000040016603,"teacher_disagreement_score":0.986317,"about_ca_system_score_codex":0.00004270647,"about_ca_system_score_gemma":0.00001938683,"threshold_uncertainty_score":0.6734576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4003757,0.00002497045,0.5880236,0.000050507133,0.00072796067,0.00013089411,7.374962e-7,0.00018403263,0.010481566],"genre_scores_gemma":[0.99770445,0.000023868395,0.001417037,0.0003196647,0.00020741225,0.00008158764,0.0000035867563,0.00001417123,0.00022823988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985779,0.00007210338,0.00034145353,0.00042030736,0.00012344588,0.00046482612],"domain_scores_gemma":[0.9994401,0.00007243584,0.000080301885,0.00022220971,0.000057947647,0.00012704036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021709668,0.00018905007,0.00025188047,0.00011674357,0.000102959835,0.00009178472,0.0006698621,0.00009301167,0.00019803733],"category_scores_gemma":[0.0000018129215,0.00017490805,0.000087406515,0.0003416154,0.00007960521,0.0006435624,0.00035168615,0.00031819157,0.000037291637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009299351,0.00039665637,0.004437249,0.000017359784,0.000052034968,0.0005272346,0.017919565,0.000020209947,0.00004023684,0.07368643,0.0026088376,0.9002012],"study_design_scores_gemma":[0.00054218265,0.0001260051,0.0042893696,0.000051219664,0.00000523985,0.00002967308,0.0011115602,0.9927257,0.000046897174,0.00050507335,0.00023251772,0.00033458316],"about_ca_topic_score_codex":0.00010415608,"about_ca_topic_score_gemma":0.000121830606,"teacher_disagreement_score":0.99270546,"about_ca_system_score_codex":0.00004626903,"about_ca_system_score_gemma":0.000043335607,"threshold_uncertainty_score":0.71325433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026329933,0.00011913757,0.97280127,0.004093156,0.000896402,0.00032837893,0.0000024406381,0.00041623536,0.02107971],"genre_scores_gemma":[0.87406677,0.000025651058,0.10681173,0.010286859,0.003390601,0.000015640575,0.000015477748,0.000017990282,0.005369284],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981276,0.000051352385,0.0003301396,0.00047925307,0.00023275359,0.0007789439],"domain_scores_gemma":[0.9990136,0.00020120427,0.00011260853,0.00038850826,0.00010633616,0.00017774434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003880562,0.00022934051,0.00030903117,0.000033926986,0.00042368882,0.00022718217,0.0004795285,0.00019833607,0.000036855767],"category_scores_gemma":[0.0000038746252,0.00020427165,0.00018735611,0.00033805618,0.00003799484,0.00022611124,0.00008311089,0.00018323796,0.000023458684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005349178,0.0000717108,0.000057908877,0.0000041627723,0.000030545852,0.00004380045,0.00015791474,0.006045048,0.000010179602,0.18643504,0.49645555,0.31063464],"study_design_scores_gemma":[0.0004929435,0.00014583481,0.0003404178,0.000008419484,0.000013057129,0.00002789473,0.00001237602,0.93839496,0.0000037229893,0.0105818,0.049677327,0.0003012395],"about_ca_topic_score_codex":0.0000033596498,"about_ca_topic_score_gemma":0.0000026021776,"teacher_disagreement_score":0.9323499,"about_ca_system_score_codex":0.000029709949,"about_ca_system_score_gemma":0.00006806048,"threshold_uncertainty_score":0.8329956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000968799,0.00006531673,0.97676843,0.00070825254,0.0002587655,0.0090661915,0.0000035955004,0.00037275712,0.012659805],"genre_scores_gemma":[0.80737144,0.00000108056,0.18583366,0.0042981934,0.00020736348,0.0019220458,0.000007076081,0.000017147162,0.00034200834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770725,0.0000642482,0.0004861925,0.00066652294,0.00031459023,0.00076117436],"domain_scores_gemma":[0.9983349,0.00026463318,0.00016722459,0.0007498945,0.00020391263,0.00027942448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047024759,0.00031726976,0.00038193807,0.00008229385,0.00027697554,0.0002763824,0.00085505156,0.0001909276,0.00008226009],"category_scores_gemma":[0.000007090845,0.00026736187,0.00019480813,0.00030499048,0.000043123902,0.00037103044,0.00008505259,0.00023092849,0.000019678559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042967757,0.00067013904,0.00016160953,0.000018574521,0.000060297247,0.00019844367,0.00029622915,0.053676765,0.00004085917,0.16882464,0.032160293,0.74346244],"study_design_scores_gemma":[0.001052001,0.0011436767,0.00022975756,0.00008195742,0.000009545268,0.000024011948,0.0000131514735,0.98786217,0.0000320479,0.0021898542,0.00695887,0.00040293552],"about_ca_topic_score_codex":0.000008022558,"about_ca_topic_score_gemma":0.0000059967756,"teacher_disagreement_score":0.93418545,"about_ca_system_score_codex":0.00007724403,"about_ca_system_score_gemma":0.0002473306,"threshold_uncertainty_score":0.9999779},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005664502,0.000026773036,0.9828836,0.00006224624,0.002066194,0.0085049225,0.00000959728,0.00051309535,0.00026909527],"genre_scores_gemma":[0.8013803,0.0000021508692,0.19445357,0.00023163995,0.00042694912,0.0034264985,0.0000023128443,0.00003859931,0.00003801323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974048,0.000076924145,0.00061525364,0.00081962114,0.00030759783,0.00077580655],"domain_scores_gemma":[0.9979321,0.00068100856,0.00023074806,0.0006762085,0.00019913865,0.00028080857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006342931,0.00038035456,0.00042145938,0.00015476334,0.0009002403,0.00029466543,0.0008636939,0.00027533885,0.00002886502],"category_scores_gemma":[0.00000229083,0.00037749176,0.00028166696,0.00041719948,0.00009981898,0.00032572803,0.0000130406,0.0010133139,0.000025300691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048412094,0.00018586499,0.0000036121198,0.000011918574,0.000033747416,0.000012691593,0.0001589992,0.5995022,0.00013657981,0.00075230293,0.000026465852,0.3991272],"study_design_scores_gemma":[0.0009479038,0.00051148294,0.0000075884586,0.00009746004,0.000027300837,0.00007467226,0.00003346308,0.9959016,0.00096030126,0.0002801931,0.00071912917,0.00043891277],"about_ca_topic_score_codex":0.000013921096,"about_ca_topic_score_gemma":0.000017122073,"teacher_disagreement_score":0.79571575,"about_ca_system_score_codex":0.00006453772,"about_ca_system_score_gemma":0.00015787497,"threshold_uncertainty_score":0.9998677},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013733663,0.000036806272,0.9836923,0.0016374645,0.00024379397,0.00032264195,0.0000050179915,0.00040589948,0.012282698],"genre_scores_gemma":[0.8275342,0.000011236097,0.16999337,0.0017349881,0.00033803913,0.000009589073,0.000032382395,0.000010823608,0.0003353823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884546,0.000014328501,0.00031111218,0.0001896787,0.00023476816,0.00040467258],"domain_scores_gemma":[0.99892485,0.00040074356,0.0001035504,0.00032752572,0.00008335675,0.0001599446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773245,0.00013782982,0.00014821679,0.00016297286,0.00023558839,0.00015863874,0.00045748128,0.000118186195,0.000016722652],"category_scores_gemma":[0.000013739886,0.000119746066,0.0000586225,0.0003942886,0.000018795366,0.00060610095,0.00010455954,0.00012665505,0.000036825957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054419863,0.000032117485,0.0015528206,0.000117919124,0.00005380793,0.000011643381,0.007948635,0.00003282146,0.000010258092,0.022137528,0.03173736,0.93631065],"study_design_scores_gemma":[0.0014060754,0.00029053408,0.003840394,0.000049995193,0.000034283094,0.00003887849,0.00027091012,0.1003374,0.00034154588,0.00547399,0.88728094,0.00063504546],"about_ca_topic_score_codex":0.000016379605,"about_ca_topic_score_gemma":0.000036539757,"teacher_disagreement_score":0.9356756,"about_ca_system_score_codex":0.000050336253,"about_ca_system_score_gemma":0.00006169894,"threshold_uncertainty_score":0.4883103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008364613,0.0031652434,0.98866826,0.00030407924,0.002950437,0.0007713538,0.0000054333627,0.00007765696,0.003973905],"genre_scores_gemma":[0.8709195,0.00034145787,0.12635624,0.00054653734,0.0008412696,0.000049150945,0.000003665981,0.000040664145,0.0009014675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622935,0.00011581156,0.0009842803,0.0009017177,0.0009872371,0.0007816289],"domain_scores_gemma":[0.99424124,0.0027828054,0.0006700498,0.0017481667,0.00030111862,0.00025662806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033689255,0.00050497975,0.0010533051,0.0003423669,0.0004993957,0.0004476338,0.0029439244,0.00033625637,0.000026174515],"category_scores_gemma":[0.000054387056,0.0003289426,0.00034546127,0.00042851307,0.002456446,0.00038160142,0.0012452416,0.00082034187,0.000021376323],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001509255,0.000029546509,0.000012259566,0.000013093277,0.000018385377,0.0007357598,0.00046742553,0.00040866403,0.000004912744,0.04163691,0.000026947459,0.95649517],"study_design_scores_gemma":[0.008148959,0.00010068299,0.000009660579,0.0003228165,0.000108061264,0.0028983955,5.142411e-7,0.9170974,0.0001403968,0.068645455,0.0016836378,0.00084400654],"about_ca_topic_score_codex":0.000040297877,"about_ca_topic_score_gemma":0.000053810036,"teacher_disagreement_score":0.95565116,"about_ca_system_score_codex":0.000110766094,"about_ca_system_score_gemma":0.0004895731,"threshold_uncertainty_score":0.99991626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069830516,0.0000038206767,0.9260029,0.00018235408,0.00020361293,0.07074533,0.000002443864,0.00044055688,0.0023491322],"genre_scores_gemma":[0.59982663,5.8823224e-7,0.27138585,0.0033765547,0.00037777756,0.12323844,0.000013456766,0.000024584884,0.0017561067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980965,0.000029283168,0.0004998412,0.0005775855,0.00018282494,0.000613946],"domain_scores_gemma":[0.99870396,0.00018787537,0.00018616994,0.00054742565,0.00017676005,0.00019780801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033982904,0.00025866687,0.0003036468,0.00006389797,0.0002084466,0.0002798949,0.0007922433,0.00015130738,0.000037488142],"category_scores_gemma":[0.000013050397,0.0002142916,0.00014263905,0.00029268337,0.000036523023,0.00034493604,0.00014751645,0.00019996394,0.000012421332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028199272,0.0017223165,0.00045949197,0.000045781395,0.00007406473,0.00005340335,0.00064854964,0.007131194,0.00057636603,0.061276272,0.023815086,0.90391546],"study_design_scores_gemma":[0.0028381292,0.00046569426,0.00014446508,0.000069038564,0.0000060488437,0.000026750817,0.000027145581,0.9892529,0.00009542748,0.00029201058,0.0064735916,0.00030877307],"about_ca_topic_score_codex":0.0000119665865,"about_ca_topic_score_gemma":0.000005339687,"teacher_disagreement_score":0.9821217,"about_ca_system_score_codex":0.000038686303,"about_ca_system_score_gemma":0.000085465945,"threshold_uncertainty_score":0.87385577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063027455,0.000037822894,0.9869361,0.000436084,0.00026414343,0.00025977887,0.0000030117362,0.00013644478,0.0056238947],"genre_scores_gemma":[0.85345685,0.000004514625,0.1448579,0.00046744983,0.00007829729,0.000013732306,0.00003368756,0.000008768818,0.0010787797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990414,0.00004340664,0.0002936071,0.00020725033,0.00014359348,0.00027075244],"domain_scores_gemma":[0.99902195,0.00014977073,0.000086470754,0.00058038544,0.000087450586,0.00007400429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026850143,0.00012034038,0.00015297526,0.000040013147,0.00010441294,0.00017517265,0.0007615397,0.00009156808,0.000043111922],"category_scores_gemma":[0.0000031975296,0.00010679528,0.00007990922,0.00012317376,0.000036067897,0.0002286232,0.0002771511,0.00010808208,0.000024893321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033585202,0.00020602722,0.00016833407,0.000017687982,0.00001941781,0.000007358136,0.00008595582,0.00041041494,0.00062828715,0.80354553,0.022209292,0.17266813],"study_design_scores_gemma":[0.0003551964,0.00002623411,0.00005198323,0.000029988358,0.0000072763705,0.000018940682,0.00001813535,0.9814381,0.00046189994,0.014061719,0.0033784714,0.00015202673],"about_ca_topic_score_codex":0.00023619793,"about_ca_topic_score_gemma":0.0000915871,"teacher_disagreement_score":0.9810277,"about_ca_system_score_codex":0.00004314556,"about_ca_system_score_gemma":0.000044007127,"threshold_uncertainty_score":0.43549854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013517995,0.00018997886,0.98360455,0.0007451905,0.0007291171,0.0004702593,0.0000010949964,0.0003995243,0.012508506],"genre_scores_gemma":[0.5383156,0.000037313046,0.45912397,0.0010313329,0.0001059508,0.00008406759,0.000003784518,0.000007264181,0.0012907488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877775,0.000070029855,0.00023322148,0.00037000587,0.000119051656,0.00042996707],"domain_scores_gemma":[0.9982122,0.0009642083,0.00007246323,0.0004930638,0.00012609808,0.00013195386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003573492,0.0001522954,0.00023014432,0.000033205706,0.00012125172,0.00016018433,0.0006518712,0.00010874452,0.0001196853],"category_scores_gemma":[0.000024752308,0.00011965109,0.00009096532,0.00013801335,0.000044420638,0.00037897044,0.00019653428,0.000119086726,0.00004390129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018870885,0.000026692765,0.000021745844,0.000009124445,0.000019065596,0.000062482446,0.00012479041,0.0013894633,0.000024370016,0.087407745,0.02559792,0.8852977],"study_design_scores_gemma":[0.00022182797,0.00010174801,0.00003883284,0.0000054409334,0.0000044614253,0.00012836076,0.000044593085,0.9136837,0.00002982704,0.07940478,0.00615287,0.00018351662],"about_ca_topic_score_codex":0.000027010841,"about_ca_topic_score_gemma":0.0000087486915,"teacher_disagreement_score":0.91229427,"about_ca_system_score_codex":0.000017919794,"about_ca_system_score_gemma":0.00003303039,"threshold_uncertainty_score":0.487923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010815288,0.0002728939,0.98156625,0.00017454065,0.0011612528,0.0004300896,0.000023928342,0.00041599816,0.014873535],"genre_scores_gemma":[0.7519235,0.000058357582,0.24562119,0.0011947735,0.000431047,0.000038932085,0.000094521085,0.000032708787,0.00060496054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973405,0.000048207177,0.00052945217,0.00096449105,0.0003062653,0.0008111064],"domain_scores_gemma":[0.9971447,0.00018271207,0.00017608823,0.0020126507,0.00016329763,0.00032052433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080363266,0.00032487544,0.00041846628,0.00008487502,0.00030293438,0.00020658734,0.002640978,0.0002277452,0.00010946064],"category_scores_gemma":[0.0000063503135,0.00027554802,0.00013078487,0.00034262685,0.00007855188,0.0010301659,0.0010137244,0.0002782287,0.00003863391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014348859,0.0003052337,0.0012703997,0.00007481196,0.00029930728,0.00021289154,0.0014221572,0.00027563362,0.000027670034,0.35238454,0.11022503,0.5333589],"study_design_scores_gemma":[0.000555735,0.00008589134,0.000033799584,0.00004212828,0.000028562607,0.00005775575,0.00006923684,0.9826672,0.000025798065,0.00239965,0.013616685,0.00041755688],"about_ca_topic_score_codex":0.000061458275,"about_ca_topic_score_gemma":0.000026978505,"teacher_disagreement_score":0.9823916,"about_ca_system_score_codex":0.000029795845,"about_ca_system_score_gemma":0.00013227068,"threshold_uncertainty_score":0.99996966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015079028,0.0001685446,0.99135333,0.002627865,0.00046142068,0.000517647,0.0000067711176,0.0004140718,0.0029424368],"genre_scores_gemma":[0.8523216,0.000008757563,0.14305116,0.0037609343,0.00018899866,0.000037526817,0.000086720975,0.000013619249,0.0005306409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981023,0.000040224902,0.00043608632,0.00060114067,0.0002928711,0.0005273827],"domain_scores_gemma":[0.99857795,0.00023338162,0.00015731998,0.00063552114,0.00017915494,0.00021669008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225741,0.00025555043,0.00028299328,0.00009746733,0.00026905737,0.0002714416,0.00057260256,0.00017231565,0.00003348271],"category_scores_gemma":[0.000009288134,0.00022592164,0.00017962648,0.0003986081,0.000041347666,0.00037331064,0.000039188515,0.0001899875,0.000015687083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016641518,0.0004657721,0.00037798105,0.00003690952,0.00006296527,0.00010178759,0.00044188756,0.07163924,0.00010074449,0.109512545,0.00843849,0.80865526],"study_design_scores_gemma":[0.0009122782,0.00021139564,0.00045277821,0.0000381408,0.00001342776,0.000015919166,0.00002223134,0.98954284,0.0000077263585,0.0068632,0.0016047787,0.00031529617],"about_ca_topic_score_codex":0.0000048365882,"about_ca_topic_score_gemma":0.000008709098,"teacher_disagreement_score":0.9179036,"about_ca_system_score_codex":0.000056690125,"about_ca_system_score_gemma":0.00016642972,"threshold_uncertainty_score":0.9212817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026379988,0.00060690905,0.96705884,0.0027364823,0.002753713,0.00012939746,0.00010174339,0.00007416716,0.00015878014],"genre_scores_gemma":[0.99355066,0.000513998,0.0037832619,0.0005118635,0.0012570731,0.0000038317226,0.00030510014,0.000025115636,0.00004912003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964672,0.00019425096,0.001392593,0.00040164965,0.0008921064,0.0006522471],"domain_scores_gemma":[0.9971484,0.00036891623,0.00092280854,0.00042056883,0.0007966702,0.00034266734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007516287,0.000355128,0.0005572661,0.0002945121,0.00009083571,0.00036186597,0.0021056714,0.0002931905,0.00005398283],"category_scores_gemma":[0.000032023843,0.00033592078,0.0002897183,0.00065868784,0.00010305226,0.0008466157,0.00029179547,0.0010769733,0.000011816963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002051223,0.00035467654,0.0020721303,0.000002882141,0.00021055873,0.0015570066,0.00006927589,0.8874279,0.000020979265,0.001669918,0.006585954,0.099823564],"study_design_scores_gemma":[0.0015698692,0.000082197264,0.0041306643,0.00015643236,0.000022446045,0.00068528706,0.000040620707,0.98768413,0.000007643532,0.00022957112,0.005059093,0.00033204036],"about_ca_topic_score_codex":0.000011321942,"about_ca_topic_score_gemma":0.00003463807,"teacher_disagreement_score":0.96717066,"about_ca_system_score_codex":0.0005663393,"about_ca_system_score_gemma":0.00015499268,"threshold_uncertainty_score":0.9999093},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003963718,0.000017722237,0.97090906,0.0020958167,0.0004539747,0.00013853496,0.0000014780578,0.00016707103,0.022252606],"genre_scores_gemma":[0.9029603,0.000011036433,0.09258828,0.0012334826,0.00011272647,0.000012548287,0.000004479812,0.000004969535,0.003072202],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999173,0.000023258173,0.00017483912,0.00021011382,0.00015658265,0.00026222575],"domain_scores_gemma":[0.9992556,0.00020132134,0.000044613138,0.0002885596,0.000067774155,0.00014212118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015137083,0.00009670204,0.00013003165,0.00002575741,0.00008035341,0.00005612991,0.00032061472,0.00006957374,0.00009144074],"category_scores_gemma":[0.000012270176,0.000078559264,0.00007088826,0.00008341848,0.000057700447,0.0003353861,0.00015379048,0.00011799303,0.00007796056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023862693,0.00010689718,0.00032077762,0.0000058871374,0.000016113376,0.00009556633,0.0004675059,0.0000013987157,0.000004643788,0.3692031,0.61943126,0.010322981],"study_design_scores_gemma":[0.00036102088,0.00012863064,0.00012442931,0.0000056135304,0.000004489171,0.00039390905,0.000027417,0.9503476,0.00006086063,0.008999441,0.039383493,0.00016306696],"about_ca_topic_score_codex":0.000024750016,"about_ca_topic_score_gemma":0.0000035094247,"teacher_disagreement_score":0.95034623,"about_ca_system_score_codex":0.000014478436,"about_ca_system_score_gemma":0.00009194416,"threshold_uncertainty_score":0.3203554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26297498,0.00005692867,0.70147634,0.000374385,0.00031019107,0.0000993765,0.0000016398757,0.00007947379,0.034626707],"genre_scores_gemma":[0.96622,0.00045002875,0.03270484,0.00018219865,0.000065588705,0.000004442638,0.000015676016,0.0000059085214,0.00035128035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887866,0.00003507594,0.00038954636,0.00023439132,0.00027577174,0.00018654992],"domain_scores_gemma":[0.99809724,0.00018139799,0.00028175223,0.00080651895,0.0005455582,0.00008750971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049600354,0.00013769674,0.00015810189,0.00018633231,0.00024452276,0.00009278157,0.0009433012,0.0000608835,0.000010331414],"category_scores_gemma":[0.0000050327003,0.00012176595,0.000029466024,0.00031433805,0.00029353367,0.0004149561,0.00030236272,0.00021741695,0.000008856643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013291773,0.0003801785,0.04086484,0.00004955327,0.00015630595,0.000011173105,0.003133536,0.00070653186,0.00029314257,0.15979433,0.00075811916,0.79371935],"study_design_scores_gemma":[0.00039945822,0.00010818531,0.013866594,0.00013003509,0.000009944145,0.000118509706,0.00015970114,0.9799047,0.00026731,0.0003931018,0.004465391,0.00017703744],"about_ca_topic_score_codex":0.00007964814,"about_ca_topic_score_gemma":0.00011001046,"teacher_disagreement_score":0.9791982,"about_ca_system_score_codex":0.000044015695,"about_ca_system_score_gemma":0.00011482708,"threshold_uncertainty_score":0.49654713},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076606916,0.00019709177,0.9829412,0.00034609,0.00018346982,0.00018737528,0.000010657443,0.00014536502,0.008328065],"genre_scores_gemma":[0.79304576,0.000080284015,0.20504132,0.0011070673,0.000074521326,0.0000023297305,0.000051958355,0.000011599333,0.00058519567],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978351,0.000059102607,0.00033516847,0.00064693275,0.00032259934,0.00080107513],"domain_scores_gemma":[0.9981453,0.00022979698,0.00008250531,0.0012514248,0.000061962564,0.00022900579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290066,0.00018849467,0.00025711016,0.00007755165,0.00011686796,0.00014851862,0.0013653309,0.000103568374,0.00006302584],"category_scores_gemma":[0.0000053550557,0.00014588243,0.000031193616,0.00055618695,0.00007971607,0.0004940372,0.00045883295,0.00022594995,0.000016181852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015918069,0.0022381255,0.48930484,0.00010535033,0.00028658778,0.0066627795,0.0050474685,0.019755224,0.00009344379,0.073773965,0.040682107,0.3604583],"study_design_scores_gemma":[0.00086159585,0.00005551161,0.0037129375,0.00003707378,0.00000902631,0.00007546917,0.00049037783,0.98785806,0.000007629062,0.00007524829,0.0065647606,0.0002523161],"about_ca_topic_score_codex":0.00006364842,"about_ca_topic_score_gemma":0.0021499186,"teacher_disagreement_score":0.9681028,"about_ca_system_score_codex":0.000042253312,"about_ca_system_score_gemma":0.000084386236,"threshold_uncertainty_score":0.59489125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044637203,0.000029900302,0.9445357,0.00026561253,0.00025543958,0.0003119741,0.0000027533872,0.00024259323,0.009718866],"genre_scores_gemma":[0.9574017,0.0000072600374,0.040453892,0.0005099949,0.00028411322,0.000010432854,0.0000229328,0.000017106604,0.0012925992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997901,0.000031531737,0.0005031227,0.00044767704,0.00016504583,0.0009515824],"domain_scores_gemma":[0.99888074,0.00039422695,0.000117286785,0.00036316653,0.000047069043,0.00019749672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016383422,0.00018153904,0.00027243307,0.00012536123,0.00011930971,0.00008919429,0.00055155123,0.00017325974,0.00004224179],"category_scores_gemma":[0.000006412482,0.00015863251,0.0001015758,0.00039114352,0.000031053976,0.00014274652,0.00013030996,0.00024029735,0.00001438293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000626315,0.0001557889,0.00076141086,0.000017036087,0.000013090896,0.00015596446,0.00051005726,0.010764621,0.000034944736,0.019350462,0.0043923594,0.96378165],"study_design_scores_gemma":[0.00061529456,0.00006582908,0.0005577067,0.000021813903,0.0000039095294,0.000025004292,0.00002878311,0.99628884,0.000013327349,0.0007120532,0.0014451398,0.0002223123],"about_ca_topic_score_codex":0.00001267442,"about_ca_topic_score_gemma":0.00020955317,"teacher_disagreement_score":0.9855242,"about_ca_system_score_codex":0.00003267263,"about_ca_system_score_gemma":0.00006254803,"threshold_uncertainty_score":0.6468846},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006497205,0.00001237871,0.9824491,0.00005998411,0.000312838,0.00018432751,0.0000017783458,0.0000815941,0.0104007935],"genre_scores_gemma":[0.8161329,0.000003834675,0.1833626,0.00026013787,0.000052104213,0.0000057295592,0.00001798418,0.0000030454778,0.00016164524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993352,0.000006233711,0.00020709832,0.00019495309,0.00009626802,0.00016021494],"domain_scores_gemma":[0.99909014,0.00007946681,0.00006743185,0.0006657897,0.000057401576,0.000039761355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019836401,0.00007439798,0.00009726386,0.000048445505,0.00007016407,0.0001345372,0.00043646735,0.00004338136,0.0000059184435],"category_scores_gemma":[0.000006755611,0.00005786066,0.000010225711,0.000130379,0.0000134505835,0.0015908956,0.00028636554,0.000059239956,0.0000034934262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029160714,0.00009593615,0.009445425,0.00012784605,0.000049672624,0.00012832467,0.019853247,0.00016998083,0.000058239708,0.035685882,0.01422218,0.9198717],"study_design_scores_gemma":[0.00024286339,0.00011557995,0.00012041042,0.000038286023,0.0000041576745,0.000050378287,0.00037709606,0.9956591,0.0005194504,0.0008334047,0.001908832,0.00013040174],"about_ca_topic_score_codex":0.00028352646,"about_ca_topic_score_gemma":0.00007980246,"teacher_disagreement_score":0.9954892,"about_ca_system_score_codex":0.000008051018,"about_ca_system_score_gemma":0.00003986608,"threshold_uncertainty_score":0.23594892},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003340778,0.000011883114,0.9465961,0.00044755844,0.00023040327,0.044700265,0.0000011326664,0.00015116758,0.007527417],"genre_scores_gemma":[0.9021253,5.1506726e-7,0.05789391,0.0011996364,0.0002134118,0.03810535,0.0000037852042,0.000014385091,0.00044369572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800086,0.000058415208,0.00049266673,0.00056907005,0.00024644865,0.0006325106],"domain_scores_gemma":[0.9990914,0.000088383196,0.00012134047,0.0004361648,0.00009413353,0.00016857167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040653095,0.0002514695,0.00031512228,0.00010518357,0.00015127254,0.00021234794,0.0005894622,0.00016414483,0.000084560736],"category_scores_gemma":[0.0000041498256,0.00021592967,0.0001289216,0.0002703945,0.000035193047,0.00046998635,0.000109367815,0.00023208596,0.000008164191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012515868,0.0010516949,0.00034843263,0.000022581457,0.0000483909,0.00050263933,0.0026102427,0.015428383,0.00015567506,0.11783234,0.018602667,0.8421454],"study_design_scores_gemma":[0.0017820579,0.00062614563,0.00054291106,0.00007209489,0.0000037725924,0.000036316582,0.00005884627,0.99102396,0.000019769166,0.0017688337,0.003737049,0.00032823594],"about_ca_topic_score_codex":0.000014928055,"about_ca_topic_score_gemma":0.000020327298,"teacher_disagreement_score":0.9755956,"about_ca_system_score_codex":0.000058305213,"about_ca_system_score_gemma":0.000114496856,"threshold_uncertainty_score":0.88053566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021726819,0.00021629166,0.9909444,0.002628799,0.000710349,0.0006433826,0.00025283278,0.00026210592,0.0041245995],"genre_scores_gemma":[0.9588054,0.00041711188,0.038330957,0.00027125794,0.00006193837,0.00027648138,0.00050720625,0.000024226452,0.0013054509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984376,0.000184737,0.00040881784,0.0003617103,0.00021736517,0.00038978967],"domain_scores_gemma":[0.99443483,0.0010054316,0.0001408819,0.0039420403,0.00026926084,0.00020753728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005433272,0.00021284139,0.00021695398,0.00015075735,0.0009986754,0.00014241361,0.002728499,0.00013103582,0.000058971254],"category_scores_gemma":[0.0000037673215,0.0002148419,0.00008201751,0.00055023143,0.00013973535,0.0014030966,0.00004170949,0.0003690415,0.00009615361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025505785,0.0039103767,0.00008945524,0.00003567323,0.00048664818,0.0000031167651,0.0053786323,0.0021608858,0.0018066599,0.023228165,0.021339921,0.9413054],"study_design_scores_gemma":[0.000738057,0.000085831314,0.000039182116,0.000052445408,0.00009335728,0.000021896803,0.00013004382,0.9854217,0.0013639233,0.00028449236,0.011451747,0.00031733015],"about_ca_topic_score_codex":0.000059976104,"about_ca_topic_score_gemma":0.00017043474,"teacher_disagreement_score":0.9832608,"about_ca_system_score_codex":0.00007879118,"about_ca_system_score_gemma":0.000108947876,"threshold_uncertainty_score":0.8760998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063717603,0.00002361784,0.9898023,0.00009467683,0.00014295237,0.00012183394,2.0664886e-7,0.000028182349,0.0034144719],"genre_scores_gemma":[0.9628597,0.0000017052166,0.03692174,0.000106302934,0.00001487872,9.3479446e-7,1.6544647e-7,0.0000013806597,0.000093174625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955493,0.000025558655,0.00013515339,0.00008477295,0.000105565334,0.000094028976],"domain_scores_gemma":[0.9996564,0.00007394892,0.000053070184,0.00016264094,0.000023998253,0.00002998401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048266712,0.00003622936,0.000050580933,0.000015532269,0.000044636985,0.000020145177,0.00016735567,0.000017331267,0.000006445161],"category_scores_gemma":[3.2088778e-7,0.000022103086,0.000011821196,0.00009626864,0.000017314396,0.00006807187,0.00007110888,0.000022866972,0.0000014200784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079346755,0.000015037737,0.0044484604,0.00003580271,0.000017745346,0.000009685917,0.00094699394,0.000056865803,0.00045434613,0.49780875,0.004027122,0.49217126],"study_design_scores_gemma":[0.0006107275,0.00011726972,0.016003886,0.000035798785,0.00001629406,0.00007939496,0.0013273312,0.972368,0.0069313785,0.0015648598,0.00077625475,0.00016878187],"about_ca_topic_score_codex":0.000034936693,"about_ca_topic_score_gemma":0.0000071680274,"teacher_disagreement_score":0.97231114,"about_ca_system_score_codex":0.000008238393,"about_ca_system_score_gemma":0.000024346144,"threshold_uncertainty_score":0.090133764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005114415,0.000025497337,0.7852603,0.0018694835,0.0001014505,0.000027501424,6.592099e-8,0.00016987688,0.21203436],"genre_scores_gemma":[0.9491211,0.0000083605255,0.042039298,0.0052932017,0.000057535402,7.672452e-7,4.5482386e-7,0.0000012094189,0.0034780623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995297,0.000009971157,0.00008682442,0.00014250782,0.000087784974,0.00014316378],"domain_scores_gemma":[0.99959403,0.000018783572,0.000015948954,0.0002745604,0.000020205624,0.00007647337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008218889,0.000051327857,0.000060441125,0.000020637111,0.000037195932,0.00006011597,0.0003231813,0.00003113521,0.000055747645],"category_scores_gemma":[7.0171484e-7,0.00004073121,0.000025480573,0.00011064428,0.000007801654,0.00015941866,0.00003130029,0.00005213507,0.00012035367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.949281e-7,0.000023364964,0.000027698967,2.849497e-7,0.0000011877123,0.00002671617,0.00003596606,0.000008075941,0.000035547855,0.4898563,0.017561102,0.49242285],"study_design_scores_gemma":[0.00017127425,0.00012979779,0.0007721632,0.000004931844,0.0000015032011,0.000040830855,0.0000052769087,0.8963993,0.00019591488,0.07641645,0.025691854,0.00017070209],"about_ca_topic_score_codex":0.0000026991836,"about_ca_topic_score_gemma":4.596855e-7,"teacher_disagreement_score":0.94860965,"about_ca_system_score_codex":0.0000053353842,"about_ca_system_score_gemma":0.000025232222,"threshold_uncertainty_score":0.16609706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006659741,0.00046335076,0.98457605,0.00068870676,0.0006978939,0.00026368536,0.0000047999265,0.00023316056,0.0064126146],"genre_scores_gemma":[0.9665858,0.00017662146,0.0316649,0.00068966794,0.00027697015,0.00001088003,0.00006948381,0.0000140596985,0.0005116152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975783,0.000118220756,0.0005251718,0.00074202253,0.0003604273,0.00067584286],"domain_scores_gemma":[0.9978921,0.00018649972,0.00008350366,0.0015231812,0.000041686595,0.00027302696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057618186,0.00022527648,0.00031434186,0.000075638265,0.0003081314,0.000071713526,0.0015251812,0.00014346643,0.00008643227],"category_scores_gemma":[0.0000042016763,0.00018610641,0.00006257613,0.0007842812,0.00008728444,0.00021701935,0.00045666614,0.0003231708,0.000033938206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004553473,0.0003549702,0.0020081236,0.000007043211,0.00001783085,0.0005160177,0.0004838773,0.85862964,0.00000611139,0.01356278,0.02733481,0.09703328],"study_design_scores_gemma":[0.0005408002,0.000035193112,0.0020669433,0.000048963007,0.000006146795,0.000109444576,0.000012059075,0.9930091,8.0494124e-7,0.00024284744,0.003668173,0.00025951338],"about_ca_topic_score_codex":0.000065872846,"about_ca_topic_score_gemma":0.000050883693,"teacher_disagreement_score":0.95992607,"about_ca_system_score_codex":0.00003377529,"about_ca_system_score_gemma":0.00013034126,"threshold_uncertainty_score":0.7589199},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005221547,0.0006228962,0.9923157,0.00016398639,0.000099428216,0.0010148782,0.0000049982555,0.000120685276,0.00043588254],"genre_scores_gemma":[0.99205726,0.00007753144,0.0055694766,0.0008275738,0.00055613124,0.0008111643,0.00005308719,0.000013870519,0.000033891534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846387,0.000037364764,0.0003894825,0.0005107571,0.00011257403,0.00048594817],"domain_scores_gemma":[0.9989509,0.00032236226,0.00015231335,0.00040120038,0.000045820027,0.00012740318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964196,0.00018983404,0.00024900798,0.00006229023,0.0003374839,0.00019723001,0.0003743151,0.00012337958,0.0000026132668],"category_scores_gemma":[0.0000010281224,0.00019414845,0.000062517945,0.00038647038,0.000036907357,0.000110704255,0.00007081225,0.00017857722,0.0000011653806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007753384,0.000057426867,0.00041499274,0.000007858429,0.0000043153955,0.0000055483515,0.000037549005,0.24178955,0.000009370447,0.00611642,0.00023993933,0.7513093],"study_design_scores_gemma":[0.0004455483,0.00007530793,0.00014321449,0.000051586285,0.000008549524,0.000013142879,0.000018255469,0.98972905,0.000008416723,0.0015055527,0.0077811265,0.00022026326],"about_ca_topic_score_codex":0.0000084661215,"about_ca_topic_score_gemma":0.000013050487,"teacher_disagreement_score":0.9868357,"about_ca_system_score_codex":0.000031066327,"about_ca_system_score_gemma":0.000031237243,"threshold_uncertainty_score":0.7917144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004524449,0.0016319527,0.97912633,0.0005815781,0.0003106898,0.00028889376,4.4767745e-7,0.00027931883,0.013256337],"genre_scores_gemma":[0.94710195,0.00013098234,0.04951666,0.0011313969,0.000079232675,0.000023613507,0.000006268381,0.000008300063,0.0020016243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982722,0.00011368667,0.00039492588,0.00046383552,0.0002463897,0.0005089538],"domain_scores_gemma":[0.999031,0.00014374236,0.00010382807,0.0005303833,0.00004214575,0.00014889591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524184,0.0001910157,0.00027657073,0.00010801021,0.000097739125,0.00016774725,0.0006487227,0.0001320615,0.00010579023],"category_scores_gemma":[0.0000055593064,0.00016896384,0.000090557776,0.0005611727,0.000024874698,0.00031349916,0.00009659019,0.00025048992,0.000016673035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020891393,0.00015767133,0.00034769945,0.0000050611934,0.000005621529,0.00010348694,0.00010287299,0.0065669226,0.000027252805,0.0044213333,0.0033526393,0.98488855],"study_design_scores_gemma":[0.00070724206,0.0001447053,0.0010566749,0.000053758795,0.0000050813837,0.000005205494,0.000020071111,0.9906894,0.00002876275,0.0019081422,0.0051454487,0.00023553926],"about_ca_topic_score_codex":0.0000033129213,"about_ca_topic_score_gemma":0.00000871516,"teacher_disagreement_score":0.984653,"about_ca_system_score_codex":0.000030657873,"about_ca_system_score_gemma":0.00008191083,"threshold_uncertainty_score":0.68901455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004206877,0.0016484192,0.99167657,0.00071918766,0.0034599176,0.00010012576,0.0000046386394,0.000046634843,0.0019238045],"genre_scores_gemma":[0.9744884,0.000043934964,0.02431234,0.00043280906,0.00050413515,0.00001497514,0.000041876287,0.00001471747,0.00014683444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771863,0.00028296036,0.0009127078,0.00016214502,0.0007403413,0.00018321174],"domain_scores_gemma":[0.99496377,0.00035079053,0.0012334068,0.00073414005,0.00241118,0.000306703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133254,0.00013989424,0.00026303157,0.00020905727,0.00007750124,0.00025712364,0.002764777,0.00009020908,0.000004683117],"category_scores_gemma":[0.00005302326,0.00013057067,0.00012226346,0.000099583944,0.00005988102,0.0004150025,0.00013027315,0.00018520672,0.0000020936234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020262551,0.00049992214,0.00041145209,0.0000043132795,0.00018193678,0.00005349387,0.0007313369,0.45066994,0.00005830611,0.49152032,0.024365429,0.03130091],"study_design_scores_gemma":[0.0008226033,0.00012056714,0.000012600075,0.00011977858,0.000011266989,0.00009338752,0.00011878086,0.9261401,0.000003358593,0.00028995323,0.07214034,0.00012722709],"about_ca_topic_score_codex":0.00004864121,"about_ca_topic_score_gemma":0.0000023727155,"teacher_disagreement_score":0.9740677,"about_ca_system_score_codex":0.0005235172,"about_ca_system_score_gemma":0.0007025266,"threshold_uncertainty_score":0.53245175},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006076555,0.0011301691,0.9726063,0.00035334865,0.011424803,0.00029313067,0.000001084287,0.00044040504,0.0076741865],"genre_scores_gemma":[0.96838456,0.000016309363,0.016314922,0.003646653,0.010607394,0.000031182957,0.000006926327,0.000048881844,0.0009431925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970386,0.00013807847,0.00047495132,0.0007305158,0.0005006603,0.0011171644],"domain_scores_gemma":[0.99745035,0.00012285073,0.00013990857,0.0011050459,0.00015128954,0.0010305451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008042293,0.00035116734,0.0004111836,0.0000740821,0.00022901861,0.00032969,0.0012490923,0.0002164022,0.000011912697],"category_scores_gemma":[0.0000066670286,0.00034638375,0.0001385101,0.0008158586,0.00004998003,0.00022139067,0.00034244164,0.00033479006,0.00032003186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037347538,0.000035843346,0.00031169257,0.0000033839667,0.000030707186,0.00031269982,0.000294047,0.7839384,0.000020381462,0.00043018966,0.19131221,0.023273086],"study_design_scores_gemma":[0.00040262137,0.00019456739,0.000027024864,0.000056838016,0.000017491066,0.00009183507,0.000009644734,0.91458154,0.00012227686,0.0024610932,0.081497885,0.0005372074],"about_ca_topic_score_codex":0.000027370304,"about_ca_topic_score_gemma":0.000013818912,"teacher_disagreement_score":0.962308,"about_ca_system_score_codex":0.000090340705,"about_ca_system_score_gemma":0.00012396261,"threshold_uncertainty_score":0.9998988},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002769872,0.000116956995,0.9935705,0.0005463185,0.0009082816,0.00028123977,0.000023132738,0.00039913107,0.0038774179],"genre_scores_gemma":[0.7533534,0.0000024090898,0.23936161,0.0063998722,0.00024103496,0.00007389029,0.0001663642,0.000029151948,0.0003722698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775743,0.00025248408,0.00045382645,0.00041609528,0.0004099725,0.00071020133],"domain_scores_gemma":[0.9972086,0.00064436276,0.00016550027,0.0010910424,0.00034871828,0.0005417787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013322908,0.00030696427,0.0004378093,0.000122716,0.00044160898,0.00025886708,0.001314597,0.00010455835,0.000012262915],"category_scores_gemma":[0.000011055125,0.00027133527,0.00020145775,0.0002985358,0.00008909359,0.0001295338,0.00039562088,0.0003021627,0.000012030522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008236788,0.0006320111,0.000028783892,0.000018704039,0.00010609485,0.0000664971,0.00029899535,0.12720074,0.000012508098,0.04154719,0.10940879,0.7205973],"study_design_scores_gemma":[0.0016703971,0.00029648314,0.00000359928,0.000020200021,0.000019897943,0.000029330722,0.000052809755,0.9537058,0.00006117538,0.003477703,0.040304895,0.000357716],"about_ca_topic_score_codex":0.00018859493,"about_ca_topic_score_gemma":0.000011712852,"teacher_disagreement_score":0.82650506,"about_ca_system_score_codex":0.00008896583,"about_ca_system_score_gemma":0.00024711626,"threshold_uncertainty_score":0.9999739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028025363,0.00047045152,0.964691,0.001023768,0.0051185996,0.00013658496,0.000008164252,0.000016970205,0.00050911464],"genre_scores_gemma":[0.8688583,0.00020051905,0.13045645,0.00013170668,0.00031652383,0.000002108769,0.000008066044,0.000007923028,0.000018399798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966613,0.00006890674,0.0011646674,0.0004689773,0.0013450471,0.00029108993],"domain_scores_gemma":[0.99517167,0.00023107501,0.0011887209,0.000511892,0.0026498556,0.00024680825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019412969,0.00024067484,0.00045426682,0.0010918687,0.000078280435,0.0008018622,0.004139568,0.00012709168,0.0000048556767],"category_scores_gemma":[0.000048733462,0.00022789779,0.00011820739,0.00059142546,0.00059040816,0.0013308966,0.0024919396,0.00064368924,0.0000015260075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031256557,0.00023339539,0.0026694871,0.000014750247,0.00008712364,0.00018735554,0.00079406076,0.17306566,0.000023041523,0.010248033,0.0005425984,0.8121032],"study_design_scores_gemma":[0.00042772596,0.00012231,0.003828831,0.0004120726,0.0000116765295,0.00050873717,0.000014400087,0.9797185,0.0000045545407,0.014502801,0.00025524048,0.0001931565],"about_ca_topic_score_codex":0.000029726618,"about_ca_topic_score_gemma":0.000018817738,"teacher_disagreement_score":0.84083295,"about_ca_system_score_codex":0.00028010563,"about_ca_system_score_gemma":0.0018106793,"threshold_uncertainty_score":0.9293402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053882576,0.0002991252,0.96457493,0.00037552716,0.00047761184,0.032399803,0.0000065707914,0.00018872526,0.0011388627],"genre_scores_gemma":[0.43188694,0.00007227368,0.46101245,0.0013920944,0.00185788,0.10335776,0.00002113765,0.00007439831,0.00032508126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996459,0.00024250259,0.00080439536,0.0010168068,0.00040600027,0.0010712959],"domain_scores_gemma":[0.99780697,0.00053593784,0.000121372075,0.0008032911,0.00020610985,0.0005263321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023684108,0.0004267166,0.0007243284,0.00007961874,0.00021359565,0.0003105268,0.00073578494,0.00043828835,0.000012533892],"category_scores_gemma":[0.000028697996,0.00037307487,0.00014832341,0.0007676491,0.0001367522,0.00035904854,0.0001976923,0.0006073001,0.000004289248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000616665,0.00043828055,0.0009835981,0.00013542204,0.00004266444,0.000101796846,0.0010938232,0.036107067,0.0000033498252,0.07932006,0.0040039304,0.87715334],"study_design_scores_gemma":[0.0022104902,0.00051890616,0.00013602353,0.00038728875,0.000011058948,0.000017720062,0.000026485905,0.88760436,0.000015329724,0.09118177,0.017398996,0.00049158774],"about_ca_topic_score_codex":0.000021499109,"about_ca_topic_score_gemma":0.000016234202,"teacher_disagreement_score":0.8766618,"about_ca_system_score_codex":0.000071627466,"about_ca_system_score_gemma":0.00020330018,"threshold_uncertainty_score":0.99987215},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01477896,0.0019004509,0.9673634,0.0018545125,0.00071198976,0.0005656036,0.000037971735,0.00036358554,0.012423531],"genre_scores_gemma":[0.92425704,0.00042777878,0.07425613,0.0006678493,0.00010624512,0.00008951971,0.00013216806,0.00001911556,0.00004414289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610895,0.0008090723,0.0008698439,0.00077634654,0.0006444729,0.0007912856],"domain_scores_gemma":[0.99337506,0.0001707221,0.0003975202,0.00440651,0.00095258025,0.00069762353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001260563,0.00046172153,0.0005606908,0.00014569037,0.00033693097,0.0005125471,0.005042687,0.00041276927,0.000021589338],"category_scores_gemma":[0.000033523287,0.0004821906,0.0001174999,0.0011898271,0.00037479048,0.0015982937,0.00080079417,0.0008271867,0.00016302771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023101903,0.0019684613,0.014286005,0.000016635915,0.00017354512,0.00014785922,0.0019699754,0.032578647,0.000027529188,0.57871574,0.016362168,0.3535224],"study_design_scores_gemma":[0.0009432257,0.0002279939,0.00077273673,0.00011583176,0.000020674082,0.00005799004,0.0003399822,0.9802313,0.00000438062,0.012650798,0.004082962,0.00055215904],"about_ca_topic_score_codex":0.001175921,"about_ca_topic_score_gemma":0.0014976197,"teacher_disagreement_score":0.94765264,"about_ca_system_score_codex":0.00047901095,"about_ca_system_score_gemma":0.0009982901,"threshold_uncertainty_score":0.99976295},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003209066,0.0011076082,0.970627,0.0008018824,0.004648643,0.0004977408,0.0000053126873,0.00018893434,0.022090752],"genre_scores_gemma":[0.38281158,0.00008932188,0.60316396,0.004745447,0.004668318,0.000029481695,0.000030249359,0.00012308882,0.004338558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944941,0.000082114144,0.00089731463,0.002027173,0.0010827751,0.0014165135],"domain_scores_gemma":[0.9964402,0.0006270194,0.0004165125,0.0017562177,0.00027745412,0.00048262472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019631046,0.0007968066,0.000954698,0.0010564175,0.00019604739,0.00064336724,0.004335947,0.00047006836,0.000040676103],"category_scores_gemma":[0.000028697625,0.00075435813,0.00017444683,0.0013449622,0.0007156081,0.0004335252,0.0020327237,0.001598037,0.00008568516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018916337,0.000035258377,0.00028525185,0.000016815153,0.00000853117,0.0006301289,0.00031202353,0.04083173,0.000001107681,0.024686273,0.0005536081,0.93262035],"study_design_scores_gemma":[0.00041017108,0.00014155662,0.00011568858,0.0006149171,0.000008439852,0.000071721544,8.267269e-8,0.76503015,0.000005621103,0.22600195,0.0068276776,0.0007720342],"about_ca_topic_score_codex":0.0002315909,"about_ca_topic_score_gemma":0.0046441974,"teacher_disagreement_score":0.93184835,"about_ca_system_score_codex":0.0004667791,"about_ca_system_score_gemma":0.0014610001,"threshold_uncertainty_score":0.99949074},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027853637,0.000027918557,0.97631407,0.00014342308,0.00080163934,0.022157717,0.0000804732,0.0000417009,0.00040523015],"genre_scores_gemma":[0.12921971,0.000003677183,0.8592843,0.00024324868,0.00022575835,0.010876151,0.000097900585,0.000025333928,0.000023907578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982229,0.000030649186,0.0008688849,0.00020592331,0.00043203373,0.00023964746],"domain_scores_gemma":[0.9967974,0.0005849921,0.0010648455,0.00081751583,0.00068790466,0.00004733253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017091853,0.0002807009,0.00038970954,0.00011541836,0.0008131572,0.00008418118,0.001734834,0.0002609974,6.2699775e-7],"category_scores_gemma":[0.000055805067,0.00020463095,0.0002723265,0.00013075418,0.00043958047,0.0002465451,0.00030601752,0.0003027734,1.5728416e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000780802,0.000011459266,0.0000036560346,0.00032051528,0.000023139151,2.467337e-9,0.0001697495,0.9288169,6.760254e-7,0.016106829,0.00011029156,0.054428972],"study_design_scores_gemma":[0.00067289965,0.0001084391,0.00003005636,0.0003945102,0.00009423726,0.0000010988396,0.0000012703642,0.9910872,0.000009603558,0.0013303938,0.006071082,0.00019920255],"about_ca_topic_score_codex":0.0000073981682,"about_ca_topic_score_gemma":0.000014301266,"teacher_disagreement_score":0.12919186,"about_ca_system_score_codex":0.00023802147,"about_ca_system_score_gemma":0.0010072343,"threshold_uncertainty_score":0.8344608},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008416932,0.003850987,0.9823189,0.0013538229,0.0029350584,0.00013195393,0.0000076188785,0.000037305934,0.0009474585],"genre_scores_gemma":[0.9978775,0.0006252112,0.00025905855,0.0003099718,0.0008046384,0.0000072527405,0.0000851617,0.000011387088,0.000019851888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975449,0.0004522626,0.0010096546,0.00018979587,0.0005387535,0.00026466683],"domain_scores_gemma":[0.9972008,0.0005151335,0.00089205225,0.00034225374,0.00084230345,0.00020747278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014776334,0.00018875957,0.00038811067,0.00019708677,0.00010700069,0.0005017907,0.0015332057,0.00017138298,0.0000026267926],"category_scores_gemma":[0.00003750145,0.00017040476,0.00009326086,0.00034358597,0.00008212752,0.0004445901,0.000330765,0.00058450416,0.00000155952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005364827,0.00034885327,0.006499862,0.000005842054,0.0002805814,0.00026819183,0.0006414641,0.75367886,0.0000013191997,0.09783289,0.049412023,0.090493664],"study_design_scores_gemma":[0.0015301727,0.00009138305,0.0013021247,0.00029847224,0.000010746065,0.00023854866,0.00023641293,0.98766726,1.571666e-7,0.0016354707,0.0068200976,0.00016914037],"about_ca_topic_score_codex":0.000037035767,"about_ca_topic_score_gemma":0.000010652304,"teacher_disagreement_score":0.9894605,"about_ca_system_score_codex":0.00018881715,"about_ca_system_score_gemma":0.00010145405,"threshold_uncertainty_score":0.69489044},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021493984,0.00017775758,0.9626643,0.00022664515,0.0035480699,0.0035199595,0.0000030719796,0.000311946,0.008054278],"genre_scores_gemma":[0.98174435,0.000021633234,0.0125262495,0.00025834842,0.004244854,0.00079183746,0.0000017581145,0.000031431693,0.0003795339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652135,0.00016431903,0.0010199229,0.00061503914,0.00056672737,0.0011126556],"domain_scores_gemma":[0.997476,0.00043722574,0.0006035492,0.0010520334,0.00018013823,0.0002510831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000977517,0.0003476144,0.00070152583,0.000049705246,0.00032284748,0.0000901378,0.0012760754,0.00020246796,0.000023193094],"category_scores_gemma":[0.0000062510717,0.00024752266,0.00016578297,0.0006998667,0.0001514447,0.00044270488,0.00025320143,0.00026577423,0.00008204457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030698944,0.00023386495,0.10230215,0.00008115522,0.000111393245,0.00004758401,0.00050715264,0.07369299,0.000113195696,0.0062230797,0.117094986,0.69928545],"study_design_scores_gemma":[0.0010290877,0.000447098,0.001424763,0.0012852582,0.000021043186,0.000035170342,0.0000064192964,0.97476405,0.00017435066,0.0018107973,0.018499112,0.00050288084],"about_ca_topic_score_codex":0.000008026709,"about_ca_topic_score_gemma":0.000007486951,"teacher_disagreement_score":0.9602504,"about_ca_system_score_codex":0.000056072826,"about_ca_system_score_gemma":0.0001752663,"threshold_uncertainty_score":0.9999977},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010872677,0.00033347282,0.98699397,0.00045330572,0.0010543871,0.00007184876,0.000009387433,0.000055141758,0.00015581239],"genre_scores_gemma":[0.9664115,0.00005136047,0.031539265,0.0015530816,0.00034999225,0.0000010974741,0.000035670382,0.000016088421,0.000041964697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979077,0.00017355866,0.00080256746,0.00032954212,0.00041335195,0.00037328986],"domain_scores_gemma":[0.9974001,0.0005297045,0.0005626372,0.0009567204,0.00025349937,0.00029735008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011986883,0.0002003251,0.00044707188,0.000233573,0.000092902046,0.00020841125,0.0022445708,0.00012933202,0.00005320006],"category_scores_gemma":[0.00012931113,0.00017278898,0.00010368545,0.000318878,0.00009058145,0.0006495266,0.00041329724,0.0005424624,0.000010252899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015613523,0.00034273238,0.034207616,0.00005645775,0.00007630756,0.0022086543,0.000209609,0.007538648,0.000012601336,0.0013945397,0.031864945,0.92193174],"study_design_scores_gemma":[0.0009918307,0.000248469,0.002726997,0.00025929633,0.000028182643,0.0002742618,0.000024771436,0.9880199,0.0000013250026,0.0005126706,0.0066917967,0.000220493],"about_ca_topic_score_codex":0.000010712874,"about_ca_topic_score_gemma":0.000012229667,"teacher_disagreement_score":0.98048127,"about_ca_system_score_codex":0.000059223094,"about_ca_system_score_gemma":0.00040094563,"threshold_uncertainty_score":0.704613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045519013,0.00007112585,0.93178475,0.0010004492,0.000357429,0.00042305572,0.0000015044575,0.0002502715,0.020592403],"genre_scores_gemma":[0.9850889,0.000015048143,0.011551962,0.0021344237,0.00009438585,0.00005318677,0.0000071951276,0.000018490728,0.001036408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740237,0.00013869345,0.00066976435,0.0006743353,0.0003215047,0.0007933413],"domain_scores_gemma":[0.9984071,0.00042417244,0.00016512511,0.0005253673,0.0001957436,0.0002824802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042079488,0.00033371733,0.00041323702,0.0001448193,0.000156594,0.0003170366,0.00081070286,0.00022661775,0.00040582838],"category_scores_gemma":[0.0000145552085,0.00028011395,0.00012069576,0.0005589274,0.00016698154,0.001362049,0.00034040507,0.0005853442,0.0002199496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007140738,0.00048434496,0.04588683,0.000041817984,0.00025096757,0.0012340135,0.009063799,0.021340115,0.000091403905,0.37629128,0.011544866,0.53369915],"study_design_scores_gemma":[0.0005667164,0.00007057455,0.0028073841,0.00013540935,0.000006314738,0.000076910444,0.00028808232,0.9927541,0.000004617305,0.0027904669,0.00011933594,0.0003800909],"about_ca_topic_score_codex":0.00058470666,"about_ca_topic_score_gemma":0.000060146976,"teacher_disagreement_score":0.97141397,"about_ca_system_score_codex":0.00009574559,"about_ca_system_score_gemma":0.00013713933,"threshold_uncertainty_score":0.99996513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07912066,0.0019295851,0.91556585,0.0020740835,0.00019314948,0.0004893814,0.00044184586,0.00012591704,0.00005953932],"genre_scores_gemma":[0.99189246,0.0018352558,0.005266464,0.00022309135,0.000047881334,0.00005397781,0.00029030515,0.000015219816,0.00037536147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981916,0.0006938357,0.00035851623,0.00033653138,0.00012160033,0.0002979437],"domain_scores_gemma":[0.99157554,0.002938626,0.00015838664,0.0049506086,0.00020199838,0.00017486853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018293188,0.00017450721,0.000253821,0.00004290331,0.00080626947,0.00017508962,0.0024595738,0.00012015653,0.0000036445715],"category_scores_gemma":[0.00007677652,0.00014168111,0.000030449579,0.00021515843,0.0005061874,0.00049245206,0.0020016546,0.00025067315,0.0000082266015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015689131,0.00055188814,0.0005455083,0.000044776123,0.000111100766,0.000007974858,0.0005185755,0.000057620342,0.0024820145,0.005041988,0.034994405,0.9540752],"study_design_scores_gemma":[0.0013103887,0.00030844082,0.0005856482,0.000105442,0.00003537066,0.00009988274,0.000031829986,0.9168564,0.00009871819,0.0011931623,0.07908783,0.0002868634],"about_ca_topic_score_codex":0.000023293916,"about_ca_topic_score_gemma":0.0000633808,"teacher_disagreement_score":0.9537884,"about_ca_system_score_codex":0.00004816238,"about_ca_system_score_gemma":0.0000733076,"threshold_uncertainty_score":0.6201254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033454478,0.00007536553,0.9924516,0.0016559273,0.0014406877,0.00049116847,0.00002536392,0.00013060958,0.000383824],"genre_scores_gemma":[0.9912017,0.00036296842,0.0066953986,0.0011773126,0.00032978185,0.00002918321,0.0000027270728,0.000016042159,0.00018488865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985227,0.00009093567,0.00031554865,0.00036202176,0.00028543247,0.00042336684],"domain_scores_gemma":[0.99714774,0.0019006502,0.00016259185,0.0005317731,0.00012512424,0.0001321393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052243355,0.00023971726,0.00022894207,0.00006448016,0.00061799877,0.00022219343,0.00025790176,0.00014192458,0.0000051687152],"category_scores_gemma":[0.0000128554275,0.00015436379,0.00007030799,0.00025678656,0.00013853137,0.00047630686,0.000013333968,0.0002546088,0.0000054259126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000617994,0.000039819588,0.00002049688,0.000016070044,0.000076067896,0.000011251615,0.0006602678,0.011095897,0.000050025625,0.0036172327,0.0012525189,0.98254234],"study_design_scores_gemma":[0.0010441083,0.0002413912,0.000070889524,0.00026709956,0.00003283531,0.000029200228,0.000052293526,0.9872052,0.000083451334,0.0018943858,0.008771398,0.00030773753],"about_ca_topic_score_codex":0.000003889136,"about_ca_topic_score_gemma":0.00000959903,"teacher_disagreement_score":0.98785627,"about_ca_system_score_codex":0.000097284996,"about_ca_system_score_gemma":0.000051834915,"threshold_uncertainty_score":0.62947726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038530948,0.0000851441,0.9927136,0.0012021476,0.00007332711,0.00092421,0.0000029902221,0.00019899802,0.000946544],"genre_scores_gemma":[0.41695258,0.000014438388,0.5809304,0.0009948014,0.00054670667,0.0004299561,0.000056055724,0.000011088021,0.00006399422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983589,0.00003911572,0.00042819715,0.0006065457,0.00015946424,0.00040777065],"domain_scores_gemma":[0.999047,0.00002947355,0.000093426366,0.0006228959,0.00007763595,0.0001295806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030549848,0.00017662908,0.0001919073,0.000076576645,0.00018366866,0.00022720196,0.00071358203,0.00010450006,0.000014729243],"category_scores_gemma":[1.4032881e-7,0.00018009086,0.00006684644,0.00063959515,0.000056295154,0.00038898812,0.00024672723,0.00019925134,0.0001678361],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006180559,0.0008302056,0.00090841425,0.000025362477,0.000021399617,0.000032036918,0.00076753134,0.019005494,0.0022686308,0.21392085,0.009632314,0.7525816],"study_design_scores_gemma":[0.001764546,0.00016068654,0.0023148602,0.00003973582,0.000017226868,0.00018313035,0.000017178116,0.7000875,0.00070559146,0.08753597,0.20628762,0.000885947],"about_ca_topic_score_codex":0.000038111462,"about_ca_topic_score_gemma":0.00006325013,"teacher_disagreement_score":0.75169563,"about_ca_system_score_codex":0.00011622738,"about_ca_system_score_gemma":0.00032402918,"threshold_uncertainty_score":0.73438925},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7586088,0.0007147184,0.14360614,0.013428429,0.00019048937,0.0003475895,0.0000044689605,0.000016411572,0.08308296],"genre_scores_gemma":[0.9934343,0.00024332282,0.0059417854,0.000045818437,0.000007005233,9.587252e-8,5.8471323e-7,0.0000019951067,0.00032507346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998871,0.00016066978,0.00033880732,0.0000943827,0.00040459598,0.00013050022],"domain_scores_gemma":[0.99771696,0.00009970397,0.0007719841,0.0007910439,0.00053355354,0.00008676391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090325315,0.000072560244,0.00020816976,0.00018212988,0.000300571,0.000040516363,0.003120197,0.00003267465,0.000066513676],"category_scores_gemma":[0.000016492997,0.000060375485,0.00006293106,0.0003684519,0.00045778294,0.0008175407,0.00044747756,0.0002445227,0.0000015583943],"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.00032966508,0.0030111691,0.031237915,0.0002242248,0.00037665534,0.0000819645,0.10170101,0.0029057136,0.07113451,0.49169642,0.023686385,0.27361438],"study_design_scores_gemma":[0.011680564,0.0014008438,0.63053143,0.0023563409,0.00021661636,0.00017371126,0.021690043,0.19254087,0.009941364,0.10720607,0.02096847,0.001293647],"about_ca_topic_score_codex":0.00033035607,"about_ca_topic_score_gemma":0.000109415654,"teacher_disagreement_score":0.59929353,"about_ca_system_score_codex":0.00006343017,"about_ca_system_score_gemma":0.000319302,"threshold_uncertainty_score":0.57981545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005741769,0.0005586216,0.9631801,0.0002524027,0.0060566757,0.00078011083,0.0000025207944,0.00022304637,0.028372327],"genre_scores_gemma":[0.77039033,0.0017472099,0.14071354,0.0076657017,0.008423358,0.0003982774,0.0000400093,0.0003227815,0.07029881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99353737,0.00013174463,0.0011172304,0.002286341,0.0013518577,0.0015754349],"domain_scores_gemma":[0.9967505,0.0003470063,0.0004229653,0.0017405393,0.0002957567,0.000443275],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017113579,0.0007500881,0.0010142585,0.00095580285,0.0002713378,0.0011641604,0.005365619,0.0004377438,0.000033920594],"category_scores_gemma":[0.00000734801,0.00067271525,0.00013968712,0.0016438679,0.0009806398,0.0010866803,0.0032598889,0.0013469495,0.00013638716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014215791,0.00018471661,0.00035985696,0.0001046984,0.000031491873,0.0025710561,0.0020214913,0.016123744,0.000019937463,0.023663586,0.005135473,0.94976974],"study_design_scores_gemma":[0.00041381398,0.00012088311,0.00012813596,0.0008426284,0.0000043003047,0.00011963896,0.000001584356,0.98286396,0.000030090323,0.0039454843,0.010645252,0.000884221],"about_ca_topic_score_codex":0.000097996875,"about_ca_topic_score_gemma":0.0001502557,"teacher_disagreement_score":0.96674025,"about_ca_system_score_codex":0.0008710908,"about_ca_system_score_gemma":0.0028548748,"threshold_uncertainty_score":0.99987274},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018740255,0.0394128,0.89626575,0.0009821929,0.0018069899,0.00048544884,0.000004088092,0.0004578399,0.06039747],"genre_scores_gemma":[0.2845762,0.116664656,0.29660356,0.002667221,0.048466574,0.00026867422,0.000111709145,0.0010703848,0.249571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980636,0.000026195883,0.0003126415,0.00066689146,0.0004348532,0.0004957841],"domain_scores_gemma":[0.9990016,0.00018759069,0.000047022448,0.00034279065,0.00012431292,0.00029667738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051182223,0.00030824472,0.00040695159,0.00043967218,0.00012325954,0.00019288462,0.0003623758,0.00035780936,0.000006656105],"category_scores_gemma":[0.000003579915,0.00030276956,0.000049009228,0.00023229494,0.000059921786,0.00014183909,0.00081611634,0.00124367,0.0000071373843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006435933,0.000015394582,0.00001544743,0.00003256271,0.000024124662,0.00017316881,0.000113004346,0.00006546456,0.0000035658845,0.3425088,0.0015844329,0.6554576],"study_design_scores_gemma":[0.00019716963,0.00010008879,0.000101941936,0.00010563808,0.000005533425,0.00010268621,4.376341e-7,0.5447284,0.0000012828701,0.0051516267,0.44921216,0.00029302726],"about_ca_topic_score_codex":0.000015945881,"about_ca_topic_score_gemma":0.000002940328,"teacher_disagreement_score":0.6551646,"about_ca_system_score_codex":0.00011296683,"about_ca_system_score_gemma":0.00008946351,"threshold_uncertainty_score":0.9999424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018246792,0.00003251152,0.97328633,0.0026118648,0.0002766251,0.00472386,0.00004426094,0.00019184808,0.0005858774],"genre_scores_gemma":[0.66404414,0.00004520755,0.32565182,0.0059053698,0.0021689376,0.00070440833,0.00011895352,0.00006655077,0.0012946181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984953,0.00007574565,0.0003661389,0.0003708803,0.00028353152,0.0004084302],"domain_scores_gemma":[0.99855256,0.00031330797,0.00019882731,0.00054862193,0.00017349776,0.00021317409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002136902,0.00023357653,0.00027016006,0.000044047036,0.00014305029,0.00020591775,0.000367369,0.00021608963,0.000019042844],"category_scores_gemma":[0.000026494463,0.00016528103,0.000071717775,0.00025702335,0.000038778784,0.0005986259,0.00015513056,0.000165833,0.000023116028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030030229,0.00017513214,0.00056629616,0.00041546463,0.00038238586,0.00011974616,0.042800855,0.005821413,0.0036516427,0.031296257,0.059522938,0.85224485],"study_design_scores_gemma":[0.0027295202,0.00019464582,0.0000660903,0.00021443985,0.000028774013,0.000027916749,0.00013967173,0.87491536,0.0015291108,0.032046225,0.08757429,0.0005339454],"about_ca_topic_score_codex":0.00006409792,"about_ca_topic_score_gemma":0.000014362003,"teacher_disagreement_score":0.86909395,"about_ca_system_score_codex":0.000025329466,"about_ca_system_score_gemma":0.000099564575,"threshold_uncertainty_score":0.6739965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009267477,0.00003709665,0.9710947,0.008996148,0.000055014032,0.000049244467,0.000016231514,0.00015082523,0.019508058],"genre_scores_gemma":[0.983753,0.00003693903,0.012541363,0.00022994069,0.000045787972,0.000009374149,0.000059012033,0.000006563613,0.003317976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990911,0.00004923152,0.00015006532,0.00029950883,0.00023094854,0.00017917133],"domain_scores_gemma":[0.99753636,0.00021566275,0.0000744446,0.0020006162,0.00010149671,0.00007140919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020151814,0.00009039171,0.00009397781,0.000040034265,0.00025372847,0.00008771988,0.0022092757,0.00004199014,0.00003390176],"category_scores_gemma":[0.000001620099,0.00005214027,0.000016264068,0.00021457027,0.00010851247,0.00029196977,0.001025037,0.000043640623,0.000024454133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029056303,0.00009332546,0.00008198733,0.0000015169921,0.000011195434,0.0000039256333,0.00012423974,0.0000015897132,0.000025456931,0.19688149,0.03251071,0.77026165],"study_design_scores_gemma":[0.00016183015,0.000022278558,0.00011607357,0.00003191966,0.000007661899,0.00000868122,0.000035905497,0.9759452,0.000029157953,0.00076144905,0.022736669,0.00014320393],"about_ca_topic_score_codex":0.000018272263,"about_ca_topic_score_gemma":0.00003637287,"teacher_disagreement_score":0.98366034,"about_ca_system_score_codex":0.000025518599,"about_ca_system_score_gemma":0.00007267999,"threshold_uncertainty_score":0.4105421},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014936495,0.0025137393,0.9748403,0.000022239843,0.00026257386,0.00019257382,0.0000025137024,0.00006521445,0.0071643707],"genre_scores_gemma":[0.98379475,0.0007919921,0.011362202,0.000069617956,0.00016330121,0.000009153176,0.000013252469,0.00004278541,0.0037529673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812317,0.000012022524,0.0005592582,0.00055150926,0.00036282477,0.00039124247],"domain_scores_gemma":[0.9992522,0.000076764685,0.00012588104,0.00038217657,0.000020053001,0.00014291363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030133023,0.00032555184,0.00074969267,0.0011205367,0.000018349472,0.000041540872,0.0004558861,0.00024473184,0.0000051788065],"category_scores_gemma":[0.000001977838,0.00034493092,0.000118374985,0.00055494846,0.000030512841,0.00014609139,0.00032459717,0.0005404557,0.0000031551747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028557966,0.0001202213,0.006261582,0.00016011909,0.00088813336,0.00043105532,0.00034755227,0.4120559,0.00007061249,0.09347425,0.00010913516,0.48605287],"study_design_scores_gemma":[0.00023371515,0.00007044484,0.004205452,0.00015810259,0.00007569969,0.000008799712,1.2199864e-7,0.9898569,0.0000086801865,0.00021553077,0.0048193713,0.00034718303],"about_ca_topic_score_codex":0.0000096632775,"about_ca_topic_score_gemma":0.000001589943,"teacher_disagreement_score":0.96885824,"about_ca_system_score_codex":0.00013305385,"about_ca_system_score_gemma":0.000039905757,"threshold_uncertainty_score":0.9999003},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016496388,0.0071117873,0.78799236,0.0008454912,0.0024277656,0.0004998161,0.00003159965,0.00024589163,0.20084362],"genre_scores_gemma":[0.12651204,0.01739289,0.017313574,0.005764035,0.0069899797,0.00007875709,0.0053221565,0.00049104897,0.82013553],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639904,0.00009900828,0.0008425241,0.0012996572,0.00063166424,0.0007281082],"domain_scores_gemma":[0.996198,0.00013530135,0.00057842507,0.0025138168,0.00014243758,0.000432011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011897458,0.00054366124,0.0009205821,0.00023723453,0.00017823334,0.00020689427,0.002440197,0.0008229557,0.00006621843],"category_scores_gemma":[0.0000029844498,0.0005619228,0.00008957159,0.00026233672,0.00009819683,0.0003794039,0.0013518895,0.0014140112,0.00006227497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028163398,0.000036868132,0.00002282194,0.000035869303,0.000043077904,0.00019626146,0.00016094628,0.0014095282,1.3792343e-8,0.11845414,0.50782084,0.37179145],"study_design_scores_gemma":[0.00040170577,0.000084581094,0.0000062145023,0.0004122548,0.000010804649,0.00005133327,0.0000048673714,0.78826165,1.10116645e-8,0.007819695,0.20250772,0.0004391592],"about_ca_topic_score_codex":0.00013339231,"about_ca_topic_score_gemma":0.0006512179,"teacher_disagreement_score":0.7868521,"about_ca_system_score_codex":0.00034248576,"about_ca_system_score_gemma":0.0011240292,"threshold_uncertainty_score":0.9996832},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011140922,0.00009902252,0.9833693,0.0053622858,0.0002399731,0.008365721,0.0000033367387,0.00036794727,0.0020809933],"genre_scores_gemma":[0.6342186,0.000042903626,0.35396698,0.0015371898,0.00014177863,0.009891589,0.000017098266,0.000029635596,0.00015425803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997652,0.00049353874,0.0006599402,0.00046873692,0.00018565006,0.0005401648],"domain_scores_gemma":[0.99513614,0.0010489637,0.00023029644,0.0032543202,0.0001636843,0.0001665641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061439216,0.00023096299,0.0003437348,0.00016826023,0.00034389805,0.00014493,0.003753683,0.0001563331,0.0000670818],"category_scores_gemma":[0.000016075697,0.00018371397,0.00007658955,0.0006870997,0.0002279587,0.00038359224,0.0021214664,0.000349652,0.000060925126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005605851,0.0006210247,0.0076283044,0.000020369536,0.00004039969,0.000025966106,0.00047830743,0.0011812408,0.00006114972,0.055177946,0.008438108,0.92627114],"study_design_scores_gemma":[0.0017661154,0.00011022516,0.0021191796,0.0001481412,0.000004546958,0.000014923566,0.0000052958485,0.9535368,0.0000067188125,0.00181646,0.040222403,0.00024915676],"about_ca_topic_score_codex":0.000014688183,"about_ca_topic_score_gemma":0.000057399786,"teacher_disagreement_score":0.95235556,"about_ca_system_score_codex":0.000116324445,"about_ca_system_score_gemma":0.0002443106,"threshold_uncertainty_score":0.74916387},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003552922,0.0001715517,0.84483844,0.003734468,0.0017648725,0.00030649744,0.000010590091,0.0006114779,0.14820682],"genre_scores_gemma":[0.9102386,0.0000465437,0.030945389,0.0005974711,0.001011362,0.0000378373,0.00001923395,0.00003900616,0.057064522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975705,0.00009730138,0.00022483165,0.0010317551,0.0004494092,0.0006262042],"domain_scores_gemma":[0.9974926,0.00026441432,0.00023702429,0.0016126542,0.00008062829,0.00031269708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036903142,0.00044349715,0.0005315009,0.00013678921,0.00013224164,0.0009582511,0.0018777691,0.0004095259,0.0002142666],"category_scores_gemma":[0.000010449178,0.0003215156,0.00021991767,0.00011399471,0.00008542764,0.00034557676,0.002181005,0.000467243,0.0006682041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013910076,0.00010786743,0.00020843504,0.00021185575,0.00021370384,0.00066463265,0.00026833796,0.00004028319,0.0005433443,0.082571805,0.23824333,0.6769125],"study_design_scores_gemma":[0.00045307964,0.000094516414,0.00007869786,0.0006936542,0.00003992949,0.00008500369,0.000006472397,0.9447986,0.0005281162,0.032155674,0.019864041,0.0012022387],"about_ca_topic_score_codex":0.0000056317404,"about_ca_topic_score_gemma":0.0000010639563,"teacher_disagreement_score":0.9447583,"about_ca_system_score_codex":0.00010209984,"about_ca_system_score_gemma":0.00024208847,"threshold_uncertainty_score":0.9999237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005683392,0.00054611225,0.99401295,0.0022091838,0.001075642,0.0004012491,0.00007824938,0.000035761925,0.0010725135],"genre_scores_gemma":[0.6261738,0.00007340729,0.37194163,0.0013161076,0.00031891017,0.000006909939,0.000015158621,0.00002737005,0.00012670294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959684,0.00007223252,0.00093487155,0.0013144662,0.0011182999,0.0005917142],"domain_scores_gemma":[0.99543124,0.00097176456,0.00042518968,0.0026569162,0.00035642795,0.0001584611],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015639547,0.00045346247,0.0008328774,0.0005546005,0.00011346855,0.00016773475,0.0062887217,0.00027346317,0.000033266067],"category_scores_gemma":[0.00010572339,0.0003094337,0.00011271055,0.00072754256,0.00087251485,0.0006152273,0.004652021,0.0005052928,0.0000064175333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006597476,0.00005264407,0.00012520028,0.000095835094,0.00003251774,0.000096162395,0.0010442309,0.021178834,0.00029833333,0.011716094,0.0000554669,0.9652387],"study_design_scores_gemma":[0.00050330866,0.000114503506,0.0006943212,0.0013838799,0.000016255866,0.000060393824,0.0000017884164,0.9725661,0.00022575595,0.023718072,0.00018249555,0.00053308276],"about_ca_topic_score_codex":0.0001140852,"about_ca_topic_score_gemma":0.000054815588,"teacher_disagreement_score":0.96470565,"about_ca_system_score_codex":0.000098991775,"about_ca_system_score_gemma":0.00065157504,"threshold_uncertainty_score":0.99993575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045091803,0.0000044976873,0.9883208,0.00096852414,0.00027131248,0.00019498733,0.00005769258,0.0002486468,0.005424359],"genre_scores_gemma":[0.964572,0.0000056225895,0.031139726,0.00038116795,0.00012240914,0.00003029329,0.000006292801,0.000006322627,0.0037361612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909467,0.000040552302,0.00014499594,0.00032455433,0.00015430523,0.0002409354],"domain_scores_gemma":[0.9991273,0.00027024178,0.000074783115,0.0002919545,0.000117081014,0.000118637654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037435655,0.00009569347,0.00012841792,0.000027972077,0.00011389704,0.000054760207,0.00027871656,0.0000875105,0.000017047629],"category_scores_gemma":[0.000015171941,0.000062152765,0.000046022804,0.00006612614,0.00002671285,0.0007252711,0.00006604263,0.000042216852,0.000012042714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005381656,0.00023627798,0.0018443232,0.000006218414,0.000057086072,0.0000036540414,0.00087132765,0.00046845136,0.0004863939,0.39832747,0.03404317,0.5636018],"study_design_scores_gemma":[0.00044561658,0.00013427681,0.00034230968,0.000006144201,0.0000057694983,0.0000019615075,0.000008855968,0.9606532,0.000075645985,0.03784007,0.0003837713,0.000102406804],"about_ca_topic_score_codex":0.000008698162,"about_ca_topic_score_gemma":0.000021217515,"teacher_disagreement_score":0.9601847,"about_ca_system_score_codex":0.00005487103,"about_ca_system_score_gemma":0.00008592464,"threshold_uncertainty_score":0.25345162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01539019,0.00017964066,0.9793098,0.002225004,0.000993345,0.00063194206,0.000030125035,0.0009720508,0.0002679216],"genre_scores_gemma":[0.9793908,0.000015269063,0.019269776,0.00045424694,0.00006590326,0.00031806962,0.000007896061,0.00002777748,0.00045026888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979457,0.00004637332,0.000392161,0.00074344245,0.00027649294,0.0005958142],"domain_scores_gemma":[0.9980967,0.0000991054,0.00011089415,0.0011721834,0.00027386434,0.0002472777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003359801,0.00030117875,0.00038949098,0.00038274343,0.00024804633,0.00007161393,0.0008954534,0.0005487107,0.000020695432],"category_scores_gemma":[0.000005166111,0.000297803,0.00018317992,0.0006456567,0.00015174986,0.0002661467,0.000011023451,0.0005444347,0.000110667635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005323394,0.0035732,0.00045754696,0.00018001976,0.0008070509,0.0009285029,0.0011033749,0.016672049,0.0029228474,0.0641891,0.021270791,0.8873632],"study_design_scores_gemma":[0.002025619,0.0010980206,0.000008596972,0.00004975113,0.000054040713,0.00029161372,0.00015934324,0.9409323,0.0067471596,0.0061047194,0.04197519,0.00055365096],"about_ca_topic_score_codex":0.000022003316,"about_ca_topic_score_gemma":0.000026924403,"teacher_disagreement_score":0.9640006,"about_ca_system_score_codex":0.00011659564,"about_ca_system_score_gemma":0.00022878383,"threshold_uncertainty_score":0.9999474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002636759,0.00008338077,0.9892347,0.0018884145,0.0019712688,0.00079294055,0.002898372,0.0003992941,0.00009486203],"genre_scores_gemma":[0.9178651,0.000039645583,0.08041787,0.0007993299,0.00034268637,0.000043440454,0.00021325205,0.00002904858,0.00024962582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966169,0.00011073146,0.0005096231,0.0016096906,0.00047139527,0.00068167114],"domain_scores_gemma":[0.9927946,0.0018978631,0.00021295398,0.004355477,0.0001617992,0.0005773509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083323615,0.00036235127,0.00046626633,0.0003447659,0.00055808487,0.00051309,0.004476048,0.0001512681,0.000045485864],"category_scores_gemma":[0.00003138257,0.0002911004,0.000110194844,0.0009080708,0.00006816625,0.0014157328,0.00018477258,0.0002789452,0.000060153936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035448975,0.0002037732,0.000014786992,0.000016525393,0.000099527744,0.000022402039,0.00015599716,0.0017056656,0.0005434485,0.000050202936,0.01299998,0.98415226],"study_design_scores_gemma":[0.0008326256,0.00020545753,0.000012363984,0.00015806961,0.000076229684,0.000017588694,0.0000853424,0.9754565,0.0006602544,0.00014632182,0.021864679,0.0004846153],"about_ca_topic_score_codex":0.00008104598,"about_ca_topic_score_gemma":0.000024824863,"teacher_disagreement_score":0.9836676,"about_ca_system_score_codex":0.00009543371,"about_ca_system_score_gemma":0.00024259434,"threshold_uncertainty_score":0.9999541},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005367622,0.002729969,0.9360126,0.00026518907,0.0020067254,0.00048882473,0.000013437563,0.0002921023,0.052823517],"genre_scores_gemma":[0.98210645,0.00032502128,0.0072019906,0.00013612871,0.0002508667,0.00006884148,0.00608127,0.000024713341,0.003804726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979936,0.000154391,0.0006031528,0.00039390748,0.00032260918,0.00053233485],"domain_scores_gemma":[0.99824977,0.0001388299,0.0003031376,0.001058856,0.00010220632,0.00014721575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005273475,0.0003018126,0.00039703032,0.00010412902,0.00015333276,0.0001689392,0.001025763,0.00041812216,0.000118877564],"category_scores_gemma":[0.000004219157,0.0002849601,0.000102109516,0.00054325565,0.000021298501,0.0004838434,0.000125818,0.0005247655,0.000097522934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015979273,0.00060724106,0.0064319475,0.00019231995,0.000092111135,0.000051137387,0.0027926415,0.002789987,0.000017287633,0.23554829,0.043476418,0.7078408],"study_design_scores_gemma":[0.00063068554,0.000054219792,0.046975963,0.00056621165,0.00004934757,0.000015459113,0.00023938325,0.926137,0.000009744825,0.011146423,0.013214708,0.00096089713],"about_ca_topic_score_codex":0.00017009693,"about_ca_topic_score_gemma":0.0009813475,"teacher_disagreement_score":0.9767388,"about_ca_system_score_codex":0.00009722891,"about_ca_system_score_gemma":0.000110220026,"threshold_uncertainty_score":0.99996024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062930244,0.0026314524,0.9694245,0.0041936208,0.0011752781,0.0010281088,0.00004567533,0.00060513703,0.014603226],"genre_scores_gemma":[0.5186435,0.00036471593,0.47596028,0.0002354858,0.00018554322,0.00030375054,0.0003701717,0.00008151769,0.003855045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934139,0.002394588,0.00104521,0.0014478536,0.00059600663,0.0011024402],"domain_scores_gemma":[0.9894372,0.0021790422,0.00090914796,0.0052087135,0.0017431765,0.0005226686],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0068446174,0.00065990136,0.00073684304,0.00021021748,0.0006532021,0.0011991928,0.0053038592,0.0006466868,0.0000923827],"category_scores_gemma":[0.00037601969,0.0006961268,0.00046194223,0.00041473197,0.00016216302,0.00057737203,0.008421726,0.0011833411,0.000025254434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001428979,0.0022819473,0.003400383,0.0016544347,0.0008762117,0.0000795971,0.03055927,0.011589583,0.0015726086,0.26133057,0.03472015,0.65179235],"study_design_scores_gemma":[0.0005543554,8.088121e-7,0.00021730123,0.0019073124,0.000051347502,0.000033480148,0.000016966838,0.9695336,0.0008925372,0.0028640938,0.023187367,0.00074081257],"about_ca_topic_score_codex":0.00024695866,"about_ca_topic_score_gemma":0.00011478526,"teacher_disagreement_score":0.95794404,"about_ca_system_score_codex":0.00016199621,"about_ca_system_score_gemma":0.00036003158,"threshold_uncertainty_score":0.99983764},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040124566,0.000012063042,0.86724836,0.0023609686,0.00020984965,0.000022452334,2.081616e-7,0.00014366885,0.1296012],"genre_scores_gemma":[0.9547276,0.000010392724,0.026422167,0.00080912473,0.00006534827,0.0000018488398,9.7841486e-8,0.0000021919993,0.017961264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995472,0.000009071503,0.000074082855,0.00014066043,0.00009202468,0.00013700133],"domain_scores_gemma":[0.9995507,0.00005423957,0.000015755326,0.00028906483,0.000019419387,0.000070813774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077526995,0.000042756743,0.000047888567,0.000016127893,0.000027881062,0.000029998746,0.0003182624,0.000023034481,0.00019501106],"category_scores_gemma":[0.000001378657,0.000021914528,0.000020518259,0.00006262575,0.000017708024,0.00017828992,0.000096761774,0.00001742115,0.0004937078],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.316062e-7,0.0000075969215,0.00024299267,3.6837574e-7,0.0000018983088,0.000010405027,0.000011330596,7.2148296e-8,0.0001053425,0.26569864,0.01866082,0.7152599],"study_design_scores_gemma":[0.001343741,0.00019739769,0.0023295698,0.000060302307,0.000006327401,0.00010934386,0.000010049811,0.28788352,0.001699539,0.11560238,0.5900584,0.000699414],"about_ca_topic_score_codex":0.000001937907,"about_ca_topic_score_gemma":6.266556e-7,"teacher_disagreement_score":0.95432633,"about_ca_system_score_codex":0.0000062231056,"about_ca_system_score_gemma":0.000025538367,"threshold_uncertainty_score":0.63457793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001821383,0.000028656757,0.961343,0.0006799113,0.00039445874,0.0002596562,5.928866e-7,0.00022071207,0.035251662],"genre_scores_gemma":[0.98355824,0.000009227728,0.013011602,0.0027660937,0.00007663521,0.000033406726,0.0000105041545,0.00001215885,0.0005221384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824655,0.000082153674,0.00043608047,0.00043122386,0.00022569945,0.00057830865],"domain_scores_gemma":[0.9986892,0.00029397884,0.00010622324,0.0005696346,0.000074535455,0.00026647907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040263258,0.00019929248,0.00026279545,0.00013575336,0.000097169315,0.00027515733,0.0006715896,0.0001189453,0.00042948796],"category_scores_gemma":[0.000008904225,0.0001724071,0.000079820034,0.00047653544,0.000035758738,0.00043787027,0.00014071552,0.00025285024,0.00010358391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015433003,0.00030464827,0.03100006,0.000020612488,0.000031755048,0.00048725618,0.00016832765,0.0037294787,0.00006133648,0.48220524,0.02369249,0.45828336],"study_design_scores_gemma":[0.00041939688,0.000050111736,0.0039830706,0.00003486695,0.0000032727105,0.000009062795,0.00002322059,0.99234194,0.0000027106873,0.0026453608,0.0002487497,0.0002382202],"about_ca_topic_score_codex":0.0003845561,"about_ca_topic_score_gemma":0.000033003194,"teacher_disagreement_score":0.9886125,"about_ca_system_score_codex":0.000033703604,"about_ca_system_score_gemma":0.00011964841,"threshold_uncertainty_score":0.7030558},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036147563,0.00029124625,0.9894554,0.0048955306,0.00039371985,0.0006890906,0.000035015582,0.0001782312,0.00044701912],"genre_scores_gemma":[0.99281925,0.00006247245,0.002756437,0.0007354879,0.000593924,0.0011856202,0.00012910595,0.000020663441,0.001697066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977013,0.00007121943,0.00047846706,0.0007293052,0.0004199985,0.0005997204],"domain_scores_gemma":[0.99819994,0.0002279043,0.000098180535,0.0006752553,0.0003570982,0.0004416214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059654814,0.00025006811,0.0002642952,0.00011152626,0.0004164965,0.00021878543,0.0005123754,0.00012678202,0.000009535525],"category_scores_gemma":[0.000007218321,0.00020562852,0.000061526014,0.0009877372,0.00007237052,0.000108911714,0.00026826473,0.00015332957,0.00003949145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018250565,0.00026691367,0.0012443329,0.0000047761664,0.000026175378,0.00001028214,0.00026538366,0.11258143,0.000577162,0.050954156,0.01647583,0.81757534],"study_design_scores_gemma":[0.00030846646,0.000058560337,0.00032781172,0.000059579314,0.000012877078,0.0000084044095,0.000024291836,0.7038727,0.000056408506,0.00042807165,0.29453132,0.00031152213],"about_ca_topic_score_codex":0.000074979806,"about_ca_topic_score_gemma":0.000046083136,"teacher_disagreement_score":0.98920447,"about_ca_system_score_codex":0.000117352276,"about_ca_system_score_gemma":0.00005510812,"threshold_uncertainty_score":0.83852875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007553947,0.00012676447,0.72349876,0.00023854546,0.0005849491,0.00006561178,8.8034267e-7,0.00025257215,0.27447653],"genre_scores_gemma":[0.8787017,0.000056386452,0.10300057,0.0014627195,0.00015095486,0.0000075941825,0.0000024825567,0.000012303208,0.016605338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880016,0.000031171356,0.00023019392,0.00036249956,0.00020513825,0.00037084828],"domain_scores_gemma":[0.99890435,0.000060455342,0.00006554048,0.0006978478,0.000069573915,0.0002022403],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021611479,0.00015267717,0.0001640314,0.00005943782,0.00010071246,0.00006535435,0.000852333,0.00009342028,0.0039655166],"category_scores_gemma":[0.0000018082176,0.00012187931,0.00007113659,0.000079764526,0.000060531827,0.0003605508,0.00027149232,0.00012607181,0.0040102825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019329673,0.0002276377,0.0041837594,0.0000103121565,0.00004244725,0.00018330365,0.0011315609,0.0000025526112,0.00003836755,0.40078932,0.2635371,0.32983428],"study_design_scores_gemma":[0.0012029172,0.0005698017,0.0115069635,0.00003405558,0.00004612716,0.00021297274,0.00012455991,0.79481214,0.0017511629,0.10782546,0.08029838,0.001615483],"about_ca_topic_score_codex":0.00020998811,"about_ca_topic_score_gemma":0.000012072915,"teacher_disagreement_score":0.87794626,"about_ca_system_score_codex":0.000009449215,"about_ca_system_score_gemma":0.0000638702,"threshold_uncertainty_score":0.996945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086435226,0.00016819792,0.9938063,0.001995214,0.0028829982,0.00061193283,0.00005952962,0.0003371146,0.00005226576],"genre_scores_gemma":[0.5108616,0.000007645252,0.48752263,0.0008813943,0.00047509943,0.00017568044,0.000008446878,0.000010564903,0.00005695199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661124,0.00008400574,0.000567343,0.0011858215,0.00051770866,0.0010338783],"domain_scores_gemma":[0.99672574,0.0012473066,0.0002942172,0.0008211724,0.00042989213,0.0004816803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026038706,0.0002731149,0.00040885282,0.00016647324,0.0004141086,0.00017228542,0.0022648762,0.00010297942,0.0000024854126],"category_scores_gemma":[0.000076094555,0.0001778246,0.000106383515,0.0007388593,0.0005356359,0.00071851397,0.0004409527,0.00009800459,0.000038476206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006564981,0.00009725006,0.0006875456,0.000029750507,0.000012007323,0.00001643918,0.00005413369,0.0010072299,0.00014843684,0.027043058,0.005531865,0.9653657],"study_design_scores_gemma":[0.000633244,0.00022978215,0.0002517081,0.00009435836,0.0000063366037,0.000038426326,0.0000018718665,0.9916466,0.00012926494,0.0029636105,0.0036976363,0.00030720266],"about_ca_topic_score_codex":0.0000046170203,"about_ca_topic_score_gemma":2.0905956e-7,"teacher_disagreement_score":0.9906393,"about_ca_system_score_codex":0.00018099573,"about_ca_system_score_gemma":0.0007369357,"threshold_uncertainty_score":0.7251476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17346053,0.000021785003,0.82545453,0.00063172984,0.00010504738,0.00011021658,8.799531e-7,0.00009608092,0.00011920349],"genre_scores_gemma":[0.9782282,0.000043905846,0.021580476,0.00009366376,0.000011873806,0.000011277634,9.0848135e-7,0.0000012586953,0.000028425759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989209,0.000010110186,0.00039209952,0.00020414939,0.00026058345,0.00021214099],"domain_scores_gemma":[0.99898714,0.000089497145,0.00019149194,0.0004801101,0.00018027968,0.000071495386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091796514,0.0000809557,0.00018836955,0.0019232694,0.000081864964,0.00006690756,0.0007783307,0.00009513619,0.0000023476034],"category_scores_gemma":[0.000021781238,0.000060905717,0.00002354631,0.0041760793,0.00024932044,0.0031282748,0.00037759249,0.00006423415,0.000025102341],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010968076,0.000008026421,0.0018342963,0.0000017797573,0.0000068801096,4.3252055e-7,0.0002672527,0.00012674362,0.0008366965,0.010910876,0.00008609907,0.98590994],"study_design_scores_gemma":[0.00028734506,0.00014752072,0.0064429683,0.000024877838,0.000008136744,0.000007885346,0.000021602236,0.98486596,0.0024920814,0.0017796264,0.003808527,0.00011349307],"about_ca_topic_score_codex":0.0000076008596,"about_ca_topic_score_gemma":5.8689614e-7,"teacher_disagreement_score":0.98579645,"about_ca_system_score_codex":0.00006505757,"about_ca_system_score_gemma":0.0002519626,"threshold_uncertainty_score":0.24836631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029180583,0.00004797512,0.99255264,0.0031768582,0.00021594035,0.0007247269,0.00002715114,0.00007149841,0.00026514742],"genre_scores_gemma":[0.6919932,0.000004002428,0.30699265,0.0006481383,0.00010158419,0.000046803383,0.0001478717,0.0000042494307,0.00006154415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999017,0.000049394006,0.00024611436,0.0003672844,0.000111410525,0.00020879417],"domain_scores_gemma":[0.99794203,0.0009664948,0.00010374038,0.00072923105,0.00019544682,0.000063050255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005571637,0.000111666246,0.00009941184,0.000059962586,0.000284596,0.00018101055,0.00064935174,0.00008402478,0.000001533329],"category_scores_gemma":[0.00008394064,0.00007516807,0.000023915969,0.00030891018,0.000018242694,0.00037644015,0.00006209596,0.00012013517,7.1513523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006088223,0.000036766807,0.000003172307,0.0000019254353,0.0000029341109,0.000006560021,0.0006126253,0.000112390895,0.000005144297,0.30455226,0.0007939616,0.69381136],"study_design_scores_gemma":[0.0001627485,0.00023839372,0.000045325116,0.000036737074,0.000005210623,0.000038592607,0.00036582965,0.83732885,0.0000565004,0.16117525,0.00045589198,0.000090647634],"about_ca_topic_score_codex":0.00005823249,"about_ca_topic_score_gemma":0.0016485262,"teacher_disagreement_score":0.8372165,"about_ca_system_score_codex":0.000024328232,"about_ca_system_score_gemma":0.000057279558,"threshold_uncertainty_score":0.3065265},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022040877,0.001316479,0.99666715,0.0005098498,0.00027904887,0.00057159405,0.000032071228,0.000019936055,0.00038347067],"genre_scores_gemma":[0.06677108,0.00037192713,0.9325022,0.00008786179,0.00013696718,0.000051251875,0.000018346134,0.000010736146,0.00004963184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883103,0.000027367356,0.00055374857,0.00010308884,0.00023616677,0.0002485944],"domain_scores_gemma":[0.9962595,0.0026005062,0.00032204596,0.00051039684,0.0002649455,0.000042578573],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011315614,0.00019169119,0.00030538777,0.00012903687,0.0017276529,0.00022687543,0.0017842602,0.00017244356,2.208661e-7],"category_scores_gemma":[0.00003028118,0.00011498919,0.000066839,0.00021060112,0.0011835067,0.00021685859,0.001456404,0.00037918222,2.4740507e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007992295,0.000019044517,0.000038338658,0.0007264163,0.00023430139,4.4834835e-8,0.017439324,0.29593977,0.0000039321335,0.08139486,0.0011611306,0.60303485],"study_design_scores_gemma":[0.00018108322,0.000054992557,0.000101111866,0.0003060715,0.0000222563,0.0000065237928,0.000029796172,0.9744894,0.000011556581,0.0028368174,0.021802269,0.00015813531],"about_ca_topic_score_codex":0.000016428674,"about_ca_topic_score_gemma":0.000081510225,"teacher_disagreement_score":0.6785496,"about_ca_system_score_codex":0.000035249843,"about_ca_system_score_gemma":0.00040077482,"threshold_uncertainty_score":0.999572},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007497123,0.000044153385,0.9866742,0.0016812673,0.001039236,0.009234244,0.000014993766,0.00004925122,0.0011877209],"genre_scores_gemma":[0.97942644,0.000025200241,0.010657175,0.00024270444,0.0005076643,0.008859648,0.000010632004,0.000020225078,0.00025028776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973203,0.0003485477,0.0011311654,0.00020307967,0.00076909404,0.00022782889],"domain_scores_gemma":[0.99516976,0.0007330419,0.0014462367,0.0009056439,0.0015187225,0.00022659436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002177338,0.0001742684,0.00031661702,0.00018736982,0.0001476699,0.00043686214,0.0033886828,0.00011013764,0.00002275639],"category_scores_gemma":[0.00004574834,0.00012179665,0.00017170233,0.00010095708,0.00006254713,0.0009942015,0.00015035381,0.0001722892,0.000004445027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013897993,0.001240827,0.004502466,0.000050484417,0.0008244933,0.00018007847,0.0005515442,0.037847087,0.00094981474,0.43724325,0.018893497,0.49632666],"study_design_scores_gemma":[0.0028074172,0.00023574279,0.000096739546,0.0006049756,0.000016640011,0.00015280253,0.00005523361,0.9467423,0.00005222985,0.0017634089,0.04727636,0.00019615373],"about_ca_topic_score_codex":0.000009032113,"about_ca_topic_score_gemma":0.0000018083558,"teacher_disagreement_score":0.9793515,"about_ca_system_score_codex":0.0001900956,"about_ca_system_score_gemma":0.00031883747,"threshold_uncertainty_score":0.6297072},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035900812,0.0015776582,0.98267376,0.00033491707,0.00091818575,0.00022694009,0.0000011439163,0.00015898484,0.013749407],"genre_scores_gemma":[0.98242337,0.000030058802,0.016069314,0.00028076593,0.00024118923,0.000045608966,0.000015774554,0.000009506434,0.00088442623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916583,0.00006264864,0.00020466853,0.00018716884,0.00014748832,0.00023218022],"domain_scores_gemma":[0.99874115,0.00016843133,0.00009764034,0.00070135965,0.00013964201,0.00015176639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612356,0.000089460016,0.0001387816,0.00003144892,0.00012098302,0.00019989288,0.00069924083,0.00007829722,0.0000014777834],"category_scores_gemma":[0.00001060556,0.00008320687,0.000038751037,0.00013993919,0.000026377149,0.00025041428,0.00009832933,0.000097331445,0.000019143019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043070657,0.000119761055,0.001008489,0.000043400574,0.000056456283,0.000017955472,0.0017112504,0.093452774,0.0000065157815,0.43840206,0.22741577,0.2377225],"study_design_scores_gemma":[0.0002614715,0.000037522987,0.000024395536,0.000030707364,0.000004668325,0.000011767449,0.000048807422,0.96367157,0.0000015603099,0.0016661651,0.03413479,0.000106570704],"about_ca_topic_score_codex":0.000051590883,"about_ca_topic_score_gemma":0.00000373019,"teacher_disagreement_score":0.98206437,"about_ca_system_score_codex":0.000036894027,"about_ca_system_score_gemma":0.00006935603,"threshold_uncertainty_score":0.33930779},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024524174,0.000002403509,0.9520831,0.00081165164,0.00059004343,0.03977624,0.000008942134,0.00047923744,0.0062459107],"genre_scores_gemma":[0.41079143,0.0000030254646,0.13022162,0.005773125,0.0018299039,0.43106234,0.000051307197,0.000097652846,0.020169605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981382,0.00007274919,0.00046138358,0.00051904767,0.00025278272,0.00055582455],"domain_scores_gemma":[0.9984725,0.00032937952,0.00019953273,0.0005825185,0.0001403168,0.00027572858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172799,0.00020118084,0.00020747942,0.000060639955,0.00014177509,0.00006026326,0.00050437805,0.0001337282,0.00017973314],"category_scores_gemma":[0.00001980644,0.00013590891,0.00012401385,0.00009904865,0.000077945915,0.00031836244,0.000081201346,0.00008997338,0.00001190057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002037375,0.00028750856,0.0015951067,0.00008721782,0.000036355617,0.00003643857,0.00007556755,0.00025199543,0.000109874214,0.2959896,0.20150189,0.4998247],"study_design_scores_gemma":[0.0014491938,0.00014863767,0.00007511071,0.0000897272,0.000008103184,0.0000056691583,0.0000022198376,0.8371981,0.0000119961605,0.0009798296,0.15984643,0.0001850175],"about_ca_topic_score_codex":0.000008680919,"about_ca_topic_score_gemma":0.0000025936363,"teacher_disagreement_score":0.83694607,"about_ca_system_score_codex":0.00029997955,"about_ca_system_score_gemma":0.000440223,"threshold_uncertainty_score":0.55422044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12527238,0.0012904467,0.8724728,0.00031475263,0.00010806025,0.00034852023,0.00000284901,0.00009249811,0.000097682925],"genre_scores_gemma":[0.90844053,0.00047290168,0.09085468,0.000067189176,0.00007325377,0.00005778355,0.000005770813,0.000014183348,0.000013711176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985692,0.00012260802,0.00045303165,0.00039281047,0.00008920692,0.00037317036],"domain_scores_gemma":[0.9972847,0.0016517149,0.00017717654,0.00069540826,0.00007981191,0.00011119316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000784148,0.0001678315,0.00025252427,0.00009507781,0.0006036597,0.0001723881,0.00055033114,0.00008205055,5.1262083e-7],"category_scores_gemma":[0.000018374443,0.00013722258,0.000036885336,0.00018650005,0.00013296683,0.00028861486,0.00095876213,0.00018692059,4.0226587e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034677257,0.000038318125,0.002396482,0.000015251799,0.0000064017718,0.0000019869192,0.00068541936,0.0014749089,0.00014256583,0.0037632922,0.0000042517863,0.99146765],"study_design_scores_gemma":[0.00066785,0.00005220634,0.0008264706,0.000415272,0.0000065130803,0.000037309383,0.00014331899,0.996943,0.0000045394154,0.00022248876,0.00048016047,0.00020084914],"about_ca_topic_score_codex":0.000055048844,"about_ca_topic_score_gemma":0.000022407574,"teacher_disagreement_score":0.99546814,"about_ca_system_score_codex":0.000036070145,"about_ca_system_score_gemma":0.000027136333,"threshold_uncertainty_score":0.5595774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057762572,0.000071536946,0.9965463,0.00069151167,0.00087153976,0.0008552491,0.000093737006,0.000063456595,0.0007488494],"genre_scores_gemma":[0.19707493,0.000037546113,0.8022357,0.00032084927,0.00018795728,0.000044702883,0.000044255517,0.000023537781,0.000030469737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981229,0.000015606181,0.00088999234,0.0002503536,0.00027025075,0.0004509487],"domain_scores_gemma":[0.9977151,0.00071183837,0.0006525648,0.0006217712,0.00021221775,0.00008649186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006607249,0.00035858355,0.0005231454,0.00022947816,0.00076806225,0.0002411279,0.0019002497,0.00031039788,6.2715293e-7],"category_scores_gemma":[0.00003922166,0.00027464656,0.0002591045,0.00021449462,0.00028222258,0.00019523453,0.0006196009,0.00039513104,1.4700721e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023939033,0.000006987724,0.0000019939546,0.00010206067,0.00002629743,1.5712132e-7,0.00025486146,0.5981615,0.0000016267379,0.37601426,0.000012867099,0.025414964],"study_design_scores_gemma":[0.00041076727,0.00004731532,0.0000056639265,0.00049644924,0.00003641684,0.000005777095,0.000002650405,0.99051756,0.000012451042,0.0065524257,0.0015853952,0.00032710962],"about_ca_topic_score_codex":0.000008483516,"about_ca_topic_score_gemma":0.000023653789,"teacher_disagreement_score":0.39235604,"about_ca_system_score_codex":0.00012288465,"about_ca_system_score_gemma":0.00032398262,"threshold_uncertainty_score":0.99997056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073803635,0.00021561385,0.9840636,0.001979473,0.00072178483,0.00048029158,0.000010198009,0.0002540345,0.011536933],"genre_scores_gemma":[0.9605168,0.00017203488,0.031794548,0.00022280794,0.00023713417,0.000005096883,0.0000069463085,0.000023189275,0.007021451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982766,0.00008840374,0.0003382522,0.0005516731,0.00026674612,0.00047832585],"domain_scores_gemma":[0.99838394,0.00033830534,0.0002557483,0.000559225,0.00022929192,0.00023349682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037124718,0.0002490533,0.0002650595,0.00013488834,0.0004933437,0.000033812645,0.0006991626,0.0001545165,0.0013422163],"category_scores_gemma":[0.000011038842,0.00021487058,0.0001699711,0.00034471438,0.00008647026,0.0005665695,0.00018981664,0.00008502629,0.00003952106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024892038,0.00015806421,0.0021209193,0.00002733148,0.00018417016,0.000028618593,0.0015508079,0.07982248,0.00020643702,0.07208852,0.32787588,0.5156878],"study_design_scores_gemma":[0.0009576178,0.00007460178,0.00039255864,0.000038881633,0.000045499964,0.000017591776,0.00002021268,0.9849742,0.000013893724,0.009525574,0.0036073788,0.0003319885],"about_ca_topic_score_codex":0.00003481503,"about_ca_topic_score_gemma":0.00006897799,"teacher_disagreement_score":0.9597787,"about_ca_system_score_codex":0.00016103072,"about_ca_system_score_gemma":0.0006516801,"threshold_uncertainty_score":0.99957067},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022545538,0.00010372229,0.9941325,0.00035941083,0.00045777822,0.00038841736,0.000019738296,0.00012936167,0.0021545074],"genre_scores_gemma":[0.98400515,0.000064587926,0.014077196,0.00073215406,0.00021444011,0.00006830523,0.000016023607,0.000015740874,0.000806399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983358,0.000052175765,0.0002980585,0.0006499519,0.00016251992,0.00050148554],"domain_scores_gemma":[0.9980698,0.0005281663,0.00006661083,0.0011646461,0.000026406771,0.00014436246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055767666,0.00016760404,0.00021579131,0.00008147229,0.00006845243,0.00008610638,0.0012566095,0.00010477614,0.000038929877],"category_scores_gemma":[0.00001029266,0.000111353664,0.000054614837,0.00017708701,0.00003760198,0.00030084306,0.0002693061,0.0000857662,0.000020745727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047472862,0.0001016907,0.00017674822,0.0000064473857,0.000020011179,0.00007656499,0.000107513064,0.0019641407,0.000102866776,0.0073604695,0.01857935,0.9714567],"study_design_scores_gemma":[0.00068090827,0.00023496467,0.00001502389,0.000053762415,0.0000036896542,0.000014088998,0.0000102891545,0.9852501,0.00006928885,0.0007344504,0.012719493,0.00021393447],"about_ca_topic_score_codex":0.000009510911,"about_ca_topic_score_gemma":0.000042282667,"teacher_disagreement_score":0.98328596,"about_ca_system_score_codex":0.000043429583,"about_ca_system_score_gemma":0.0000546796,"threshold_uncertainty_score":0.45408705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06915397,0.00045261957,0.9212855,0.00042114264,0.0021767535,0.0004578639,0.000004205463,0.00025820208,0.0057897326],"genre_scores_gemma":[0.9961476,0.000101770296,0.0013051372,0.0006055288,0.0013612803,0.000093667,0.000024772391,0.000040802584,0.00031946742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701476,0.00039411825,0.00061554846,0.00050223985,0.0003618641,0.0011114419],"domain_scores_gemma":[0.9972803,0.0002953076,0.0004934203,0.0015837979,0.00012723276,0.00021992119],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012457101,0.00037547495,0.00066987966,0.00007445137,0.002646394,0.0009132928,0.002792564,0.0003702667,0.000015467183],"category_scores_gemma":[0.000008504024,0.00038119144,0.00020488101,0.00025148064,0.0002598331,0.0007146162,0.0013123284,0.0012791215,0.000018601027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010668052,0.00043855893,0.020812334,0.00004113067,0.00009305054,0.0002931595,0.0020122635,0.020075098,0.000017960247,0.014193087,0.017071106,0.9248456],"study_design_scores_gemma":[0.0011934718,0.0001430076,0.0036921366,0.00024937512,0.000017133914,0.000021150183,0.00030935794,0.98870635,0.00000824578,0.0018540375,0.003250742,0.0005550104],"about_ca_topic_score_codex":0.00023476395,"about_ca_topic_score_gemma":0.00045455244,"teacher_disagreement_score":0.9686312,"about_ca_system_score_codex":0.00013849963,"about_ca_system_score_gemma":0.00007611215,"threshold_uncertainty_score":0.999864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006505554,0.00003412968,0.95480394,0.025192756,0.00017498738,0.00021411502,0.000061486855,0.00028958565,0.019163916],"genre_scores_gemma":[0.9632614,0.000058133635,0.030002732,0.0016384716,0.00012622598,0.000025353547,0.00020372168,0.0000173209,0.0046666237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982087,0.000113283175,0.0003970845,0.0005648645,0.00035698275,0.00035910227],"domain_scores_gemma":[0.9953566,0.0005953836,0.00014228708,0.0034065233,0.00022376508,0.00027543984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058090815,0.00018384574,0.00021107611,0.00009931617,0.00042844776,0.0001695734,0.004687271,0.00009619238,0.00013618784],"category_scores_gemma":[0.000020943324,0.000134312,0.000040967585,0.00044262383,0.00010099665,0.0008185444,0.0026148204,0.000107967884,0.00046095822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029615967,0.00008557006,0.00017784002,0.000008073431,0.000018312634,0.000010702464,0.00017781547,1.302024e-7,0.00017542455,0.047841974,0.069407955,0.88209325],"study_design_scores_gemma":[0.00029156724,0.000050774564,0.0006907483,0.00011415514,0.000039665963,0.000027636532,0.00008144129,0.8165474,0.000027657588,0.0044638864,0.17713109,0.0005339921],"about_ca_topic_score_codex":0.000031549454,"about_ca_topic_score_gemma":0.00007417516,"teacher_disagreement_score":0.96319634,"about_ca_system_score_codex":0.000059342274,"about_ca_system_score_gemma":0.00015120873,"threshold_uncertainty_score":0.87101936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059080634,0.00004631519,0.93562514,0.00018423134,0.002645394,0.00024435922,0.00012586055,0.00012900996,0.0019190551],"genre_scores_gemma":[0.99825436,0.00006449909,0.000053807005,0.00024916723,0.000630054,0.000019431434,0.00024009254,0.000018427834,0.00047013923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823314,0.00010832566,0.00024913007,0.0006538799,0.00039053024,0.00036502193],"domain_scores_gemma":[0.99669945,0.0003119256,0.00032667967,0.0024238504,0.00012288734,0.00011522818],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007575744,0.00019215887,0.00024546398,0.00004809299,0.0008906727,0.0018238554,0.006194343,0.00015552201,0.000031099604],"category_scores_gemma":[0.000012409206,0.00017750997,0.00004218889,0.00013963817,0.0000985669,0.0020402553,0.0012431255,0.00023783215,0.000023783734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022791764,0.00012813944,0.014668673,0.0000102160075,0.000027240221,0.000057323843,0.00008454986,0.00028085435,0.000003988662,0.00043805796,0.23292083,0.7513573],"study_design_scores_gemma":[0.00018356084,0.00002079207,0.16400726,0.000040195417,0.000007161668,0.0000012507177,0.0000029876471,0.83463115,0.000019455692,0.00013186538,0.0007250063,0.00022932077],"about_ca_topic_score_codex":0.00034678553,"about_ca_topic_score_gemma":0.00022199997,"teacher_disagreement_score":0.93917376,"about_ca_system_score_codex":0.00003177582,"about_ca_system_score_gemma":0.00006353761,"threshold_uncertainty_score":0.9992123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025214542,0.00004981639,0.9145006,0.00080700836,0.00020650128,0.000056250134,0.0000018166025,0.00011772433,0.05904576],"genre_scores_gemma":[0.9837285,0.000018804145,0.011186888,0.0002023135,0.00005221215,0.0000063959965,2.1639747e-7,0.0000054590096,0.0047991755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991251,0.000045656914,0.00023688188,0.00020862992,0.00016746072,0.00021621789],"domain_scores_gemma":[0.9989972,0.00037720357,0.00006785356,0.00041019032,0.0000756555,0.00007190906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002691802,0.00008814549,0.00014396994,0.000036195506,0.000050704275,0.000028001443,0.00037555178,0.000035577374,0.00024607973],"category_scores_gemma":[0.000011778018,0.0000496704,0.000052771735,0.00010059241,0.000081944396,0.00028268155,0.00015431622,0.00003851645,0.000040044957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008454542,0.000034637953,0.001038423,0.0000097912625,0.000011856984,0.000007978652,0.00054119626,0.0000013499402,0.0009945309,0.20902424,0.0027642832,0.7855633],"study_design_scores_gemma":[0.004919294,0.0018670779,0.002425042,0.0010658441,0.00004874344,0.00018817719,0.0026093798,0.5462784,0.04535019,0.3161578,0.076586634,0.0025034356],"about_ca_topic_score_codex":0.000023197475,"about_ca_topic_score_gemma":0.000005322823,"teacher_disagreement_score":0.958514,"about_ca_system_score_codex":0.0000118922335,"about_ca_system_score_gemma":0.000056691362,"threshold_uncertainty_score":0.26944003},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001366635,0.001415505,0.06717914,0.0004987736,0.0058940966,0.00067977543,0.00015176996,0.0003434073,0.92382383],"genre_scores_gemma":[0.0019902687,0.0011745369,0.004884858,0.003280801,0.0010661248,0.000048518825,0.0014886216,0.00008931504,0.98597693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945574,0.000083459214,0.0011861138,0.0015731598,0.0014396961,0.0011601773],"domain_scores_gemma":[0.9956812,0.00028174772,0.00074040896,0.0015101763,0.0009845677,0.0008018864],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034137105,0.0010772407,0.0011454291,0.00021831272,0.0003503828,0.00064055575,0.0031729846,0.0012383612,0.02257942],"category_scores_gemma":[0.000014152228,0.0010176701,0.0002737793,0.00032991884,0.00017209347,0.00037424517,0.0006403425,0.0024779749,0.00020265437],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027403394,0.000048382517,0.00009306539,0.000022118804,0.0002546077,0.00035406632,0.00006308267,0.00012105754,6.740778e-7,0.003784653,0.97669953,0.018531382],"study_design_scores_gemma":[0.0006845154,0.00007528875,0.00027767904,0.00033663385,0.000076879915,0.000086625456,0.000004898216,0.106440656,3.89389e-7,0.00025059623,0.89064187,0.0011239662],"about_ca_topic_score_codex":0.11210482,"about_ca_topic_score_gemma":0.96690327,"teacher_disagreement_score":0.85479844,"about_ca_system_score_codex":0.0011441879,"about_ca_system_score_gemma":0.014181581,"threshold_uncertainty_score":0.99982333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052555,0.000017931297,0.9886423,0.0071921246,0.00006891327,0.00016539085,0.000023931783,0.00010641369,0.0032574858],"genre_scores_gemma":[0.9548207,0.0000065819027,0.041692838,0.0025139481,0.0002725425,0.000006036269,0.0004111447,0.0000033466272,0.000272863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891937,0.00005366851,0.0001770644,0.000465779,0.0001708905,0.00021324483],"domain_scores_gemma":[0.99912006,0.00013509135,0.00008359497,0.00054748834,0.00004845369,0.00006529534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004748783,0.00010101203,0.00017984433,0.00007214628,0.0002921407,0.0002042283,0.00036578818,0.000076585755,0.000018324927],"category_scores_gemma":[0.0000040667137,0.0000909333,0.00005789808,0.0004436901,0.000018679986,0.0003036554,0.00006470512,0.00005384673,0.0000032508062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003099843,0.0002330464,0.00027277955,0.000009605998,0.0001787584,0.000008355957,0.00021470102,0.031398967,0.000021290802,0.21043304,0.11934246,0.637577],"study_design_scores_gemma":[0.00028925433,0.00015630946,0.0015024216,0.000004009296,0.00010702619,4.5265656e-7,0.000005267542,0.9873366,0.0000026072016,0.008767926,0.0017133934,0.000114735034],"about_ca_topic_score_codex":0.000004262304,"about_ca_topic_score_gemma":0.000022982023,"teacher_disagreement_score":0.9559376,"about_ca_system_score_codex":0.000012987576,"about_ca_system_score_gemma":0.000044454697,"threshold_uncertainty_score":0.37081525},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15398277,0.000017425553,0.79375726,0.0016755846,0.00046824798,0.00016700772,7.4117895e-7,0.000053823154,0.04987712],"genre_scores_gemma":[0.9970279,0.000001282047,0.00095504837,0.0013376632,0.00013472812,0.0000040047253,6.047399e-7,0.00000390832,0.0005349014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987948,0.00022818951,0.00024049859,0.00024328331,0.00026392128,0.00022929565],"domain_scores_gemma":[0.99559623,0.0033005618,0.000083935876,0.0008978689,0.00005769172,0.00006373692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014686909,0.00009625345,0.00014651974,0.000010032806,0.00024303688,0.0000532135,0.0007527879,0.00004601915,0.00019321003],"category_scores_gemma":[0.00004951916,0.00004398616,0.000075604716,0.00013906098,0.00018906534,0.000046173373,0.000467577,0.00016905055,0.0000809181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013280258,0.00011101118,0.0008367751,0.0000074083664,0.00001231591,0.0000014067161,0.0004574568,0.00039235063,0.000027710317,0.8799904,0.023970138,0.09417976],"study_design_scores_gemma":[0.00011531982,0.00013352424,0.0006321871,0.0000087574945,0.000005071177,0.0000075869443,0.00004655906,0.98079735,0.00023879041,0.01092818,0.006999839,0.000086842825],"about_ca_topic_score_codex":0.00002226764,"about_ca_topic_score_gemma":0.0000078187395,"teacher_disagreement_score":0.980405,"about_ca_system_score_codex":0.000020722073,"about_ca_system_score_gemma":0.00003135907,"threshold_uncertainty_score":0.21155143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014293437,0.000011808628,0.97375894,0.0030645232,0.0002433154,0.0003681345,0.0001738588,0.000082868384,0.020867206],"genre_scores_gemma":[0.92522025,0.0000025506747,0.07220936,0.0012474695,0.00007521382,0.000029689254,0.00018032586,0.000009298696,0.001025825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986022,0.000018898483,0.00020724715,0.0005612475,0.000312454,0.00029796976],"domain_scores_gemma":[0.99775237,0.00023208794,0.00015205175,0.0014214106,0.00023126283,0.00021079782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044063135,0.00015121931,0.00017083877,0.000058005833,0.00033928145,0.00053809845,0.0017208599,0.00006095973,0.000107979125],"category_scores_gemma":[0.000029034254,0.00011857015,0.000032061387,0.00008408514,0.00016302973,0.00088325,0.00044447338,0.00007635672,0.00003541015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017610686,0.00039568797,0.0040363865,0.00007243496,0.00017905714,0.000121164114,0.00069381855,0.000018186829,0.00014860545,0.4290989,0.17267837,0.39238128],"study_design_scores_gemma":[0.0018058445,0.00044512583,0.015325966,0.0003129956,0.00006127884,0.00017801615,0.00020527992,0.92299706,0.00008325107,0.010836114,0.046802364,0.00094672234],"about_ca_topic_score_codex":0.000017784858,"about_ca_topic_score_gemma":0.000050291692,"teacher_disagreement_score":0.92379093,"about_ca_system_score_codex":0.0000130297285,"about_ca_system_score_gemma":0.00013992118,"threshold_uncertainty_score":0.51888955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017080858,0.0002951401,0.9798083,0.00032330301,0.00041944082,0.0014488689,0.000023523475,0.00015486158,0.00044575683],"genre_scores_gemma":[0.99499166,0.00004804805,0.0034847413,0.00056634285,0.0002131038,0.00032473254,0.00014704818,0.000023817442,0.00020049888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979982,0.00008649344,0.0006524249,0.0004945968,0.00025505247,0.00051323976],"domain_scores_gemma":[0.9980824,0.0008347702,0.00023566006,0.00036512117,0.00033712923,0.00014489827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038555864,0.0002180221,0.00025734946,0.00014222857,0.00018718735,0.00022160256,0.00032025375,0.00013982946,0.00003662445],"category_scores_gemma":[0.000012543006,0.00022190166,0.00008667845,0.00038784262,0.000025952817,0.0011179022,0.00012676528,0.00012941462,0.000025488787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146337725,0.0000359839,0.0002850264,0.000010521309,0.000008350415,0.0000027438657,0.0012863764,0.8144335,0.000017527704,0.0005111825,0.0005364251,0.18285769],"study_design_scores_gemma":[0.00094345416,0.0002033139,0.0006358142,0.000024386123,0.000009674503,0.0000017731719,0.00043514994,0.99157107,0.000007095076,0.002972262,0.0029328505,0.00026315363],"about_ca_topic_score_codex":0.00006704833,"about_ca_topic_score_gemma":0.000040417526,"teacher_disagreement_score":0.9779108,"about_ca_system_score_codex":0.00007981826,"about_ca_system_score_gemma":0.000054906523,"threshold_uncertainty_score":0.9048887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017017545,0.0013511169,0.9550053,0.0031549365,0.00034530094,0.0004400117,0.0000128796255,0.0002078612,0.02246508],"genre_scores_gemma":[0.91903585,0.0009686496,0.076887056,0.00018124325,0.000037399277,0.00007243317,0.00040862284,0.00003130456,0.0023774682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952314,0.0020980046,0.00069878553,0.0010581666,0.0004470064,0.00046666636],"domain_scores_gemma":[0.99607545,0.000529358,0.00043742533,0.0019250732,0.00082726893,0.00020539487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037452995,0.00036768173,0.00041654674,0.00025956228,0.00022397489,0.00094380404,0.0013736468,0.0003773581,0.000016131635],"category_scores_gemma":[0.000067358495,0.0004040619,0.000104607105,0.0005023508,0.00014771197,0.00029392616,0.0023289695,0.00068930606,0.000004696353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020123622,0.0012787848,0.013717793,0.00021684104,0.000062290055,0.00006288468,0.0064637032,0.057966087,0.000046991958,0.30911168,0.006822576,0.6042302],"study_design_scores_gemma":[0.00040307778,3.483513e-7,0.002536676,0.00077217555,0.000014121918,0.0000082036395,0.0000147218725,0.98651576,0.00012484685,0.007510393,0.0017240444,0.000375652],"about_ca_topic_score_codex":0.0016750726,"about_ca_topic_score_gemma":0.0011318609,"teacher_disagreement_score":0.92854965,"about_ca_system_score_codex":0.00014958784,"about_ca_system_score_gemma":0.00023480727,"threshold_uncertainty_score":0.99984115},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012600063,0.00007330025,0.9831548,0.013117643,0.00059934636,0.0006914458,0.000029948196,0.0005421077,0.0005314239],"genre_scores_gemma":[0.88461244,0.00005137951,0.11417475,0.00034862908,0.000018785353,0.0004545336,0.000007036036,0.00002480177,0.0003076612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984404,0.000046718273,0.00034172286,0.00054601155,0.00022222009,0.00040292027],"domain_scores_gemma":[0.995803,0.00019480645,0.00020739394,0.0034308785,0.00022763625,0.00013630009],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00034452952,0.00023732809,0.0002947934,0.0003910788,0.0015890755,0.00019868273,0.0030717058,0.00038169042,0.000013183566],"category_scores_gemma":[0.000010558051,0.00024396418,0.00014561394,0.00036222357,0.00017983197,0.00035693744,0.000037665144,0.00039439957,0.00008599594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020134525,0.00030105043,0.0000044965172,0.000019360969,0.00007995057,0.000013753597,0.0001337253,0.0004305641,0.004801975,0.07337505,0.00025682937,0.9205631],"study_design_scores_gemma":[0.0007132396,0.00040536543,0.000041895048,0.00013668877,0.00010926008,0.00007373622,0.00009226204,0.9210715,0.04237882,0.026075339,0.00835444,0.0005474537],"about_ca_topic_score_codex":0.000016531838,"about_ca_topic_score_gemma":0.00007981582,"teacher_disagreement_score":0.92064095,"about_ca_system_score_codex":0.000070936185,"about_ca_system_score_gemma":0.000056716766,"threshold_uncertainty_score":0.99971074},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28344318,0.0012042489,0.71354514,0.00041760452,0.00021272084,0.00018359325,0.0000014364084,0.000023241944,0.0009688063],"genre_scores_gemma":[0.99767566,0.0003097635,0.0017804811,0.00012171815,0.00004720663,0.00003419962,0.000011143036,0.0000036845968,0.000016167733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989607,0.000090922105,0.00031913246,0.00029196215,0.00018199201,0.00015530766],"domain_scores_gemma":[0.99851155,0.0004448624,0.0006714543,0.00015372092,0.00016687135,0.00005156557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039321353,0.00010745008,0.00016597011,0.00005663675,0.00044538153,0.0003027016,0.0002265072,0.00007116701,0.000002292347],"category_scores_gemma":[0.00014450934,0.000107999,0.000019748082,0.00010300182,0.0001688436,0.0017728931,0.0001362127,0.00013575572,5.547973e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004013998,0.0000821987,0.0025693744,0.000021247293,0.000007659195,0.000012977717,0.023940204,0.00031685227,0.0001282321,0.010084118,0.00013488413,0.9626621],"study_design_scores_gemma":[0.00049067935,0.00011285014,0.025760692,0.00010174856,0.000011758338,0.000019562704,0.006664349,0.9649005,0.000050087256,0.00041382198,0.0012817682,0.00019220846],"about_ca_topic_score_codex":0.000031100695,"about_ca_topic_score_gemma":0.0000029234477,"teacher_disagreement_score":0.96458364,"about_ca_system_score_codex":0.000013585145,"about_ca_system_score_gemma":0.000031969415,"threshold_uncertainty_score":0.44040716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031838787,0.0000668503,0.96920156,0.00040736285,0.00029310503,0.0004652945,0.000012255271,0.00014672428,0.026222957],"genre_scores_gemma":[0.96448964,0.0000135724495,0.03202023,0.0011644284,0.00031246364,0.00009463771,0.000025911108,0.000022538321,0.0018566034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982012,0.000032281194,0.0002424559,0.00059949764,0.00036459416,0.00055996404],"domain_scores_gemma":[0.9984311,0.00034792762,0.0002639492,0.0005440474,0.00016348941,0.00024950906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004424166,0.0002541537,0.00032553228,0.00004955825,0.00080819824,0.0007521872,0.00088526384,0.00013530624,0.00013681214],"category_scores_gemma":[0.00001370984,0.00019493487,0.000106680935,0.000058046164,0.00013663105,0.00062432623,0.00029914748,0.00022419421,0.000039680308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082637195,0.0004049612,0.010179207,0.000044829954,0.0005989061,0.0005313158,0.0016591587,0.0005341772,0.000093313305,0.021656014,0.017867487,0.94560426],"study_design_scores_gemma":[0.001392412,0.00025373697,0.00076774345,0.00014754265,0.000039161427,0.00006389019,0.00008536141,0.9956793,0.000011743326,0.0005833155,0.0006258222,0.00034996532],"about_ca_topic_score_codex":0.00002569101,"about_ca_topic_score_gemma":0.000020686035,"teacher_disagreement_score":0.99514514,"about_ca_system_score_codex":0.000025554446,"about_ca_system_score_gemma":0.00009172559,"threshold_uncertainty_score":0.7949213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1260343,0.00056400045,0.7961545,0.01622076,0.00086614775,0.00048177585,0.000019447085,0.0003298152,0.059329253],"genre_scores_gemma":[0.9966156,0.00024118007,0.0020755723,0.0006787682,0.0000538105,0.000036768586,0.000023290628,0.000012944855,0.00026207636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873114,0.00015473596,0.0002790785,0.0003108403,0.00020770748,0.0003165106],"domain_scores_gemma":[0.9962354,0.00048170422,0.00021432657,0.0028522026,0.00009752132,0.00011887767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000373989,0.00016635335,0.0002297824,0.00009400963,0.0010959237,0.0004431039,0.0039725457,0.000115608804,0.000018936335],"category_scores_gemma":[0.000028687404,0.00016707758,0.00008047356,0.00014179536,0.00025662204,0.00036660052,0.0009782753,0.00062382047,0.00003174362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047944806,0.00046404733,0.010972222,0.000013214162,0.00006138394,0.00007755327,0.0024439786,0.00021450857,0.0000697514,0.68150157,0.0037043374,0.30042946],"study_design_scores_gemma":[0.00044354,0.000037917973,0.011482851,0.00016807266,0.00000523231,0.000013688944,0.00008324427,0.98543715,0.0000027313915,0.0013269075,0.0007975278,0.00020114661],"about_ca_topic_score_codex":0.00010874988,"about_ca_topic_score_gemma":0.0003066343,"teacher_disagreement_score":0.98522264,"about_ca_system_score_codex":0.00006696101,"about_ca_system_score_gemma":0.00008111554,"threshold_uncertainty_score":0.84290695},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036014553,0.000119136515,0.96269614,0.00048188315,0.00045744944,0.00015026136,0.0000093102635,0.000029095643,0.000042202326],"genre_scores_gemma":[0.9508238,0.000008253768,0.048589773,0.000118871736,0.0004096436,0.000002136479,0.000032912758,0.000008518687,0.000006080709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983316,0.00006259016,0.00074522675,0.0002705293,0.00022298191,0.00036704892],"domain_scores_gemma":[0.99768245,0.00023828528,0.0010417139,0.0003771818,0.00039542463,0.00026494477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010471294,0.00017250942,0.00034786618,0.000094901865,0.00065137143,0.00059445144,0.0006764018,0.000120513796,0.000001400908],"category_scores_gemma":[0.000098012606,0.00015917177,0.00007953937,0.00012369022,0.000076059114,0.00039805137,0.00012375052,0.00030781573,2.5957246e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003648776,0.0005078294,0.21279387,0.00012903825,0.000086641274,0.00031127894,0.00038220224,0.59528875,0.000041202442,0.017819127,0.0009856109,0.17128956],"study_design_scores_gemma":[0.0016475561,0.00024377559,0.023735013,0.0003024899,0.000019134566,0.00006422049,0.000048723286,0.9729051,9.97284e-7,0.00079450407,0.00008222775,0.0001562783],"about_ca_topic_score_codex":0.000018883962,"about_ca_topic_score_gemma":0.000009608882,"teacher_disagreement_score":0.9148093,"about_ca_system_score_codex":0.000064230786,"about_ca_system_score_gemma":0.00029405285,"threshold_uncertainty_score":0.6490836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2670068,0.000021407257,0.73249567,0.000064064094,0.00011950912,0.00004779957,0.0000028522882,0.000023607068,0.00021829725],"genre_scores_gemma":[0.97024876,0.000026302108,0.02949995,0.000056831384,0.00007663172,0.0000024633289,0.000005828171,0.000008023404,0.00007523153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864477,0.00017226412,0.00027532005,0.0003869093,0.00021715135,0.0003036061],"domain_scores_gemma":[0.9989154,0.00011701067,0.00023099978,0.00055874925,0.00006445336,0.00011341664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004409355,0.00014367954,0.00039230002,0.00020183463,0.00026999443,0.00014963953,0.00047567763,0.0001243053,0.000003850115],"category_scores_gemma":[0.000003488981,0.00013656287,0.00007532915,0.00033156513,0.00016391494,0.000101104466,0.00015491711,0.00010575321,4.927668e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028648526,0.00012732053,0.00069574744,0.0000037071366,0.00019104622,0.00020667489,0.00087266497,0.31447804,0.000026944881,0.0039554248,0.000038101356,0.6793757],"study_design_scores_gemma":[0.00026777663,0.000038569444,0.006140386,0.000007281587,0.000076755336,0.000005093196,0.000039231694,0.9931222,0.000037254893,0.000091480215,0.000017372724,0.0001565927],"about_ca_topic_score_codex":0.00023160006,"about_ca_topic_score_gemma":0.000028045759,"teacher_disagreement_score":0.70324194,"about_ca_system_score_codex":0.000018013383,"about_ca_system_score_gemma":0.000033071436,"threshold_uncertainty_score":0.5568872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000053781514,0.000019642923,0.7762487,0.015608672,0.00008576126,0.00028642148,0.00000845708,0.00009952561,0.20763744],"genre_scores_gemma":[0.8782064,0.00004703728,0.11655525,0.0011879343,0.00006484293,0.00023950872,0.000023393135,0.000005972056,0.003669718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933636,0.000016211929,0.00015695927,0.00021044843,0.00009739597,0.00018264544],"domain_scores_gemma":[0.9957802,0.00028899108,0.0001114033,0.00360552,0.00010419862,0.0001096425],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00024214914,0.00007319065,0.000092420894,0.000032350305,0.0015963939,0.00045016434,0.0029961916,0.00004708379,0.000022818656],"category_scores_gemma":[0.00000857733,0.00006367381,0.000054261996,0.000049748724,0.00010592822,0.00030407737,0.00046427056,0.00008151427,0.000097093194],"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.0000011543262,0.00003871048,0.000029116029,0.0000011165536,0.000004234046,9.931987e-8,0.000010435048,6.312279e-7,9.707829e-7,0.70411104,0.0064467383,0.28935575],"study_design_scores_gemma":[0.00021136434,0.000025767642,0.00015634023,0.0000038392072,0.000003184883,0.0000018821594,0.0000055361297,0.56591815,0.0000033546808,0.06339547,0.37018004,0.00009506854],"about_ca_topic_score_codex":0.0000098500095,"about_ca_topic_score_gemma":0.000023962271,"teacher_disagreement_score":0.87820095,"about_ca_system_score_codex":0.000017793865,"about_ca_system_score_gemma":0.000074320735,"threshold_uncertainty_score":0.9997034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020624455,0.00009868572,0.903486,0.0019360922,0.00016254668,0.00023458431,0.000001024467,0.00004811543,0.09197049],"genre_scores_gemma":[0.8793269,0.00009305128,0.117668204,0.0004785987,0.000015269847,0.000027802158,0.00000527676,0.000005515944,0.0023793802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992931,0.00002024843,0.00016976916,0.00021411084,0.00010764764,0.0001951263],"domain_scores_gemma":[0.99844974,0.00004408267,0.00009965663,0.0013344028,0.000024691983,0.0000473949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024471554,0.00008920115,0.000110851266,0.000044047498,0.00027251686,0.0003518503,0.0013469864,0.000042717296,0.0000208967],"category_scores_gemma":[0.0000022663653,0.00007574998,0.00003265813,0.000038599388,0.000042631138,0.0004490818,0.00062980776,0.00008471223,0.0000075279313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012493768,0.000025158859,0.0016616825,0.000025472362,0.000014653318,0.000008613749,0.00056061754,0.00006658696,0.0000024839028,0.18540786,0.009286584,0.8029278],"study_design_scores_gemma":[0.0010105551,0.000027976526,0.01842557,0.000092240974,0.000009116455,0.000004307359,0.00022926248,0.86826336,0.00000797577,0.055170648,0.056519754,0.00023923712],"about_ca_topic_score_codex":0.000006414967,"about_ca_topic_score_gemma":0.000033190405,"teacher_disagreement_score":0.87726444,"about_ca_system_score_codex":0.000022354487,"about_ca_system_score_gemma":0.00001240981,"threshold_uncertainty_score":0.33929005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015083684,0.00007873116,0.9822757,0.0011059312,0.0002405907,0.00045743378,0.000013994344,0.0002802545,0.00046365548],"genre_scores_gemma":[0.98594624,0.00015206168,0.013115782,0.00013301567,0.000015554237,0.00032403943,0.000011311925,0.000014814025,0.00028717797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888045,0.00004190096,0.00031272418,0.00039897475,0.00007091432,0.00029503994],"domain_scores_gemma":[0.9971317,0.00039172993,0.00020913662,0.002126193,0.00008596733,0.000055265064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030309995,0.00016758576,0.0002590717,0.000245857,0.00039164434,0.00014768691,0.0015172667,0.0002658606,0.000013289461],"category_scores_gemma":[0.000033544617,0.00017410536,0.000044757442,0.00012713636,0.00031875327,0.0002505816,0.000100594254,0.00043162258,0.0000026017178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006947867,0.00012360574,0.00051846885,0.000010049109,0.000051289626,0.000019212226,0.00053422403,0.00039629333,0.000019880737,0.06730249,0.00011940277,0.9308356],"study_design_scores_gemma":[0.0006534108,0.0004699025,0.00022001337,0.00011580654,0.000018590785,0.00005375507,0.00066869706,0.9823728,0.00015335607,0.014254544,0.0008125246,0.0002065496],"about_ca_topic_score_codex":0.00015773461,"about_ca_topic_score_gemma":0.00036440417,"teacher_disagreement_score":0.98197657,"about_ca_system_score_codex":0.000048106274,"about_ca_system_score_gemma":0.000034476245,"threshold_uncertainty_score":0.709981},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08713255,0.030926807,0.83625114,0.008192616,0.00064417004,0.0026343772,0.00012055715,0.0009388114,0.03315895],"genre_scores_gemma":[0.95691526,0.0013937696,0.040584903,0.00024935248,0.00005075622,0.00020298215,0.00003491159,0.00001702214,0.0005510449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868965,0.00015794771,0.00034530176,0.00040862762,0.00010991955,0.00028857146],"domain_scores_gemma":[0.99409485,0.00081408094,0.00054690544,0.0042050937,0.0001927705,0.00014632284],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006537878,0.00019778055,0.00031818837,0.000054329215,0.002306106,0.0008935729,0.002824949,0.00010643895,0.0000027041256],"category_scores_gemma":[0.00004221485,0.00019465992,0.00005682349,0.00006543032,0.00048425404,0.00032783818,0.0028345212,0.00026867894,0.000005118954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024391315,0.00047139355,0.020867402,0.00015159317,0.0001807156,0.0000056127906,0.0046166237,0.00018060637,0.00003170056,0.15796824,0.018342342,0.7971594],"study_design_scores_gemma":[0.0006022191,0.00010974327,0.005929639,0.00029492337,0.000035820456,0.00003956662,0.00052551203,0.88621044,0.0000129750615,0.005147864,0.10072031,0.00037101036],"about_ca_topic_score_codex":0.000102114,"about_ca_topic_score_gemma":0.000103380095,"teacher_disagreement_score":0.88602984,"about_ca_system_score_codex":0.000019497942,"about_ca_system_score_gemma":0.000039430943,"threshold_uncertainty_score":0.99899274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03186481,0.000052664465,0.95404273,0.0018220651,0.00054402684,0.00012685599,0.0000011737405,0.00011504642,0.011430634],"genre_scores_gemma":[0.99660754,0.000026085387,0.0022808795,0.00046473762,0.00025627922,0.0000076938095,0.0000027714211,0.0000085124,0.00034551113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987456,0.00004611728,0.00026947152,0.0003898737,0.00016658954,0.00038233039],"domain_scores_gemma":[0.9991444,0.000098666584,0.00015034882,0.00043170564,0.000060504382,0.00011438204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042948534,0.00015520808,0.00023830337,0.000042035797,0.0007438632,0.00067169144,0.00064789224,0.00014711666,0.000019171672],"category_scores_gemma":[0.000008414687,0.00014055648,0.00003763118,0.000073672156,0.00010849912,0.0005554439,0.00041462178,0.00023106845,0.0000061934343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002835164,0.00009370919,0.08814764,0.000016770005,0.000031652595,0.0004992405,0.00135749,0.0007513994,0.0000029612602,0.16335739,0.0037323204,0.7419811],"study_design_scores_gemma":[0.00047381013,0.0000177297,0.038680546,0.000029818664,0.000004726765,0.000034383218,0.00004343365,0.9591764,9.874772e-7,0.0010435232,0.00029519454,0.00019941833],"about_ca_topic_score_codex":0.00016829527,"about_ca_topic_score_gemma":0.00016388847,"teacher_disagreement_score":0.9647427,"about_ca_system_score_codex":0.000022810407,"about_ca_system_score_gemma":0.00005729128,"threshold_uncertainty_score":0.6477136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08558986,0.00004962448,0.91009766,0.0029388594,0.0009810379,0.00011612147,0.0000020645152,0.000026223519,0.0001985401],"genre_scores_gemma":[0.972472,0.000017487939,0.026484014,0.00039893657,0.0005873445,0.0000012164252,0.0000074814748,0.00001279324,0.000018736193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982975,0.00007645576,0.00057176704,0.0002673791,0.00044848467,0.00033839833],"domain_scores_gemma":[0.99766016,0.0005263101,0.0007255131,0.00019524344,0.00071839726,0.00017440534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014435727,0.00017151366,0.00028645288,0.0003084984,0.00039574134,0.0009911238,0.0009488401,0.000105244224,0.000005109327],"category_scores_gemma":[0.00009605278,0.00016344979,0.000116015115,0.00011389255,0.00007255686,0.00047878365,0.00014019925,0.00040003224,6.4824803e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005675952,0.00029600214,0.054036766,0.000038508206,0.00018571952,0.0006190009,0.00038809745,0.26833802,0.00073332316,0.01809527,0.00051224435,0.65618944],"study_design_scores_gemma":[0.0020762265,0.00016763854,0.0023093987,0.0003880723,0.000013513903,0.000086849956,0.000040068844,0.9941206,0.00010911539,0.00040378756,0.00011813063,0.0001666064],"about_ca_topic_score_codex":0.000071313516,"about_ca_topic_score_gemma":0.000016226753,"teacher_disagreement_score":0.8868821,"about_ca_system_score_codex":0.000117390126,"about_ca_system_score_gemma":0.00040676328,"threshold_uncertainty_score":0.955743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013578673,0.00031765137,0.9336029,0.05384951,0.0005236852,0.0014554105,0.000055143213,0.00040112977,0.00843667],"genre_scores_gemma":[0.75685245,0.00004368799,0.22143942,0.0061162133,0.001757989,0.001114334,0.00021281696,0.00006791388,0.012395173],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647653,0.000077019315,0.0005938439,0.0010217405,0.0009932789,0.0008376107],"domain_scores_gemma":[0.9949333,0.00039854113,0.0001992863,0.0017784003,0.0019771666,0.0007132962],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016039817,0.00040438876,0.00041979123,0.00023981169,0.0013667062,0.00072134554,0.0016873609,0.00020574393,0.000021802734],"category_scores_gemma":[0.00006186002,0.00041125214,0.00010548921,0.0012780114,0.00013808797,0.0002388483,0.0008173257,0.00038373325,0.00013541662],"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.000033353896,0.000058210077,0.000351515,0.000017949433,0.00004724947,0.0000010956209,0.0025163745,0.0012396856,0.00007645938,0.02361428,0.36394963,0.6080942],"study_design_scores_gemma":[0.0003182106,0.00011403511,0.0007065213,0.000077769095,0.000040395204,0.000017453516,0.00013715483,0.11535869,0.00003276853,0.008339489,0.8743849,0.00047263887],"about_ca_topic_score_codex":0.000022811875,"about_ca_topic_score_gemma":0.00004274175,"teacher_disagreement_score":0.7554946,"about_ca_system_score_codex":0.000089189336,"about_ca_system_score_gemma":0.000117503354,"threshold_uncertainty_score":0.99993336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1095233,0.000045278062,0.878583,0.010713472,0.00019125809,0.00020797369,0.000005501844,0.00008881176,0.0006414215],"genre_scores_gemma":[0.9448125,0.00020135682,0.05325519,0.0015191089,0.000027577718,0.00006992469,0.000075452306,0.000007614405,0.000031271473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863744,0.0001795063,0.00047780218,0.0002002066,0.00022298342,0.0002820546],"domain_scores_gemma":[0.99764407,0.00027387327,0.00019789956,0.0017689147,0.000041824987,0.00007342735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004923949,0.00014798353,0.00015923385,0.00020934516,0.00024191385,0.000110304805,0.0017660984,0.000078311976,0.000011018845],"category_scores_gemma":[0.000006517114,0.00015789722,0.0000446594,0.0003447608,0.0002804347,0.0010537121,0.00030627576,0.0002561136,0.00018320644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029698336,0.00030654317,0.0018746491,0.00002948466,0.000044517248,0.000011186131,0.008523375,0.010829298,0.007409588,0.014344996,0.010938778,0.9456579],"study_design_scores_gemma":[0.00019037383,0.000024382423,0.001281627,0.00005401019,0.000004545971,0.000009137477,0.00007951097,0.9945621,0.000084723026,0.00012747015,0.0033961565,0.00018597557],"about_ca_topic_score_codex":0.00005590259,"about_ca_topic_score_gemma":0.000023185903,"teacher_disagreement_score":0.98373276,"about_ca_system_score_codex":0.00021977823,"about_ca_system_score_gemma":0.000037914542,"threshold_uncertainty_score":0.64388615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031373814,0.000041594198,0.9615439,0.001179493,0.000822515,0.00045040902,0.000012939414,0.00029707194,0.00427824],"genre_scores_gemma":[0.98660845,0.00001999449,0.010041896,0.0004985687,0.00017304605,0.00006639836,0.000018532784,0.000017140437,0.0025559727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982276,0.000024553694,0.00035152977,0.0006530658,0.00020960794,0.0005336356],"domain_scores_gemma":[0.9977482,0.0000919577,0.00018790341,0.0015391164,0.00023133635,0.00020146249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004419754,0.00022085168,0.0003223859,0.00003963214,0.00076297246,0.0005990742,0.0016541157,0.00011967213,0.00006639101],"category_scores_gemma":[0.00002160033,0.00019448649,0.00012757187,0.000048124137,0.00005254771,0.00073112,0.0004333618,0.0001507969,0.00004336124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033115307,0.0011198506,0.0055090683,0.00052547094,0.00034176858,0.00024349286,0.0016621882,0.0044653113,0.00069175364,0.27171627,0.030696435,0.68269724],"study_design_scores_gemma":[0.00060145,0.0000630008,0.00009859634,0.000046630645,0.000009132587,0.000012718999,0.000027931104,0.9938944,0.00010535806,0.004125142,0.0007493319,0.00026632927],"about_ca_topic_score_codex":0.00012673023,"about_ca_topic_score_gemma":0.000030284082,"teacher_disagreement_score":0.98942906,"about_ca_system_score_codex":0.000045269066,"about_ca_system_score_gemma":0.000090671085,"threshold_uncertainty_score":0.7930929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061421003,0.000021553256,0.9774496,0.0002209494,0.00041372172,0.00038911283,2.8023922e-7,0.00020920236,0.015153491],"genre_scores_gemma":[0.98864925,0.00000362352,0.009551302,0.00044686822,0.0006478176,0.00007411449,0.0000048499537,0.000010968608,0.0006111994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855673,0.00009449307,0.00034356295,0.00039306417,0.00020167758,0.00041049064],"domain_scores_gemma":[0.9991976,0.000086874636,0.000116694864,0.00035102523,0.00014704517,0.00010072868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064543117,0.0001418166,0.00017197656,0.00008822125,0.0003035412,0.00015028958,0.00056306674,0.000121409845,0.00007956716],"category_scores_gemma":[0.000014968688,0.00013388741,0.00003424083,0.00064595044,0.00009475582,0.0003167828,0.00024852142,0.0002529984,0.000058731777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002214752,0.00016068424,0.0013362099,0.000021108139,0.0000128832135,0.00005606689,0.0021497114,0.00040794976,0.00004731879,0.06444011,0.0039665457,0.92737925],"study_design_scores_gemma":[0.00023581565,0.00011338799,0.00070383825,0.000023016803,0.0000028426064,0.000013732255,0.00007247237,0.99412036,0.000009765055,0.0028437444,0.0016736471,0.00018738423],"about_ca_topic_score_codex":0.000042087555,"about_ca_topic_score_gemma":0.00001954691,"teacher_disagreement_score":0.9937124,"about_ca_system_score_codex":0.00005787747,"about_ca_system_score_gemma":0.00013229507,"threshold_uncertainty_score":0.54597706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028606217,0.000020521018,0.4994042,0.0004059312,0.41841304,0.00048649847,0.000003831236,0.00026238622,0.052397374],"genre_scores_gemma":[0.58105195,0.00004342169,0.00042552466,0.000515655,0.41765672,0.000038370337,0.000004490272,0.000021783575,0.00024210227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973086,0.00012004272,0.0004872879,0.00073193276,0.0006666501,0.0006854852],"domain_scores_gemma":[0.9988902,0.00008372004,0.00025012504,0.00046120305,0.00018124365,0.0001334805],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005116087,0.0002829551,0.00032680543,0.0002366424,0.00048160492,0.001320705,0.0023474328,0.00025433998,0.00009809566],"category_scores_gemma":[0.0000029957762,0.00029526287,0.00010674698,0.0010470832,0.00013405352,0.0019659668,0.00054703356,0.00038068817,0.00005767757],"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.000118239026,0.00012854216,0.0023126418,0.000030198216,0.00006363697,0.00015926246,0.0009426158,0.00022824884,0.00001605761,0.0010002275,0.7872184,0.20778194],"study_design_scores_gemma":[0.0052230577,0.00039233456,0.020051003,0.00029311317,0.00014578048,0.000046760808,0.00023054123,0.27844822,0.0009223849,0.020562759,0.6712547,0.0024293358],"about_ca_topic_score_codex":0.0001446576,"about_ca_topic_score_gemma":0.0002727382,"teacher_disagreement_score":0.5524457,"about_ca_system_score_codex":0.00017859814,"about_ca_system_score_gemma":0.000112135,"threshold_uncertainty_score":0.99994993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026041148,0.00008051281,0.99646455,0.00008423381,0.00017229062,0.00038221152,0.000015993493,0.00010283417,0.000093231814],"genre_scores_gemma":[0.7685109,0.000015788568,0.23106216,0.0000047089957,0.00012215368,0.00016347985,0.000011346138,0.000011391945,0.00009808946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987384,0.000010710715,0.0005752939,0.00027847555,0.00017628132,0.00022083582],"domain_scores_gemma":[0.99871045,0.00014352564,0.00020270918,0.00044883424,0.0004155197,0.0000789787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024813795,0.00012963056,0.00019972732,0.00016382136,0.0001325202,0.000021541187,0.00058535195,0.00006286498,0.000015014985],"category_scores_gemma":[0.00004785706,0.00014282994,0.00008674634,0.0005823993,0.00006945937,0.00012432839,0.00008689292,0.00010065485,0.000010621549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006453208,0.000049176375,0.0000036126798,0.000019321356,0.000014677047,4.8127077e-8,0.00035924278,0.700624,0.003241334,0.23952796,0.000039277733,0.056114893],"study_design_scores_gemma":[0.000022204946,0.000062178304,0.0000033961387,0.000017535564,0.000016493032,8.28609e-7,0.00002609855,0.9769906,0.005009916,0.017581668,0.0001373077,0.00013181004],"about_ca_topic_score_codex":0.000019169818,"about_ca_topic_score_gemma":0.0000051523107,"teacher_disagreement_score":0.76590675,"about_ca_system_score_codex":0.000017833667,"about_ca_system_score_gemma":0.00007461546,"threshold_uncertainty_score":0.5824436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012205658,0.00006157562,0.985074,0.00018693761,0.0008780266,0.00053954445,0.000014892406,0.00020096076,0.00083843584],"genre_scores_gemma":[0.9876099,0.0000049307073,0.010143898,0.00092312746,0.0009148218,0.00011902198,0.00002804738,0.000016989938,0.00023925085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840736,0.000062899235,0.00031114242,0.00046426593,0.00026617505,0.00048814891],"domain_scores_gemma":[0.9987949,0.00016430988,0.00019693839,0.00040828186,0.0003058853,0.00012969798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039111477,0.00017882587,0.00024228224,0.00011097256,0.0003982266,0.00036694497,0.0010968779,0.00016427858,0.000032908003],"category_scores_gemma":[0.000008115973,0.00017310599,0.00012238092,0.00076171255,0.00012754378,0.0006171133,0.000100714184,0.000113154114,0.000021051428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020038587,0.00037145588,0.0003538327,0.000052630086,0.00007329751,0.000009126164,0.00043437927,0.1599433,0.000047348556,0.0025457304,0.08093415,0.7550344],"study_design_scores_gemma":[0.0006264592,0.00008611605,0.000070423135,0.000011389451,0.000020674348,0.0000010180323,0.0000021026344,0.9949538,0.0002623615,0.002829744,0.00091546954,0.00022041026],"about_ca_topic_score_codex":0.000018324954,"about_ca_topic_score_gemma":0.000007886359,"teacher_disagreement_score":0.97540426,"about_ca_system_score_codex":0.000059706585,"about_ca_system_score_gemma":0.00017764956,"threshold_uncertainty_score":0.70590574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009456464,0.00668118,0.9328497,0.003886674,0.04972718,0.00042092413,0.000009880238,0.0003131094,0.005165722],"genre_scores_gemma":[0.698516,0.002229086,0.029605526,0.0011377662,0.26645672,0.000046636076,0.00011177788,0.000055896253,0.0018405612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963443,0.0007530447,0.0006126131,0.0008973405,0.0007561795,0.0006365191],"domain_scores_gemma":[0.9972788,0.00021938844,0.00020302387,0.00091304723,0.00095736043,0.00042837005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019237085,0.0003241929,0.00042923624,0.0002794698,0.00089515717,0.0010174447,0.00081734336,0.0002484876,0.000014462533],"category_scores_gemma":[0.0000052510077,0.00029525836,0.000057563542,0.0002967075,0.00036847018,0.00044553156,0.000578679,0.00032897652,0.0000574101],"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.0000051379848,0.000043182437,0.000013778811,0.0000664452,0.000040371895,0.00008979541,0.0036735178,0.00002352967,0.000040249168,0.40047285,0.37015098,0.22538017],"study_design_scores_gemma":[0.00023691633,0.00028176568,0.000036553727,0.000055604294,0.000005445604,0.00019039458,0.0005307285,0.5827659,0.000011962472,0.000053943608,0.4155823,0.00024850818],"about_ca_topic_score_codex":0.000017922155,"about_ca_topic_score_gemma":0.000011902095,"teacher_disagreement_score":0.90324414,"about_ca_system_score_codex":0.000056712914,"about_ca_system_score_gemma":0.00027419542,"threshold_uncertainty_score":0.99994993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006002197,0.00046588352,0.9936728,0.0029207715,0.00022382429,0.00020398332,0.00006599842,0.00023867382,0.0016078834],"genre_scores_gemma":[0.98414373,0.0030313523,0.011664743,0.00041495217,0.00016028728,0.000082376144,0.0002795961,0.00003416026,0.00018878192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796,0.00051230664,0.0004576926,0.00038622296,0.0003052812,0.00037850402],"domain_scores_gemma":[0.9933554,0.0008039858,0.00026255392,0.0051549184,0.00029200062,0.00013114378],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00046996117,0.00029286733,0.00032326864,0.00019555785,0.0034649826,0.00029601497,0.004310876,0.00015773975,0.000016557842],"category_scores_gemma":[6.1824847e-9,0.00028113692,0.000058283185,0.0008257878,0.0010798002,0.0007743749,0.00028874745,0.000556219,0.000006618467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003245486,0.000230755,0.000053958942,0.0000063222424,0.000090770256,0.0000010976478,0.0013061165,6.036371e-8,0.000016243115,0.00014823907,0.00029559078,0.9978184],"study_design_scores_gemma":[0.00042510495,0.00012893773,0.0000040495092,0.00018860504,0.000084419655,0.00002839348,0.00033421884,0.9863035,0.000029396804,0.00061010406,0.011522462,0.00034078158],"about_ca_topic_score_codex":0.0009286846,"about_ca_topic_score_gemma":0.0042091403,"teacher_disagreement_score":0.9974776,"about_ca_system_score_codex":0.000060241196,"about_ca_system_score_gemma":0.00008909583,"threshold_uncertainty_score":0.99996406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28557038,0.00013366941,0.7110661,0.000021395737,0.0011549476,0.00017978752,0.0000036188521,0.00014678715,0.0017232558],"genre_scores_gemma":[0.96945953,0.0000013052799,0.03032488,0.00008678136,0.00007380553,8.894759e-7,0.0000038712437,0.000016781383,0.000032122956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973229,0.0005284496,0.00087848573,0.0004186125,0.00042676975,0.00042473627],"domain_scores_gemma":[0.9968767,0.0010636833,0.00081540755,0.00081637886,0.00031284758,0.00011494678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024428486,0.00023077708,0.0005860394,0.00021804812,0.0001704157,0.00006450707,0.0011343892,0.00010693814,0.000003412697],"category_scores_gemma":[0.000021714939,0.00021341599,0.00015669774,0.0005524748,0.00057859876,0.000100247285,0.00019649946,0.00015592473,0.000010796268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014305151,0.00027058495,0.0021651012,0.0008583566,0.00028156093,0.000050900282,0.0058562965,0.034035273,0.0028453118,0.67153794,0.00041504254,0.28154057],"study_design_scores_gemma":[0.00036674386,0.00026599775,0.00017875696,0.0006528762,0.000017902063,0.00003091771,0.00014286932,0.9899342,0.00039608494,0.0077733975,0.00002318918,0.00021705052],"about_ca_topic_score_codex":0.00005323656,"about_ca_topic_score_gemma":9.283971e-7,"teacher_disagreement_score":0.95589894,"about_ca_system_score_codex":0.00003809702,"about_ca_system_score_gemma":0.0001555602,"threshold_uncertainty_score":0.87028515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040949833,0.00090279157,0.94529533,0.000071957766,0.009070162,0.00060933933,0.000001675745,0.00031836279,0.0027805641],"genre_scores_gemma":[0.9726945,0.000078538586,0.012787512,0.0008363265,0.013110053,0.00020214742,0.000006705016,0.00003812143,0.00024607818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738,0.00008309939,0.00054875656,0.0006641812,0.00022409228,0.0010998307],"domain_scores_gemma":[0.998425,0.00049313763,0.00017508131,0.00059359305,0.000109036235,0.00020413133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009178389,0.00027570376,0.000395107,0.0000967282,0.00033317917,0.00019763735,0.0008408964,0.00020245077,0.000014427301],"category_scores_gemma":[0.000006393268,0.0002807374,0.00013521245,0.0008401127,0.00010844317,0.00036565907,0.000113028065,0.0002771046,0.000037679052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011086912,0.00010273346,0.0005985811,0.00002346421,0.00003649683,0.000063379266,0.00076306745,0.410623,0.000016868815,0.0023517525,0.09370594,0.49160382],"study_design_scores_gemma":[0.0005648947,0.00024287375,0.00009449894,0.00016126723,0.00000967614,0.00001855769,0.000033719814,0.9775717,0.000014203953,0.0016384495,0.019297075,0.00035307265],"about_ca_topic_score_codex":0.000005920129,"about_ca_topic_score_gemma":0.00004477319,"teacher_disagreement_score":0.9325078,"about_ca_system_score_codex":0.000064262254,"about_ca_system_score_gemma":0.00008481249,"threshold_uncertainty_score":0.9999645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08616557,0.000034588425,0.9092483,0.00020438577,0.0010822411,0.00039657747,0.000005217079,0.000645024,0.002218118],"genre_scores_gemma":[0.9414225,0.0000042915767,0.05328194,0.0043081334,0.0008262564,0.000030719493,0.000005183792,0.00004733123,0.000073621726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970582,0.00013612075,0.0005652915,0.000910952,0.00051813485,0.0008112603],"domain_scores_gemma":[0.9981403,0.00024783716,0.0002735822,0.0006333106,0.0004052467,0.00029975473],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00041488023,0.00046257154,0.00044179976,0.0002210332,0.0015286345,0.00060522964,0.0014032715,0.0001954702,0.00004008762],"category_scores_gemma":[1.6966457e-7,0.00040829743,0.00012455104,0.0014566301,0.000083542065,0.00059111405,0.00003354057,0.00056551973,0.00015977894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016594106,0.00034306277,0.00024053341,0.0002590798,0.00022028723,0.000055484175,0.01748281,0.18361966,0.00016256927,0.00046251048,0.00009639986,0.7968916],"study_design_scores_gemma":[0.0004472835,0.0004943074,0.00010673918,0.0004212538,0.00004568976,0.000040430066,0.001265879,0.9949527,0.00027925058,0.00003506433,0.0014020723,0.000509333],"about_ca_topic_score_codex":0.0002976335,"about_ca_topic_score_gemma":0.0011699111,"teacher_disagreement_score":0.8559663,"about_ca_system_score_codex":0.00007536757,"about_ca_system_score_gemma":0.00008285783,"threshold_uncertainty_score":0.99983686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039297678,0.0000075944686,0.98513216,0.0002382071,0.00040306532,0.00050118606,0.000021613068,0.00031879483,0.009447601],"genre_scores_gemma":[0.96871406,0.0000033566748,0.030179469,0.0004968048,0.00011388988,0.000032465523,0.00041897825,0.000006239573,0.000034745146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998827,0.000016620315,0.00040637286,0.00021200553,0.00031544865,0.00022254288],"domain_scores_gemma":[0.9991669,0.00009261851,0.00013568815,0.00026960834,0.00021423664,0.00012096344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037036277,0.00014406962,0.000139655,0.0000911716,0.0002234832,0.0001332052,0.00023876618,0.00012851485,0.000013411608],"category_scores_gemma":[0.0000012891471,0.00012026172,0.00007922835,0.00022243257,0.000029118142,0.0011964355,0.000003767213,0.00007923003,0.000045248904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002566109,0.00006207201,0.000058272166,0.0002916959,0.0000103089615,0.0000027710655,0.0024214846,0.00029884308,0.000044411303,0.17085087,0.0012082825,0.82449436],"study_design_scores_gemma":[0.00070864824,0.0003357685,0.00015970634,0.00014196557,0.000010708325,0.0000020202256,0.000075495875,0.974404,0.0012349406,0.0015169622,0.02124696,0.00016281978],"about_ca_topic_score_codex":0.0000143335365,"about_ca_topic_score_gemma":0.0000045649927,"teacher_disagreement_score":0.9741052,"about_ca_system_score_codex":0.000057755227,"about_ca_system_score_gemma":0.00007616877,"threshold_uncertainty_score":0.49041307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001963459,0.0013877274,0.99165994,0.000030323139,0.0006524994,0.00050077407,2.4974963e-7,0.00019451256,0.005554349],"genre_scores_gemma":[0.8218868,0.0021264695,0.07253423,0.0015844563,0.0083374,0.00036193436,0.00012932334,0.00048355185,0.09255587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.000010096549,0.0005014405,0.00069001334,0.00025286418,0.0006629392],"domain_scores_gemma":[0.99918336,0.00022162547,0.00014127055,0.0002590937,0.000057838948,0.00013683431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021579996,0.000446088,0.0006090608,0.00022443692,0.000108817185,0.00018718475,0.0004775637,0.00041118957,0.0000092967275],"category_scores_gemma":[0.0000020382247,0.0004797177,0.00017785153,0.00011022398,0.000023561257,0.00013094665,0.00039993008,0.00092597137,0.0000074600935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013823944,0.000011418629,0.000015057847,0.00007061554,0.00006123483,0.000031721676,0.00008066297,0.52408284,0.000001154632,0.15836424,0.0002762369,0.316991],"study_design_scores_gemma":[0.00041482344,0.0002293873,0.000034855606,0.000102736885,0.000017172866,0.000017251592,2.71394e-7,0.943689,0.0000010596833,0.00060972845,0.054353688,0.0005300179],"about_ca_topic_score_codex":0.00000324318,"about_ca_topic_score_gemma":6.9090277e-7,"teacher_disagreement_score":0.9191257,"about_ca_system_score_codex":0.000116441806,"about_ca_system_score_gemma":0.000059975362,"threshold_uncertainty_score":0.99976546},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7561714,0.00020894427,0.20577002,0.005304379,0.0014447222,0.000376789,0.00005373254,0.00052449905,0.030145507],"genre_scores_gemma":[0.9880391,0.000054965352,0.009654336,0.0018501808,0.00004558667,0.0000029414255,0.00004862576,0.000008831885,0.00029543162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983376,0.00006888309,0.00026377817,0.00063712226,0.00021587034,0.00047674723],"domain_scores_gemma":[0.9977849,0.00014053554,0.00016562617,0.001786,0.000025442732,0.00009749795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021318701,0.00016395029,0.00029136808,0.00010635173,0.000041020077,0.00008351122,0.0024668053,0.00006415818,0.000054496006],"category_scores_gemma":[0.000022472052,0.00014393746,0.00003256237,0.00059523835,0.0005255168,0.00041116215,0.00118705,0.00034001307,0.0003735657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001917118,0.000039243856,0.15254767,0.000006893318,0.000029145447,0.0001326321,0.00029369205,0.000086082866,0.000058998732,0.007848202,0.006651506,0.8322868],"study_design_scores_gemma":[0.0018096062,0.0010167881,0.17354247,0.00010753182,0.00002159585,0.00015235023,0.0029624412,0.7433442,0.0000686376,0.005641439,0.069883786,0.0014491673],"about_ca_topic_score_codex":0.0014400971,"about_ca_topic_score_gemma":0.00009309228,"teacher_disagreement_score":0.8308376,"about_ca_system_score_codex":0.00004179412,"about_ca_system_score_gemma":0.00009725324,"threshold_uncertainty_score":0.58695996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013624236,0.000029657,0.95601285,0.0017977128,0.00025345106,0.0002873956,0.00003143398,0.00017548776,0.04004961],"genre_scores_gemma":[0.40848598,0.00004735811,0.56652546,0.009344349,0.0006398858,0.000026525326,0.000094030875,0.000024799987,0.014811604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988698,0.000020035593,0.00014141791,0.0005268306,0.00016675358,0.00027517133],"domain_scores_gemma":[0.9985548,0.000093998904,0.00004315377,0.0011422747,0.000046154626,0.000119568496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020654367,0.00013761075,0.00013131081,0.00006955203,0.00016569768,0.00019474933,0.0010316345,0.00004690094,0.000034131357],"category_scores_gemma":[8.262861e-7,0.000104712984,0.00001886933,0.00015072325,0.000059898764,0.00015568496,0.00080764724,0.00006304568,0.0000444006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001219336,0.00009960031,0.0002384173,0.00020443073,0.00012620105,0.000042360472,0.00059149496,0.0000488188,0.000013818403,0.14346339,0.054644212,0.8004053],"study_design_scores_gemma":[0.00048436804,0.00022489588,0.00013248142,0.000043247128,0.000019119196,0.000016087753,0.00009711238,0.746196,0.000048576898,0.008152621,0.24439107,0.00019444498],"about_ca_topic_score_codex":0.000019490268,"about_ca_topic_score_gemma":0.00004576512,"teacher_disagreement_score":0.8002109,"about_ca_system_score_codex":0.000004196048,"about_ca_system_score_gemma":0.000015191867,"threshold_uncertainty_score":0.42700717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010771436,0.0006576794,0.9925387,0.00045478862,0.0010796865,0.0004974281,0.000005305483,0.00020052626,0.0034887393],"genre_scores_gemma":[0.9934298,0.00016619197,0.0037272586,0.0011353344,0.00033039413,0.00008964286,0.00016533621,0.000041261184,0.00091482536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726826,0.00018436465,0.00069934997,0.00068546465,0.00028767745,0.0008748577],"domain_scores_gemma":[0.99713814,0.00074997265,0.00031861797,0.0014245228,0.00014050952,0.00022822681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010024323,0.0003256559,0.00047101476,0.00012626211,0.00022043142,0.00020303538,0.0014468516,0.00032073434,0.000029885157],"category_scores_gemma":[0.000004920132,0.00033009818,0.0001572495,0.0005993369,0.00006692911,0.00021454268,0.00052214344,0.00042125475,0.0000129987275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006291078,0.00014972915,0.0024034542,0.00002345214,0.000035901634,0.000031690397,0.00021655344,0.59794104,0.0000017091678,0.07293806,0.0046288744,0.32156664],"study_design_scores_gemma":[0.00079708576,0.000090795715,0.00023561511,0.00017339435,0.000013707181,0.000015876616,0.000041783285,0.9929495,5.9777506e-7,0.0012347546,0.0040528746,0.0003940254],"about_ca_topic_score_codex":0.00020751529,"about_ca_topic_score_gemma":0.00010229429,"teacher_disagreement_score":0.9923526,"about_ca_system_score_codex":0.0001096116,"about_ca_system_score_gemma":0.00011984623,"threshold_uncertainty_score":0.9999151},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.1186396e-7,0.0030297185,0.99262124,0.00073711434,0.000037232297,0.0025759994,0.00014982723,0.00050196855,0.00034639303],"genre_scores_gemma":[0.5476229,0.010068884,0.4378418,0.00017466217,0.000071517294,0.002019859,0.0011442292,0.0001421411,0.00091401296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868727,0.00001737455,0.00037335936,0.0005567473,0.00012490158,0.00024033753],"domain_scores_gemma":[0.99441564,0.0013259158,0.00027165556,0.003858726,0.00008241172,0.000045624583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025674028,0.00037308675,0.0004999549,0.00017907709,0.00016993494,0.00014533015,0.0022908396,0.0005224285,6.7659676e-7],"category_scores_gemma":[0.00007874908,0.00032415387,0.00003105016,0.00007590918,0.00022413554,0.00013169624,0.002512026,0.0005561082,2.7567341e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018012412,0.000023509887,0.0000052890828,0.00022380963,0.000097558855,0.0000034278546,0.000031283413,0.0038507478,0.000029624547,0.36870545,0.00021655847,0.62679476],"study_design_scores_gemma":[0.00017863736,0.00023239962,7.1583537e-7,0.00076113123,0.000052959196,0.00002521208,0.0000052126047,0.9781905,0.000026153259,0.0075821956,0.012593268,0.0003516258],"about_ca_topic_score_codex":0.0000030282963,"about_ca_topic_score_gemma":0.000002276107,"teacher_disagreement_score":0.9743397,"about_ca_system_score_codex":0.000017298496,"about_ca_system_score_gemma":0.00008365308,"threshold_uncertainty_score":0.999921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97314805,0.0010046476,0.024449058,0.00080967066,0.0002146118,0.00005510608,0.0000013712406,0.000016746857,0.00030074178],"genre_scores_gemma":[0.9944684,0.0012720899,0.0041985186,0.000032719265,0.0000054570237,0.0000011035324,9.324679e-7,0.000002616039,0.000018175195],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99917877,0.000029688708,0.00042457567,0.0001026681,0.00016886434,0.00009542696],"domain_scores_gemma":[0.99918085,0.000115669,0.00036454885,0.00017118746,0.00015428847,0.000013457687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036722262,0.0000719965,0.00019142916,0.00030545465,0.000009035272,0.000035369885,0.0009880948,0.000085130174,0.0000042967026],"category_scores_gemma":[0.000010334297,0.00006212626,0.000029548653,0.00014204634,0.000118028336,0.0002334097,0.0002873003,0.00021482447,0.0000012549839],"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.000045254495,0.00010637179,0.67088956,0.000025046424,0.000042359097,0.00009857121,0.0004943054,0.00009376611,0.006932243,0.022903137,0.0001085739,0.29826084],"study_design_scores_gemma":[0.004878542,0.00058202964,0.52919143,0.0038586163,0.000022021877,0.00076735835,0.007874038,0.34698012,0.04800705,0.055215016,0.0017838439,0.00083989516],"about_ca_topic_score_codex":0.0000829347,"about_ca_topic_score_gemma":0.00014274284,"teacher_disagreement_score":0.34688637,"about_ca_system_score_codex":0.000031337768,"about_ca_system_score_gemma":0.00004078124,"threshold_uncertainty_score":0.25334352},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11562389,0.00042585933,0.8768763,0.0007526722,0.00089139567,0.00021017728,0.0000040370423,0.0001831102,0.0050325324],"genre_scores_gemma":[0.98053306,0.00036943916,0.018196624,0.00051525433,0.0001659854,0.000018010916,0.000037210688,0.000013659842,0.00015072356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980294,0.000093401046,0.000565328,0.00062341586,0.0003888599,0.00029959157],"domain_scores_gemma":[0.99818546,0.000065719476,0.00038264782,0.0010486812,0.00016957922,0.00014788746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035751978,0.0002671503,0.00042102387,0.00014369757,0.00011590031,0.00012329033,0.0011195333,0.00030638397,0.000026431097],"category_scores_gemma":[0.000012386485,0.00026123054,0.00019481881,0.0002408118,0.00008779339,0.000421037,0.0007243077,0.00054252316,0.00004274651],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010700132,0.0009459617,0.09038813,0.0005696929,0.00033622488,0.00057486154,0.0073787034,0.0068087713,0.0011205861,0.07715788,0.00842157,0.8061906],"study_design_scores_gemma":[0.0012179537,0.00052786997,0.04128898,0.0013124159,0.0001599145,0.0000431145,0.0000820721,0.7609166,0.00085126783,0.18688841,0.004684107,0.0020273086],"about_ca_topic_score_codex":0.00002757619,"about_ca_topic_score_gemma":0.0000024429687,"teacher_disagreement_score":0.8649092,"about_ca_system_score_codex":0.000026861484,"about_ca_system_score_gemma":0.00027009888,"threshold_uncertainty_score":0.99998397},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20914035,0.000011781713,0.7872418,0.00010128945,0.0009121678,0.0008595656,0.00001323847,0.00016534989,0.0015544662],"genre_scores_gemma":[0.9744175,0.000047535363,0.022807429,0.0001139884,0.00011570324,0.00001505271,0.000055611657,0.000022262457,0.0024049252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809265,0.00004396782,0.00023519094,0.0010996313,0.00012465869,0.0004039016],"domain_scores_gemma":[0.99785244,0.00016370573,0.00028014733,0.0009821323,0.00043844443,0.000283108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015405177,0.0003583245,0.00035458466,0.0005445208,0.00024220112,0.00022794367,0.001154788,0.00031180587,0.000023771176],"category_scores_gemma":[0.000015717193,0.00034637965,0.00018442074,0.0010290693,0.00007193321,0.00044059646,0.0005403724,0.00035378078,0.00010809825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004820696,0.0003241677,0.006454163,0.00036105738,0.00044873307,0.00022127126,0.0008314845,0.15779325,0.000008632776,0.7361784,0.022054821,0.07484196],"study_design_scores_gemma":[0.00047791324,0.00029894547,0.0006946051,0.00013006112,0.000090307796,0.000007823281,0.0000682184,0.9421225,0.000018921868,0.054359432,0.0011970244,0.0005342393],"about_ca_topic_score_codex":0.00031573366,"about_ca_topic_score_gemma":0.00016208709,"teacher_disagreement_score":0.78432924,"about_ca_system_score_codex":0.00017668337,"about_ca_system_score_gemma":0.00013069098,"threshold_uncertainty_score":0.9998988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022105573,0.0000337464,0.9328032,0.000430535,0.0015140502,0.00022123256,0.000027050564,0.0003485952,0.04251602],"genre_scores_gemma":[0.98579264,0.00017623529,0.0007947451,0.0005818227,0.0002769788,8.2823266e-7,0.000013219372,0.000022982676,0.012340557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771005,0.00012166369,0.00022394265,0.0013111297,0.00013909579,0.00049412734],"domain_scores_gemma":[0.99732447,0.00019489658,0.0002524161,0.0017900321,0.00012540868,0.00031276795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002371109,0.00038774786,0.00038512296,0.00023698593,0.00016034539,0.00012869087,0.0022885855,0.0007736339,0.00008075789],"category_scores_gemma":[0.0000064100564,0.0003582704,0.00025537136,0.00029779918,0.00013104969,0.0002133218,0.0020287966,0.0010737805,0.00056558324],"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.00012546974,0.00025789186,0.002048445,0.00007703735,0.00025650053,0.0037949707,0.00023855422,0.02671745,0.000008695878,0.890586,0.01880674,0.057082247],"study_design_scores_gemma":[0.0006728867,0.00012565267,0.00032636974,0.00032134354,0.000064093845,0.000011518612,0.00001901312,0.86482745,0.000023195353,0.123806566,0.008984896,0.0008169887],"about_ca_topic_score_codex":0.00002467974,"about_ca_topic_score_gemma":0.000004917909,"teacher_disagreement_score":0.96368706,"about_ca_system_score_codex":0.00016397158,"about_ca_system_score_gemma":0.00026604746,"threshold_uncertainty_score":0.99988693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048925433,0.000090231784,0.9422929,0.000099843346,0.00056516135,0.00044433563,0.00001610488,0.00028419308,0.007281759],"genre_scores_gemma":[0.9778028,0.0000919239,0.021085264,0.00012281757,0.00013076766,0.0000048977613,0.00009064861,0.00004068983,0.0006301935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968015,0.0002782753,0.000508435,0.0014216205,0.00018265327,0.00080751104],"domain_scores_gemma":[0.9970456,0.00030181068,0.00050555397,0.0012842419,0.000344121,0.0005186887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011548336,0.00056291174,0.00071508996,0.00039835743,0.00026118814,0.00032083067,0.0016720203,0.00042508967,0.000016323445],"category_scores_gemma":[0.000022292461,0.0005877717,0.00016655677,0.00094334077,0.00017110922,0.0005530688,0.0016823873,0.0011217871,0.000022506529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006505812,0.000068988236,0.0014672165,0.00003261152,0.00007187015,0.0029070338,0.00019010695,0.9691077,4.8373107e-7,0.024378728,0.00041251336,0.0012976815],"study_design_scores_gemma":[0.0008320419,0.000086113316,0.00011125222,0.0004695052,0.000117890144,0.000050289975,0.00011022415,0.99246806,6.191197e-7,0.00489148,0.00015262017,0.00070988544],"about_ca_topic_score_codex":0.00019598985,"about_ca_topic_score_gemma":0.00009691665,"teacher_disagreement_score":0.92887735,"about_ca_system_score_codex":0.00036258847,"about_ca_system_score_gemma":0.0009014844,"threshold_uncertainty_score":0.9996574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091953486,0.00020707327,0.9015381,0.000071313945,0.0010048419,0.0002203958,0.000007498919,0.00036356517,0.00463372],"genre_scores_gemma":[0.9946026,0.0005562931,0.0025117157,0.0001750909,0.00006066065,6.907769e-7,0.000030756706,0.000023669585,0.0020384914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787956,0.00009210852,0.00022184943,0.001234176,0.0000851897,0.00048709952],"domain_scores_gemma":[0.9979291,0.00015402025,0.00024670883,0.001244019,0.000100587946,0.0003255788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027484918,0.00038941036,0.00041543928,0.0002227508,0.00025874533,0.00021593229,0.0014322104,0.0006416542,0.00004428027],"category_scores_gemma":[0.000003877445,0.0004459213,0.00017421092,0.00041024503,0.00026650904,0.00030437266,0.0024379855,0.0013726655,0.00004673835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012950928,0.00030226682,0.0030926198,0.00020704952,0.0005232415,0.0042835223,0.00055453175,0.5515764,0.00006685469,0.3534454,0.0030985624,0.08272004],"study_design_scores_gemma":[0.0002819294,0.000026116271,0.00014743277,0.000070879636,0.000061887185,0.00002354205,0.0000072236026,0.9471379,9.464923e-7,0.051589876,0.0001875304,0.00046475366],"about_ca_topic_score_codex":0.000040577732,"about_ca_topic_score_gemma":0.000018130477,"teacher_disagreement_score":0.90264916,"about_ca_system_score_codex":0.000052695592,"about_ca_system_score_gemma":0.00013814509,"threshold_uncertainty_score":0.99979925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005382228,0.00089874945,0.96752477,0.0008755875,0.0014472507,0.0009995559,0.0000085759975,0.0003820263,0.022481272],"genre_scores_gemma":[0.8839642,0.00034168165,0.090366706,0.004316538,0.00076144683,0.00024317524,0.000061119536,0.000052213516,0.019892938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972116,0.00009040253,0.00048207917,0.00089136965,0.00042533642,0.0008992196],"domain_scores_gemma":[0.9975528,0.0007721682,0.00009814765,0.001057949,0.000085865395,0.0004330451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004905962,0.00031788243,0.0004619801,0.000102699116,0.00017018046,0.00025451908,0.0011944385,0.00027805136,0.000543603],"category_scores_gemma":[0.0000072615812,0.0002634237,0.00025381587,0.00032491473,0.00010737222,0.00033553859,0.00046530608,0.0005061415,0.0002466344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016777308,0.00022183747,0.00028581245,0.000030019597,0.00005683242,0.00004219303,0.0002177715,0.0022168541,0.00003707305,0.118998945,0.04333176,0.83439314],"study_design_scores_gemma":[0.0008124247,0.00051507924,0.00011393478,0.000020352756,0.000008761444,0.000038831386,0.0000105108675,0.75489753,0.0000058112896,0.0055214236,0.23773396,0.00032136717],"about_ca_topic_score_codex":0.0000035266623,"about_ca_topic_score_gemma":0.0000059032122,"teacher_disagreement_score":0.87858194,"about_ca_system_score_codex":0.000044010754,"about_ca_system_score_gemma":0.00015922445,"threshold_uncertainty_score":0.9999818},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010745833,0.00000492367,0.9848185,0.00030872636,0.0011388153,0.00030969494,0.000102317266,0.00009066327,0.0024804818],"genre_scores_gemma":[0.97445345,0.000008507413,0.010616967,0.0004022367,0.00024738975,0.0000098865285,0.0008468915,0.00001040709,0.013404266],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988971,0.0000354946,0.00027061097,0.00034441962,0.00020436404,0.0002480094],"domain_scores_gemma":[0.9988929,0.00010066463,0.00015439623,0.0007180601,0.00008588867,0.00004810664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007576789,0.00008394815,0.00017286613,0.00009252636,0.000039487066,0.00014049884,0.0005876368,0.000100742465,0.000008654591],"category_scores_gemma":[0.0000072314224,0.00007677376,0.000025436431,0.0003467077,0.0000027111296,0.0004976878,0.00021051736,0.00006530447,0.000065403205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007127386,0.0005628531,0.5706297,0.00047516645,0.00015296809,0.000018377586,0.001199912,0.0004657102,0.0012769323,0.19949204,0.022505783,0.20314924],"study_design_scores_gemma":[0.00040794772,0.000018763412,0.008060629,0.000026680184,0.0000074105415,0.0000010031624,0.000038983027,0.9698334,0.000010731292,0.000029127017,0.021459427,0.00010589507],"about_ca_topic_score_codex":0.0000061157307,"about_ca_topic_score_gemma":0.000029157458,"teacher_disagreement_score":0.97420156,"about_ca_system_score_codex":0.000100494246,"about_ca_system_score_gemma":0.0000653298,"threshold_uncertainty_score":0.3130743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08099194,0.000065276516,0.91139305,0.00006227441,0.0007962574,0.00062298897,0.000006336872,0.00015318843,0.0059086774],"genre_scores_gemma":[0.9792036,0.000009333592,0.019966157,0.00042090222,0.00012477254,0.00007181793,0.00011948402,0.0000097132715,0.00007426535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983558,0.000051186198,0.0006931389,0.0001988483,0.00023701746,0.00046399544],"domain_scores_gemma":[0.99889433,0.00017904698,0.0003273384,0.00036025877,0.00016145686,0.00007754731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090162986,0.00018159178,0.0002545048,0.0001536308,0.00018048221,0.00036202744,0.00042220316,0.00013753166,0.000011723035],"category_scores_gemma":[0.000022495686,0.00017884096,0.0000646133,0.00040835963,0.000030668547,0.003143346,0.00009782098,0.0001393282,0.00008111497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015150195,0.000056753794,0.014791431,0.00044237208,0.000048350048,0.000009440747,0.015924294,0.24312596,0.00004017795,0.1358348,0.0021088074,0.5874661],"study_design_scores_gemma":[0.00057887385,0.00008409165,0.002076256,0.00020320213,0.0000046952223,0.000022459595,0.00023871395,0.9903011,0.00001739073,0.0040954095,0.0021423062,0.00023553427],"about_ca_topic_score_codex":0.000051724994,"about_ca_topic_score_gemma":0.000015240966,"teacher_disagreement_score":0.8982116,"about_ca_system_score_codex":0.00019888137,"about_ca_system_score_gemma":0.00012796445,"threshold_uncertainty_score":0.7292922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49288332,0.000013457574,0.50496805,0.00007620942,0.001376813,0.00025319826,0.0000022232468,0.000113640424,0.00031311045],"genre_scores_gemma":[0.9975037,0.0000057626194,0.0018152473,0.00048910815,0.000113319766,0.0000054218544,5.1175766e-7,0.000019729723,0.000047223144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977345,0.00021632887,0.00057018374,0.0005947299,0.00043302163,0.00045125955],"domain_scores_gemma":[0.9968797,0.0016486974,0.00032156205,0.0009040306,0.00014543602,0.00010059586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079488265,0.00027744586,0.0003918879,0.0001302624,0.00045651122,0.00012466204,0.0009886503,0.000105935644,0.0000127689045],"category_scores_gemma":[0.0000043230934,0.00022212109,0.00021316367,0.0005254241,0.00010893945,0.00015781175,0.000028093484,0.00068236404,0.00009039189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030475658,0.00021724388,0.00031186335,0.000043377702,0.000051108986,0.000009399199,0.0012596465,0.7462757,0.0005934502,0.0023073268,0.00004039682,0.24886002],"study_design_scores_gemma":[0.00044488168,0.00038722294,0.0012434252,0.00037172032,0.000016122904,0.000035331028,0.00017974224,0.9946429,0.0021919564,0.00008972154,0.00013092546,0.00026604184],"about_ca_topic_score_codex":0.00005410417,"about_ca_topic_score_gemma":0.000006413111,"teacher_disagreement_score":0.5046204,"about_ca_system_score_codex":0.00007087694,"about_ca_system_score_gemma":0.00008684647,"threshold_uncertainty_score":0.90578353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002415584,0.00009864092,0.97982615,0.000923235,0.0036252944,0.00074788136,0.0013265096,0.00019893885,0.0130118085],"genre_scores_gemma":[0.93896145,0.00012813661,0.032287333,0.012263394,0.0006369019,0.00014845017,0.00824101,0.00004213342,0.0072912155],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689007,0.000118724965,0.0005688892,0.0013356645,0.0005828062,0.0005038708],"domain_scores_gemma":[0.9957209,0.00013129853,0.00021697365,0.0036099162,0.00012448589,0.00019642037],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000792723,0.00042034578,0.00048459735,0.0000858122,0.00007669793,0.00045925408,0.00245152,0.00037738332,0.0008728501],"category_scores_gemma":[0.0000034900836,0.00034605776,0.00016315411,0.000089862566,0.00005399838,0.0002852511,0.007162075,0.0007091701,0.00096018496],"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.000014580991,0.00023067997,0.0006690804,0.00020593927,0.00008788367,0.000047671565,0.00015238086,0.0016261294,5.5836466e-7,0.0020401196,0.9737643,0.02116068],"study_design_scores_gemma":[0.0002656245,0.00003596567,0.00011163839,0.00006959017,0.000021752623,0.000008458822,0.00001534727,0.86321545,0.000005161933,0.0025598113,0.1332319,0.0004593291],"about_ca_topic_score_codex":0.00012034167,"about_ca_topic_score_gemma":0.000022982162,"teacher_disagreement_score":0.9475388,"about_ca_system_score_codex":0.00010602583,"about_ca_system_score_gemma":0.00033031375,"threshold_uncertainty_score":0.99989915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09305689,0.0002304301,0.9045119,0.00015237459,0.0010265172,0.00018337929,6.703493e-7,0.00003541651,0.0008023755],"genre_scores_gemma":[0.9483891,0.00006942448,0.050560102,0.00066054205,0.00025308045,6.829107e-7,0.000002535494,0.000014580743,0.00004994186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716836,0.00016918899,0.0012660616,0.00037040093,0.00046429195,0.0005617072],"domain_scores_gemma":[0.99768066,0.0006264893,0.00087976095,0.00034293646,0.00024451574,0.00022560866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022278242,0.0002511203,0.00064461044,0.00023941445,0.00017980565,0.00032497075,0.0008155719,0.00010065611,0.000057919173],"category_scores_gemma":[0.000030624316,0.00022503361,0.00015054176,0.0004243118,0.00005943271,0.00035948298,0.00028222226,0.0005524434,0.000014718342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005935061,0.0005067466,0.03543363,0.00021566333,0.00020663219,0.0018238721,0.00609362,0.40968654,0.00020359961,0.14467093,0.0015246692,0.39904058],"study_design_scores_gemma":[0.00071647094,0.00031797402,0.0003725763,0.00059955375,0.000017898285,0.00014005878,0.00029840675,0.9938453,0.00003235619,0.0030767107,0.00031954105,0.000263181],"about_ca_topic_score_codex":0.000015186015,"about_ca_topic_score_gemma":0.0000031190605,"teacher_disagreement_score":0.8553322,"about_ca_system_score_codex":0.00007445235,"about_ca_system_score_gemma":0.00021949096,"threshold_uncertainty_score":0.9176604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018290106,0.000024124214,0.91925913,0.00021088342,0.00008518737,0.00038937872,0.0000011669722,0.000114470015,0.07808662],"genre_scores_gemma":[0.7584551,0.000012899641,0.20261583,0.00023237834,0.00009060668,0.000052672138,0.000010781904,0.000009272614,0.038520467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921334,0.000011896037,0.00019345025,0.0002478498,0.00010779828,0.00022568366],"domain_scores_gemma":[0.9991752,0.00032355663,0.000050392617,0.00034015192,0.000032950564,0.0000777335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021608277,0.00008025149,0.00014426667,0.00013281073,0.00004547638,0.00008430372,0.0003698124,0.00004641423,0.00008793873],"category_scores_gemma":[0.0000034112513,0.000070144226,0.00004444463,0.0005528661,0.000007209111,0.00016687521,0.00009502693,0.00005029188,0.00013615676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073476654,0.000052569765,0.017573012,0.00002328187,0.0000175966,0.0000020685177,0.0005243637,0.00016409499,0.00008838074,0.7448428,0.018475838,0.21822861],"study_design_scores_gemma":[0.00041614025,0.000050453054,0.0016563887,0.000013228927,0.0000047894023,0.0000030089298,0.00007694303,0.98039514,0.000032664215,0.009366062,0.0078040645,0.00018109128],"about_ca_topic_score_codex":0.00022304995,"about_ca_topic_score_gemma":0.000011163037,"teacher_disagreement_score":0.98023105,"about_ca_system_score_codex":0.000024037552,"about_ca_system_score_gemma":0.00011136363,"threshold_uncertainty_score":0.28603986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002983526,0.00013817436,0.9349541,0.002312907,0.00018903239,0.00067864807,0.00006752839,0.0002153959,0.061145827],"genre_scores_gemma":[0.7794681,0.000027207429,0.21813904,0.0010245827,0.00003705108,0.00016876389,0.00025861576,0.000015321772,0.0008612931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986392,0.00012916596,0.00033967683,0.00036120173,0.00020446607,0.000326265],"domain_scores_gemma":[0.9948536,0.0005519172,0.00015402598,0.0040823044,0.00017795086,0.0001801963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005323196,0.00016961795,0.00024744304,0.00008375292,0.00033478093,0.00015608763,0.0030160053,0.00011491434,0.000049551152],"category_scores_gemma":[0.000018206063,0.00017058264,0.00013856836,0.00032947262,0.00012558246,0.00014672628,0.00052274496,0.00026180418,0.000062231324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032746706,0.0009999083,0.0012055222,0.000117164614,0.000070820446,0.0000030570097,0.00077883614,0.00034620482,0.000074194,0.9197515,0.025411408,0.051208623],"study_design_scores_gemma":[0.0005013807,0.000062610525,0.00007268671,0.0000154486,0.00001866606,0.0000070280303,0.00005268032,0.9347479,0.000004475599,0.005009979,0.059299313,0.00020784079],"about_ca_topic_score_codex":0.000018728553,"about_ca_topic_score_gemma":0.000004393509,"teacher_disagreement_score":0.9344017,"about_ca_system_score_codex":0.000045090783,"about_ca_system_score_gemma":0.00030257637,"threshold_uncertainty_score":0.6956158},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011857894,0.00003349096,0.67524797,0.0027086686,0.00077970146,0.00010924925,3.0412497e-7,0.00021445598,0.3090483],"genre_scores_gemma":[0.91321826,0.000009407183,0.058486897,0.018085066,0.00013237174,0.000004044296,0.0000025144016,0.000009609545,0.01005186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988475,0.00002232302,0.00017404456,0.00037410198,0.0002744661,0.00030755514],"domain_scores_gemma":[0.9987597,0.00014950152,0.0000488016,0.0008230174,0.00006120276,0.00015781107],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001753844,0.00012829994,0.0001567502,0.000036064048,0.00005874713,0.00013991582,0.00086431316,0.00012144511,0.001983306],"category_scores_gemma":[0.0000037619204,0.00010586822,0.000042648626,0.00045944663,0.0000147818455,0.0002835875,0.00018920554,0.00020112061,0.0074944138],"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.000013250394,0.00007725675,0.0065626404,0.000019873703,0.000021116377,0.000050318715,0.0004843322,0.00018606555,0.00004926481,0.88544035,0.045957666,0.06113785],"study_design_scores_gemma":[0.00034129273,0.00016004685,0.0007593354,0.00005160067,0.000006123532,0.00005091644,0.000046994603,0.84671634,0.000050147515,0.07143328,0.07998881,0.00039511756],"about_ca_topic_score_codex":0.000080647915,"about_ca_topic_score_gemma":0.000006481376,"teacher_disagreement_score":0.90136033,"about_ca_system_score_codex":0.000013864219,"about_ca_system_score_gemma":0.00007064824,"threshold_uncertainty_score":0.998929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004583576,0.00018786112,0.937484,0.015038335,0.00045493495,0.00017066936,0.00000412299,0.00015460578,0.041921865],"genre_scores_gemma":[0.95206183,0.000008692899,0.02018779,0.012622436,0.00045411926,0.00001775648,0.0000016147947,0.000006146606,0.014639627],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897724,0.000045754987,0.000212032,0.00026834224,0.00021209438,0.00028452478],"domain_scores_gemma":[0.9990626,0.00008692952,0.000048371836,0.00059546664,0.000063715735,0.00014293978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042346123,0.000113219976,0.00013002807,0.00002912571,0.00010048683,0.00015471118,0.0010165763,0.00004313198,0.0001074515],"category_scores_gemma":[0.000014059818,0.000075676115,0.000055462886,0.00010349233,0.00004293955,0.00016847192,0.0005732972,0.0001228282,0.0006967314],"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.000010353559,0.00003168497,0.00017349097,0.0000032101163,0.000014376769,0.000020152596,0.0016931138,0.000044219207,0.000013290622,0.022420885,0.6990497,0.2765255],"study_design_scores_gemma":[0.00014587515,0.000044196095,0.00023363785,0.000013344739,0.0000066389835,0.000021681868,0.000026931135,0.21333443,0.00019807433,0.00060048833,0.785244,0.00013073346],"about_ca_topic_score_codex":0.00007161918,"about_ca_topic_score_gemma":0.00024739307,"teacher_disagreement_score":0.94747823,"about_ca_system_score_codex":0.000038959945,"about_ca_system_score_gemma":0.000055532688,"threshold_uncertainty_score":0.89553046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1815129,0.0000074730165,0.7936982,0.00011017225,0.0002868564,0.00028440927,0.0000016257923,0.0002039601,0.023894396],"genre_scores_gemma":[0.95898277,9.263582e-7,0.040276334,0.00014229429,0.00006715006,0.000008017329,0.0000042315064,0.0000046473724,0.00051362277],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988102,0.00006742306,0.00023963969,0.00043251264,0.00018900579,0.00026122993],"domain_scores_gemma":[0.9992175,0.00004902218,0.000055600485,0.00052573794,0.000053369517,0.000098730736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048791472,0.00010202076,0.00013567608,0.000046487316,0.000043422693,0.00007341775,0.00036850237,0.000079368096,0.000059777543],"category_scores_gemma":[0.0000036304518,0.00007909429,0.00003018103,0.00025174126,0.00002356814,0.00066688086,0.00010462684,0.00016605435,0.00005962099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063549516,0.00047329316,0.5953046,0.000019225223,0.000016751283,0.000020151541,0.0022236854,0.0011754432,0.0002951218,0.309324,0.001055007,0.09002914],"study_design_scores_gemma":[0.00023705668,0.00019345705,0.014399095,0.000017374537,0.0000011211786,0.0000035113778,0.00006381623,0.9816378,0.000023195875,0.0031588662,0.00015831011,0.000106417225],"about_ca_topic_score_codex":0.00007458705,"about_ca_topic_score_gemma":0.000024901274,"teacher_disagreement_score":0.9804623,"about_ca_system_score_codex":0.000060288276,"about_ca_system_score_gemma":0.00008861086,"threshold_uncertainty_score":0.32253715},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46671316,0.00001592529,0.53200257,0.00002997104,0.00010882318,0.00019746668,0.0000034060474,0.000068575166,0.00086009386],"genre_scores_gemma":[0.998417,0.00013901036,0.0011865441,0.00008903807,0.00010644236,0.0000023381515,0.0000114729655,0.00001802829,0.00003008398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977196,0.00017903226,0.00041796154,0.0011125285,0.00013961118,0.00043127543],"domain_scores_gemma":[0.99851424,0.00016144893,0.00035689908,0.0006968446,0.0001275076,0.0001430852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005237139,0.00033002623,0.0006207303,0.00014401715,0.0001434004,0.000039925908,0.0011885853,0.00034010137,0.000007000375],"category_scores_gemma":[0.0000075489115,0.00034867987,0.00016246813,0.0007385712,0.0001269415,0.00023157154,0.0010467537,0.0009811402,0.000004889594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013101348,0.00007744433,0.016961839,0.00006712497,0.000031156866,0.0000784425,0.00033134202,0.9692691,5.7184485e-7,0.004268983,0.00001395402,0.008769014],"study_design_scores_gemma":[0.000448333,0.00013109515,0.0007904038,0.00024034988,0.00003432125,0.000001669799,0.00007662412,0.9966313,0.0000024070355,0.0013005006,0.000005201073,0.00033776148],"about_ca_topic_score_codex":0.00009660192,"about_ca_topic_score_gemma":0.000019346906,"teacher_disagreement_score":0.5317039,"about_ca_system_score_codex":0.00020940974,"about_ca_system_score_gemma":0.0002626094,"threshold_uncertainty_score":0.9998965},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030546187,0.000066642286,0.9835097,0.0039011699,0.00055852864,0.010347215,0.000012229176,0.00005532014,0.0015186422],"genre_scores_gemma":[0.9748431,0.0000117441905,0.017775217,0.0010463916,0.0006353718,0.005576255,0.000021759079,0.000019084167,0.00007106551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976066,0.00026950188,0.0011144053,0.00018291178,0.0006371501,0.00018943881],"domain_scores_gemma":[0.99589026,0.0005554186,0.0015140022,0.00047386705,0.001331189,0.00023526403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011379478,0.00016773198,0.00032504334,0.00009940438,0.00013678402,0.00044506576,0.0028365056,0.000103773404,0.000014350615],"category_scores_gemma":[0.00008985509,0.00014754929,0.00018567141,0.00015038984,0.00004583117,0.00039726624,0.0002195087,0.00034062733,0.0000040658947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002078014,0.0010662207,0.0045795436,0.00017089913,0.0010917368,0.00040998752,0.004590807,0.34926742,0.00025527654,0.40774384,0.08053259,0.14821365],"study_design_scores_gemma":[0.0018225176,0.0001295965,0.00003009813,0.00029698835,0.000012425273,0.000053464664,0.00009835427,0.9272273,0.000009165706,0.00018584986,0.06999667,0.0001375771],"about_ca_topic_score_codex":0.000007736793,"about_ca_topic_score_gemma":7.795259e-7,"teacher_disagreement_score":0.97481257,"about_ca_system_score_codex":0.00008648418,"about_ca_system_score_gemma":0.00029409924,"threshold_uncertainty_score":0.6016885},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031850905,0.000060447965,0.9488095,0.0015098405,0.00006678226,0.04784777,0.0000034899174,0.00015468667,0.0015156488],"genre_scores_gemma":[0.25955263,0.00006080779,0.10800121,0.002900058,0.0022928377,0.62630403,0.00006230421,0.0001101669,0.0007159607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809605,0.000044032655,0.00048079318,0.00048016247,0.0001879074,0.00071103335],"domain_scores_gemma":[0.99912053,0.00008997303,0.00016941638,0.000346894,0.00007575141,0.00019741937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034319542,0.00017101744,0.00020978817,0.000029943154,0.00018316983,0.00005400853,0.00054632826,0.000078793666,0.000023870476],"category_scores_gemma":[0.000014074892,0.00017281807,0.00007942539,0.00061776664,0.00001734081,0.00004422445,0.000122034915,0.00024434118,0.000021764976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011906709,0.00033547654,0.00076322915,0.00019045547,0.00004049215,0.00002998446,0.00061602186,0.04576053,0.00013957702,0.6654116,0.01581042,0.27078313],"study_design_scores_gemma":[0.00042612138,0.00013883994,0.000014326454,0.000011615346,0.0000052343416,0.000003880229,0.000008346756,0.8823618,0.000007131547,0.0035054772,0.113334216,0.00018299678],"about_ca_topic_score_codex":0.0000010114485,"about_ca_topic_score_gemma":0.000005054849,"teacher_disagreement_score":0.8408083,"about_ca_system_score_codex":0.00007134098,"about_ca_system_score_gemma":0.00033579965,"threshold_uncertainty_score":0.7047316},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007812702,0.0006760085,0.98434436,0.0051250947,0.0014013933,0.00029898292,0.000017360862,0.0000714382,0.00025266258],"genre_scores_gemma":[0.9680874,0.00025482537,0.029063692,0.0020351165,0.00032124756,0.000015563945,0.0000045909164,0.000022208333,0.00019536147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978166,0.00007933125,0.00080572977,0.00032233726,0.00049469,0.00048128687],"domain_scores_gemma":[0.9981015,0.00031570706,0.0007303583,0.0002869485,0.00022541283,0.00034009482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008410892,0.00022924953,0.00033401008,0.000038526337,0.00024990845,0.00062882766,0.0015505579,0.00008773817,0.000009532948],"category_scores_gemma":[0.000040764688,0.00016482352,0.00026347273,0.00018129067,0.00008818183,0.0004944428,0.00025749666,0.0005036311,0.000008369639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018345198,0.0005026823,0.00026982158,0.00038085127,0.0013013827,0.0010202384,0.03524308,0.0030797876,0.0098140435,0.009406651,0.44414064,0.4930063],"study_design_scores_gemma":[0.0016030454,0.00082744274,0.000007439976,0.0003583469,0.000039794424,0.00051611423,0.0002929807,0.8202478,0.0029042645,0.005384854,0.16746493,0.00035296942],"about_ca_topic_score_codex":0.00000663891,"about_ca_topic_score_gemma":6.353178e-7,"teacher_disagreement_score":0.9602747,"about_ca_system_score_codex":0.00009368035,"about_ca_system_score_gemma":0.00015478044,"threshold_uncertainty_score":0.67213076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012321854,0.0003167782,0.9833049,0.0009334304,0.0010017717,0.00029014176,0.0000016957931,0.0002816106,0.0015477842],"genre_scores_gemma":[0.9857397,0.00039939763,0.011536258,0.00027911496,0.0018154175,0.000018328617,0.00005390426,0.00003771045,0.000120135715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969934,0.0002873537,0.0008951154,0.0007430547,0.00040663162,0.00067441806],"domain_scores_gemma":[0.9985195,0.00023427681,0.00042030428,0.0004155723,0.00016937355,0.00024101525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058297015,0.00035543114,0.0006521526,0.00010601859,0.00019195749,0.00011615842,0.001102962,0.00032123673,0.00007837241],"category_scores_gemma":[0.0000096808,0.0003712053,0.00020467288,0.001173149,0.000053935815,0.00043694596,0.0004880106,0.0005243914,0.000011284471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008489596,0.00026130682,0.00454427,0.00010265017,0.00015488763,0.0003330495,0.0043862793,0.47129998,0.00016258098,0.004472348,0.14076704,0.37343073],"study_design_scores_gemma":[0.0003540687,0.00010489574,0.0045090877,0.00011534123,0.000022683083,0.00000488076,0.000014723087,0.993685,0.000008287241,0.00019415989,0.00060896075,0.00037792113],"about_ca_topic_score_codex":0.000017066091,"about_ca_topic_score_gemma":0.000002449432,"teacher_disagreement_score":0.9734179,"about_ca_system_score_codex":0.000047037043,"about_ca_system_score_gemma":0.000054858163,"threshold_uncertainty_score":0.999874},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000056263857,0.000016653954,0.81515074,0.002939812,0.0016111886,0.034689195,0.00004058539,0.0008388421,0.14470737],"genre_scores_gemma":[0.0864864,0.00006853267,0.60886896,0.03831293,0.0037405475,0.2139272,0.00028732215,0.00028708007,0.04802103],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653816,0.000114663424,0.0006831952,0.0014430765,0.00064706086,0.00057383993],"domain_scores_gemma":[0.99719137,0.00007474477,0.00031536058,0.001813298,0.0001711916,0.00043402967],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033115371,0.00053378276,0.0006505293,0.00010362942,0.00017198101,0.00040072858,0.0028168715,0.00048728322,0.0002514328],"category_scores_gemma":[0.000009657351,0.0004624236,0.00029081482,0.00026999376,0.00006628944,0.00024649562,0.004926961,0.0011050951,0.00079773116],"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.000045064793,0.00019529935,0.000090044356,0.00038749696,0.0001290317,0.0004385896,0.00017875343,0.00017676227,0.000028971035,0.17919855,0.65853053,0.16060089],"study_design_scores_gemma":[0.0004346379,0.000104868326,0.000042042215,0.00012286438,0.000017944729,0.000025712472,0.000005110234,0.513803,0.0000757439,0.043551702,0.4411324,0.0006839371],"about_ca_topic_score_codex":0.0001693991,"about_ca_topic_score_gemma":0.000009587564,"teacher_disagreement_score":0.5136263,"about_ca_system_score_codex":0.00008457269,"about_ca_system_score_gemma":0.00045340162,"threshold_uncertainty_score":0.9999803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067461783,0.00023247417,0.6885218,0.0012937046,0.00032457893,0.0002805639,0.000014721026,0.00008400856,0.3092414],"genre_scores_gemma":[0.34364903,0.016884694,0.62202144,0.013907536,0.00043993158,0.00011602775,0.00092485826,0.00004773754,0.002008719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787194,0.00004799042,0.00094815006,0.00037313954,0.00043734928,0.0003214346],"domain_scores_gemma":[0.99732125,0.00029217402,0.0003924188,0.0015356285,0.0002591433,0.0001993742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011705143,0.0002594596,0.00034969763,0.0006192418,0.00034502978,0.0006284406,0.0028107304,0.00017229574,0.000014957151],"category_scores_gemma":[0.000020067564,0.00027685612,0.000046907888,0.0006551907,0.00065066636,0.0046744877,0.002209719,0.00064887595,0.00011859671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028874192,0.000009940244,0.000033307737,0.000018447667,0.0000027686563,0.0000037989298,0.0006490199,0.00016963923,1.570933e-7,0.48325968,0.0005567995,0.51529354],"study_design_scores_gemma":[0.00023702816,0.000040236475,0.00023650251,0.00031529024,0.0000046366886,0.000026117148,0.000010806812,0.8974148,1.9284388e-7,0.043914527,0.057481032,0.00031882312],"about_ca_topic_score_codex":0.0000106136085,"about_ca_topic_score_gemma":0.000012683727,"teacher_disagreement_score":0.89724517,"about_ca_system_score_codex":0.00012563678,"about_ca_system_score_gemma":0.0004835868,"threshold_uncertainty_score":0.99996835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01725612,0.00013697753,0.9416089,0.00046090398,0.0019755585,0.00050012016,0.0000010441138,0.00015189275,0.037908502],"genre_scores_gemma":[0.99644417,0.00009379978,0.0011918937,0.0008884221,0.0005851106,0.00016532325,0.000025189376,0.0000149354555,0.00059116335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980453,0.00022812723,0.00040165865,0.00048133385,0.00039017975,0.00045334647],"domain_scores_gemma":[0.99845123,0.0007389936,0.0001494756,0.00034220464,0.00019314,0.00012494044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006195753,0.00023415589,0.00024078085,0.00012545394,0.0001415647,0.00042609771,0.0008599396,0.0001637548,0.00074729125],"category_scores_gemma":[0.000020475385,0.00021410911,0.000074956246,0.0003156461,0.000040423838,0.0005881766,0.00019407184,0.0006235112,0.00021296997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022301532,0.000041833373,0.0018504822,0.0000021459987,0.000017740562,0.000023314498,0.00006763279,0.64314663,0.0000053105696,0.034043048,0.001722304,0.31905726],"study_design_scores_gemma":[0.00041214505,0.00013233727,0.0012425274,0.00013294286,0.0000025934683,0.0000042832703,0.00001252187,0.98887825,0.000003165659,0.007587379,0.0013658743,0.00022598094],"about_ca_topic_score_codex":0.000041201707,"about_ca_topic_score_gemma":0.0000127348185,"teacher_disagreement_score":0.979188,"about_ca_system_score_codex":0.000085700245,"about_ca_system_score_gemma":0.000047639987,"threshold_uncertainty_score":0.8731116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83806556,0.0027382537,0.11726466,0.021781417,0.00055824284,0.0015361652,0.00015688784,0.000505952,0.017392838],"genre_scores_gemma":[0.99421346,0.00026419252,0.0045771734,0.00029630633,0.00010019056,0.000003891809,0.00008738924,0.000015554473,0.00044181175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725467,0.0002480342,0.0003534044,0.0007684134,0.00077838,0.0005970974],"domain_scores_gemma":[0.99794716,0.00039652162,0.000100212375,0.0008436182,0.00030472258,0.00040778064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004807713,0.0001896865,0.00030179525,0.00008371377,0.000086825356,0.00018755402,0.0022555632,0.000105829786,0.00017334944],"category_scores_gemma":[0.00015687196,0.00016055361,0.000033160788,0.00091119617,0.00023794729,0.0002966491,0.0022652915,0.0005697998,0.0000200056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011215017,0.0003878923,0.05062404,0.00049390463,0.00090891763,0.0005433129,0.019748416,0.000071402785,0.031892944,0.0147787,0.3942924,0.48513654],"study_design_scores_gemma":[0.0012999965,0.00066722796,0.006485857,0.00012447339,0.00001915117,0.000035045578,0.0005094914,0.9623928,0.002165249,0.0003204038,0.025560513,0.00041977587],"about_ca_topic_score_codex":0.0001554505,"about_ca_topic_score_gemma":0.00003143307,"teacher_disagreement_score":0.9623214,"about_ca_system_score_codex":0.000039690276,"about_ca_system_score_gemma":0.00019126048,"threshold_uncertainty_score":0.65471864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005337273,0.0011453422,0.987471,0.008472612,0.0008304969,0.00021998245,0.0000064061073,0.000030297997,0.0012901422],"genre_scores_gemma":[0.9797502,0.0002819988,0.018153155,0.001289071,0.00040147488,0.000012897327,0.000021009664,0.000012691941,0.00007749607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981728,0.0001570769,0.0009109754,0.00015849451,0.00043852095,0.00016211081],"domain_scores_gemma":[0.9965938,0.00090909447,0.001015571,0.0003464696,0.00091571576,0.00021938489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011692086,0.00013189427,0.00032272856,0.000094738265,0.00014603605,0.00042142082,0.0015609292,0.00008575246,0.0000044175713],"category_scores_gemma":[0.00009318709,0.0001181563,0.00011500875,0.00012167713,0.000059787282,0.00028829457,0.00017491891,0.00025589496,0.0000021295634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002089967,0.0003250386,0.012493319,0.00007169708,0.00091325754,0.00016209125,0.0017186921,0.4038888,0.00014859658,0.43502077,0.046558518,0.09660927],"study_design_scores_gemma":[0.0020055291,0.0001044588,0.000111605645,0.00021386385,0.000021578004,0.000072488874,0.00008498305,0.95779043,0.0000026335265,0.000443872,0.039035622,0.00011294965],"about_ca_topic_score_codex":0.000017022416,"about_ca_topic_score_gemma":0.0000023442692,"teacher_disagreement_score":0.97921646,"about_ca_system_score_codex":0.000056343066,"about_ca_system_score_gemma":0.0001993157,"threshold_uncertainty_score":0.4818274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019598763,0.0000017888649,0.9799252,0.001068239,0.00013370343,0.01428093,0.000006943247,0.0001702746,0.0043932847],"genre_scores_gemma":[0.94824094,0.000001309022,0.0127745215,0.0048159515,0.0003272569,0.033682764,0.00009155236,0.000011145683,0.00005457199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988044,0.000021714784,0.0004829673,0.00017701731,0.00021392111,0.00030000412],"domain_scores_gemma":[0.99909896,0.00008620544,0.0002675915,0.00019921716,0.00012402485,0.0002239837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030133832,0.00015145446,0.00016028063,0.000044493387,0.0002122169,0.00032371684,0.00029695404,0.000091684844,0.0000125000915],"category_scores_gemma":[0.000019368,0.00013720026,0.00005125816,0.00019939993,0.000030449033,0.0007809117,0.00016667978,0.00010785629,0.000013202346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009357766,0.000036215497,0.000054912263,0.0001312611,0.000020032341,0.0000065676327,0.0018013017,0.017352851,0.0000077178975,0.23071936,0.015197596,0.7345786],"study_design_scores_gemma":[0.0006047279,0.00010665896,0.000015297295,0.00002783054,0.000005130304,0.000011311853,0.000047375175,0.92059,0.00001407282,0.00014028653,0.078278676,0.00015863655],"about_ca_topic_score_codex":0.000005796022,"about_ca_topic_score_gemma":5.499255e-7,"teacher_disagreement_score":0.9671507,"about_ca_system_score_codex":0.000024153562,"about_ca_system_score_gemma":0.00010146929,"threshold_uncertainty_score":0.55948645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03987698,0.02938501,0.49932253,0.4078965,0.006551162,0.0010569354,0.000110537956,0.00013084195,0.015669527],"genre_scores_gemma":[0.96878284,0.0017311352,0.0075032217,0.0089523,0.0012453932,0.000015728188,0.00000387107,0.000040105242,0.011725396],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971515,0.00006673269,0.00065686496,0.0006803428,0.00074088015,0.0007036781],"domain_scores_gemma":[0.99812686,0.0002921353,0.0003390033,0.00038129996,0.00033808005,0.00052258983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029370424,0.0003664437,0.00046538268,0.00002955873,0.00042951433,0.00020668222,0.0018394921,0.00030254596,0.00012539123],"category_scores_gemma":[0.00008605787,0.00031232194,0.00019133162,0.0012164714,0.0007882481,0.00030969328,0.00054896914,0.0010809414,0.00002028009],"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.00006163987,0.00007319243,0.0014813876,0.00026365323,0.00009527044,0.00018860452,0.0071282615,0.00025328263,0.000060791805,0.18993999,0.5594407,0.24101324],"study_design_scores_gemma":[0.0002994178,0.00014586338,0.0008636665,0.00034151154,0.00010537143,0.00014689167,0.0022868097,0.5854776,0.00043730348,0.0055331234,0.40366927,0.0006931747],"about_ca_topic_score_codex":0.06794611,"about_ca_topic_score_gemma":0.025807593,"teacher_disagreement_score":0.92890584,"about_ca_system_score_codex":0.00022933008,"about_ca_system_score_gemma":0.001049106,"threshold_uncertainty_score":0.9999329},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019328081,0.0062842136,0.02331276,0.0056814263,0.00085872994,0.00009275269,0.0005460093,0.00008854566,0.96313363],"genre_scores_gemma":[0.51147836,0.056267355,0.005040863,0.012083906,0.0068455846,0.00012731484,0.032672003,0.00034999833,0.37513462],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979656,0.000023829647,0.00037385605,0.0011775905,0.0001320031,0.0003271752],"domain_scores_gemma":[0.9981367,0.00012212209,0.00021780664,0.0011832769,0.000020250418,0.0003198631],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009514847,0.0003727179,0.00047597484,0.00011163574,0.00008422586,0.0010795732,0.0014661112,0.00025736075,0.00050474855],"category_scores_gemma":[0.000003226317,0.00037085018,0.00007080102,0.00007706489,0.00011980593,0.0015727492,0.0011153958,0.00026162423,0.002571221],"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.000004221995,0.000014624484,0.0000021759924,0.00005818657,0.00005670215,0.000019200841,0.00007031838,0.000010637548,7.613366e-8,0.0030030767,0.1786251,0.8181357],"study_design_scores_gemma":[0.0001933893,0.00006498588,0.000007885733,0.000027725908,0.000014558384,0.000023062255,0.00003836544,0.07331302,2.5144564e-7,0.00024129762,0.9256744,0.0004010609],"about_ca_topic_score_codex":0.000003000578,"about_ca_topic_score_gemma":0.000004511067,"teacher_disagreement_score":0.8177346,"about_ca_system_score_codex":0.00003678695,"about_ca_system_score_gemma":0.00017854116,"threshold_uncertainty_score":0.9999574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10076456,0.00031655055,0.8976124,0.0007147822,0.000045904726,0.00024227024,0.0000020261373,0.000037405407,0.00026411522],"genre_scores_gemma":[0.89583766,0.00007151806,0.103306904,0.00071697717,0.000011719747,0.000020535661,0.0000036267977,0.000005216242,0.000025845897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.000064083004,0.00028032903,0.00027168886,0.00009116283,0.00015787357],"domain_scores_gemma":[0.9990635,0.0004839654,0.00010408084,0.00022790945,0.000043332464,0.00007721022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000402047,0.00010685333,0.00023374487,0.00003310474,0.00007067546,0.000044446202,0.000251833,0.00004154805,0.0000041391067],"category_scores_gemma":[0.00003668021,0.000098520504,0.000027353397,0.000099691075,0.00008543456,0.00024672307,0.00045868912,0.00011137698,7.628723e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007004243,0.00023807569,0.01626221,0.00009270554,0.00017476815,0.0006976549,0.039037183,0.00016817161,0.00009523071,0.05110857,0.0015197244,0.89053565],"study_design_scores_gemma":[0.00049104495,0.00017315432,0.00016126192,0.00004293204,0.000009478476,0.00006449746,0.0012069879,0.99579245,0.000048384278,0.0017569145,0.00013918616,0.000113714916],"about_ca_topic_score_codex":0.00011327588,"about_ca_topic_score_gemma":0.000023368033,"teacher_disagreement_score":0.99562424,"about_ca_system_score_codex":0.000024835155,"about_ca_system_score_gemma":0.000019802854,"threshold_uncertainty_score":0.40175495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022798728,0.05909293,0.93614393,0.0012304146,0.00023543011,0.0004084123,0.000013701019,0.00007234358,0.0005229614],"genre_scores_gemma":[0.96652025,0.024498304,0.007887935,0.00060409156,0.00009177138,0.00016408948,0.000097465265,0.000012495422,0.00012362332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983713,0.0002284758,0.00053638424,0.00035502735,0.00020484212,0.0003039595],"domain_scores_gemma":[0.99656713,0.0008014615,0.0003263981,0.0018430616,0.0003685298,0.00009341321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011090374,0.00016750723,0.0002721764,0.000023733917,0.0006390993,0.00019246998,0.0011104802,0.00018260376,0.000008218573],"category_scores_gemma":[0.000014167538,0.00014936154,0.00012287764,0.00038071693,0.00019341671,0.0003083652,0.00063231826,0.0003723737,0.0000012715416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012833644,0.0005218391,0.0002842529,0.00014520594,0.00022455485,0.0000033188164,0.012299359,0.35356864,0.000024580553,0.26416114,0.02171141,0.34692734],"study_design_scores_gemma":[0.00028074914,0.000021448453,0.00007254802,0.0000500275,0.000039571303,0.000008891875,0.00022443132,0.92193305,0.000011183595,0.071533404,0.005672842,0.00015182773],"about_ca_topic_score_codex":0.000006420324,"about_ca_topic_score_gemma":0.00009182695,"teacher_disagreement_score":0.9642404,"about_ca_system_score_codex":0.000020005444,"about_ca_system_score_gemma":0.000114560375,"threshold_uncertainty_score":0.60907865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030934552,0.0000059079666,0.9785187,0.00034908243,0.00031758117,0.012202103,9.666207e-7,0.00013524739,0.008439477],"genre_scores_gemma":[0.94557536,8.6576415e-7,0.027716896,0.0016098766,0.00017488777,0.017991593,0.00005903508,0.000032505002,0.006838973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979587,0.000074335534,0.0006806228,0.00047938764,0.00034695497,0.00045997044],"domain_scores_gemma":[0.9982017,0.00030548006,0.000483698,0.00049288734,0.00034961026,0.00016656717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006598726,0.0002304293,0.00035180463,0.00006667849,0.00010220268,0.00020472359,0.0007347781,0.00013317072,0.00010994839],"category_scores_gemma":[0.00007185488,0.00022292798,0.00019769066,0.0001894021,0.000067032684,0.00028850662,0.0003739572,0.00031375317,0.000007907214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090046646,0.00088287506,0.002039052,0.0013414514,0.0004669063,0.0009936324,0.0041661966,0.21399507,0.00034376956,0.3029948,0.06046043,0.41141537],"study_design_scores_gemma":[0.0010086537,0.00033277023,0.000007875078,0.00037112355,0.000015883134,0.000025302394,0.000029693567,0.97484267,0.00041603172,0.00079355564,0.021921596,0.00023483855],"about_ca_topic_score_codex":0.000060599275,"about_ca_topic_score_gemma":0.0000027911792,"teacher_disagreement_score":0.9508018,"about_ca_system_score_codex":0.000055176595,"about_ca_system_score_gemma":0.00028679852,"threshold_uncertainty_score":0.90907395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036309354,0.0011221396,0.99555105,0.0012346834,0.00030300373,0.00039991506,0.000011084833,0.00014369143,0.00087133615],"genre_scores_gemma":[0.82280093,0.00041361898,0.17506918,0.0013538509,0.00011655496,0.000095576506,0.00006813155,0.000019234436,0.00006291863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839056,0.00018797514,0.00042991785,0.00042967094,0.00016840475,0.0003934876],"domain_scores_gemma":[0.9942703,0.0029120008,0.00021450124,0.0022233455,0.00024344558,0.00013637221],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007587636,0.00020741568,0.00026977435,0.0000501478,0.0014851646,0.00040828853,0.0013762272,0.00008429096,0.000004589123],"category_scores_gemma":[0.000017706325,0.0001754637,0.00010977875,0.00037051656,0.0001750866,0.0000973108,0.0011010156,0.00037537678,0.0000020579075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022461963,0.00011023178,0.00009114536,0.0000078736775,0.000022024211,0.000008224999,0.00018635736,0.011131538,0.000004991088,0.016972825,0.00022490625,0.97123766],"study_design_scores_gemma":[0.00043037342,0.000053028754,0.00006437906,0.00013672547,0.000029515286,0.000027105467,0.00017605246,0.9894915,0.000004151977,0.00017143528,0.009203992,0.00021174099],"about_ca_topic_score_codex":0.000022089818,"about_ca_topic_score_gemma":0.0000058117625,"teacher_disagreement_score":0.97835994,"about_ca_system_score_codex":0.000033223463,"about_ca_system_score_gemma":0.00020382347,"threshold_uncertainty_score":0.99981475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015577152,0.0001064648,0.9788325,0.00043807743,0.0014672393,0.00009346718,0.0000014359558,0.00005875512,0.0034249306],"genre_scores_gemma":[0.9276957,0.00009716895,0.07084524,0.0011270836,0.0001830215,0.0000052625815,0.000009415725,0.0000019906242,0.000035150617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998578,0.000027990318,0.00042001822,0.00026370594,0.00039660142,0.0003136869],"domain_scores_gemma":[0.9990153,0.000043352535,0.00011565933,0.00038956973,0.000274779,0.00016138819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057453976,0.000110632034,0.00013336,0.0001694237,0.00032319734,0.0009595534,0.0005470163,0.00004470879,0.000011638543],"category_scores_gemma":[0.0000050548965,0.00010443516,0.000025857727,0.0014289747,0.00019070115,0.0058295936,0.00042654428,0.00014017712,0.000044623346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012595379,0.000091678994,0.0023611863,0.000031065098,0.000008864311,0.000071114104,0.005383725,0.1294655,0.000042879055,0.15608582,0.01602085,0.6904247],"study_design_scores_gemma":[0.000227787,0.000022449136,0.008869947,0.000035452824,0.0000010980409,0.000091751455,0.000054872307,0.9841744,0.00002609802,0.00062138506,0.005736884,0.00013787724],"about_ca_topic_score_codex":0.0000029519379,"about_ca_topic_score_gemma":0.0000014600874,"teacher_disagreement_score":0.9121185,"about_ca_system_score_codex":0.0000369797,"about_ca_system_score_gemma":0.00027994043,"threshold_uncertainty_score":0.9252996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021236156,0.00012487812,0.9859195,0.0013348961,0.0012138394,0.010143473,0.000005596067,0.00006892588,0.0009765787],"genre_scores_gemma":[0.90285456,0.000034868244,0.086651966,0.002594196,0.004274765,0.0028478252,0.000032636297,0.00008623198,0.00062296493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636716,0.00020949748,0.0014169209,0.00055636535,0.00057354826,0.00087648514],"domain_scores_gemma":[0.99577564,0.00081915397,0.001324188,0.00061877444,0.00084807706,0.0006141866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016569745,0.00043088893,0.000875637,0.00015515235,0.00037543016,0.00055427715,0.0008142752,0.00034096595,0.00005251391],"category_scores_gemma":[0.000066611996,0.0003736392,0.00037075742,0.0005886389,0.00012189983,0.00046400042,0.00026738626,0.000874142,0.000002223236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019297309,0.0013945822,0.0019988387,0.00037886805,0.00078920095,0.007468004,0.0003095398,0.34813276,0.00021327849,0.124666125,0.09949062,0.41322845],"study_design_scores_gemma":[0.003594494,0.0005083375,0.00018848332,0.0004535166,0.00009512836,0.00093625014,0.000031511016,0.9807933,0.000041036277,0.0022075963,0.010708753,0.00044162018],"about_ca_topic_score_codex":0.000005524785,"about_ca_topic_score_gemma":0.0000069086063,"teacher_disagreement_score":0.9026422,"about_ca_system_score_codex":0.00009084411,"about_ca_system_score_gemma":0.0007747147,"threshold_uncertainty_score":0.99987155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029869583,0.00016257916,0.96476346,0.00005029431,0.002695159,0.00045479138,0.000057256722,0.000067541405,0.001879339],"genre_scores_gemma":[0.9728149,0.00016197452,0.025389794,0.00009633168,0.0001805243,0.000034477922,0.000021508793,0.00002129136,0.0012791845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751616,0.00019751009,0.000815164,0.0005858745,0.00051273505,0.0003725443],"domain_scores_gemma":[0.9980516,0.00024421958,0.00033966053,0.0005048525,0.0006044124,0.00025525395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063230726,0.0003506834,0.00048844976,0.00027214547,0.00022014965,0.00029204568,0.0008427073,0.00016809462,0.00035819295],"category_scores_gemma":[0.00003503054,0.00028947694,0.0001383272,0.000091337366,0.00017883207,0.0003374514,0.00010571037,0.00025039332,0.00009568959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059079943,0.0011477603,0.0014205518,0.00010974808,0.0010779288,0.0001266757,0.01306076,0.20180164,0.012733392,0.74375385,0.0005216155,0.023655294],"study_design_scores_gemma":[0.00048676963,0.00014286391,0.0000184296,0.0002334964,0.00003533631,0.00006290406,0.0003775461,0.99706894,0.00041770886,0.0005405336,0.00027539398,0.00034009627],"about_ca_topic_score_codex":0.00053908414,"about_ca_topic_score_gemma":0.000059419464,"teacher_disagreement_score":0.9429453,"about_ca_system_score_codex":0.00007680164,"about_ca_system_score_gemma":0.00014629793,"threshold_uncertainty_score":0.9999557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035263319,0.0010762704,0.990625,0.0011931566,0.0025396592,0.0005161797,0.0000050054773,0.00029511988,0.00022328006],"genre_scores_gemma":[0.9262051,0.00006588425,0.06991845,0.0026779727,0.0007135665,0.000009553827,0.000036496855,0.000026667232,0.00034628424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973904,0.00012900778,0.00061011803,0.00071473955,0.00029207647,0.0008636853],"domain_scores_gemma":[0.9980042,0.000447041,0.00026820583,0.00053825683,0.0003614153,0.00038090846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037000913,0.00029100126,0.0005031389,0.00006486565,0.00034719112,0.00041783263,0.0005795566,0.000156452,0.000023916049],"category_scores_gemma":[0.000041896885,0.00028882723,0.00025754297,0.0004230272,0.000026005293,0.00022603893,0.00023962457,0.000229706,0.000013948992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097319804,0.00017587129,0.00046768255,0.00003982318,0.00015003949,0.00025259034,0.00048635932,0.015338374,0.0004636391,0.22650798,0.004801878,0.75121844],"study_design_scores_gemma":[0.0036815167,0.00006465694,0.00011570516,0.000105919986,0.000049780945,0.00011811358,0.000054553522,0.98976004,0.00010471349,0.004200991,0.001407029,0.0003369924],"about_ca_topic_score_codex":0.000018171277,"about_ca_topic_score_gemma":0.0000060106113,"teacher_disagreement_score":0.9744217,"about_ca_system_score_codex":0.000077891564,"about_ca_system_score_gemma":0.0002628461,"threshold_uncertainty_score":0.99995637},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045854034,0.00016345287,0.9881484,0.0009232815,0.000101826925,0.000025654088,0.0000010279749,0.00009279344,0.010497718],"genre_scores_gemma":[0.58260006,0.00009918015,0.41532233,0.001556698,0.000029550885,0.0000037711002,0.00003249562,0.0000049711834,0.0003509724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921894,0.00009586282,0.00015164528,0.00024893982,0.00014615459,0.0001384292],"domain_scores_gemma":[0.99910897,0.00017062286,0.00006149135,0.00048765345,0.00010593033,0.00006531614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018314383,0.00008663695,0.00010438335,0.000021110374,0.00016329874,0.00015566981,0.0002251807,0.00005674356,0.000022571756],"category_scores_gemma":[0.000005448675,0.00008214739,0.000019530265,0.0002191193,0.000025200849,0.00017170922,0.00011619605,0.000076198856,0.0000013638868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036870647,0.00008857509,0.00047926343,0.000005834665,0.000008466035,0.000030510717,0.00011801675,0.12536412,0.000010287822,0.04798936,0.0006079905,0.8252939],"study_design_scores_gemma":[0.00020991468,0.000015698473,0.000047380643,0.000030802814,0.0000032547543,0.000008803166,0.00001809951,0.99847496,0.000109391796,0.00036732128,0.00060775207,0.000106644715],"about_ca_topic_score_codex":0.000032073713,"about_ca_topic_score_gemma":0.000004121886,"teacher_disagreement_score":0.87311083,"about_ca_system_score_codex":0.000017072563,"about_ca_system_score_gemma":0.0000707659,"threshold_uncertainty_score":0.33498734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2668423,0.0023276315,0.702201,0.001550686,0.0131806815,0.00032564648,0.0000014131589,0.00014807451,0.013422543],"genre_scores_gemma":[0.9853582,0.000008693328,0.012683725,0.00013065839,0.00008964653,0.000009665292,0.000014117334,0.000003913727,0.0017014078],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806124,0.00009182017,0.00045347592,0.00079188356,0.00028329843,0.00031829072],"domain_scores_gemma":[0.99845344,0.00011605748,0.00013007301,0.0009826927,0.00017325381,0.00014449957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015653194,0.00009614247,0.00018566195,0.000052911095,0.00027630624,0.0005529515,0.00013893588,0.000053852742,0.000047811656],"category_scores_gemma":[0.000054052332,0.000091411166,0.000042815413,0.0008574681,0.00013500411,0.00031941425,0.00022402742,0.000105662664,0.000005192277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015424772,0.0005134342,0.43020532,0.00005188885,0.000048535818,0.013135166,0.0016612172,0.00790802,0.001894673,0.055619348,0.097731665,0.3912153],"study_design_scores_gemma":[0.00035217096,0.000014723816,0.021429224,0.000047082933,0.000011240544,0.00086385343,0.000032331376,0.712994,0.00026835405,0.21384332,0.04981006,0.00033366555],"about_ca_topic_score_codex":0.000011615938,"about_ca_topic_score_gemma":0.00010772779,"teacher_disagreement_score":0.7185159,"about_ca_system_score_codex":0.000024639832,"about_ca_system_score_gemma":0.00033730845,"threshold_uncertainty_score":0.53321236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.296868e-7,0.0019723643,0.93724066,0.000106925196,0.0020029754,0.029645937,0.000024351386,0.00014845957,0.028858101],"genre_scores_gemma":[0.60749656,0.0009717878,0.014084103,0.004469626,0.027476178,0.25478345,0.0018601493,0.0011686285,0.08768949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951578,0.00014509949,0.0014445977,0.0015868915,0.0005308475,0.0011347567],"domain_scores_gemma":[0.9960079,0.001284066,0.000859802,0.0011536907,0.0002933985,0.00040113347],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001037829,0.0009969192,0.0014783865,0.00021171347,0.0003970321,0.00087695627,0.0008042812,0.0014570353,0.000024353481],"category_scores_gemma":[0.00002140963,0.00088752445,0.000320719,0.00021345406,0.00014589114,0.00009378125,0.0005153393,0.0010679547,0.000001428512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056579778,0.00004495712,0.000021577169,0.0002710431,0.00010115908,0.00043894007,0.000074229145,0.46424755,3.4304975e-7,0.36285326,0.001595132,0.17029522],"study_design_scores_gemma":[0.0008063359,0.00015170703,0.0000011748274,0.0022833992,0.0000480339,0.00022089866,0.0000039627153,0.92064744,1.6510761e-7,0.004032542,0.07091402,0.0008903206],"about_ca_topic_score_codex":0.00006818159,"about_ca_topic_score_gemma":0.00009921601,"teacher_disagreement_score":0.92315656,"about_ca_system_score_codex":0.0001563414,"about_ca_system_score_gemma":0.0003048141,"threshold_uncertainty_score":0.9998393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056168042,0.0011561075,0.94137937,0.0004627579,0.00012986705,0.00032761076,0.00001241185,0.000056871002,0.00030694337],"genre_scores_gemma":[0.9629082,0.00007671322,0.03676192,0.000072541596,0.000042093943,0.00003899297,0.00008589289,0.0000076102156,0.0000060259526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847555,0.00038464833,0.00038394405,0.00024076061,0.0003260742,0.00018900303],"domain_scores_gemma":[0.9969563,0.0007337746,0.00026683143,0.0006967948,0.001293999,0.000052340503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019543294,0.0000999936,0.00021041496,0.00006758612,0.00056209415,0.00010219815,0.0004915124,0.00007694507,0.000002328159],"category_scores_gemma":[0.000042834457,0.0001119374,0.0000707229,0.00045851732,0.00008528453,0.0001107658,0.00040248322,0.00012286365,2.8077002e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018445866,0.00011761472,0.00047899463,0.000031222946,0.000023710045,3.3962073e-7,0.00063477375,0.001351722,0.00012297765,0.02509162,0.000041696283,0.9721035],"study_design_scores_gemma":[0.0005947506,0.000027658882,0.00047518595,0.00006373409,0.00006869267,0.0000034699126,0.00031611556,0.9968563,0.00018140998,0.00066455465,0.000632317,0.00011583736],"about_ca_topic_score_codex":0.000015360476,"about_ca_topic_score_gemma":0.000008906058,"teacher_disagreement_score":0.99550456,"about_ca_system_score_codex":0.000057536043,"about_ca_system_score_gemma":0.00034975348,"threshold_uncertainty_score":0.45646748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042180368,0.00079953135,0.9565997,0.0010212271,0.0052472088,0.00019439936,0.0000037200882,0.00046034984,0.035252072],"genre_scores_gemma":[0.91766757,0.0003609276,0.07338245,0.0020636392,0.0013749237,0.00003617709,0.00018406383,0.000025446647,0.0049048066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977718,0.00011837637,0.0003896388,0.0008811096,0.00038935523,0.00044972985],"domain_scores_gemma":[0.99790096,0.00013815242,0.00019375216,0.0013565437,0.00020331079,0.00020729756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033604927,0.0003166088,0.00043162922,0.00004357817,0.00012373523,0.0007030154,0.0010546098,0.0004732103,0.00029944812],"category_scores_gemma":[0.0000046714977,0.000301087,0.00018777436,0.00021239732,0.00004070056,0.00018536052,0.0025109795,0.00073231,0.00005624625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001422511,0.00017269874,0.001791919,0.00019036287,0.00025492936,0.0011908814,0.00043164325,0.063966654,0.0000031211873,0.11291848,0.34424496,0.47482014],"study_design_scores_gemma":[0.00013206017,0.000021503289,0.00065597595,0.00023338292,0.000023506116,0.000038300826,0.000017481954,0.9837488,0.000003914649,0.0074270354,0.007243976,0.00045405896],"about_ca_topic_score_codex":0.00006981186,"about_ca_topic_score_gemma":0.000029462433,"teacher_disagreement_score":0.91978216,"about_ca_system_score_codex":0.00005791553,"about_ca_system_score_gemma":0.00049341744,"threshold_uncertainty_score":0.99994415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006144747,0.00022699714,0.98884076,0.0003206639,0.0010993452,0.00016254329,0.000005630552,0.00029205886,0.008990579],"genre_scores_gemma":[0.67084247,0.000049335456,0.3220885,0.0011237165,0.00021452099,0.000050625767,0.000043350257,0.000022178638,0.0055652903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978483,0.00010344637,0.0004521785,0.00073115487,0.00023266584,0.0006322642],"domain_scores_gemma":[0.99803954,0.0005726621,0.00014816289,0.00065167155,0.000303061,0.00028490918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000416371,0.00025176376,0.00037539407,0.00006126951,0.00032498248,0.00028410414,0.00053006306,0.00013813312,0.0000630828],"category_scores_gemma":[0.000032268425,0.00022999258,0.00020387374,0.00036662558,0.000058678535,0.00012553851,0.000372226,0.00013379863,0.0000051828074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006086503,0.00053763756,0.000049820126,0.000020100124,0.00014112634,0.00037112815,0.00030879703,0.12565158,0.00009882913,0.54157245,0.004724486,0.3264632],"study_design_scores_gemma":[0.0012090307,0.000044863606,0.000016344084,0.000028565246,0.000022509465,0.000053881355,0.00009570868,0.99593365,0.000096020776,0.0004557465,0.0017269207,0.0003167739],"about_ca_topic_score_codex":0.000021307183,"about_ca_topic_score_gemma":0.00000844387,"teacher_disagreement_score":0.87028205,"about_ca_system_score_codex":0.000047510595,"about_ca_system_score_gemma":0.00030992622,"threshold_uncertainty_score":0.93788254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29404768,0.00016487578,0.7047062,0.0001024923,0.00021360593,0.00024491834,0.000016506227,0.000029496192,0.00047424322],"genre_scores_gemma":[0.9886211,0.000054900724,0.010904881,0.000071265815,0.000097476295,0.000029649998,0.00016915152,0.0000073816745,0.00004420079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984948,0.0001799983,0.00035263592,0.00040446545,0.00027958272,0.00028851768],"domain_scores_gemma":[0.9987303,0.0002521926,0.00010122752,0.00026627546,0.0005203764,0.00012962254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059318985,0.00015545369,0.00024933653,0.000039933235,0.0001676328,0.00012406918,0.00017352765,0.00013458832,0.000034795572],"category_scores_gemma":[0.00003971741,0.00013954456,0.000037241385,0.00036016325,0.00009007046,0.0005363996,0.00012226916,0.0001958339,5.029346e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037078818,0.0005175739,0.06870873,0.000060970207,0.000110619905,0.000023562448,0.0007729291,0.058557495,0.00031629388,0.10423191,0.0018013561,0.7645278],"study_design_scores_gemma":[0.00086206855,0.0001782995,0.025362777,0.000033223947,0.000034898603,0.000018435783,0.00015246494,0.96971655,0.00016906227,0.003252299,0.000055338987,0.00016460213],"about_ca_topic_score_codex":0.000010863912,"about_ca_topic_score_gemma":0.00007708438,"teacher_disagreement_score":0.91115904,"about_ca_system_score_codex":0.00006339119,"about_ca_system_score_gemma":0.00026931232,"threshold_uncertainty_score":0.5690462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013586337,0.00084106665,0.9579071,0.001527242,0.0021891673,0.0002681815,0.0000034331065,0.00023322961,0.035671983],"genre_scores_gemma":[0.9377488,0.0002170909,0.055878285,0.0023273204,0.00077458256,0.000052473846,0.00019291922,0.000027178325,0.0027813888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702364,0.00031183677,0.00064033736,0.0010555133,0.00035803264,0.0006106185],"domain_scores_gemma":[0.9979324,0.00028250398,0.000246143,0.001257604,0.000113740214,0.00016762422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551072,0.0003473969,0.00057799893,0.00013179662,0.00009429996,0.00030719492,0.0011436008,0.00065030454,0.00029489814],"category_scores_gemma":[0.000010629768,0.00035012464,0.00016473279,0.00040470238,0.00006483158,0.00015986037,0.0022272964,0.0009869764,0.000028256647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005680541,0.00023470838,0.0024842555,0.00014309389,0.00012395612,0.0018127529,0.003789442,0.2998931,0.0000016080205,0.09071538,0.08794458,0.5128003],"study_design_scores_gemma":[0.00024470332,0.00003978719,0.0006977265,0.00019271875,0.000011602152,0.000030872536,0.0002829262,0.97979456,0.0000018265922,0.008188256,0.010102723,0.00041226705],"about_ca_topic_score_codex":0.0004075835,"about_ca_topic_score_gemma":0.00068402913,"teacher_disagreement_score":0.9363901,"about_ca_system_score_codex":0.000110518944,"about_ca_system_score_gemma":0.0005460057,"threshold_uncertainty_score":0.9998951},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004754999,0.00044821214,0.9968112,0.000523419,0.00012841029,0.0013828551,0.000041043793,0.00018825076,0.00042905126],"genre_scores_gemma":[0.98259544,0.00008454084,0.010815013,0.00084110926,0.0007734497,0.004418689,0.00031408173,0.000029927474,0.00012772145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796164,0.0000778211,0.0004534399,0.00072016317,0.00017097853,0.0006159638],"domain_scores_gemma":[0.9983941,0.0003883349,0.00016835029,0.00054723397,0.00021859183,0.00028344474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046531137,0.00025717623,0.00038302352,0.000042503078,0.0008377833,0.0002360494,0.00042222955,0.0002713559,0.000017321316],"category_scores_gemma":[0.0000028152838,0.00026903785,0.00017275327,0.00054284,0.00016937128,0.00009640776,0.00019358071,0.00028004596,0.0000012767352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022560404,0.00032254978,0.00031335314,0.00009071272,0.000071213304,0.000024830846,0.000029257075,0.13720879,0.00004446109,0.151375,0.0068045887,0.7036927],"study_design_scores_gemma":[0.00037108373,0.0000389455,0.00010899968,0.000027294433,0.000053364507,0.0000172909,0.000042218788,0.9349797,0.000032900378,0.002734825,0.06128327,0.00031013542],"about_ca_topic_score_codex":0.000006366902,"about_ca_topic_score_gemma":0.000006798119,"teacher_disagreement_score":0.9859962,"about_ca_system_score_codex":0.000055459896,"about_ca_system_score_gemma":0.00018696247,"threshold_uncertainty_score":0.99997616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002626517,0.000094649884,0.99493784,0.000098584154,0.00042985144,0.00027151388,0.00001469165,0.000103171784,0.0014231799],"genre_scores_gemma":[0.7223437,0.000010688376,0.27627954,0.00042702528,0.0002195572,0.000056457342,0.000053113705,0.000009878534,0.0006000747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862576,0.00005517692,0.00027361364,0.00042261754,0.00017339221,0.0004494701],"domain_scores_gemma":[0.9990625,0.00020749698,0.000050095754,0.0004569521,0.00008346028,0.00013950342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003038746,0.000121675075,0.00019729936,0.000034682398,0.00017894834,0.00016024664,0.0003018626,0.00008291154,0.00008475985],"category_scores_gemma":[0.0000010820629,0.00011836613,0.000056142682,0.00036890467,0.000014497044,0.00032350633,0.000117256306,0.00009945817,0.0000060928464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051568363,0.0004913531,0.0027132954,0.000008148547,0.000019745163,0.00006590126,0.0006615405,0.1404067,0.000046174264,0.025301727,0.0020299288,0.82825035],"study_design_scores_gemma":[0.00042555894,0.0000740535,0.00011127325,0.00001896057,0.000004999437,0.000005251123,0.00013839264,0.99185073,0.0000711218,0.0044882623,0.0026450856,0.00016632774],"about_ca_topic_score_codex":0.000008642577,"about_ca_topic_score_gemma":0.00013435654,"teacher_disagreement_score":0.851444,"about_ca_system_score_codex":0.000044435692,"about_ca_system_score_gemma":0.00011438521,"threshold_uncertainty_score":0.48268306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07805127,0.00027190705,0.9205201,0.000039085313,0.00048721727,0.0002998259,0.000007633495,0.00014345597,0.00017950352],"genre_scores_gemma":[0.99766076,0.000041074563,0.001765087,0.000083190615,0.00019228431,0.00021647646,0.000001580582,0.0000124770095,0.00002708726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983585,0.000027429402,0.00025218382,0.00050339283,0.00047447014,0.00038400947],"domain_scores_gemma":[0.9989099,0.00014374398,0.000072878625,0.00039222205,0.00032583406,0.00015540338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028698336,0.00017204705,0.00024027613,0.00011332459,0.00046991353,0.000096985095,0.00032601616,0.000066955814,0.0000016369918],"category_scores_gemma":[0.00000145996,0.0001724614,0.00008893296,0.0011972556,0.00014859742,0.00007764971,0.000012018848,0.00021031323,0.00000727019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008863911,0.00008233661,2.0026681e-7,0.000024679652,0.000013294374,0.000008842385,0.00057575834,0.9308384,0.0010665032,0.001185786,0.000040551182,0.06615481],"study_design_scores_gemma":[0.0001520686,0.00015887212,0.0000061492774,0.00008578127,0.000020092195,0.000051616877,0.00026140752,0.99553686,0.0020877384,0.000012252022,0.0014550647,0.00017208133],"about_ca_topic_score_codex":0.0000016526288,"about_ca_topic_score_gemma":9.7967e-7,"teacher_disagreement_score":0.9196095,"about_ca_system_score_codex":0.000114706236,"about_ca_system_score_gemma":0.00015436162,"threshold_uncertainty_score":0.7032772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037704995,0.0002476721,0.9894437,0.0035389378,0.0010412268,0.00081401144,0.000027209655,0.001039765,0.00007698565],"genre_scores_gemma":[0.8705495,0.00003352062,0.12739573,0.0015836831,0.000075862066,0.00018819731,0.000011142828,0.000028881104,0.00013345962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973934,0.000065287626,0.0005073223,0.00090521085,0.00030103856,0.000827702],"domain_scores_gemma":[0.9981722,0.00013229297,0.00017118388,0.001055158,0.00027493964,0.00019422987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026680285,0.00042980435,0.000488429,0.00052227196,0.00049844664,0.00010007566,0.001008696,0.00081585435,0.00002527649],"category_scores_gemma":[0.0000038236676,0.00042044386,0.00031667206,0.0010740495,0.00017436588,0.00025999296,0.0000070893457,0.0008671031,0.00003322942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000439325,0.0030754253,0.000060618375,0.000048603793,0.00040798474,0.00067533524,0.00024379186,0.15819257,0.0029181307,0.0154293515,0.0031289447,0.8153799],"study_design_scores_gemma":[0.001992992,0.00064000976,0.000020148824,0.000074083,0.000059095102,0.00006249955,0.000022213477,0.988055,0.0032463348,0.001136469,0.004227885,0.0004632848],"about_ca_topic_score_codex":0.000006813164,"about_ca_topic_score_gemma":0.000019137093,"teacher_disagreement_score":0.866779,"about_ca_system_score_codex":0.00011077385,"about_ca_system_score_gemma":0.00015520358,"threshold_uncertainty_score":0.99982476},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061385516,0.0038673338,0.92398745,0.0055856803,0.0004095511,0.00092483195,0.00048458957,0.00007762532,0.0032774287],"genre_scores_gemma":[0.89357424,0.002698011,0.101190515,0.00034614195,0.000096866665,0.00035596362,0.0013042471,0.000023896322,0.00041009375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995464,0.00111377,0.00132433,0.00093951274,0.00051426847,0.0006440969],"domain_scores_gemma":[0.9937819,0.0011956912,0.00019309125,0.003058994,0.0015282708,0.00024202581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000954087,0.0004663066,0.0011002994,0.0005685499,0.00062489446,0.00020382789,0.0020915652,0.00029132763,0.0003656855],"category_scores_gemma":[0.0001411192,0.00048896816,0.00039747232,0.0033566442,0.00041603303,0.000621279,0.00076899485,0.0007882014,0.000015898833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012966564,0.007385305,0.008324411,0.00070541096,0.008322432,0.00024514968,0.025279544,0.20724577,0.010461142,0.26098803,0.011033761,0.4587124],"study_design_scores_gemma":[0.0010295627,0.0001843135,0.0012630523,0.00023261837,0.0003962623,0.000015613761,0.0012771495,0.9901103,0.0009963803,0.002185593,0.0017905076,0.00051865715],"about_ca_topic_score_codex":0.0011499048,"about_ca_topic_score_gemma":0.0072509497,"teacher_disagreement_score":0.8321887,"about_ca_system_score_codex":0.00019087306,"about_ca_system_score_gemma":0.0016273543,"threshold_uncertainty_score":0.9997562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37168047,0.000009144275,0.6266536,0.000045198714,0.0005910385,0.00038691715,0.000021747564,0.00010823627,0.00050362456],"genre_scores_gemma":[0.99890023,0.0000030950143,0.00065514125,0.00017765709,0.00003537448,0.00013381867,0.0000016383375,0.000016730308,0.000076318465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980673,0.0002958672,0.0003789811,0.0004628073,0.00045512134,0.0003398869],"domain_scores_gemma":[0.9977643,0.0010486355,0.00017619913,0.00086346397,0.000056031764,0.00009138878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175317,0.00020821123,0.00024176548,0.00014513698,0.00091864046,0.000058385624,0.0007723715,0.000047429254,0.00025706572],"category_scores_gemma":[0.000002353991,0.0001596253,0.00030979287,0.00056402327,0.000060326314,0.00007573676,0.00001729694,0.0007633981,0.00001643271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004768926,0.00094616186,0.000032587865,0.000004326715,0.000030679406,0.000016482481,0.0005394126,0.7643908,0.00021754538,0.0007852408,0.0003054432,0.2326836],"study_design_scores_gemma":[0.00028618425,0.0014026697,0.00019641675,0.00003580531,0.000015986881,0.000027252087,0.00013023899,0.99634284,0.0009922828,0.0003342285,0.00004318453,0.00019291021],"about_ca_topic_score_codex":0.000075304386,"about_ca_topic_score_gemma":0.0000010087308,"teacher_disagreement_score":0.62721974,"about_ca_system_score_codex":0.00022122901,"about_ca_system_score_gemma":0.00011771251,"threshold_uncertainty_score":0.7065533},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069841735,0.00080702413,0.9276036,0.00036980544,0.0010317657,0.00022430457,0.00002942449,0.000042652948,0.000049696366],"genre_scores_gemma":[0.67348474,0.00005617609,0.32573575,0.00045235123,0.00015920051,0.000011746982,0.000051907362,0.000015201005,0.00003294672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976748,0.00005702221,0.0010228526,0.000360477,0.00047945324,0.00040539086],"domain_scores_gemma":[0.99748343,0.00026085798,0.00071281265,0.00038208216,0.00095813494,0.00020267227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005198379,0.00022328438,0.00046204805,0.00006518823,0.00016927606,0.00007449008,0.000367916,0.00012327135,0.0000076157557],"category_scores_gemma":[0.000013372596,0.00020960331,0.00034863962,0.00037241852,0.00003802229,0.00073877146,0.00000619548,0.00028267805,8.520895e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031268163,0.00018942387,0.00020053131,0.00005076157,0.00003659632,0.00022934383,0.00037541892,0.93338394,0.0006468009,0.0021549633,0.0002601903,0.062159374],"study_design_scores_gemma":[0.00222586,0.0002335013,0.0010993015,0.00013006481,0.00008271484,0.00005030247,0.0000732327,0.9798854,0.0006896758,0.014330247,0.0009414849,0.00025823878],"about_ca_topic_score_codex":0.0000015419151,"about_ca_topic_score_gemma":0.000018380417,"teacher_disagreement_score":0.603643,"about_ca_system_score_codex":0.00007092002,"about_ca_system_score_gemma":0.00071323785,"threshold_uncertainty_score":0.8547375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076990975,0.0008569259,0.9844908,0.0015002241,0.0014962922,0.000603045,0.00039029302,0.00019409336,0.0027691948],"genre_scores_gemma":[0.8861455,0.00058647455,0.1111183,0.0002801466,0.00009474771,0.00008475226,0.0015282476,0.00001356972,0.00014830078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972396,0.00022590754,0.0009820244,0.000617003,0.00043307873,0.0005023895],"domain_scores_gemma":[0.99532735,0.0004528316,0.00045303447,0.002243166,0.0012912413,0.00023236922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005240655,0.00031781997,0.00047759368,0.000070755435,0.00065366214,0.00065555144,0.0020256655,0.0002565284,0.000047085658],"category_scores_gemma":[0.000028532915,0.00035137436,0.00017555074,0.0008033385,0.00012935112,0.00058913504,0.00021283132,0.0003791899,0.000053874817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025108704,0.0004040167,0.0011886338,0.00008593721,0.00016748307,0.000022018832,0.000547722,0.00344829,0.000104106846,0.7900681,0.004326109,0.19961248],"study_design_scores_gemma":[0.0008289672,0.000093064446,0.0038232955,0.00024405173,0.00009313264,0.00004445343,0.0008243304,0.9755079,0.00012296478,0.0072706207,0.010609693,0.00053750677],"about_ca_topic_score_codex":0.000562059,"about_ca_topic_score_gemma":0.0013368812,"teacher_disagreement_score":0.9720596,"about_ca_system_score_codex":0.00029431746,"about_ca_system_score_gemma":0.0008155606,"threshold_uncertainty_score":0.99989384},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.11721256e-7,0.00018726691,0.5096403,0.0001482678,0.0008259816,0.00013258388,0.0000012498468,0.0002515807,0.48881266],"genre_scores_gemma":[0.008048802,0.00022112453,0.014506557,0.002240488,0.00115153,0.000008915962,0.000036524354,0.000052459392,0.9737336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780643,0.000022703378,0.00048176202,0.00079915154,0.00042440117,0.0004655697],"domain_scores_gemma":[0.99777776,0.00014147772,0.0002662626,0.0014009167,0.00011043524,0.00030313464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035157055,0.00047602592,0.0005821774,0.000095637486,0.0001379259,0.00020878615,0.0012275957,0.0006324008,0.00068506575],"category_scores_gemma":[0.0000016400797,0.0004094101,0.00022717276,0.00004497981,0.000108233195,0.00015030825,0.00056736293,0.0006563617,0.000585345],"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.0000033026845,0.0000063973894,0.0000026610307,0.000008705966,0.000028511848,0.000045668017,0.000007611071,0.000034143275,6.3288546e-8,0.66813743,0.069265805,0.26245973],"study_design_scores_gemma":[0.00015844464,0.000061431914,0.0000031404998,0.00008058166,0.000021720829,0.000038944057,2.3790685e-7,0.5212858,4.7452525e-7,0.03940254,0.43845838,0.00048830645],"about_ca_topic_score_codex":0.000007726581,"about_ca_topic_score_gemma":0.00001131132,"teacher_disagreement_score":0.6287349,"about_ca_system_score_codex":0.000042775693,"about_ca_system_score_gemma":0.0001237522,"threshold_uncertainty_score":0.9998358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020203133,0.013311521,0.9626533,0.00027916906,0.0020730244,0.00085105834,0.000059953134,0.00012516165,0.02062663],"genre_scores_gemma":[0.9924574,0.0008895038,0.0012388487,0.0010050049,0.0022913972,0.00008208707,0.0009980614,0.00012469091,0.0009130141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955055,0.0004616752,0.0012026314,0.0012850902,0.0006051512,0.00093995],"domain_scores_gemma":[0.99575615,0.00143083,0.0005565094,0.0020041817,0.00006587657,0.00018646529],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023898561,0.000778815,0.001430754,0.00036147152,0.00062644825,0.00050483656,0.0025040617,0.0011119997,0.00007220689],"category_scores_gemma":[0.000014014321,0.00075471017,0.00016867211,0.00034820256,0.00013571711,0.00032443725,0.0020776072,0.0031887514,0.0000016935356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065453074,0.000044960565,0.00043454624,0.00009996459,0.000082271225,0.000644079,0.00027861027,0.846825,1.2828255e-7,0.025479136,0.0020639554,0.12398187],"study_design_scores_gemma":[0.0006759794,0.000067846464,0.000026338264,0.00051290885,0.000039274328,0.0000719056,0.0000058459395,0.93263185,1.7557085e-8,0.0022856526,0.062937245,0.0007451253],"about_ca_topic_score_codex":0.00049973855,"about_ca_topic_score_gemma":0.00079438847,"teacher_disagreement_score":0.9924372,"about_ca_system_score_codex":0.00022961885,"about_ca_system_score_gemma":0.00019722193,"threshold_uncertainty_score":0.9994904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010942031,0.0023682239,0.99539566,0.00056060066,0.000562647,0.0006785757,0.000010598108,0.00010117535,0.0002131271],"genre_scores_gemma":[0.45352572,0.0006165241,0.5450908,0.00037542157,0.0002264224,0.0000784501,0.000020172512,0.00001270387,0.00005376485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978071,0.00023468598,0.00049524434,0.00074433157,0.00032894002,0.0003897053],"domain_scores_gemma":[0.99543166,0.0029722957,0.0004385135,0.0007218224,0.0003336653,0.000102061276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090990507,0.00031063645,0.0008392306,0.00018242805,0.00029214835,0.00035072732,0.0010061177,0.00053524214,0.000028881475],"category_scores_gemma":[0.000018634713,0.00022328898,0.0005061581,0.0012563574,0.00009796625,0.00007955373,0.0013521049,0.0006153821,2.835021e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001741519,0.00041468203,0.0005857839,0.00013513607,0.017993538,0.00006476221,0.007284637,0.19731829,4.0981882e-7,0.36863577,0.006398667,0.40099418],"study_design_scores_gemma":[0.00015206644,0.00003735826,0.00060209824,0.000030787436,0.002117433,0.0000021879757,0.00014759102,0.98582464,0.0000017379252,0.010778206,0.000059521073,0.00024634606],"about_ca_topic_score_codex":0.000026330204,"about_ca_topic_score_gemma":0.0000061386927,"teacher_disagreement_score":0.7885064,"about_ca_system_score_codex":0.000050051665,"about_ca_system_score_gemma":0.00032165356,"threshold_uncertainty_score":0.91054606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050509367,0.0017068791,0.9775665,0.001024175,0.0002880528,0.0002660758,0.000009051831,0.000079199934,0.01400916],"genre_scores_gemma":[0.9787558,0.0014444063,0.018381163,0.000794776,0.000045181794,0.00005817191,0.00036739028,0.0000075125004,0.00014561268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986659,0.00015008582,0.0003859469,0.00042009886,0.00014400702,0.00023395228],"domain_scores_gemma":[0.9985355,0.00037824918,0.00016147851,0.0006783114,0.00014093705,0.00010552526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031717125,0.00020691114,0.0003003968,0.000114478,0.000095043055,0.0004831074,0.0007327843,0.000256973,0.000048601913],"category_scores_gemma":[0.0000080321315,0.00020714417,0.00006512694,0.00016508938,0.00011306503,0.0003753592,0.0033522127,0.0008149688,0.0000026562027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019257432,0.00022916113,0.0014086501,0.00008231527,0.00009012888,0.00009247646,0.0118628545,0.00037264303,0.0000016841567,0.004443928,0.0026175445,0.9787794],"study_design_scores_gemma":[0.00026324968,0.000018139053,0.00027802918,0.00043410447,0.0000141560295,0.000042740583,0.0011760278,0.9965852,0.0000012773542,0.0007444701,0.00021456715,0.00022804317],"about_ca_topic_score_codex":0.00008322019,"about_ca_topic_score_gemma":0.00037206447,"teacher_disagreement_score":0.99621254,"about_ca_system_score_codex":0.00004898416,"about_ca_system_score_gemma":0.00012650533,"threshold_uncertainty_score":0.8447094},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015052937,0.000041287592,0.9258128,0.00029572294,0.0021335958,0.05836728,0.00000973914,0.00059273874,0.012745325],"genre_scores_gemma":[0.09430004,0.0000031406992,0.2408772,0.004798991,0.0012371738,0.6520937,0.00043206886,0.0001374552,0.0061202263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953904,0.00018938066,0.001076426,0.001754537,0.0006232152,0.00096601824],"domain_scores_gemma":[0.9956856,0.00044785358,0.00075821934,0.002068752,0.0005364856,0.0005031114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091327063,0.0007138462,0.00085945235,0.00017706136,0.0002343009,0.0005526683,0.0018884259,0.00068532507,0.00025248193],"category_scores_gemma":[0.000027356296,0.0006832685,0.00057899306,0.00020509018,0.000112056485,0.00008577491,0.0017268369,0.0007174476,0.000003269384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017513568,0.0013003213,0.000040051193,0.0009833508,0.00021890996,0.0007322539,0.0003247515,0.34722993,0.000009178836,0.31391034,0.12655643,0.20851935],"study_design_scores_gemma":[0.00089377025,0.00009156265,0.000002897184,0.00046087624,0.000039526385,0.000012744288,0.000013246764,0.9434685,0.000006869185,0.00051675097,0.053716272,0.0007769736],"about_ca_topic_score_codex":0.000091515656,"about_ca_topic_score_gemma":0.000014708623,"teacher_disagreement_score":0.6849356,"about_ca_system_score_codex":0.00067276676,"about_ca_system_score_gemma":0.0037898198,"threshold_uncertainty_score":0.99956185},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2919428e-7,0.0001956396,0.43157423,0.000038100254,0.0009336908,0.00011380117,0.0000029670643,0.00019620515,0.56694514],"genre_scores_gemma":[0.0010273928,0.000099191304,0.013500888,0.0013630566,0.0053037815,0.000011145762,0.000023589904,0.000038754064,0.9786322],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831516,0.000012284645,0.00033591955,0.0005645314,0.00035392088,0.00041818628],"domain_scores_gemma":[0.9988956,0.000050378952,0.00018554805,0.0006079204,0.00011773057,0.00014282779],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002012252,0.00032917297,0.0003967453,0.000047027148,0.00024405922,0.00016461764,0.0009799226,0.0004928038,0.0035444968],"category_scores_gemma":[3.3853445e-7,0.00029642048,0.00020188709,0.000040575236,0.00014766109,0.00011577223,0.0005168217,0.00032242565,0.0021416862],"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.0000019717206,0.0000036751312,4.2602787e-7,0.000003306699,0.000023511182,0.000030234572,0.00006923245,0.0000018011867,3.0593807e-8,0.44576386,0.47656983,0.07753212],"study_design_scores_gemma":[0.000082371844,0.00010190848,4.851341e-7,0.000027399306,0.000016217336,0.000014077846,0.0000014800346,0.0227844,1.6894042e-7,0.1994153,0.7772216,0.00033453899],"about_ca_topic_score_codex":0.0000022212557,"about_ca_topic_score_gemma":0.0000040674454,"teacher_disagreement_score":0.41807333,"about_ca_system_score_codex":0.000035467634,"about_ca_system_score_gemma":0.00014849757,"threshold_uncertainty_score":0.9999488},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.917582e-9,0.00046935162,0.49559984,0.000032372373,0.000496459,0.00004323166,0.0000012128206,0.0004638419,0.5028937],"genre_scores_gemma":[0.00005035269,0.002853242,0.06665688,0.0012178548,0.00043738607,0.000002388539,0.000006630195,0.00011841935,0.9286569],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900967,0.000011073955,0.00013384894,0.00033172918,0.00024375353,0.00026993014],"domain_scores_gemma":[0.99910223,0.000028082997,0.00008238295,0.0006370975,0.000016078087,0.00013414753],"candidate_categories":["bibliometrics","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012835559,0.00017398989,0.00018381182,0.017317036,0.000021681932,0.00009914187,0.00074793125,0.00026076334,0.0035352195],"category_scores_gemma":[1.9241695e-7,0.00014128473,0.00010429462,0.010080503,0.000037964277,0.00004458743,0.00013850989,0.00014079969,0.0007585773],"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":[2.6828795e-7,0.000011286862,0.000029113742,0.0000047390186,0.000016206055,0.0000450122,0.0000015104508,3.7644416e-8,5.383311e-8,0.021709014,0.9263695,0.0518133],"study_design_scores_gemma":[0.000069440706,0.000014099797,0.000004960311,0.0000307978,0.0000045149945,0.000008813368,8.24859e-7,0.007480866,5.531589e-7,0.0007363644,0.99144864,0.0002001261],"about_ca_topic_score_codex":0.00007869422,"about_ca_topic_score_gemma":0.000011362759,"teacher_disagreement_score":0.42894295,"about_ca_system_score_codex":0.0000013000022,"about_ca_system_score_gemma":0.000018651635,"threshold_uncertainty_score":0.99737567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013586337,0.00084106665,0.9579071,0.001527242,0.0021891673,0.0002681815,0.0000034331065,0.00023322961,0.035671983],"genre_scores_gemma":[0.9377488,0.0002170909,0.055878285,0.0023273204,0.00077458256,0.000052473846,0.00019291922,0.000027178325,0.0027813888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702364,0.00031183677,0.00064033736,0.0010555133,0.00035803264,0.0006106185],"domain_scores_gemma":[0.9979324,0.00028250398,0.000246143,0.001257604,0.000113740214,0.00016762422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551072,0.0003473969,0.00057799893,0.00013179662,0.00009429996,0.00030719492,0.0011436008,0.00065030454,0.00029489814],"category_scores_gemma":[0.000010629768,0.00035012464,0.00016473279,0.00040470238,0.00006483158,0.00015986037,0.0022272964,0.0009869764,0.000028256647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005680541,0.00023470838,0.0024842555,0.00014309389,0.00012395612,0.0018127529,0.003789442,0.2998931,0.0000016080205,0.09071538,0.08794458,0.5128003],"study_design_scores_gemma":[0.00024470332,0.00003978719,0.0006977265,0.00019271875,0.000011602152,0.000030872536,0.0002829262,0.97979456,0.0000018265922,0.008188256,0.010102723,0.00041226705],"about_ca_topic_score_codex":0.0004075835,"about_ca_topic_score_gemma":0.00068402913,"teacher_disagreement_score":0.9363901,"about_ca_system_score_codex":0.000110518944,"about_ca_system_score_gemma":0.0005460057,"threshold_uncertainty_score":0.9998951},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.9485596e-7,0.00020316773,0.5033173,0.00009952634,0.0010390248,0.00014395232,0.0000021908172,0.0002531785,0.4949413],"genre_scores_gemma":[0.0025675318,0.00023876272,0.018744757,0.0016281193,0.0017458827,0.000007989296,0.000034487828,0.000050806106,0.97498167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777323,0.000016886972,0.0004660116,0.00083548593,0.00042661902,0.0004817852],"domain_scores_gemma":[0.9977932,0.00009226005,0.0002516615,0.0014038895,0.0001654614,0.00029355538],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002970707,0.0004699657,0.00050607574,0.000097486874,0.00015730869,0.00022301743,0.0012716096,0.00064480066,0.003001211],"category_scores_gemma":[0.0000014171134,0.00040282958,0.00020818383,0.00005571739,0.00019041497,0.0002663389,0.00068732875,0.00054408837,0.0012054229],"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.000008474544,0.00001816267,0.000003729355,0.000011162981,0.00006345555,0.00012350408,0.0000376503,0.000008459024,1.2952874e-7,0.5269476,0.3017097,0.17106795],"study_design_scores_gemma":[0.00018996409,0.00012063513,0.0000034417849,0.0001132367,0.000029057579,0.000060194947,8.605334e-7,0.4298174,0.0000012365259,0.08415419,0.4848736,0.00063617376],"about_ca_topic_score_codex":0.0000064309565,"about_ca_topic_score_gemma":0.000014924698,"teacher_disagreement_score":0.48457253,"about_ca_system_score_codex":0.000049910916,"about_ca_system_score_gemma":0.00017109771,"threshold_uncertainty_score":0.99984235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38058722,0.00011553759,0.61689216,0.00052958855,0.00009652324,0.00013866487,0.00000471846,0.00009398438,0.0015416467],"genre_scores_gemma":[0.9663544,0.000029379033,0.03177957,0.0006799258,0.00015924209,0.00002590253,0.000007712618,0.000013617599,0.0009502338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989625,0.000056819514,0.00021245885,0.0002479851,0.00016375024,0.00035646866],"domain_scores_gemma":[0.9990309,0.00019072973,0.000059938284,0.000497109,0.00007391124,0.00014739671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033388613,0.00015921857,0.00019823344,0.000048211165,0.00048442188,0.000179521,0.0005839764,0.00009969318,0.0000063576354],"category_scores_gemma":[0.0000064978467,0.00014801668,0.000045476267,0.000079356505,0.00008184945,0.00042232798,0.00026150295,0.00025232372,0.0000118865355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004529166,0.00012265795,0.0010321913,0.00003984953,0.000019335772,0.000006324307,0.003420428,0.0003879028,0.00020355803,0.0030152167,0.0014934384,0.9902138],"study_design_scores_gemma":[0.0006255881,0.00015589513,0.0014406979,0.000024819115,0.000008488263,0.000044351265,0.0000291321,0.99048805,0.00021103249,0.0020664847,0.004701611,0.0002038412],"about_ca_topic_score_codex":0.000012518049,"about_ca_topic_score_gemma":0.000016191394,"teacher_disagreement_score":0.99010015,"about_ca_system_score_codex":0.0000328031,"about_ca_system_score_gemma":0.000052621996,"threshold_uncertainty_score":0.60359454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10862193,0.0036494404,0.8045523,0.0049314494,0.007021636,0.00051799504,0.000016216965,0.00013704147,0.070551954],"genre_scores_gemma":[0.9961798,0.00013568084,0.0025058938,0.00011124521,0.00039349947,0.000009580161,0.0000065211257,0.000007746926,0.0006500329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998736,0.000083409046,0.00033811573,0.00033985957,0.00017293601,0.00032963793],"domain_scores_gemma":[0.9986492,0.00013992426,0.00029882745,0.00078946864,0.00003923864,0.00008334336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005162413,0.00014737264,0.0002536607,0.00005945636,0.0010236551,0.00040966793,0.00054197584,0.00008207231,0.000012606239],"category_scores_gemma":[0.000006155597,0.00011558896,0.000055479566,0.00028180907,0.00026551404,0.00029212693,0.0006127405,0.0001869466,8.9256946e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012408659,0.000023902388,0.024339164,0.000012486677,0.000027922299,0.000015710051,0.0004630319,0.0012503561,8.3286926e-7,0.06454809,0.0014240217,0.9078821],"study_design_scores_gemma":[0.00065824966,0.000022941646,0.087532245,0.00013219344,0.000023732906,0.000030810985,0.000022057025,0.88997126,7.0554626e-7,0.008278389,0.013141213,0.00018621299],"about_ca_topic_score_codex":0.00030415048,"about_ca_topic_score_gemma":0.00085548195,"teacher_disagreement_score":0.9076959,"about_ca_system_score_codex":0.00003283268,"about_ca_system_score_gemma":0.000051869923,"threshold_uncertainty_score":0.78732306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058825044,0.0003517926,0.9772147,0.0074244253,0.00077748194,0.0010174445,0.000018187427,0.00037951648,0.006933952],"genre_scores_gemma":[0.9447617,0.001159106,0.051732074,0.0016371767,0.00036110138,0.00012959317,0.00007721773,0.000029975325,0.000112048205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996487,0.00018472438,0.0010158608,0.00084523874,0.0006029601,0.0008641693],"domain_scores_gemma":[0.9942868,0.0005886444,0.00040430986,0.0040451046,0.00037622222,0.00029895554],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011119545,0.00047027183,0.0005301597,0.00019175893,0.0015819768,0.00041636694,0.009735107,0.00022293488,0.00002061163],"category_scores_gemma":[0.000011821926,0.00037104127,0.00012123943,0.001365687,0.0005687779,0.0005032952,0.0019316176,0.0012846122,0.000056443914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018673384,0.002259417,0.0037633732,0.000050539915,0.00018321353,0.00007207445,0.011227461,0.32585475,0.00003457695,0.32330507,0.103758425,0.22930437],"study_design_scores_gemma":[0.0006639005,0.00011064271,0.0019930063,0.00029376816,0.000018306275,0.00013103733,0.000049374423,0.9876604,0.0000018932493,0.0010967643,0.0075353575,0.00044555918],"about_ca_topic_score_codex":0.00007733102,"about_ca_topic_score_gemma":0.00004601197,"teacher_disagreement_score":0.9388792,"about_ca_system_score_codex":0.00009265401,"about_ca_system_score_gemma":0.00032390913,"threshold_uncertainty_score":0.9998742},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010716062,0.003873314,0.9414333,0.00023729056,0.005861078,0.0019932017,0.00004149696,0.0004689319,0.04501976],"genre_scores_gemma":[0.30733976,0.005751086,0.13717303,0.005678421,0.0047599943,0.0026449563,0.011908524,0.0005136681,0.52423054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557376,0.0001258485,0.0008917573,0.0015406696,0.0007357067,0.0011322382],"domain_scores_gemma":[0.99654484,0.0009711824,0.00033775019,0.0014340029,0.00021937293,0.0004928702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004979321,0.00073521695,0.0010128731,0.00024734353,0.00028118052,0.00045938618,0.0019350417,0.001171453,0.00036705623],"category_scores_gemma":[0.000014675266,0.0006502317,0.00056883076,0.00038793043,0.00008083048,0.00030706436,0.00024277896,0.0013239325,0.00016191928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039732747,0.0002126127,0.000012135969,0.00017081297,0.00013377132,0.00005529766,0.0005229733,0.000727663,0.000010361076,0.039740194,0.060130626,0.8978862],"study_design_scores_gemma":[0.0008450339,0.00061961176,0.00006600088,0.00014645272,0.00005917956,0.000026288759,0.00006332487,0.78602546,0.0000061354663,0.004126451,0.20719409,0.0008219622],"about_ca_topic_score_codex":0.0000073750393,"about_ca_topic_score_gemma":0.00004865586,"teacher_disagreement_score":0.89706427,"about_ca_system_score_codex":0.00008590293,"about_ca_system_score_gemma":0.0005960493,"threshold_uncertainty_score":0.99959487},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.7981696e-9,0.00027184622,0.5000252,0.00028707963,0.00088999135,0.000075577664,0.000011006951,0.00016322109,0.49827608],"genre_scores_gemma":[0.00045304117,0.0002513707,0.049578127,0.0031580108,0.002393002,0.0000017188262,0.00038607355,0.00004564224,0.94373304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771875,0.000017601626,0.00042007052,0.0010014744,0.0004137309,0.00042835038],"domain_scores_gemma":[0.9950818,0.0001884089,0.00022219491,0.004199578,0.00007106335,0.00023698107],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004736844,0.0003827922,0.00047442407,0.000047774436,0.00013499409,0.00022631967,0.0040429714,0.00039524905,0.0009579748],"category_scores_gemma":[0.0000021361914,0.00033077,0.00008834774,0.00003824528,0.000079235026,0.00018288297,0.0026694236,0.0004306066,0.0015365939],"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.0000015164595,0.0000014783166,7.5796794e-7,0.0000036630188,0.00001887493,0.000034053395,0.0000023880857,0.000008144898,7.1885307e-9,0.49629045,0.35605162,0.14758703],"study_design_scores_gemma":[0.000067819536,0.000021899448,5.911115e-7,0.000058164485,0.000018609573,0.00003009915,1.7965439e-7,0.30357385,2.2630243e-8,0.06522992,0.63070846,0.00029040655],"about_ca_topic_score_codex":0.000008564186,"about_ca_topic_score_gemma":0.000022771961,"teacher_disagreement_score":0.45044705,"about_ca_system_score_codex":0.000017748745,"about_ca_system_score_gemma":0.00016894942,"threshold_uncertainty_score":0.9999553},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002556026,0.000022896782,0.8964508,0.00035813954,0.0026444283,0.093784064,0.000027871227,0.0007021064,0.006007148],"genre_scores_gemma":[0.053987578,0.0000075573935,0.24460608,0.0038535835,0.0021703546,0.688923,0.0013788106,0.00013074977,0.0049422975],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959574,0.00021436729,0.0010368073,0.0014495541,0.00052333635,0.0008185836],"domain_scores_gemma":[0.9965575,0.0003031526,0.0006560808,0.0016154548,0.00043639858,0.00043141493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010429142,0.00055562967,0.00067353353,0.000120995515,0.00020439854,0.00045063914,0.0012397808,0.000696998,0.00021415424],"category_scores_gemma":[0.00002904801,0.00055685005,0.0004547858,0.00014501419,0.00009269571,0.00021787354,0.0009426027,0.00089364185,0.0000028714455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004670717,0.002076518,0.0014705965,0.004437173,0.0005648281,0.00077367877,0.0010853043,0.10162003,0.00002236943,0.15018675,0.39789355,0.33940214],"study_design_scores_gemma":[0.0009467707,0.00009111414,0.000038922648,0.00049178296,0.000049375703,0.000010899207,0.00001534478,0.9495124,0.000003709406,0.0007373286,0.04759115,0.0005111689],"about_ca_topic_score_codex":0.00006229363,"about_ca_topic_score_gemma":0.000011561756,"teacher_disagreement_score":0.8478924,"about_ca_system_score_codex":0.00074820855,"about_ca_system_score_gemma":0.0030301646,"threshold_uncertainty_score":0.9996883},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002556026,0.000022896782,0.8964508,0.00035813954,0.0026444283,0.093784064,0.000027871227,0.0007021064,0.006007148],"genre_scores_gemma":[0.053987578,0.0000075573935,0.24460608,0.0038535835,0.0021703546,0.688923,0.0013788106,0.00013074977,0.0049422975],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959574,0.00021436729,0.0010368073,0.0014495541,0.00052333635,0.0008185836],"domain_scores_gemma":[0.9965575,0.0003031526,0.0006560808,0.0016154548,0.00043639858,0.00043141493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010429142,0.00055562967,0.00067353353,0.000120995515,0.00020439854,0.00045063914,0.0012397808,0.000696998,0.00021415424],"category_scores_gemma":[0.00002904801,0.00055685005,0.0004547858,0.00014501419,0.00009269571,0.00021787354,0.0009426027,0.00089364185,0.0000028714455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004670717,0.002076518,0.0014705965,0.004437173,0.0005648281,0.00077367877,0.0010853043,0.10162003,0.00002236943,0.15018675,0.39789355,0.33940214],"study_design_scores_gemma":[0.0009467707,0.00009111414,0.000038922648,0.00049178296,0.000049375703,0.000010899207,0.00001534478,0.9495124,0.000003709406,0.0007373286,0.04759115,0.0005111689],"about_ca_topic_score_codex":0.00006229363,"about_ca_topic_score_gemma":0.000011561756,"teacher_disagreement_score":0.8478924,"about_ca_system_score_codex":0.00074820855,"about_ca_system_score_gemma":0.0030301646,"threshold_uncertainty_score":0.9996883},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3483765e-8,0.000056694913,0.48762378,0.0022441165,0.0010153338,0.000038257673,0.0000011978308,0.00012529045,0.5088953],"genre_scores_gemma":[0.00025133492,0.00012613239,0.005838195,0.0004385001,0.0034995954,0.0000016759327,0.000005353234,0.000016233838,0.989823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896175,0.0000049674622,0.00020225307,0.0004479951,0.00021555221,0.0001675091],"domain_scores_gemma":[0.9989798,0.000033249697,0.000102466634,0.0007196309,0.00007088168,0.00009394452],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010622521,0.00018596431,0.00019259323,0.000072685594,0.00005006685,0.000067657296,0.00046189415,0.00021266642,0.0026691312],"category_scores_gemma":[7.8562454e-7,0.00012945512,0.000083481675,0.000013340307,0.000044819528,0.00015736248,0.00017996487,0.00015391037,0.0026072406],"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":[7.362486e-7,0.000001169029,6.924718e-8,0.000001432413,0.0000073798233,0.00000964142,0.0000026431264,7.767553e-8,6.1684585e-7,0.5828585,0.1525862,0.26453152],"study_design_scores_gemma":[0.00005599463,0.000023798999,2.0750508e-7,0.000020185014,0.0000061230667,0.00003164508,1.4416996e-7,0.0034810847,0.0000023111077,0.1562744,0.8399214,0.00018271693],"about_ca_topic_score_codex":5.6091295e-7,"about_ca_topic_score_gemma":6.922006e-7,"teacher_disagreement_score":0.6873352,"about_ca_system_score_codex":0.000031958683,"about_ca_system_score_gemma":0.00006772082,"threshold_uncertainty_score":0.99824256},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24046628,0.0000030878455,0.75875187,0.00034267223,0.00006566409,0.00023301905,0.000011319702,0.000015539368,0.00011056447],"genre_scores_gemma":[0.99590117,0.0000025808351,0.0038555344,0.00004855848,0.000049952912,0.000014702761,0.00008965684,0.0000049815408,0.000032844368],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998837,0.000017879467,0.0003782447,0.0003586745,0.00026393417,0.00014426484],"domain_scores_gemma":[0.9984868,0.00053055113,0.00029778926,0.00022621844,0.00041954362,0.00003910799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072523515,0.000111486435,0.00018364919,0.00016632782,0.00009843549,0.0001472442,0.0005423846,0.000057519555,0.000016965043],"category_scores_gemma":[0.00007021518,0.00009161583,0.0000369319,0.00031389043,0.000044000673,0.0011093417,0.0002453261,0.00006766613,9.568636e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121911,0.0000855426,0.59404755,0.00014379797,0.000102258906,5.017465e-8,0.0014709966,0.15855677,0.00020816181,0.021172453,0.00019293212,0.2238976],"study_design_scores_gemma":[0.00028899123,0.000042176645,0.113657884,0.000034909182,0.00005898987,3.0888933e-7,0.00005271909,0.8839102,0.00008397723,0.0016962065,0.000079044024,0.00009460031],"about_ca_topic_score_codex":0.000009149685,"about_ca_topic_score_gemma":0.000017196307,"teacher_disagreement_score":0.75543493,"about_ca_system_score_codex":0.000022772867,"about_ca_system_score_gemma":0.00003313762,"threshold_uncertainty_score":0.37359852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048485,0.00013817493,0.9796153,0.0003552744,0.00063190307,0.0009875975,0.0000011350653,0.00035603714,0.01306609],"genre_scores_gemma":[0.6172095,0.0000727779,0.3787858,0.0008654616,0.0004466839,0.00050503406,0.0000034218488,0.000018190545,0.0020931778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798936,0.000036653855,0.0003652775,0.00047625197,0.00046166845,0.0006707632],"domain_scores_gemma":[0.99835205,0.0002599582,0.0001134416,0.00073569565,0.00031969306,0.00021914238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635213,0.00022910308,0.00027501586,0.000037422633,0.00023461886,0.00023630344,0.00071755005,0.00015373425,0.00043353013],"category_scores_gemma":[0.000010161758,0.00018321778,0.000099027406,0.00022030498,0.000043107066,0.00048249247,0.00018008842,0.00015292891,0.00067577243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033930162,0.0001846254,0.0012570804,0.000054911423,0.00007964679,0.0000043114196,0.00035607026,0.0059929616,0.00020642245,0.038862687,0.31298575,0.6399816],"study_design_scores_gemma":[0.00027987082,0.00020846326,0.0005707786,0.0000709881,0.000009273182,0.0000049956393,0.000014570351,0.97748154,0.0000762135,0.011401555,0.009575956,0.0003058034],"about_ca_topic_score_codex":0.000031531745,"about_ca_topic_score_gemma":0.0000013327654,"teacher_disagreement_score":0.9714886,"about_ca_system_score_codex":0.000051036626,"about_ca_system_score_gemma":0.00008731493,"threshold_uncertainty_score":0.8685913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036096695,0.0005329321,0.9588811,0.00012515539,0.0059466306,0.00082023756,0.000009732491,0.0004238025,0.032899473],"genre_scores_gemma":[0.86417824,0.00008353598,0.083322294,0.00127456,0.0038828852,0.0002899278,0.0016512462,0.0001423661,0.04517495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701923,0.00005597551,0.0007717182,0.00076553057,0.0003353866,0.0010521428],"domain_scores_gemma":[0.9978215,0.00030957506,0.000549476,0.0006388796,0.00037403582,0.00030650222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007095224,0.0005279884,0.00066114665,0.000096268705,0.000453192,0.00042319682,0.0011521429,0.00083342846,0.000075738484],"category_scores_gemma":[0.000010711789,0.0004916574,0.00038578364,0.00024740442,0.000021804466,0.00043232588,0.000114018265,0.0005129385,0.000016227685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013705424,0.0001897017,0.00008021197,0.00015348865,0.00029201657,0.000020169466,0.002056312,0.00022633711,0.00005331256,0.08202378,0.030235223,0.8845324],"study_design_scores_gemma":[0.00048640955,0.000077672434,0.00013203188,0.00007916319,0.000104752515,0.0000098549135,0.00014382212,0.99264044,0.000016924942,0.0011550363,0.004449085,0.0007048292],"about_ca_topic_score_codex":0.000072010895,"about_ca_topic_score_gemma":0.00034609163,"teacher_disagreement_score":0.99241406,"about_ca_system_score_codex":0.00008277253,"about_ca_system_score_gemma":0.00057132763,"threshold_uncertainty_score":0.99975353},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14804627,0.00013993442,0.82795775,0.0004948328,0.00065329,0.00027897715,0.000001049299,0.0000734146,0.02235448],"genre_scores_gemma":[0.99116266,0.0000017835928,0.0076113427,0.0006279053,0.00031487204,0.000010279059,0.0000047121216,0.0000059843,0.0002604864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783784,0.00029819936,0.00035928853,0.00029069907,0.00094535627,0.0002686334],"domain_scores_gemma":[0.9987384,0.00007967902,0.00012491015,0.00076318614,0.00022722832,0.000066604975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013178103,0.00011872166,0.00016096029,0.000023080667,0.000136738,0.0000894128,0.0008954858,0.00007337741,0.0000909794],"category_scores_gemma":[0.0000023151454,0.00007439838,0.00007562576,0.00036421412,0.000056811008,0.00020185103,0.00016177648,0.000107087,0.000010720637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023114913,0.0009138612,0.1594527,0.000007871184,0.00005662859,0.000016100339,0.0007108444,0.40488717,0.000060804057,0.0795106,0.115785204,0.2385751],"study_design_scores_gemma":[0.00031803016,0.000060488546,0.04569139,0.000009292698,0.000028490356,0.0000103602915,0.000015483627,0.9449742,0.000018582447,0.00789254,0.00087699335,0.00010414056],"about_ca_topic_score_codex":0.000073329094,"about_ca_topic_score_gemma":0.00009315345,"teacher_disagreement_score":0.84311634,"about_ca_system_score_codex":0.000032328553,"about_ca_system_score_gemma":0.00016643523,"threshold_uncertainty_score":0.3033878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095374195,0.000014125272,0.78502566,0.00088485685,0.00014558173,0.00013856721,3.3605264e-8,0.00037358538,0.21246387],"genre_scores_gemma":[0.8236148,0.000002937618,0.16913609,0.0009251642,0.000049385337,0.000041318923,6.118062e-7,0.0000023803993,0.0062273103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952567,0.000007974771,0.00007921848,0.00013281014,0.00009123321,0.00016311553],"domain_scores_gemma":[0.9995808,0.000018457464,0.000014780536,0.00025985698,0.000035892448,0.00009019317],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000043104348,0.000048457747,0.000051578805,0.00001576341,0.000035045494,0.00016722309,0.0003224123,0.000025558058,0.00040138373],"category_scores_gemma":[5.555147e-7,0.000035149737,0.000021862734,0.0001043424,0.000016068732,0.00025791762,0.000090916954,0.0000421329,0.0011969939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.161302e-8,0.000025804047,0.00012377017,6.7432956e-7,0.0000017133638,0.000003001353,0.00001646493,5.7667876e-7,0.0000036123436,0.04737058,0.04201885,0.91043484],"study_design_scores_gemma":[0.000070420574,0.000049955986,0.0005827591,0.0000020350412,7.1041853e-7,0.000009787523,0.0000060008647,0.95358324,0.00001504375,0.010062022,0.035533864,0.00008415618],"about_ca_topic_score_codex":0.000030338913,"about_ca_topic_score_gemma":7.5175234e-7,"teacher_disagreement_score":0.95358264,"about_ca_system_score_codex":0.00000353245,"about_ca_system_score_gemma":0.000018005469,"threshold_uncertainty_score":0.9995807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012776856,0.00078600075,0.9714295,0.0016014731,0.00053279666,0.00046384026,0.000024283821,0.0003292123,0.01205602],"genre_scores_gemma":[0.92604434,0.0004476413,0.07229565,0.00084942736,0.00011467465,0.00008323089,0.000111767666,0.000018847064,0.000034446275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961032,0.0009516699,0.0008515896,0.0007954883,0.0005174033,0.0007806241],"domain_scores_gemma":[0.99363494,0.0002827296,0.0004025068,0.004644896,0.00059585966,0.00043909028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012110482,0.0004542554,0.0005626016,0.00013732702,0.0004708917,0.00049071107,0.0050016874,0.0004018093,0.000034265475],"category_scores_gemma":[0.000030956777,0.00047482605,0.00013036128,0.0009986212,0.00036591687,0.0012569166,0.0006872218,0.0008168297,0.0001411797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071305236,0.0008354587,0.006322594,0.000012389898,0.00007771004,0.0000232151,0.0004913277,0.012887996,0.00003190996,0.5938487,0.003223772,0.38217363],"study_design_scores_gemma":[0.0006940664,0.00020044175,0.0016805192,0.00013389147,0.000019831912,0.000034557106,0.00010243454,0.9790694,0.0000056041367,0.012795767,0.004723922,0.0005395522],"about_ca_topic_score_codex":0.00079142395,"about_ca_topic_score_gemma":0.0013500745,"teacher_disagreement_score":0.9661814,"about_ca_system_score_codex":0.0002782719,"about_ca_system_score_gemma":0.00040738858,"threshold_uncertainty_score":0.99977034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010942031,0.0023682239,0.99539566,0.00056060066,0.000562647,0.0006785757,0.000010598108,0.00010117535,0.0002131271],"genre_scores_gemma":[0.45352572,0.0006165241,0.5450908,0.00037542157,0.0002264224,0.0000784501,0.000020172512,0.00001270387,0.00005376485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978071,0.00023468598,0.00049524434,0.00074433157,0.00032894002,0.0003897053],"domain_scores_gemma":[0.99543166,0.0029722957,0.0004385135,0.0007218224,0.0003336653,0.000102061276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090990507,0.00031063645,0.0008392306,0.00018242805,0.00029214835,0.00035072732,0.0010061177,0.00053524214,0.000028881475],"category_scores_gemma":[0.000018634713,0.00022328898,0.0005061581,0.0012563574,0.00009796625,0.00007955373,0.0013521049,0.0006153821,2.835021e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001741519,0.00041468203,0.0005857839,0.00013513607,0.017993538,0.00006476221,0.007284637,0.19731829,4.0981882e-7,0.36863577,0.006398667,0.40099418],"study_design_scores_gemma":[0.00015206644,0.00003735826,0.00060209824,0.000030787436,0.002117433,0.0000021879757,0.00014759102,0.98582464,0.0000017379252,0.010778206,0.000059521073,0.00024634606],"about_ca_topic_score_codex":0.000026330204,"about_ca_topic_score_gemma":0.0000061386927,"teacher_disagreement_score":0.7885064,"about_ca_system_score_codex":0.000050051665,"about_ca_system_score_gemma":0.00032165356,"threshold_uncertainty_score":0.91054606},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.5052227e-8,0.00030582552,0.47471192,0.00019915987,0.0011656918,0.00008521071,0.000020136327,0.00017034529,0.5233417],"genre_scores_gemma":[0.00013851898,0.00026708026,0.06287787,0.0022525142,0.0035800547,0.0000015111135,0.00035742755,0.000043418746,0.9304816],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767417,0.00001302213,0.00040608805,0.0010474327,0.0004158612,0.00044341743],"domain_scores_gemma":[0.9951235,0.00012196414,0.00020983088,0.004208488,0.000106893676,0.00022928837],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039854064,0.00037782596,0.00041167188,0.000048660033,0.00015440409,0.000241795,0.004187339,0.00040306262,0.0042313314],"category_scores_gemma":[0.000001839554,0.00032537206,0.00008083995,0.000047545716,0.00014064198,0.00032531493,0.0032394412,0.0003556387,0.003167707],"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.0000026121113,0.0000028222482,7.0257835e-7,0.0000031368218,0.000028225226,0.00006181282,0.000007978838,0.0000013161398,9.83354e-9,0.37451297,0.56308734,0.062291075],"study_design_scores_gemma":[0.00006858029,0.000036587106,5.428302e-7,0.000069180394,0.000021029993,0.00003942635,5.5337125e-7,0.19128296,4.994447e-8,0.11371804,0.6944437,0.00031933098],"about_ca_topic_score_codex":0.000007142159,"about_ca_topic_score_gemma":0.000030140887,"teacher_disagreement_score":0.41183403,"about_ca_system_score_codex":0.000020807442,"about_ca_system_score_gemma":0.00023471327,"threshold_uncertainty_score":0.99991983},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015052937,0.000041287592,0.9258128,0.00029572294,0.0021335958,0.05836728,0.00000973914,0.00059273874,0.012745325],"genre_scores_gemma":[0.09430004,0.0000031406992,0.2408772,0.004798991,0.0012371738,0.6520937,0.00043206886,0.0001374552,0.0061202263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953904,0.00018938066,0.001076426,0.001754537,0.0006232152,0.00096601824],"domain_scores_gemma":[0.9956856,0.00044785358,0.00075821934,0.002068752,0.0005364856,0.0005031114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091327063,0.0007138462,0.00085945235,0.00017706136,0.0002343009,0.0005526683,0.0018884259,0.00068532507,0.00025248193],"category_scores_gemma":[0.000027356296,0.0006832685,0.00057899306,0.00020509018,0.000112056485,0.00008577491,0.0017268369,0.0007174476,0.000003269384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017513568,0.0013003213,0.000040051193,0.0009833508,0.00021890996,0.0007322539,0.0003247515,0.34722993,0.000009178836,0.31391034,0.12655643,0.20851935],"study_design_scores_gemma":[0.00089377025,0.00009156265,0.000002897184,0.00046087624,0.000039526385,0.000012744288,0.000013246764,0.9434685,0.000006869185,0.00051675097,0.053716272,0.0007769736],"about_ca_topic_score_codex":0.000091515656,"about_ca_topic_score_gemma":0.000014708623,"teacher_disagreement_score":0.6849356,"about_ca_system_score_codex":0.00067276676,"about_ca_system_score_gemma":0.0037898198,"threshold_uncertainty_score":0.99956185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003653051,0.013153852,0.92908216,0.0012126378,0.017547458,0.00041717762,0.000066293105,0.00003436217,0.038449503],"genre_scores_gemma":[0.8916263,0.054410115,0.005993984,0.00096842577,0.00566831,0.00009784923,0.0004240119,0.00008410796,0.04072688],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99601537,0.0003956723,0.0018166405,0.00030229441,0.0011512826,0.00031872428],"domain_scores_gemma":[0.99169445,0.00097588444,0.0030697118,0.0011824443,0.0028648148,0.00021267936],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010651292,0.00036436392,0.000829909,0.0003625782,0.00020386894,0.00060623523,0.0067009483,0.00043827496,0.000039012157],"category_scores_gemma":[0.000020556645,0.0003310078,0.00046344468,0.000186454,0.000115457035,0.000516476,0.00049668935,0.0008030716,0.00010460064],"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.00011214744,0.00015071065,0.000010620404,0.00001920176,0.000743512,0.00006028623,0.00041808558,0.011847598,0.000011557498,0.01068844,0.94367135,0.032266468],"study_design_scores_gemma":[0.000741865,0.00009988382,0.000003920255,0.0008125023,0.000030975185,0.000793601,0.000042473133,0.3426506,0.0000049059176,0.000064331245,0.6544744,0.00028054597],"about_ca_topic_score_codex":0.000051617975,"about_ca_topic_score_gemma":0.000005230892,"teacher_disagreement_score":0.9230882,"about_ca_system_score_codex":0.0002985739,"about_ca_system_score_gemma":0.00064503896,"threshold_uncertainty_score":0.99991417},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030921703,0.000017483017,0.66312075,0.000068027584,0.0009945008,0.035341002,0.0000022996348,0.0003414775,0.30008358],"genre_scores_gemma":[0.16217098,0.000002044473,0.09716452,0.00274268,0.0018950661,0.43629685,0.0011442528,0.00016202981,0.2984216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840415,0.000040899096,0.00033717375,0.00041462207,0.0003996552,0.00040348133],"domain_scores_gemma":[0.99868906,0.0000637869,0.00021450815,0.0006954098,0.00012977801,0.00020747205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020212194,0.00028443272,0.0002779009,0.00011237819,0.000101596044,0.00016364154,0.00082555134,0.00032495084,0.00070307945],"category_scores_gemma":[0.0000026312196,0.00023394966,0.00012578027,0.00022080918,0.000014573815,0.00020127826,0.00003868138,0.00028453144,0.00035877083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013466044,0.0004356103,0.00031130583,0.00053955487,0.000054360426,0.0000735196,0.00048159127,0.000017840512,0.000039925828,0.049743,0.07403894,0.8741297],"study_design_scores_gemma":[0.0016792776,0.00026864593,0.0018205558,0.0003891944,0.000059218077,0.000013872883,0.00007159171,0.6894202,0.0005550983,0.003240732,0.30084944,0.0016321798],"about_ca_topic_score_codex":0.00003015326,"about_ca_topic_score_gemma":0.000040264287,"teacher_disagreement_score":0.8724975,"about_ca_system_score_codex":0.000029284653,"about_ca_system_score_gemma":0.0004532316,"threshold_uncertainty_score":0.954019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042180368,0.00079953135,0.9565997,0.0010212271,0.0052472088,0.00019439936,0.0000037200882,0.00046034984,0.035252072],"genre_scores_gemma":[0.91766757,0.0003609276,0.07338245,0.0020636392,0.0013749237,0.00003617709,0.00018406383,0.000025446647,0.0049048066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977718,0.00011837637,0.0003896388,0.0008811096,0.00038935523,0.00044972985],"domain_scores_gemma":[0.99790096,0.00013815242,0.00019375216,0.0013565437,0.00020331079,0.00020729756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033604927,0.0003166088,0.00043162922,0.00004357817,0.00012373523,0.0007030154,0.0010546098,0.0004732103,0.00029944812],"category_scores_gemma":[0.0000046714977,0.000301087,0.00018777436,0.00021239732,0.00004070056,0.00018536052,0.0025109795,0.00073231,0.00005624625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001422511,0.00017269874,0.001791919,0.00019036287,0.00025492936,0.0011908814,0.00043164325,0.063966654,0.0000031211873,0.11291848,0.34424496,0.47482014],"study_design_scores_gemma":[0.00013206017,0.000021503289,0.00065597595,0.00023338292,0.000023506116,0.000038300826,0.000017481954,0.9837488,0.000003914649,0.0074270354,0.007243976,0.00045405896],"about_ca_topic_score_codex":0.00006981186,"about_ca_topic_score_gemma":0.000029462433,"teacher_disagreement_score":0.91978216,"about_ca_system_score_codex":0.00005791553,"about_ca_system_score_gemma":0.00049341744,"threshold_uncertainty_score":0.99994415},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024837253,0.026040737,0.60891473,0.19268441,0.017380055,0.0036163158,0.0004995198,0.00039632223,0.15044305],"genre_scores_gemma":[0.07398199,0.17428057,0.3304441,0.12944758,0.09920126,0.0064466586,0.01136768,0.00077517197,0.174055],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700075,0.00044646708,0.00084593537,0.00073422154,0.00029995258,0.0006726676],"domain_scores_gemma":[0.9889602,0.0013332611,0.00062135584,0.00852108,0.00028447073,0.00027964587],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038174822,0.00059802545,0.00076266367,0.00021504413,0.001462915,0.00077707367,0.008574641,0.0005532526,0.0001909726],"category_scores_gemma":[0.0000062133377,0.000621799,0.0002614942,0.00038315065,0.0007767845,0.00043289794,0.0019802887,0.0013173963,0.0008205625],"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.0000046055907,0.000053678476,0.0000042128618,0.000038031416,0.00010478233,0.0000012171865,0.0005827984,0.000016098049,0.000019291012,0.001534646,0.83148307,0.16615756],"study_design_scores_gemma":[0.0004381065,0.000035127876,0.000007777379,0.00023792767,0.00007709428,0.00002151206,0.00013537108,0.07424257,0.0000017126482,0.00010531498,0.924072,0.00062548055],"about_ca_topic_score_codex":0.00012326671,"about_ca_topic_score_gemma":0.00017483061,"teacher_disagreement_score":0.27847067,"about_ca_system_score_codex":0.000146013,"about_ca_system_score_gemma":0.00020809301,"threshold_uncertainty_score":0.99995744},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021145624,0.00010390442,0.41094604,0.000014599012,0.00039711,0.00009532275,0.000004247251,0.00018314354,0.5882535],"genre_scores_gemma":[0.0048488495,0.00010448485,0.010909229,0.001012238,0.0003241364,0.0000068493505,0.000025606814,0.00002456469,0.98274404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989503,0.000032975215,0.00026395026,0.00027471874,0.0002535628,0.00022447274],"domain_scores_gemma":[0.9979552,0.00011193596,0.00012825371,0.0015652694,0.00012168212,0.000117672804],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030635166,0.0002605822,0.00029969597,0.00006709363,0.00023218905,0.00012472602,0.0014697235,0.0003194509,0.0030775538],"category_scores_gemma":[8.3076344e-7,0.00022583548,0.000121927056,0.00002323494,0.0001573928,0.00012116499,0.0007947863,0.00066214247,0.0022147794],"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.0000021998142,0.000020774654,6.429938e-7,0.000011747229,0.000031657106,0.000031661635,0.00030719012,5.169017e-7,3.1211113e-7,0.6082071,0.26062796,0.13075826],"study_design_scores_gemma":[0.00008311251,0.00022471123,3.6108005e-7,0.000050881292,0.000011308422,0.000027393233,0.0000075032203,0.020809524,0.0000019199106,0.20939165,0.76908404,0.00030756686],"about_ca_topic_score_codex":0.00001941946,"about_ca_topic_score_gemma":0.000013923283,"teacher_disagreement_score":0.5084561,"about_ca_system_score_codex":0.00002952107,"about_ca_system_score_gemma":0.00010311031,"threshold_uncertainty_score":0.9985621},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082258706,0.00031403985,0.9932223,0.00011928677,0.00027657603,0.00076976244,0.0000036069252,0.00037560635,0.0040962207],"genre_scores_gemma":[0.68032753,0.00003455776,0.31779686,0.00071633403,0.00012924509,0.0002919901,0.000013580466,0.000016010801,0.000673919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838734,0.000050269886,0.00037124372,0.00046356645,0.0002032785,0.0005243243],"domain_scores_gemma":[0.99857014,0.00049605744,0.00014549121,0.00051592855,0.00012293398,0.00014947346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063938054,0.00019961734,0.00025442027,0.00006981202,0.000424734,0.00008529602,0.0006111974,0.00015522099,0.000034610515],"category_scores_gemma":[0.000012533266,0.00017845792,0.00012811799,0.00031457187,0.000060076818,0.00024502398,0.00016420342,0.00019706895,0.000007301282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007629742,0.00022607166,0.0010713116,0.000057884903,0.000042236486,0.0002460595,0.000795854,0.016646188,0.0004301199,0.010586046,0.036197092,0.93362486],"study_design_scores_gemma":[0.0004553445,0.00016023572,0.000024905155,0.00003811656,0.0000053912495,0.0000605845,0.000029098635,0.99182993,0.0004821893,0.00031676464,0.0063386,0.00025886015],"about_ca_topic_score_codex":0.0000043696195,"about_ca_topic_score_gemma":0.000002852038,"teacher_disagreement_score":0.9751837,"about_ca_system_score_codex":0.000039448674,"about_ca_system_score_gemma":0.00013006995,"threshold_uncertainty_score":0.7277303},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024502018,0.004526541,0.8496144,0.0028293978,0.0010887196,0.0013095323,0.000032173455,0.00024992804,0.11584733],"genre_scores_gemma":[0.92280096,0.0023931654,0.053270295,0.00018753756,0.000095490184,0.0007495755,0.00047227807,0.0000660229,0.019964665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9860771,0.009655545,0.0007491329,0.0014109657,0.0011821724,0.0009251321],"domain_scores_gemma":[0.9926601,0.0022249452,0.0003826109,0.0040331422,0.00040122907,0.00029794915],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.017370488,0.00036583858,0.00048199404,0.00034056767,0.0006862942,0.0005776405,0.0040663485,0.00034235988,0.0004313037],"category_scores_gemma":[0.000107559914,0.00042074683,0.00018951023,0.0010145166,0.0002905376,0.00020835,0.009841235,0.0022183098,0.000079290185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035830642,0.0024528739,0.009697368,0.00021991046,0.00013263122,0.00032250473,0.016350241,0.015562002,0.000102615275,0.26206517,0.028827203,0.66423166],"study_design_scores_gemma":[0.00078323885,0.0000022967179,0.0032198285,0.0013339389,0.000018439063,0.000021423632,0.00015768374,0.63002986,0.00039343725,0.031949345,0.3311497,0.0009408087],"about_ca_topic_score_codex":0.00060539413,"about_ca_topic_score_gemma":0.00041713894,"teacher_disagreement_score":0.898299,"about_ca_system_score_codex":0.00037257822,"about_ca_system_score_gemma":0.00050700345,"threshold_uncertainty_score":0.99982446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003823845,0.000018026469,0.9911522,0.0028775113,0.00031528543,0.0004600681,0.000009158361,0.00024439848,0.004540954],"genre_scores_gemma":[0.37372074,0.0000011504677,0.6248886,0.0011299456,0.00021746471,0.000018565092,0.0000015710764,0.000014669113,0.0000073168253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965733,0.00009150227,0.0006337696,0.00096300413,0.00090674363,0.00083162455],"domain_scores_gemma":[0.99706984,0.0010655116,0.00022519438,0.0007271866,0.0002722654,0.0006399895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002201615,0.00032368838,0.00047915836,0.00009546739,0.0004964985,0.00095543265,0.0031980108,0.00008149183,0.000032549346],"category_scores_gemma":[0.00010040223,0.0002571495,0.00020221007,0.0007784887,0.00093329453,0.00058902445,0.0013566442,0.00027552154,0.000028267323],"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.000008754389,0.00003297675,0.0000034582147,0.000056873243,0.000010966916,0.000013483033,0.0017475598,0.000133664,0.0002264821,0.9233092,0.0001070171,0.07434955],"study_design_scores_gemma":[0.0003326613,0.0002652594,0.0000029454768,0.0000611573,0.00001815213,0.000031134186,0.000047891364,0.82524824,0.0003473918,0.17321959,0.00013398998,0.00029156526],"about_ca_topic_score_codex":8.781184e-7,"about_ca_topic_score_gemma":1.2470885e-7,"teacher_disagreement_score":0.8251146,"about_ca_system_score_codex":0.000032612654,"about_ca_system_score_gemma":0.00017311402,"threshold_uncertainty_score":0.9999881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043674107,0.0033638068,0.5674868,0.029683053,0.00038150034,0.00021898437,0.0000027554076,0.00021138853,0.39428428],"genre_scores_gemma":[0.9508749,0.0017536047,0.037609223,0.00020448402,0.000074387804,0.0000350614,0.000010000018,0.000017192375,0.009421134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99373466,0.00448633,0.00027994713,0.0005191845,0.0005426557,0.0004372306],"domain_scores_gemma":[0.9952873,0.00084157655,0.00012547622,0.0021197717,0.0014461539,0.0001797317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009397779,0.0001609448,0.00016193232,0.00011430126,0.0003883049,0.00029086779,0.002937419,0.00012802177,0.00016677988],"category_scores_gemma":[0.00009201222,0.00012015956,0.00009226955,0.0005103425,0.00030779434,0.00026478857,0.0011448093,0.00053540297,0.00012744662],"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.0000037840698,0.00013378405,0.00005408595,0.000008683133,0.000014575858,0.000008439022,0.021635516,1.5022641e-7,0.000015453183,0.5748824,0.003993101,0.39925003],"study_design_scores_gemma":[0.0011863717,0.0000063416046,0.012930652,0.00093928276,0.000033481083,0.00015966798,0.0052213934,0.30241102,0.013260429,0.097768694,0.5649923,0.0010903772],"about_ca_topic_score_codex":0.00038274852,"about_ca_topic_score_gemma":0.00066068576,"teacher_disagreement_score":0.9465075,"about_ca_system_score_codex":0.00003867128,"about_ca_system_score_gemma":0.00017162769,"threshold_uncertainty_score":0.54585046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008268037,0.00015436305,0.9853417,0.00023745977,0.0048052236,0.00022361847,0.0000026122004,0.0002983468,0.0006686042],"genre_scores_gemma":[0.9710519,0.000032826032,0.027727695,0.0008294669,0.00023904041,0.000026526925,0.0000021780254,0.000025156016,0.00006525651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774396,0.00011846349,0.0004711365,0.00045227198,0.00038132395,0.0008328159],"domain_scores_gemma":[0.9986724,0.00021951202,0.00009593155,0.00060157146,0.000046365763,0.00036418947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005141269,0.00030578757,0.00033278365,0.0002909113,0.00021928921,0.00013896855,0.00068015023,0.00016688161,0.000021526223],"category_scores_gemma":[4.162586e-7,0.0003071808,0.00016693692,0.00063735584,0.00006026626,0.0007587892,0.000009452283,0.00056882587,0.000070592694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053776388,0.00062443066,0.0008895107,0.000014247036,0.00006439609,0.00011921022,0.0010493428,0.50638837,0.000012892487,0.00092900696,0.0009859939,0.48886883],"study_design_scores_gemma":[0.00063602754,0.000074195195,0.0002520704,0.000094238254,0.000011818255,0.00009158009,0.000016218648,0.99742657,0.000096252494,0.000059923226,0.00087387854,0.00036722745],"about_ca_topic_score_codex":0.00008906363,"about_ca_topic_score_gemma":0.000036636557,"teacher_disagreement_score":0.9627838,"about_ca_system_score_codex":0.00012797242,"about_ca_system_score_gemma":0.00006557344,"threshold_uncertainty_score":0.999938},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043684278,0.00009340542,0.9467118,0.000115924995,0.00061862153,0.0004669609,0.000017927145,0.00029727418,0.007993826],"genre_scores_gemma":[0.97980946,0.0001041896,0.018844448,0.00013782388,0.00012821092,0.0000054467414,0.00009711814,0.000042062176,0.00083125726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996741,0.00028284054,0.00050891255,0.0014687818,0.00018798203,0.00081050396],"domain_scores_gemma":[0.99690825,0.00028684063,0.0005004289,0.0013899074,0.0003617072,0.00055284787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011075722,0.0005853281,0.00073780474,0.00040827753,0.00024137292,0.00031552598,0.0018038785,0.0004498215,0.000019249184],"category_scores_gemma":[0.00002136853,0.0006069123,0.000176479,0.000957988,0.00019447529,0.0005301738,0.0017044508,0.0011328015,0.00002654069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000782197,0.0000830544,0.0013957676,0.000032223987,0.00007701841,0.0029712731,0.00018221737,0.9650617,4.2140275e-7,0.028312383,0.00067476527,0.0011309568],"study_design_scores_gemma":[0.00088444963,0.00010185209,0.00012284172,0.00042995796,0.00012653881,0.000051189723,0.00009331328,0.9915815,6.459742e-7,0.0056447866,0.00022799296,0.00073493057],"about_ca_topic_score_codex":0.00019038864,"about_ca_topic_score_gemma":0.000098224264,"teacher_disagreement_score":0.93612516,"about_ca_system_score_codex":0.00035901365,"about_ca_system_score_gemma":0.0009558103,"threshold_uncertainty_score":0.9996382},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034923072,0.000058602767,0.99388355,0.0003072707,0.00095173967,0.0012185114,0.000032423828,0.000025415655,0.000030202154],"genre_scores_gemma":[0.99117804,0.000010047908,0.007858516,0.000079143785,0.000490921,0.00034391374,0.000020071051,0.000012482884,0.0000068403165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986511,0.000031973814,0.00043780767,0.0001702032,0.0004774222,0.00023151307],"domain_scores_gemma":[0.9991865,0.00010127199,0.00027499744,0.00009808316,0.00023196965,0.00010716703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005618752,0.00013821923,0.00020187617,0.0000821996,0.0002110397,0.000114371534,0.00042691754,0.000038824175,0.00000796439],"category_scores_gemma":[0.000008443354,0.0001283761,0.0000787399,0.0001572351,0.000018565077,0.00020416199,0.00025261383,0.0002517532,5.931123e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000537114,0.00006198482,0.00006543468,0.00002224946,0.00009983124,0.0000919552,0.00032779007,0.9698887,0.000034394547,0.025568863,0.00012627238,0.0031754205],"study_design_scores_gemma":[0.0010617158,0.00019459629,0.00007518388,0.00010694372,0.000012084705,0.0007762005,0.000035414618,0.9667367,0.000016645821,0.00039757288,0.030438442,0.00014854493],"about_ca_topic_score_codex":0.000012888215,"about_ca_topic_score_gemma":0.0000028578443,"teacher_disagreement_score":0.98768574,"about_ca_system_score_codex":0.00017982311,"about_ca_system_score_gemma":0.0000999091,"threshold_uncertainty_score":0.5235025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010062075,0.00003256484,0.97980136,0.0006040218,0.0016491826,0.016840464,0.0000025789882,0.00011165563,0.0008575586],"genre_scores_gemma":[0.9602688,0.0000054281345,0.024800742,0.001332336,0.0028123383,0.009626279,0.000027267211,0.00008269851,0.0010441336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620783,0.00030090733,0.0013440843,0.00045058216,0.00082756433,0.0008690538],"domain_scores_gemma":[0.9961784,0.00070329104,0.0018099287,0.00048821085,0.00039876785,0.000421394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029042175,0.00035678505,0.0006941373,0.0002463259,0.0010694821,0.00035223248,0.001546701,0.00015477299,0.00023711173],"category_scores_gemma":[0.000021418004,0.00033021538,0.00040418888,0.0007180831,0.00006415596,0.00041331054,0.0004609395,0.001602681,0.000001661175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009020202,0.00019106858,0.000258676,0.0000201564,0.00007107542,0.00034963537,0.000057050333,0.93931234,0.000005134534,0.009184094,0.022028152,0.027620587],"study_design_scores_gemma":[0.0050160433,0.0011804808,0.000046233505,0.000091558104,0.000050696606,0.00032291652,0.000045164343,0.94986933,0.000003920395,0.00063661666,0.04237365,0.000363379],"about_ca_topic_score_codex":0.000012360658,"about_ca_topic_score_gemma":0.0000012150504,"teacher_disagreement_score":0.9601682,"about_ca_system_score_codex":0.0002096759,"about_ca_system_score_gemma":0.00050607824,"threshold_uncertainty_score":0.999915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003101017,0.0023596669,0.9671557,0.00029576648,0.0007424787,0.00039491704,0.0000053763706,0.00016146498,0.028853636],"genre_scores_gemma":[0.9790778,0.0015059696,0.012560255,0.0005377582,0.0011983928,0.00008756863,0.00009236246,0.00023207927,0.00470779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964728,0.00008815507,0.0006475328,0.00082002976,0.0010364673,0.0009350675],"domain_scores_gemma":[0.9962763,0.0024059555,0.00016096022,0.00081787544,0.00015544624,0.00018344923],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00088790996,0.00050250103,0.0007515017,0.0009502961,0.00010941841,0.0001106846,0.0018272774,0.0005569631,0.00021280306],"category_scores_gemma":[0.000099680365,0.0004748852,0.0001884516,0.0014716861,0.000062372455,0.00012512661,0.0006756402,0.004282189,0.000012012786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005029513,0.000042391686,0.0000056324693,0.000043702225,0.000060952098,0.0002120801,0.000055715267,0.5817752,0.000009170556,0.26799336,0.0005422153,0.14920926],"study_design_scores_gemma":[0.00016448356,0.00047925816,0.000011313823,0.00034544023,0.000014130338,0.000025802676,4.5210658e-7,0.9091401,0.00012389978,0.029775126,0.05939576,0.00052422605],"about_ca_topic_score_codex":0.000076949524,"about_ca_topic_score_gemma":0.000016325179,"teacher_disagreement_score":0.9790468,"about_ca_system_score_codex":0.0006247906,"about_ca_system_score_gemma":0.00029805335,"threshold_uncertainty_score":0.9997703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031913576,0.00087641226,0.9481656,0.047124468,0.0014245408,0.00057138584,0.00004931221,0.00019200104,0.0015643591],"genre_scores_gemma":[0.97536695,0.0007813571,0.019757774,0.0018186009,0.00015779244,0.0008896414,0.000022858938,0.00002423568,0.0011808076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.00028315556,0.0003033061,0.000311295,0.00027299573,0.00033244654],"domain_scores_gemma":[0.99599975,0.000708525,0.00012763306,0.0029761468,0.00009312631,0.0000948135],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047678486,0.00017910475,0.00017438737,0.00009547613,0.0032833833,0.00021558827,0.0033877052,0.0000659737,0.00010731162],"category_scores_gemma":[0.0000010009056,0.00015409446,0.00020963827,0.00060436653,0.00014821473,0.00024970993,0.00005581419,0.0008356621,0.000016946475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079303,0.0011098775,0.000002974229,0.000015081004,0.00022321536,0.000006058603,0.0067196116,0.1808563,0.000059572492,0.16547918,0.0389425,0.60650635],"study_design_scores_gemma":[0.00029612813,0.0001281383,0.0000104463015,0.0000072909024,0.000039671973,0.00002931975,0.0010356992,0.8082734,0.000013770703,0.0018143327,0.18816856,0.00018325397],"about_ca_topic_score_codex":0.00002961455,"about_ca_topic_score_gemma":0.00007207011,"teacher_disagreement_score":0.975335,"about_ca_system_score_codex":0.00009755635,"about_ca_system_score_gemma":0.00013949005,"threshold_uncertainty_score":0.9980142},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002114249,0.00014701045,0.98904103,0.0018927432,0.004878197,0.0013742489,0.000043247433,0.00059550436,0.0018165641],"genre_scores_gemma":[0.98334616,0.00004918158,0.0050380295,0.0055239853,0.00054164964,0.0011414931,0.0003549749,0.000074746225,0.0039297943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514407,0.00048633863,0.000977661,0.0011350262,0.001012638,0.0012442416],"domain_scores_gemma":[0.9965249,0.0010045089,0.0006272499,0.0010811884,0.00026524052,0.00049696834],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001961623,0.0005621697,0.00070101593,0.00025016605,0.0018071567,0.00037214212,0.0016182263,0.00022044475,0.00077487004],"category_scores_gemma":[0.000060217197,0.0006306829,0.00038548684,0.00083975197,0.00008538273,0.0003449039,0.00042756693,0.0011357681,0.000027088525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026708192,0.00016125098,0.000079911486,0.000027963115,0.000116770796,0.00016309574,0.00010484395,0.8168215,0.000043327847,0.10366441,0.031391438,0.047158383],"study_design_scores_gemma":[0.0026859762,0.00059511466,0.000019063353,0.00003865558,0.000112315975,0.000052736177,0.00014865761,0.9738105,0.000009087879,0.0033996277,0.018418757,0.00070950564],"about_ca_topic_score_codex":0.000030315385,"about_ca_topic_score_gemma":0.000009946755,"teacher_disagreement_score":0.984003,"about_ca_system_score_codex":0.0004336274,"about_ca_system_score_gemma":0.00042192108,"threshold_uncertainty_score":0.9996145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013661204,0.0056611495,0.96649694,0.000043552882,0.0028276206,0.00041970515,0.000013416275,0.00013568389,0.024388282],"genre_scores_gemma":[0.98025835,0.0022923513,0.00046379562,0.000074884905,0.0013039404,0.000025753481,0.00006561551,0.00006894008,0.015446364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977746,0.000054984255,0.0008290786,0.0005981117,0.00033849492,0.00040471082],"domain_scores_gemma":[0.99824333,0.000577558,0.00042453886,0.00054534915,0.000099335426,0.00010991074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007267858,0.00036469538,0.0007115105,0.00020006894,0.00010227705,0.00014828343,0.00039531072,0.0006937229,0.000006949352],"category_scores_gemma":[0.000013674439,0.0003212754,0.0001098842,0.00015778396,0.000069392605,0.00009573635,0.00025682602,0.0006404519,0.000004940649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036447076,0.000028571338,0.0008365505,0.00057440676,0.0001943534,0.00031696714,0.0010587045,0.42010283,0.0000024896692,0.26641396,0.0018145916,0.30862013],"study_design_scores_gemma":[0.00013815599,0.00009441799,0.000015119793,0.0015404904,0.000022809623,0.00004447149,0.000009246753,0.98372555,0.0000010609812,0.009723095,0.0044363216,0.0002492908],"about_ca_topic_score_codex":0.00009179773,"about_ca_topic_score_gemma":0.000032811582,"teacher_disagreement_score":0.9802447,"about_ca_system_score_codex":0.000064538115,"about_ca_system_score_gemma":0.00006151382,"threshold_uncertainty_score":0.99992394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04050536,0.0000024722733,0.915098,0.000029850318,0.00012396037,0.043223653,0.000014901024,0.00028756203,0.00071423873],"genre_scores_gemma":[0.9482952,5.375982e-7,0.004038392,0.000084912615,0.000042554722,0.04747023,0.000055712873,0.000007124502,0.000005388152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988055,0.00008408133,0.00043570806,0.0002013158,0.00017267946,0.00030066402],"domain_scores_gemma":[0.9991938,0.00013721293,0.00019683,0.00019183349,0.0001984729,0.00008186808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007533876,0.00015576437,0.00017715337,0.00025137924,0.00027466065,0.00036648166,0.00018488473,0.000111511734,0.0000013567814],"category_scores_gemma":[0.000040757277,0.00014370648,0.000027163853,0.0006379093,0.000055808778,0.0018921593,0.00007379443,0.00009568119,0.000013726566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023524361,0.00005517982,0.00085603056,0.00032052115,0.000017915516,0.000008366299,0.022382546,0.031121079,0.0001129469,0.032556843,0.00021465612,0.9121187],"study_design_scores_gemma":[0.0009877807,0.0004146891,0.0030915686,0.000170102,0.0000028728678,0.000009921598,0.0005443181,0.99314874,0.0001654431,0.0010306515,0.00025652233,0.00017737084],"about_ca_topic_score_codex":0.000025767768,"about_ca_topic_score_gemma":0.000011753109,"teacher_disagreement_score":0.96202767,"about_ca_system_score_codex":0.00012704296,"about_ca_system_score_gemma":0.000086503154,"threshold_uncertainty_score":0.586018},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006681158,0.0005921378,0.97769123,0.00050427066,0.011705822,0.00033220535,0.0000032506505,0.00066543586,0.008498983],"genre_scores_gemma":[0.17404151,0.0008221918,0.74268186,0.015378515,0.026325826,0.00010120636,0.000100155536,0.00041851128,0.040130243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946118,0.000072413204,0.00067549484,0.001964045,0.0013344664,0.0013417971],"domain_scores_gemma":[0.9962329,0.0010575292,0.00033269136,0.0018665743,0.00019385935,0.00031643666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014533662,0.00062217936,0.00070889556,0.00082161074,0.00039269737,0.0009825174,0.005178587,0.000510267,0.000009868443],"category_scores_gemma":[0.000021250566,0.00058513536,0.00017674408,0.0022717833,0.0006280991,0.0004846623,0.0026096145,0.0012783773,0.000213318],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026065968,0.000016724758,0.000021732154,0.00002821801,0.000009416186,0.0005524336,0.0003288827,0.018190674,0.0000028187499,0.0018086286,0.0024973277,0.97654057],"study_design_scores_gemma":[0.00015382378,0.00008923556,0.000018691342,0.00044388793,0.0000070354135,0.00008620245,8.030018e-8,0.8738557,0.000013166798,0.11883205,0.0058845943,0.00061549695],"about_ca_topic_score_codex":0.000013469923,"about_ca_topic_score_gemma":0.000048800553,"teacher_disagreement_score":0.975925,"about_ca_system_score_codex":0.00045352033,"about_ca_system_score_gemma":0.0020644462,"threshold_uncertainty_score":0.99966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25335768,0.00005975753,0.74264294,0.0024546206,0.0008070117,0.00033548826,0.000005607283,0.0002460909,0.00009079272],"genre_scores_gemma":[0.87443835,0.000045724828,0.12517369,0.000048065784,0.00016777468,0.000082286024,0.000002337645,0.000013681297,0.000028104867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978228,0.000011388589,0.00027512893,0.00042620307,0.00073775026,0.00072668237],"domain_scores_gemma":[0.99850357,0.00038105322,0.00006304573,0.0002390049,0.0006449087,0.00016840047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042110975,0.00011496628,0.00016628213,0.0016276706,0.00035788614,0.00042139567,0.0018361728,0.00010934048,0.0000010972694],"category_scores_gemma":[0.00042818784,0.0001101845,0.000027129214,0.0019886016,0.00025016852,0.00032055148,0.00039037605,0.00043048966,0.0000037606574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017673397,0.00012472627,0.002640142,0.000070701004,0.0000684086,0.0002695963,0.0006964089,0.01812675,0.044408407,0.3243645,0.0012266159,0.607827],"study_design_scores_gemma":[0.00056110654,0.00010248005,0.00020995355,0.000049052964,9.695154e-7,0.00023791144,0.000095957745,0.94405663,0.00045343477,0.049425483,0.0046614897,0.0001455064],"about_ca_topic_score_codex":0.000017380353,"about_ca_topic_score_gemma":0.0000059739036,"teacher_disagreement_score":0.9259299,"about_ca_system_score_codex":0.0001961522,"about_ca_system_score_gemma":0.00045725156,"threshold_uncertainty_score":0.44931936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024369,0.000022625392,0.4874852,0.002282327,0.00030543676,0.00070366747,0.0000052308187,0.0063723144,0.00038631418],"genre_scores_gemma":[0.958876,0.00004044815,0.040371243,0.00007320961,0.00006735617,0.00029793018,0.000006229352,0.000038687987,0.000228895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678427,0.0000073242973,0.0004840633,0.0011487697,0.00059394905,0.0009816173],"domain_scores_gemma":[0.9982292,0.00026381685,0.00030084277,0.0008137315,0.00029310002,0.00009930626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004985195,0.0004374392,0.00048464804,0.00043277713,0.0004506785,0.0003923475,0.0023849048,0.00029053926,0.000007040527],"category_scores_gemma":[0.00030685152,0.00033839728,0.00011443822,0.0013182375,0.00021173751,0.0002928231,0.0015335411,0.0004553137,0.00004278363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060773746,0.0007573545,0.003189568,0.00080912764,0.00021113534,0.00006591153,0.0030985044,0.00014491325,0.011942601,0.34326616,0.02000077,0.61590624],"study_design_scores_gemma":[0.0024613992,0.0018116868,0.0026626433,0.0007139668,0.000076803306,0.000044671364,0.0009285418,0.7346608,0.17327313,0.072218284,0.009536181,0.0016119044],"about_ca_topic_score_codex":0.0000055028986,"about_ca_topic_score_gemma":9.359862e-7,"teacher_disagreement_score":0.7345159,"about_ca_system_score_codex":0.00010398267,"about_ca_system_score_gemma":0.000114106486,"threshold_uncertainty_score":0.9999068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045952983,0.00022087015,0.98541677,0.0016061254,0.00003991037,0.0024187271,0.000006994315,0.00015193313,0.0055433554],"genre_scores_gemma":[0.9918557,0.000273079,0.005135417,0.0000889549,0.000017288594,0.002481483,0.00010725202,0.000005881774,0.000034968252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977099,0.00047373347,0.00053976895,0.00024768102,0.0007053186,0.0003236353],"domain_scores_gemma":[0.9938562,0.0002534066,0.0003168469,0.0011382446,0.0043481146,0.00008717281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041071908,0.0001192221,0.00018109957,0.00052489794,0.0007130487,0.00013545423,0.00073180953,0.00022310288,0.000007709029],"category_scores_gemma":[0.00036326505,0.00012448206,0.00003532199,0.0012062169,0.00031978995,0.0013240719,0.0003232124,0.00033354174,0.000002836243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027409285,0.000095525436,0.000117474876,0.000014169573,0.000008811499,1.1871952e-7,0.00023326658,0.00072223897,0.000025695976,0.7091425,0.00014973056,0.28946304],"study_design_scores_gemma":[0.0007140647,0.00042278145,0.0004989633,0.00012903087,0.000008442327,0.000015448519,0.0013751755,0.97211474,0.00024407255,0.023169713,0.001188311,0.00011924569],"about_ca_topic_score_codex":0.00003903991,"about_ca_topic_score_gemma":0.000012590481,"teacher_disagreement_score":0.9872604,"about_ca_system_score_codex":0.00032395317,"about_ca_system_score_gemma":0.0007918597,"threshold_uncertainty_score":0.5484266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006364457,0.00008660358,0.99397844,0.0007007599,0.002803717,0.00039176305,0.000014823067,0.00030360522,0.0010838314],"genre_scores_gemma":[0.8200213,0.0004898761,0.15642008,0.008323988,0.0016892384,0.000052593954,0.00034178357,0.00020488922,0.012456254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996312,0.00003727007,0.00054924074,0.0016456998,0.0007783263,0.0006774626],"domain_scores_gemma":[0.9977773,0.0002874252,0.00033147828,0.0011602507,0.00017712223,0.0002664134],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073154934,0.00058456307,0.0005683885,0.0007746102,0.00043341878,0.0011307659,0.0015456587,0.00041602092,0.000018056588],"category_scores_gemma":[0.000019059895,0.0005282357,0.00011107702,0.0006735361,0.0007804962,0.0005052445,0.000899555,0.00080758217,0.000063885585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018909186,0.000031290092,0.000204949,0.00004081292,0.000017686922,0.00011046059,0.00077865506,0.00044248524,0.0002631222,0.022569736,0.000066515626,0.9754554],"study_design_scores_gemma":[0.00038117456,0.00029224268,0.00056641456,0.00044197383,0.000012642132,0.00008513906,1.7350983e-7,0.9397766,0.00003211088,0.05179637,0.005712317,0.00090282597],"about_ca_topic_score_codex":0.000020439558,"about_ca_topic_score_gemma":0.00007782958,"teacher_disagreement_score":0.9745526,"about_ca_system_score_codex":0.000120042874,"about_ca_system_score_gemma":0.00045243558,"threshold_uncertainty_score":0.9999062},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460467,0.000046423098,0.031105272,0.0007099894,0.0005888553,0.00024923743,0.0000028701877,0.00020123877,0.021049414],"genre_scores_gemma":[0.9977862,0.000030698797,0.0003891803,0.00008496581,0.000030211402,0.0000035899461,0.0000013734865,0.0000064828473,0.001667269],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896455,0.000020542537,0.00030498582,0.0002087894,0.0002783586,0.00022275352],"domain_scores_gemma":[0.99906117,0.000068199304,0.00013211588,0.00062484195,0.00006547091,0.0000482044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014908864,0.0001046808,0.0001640131,0.00007088254,0.00009433659,0.000023753339,0.0007549521,0.00004861613,0.000032226173],"category_scores_gemma":[0.0000016128613,0.000069305126,0.00007712464,0.00070466154,0.00008042854,0.0001640576,0.00042208334,0.00008062183,0.000015720814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034764802,0.0014155785,0.32484868,0.001111217,0.00042494666,0.000070987,0.048772875,0.010517063,0.0041435612,0.13386527,0.28805798,0.1864242],"study_design_scores_gemma":[0.00055457785,0.00013531408,0.012383515,0.00008276479,0.000006833261,0.0000076009574,0.00034264277,0.9695159,0.014266836,0.00008068755,0.0024393713,0.00018393349],"about_ca_topic_score_codex":0.0000126837585,"about_ca_topic_score_gemma":8.473493e-7,"teacher_disagreement_score":0.95899886,"about_ca_system_score_codex":0.000010914767,"about_ca_system_score_gemma":0.000039916606,"threshold_uncertainty_score":0.2826181},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012079198,0.000016130178,0.9923346,0.0007048007,0.0005179312,0.00034580316,0.000009570244,0.0008925833,0.0050577996],"genre_scores_gemma":[0.8492014,0.000033207773,0.13804269,0.0010368733,0.00013201662,0.00011957262,0.000120227814,0.000020881731,0.01129317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985262,0.000019151814,0.00031770353,0.00042306993,0.00022059173,0.0004932492],"domain_scores_gemma":[0.9988363,0.0002423135,0.00008172303,0.0005373771,0.00010134403,0.00020094145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041302782,0.00017306817,0.00020585099,0.00010938864,0.00020113212,0.00016625319,0.0005308766,0.000113701535,0.000020064499],"category_scores_gemma":[0.000014864629,0.00015419607,0.00009735228,0.00045004342,0.000031941312,0.00032578706,0.00017548758,0.000099241675,0.00009032704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016776923,0.000038701874,0.000053424246,0.000023511839,0.000020178284,0.000027613192,0.00014150498,0.15554798,0.000004399368,0.40480378,0.1244981,0.31482401],"study_design_scores_gemma":[0.0002731047,0.00003909869,0.00003764646,0.000014608346,0.000012192257,0.000007389582,0.0000062628137,0.9666373,0.0000010188272,0.032230463,0.00053641305,0.00020451327],"about_ca_topic_score_codex":0.000004735828,"about_ca_topic_score_gemma":0.0000028238776,"teacher_disagreement_score":0.8542919,"about_ca_system_score_codex":0.000023143955,"about_ca_system_score_gemma":0.00013896248,"threshold_uncertainty_score":0.62879336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023464425,0.0000058629757,0.95215714,0.0013343139,0.00009151211,0.0134886755,0.000023722123,0.00033858547,0.030213771],"genre_scores_gemma":[0.96291107,0.000011519058,0.01805812,0.00035820605,0.000105541556,0.013327514,0.000037083646,0.000016322318,0.0051746494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987747,0.00003310641,0.0003025464,0.00031322628,0.00023942272,0.0003369863],"domain_scores_gemma":[0.99879813,0.0002870575,0.00012160745,0.0005271489,0.00012651597,0.0001395152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003901675,0.0001294043,0.00034066144,0.00036229598,0.00018099345,0.00007491416,0.0004660493,0.000071879425,0.000027174405],"category_scores_gemma":[0.000015003216,0.00010309281,0.00025352204,0.002209085,0.00004595262,0.0001553717,0.00023589365,0.00006501,0.000009649332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014133181,0.0009672107,0.028792176,0.00043370444,0.0028132126,0.000046365865,0.009499218,0.020227496,0.00094610907,0.6236482,0.11182877,0.2006562],"study_design_scores_gemma":[0.0002617081,0.000066044595,0.00072346814,0.000021790052,0.00008003659,6.263752e-7,0.00014139221,0.98752916,0.00024920987,0.0053677782,0.0054156994,0.00014306775],"about_ca_topic_score_codex":0.00004854209,"about_ca_topic_score_gemma":0.000024377283,"teacher_disagreement_score":0.96730167,"about_ca_system_score_codex":0.000019393829,"about_ca_system_score_gemma":0.00009617522,"threshold_uncertainty_score":0.4204003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045050055,0.00010432109,0.94589746,0.0038858934,0.0040844493,0.000251817,0.0000019621264,0.00057273544,0.00015129469],"genre_scores_gemma":[0.99216384,0.0001517285,0.0011658551,0.004853673,0.0013984602,0.00008733182,0.000042963373,0.000039065388,0.00009711107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966536,0.00016543915,0.0006428397,0.000815414,0.00045933356,0.0012633706],"domain_scores_gemma":[0.9978871,0.0006793712,0.00021247294,0.00088325964,0.0000955552,0.00024229141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082487403,0.00034864593,0.00041284595,0.00035994189,0.0003346286,0.00047010448,0.001419252,0.00018635848,0.000009177017],"category_scores_gemma":[0.0000062513823,0.0003667772,0.00012592292,0.0022783254,0.00013845465,0.0008255025,0.00036902964,0.000469548,0.000013201583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041693853,0.000058206304,0.008166144,0.000023567,0.000053863136,0.001115396,0.00040566243,0.68679035,0.000017556531,0.003320141,0.064832434,0.235175],"study_design_scores_gemma":[0.00054336706,0.000027392865,0.0048814965,0.00005220278,0.000012421498,0.000021979804,0.000014620473,0.98298585,0.000008433924,0.0063939397,0.0046286066,0.00042967135],"about_ca_topic_score_codex":0.00073263136,"about_ca_topic_score_gemma":0.0003692106,"teacher_disagreement_score":0.94711375,"about_ca_system_score_codex":0.0003602916,"about_ca_system_score_gemma":0.00015976417,"threshold_uncertainty_score":0.9998784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27611628,0.00024843644,0.72273684,0.000020145302,0.00013343674,0.0003145038,0.0000084579615,0.00023735434,0.00018454205],"genre_scores_gemma":[0.9872106,0.00016526811,0.012106096,0.000063483436,0.000060648348,0.00011231974,0.00026345125,0.000008349279,0.000009819433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819624,0.00023982849,0.0005718936,0.0002964082,0.0002472914,0.00044836313],"domain_scores_gemma":[0.99913543,0.00015359194,0.0002511775,0.00020784047,0.0001539955,0.00009794889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014139988,0.00020098098,0.000264025,0.00020512559,0.0003455013,0.00040896446,0.00017912597,0.00019751913,0.0000012756104],"category_scores_gemma":[0.000047205896,0.00020475601,0.000042501557,0.0012131544,0.00009728697,0.0033685819,0.00020535401,0.00019463444,0.0000029310265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014889908,0.0000810056,0.0024745513,0.00026959815,0.00002689872,0.0000047080594,0.006278754,0.35037062,0.00003348839,0.0043672095,0.00034840807,0.63559586],"study_design_scores_gemma":[0.00043088803,0.000096827745,0.00237021,0.000100413556,0.000007282238,0.000056655943,0.00028428208,0.99340904,0.000020597758,0.0024497395,0.00055009144,0.00022397612],"about_ca_topic_score_codex":0.00008724863,"about_ca_topic_score_gemma":0.00006255307,"teacher_disagreement_score":0.71109426,"about_ca_system_score_codex":0.00043366794,"about_ca_system_score_gemma":0.00010952668,"threshold_uncertainty_score":0.8349708},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07777301,0.000017476284,0.9190052,0.000958569,0.0001568577,0.00024166518,0.0000034856673,0.00027629104,0.0015674008],"genre_scores_gemma":[0.97362244,0.00001432614,0.02539635,0.00040827398,0.000023263014,0.000066698194,0.000060380615,0.0000046897626,0.00040358008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888104,0.000094764444,0.00030790752,0.0003429661,0.00021694035,0.00015635072],"domain_scores_gemma":[0.9995689,0.000067387264,0.000021295105,0.00013799331,0.00013984423,0.000064591404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050844415,0.00010244246,0.0001161173,0.00012346257,0.00012434873,0.0002352734,0.00015406372,0.0000827045,0.000035005534],"category_scores_gemma":[0.000035142344,0.00008665416,0.000019365409,0.00040962317,0.000054203232,0.00033592986,0.0001462863,0.00012592608,0.000038679504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021278496,0.003254581,0.017306702,0.00007484292,0.00008803118,0.00017443665,0.0069010654,0.006184562,0.07189313,0.49301833,0.037400983,0.36349055],"study_design_scores_gemma":[0.00040766897,0.00003717415,0.00711496,0.00002199951,7.8151203e-7,0.000010450411,0.00011961822,0.99088943,0.0005130823,0.00071842474,0.000060241655,0.00010616958],"about_ca_topic_score_codex":0.000089291185,"about_ca_topic_score_gemma":0.00023592926,"teacher_disagreement_score":0.98470485,"about_ca_system_score_codex":0.00008534047,"about_ca_system_score_gemma":0.00007648178,"threshold_uncertainty_score":0.35336542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10353031,0.019584505,0.85656285,0.0018356078,0.015399997,0.0007070839,0.000054695625,0.00007388799,0.0022510341],"genre_scores_gemma":[0.9932034,0.00011664903,0.0013505211,0.001295029,0.0029263985,0.000024916571,0.000004528861,0.000019783382,0.0010587948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976632,0.00033466905,0.00068297505,0.0003380293,0.000608149,0.00037300657],"domain_scores_gemma":[0.9979751,0.000359223,0.0006200234,0.00034024852,0.0003266151,0.00037875044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083509507,0.00022053612,0.0005683919,0.00016743131,0.0005371157,0.00033042158,0.0008978905,0.000092779024,0.000046488243],"category_scores_gemma":[0.0000031291063,0.00019199913,0.00013577561,0.00039179917,0.000027480153,0.00029568453,0.00056418346,0.00053688185,0.0000042491347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010094756,0.000516826,0.003838996,0.00024554602,0.0012533154,0.004685786,0.04786282,0.48994106,0.0003036318,0.002894603,0.34265405,0.10479388],"study_design_scores_gemma":[0.0012271845,0.0015611104,0.00054709864,0.00032379726,0.00008956033,0.0015216441,0.0084378375,0.9233894,0.000005685235,0.001175498,0.061207615,0.0005135832],"about_ca_topic_score_codex":0.0003870952,"about_ca_topic_score_gemma":0.000025526144,"teacher_disagreement_score":0.88967305,"about_ca_system_score_codex":0.00016466959,"about_ca_system_score_gemma":0.0002504679,"threshold_uncertainty_score":0.78294975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014238645,0.00062687165,0.99215513,0.00072831364,0.00025321802,0.00035833885,0.0000023585555,0.00031114096,0.004140758],"genre_scores_gemma":[0.56779325,0.001166934,0.4019588,0.0028883116,0.00036789358,0.000120780496,0.000029638712,0.0000482402,0.025626164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987036,0.000027559881,0.00020824104,0.00047215453,0.00014973087,0.00043871583],"domain_scores_gemma":[0.9992457,0.00018710288,0.00005382531,0.00032299117,0.00002446582,0.00016590192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047342473,0.00015115863,0.0001818017,0.00007496378,0.00026155033,0.0001752347,0.000271909,0.00006305502,0.0000061297537],"category_scores_gemma":[0.0000023499467,0.00013352586,0.000036659996,0.00032918854,0.00004659351,0.00014777205,0.00050271186,0.000074479525,0.000017415294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024109167,0.000020617777,0.00022437728,0.00005987193,0.000057138262,0.00006996255,0.000376492,0.00032340168,0.000014100483,0.019163774,0.07050423,0.9091619],"study_design_scores_gemma":[0.00058121403,0.00006046612,0.0004896534,0.00003435666,0.000017190772,0.000011393022,0.00010016314,0.90034777,0.00000241956,0.0026392904,0.09553292,0.00018317458],"about_ca_topic_score_codex":0.0000039984466,"about_ca_topic_score_gemma":0.000009197432,"teacher_disagreement_score":0.90897876,"about_ca_system_score_codex":0.000011316663,"about_ca_system_score_gemma":0.000008626602,"threshold_uncertainty_score":0.5445026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017683479,0.00086497393,0.9782097,0.0017540713,0.0014530815,0.00041073485,0.00000783763,0.0009701652,0.014561133],"genre_scores_gemma":[0.98071116,0.00017978814,0.007934134,0.0010660664,0.00027110975,0.00008696071,0.000043768123,0.000022833208,0.009684151],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853987,0.000045440465,0.00028362495,0.00040250728,0.0002050913,0.00052347255],"domain_scores_gemma":[0.99836767,0.0005726934,0.000094164854,0.00057420554,0.00021574437,0.00017551419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312745,0.00019693197,0.00030911207,0.00015432744,0.0002355277,0.00020602052,0.0006163168,0.00012681547,0.000026998534],"category_scores_gemma":[0.000017297796,0.00017319081,0.000093333474,0.0017229342,0.00005284298,0.0005873994,0.00028914626,0.00011505585,0.000071325136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010020622,0.000111629386,0.00057887915,0.00004715982,0.000069932175,0.000085881446,0.00026108135,0.0051851203,0.000020287083,0.07555508,0.52877927,0.38920552],"study_design_scores_gemma":[0.0005656965,0.000071121685,0.000469791,0.00002164873,0.000005349276,0.000008752937,0.000089866924,0.8922626,0.0000072329285,0.003174651,0.1030817,0.00024162025],"about_ca_topic_score_codex":0.000023729051,"about_ca_topic_score_gemma":0.0000120971235,"teacher_disagreement_score":0.9789428,"about_ca_system_score_codex":0.000021566893,"about_ca_system_score_gemma":0.00022988203,"threshold_uncertainty_score":0.7062516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004061529,0.00029237635,0.9876924,0.003262172,0.0002042564,0.00029802736,0.000005652707,0.0006539965,0.007184931],"genre_scores_gemma":[0.8958554,0.00027681122,0.10056099,0.0014161037,0.00010602268,0.00002821214,0.0007030281,0.000029353083,0.0010240346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997408,0.00024704007,0.0006072456,0.00068542967,0.00040703485,0.0006452716],"domain_scores_gemma":[0.9961239,0.00065205205,0.00013206643,0.0027490375,0.00007707356,0.0002658715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019267922,0.00023253758,0.0003188725,0.00020095531,0.00028478255,0.00017008846,0.0029474176,0.00015978969,0.0001239168],"category_scores_gemma":[0.000017212538,0.00021361932,0.000054148684,0.0015323496,0.000069842165,0.00022699131,0.0007233183,0.00032944704,0.000117954056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007367741,0.0002970312,0.0011023913,0.00008738747,0.000039375995,0.0005144647,0.00044756357,0.1677402,0.00003488849,0.033010818,0.051681515,0.7449707],"study_design_scores_gemma":[0.0006252102,0.00003509593,0.00020005777,0.00011379295,0.000013045008,0.000006469695,0.00003735525,0.9821018,0.0000038210223,0.0055297236,0.011060433,0.0002731694],"about_ca_topic_score_codex":0.00009197088,"about_ca_topic_score_gemma":0.0001189733,"teacher_disagreement_score":0.8954493,"about_ca_system_score_codex":0.000037891983,"about_ca_system_score_gemma":0.00027795913,"threshold_uncertainty_score":0.8711143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17561309,0.012676162,0.76491624,0.006398844,0.0005393631,0.0004598868,0.0000120085815,0.00013339876,0.039251022],"genre_scores_gemma":[0.9714839,0.006367827,0.009989758,0.00004246403,0.0000085168385,0.00001839984,0.000072219074,0.000018730983,0.01199821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456125,0.003485336,0.00088804704,0.0004390388,0.0002625991,0.00036374445],"domain_scores_gemma":[0.99441594,0.0027588543,0.0005563102,0.0014334158,0.000709559,0.000125905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068245055,0.00019624541,0.00039449657,0.00024249218,0.00010974556,0.00012542999,0.0011343044,0.00030646464,0.000095194104],"category_scores_gemma":[0.00022282913,0.00022564002,0.000102191596,0.0013991923,0.00042914134,0.0003605322,0.0010933556,0.000524913,0.000011280655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015942773,0.00049052003,0.0062650326,0.00022575875,0.000064693246,0.000021369411,0.03272108,0.0027566245,0.00022484161,0.20160174,0.0014973026,0.7541151],"study_design_scores_gemma":[0.00048333622,0.000002562191,0.0045497785,0.0021529463,0.000018352232,0.000018950179,0.00022315494,0.9850634,0.0010628384,0.0035548257,0.0026742853,0.00019557404],"about_ca_topic_score_codex":0.0015392189,"about_ca_topic_score_gemma":0.0007586751,"teacher_disagreement_score":0.9823068,"about_ca_system_score_codex":0.00003852431,"about_ca_system_score_gemma":0.00013174072,"threshold_uncertainty_score":0.9201333},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01566495,0.00016580665,0.9809897,0.00021662809,0.0010828245,0.0011347642,0.000012804478,0.0005228237,0.00020968192],"genre_scores_gemma":[0.9287472,0.000027665077,0.069900915,0.0005443621,0.0003182871,0.000301995,0.0000102611975,0.000045227076,0.00010407927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976226,0.00015021415,0.0005199136,0.00085544615,0.00025922144,0.0005925741],"domain_scores_gemma":[0.9981558,0.0010512144,0.00009178296,0.00045333357,0.0000926137,0.00015530788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000563504,0.00034414144,0.00037909075,0.00028492082,0.00046735996,0.00044304327,0.00042190895,0.00025132927,0.000021310627],"category_scores_gemma":[0.000001482843,0.00031872766,0.00015466801,0.0009795624,0.00012603587,0.0002895822,0.000008973611,0.0006737534,0.00000837035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050298513,0.000095313706,0.0000043298865,0.000039588263,0.000041148996,0.000044375367,0.0016033542,0.62078005,0.00010860572,0.0036538248,0.00018004225,0.37339905],"study_design_scores_gemma":[0.00047955543,0.00050206215,0.0000045195725,0.0007560809,0.000029869376,0.00005939085,0.00055750285,0.9955716,0.0001925495,0.00060218124,0.0008638689,0.00038082534],"about_ca_topic_score_codex":0.000012844262,"about_ca_topic_score_gemma":0.000013314727,"teacher_disagreement_score":0.91308224,"about_ca_system_score_codex":0.0001797739,"about_ca_system_score_gemma":0.00018762038,"threshold_uncertainty_score":0.9999265},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003221323,0.00008851333,0.29720196,0.002764594,0.00071310595,0.0015091762,0.6950593,0.0004838384,0.0021472878],"genre_scores_gemma":[0.005243603,0.00020577987,0.00070581643,0.0018874934,0.0014491944,9.785243e-7,0.98827446,0.00095976505,0.0012729224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959836,0.0008047766,0.00066377973,0.00092974125,0.0005657463,0.001052374],"domain_scores_gemma":[0.9963394,0.00089179975,0.00034157332,0.0015603417,0.000586242,0.00028067786],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017572431,0.0003797747,0.00039809238,0.00026409022,0.0041217124,0.0020051876,0.0041581434,0.00031797806,0.0018367803],"category_scores_gemma":[0.0005509863,0.00033389556,0.00013471338,0.0010587267,0.00026409258,0.00033899714,0.002888364,0.0007552486,0.0016260203],"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.00006937418,0.00009795045,2.8719631e-7,0.000031456904,0.000043528646,0.000018370254,0.00029083557,0.00038132578,0.0000035561964,0.0070189848,0.9774091,0.014635184],"study_design_scores_gemma":[0.000729643,0.00036208465,0.0000055155624,0.000081511775,0.000015736714,0.000047508092,0.000064254986,0.11935035,0.0000014670296,0.0013883398,0.87760854,0.00034505682],"about_ca_topic_score_codex":0.000020942574,"about_ca_topic_score_gemma":0.00003091199,"teacher_disagreement_score":0.29649615,"about_ca_system_score_codex":0.00018122444,"about_ca_system_score_gemma":0.000036134334,"threshold_uncertainty_score":0.9999113},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015402473,0.00006882602,0.006527915,0.0000631113,0.00043694128,0.00095392094,0.9916145,0.00026354947,0.000055838264],"genre_scores_gemma":[0.00018319118,0.000003065831,0.00091288344,0.00045276893,0.0006136278,0.0004658512,0.9972596,0.000036439596,0.000072559116],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692035,0.0001965977,0.0004192039,0.00092994235,0.0005269274,0.0010069964],"domain_scores_gemma":[0.9979348,0.00036450877,0.00028235628,0.0010237021,0.0001768966,0.00021770647],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046290233,0.0004417816,0.0005757724,0.0004721502,0.00021322822,0.00034555522,0.0012244574,0.0003623457,0.0029067874],"category_scores_gemma":[0.00033186484,0.00045548182,0.00011702005,0.0023567623,0.000006056764,0.00019816053,0.0017344252,0.00064394186,0.002887896],"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.0000071464615,0.000022023494,0.000002867118,0.00018325863,0.000019696801,0.0004281071,0.0000317641,0.0041857595,6.5640313e-7,0.000001585126,0.9938219,0.001295191],"study_design_scores_gemma":[0.00023790916,0.000020644236,0.0000808559,0.007184594,0.000015246573,0.000034456698,0.000005373289,0.76766735,9.53186e-7,0.00008721396,0.22408569,0.00057967636],"about_ca_topic_score_codex":0.00011756034,"about_ca_topic_score_gemma":0.00012786049,"teacher_disagreement_score":0.76973623,"about_ca_system_score_codex":0.00013262175,"about_ca_system_score_gemma":0.00035316762,"threshold_uncertainty_score":0.9997897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8188929,0.00084111665,0.16878465,0.001997153,0.003965268,0.0016227281,0.0015833538,0.00031099256,0.002001863],"genre_scores_gemma":[0.90307426,7.0121604e-7,0.091922715,0.0001334866,0.0008479868,0.00008690695,0.00004845578,0.000055354736,0.0038301055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688405,0.00009961753,0.00069333066,0.0010979674,0.00048475523,0.0007402939],"domain_scores_gemma":[0.99714446,0.00074129313,0.00053035794,0.0012085756,0.0001205403,0.0002547608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050378335,0.0005463007,0.0008166197,0.000028871784,0.0002036472,0.0003604262,0.003011302,0.00048276936,0.00001109628],"category_scores_gemma":[0.000023075785,0.00042705718,0.0018791391,0.00013144815,0.00039161372,0.0001145872,0.004688775,0.0012789306,0.00006191416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029383476,0.00029019575,0.00017485031,0.00033128267,0.0006410798,0.0000015041959,0.0008777114,0.8547394,0.000023447352,0.00087818014,0.13647869,0.005534224],"study_design_scores_gemma":[0.00038529985,0.00012666867,0.00033193536,0.00023410551,0.00027717368,4.1833086e-8,0.000082257255,0.98944736,0.000089003464,0.00155696,0.00727943,0.00018976946],"about_ca_topic_score_codex":0.00006924948,"about_ca_topic_score_gemma":0.0000061002893,"teacher_disagreement_score":0.13470791,"about_ca_system_score_codex":0.00024165813,"about_ca_system_score_gemma":0.0004356861,"threshold_uncertainty_score":0.99981815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025911687,0.0002911086,0.9884108,0.0012713952,0.0022004999,0.0004935651,0.000006684338,0.00036414288,0.0043706936],"genre_scores_gemma":[0.8534789,0.000012297731,0.14581141,0.000451307,0.00012673023,0.00008239029,0.0000036687493,0.0000034650113,0.000029800307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977498,0.00007758873,0.0004630311,0.00045797756,0.0006598113,0.0005917895],"domain_scores_gemma":[0.99875546,0.00041872342,0.00014497498,0.0003102447,0.00017204229,0.00019855083],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0051304507,0.00017574817,0.00018160362,0.00045699446,0.0018470569,0.0020861488,0.0010987517,0.00006500049,0.00000646428],"category_scores_gemma":[0.000047437356,0.0001344875,0.000057710586,0.002391332,0.0011548571,0.00718451,0.00012475281,0.00013843366,0.000036005495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018025592,0.00002112184,0.0001665938,0.00015619597,0.00001051545,0.000007044066,0.005764989,0.16104203,0.00016616327,0.70447344,0.0048326086,0.12334129],"study_design_scores_gemma":[0.00017620709,0.00018205043,0.00013124707,0.00007611017,0.000008028277,0.00003357939,0.00050020317,0.993355,0.0001509913,0.0028380225,0.0023587202,0.00018985065],"about_ca_topic_score_codex":0.000020804411,"about_ca_topic_score_gemma":0.000005252375,"teacher_disagreement_score":0.8508878,"about_ca_system_score_codex":0.00008142295,"about_ca_system_score_gemma":0.0012247327,"threshold_uncertainty_score":0.9994524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6201012,0.00035208618,0.37881213,0.0002653184,0.000121683224,0.00011218758,0.0000024928704,0.00007871806,0.00015418384],"genre_scores_gemma":[0.9951952,0.000044901823,0.004499034,0.00006378749,0.000030787956,0.000007912462,0.00004185962,0.000015329515,0.00010119341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829453,0.00029629853,0.0004668878,0.0004006833,0.00026256245,0.0002790371],"domain_scores_gemma":[0.99914056,0.00017627525,0.0001162835,0.0004411751,0.00002832059,0.00009740627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060956075,0.00016165031,0.00035423625,0.00047443667,0.00014073415,0.00025293967,0.00040884537,0.00010576228,0.00003586473],"category_scores_gemma":[0.000008139972,0.0001697972,0.00011289572,0.0013516344,0.000048088586,0.00027597471,0.0002952232,0.0002566187,0.000014617599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029718434,0.00050664233,0.020470126,0.0001729895,0.0015274399,0.00042156622,0.014172823,0.47739133,0.07132677,0.004344505,0.000117099735,0.40925154],"study_design_scores_gemma":[0.00020656441,0.000041067553,0.0058804783,0.00012657336,0.00013544034,0.000002752849,0.0001335535,0.9924594,0.00023662357,0.0000955026,0.00049813476,0.00018390175],"about_ca_topic_score_codex":0.0003617014,"about_ca_topic_score_gemma":0.00005285793,"teacher_disagreement_score":0.51506805,"about_ca_system_score_codex":0.00012987225,"about_ca_system_score_gemma":0.00006520538,"threshold_uncertainty_score":0.6924129},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020494938,0.00085200934,0.9735309,0.00027196005,0.001332758,0.00045818425,0.000017246422,0.00034794872,0.002694082],"genre_scores_gemma":[0.93821985,0.000049845166,0.057668224,0.0009056324,0.00027903062,0.00006196563,0.000017694774,0.00003408147,0.002763669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977935,0.00002805269,0.00041506908,0.00082452287,0.0003305427,0.00060833455],"domain_scores_gemma":[0.99856466,0.000572866,0.00006394846,0.0005520813,0.0000313802,0.00021509019],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047456697,0.00028637412,0.00025132776,0.00010722196,0.00025251263,0.00082709675,0.00077127037,0.0001688304,0.000027832511],"category_scores_gemma":[0.000011622498,0.0002523236,0.00018323261,0.00018245254,0.00010134663,0.0013506063,0.00061759667,0.00022657565,0.000043175434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021875191,0.00061020564,0.004446245,0.0012656632,0.00064448686,0.00031899332,0.015902102,0.1597852,0.0016083881,0.546959,0.10077546,0.16746554],"study_design_scores_gemma":[0.00045950888,0.000044937213,0.00001527038,0.00008578387,0.000015625932,0.00001641213,0.000029991652,0.9453144,0.00023245555,0.047546126,0.005918244,0.0003212665],"about_ca_topic_score_codex":0.00003573074,"about_ca_topic_score_gemma":0.0000096325875,"teacher_disagreement_score":0.9177249,"about_ca_system_score_codex":0.00009930695,"about_ca_system_score_gemma":0.00006171143,"threshold_uncertainty_score":0.9999929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10762241,0.0027777113,0.88360673,0.00034118767,0.0044587813,0.00064969104,0.000007070559,0.00037395753,0.00016244217],"genre_scores_gemma":[0.9970224,0.00039788886,0.0011626915,0.00021760113,0.00086626376,0.00011800299,0.0000027267085,0.000038800183,0.00017361362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757975,0.0001731605,0.00054630544,0.00078254374,0.00031151247,0.00060671207],"domain_scores_gemma":[0.9984201,0.00068195484,0.00008067482,0.0006272008,0.000040416424,0.00014961856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007053578,0.00032604972,0.00030806128,0.00017268666,0.00043900838,0.00088369957,0.0006198761,0.00017118048,0.000022349941],"category_scores_gemma":[3.8979078e-7,0.00026221797,0.0001616499,0.00075036375,0.00012855278,0.000352909,0.00003180746,0.0010308011,0.000022654884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012102372,0.00007130999,0.000014107236,0.00003439875,0.000030475092,0.00008043826,0.0014798428,0.48761022,0.000017122682,0.0003023337,0.00013723502,0.5102104],"study_design_scores_gemma":[0.00031857495,0.00010574332,0.0003410302,0.0001721388,0.000019423573,0.00015369484,0.000100609795,0.99472195,0.000026971686,0.00046113593,0.0032907065,0.00028802786],"about_ca_topic_score_codex":0.000077014716,"about_ca_topic_score_gemma":0.000030507532,"teacher_disagreement_score":0.8894,"about_ca_system_score_codex":0.00011011598,"about_ca_system_score_gemma":0.00009278752,"threshold_uncertainty_score":0.999983},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081991395,0.002752454,0.9817445,0.0020215474,0.0016609596,0.0014246717,0.00023434836,0.0011016723,0.0008607086],"genre_scores_gemma":[0.9393944,0.0006165531,0.05726445,0.00022423359,0.00024591305,0.0007648713,0.0008046965,0.000036021425,0.0006488667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652153,0.00008307324,0.0007245487,0.0013119817,0.00023576233,0.0011231188],"domain_scores_gemma":[0.99697596,0.00065444876,0.00057003554,0.0014071885,0.00028618544,0.000106207786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083317875,0.00051931496,0.00081852626,0.00022466129,0.0005179865,0.00029204768,0.0015014873,0.00091251236,0.000014567057],"category_scores_gemma":[0.000053472013,0.0004878607,0.00016145731,0.0007200111,0.0001450335,0.00015820774,0.0007609692,0.0009791072,0.000009789666],"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.0002312678,0.00026421767,0.0025210169,0.0005462832,0.00047169297,0.000110586596,0.00029954204,0.0035451027,0.000047532812,0.6750327,0.005842785,0.3110873],"study_design_scores_gemma":[0.0011028717,0.0003658116,0.00003555989,0.0008986843,0.00010350396,0.00006736745,0.00023907011,0.766219,0.0003472934,0.15192899,0.07794969,0.00074214954],"about_ca_topic_score_codex":0.00013942062,"about_ca_topic_score_gemma":0.00018123607,"teacher_disagreement_score":0.93119526,"about_ca_system_score_codex":0.00025122362,"about_ca_system_score_gemma":0.0003566914,"threshold_uncertainty_score":0.9997573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016314517,0.00014183685,0.9010502,0.00029270706,0.0003894767,0.00023037543,0.000009508107,0.0005386162,0.095715836],"genre_scores_gemma":[0.9258853,0.000039338152,0.07280698,0.0003807626,0.000038732494,0.0000455252,0.000018126571,0.000034896602,0.00075033685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852824,0.000009304984,0.00032077404,0.00042508604,0.00037296684,0.00034360815],"domain_scores_gemma":[0.9987738,0.00030307958,0.000059528924,0.0007153576,0.000017641709,0.00013055488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024311617,0.00023348218,0.00025027047,0.00012088697,0.00010058813,0.00033550806,0.00062142516,0.00009729994,0.000056404377],"category_scores_gemma":[0.000003147964,0.00018576776,0.00010739904,0.00039796272,0.0000631835,0.00011050942,0.00016232177,0.00024141825,0.0006333767],"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.0000024481167,0.00003765887,1.8538506e-7,0.00011101674,0.000027476368,0.000050849347,0.0005953431,0.000037707086,0.00011857494,0.96346325,0.0045500216,0.031005464],"study_design_scores_gemma":[0.00008627343,0.000027787915,0.0000013459518,0.00008699184,0.0000150662445,0.00001403285,0.000049620718,0.5870075,0.00004055778,0.41140404,0.0010908947,0.000175839],"about_ca_topic_score_codex":8.357162e-7,"about_ca_topic_score_gemma":7.6424215e-7,"teacher_disagreement_score":0.9242539,"about_ca_system_score_codex":0.000032778917,"about_ca_system_score_gemma":0.00005571331,"threshold_uncertainty_score":0.8140988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046275774,0.0006191414,0.9872219,0.0004515369,0.00243249,0.00050654856,0.0000037242505,0.00030029623,0.008418093],"genre_scores_gemma":[0.5445036,0.000047377092,0.4526227,0.00029147227,0.0008816202,0.00013328339,0.000027215465,0.000019737725,0.0014729518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986547,0.000050483904,0.0003459006,0.00043439664,0.00014701704,0.00036746153],"domain_scores_gemma":[0.99847215,0.00030352955,0.000048492235,0.0010384475,0.000026845146,0.000110540306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040605414,0.00017464971,0.0002022527,0.00007577164,0.00020557792,0.0006686685,0.0011845789,0.00010175699,0.0000055415717],"category_scores_gemma":[0.0000030985213,0.00014586202,0.00013194876,0.0002614383,0.000058459245,0.00038225134,0.00070723036,0.00019677913,0.00002239177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007006963,0.00027477305,0.00007559762,0.00016565867,0.00019021548,0.000027453963,0.0036783626,0.004354702,0.00005425076,0.007624494,0.031432714,0.9520517],"study_design_scores_gemma":[0.000490195,0.000032494423,0.000004207305,0.00008259109,0.000013541223,0.00001903294,0.000060457794,0.95987135,0.0000013252952,0.00030710103,0.038923148,0.00019453415],"about_ca_topic_score_codex":0.000019685347,"about_ca_topic_score_gemma":0.000014699224,"teacher_disagreement_score":0.9555167,"about_ca_system_score_codex":0.00003245986,"about_ca_system_score_gemma":0.000075789045,"threshold_uncertainty_score":0.6447986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6464812,0.00063913607,0.35125434,0.0005819936,0.0003025533,0.0002787923,0.000011148037,0.00007797368,0.00037281765],"genre_scores_gemma":[0.94457453,4.899705e-7,0.055066686,0.000056357538,0.00011384064,0.00001021901,0.000010293375,0.00001147467,0.00015607699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876755,0.00007312748,0.00037082477,0.00034904343,0.00017532885,0.00026412518],"domain_scores_gemma":[0.9983156,0.0009278722,0.00017736442,0.00043423884,0.000059600527,0.00008536024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062227016,0.00015095102,0.00020838725,0.000014018148,0.0003286824,0.00030709233,0.00070255704,0.00009778997,0.0000014734973],"category_scores_gemma":[0.00001959081,0.00011665681,0.00023981076,0.00010702256,0.00016110335,0.00012624574,0.00061643205,0.00022101394,0.0000020328237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045486145,0.00008115605,0.0013038896,0.00007721204,0.00007706057,1.3846771e-7,0.0016508187,0.9570263,0.000021376554,0.0032208525,0.0034412872,0.033095345],"study_design_scores_gemma":[0.0002039807,0.000044380253,0.004836312,0.00008499383,0.000036054593,6.262682e-8,0.00020443337,0.9931541,0.00009713115,0.000103060745,0.0011774084,0.000058085076],"about_ca_topic_score_codex":0.000048050333,"about_ca_topic_score_gemma":0.000004342758,"teacher_disagreement_score":0.29809332,"about_ca_system_score_codex":0.000059764265,"about_ca_system_score_gemma":0.000056434405,"threshold_uncertainty_score":0.47571266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018549217,0.00020454392,0.97698194,0.00043499083,0.0012530381,0.00024656436,0.0000026077576,0.0005597622,0.020131076],"genre_scores_gemma":[0.9563637,0.000041277963,0.020671725,0.0004810179,0.00040494106,0.000031933374,0.000054803764,0.000029526745,0.021921078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998209,0.000057766843,0.0003581127,0.00057135714,0.00022625696,0.0005775233],"domain_scores_gemma":[0.9991363,0.00037121383,0.0000641156,0.00021356842,0.00001900641,0.00019577217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005650635,0.00020725657,0.0002107626,0.000047775633,0.0004352704,0.00073242985,0.00032767278,0.00010655081,0.00011661283],"category_scores_gemma":[0.000011992751,0.00018541077,0.000106935935,0.00024487794,0.000034477,0.00029453234,0.00019394573,0.00024010394,0.00012118425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023951716,0.00005857707,0.00032365363,0.0000543774,0.00015625924,0.00033981947,0.0003204652,0.0021566504,0.00018802774,0.23777972,0.051707264,0.70689124],"study_design_scores_gemma":[0.00016115003,0.000088323,0.000020758742,0.00006127671,0.000016073564,0.000024460025,0.000027093321,0.9043903,0.0000095228115,0.002415954,0.09255898,0.00022611443],"about_ca_topic_score_codex":0.000006361865,"about_ca_topic_score_gemma":0.0000015397212,"teacher_disagreement_score":0.9563102,"about_ca_system_score_codex":0.000048624395,"about_ca_system_score_gemma":0.00011910952,"threshold_uncertainty_score":0.7560832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21751592,0.00088456407,0.7605203,0.00019124514,0.00058758404,0.00012778012,0.0000018425472,0.00010126427,0.020069541],"genre_scores_gemma":[0.99682367,0.000090912916,0.0020046078,0.00020455032,0.00018385031,0.00000705964,0.0000010083033,0.000006064342,0.00067829643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918634,0.000030028003,0.00020351875,0.00021576085,0.00016927719,0.00019505381],"domain_scores_gemma":[0.9986367,0.00096315495,0.00003600184,0.0002807768,0.000025066425,0.000058258564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055642566,0.00009690586,0.00014576565,0.00007535258,0.00008683752,0.00013382235,0.00038219037,0.000046096386,0.00003825067],"category_scores_gemma":[0.000004794651,0.000057266952,0.00003811164,0.00062125665,0.00005364442,0.00016025381,0.00021875816,0.00017184396,0.00002344847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007311154,0.000015456475,0.0045990287,0.0000608026,0.000060670784,0.0000110250985,0.00047544492,0.00032546616,0.00000846516,0.20417728,0.03064644,0.7596126],"study_design_scores_gemma":[0.000040210365,0.00023223626,0.00027624553,0.00012509865,0.000011238396,0.0000042743854,0.0000143756915,0.99349105,0.00011474398,0.001957824,0.0036410666,0.000091637354],"about_ca_topic_score_codex":0.000003935892,"about_ca_topic_score_gemma":4.1244223e-7,"teacher_disagreement_score":0.9931656,"about_ca_system_score_codex":0.000012018411,"about_ca_system_score_gemma":0.00003395449,"threshold_uncertainty_score":0.23352785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028666593,0.00014324811,0.954883,0.0007537311,0.0030814146,0.020944353,0.00006960567,0.000974933,0.019121055],"genre_scores_gemma":[0.78088516,0.000022017655,0.1503045,0.0016172556,0.0034259255,0.05166988,0.00038146664,0.00020726865,0.011486547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956862,0.00007880702,0.0010096489,0.0016893293,0.0005224233,0.0010136309],"domain_scores_gemma":[0.99680465,0.00039406927,0.0003830847,0.0017289921,0.00026452658,0.00042467745],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013289622,0.0006675986,0.0007664211,0.0001831641,0.0002606873,0.0013909502,0.0019778144,0.00062153995,0.00006522206],"category_scores_gemma":[0.000020662565,0.00057900324,0.0004718706,0.00029550426,0.00009121753,0.00003616903,0.005245437,0.001254788,0.0000744427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003620252,0.00019924657,0.000014399008,0.0008866238,0.00016805386,0.00031935377,0.00024180251,0.10987928,0.0000023781774,0.5153687,0.038639415,0.33424452],"study_design_scores_gemma":[0.00026100938,0.00009933928,0.0000028218265,0.00089594664,0.0000638836,0.00004030714,0.000015528845,0.9674473,0.0000021148892,0.02290622,0.0075833746,0.0006822023],"about_ca_topic_score_codex":0.0000327678,"about_ca_topic_score_gemma":0.0000056649847,"teacher_disagreement_score":0.85756797,"about_ca_system_score_codex":0.00014108465,"about_ca_system_score_gemma":0.0009271625,"threshold_uncertainty_score":0.99966615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028666593,0.00014324811,0.954883,0.0007537311,0.0030814146,0.020944353,0.00006960567,0.000974933,0.019121055],"genre_scores_gemma":[0.78088516,0.000022017655,0.1503045,0.0016172556,0.0034259255,0.05166988,0.00038146664,0.00020726865,0.011486547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956862,0.00007880702,0.0010096489,0.0016893293,0.0005224233,0.0010136309],"domain_scores_gemma":[0.99680465,0.00039406927,0.0003830847,0.0017289921,0.00026452658,0.00042467745],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013289622,0.0006675986,0.0007664211,0.0001831641,0.0002606873,0.0013909502,0.0019778144,0.00062153995,0.00006522206],"category_scores_gemma":[0.000020662565,0.00057900324,0.0004718706,0.00029550426,0.00009121753,0.00003616903,0.005245437,0.001254788,0.0000744427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003620252,0.00019924657,0.000014399008,0.0008866238,0.00016805386,0.00031935377,0.00024180251,0.10987928,0.0000023781774,0.5153687,0.038639415,0.33424452],"study_design_scores_gemma":[0.00026100938,0.00009933928,0.0000028218265,0.00089594664,0.0000638836,0.00004030714,0.000015528845,0.9674473,0.0000021148892,0.02290622,0.0075833746,0.0006822023],"about_ca_topic_score_codex":0.0000327678,"about_ca_topic_score_gemma":0.0000056649847,"teacher_disagreement_score":0.85756797,"about_ca_system_score_codex":0.00014108465,"about_ca_system_score_gemma":0.0009271625,"threshold_uncertainty_score":0.99966615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008313171,0.0030726627,0.7147106,0.0154006975,0.0032087239,0.00013808151,8.9283196e-7,0.0005816735,0.26205537],"genre_scores_gemma":[0.98783284,0.000200161,0.0020987045,0.0018093043,0.0011653168,0.0000049838154,0.0000012459137,0.00001528946,0.006872171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985548,0.00008483375,0.00023581379,0.00048171548,0.00027299245,0.00036980506],"domain_scores_gemma":[0.9984047,0.0008065123,0.000037758167,0.0006015219,0.000046159403,0.00010334338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064529607,0.00018213155,0.00017034652,0.00005538019,0.00018604008,0.0004079344,0.0008084037,0.000075772616,0.00012644897],"category_scores_gemma":[0.000007767949,0.00010924245,0.00009779335,0.00021719477,0.00006644339,0.0001344699,0.00029435736,0.00029120248,0.00056755036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001604314,0.000022728776,0.000004903345,0.000013042257,0.00001888658,0.00007424633,0.00061035267,0.0000047830954,0.000008848674,0.5330404,0.094166405,0.3720338],"study_design_scores_gemma":[0.00009134046,0.00007135226,0.00007155264,0.00014190342,0.0000073392366,0.00003504916,0.00013654114,0.8364892,0.000050284452,0.008940834,0.15375538,0.00020922242],"about_ca_topic_score_codex":0.000005514569,"about_ca_topic_score_gemma":0.000008877911,"teacher_disagreement_score":0.9870015,"about_ca_system_score_codex":0.000020730859,"about_ca_system_score_gemma":0.00006595684,"threshold_uncertainty_score":0.72949004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049764037,0.0020307922,0.9268078,0.014944284,0.0013482274,0.00027403454,0.000023619952,0.0002204645,0.004586737],"genre_scores_gemma":[0.9950026,0.00008286992,0.0042861155,0.0002999059,0.00023605216,0.0000124488,0.000008402082,0.0000067780784,0.00006479931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987545,0.00009050332,0.00022965066,0.00031842827,0.0002988954,0.0003080273],"domain_scores_gemma":[0.99900377,0.0005401152,0.000031695734,0.00020813361,0.00007280818,0.00014346487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032620088,0.00012221064,0.00018203199,0.00019494907,0.00011424572,0.00016286646,0.00019544613,0.000056747835,0.000012656143],"category_scores_gemma":[0.00001715159,0.000082160324,0.00010356677,0.00052642316,0.00068647467,0.00017203666,0.00009793526,0.00016046288,0.000009990635],"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.000014451006,0.000028326804,0.0021417143,0.00002723878,0.000041670526,0.000010521238,0.000104879866,0.0000623904,0.0000010128286,0.98677933,0.0012294792,0.009558959],"study_design_scores_gemma":[0.00043529793,0.000128133,0.018818611,0.000115525356,0.000057549718,0.00014739217,0.00005801154,0.39517397,0.000015390215,0.5825451,0.0022928899,0.00021209716],"about_ca_topic_score_codex":0.00007846643,"about_ca_topic_score_gemma":0.0000019690162,"teacher_disagreement_score":0.9452386,"about_ca_system_score_codex":0.0000043335394,"about_ca_system_score_gemma":0.000045269215,"threshold_uncertainty_score":0.3350401},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021920456,0.0002272111,0.9927651,0.0011532465,0.000647697,0.00011927745,0.000004272608,0.00013764192,0.0047262935],"genre_scores_gemma":[0.9449129,0.00015759478,0.05441273,0.000091224014,0.00016009323,0.000021330183,0.000056590052,0.0000075998396,0.00017990336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938273,0.000041559364,0.0002227519,0.0001404126,0.00011730604,0.000095248695],"domain_scores_gemma":[0.9992735,0.00037087302,0.00006835717,0.00015716469,0.00010617788,0.000023920264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025531085,0.00006300454,0.00011426759,0.000056032826,0.00009606528,0.000098185024,0.00027431257,0.00006688221,0.00003489007],"category_scores_gemma":[0.000005397006,0.000058131627,0.000066761044,0.00018888937,0.000035157605,0.000361101,0.00006888869,0.00007044156,0.0000048794964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009394809,0.000034240347,0.000003791116,0.00005475835,0.0000238172,6.244141e-7,0.0024210445,0.00075596524,0.000028573597,0.34893405,0.017412866,0.63032085],"study_design_scores_gemma":[0.00009527542,0.0000130799535,0.000007808063,0.000034397202,0.000011137282,0.000001516225,0.000110125024,0.991285,0.000052581454,0.005167385,0.0031561418,0.00006549735],"about_ca_topic_score_codex":0.00000747527,"about_ca_topic_score_gemma":0.000012489371,"teacher_disagreement_score":0.99052906,"about_ca_system_score_codex":0.000028151515,"about_ca_system_score_gemma":0.000067491,"threshold_uncertainty_score":0.2370539},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008253682,0.0012189536,0.985527,0.002988383,0.00043161283,0.0005540727,0.000037440317,0.0008100559,0.00017882009],"genre_scores_gemma":[0.99120486,0.00029658224,0.007620632,0.00022933642,0.00002264554,0.0004933164,0.000019955532,0.000021831485,0.00009082488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981665,0.00011571709,0.00039161197,0.0007079172,0.00016936052,0.00044891032],"domain_scores_gemma":[0.99775934,0.0007487071,0.00006372305,0.0012046697,0.00014041785,0.00008313022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046150977,0.00024610246,0.00043143466,0.0013740252,0.00028811782,0.00012757178,0.00094197894,0.00047460108,0.000016241624],"category_scores_gemma":[0.0000065364266,0.0002501221,0.0003442042,0.004081556,0.00026795556,0.00023891665,0.000017347196,0.0008419101,0.000019890576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006706086,0.000987722,0.00040465413,0.0000530518,0.0025538823,0.00033290646,0.00035630295,0.19579926,0.0002002014,0.05970644,0.00019599941,0.7393425],"study_design_scores_gemma":[0.0003973369,0.00014443461,0.000050957144,0.00008606482,0.0003796893,0.00003267986,0.000070912,0.9930742,0.00051625096,0.0036390617,0.0013385203,0.0002699061],"about_ca_topic_score_codex":0.0000347486,"about_ca_topic_score_gemma":0.0002815268,"teacher_disagreement_score":0.98295116,"about_ca_system_score_codex":0.000106489846,"about_ca_system_score_gemma":0.000106681204,"threshold_uncertainty_score":0.9999951},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006804693,0.016445644,0.9698018,0.003152829,0.0013540044,0.0003183073,0.000004115535,0.00013734671,0.0019812577],"genre_scores_gemma":[0.9055354,0.022069637,0.071216114,0.0005907678,0.000505532,0.000027377147,0.000015785294,0.000016664304,0.00002269795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983149,0.00019551562,0.000593139,0.00022256895,0.00021771749,0.00045613776],"domain_scores_gemma":[0.99699354,0.0017405596,0.00022621732,0.00077230576,0.00010149265,0.00016591194],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011281263,0.0002115458,0.00027828498,0.00018110068,0.0006333413,0.0010446211,0.0009246013,0.00013848595,0.000004285143],"category_scores_gemma":[0.000009818808,0.00019310294,0.00009821366,0.00074820954,0.00008063432,0.0010692922,0.0002934866,0.0010418899,0.000009109086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027270191,0.00003188609,0.00033717573,0.0000322303,0.000022492059,0.000011593958,0.0009626739,0.0014415277,0.0000023251523,0.26855755,0.00033639863,0.72823685],"study_design_scores_gemma":[0.00023238113,0.000101871905,0.00011577154,0.001580234,0.000009109036,0.00007228731,0.000058281777,0.8307045,0.0000041351204,0.065304555,0.10160456,0.00021230165],"about_ca_topic_score_codex":0.0000023367318,"about_ca_topic_score_gemma":0.000010552254,"teacher_disagreement_score":0.89873075,"about_ca_system_score_codex":0.000050206956,"about_ca_system_score_gemma":0.00010227202,"threshold_uncertainty_score":0.9999924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061917986,0.00002356806,0.9708281,0.00068505196,0.0003804249,0.02585181,0.0000073488563,0.00037778058,0.0012267348],"genre_scores_gemma":[0.96890354,0.0000037999303,0.0058638863,0.00058920163,0.00048891,0.021648696,0.0000204406,0.000036934696,0.002444607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858254,0.000051150906,0.00034356545,0.00051547727,0.00016037312,0.00034691987],"domain_scores_gemma":[0.99904364,0.00035153693,0.00008864832,0.00027321343,0.00008178596,0.0001611509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041943198,0.0001826276,0.00019870316,0.00007109271,0.00020370186,0.0004269003,0.00019044415,0.0001177616,0.0000136931785],"category_scores_gemma":[0.000017615079,0.0001620952,0.00006997057,0.0002021985,0.000065136395,0.00013908134,0.00007856162,0.00017149608,0.000007516264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005681744,0.0000318533,0.00016333758,0.0002288474,0.00005009974,0.00026559862,0.00075519626,0.0024754384,0.000006004167,0.120642856,0.009282289,0.86604166],"study_design_scores_gemma":[0.00036396057,0.00010389227,0.000040113544,0.00018275797,0.000014654069,0.00007484075,0.00010000656,0.9743789,0.000004737995,0.0020946965,0.022441642,0.00019983202],"about_ca_topic_score_codex":0.000011672383,"about_ca_topic_score_gemma":0.0000037985274,"teacher_disagreement_score":0.97190344,"about_ca_system_score_codex":0.000031944517,"about_ca_system_score_gemma":0.00011036143,"threshold_uncertainty_score":0.661005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019964468,0.07990621,0.5185239,0.36091986,0.0032162224,0.00039047457,0.00005288339,0.00013417119,0.016891845],"genre_scores_gemma":[0.99518937,0.00069841254,0.0018406066,0.0019172769,0.0002182515,0.0000019052957,0.0000060315206,0.000011724508,0.00011643444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879104,0.00017779905,0.00037708052,0.00011033844,0.00018397834,0.0003597899],"domain_scores_gemma":[0.9981621,0.0006562957,0.0001320163,0.00046291912,0.00013273771,0.0004539153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078410027,0.00010217918,0.00014367503,0.000081690814,0.000535035,0.000678082,0.0013011683,0.000080346035,0.000010520149],"category_scores_gemma":[0.000023149421,0.00008082294,0.00006127035,0.00022625292,0.00024369026,0.00034916386,0.00010523558,0.00040377464,0.000006139021],"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.000005571617,0.0000064652068,0.0001258652,0.000010653469,0.00005127117,0.00003236553,0.0032391057,0.0000016687987,0.000010597513,0.50868595,0.23305541,0.25477508],"study_design_scores_gemma":[0.00016602334,0.000026552672,0.00027983479,0.000097371536,0.000027972448,0.00016676456,0.0001286031,0.047769614,0.000014034295,0.04311564,0.9080686,0.0001390241],"about_ca_topic_score_codex":0.00030610128,"about_ca_topic_score_gemma":0.0006797691,"teacher_disagreement_score":0.9752249,"about_ca_system_score_codex":0.000101563804,"about_ca_system_score_gemma":0.0006846492,"threshold_uncertainty_score":0.653876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09607105,0.004012454,0.82287884,0.0011500609,0.0005864517,0.00041092225,0.0000029692444,0.00020325124,0.074684],"genre_scores_gemma":[0.9979873,0.00011526598,0.00087302213,0.00076845253,0.00005336822,0.000009503117,8.8708725e-7,0.000010002433,0.00018225274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987139,0.00008106143,0.00031859294,0.00038120028,0.00019015769,0.0003150608],"domain_scores_gemma":[0.99866825,0.00081530015,0.000039070135,0.0003466145,0.000026380863,0.000104360224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006471406,0.0001547192,0.00022302261,0.00011508475,0.00006689786,0.00018777112,0.00035693054,0.00007029771,0.00002048535],"category_scores_gemma":[0.0000067169894,0.00009697799,0.00005952023,0.0005658521,0.0000317942,0.00008378747,0.00015850527,0.00022773618,0.000010428032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025456793,0.000036147354,0.0013537757,0.000009038893,0.000029875971,0.000085970765,0.0009443109,0.0026725307,0.00007140864,0.5960479,0.000389013,0.39833462],"study_design_scores_gemma":[0.00008960613,0.000094924595,0.00065762503,0.00018619545,0.0000056392337,0.000012163023,0.00006678233,0.9917902,0.00008026068,0.0052656843,0.0016142676,0.00013667769],"about_ca_topic_score_codex":0.00012568444,"about_ca_topic_score_gemma":0.000049036746,"teacher_disagreement_score":0.9891176,"about_ca_system_score_codex":0.000015522266,"about_ca_system_score_gemma":0.000035088044,"threshold_uncertainty_score":0.39546475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045362874,0.00044184836,0.9877072,0.000074275944,0.0035792207,0.00031940598,0.0000037020625,0.0005611039,0.0027769879],"genre_scores_gemma":[0.9912704,0.00007717893,0.008092222,0.00015698044,0.00025117543,0.000027785985,0.0000033486767,0.000027846707,0.00009301709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754024,0.00014863577,0.00052776583,0.0008085455,0.00034502466,0.0006298179],"domain_scores_gemma":[0.998258,0.0009591671,0.00007031738,0.00050645013,0.00003662071,0.00016944726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006737825,0.00031566012,0.00033388098,0.00032049065,0.00034507373,0.00054925383,0.0007055895,0.0001890125,0.000017888284],"category_scores_gemma":[0.0000013911471,0.00031825426,0.00016103573,0.0015453203,0.00007535035,0.00033479612,0.000016888484,0.0009105814,0.00002127011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010743601,0.00014964784,0.000036206868,0.00007395883,0.000039659677,0.00010795775,0.0011696271,0.84350324,0.000004585472,0.012149618,0.00015468751,0.14260009],"study_design_scores_gemma":[0.00026376286,0.000084441,0.000013756287,0.0004113046,0.000015502903,0.00003924232,0.0002364767,0.9969089,0.00001561342,0.0015021208,0.00016434687,0.0003445091],"about_ca_topic_score_codex":0.000031631564,"about_ca_topic_score_gemma":0.000020646488,"teacher_disagreement_score":0.98673415,"about_ca_system_score_codex":0.00032130317,"about_ca_system_score_gemma":0.00016233292,"threshold_uncertainty_score":0.9999269},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10816102,0.0012057599,0.88299996,0.00041317826,0.0003166349,0.0001560849,0.00000489104,0.00012566046,0.006616825],"genre_scores_gemma":[0.9342734,0.00023048872,0.064930595,0.00031855953,0.00003166557,0.00000648019,0.0000030507135,0.0000049439163,0.00020081866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989894,0.00006992702,0.00032967128,0.00028287532,0.000113491034,0.0002146416],"domain_scores_gemma":[0.9992885,0.00024987033,0.000083626124,0.00025042877,0.000077051605,0.000050542738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033548014,0.00010857651,0.00023470016,0.00013228036,0.00004229433,0.000050546943,0.00026697264,0.00007842159,0.000004138921],"category_scores_gemma":[0.000020563322,0.00010333032,0.000029028446,0.00037896005,0.000064105094,0.00018873683,0.00020366,0.00013694998,9.784756e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011291419,0.00006196893,0.0078863865,0.000042412652,0.000019157713,0.00009331506,0.00069425645,0.00001625393,0.00010855216,0.018137977,0.00067040627,0.97225803],"study_design_scores_gemma":[0.00046381116,0.00010671556,0.007420021,0.000243885,0.00000766308,0.000013056465,0.00008133865,0.9787559,0.00031506477,0.011405739,0.0010171372,0.00016967946],"about_ca_topic_score_codex":0.00018754625,"about_ca_topic_score_gemma":0.000016800579,"teacher_disagreement_score":0.9787396,"about_ca_system_score_codex":0.000016688597,"about_ca_system_score_gemma":0.0000899595,"threshold_uncertainty_score":0.4213688},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012226278,0.002030459,0.9432567,0.005419923,0.0012466431,0.00021641064,0.0000051308216,0.00052544597,0.046076704],"genre_scores_gemma":[0.95334494,0.00085843104,0.042943664,0.0013290347,0.00010089262,0.00006483271,0.000017089505,0.000013687688,0.0013274046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984735,0.00020835175,0.0003719507,0.00039447146,0.0001688296,0.00038286918],"domain_scores_gemma":[0.9955415,0.0010033977,0.00010605626,0.0030934203,0.00017989089,0.00007571369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949575,0.00019467261,0.00027819682,0.00013814896,0.00056426966,0.0002263524,0.002515176,0.000100697405,0.000008914936],"category_scores_gemma":[0.000021626154,0.00020495403,0.00008732665,0.0009876464,0.00017259904,0.00080822763,0.0007742361,0.00040768133,0.00005445103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001884023,0.000539216,0.00028145354,0.00011767765,0.00015950939,0.0000518898,0.0019830596,0.0011572469,0.0016770663,0.35022083,0.06775638,0.5760368],"study_design_scores_gemma":[0.00027275094,0.000029306557,0.00016104571,0.00022875206,0.000018467115,0.000021598798,0.000037342932,0.9138997,0.00020085523,0.013605405,0.071287744,0.00023699518],"about_ca_topic_score_codex":0.000050313658,"about_ca_topic_score_gemma":0.00006727077,"teacher_disagreement_score":0.95212233,"about_ca_system_score_codex":0.000100562516,"about_ca_system_score_gemma":0.0002609754,"threshold_uncertainty_score":0.8357783},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005344092,0.0029578835,0.96085256,0.007859471,0.000349905,0.00010458783,0.0000041505123,0.0001128879,0.022414433],"genre_scores_gemma":[0.9881686,0.0014154558,0.007296291,0.0017435149,0.000066624256,0.000034452467,0.00003209729,0.000009645329,0.0012333391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986007,0.0002366778,0.00038838136,0.00033884004,0.00011129199,0.0003240998],"domain_scores_gemma":[0.9978374,0.00026828996,0.000101095335,0.0016303912,0.00006588072,0.00009689628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031849268,0.00019173442,0.0002696371,0.00021185825,0.00029456057,0.00023301248,0.0013468094,0.000103457256,0.0000039837987],"category_scores_gemma":[0.0000025388667,0.00019455227,0.00003522071,0.0007906258,0.00017786675,0.00019833927,0.0004943189,0.0003696862,0.0000035824955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019574567,0.00026373414,0.005413103,0.000021843607,0.000077519624,0.000066703695,0.0006583062,0.010232737,0.00020780179,0.91712135,0.0106708435,0.05524649],"study_design_scores_gemma":[0.0003737687,0.0000281641,0.0011230477,0.000110624445,0.000011594893,0.000014987645,0.00003807295,0.9737038,0.000020159943,0.021765852,0.0026160341,0.00019389737],"about_ca_topic_score_codex":0.000121074925,"about_ca_topic_score_gemma":0.0007514489,"teacher_disagreement_score":0.9828245,"about_ca_system_score_codex":0.00006140744,"about_ca_system_score_gemma":0.00017311572,"threshold_uncertainty_score":0.7933611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007045643,0.00017032665,0.98919487,0.0007162993,0.000048129652,0.00011613241,0.0000032480662,0.00005542875,0.002649947],"genre_scores_gemma":[0.9573274,0.00004697003,0.04229658,0.00008663438,0.000002921414,0.000013609685,0.000024618344,0.000001483266,0.00019975653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991116,0.000120322366,0.00033847158,0.00021770435,0.00013849691,0.000073403826],"domain_scores_gemma":[0.9987078,0.00035770758,0.00008291888,0.0005988653,0.00022122616,0.00003150498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052503933,0.00006614295,0.000209098,0.00025458104,0.000108399276,0.00008149099,0.00036319083,0.000067739704,0.00001909048],"category_scores_gemma":[0.000022733508,0.000057429304,0.000043626853,0.0010968929,0.00008273092,0.00018522979,0.00027132174,0.00006147173,3.7738397e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054836913,0.00020682364,0.032926798,0.00006159339,0.00039879905,0.0000010379595,0.00034990572,0.6000744,0.000017108057,0.3602221,0.0008050207,0.004881594],"study_design_scores_gemma":[0.00011332988,0.000012125174,0.011095994,0.000034743876,0.00009246644,9.492136e-7,0.000042596057,0.9880902,0.0000027284527,0.00038864353,0.00007336143,0.000052842894],"about_ca_topic_score_codex":0.0001131359,"about_ca_topic_score_gemma":0.00009402004,"teacher_disagreement_score":0.9502818,"about_ca_system_score_codex":0.000035705627,"about_ca_system_score_gemma":0.00008452621,"threshold_uncertainty_score":0.2341899},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027688503,0.00057019095,0.9660736,0.0011581854,0.0012119977,0.00012857915,0.0000013480013,0.00004184677,0.0031257775],"genre_scores_gemma":[0.8791805,0.000056376528,0.11855205,0.00085499487,0.00006853083,0.0000062339127,0.0000022859845,0.0000067489523,0.0012722907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986869,0.0000825455,0.00056965835,0.00018621127,0.00024669294,0.00022799095],"domain_scores_gemma":[0.9985368,0.00026209644,0.0003738855,0.00041050246,0.00032293948,0.00009373845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074431417,0.00013537004,0.00026554283,0.00015083236,0.0001531552,0.0002198702,0.0014974604,0.000099045144,0.000020991762],"category_scores_gemma":[0.000018968789,0.00011367331,0.0001668726,0.00012753872,0.0000733,0.0005574102,0.0002253931,0.00041162752,0.0000038065564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007396307,0.0007387514,0.0011426433,0.00021638378,0.00053979293,0.00007764511,0.012240771,0.00066600856,0.009041258,0.10033067,0.33871034,0.5355561],"study_design_scores_gemma":[0.0007951917,0.00012630424,0.000032387416,0.0007139457,0.00001934003,0.00017196203,0.00006446096,0.9764439,0.002176399,0.008690424,0.01063765,0.00012803546],"about_ca_topic_score_codex":0.000027731601,"about_ca_topic_score_gemma":0.0000012659232,"teacher_disagreement_score":0.97577786,"about_ca_system_score_codex":0.00005034217,"about_ca_system_score_gemma":0.00012800563,"threshold_uncertainty_score":0.46354634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032973748,0.00014937455,0.9942808,0.00061095756,0.00039439954,0.000569006,0.000024051868,0.00019321822,0.00048080558],"genre_scores_gemma":[0.97107506,0.000016388427,0.027991975,0.0006411863,0.000054711934,0.000034495242,0.000032786393,0.000010714121,0.00014267812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981192,0.00003480365,0.000680515,0.00071429607,0.00013947464,0.00031173436],"domain_scores_gemma":[0.9979931,0.0004989183,0.00033617512,0.0010103622,0.000089862304,0.00007155911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552865,0.00018728734,0.00027141417,0.00018226092,0.0004714625,0.00022083709,0.0010125302,0.00012408319,0.0000021194678],"category_scores_gemma":[0.0000025240347,0.00017628605,0.000048471084,0.0006612155,0.000023337065,0.00038258816,0.000042600714,0.00032042805,0.000001275359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031854288,0.00027556202,0.00074771553,0.000757425,0.00009947645,0.000017236058,0.0014235313,0.051014964,0.0001544563,0.0029325734,0.0003253356,0.94221985],"study_design_scores_gemma":[0.0003253179,0.0000186318,0.00016405573,0.00021552492,0.000024280878,0.000008369505,0.00020589767,0.994863,0.00014759794,0.001331023,0.002531591,0.00016474053],"about_ca_topic_score_codex":0.00006219185,"about_ca_topic_score_gemma":0.00012374944,"teacher_disagreement_score":0.96777767,"about_ca_system_score_codex":0.00003218695,"about_ca_system_score_gemma":0.000096051204,"threshold_uncertainty_score":0.7188736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08164576,0.00084982306,0.9141328,0.00066963414,0.0005137975,0.0004704527,0.000004089735,0.000072194656,0.0016414744],"genre_scores_gemma":[0.9875917,0.000030021534,0.010042274,0.00018253255,0.00004358081,0.00009987642,0.0000013269874,0.000009032234,0.001999665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987219,0.000041132094,0.00036002637,0.00031669613,0.00018140711,0.00037885585],"domain_scores_gemma":[0.9988999,0.00015649894,0.00010818339,0.0005720327,0.00019721568,0.00006618469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005346789,0.00015773764,0.00026882745,0.000054657554,0.00018963491,0.00011056854,0.00075307046,0.00006580467,0.000005039355],"category_scores_gemma":[0.000040355826,0.00010865446,0.00009228353,0.00032900373,0.00020391156,0.00022326657,0.00029794156,0.00012765899,0.0000017695625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008624642,0.0007168266,0.0017830201,0.0015999998,0.00052023906,0.00008137384,0.003397329,0.0017836291,0.25406253,0.3845772,0.0275328,0.32308257],"study_design_scores_gemma":[0.0010150257,0.00030537634,0.00041564662,0.0005792648,0.00008400397,0.000018626797,0.00065012753,0.6882874,0.28881213,0.004714337,0.014632603,0.0004855128],"about_ca_topic_score_codex":0.00003082288,"about_ca_topic_score_gemma":0.0000063776674,"teacher_disagreement_score":0.90594596,"about_ca_system_score_codex":0.000030989042,"about_ca_system_score_gemma":0.00020551603,"threshold_uncertainty_score":0.44308},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006746406,0.00016280328,0.054097448,0.00048204284,0.92954934,0.00016581811,0.000015227575,0.000035043897,0.01542482],"genre_scores_gemma":[0.0043031396,0.0004143894,0.0054664686,0.00021256047,0.9861725,0.000005857682,0.000026753884,0.000031471467,0.0033668582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949206,0.00037898374,0.001965012,0.0005362123,0.0017102341,0.00048893836],"domain_scores_gemma":[0.99265105,0.0030719328,0.0018788812,0.001371588,0.00083386473,0.00019266563],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020818962,0.0004850642,0.0011291599,0.00057542033,0.00009764971,0.0005575562,0.0065560136,0.0012574703,0.00009544897],"category_scores_gemma":[0.00064086565,0.00047342374,0.00042287516,0.0003586331,0.00022145337,0.00072808686,0.0011701058,0.0052597355,0.000025807623],"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.0002615343,0.00022054632,0.000018270799,0.00007953869,0.00012897259,0.0000655908,0.002628233,0.000019559415,0.000006597768,0.00035085413,0.9813795,0.014840793],"study_design_scores_gemma":[0.00095077197,0.00063979416,0.0000014434473,0.0039313384,0.000056204222,0.000025861762,0.000033209217,0.02986976,0.00024877756,0.0010048155,0.9628747,0.00036332328],"about_ca_topic_score_codex":0.0010246587,"about_ca_topic_score_gemma":0.000053342417,"teacher_disagreement_score":0.05662317,"about_ca_system_score_codex":0.00028441031,"about_ca_system_score_gemma":0.0011663814,"threshold_uncertainty_score":0.9997718},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079796795,0.00009080871,0.97155017,0.002059638,0.000520964,0.00018360482,0.000010496111,0.00018794998,0.024598394],"genre_scores_gemma":[0.64622784,0.000024360746,0.35000885,0.0020163564,0.0001415215,0.000022640521,0.00009172502,0.0000064991928,0.0014601832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989666,0.000021064518,0.00021173658,0.00043713584,0.00012611889,0.0002373448],"domain_scores_gemma":[0.9987844,0.00022307527,0.000047990052,0.00079634506,0.00008728523,0.00006088673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034447724,0.000098984216,0.00012639907,0.00003119065,0.00017801778,0.00015027521,0.0011808692,0.00006413611,0.000017096174],"category_scores_gemma":[0.000020949252,0.000087727356,0.00003674361,0.00026281766,0.000028386576,0.0004791203,0.0005338647,0.00010555519,0.000012773392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007955093,0.000047473928,0.00081352476,0.000037535596,0.000020950876,0.0000036484741,0.000068162284,0.000008149303,0.00020100284,0.46332818,0.047546115,0.4879173],"study_design_scores_gemma":[0.00029026397,0.000022779739,0.00009827615,0.00004573209,0.000011113571,0.0000034238997,0.00003667115,0.9655729,0.00014512685,0.02771103,0.005945158,0.00011750748],"about_ca_topic_score_codex":0.000021330276,"about_ca_topic_score_gemma":0.0000033493968,"teacher_disagreement_score":0.9655648,"about_ca_system_score_codex":0.000015240475,"about_ca_system_score_gemma":0.00009259352,"threshold_uncertainty_score":0.35774177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028001457,0.000547033,0.9701937,0.00027953138,0.00024671067,0.00044608067,0.0000011621132,0.000021345919,0.00026298416],"genre_scores_gemma":[0.9185786,0.000024776116,0.08122071,0.00003416401,0.000026341759,0.000043766868,8.1985763e-7,0.000002073896,0.00006872919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949163,0.000006623419,0.00018197439,0.00014987103,0.000059062037,0.00011084181],"domain_scores_gemma":[0.9994989,0.0002894023,0.000048829468,0.00009079154,0.000047570287,0.000024474832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020447759,0.000068410656,0.00009565097,0.000031231833,0.0001832933,0.00011951115,0.000094666466,0.000023866936,3.6587068e-7],"category_scores_gemma":[9.607407e-7,0.00004719534,0.000015940384,0.00004831658,0.000026814421,0.00011903205,0.000039721475,0.000020758895,3.2941017e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015561147,0.00007690034,0.002641712,0.00022883031,0.00021331696,7.1393964e-7,0.008599894,0.00024452433,0.010400611,0.27559525,0.00045524334,0.7013874],"study_design_scores_gemma":[0.0027076511,0.00013024197,0.0011207096,0.00009125206,0.00004534811,0.000001621489,0.017731572,0.931505,0.03989208,0.0039725713,0.0025978794,0.00020407766],"about_ca_topic_score_codex":0.0000028526802,"about_ca_topic_score_gemma":4.291252e-7,"teacher_disagreement_score":0.93126047,"about_ca_system_score_codex":0.000009959737,"about_ca_system_score_gemma":0.00008048781,"threshold_uncertainty_score":0.192457},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17834567,0.0006792454,0.81448174,0.00032906258,0.0025989467,0.00030572194,0.000022057735,0.00017120241,0.0030663817],"genre_scores_gemma":[0.9915509,0.00034840356,0.006869784,0.00036351595,0.00016967408,0.000036600828,0.00008362311,0.000019091816,0.0005583789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702466,0.00014307818,0.00074814685,0.0010936339,0.00040268243,0.00058780157],"domain_scores_gemma":[0.9980288,0.00021642445,0.0002738256,0.0011936638,0.00011555253,0.00017171518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005367604,0.00045677938,0.000666316,0.0006778165,0.0001537809,0.00021317971,0.0017197235,0.0005170629,0.000027460535],"category_scores_gemma":[0.000026326481,0.00046961955,0.00026534416,0.0011322331,0.00009916309,0.00014918171,0.0016411492,0.0012682959,0.00003444396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003317865,0.00028833395,0.39576188,0.00034095475,0.00016212782,0.0005391271,0.0015263197,0.0042844918,0.000012231048,0.007389033,0.0002689574,0.5893934],"study_design_scores_gemma":[0.00030553018,0.000034936373,0.049918924,0.00023212093,0.000035936395,0.000010072477,0.000032235366,0.94262797,0.000012077878,0.0061715273,0.00013982053,0.00047882675],"about_ca_topic_score_codex":0.0009919414,"about_ca_topic_score_gemma":0.00041417553,"teacher_disagreement_score":0.9383435,"about_ca_system_score_codex":0.0001893315,"about_ca_system_score_gemma":0.0005049004,"threshold_uncertainty_score":0.9997755},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018883748,0.0010987351,0.9798842,0.0058434606,0.0002626506,0.00070963346,0.0000036273168,0.00007525656,0.010234024],"genre_scores_gemma":[0.69734675,0.0001216882,0.3007518,0.00037592562,0.000010161237,0.0002727527,0.0001485553,0.0000059377367,0.00096646213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988478,0.00025525797,0.00043997946,0.00020296208,0.000112363,0.00014162833],"domain_scores_gemma":[0.9970323,0.0010673767,0.0002388529,0.0013449248,0.0002853326,0.0000312514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038124347,0.00012695485,0.00018154852,0.0002912142,0.00014296899,0.0000684546,0.001127003,0.00007747406,0.000026786221],"category_scores_gemma":[0.0000166462,0.000120828445,0.0000316157,0.0005662196,0.00011044192,0.00041225142,0.000119161254,0.00015125745,0.000004389172],"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.00023024595,0.00080086617,0.02686151,0.00016517102,0.00011183716,2.4007258e-7,0.0042773522,0.0054735597,0.0003675243,0.7423961,0.07714872,0.14216687],"study_design_scores_gemma":[0.0024387734,0.00054905016,0.32071856,0.0013218579,0.00014075382,0.000014139323,0.0014347467,0.24620292,0.0008662461,0.34722805,0.07817842,0.0009064889],"about_ca_topic_score_codex":0.000052032596,"about_ca_topic_score_gemma":0.000045540088,"teacher_disagreement_score":0.69545835,"about_ca_system_score_codex":0.00006487121,"about_ca_system_score_gemma":0.0004904023,"threshold_uncertainty_score":0.4927241},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035250678,0.000043324395,0.81436765,0.00039612807,0.00024981506,0.0002920453,0.0000044583785,0.00023503821,0.18088649],"genre_scores_gemma":[0.83497465,0.000018697738,0.1605041,0.0013172524,0.000043051823,0.000069824804,0.00003079976,0.000021084488,0.003020543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984117,0.000015534408,0.00042156066,0.00042475187,0.00034386897,0.00038254642],"domain_scores_gemma":[0.9984937,0.00016948913,0.00014042771,0.0010312252,0.00004137995,0.00012380237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027011055,0.00026732378,0.00035837654,0.00013854727,0.00021728376,0.00023529859,0.00079247326,0.00012476776,0.00005624065],"category_scores_gemma":[0.0000062534386,0.0002223335,0.00011502871,0.00047288282,0.0001067527,0.00008692435,0.0002561064,0.00023868892,0.00026781714],"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.0000087416865,0.00010279791,0.000038250062,0.00006693481,0.00003514655,0.000008200223,0.0006342543,0.00003592164,0.000072206865,0.97467476,0.013648387,0.010674387],"study_design_scores_gemma":[0.0011869352,0.000079218975,0.000088597924,0.00029459444,0.00008404078,0.000017696,0.00036766918,0.23076057,0.00026588232,0.72169316,0.04426816,0.0008934444],"about_ca_topic_score_codex":0.0000037293455,"about_ca_topic_score_gemma":0.0000050348995,"teacher_disagreement_score":0.83144957,"about_ca_system_score_codex":0.000030248802,"about_ca_system_score_gemma":0.000097917975,"threshold_uncertainty_score":0.9066497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007581284,0.000037704383,0.6566249,0.0003849512,0.00016038005,0.00035689605,0.0000040238233,0.00021808936,0.3346318],"genre_scores_gemma":[0.9458848,0.00002435191,0.04996996,0.00115076,0.00003451008,0.0000743411,0.000025287785,0.000025451747,0.0028105164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984303,0.000019541001,0.00045674833,0.00041969985,0.00027411195,0.000399596],"domain_scores_gemma":[0.9986472,0.00029570196,0.00011795848,0.00081967935,0.000029986253,0.00008946297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002950013,0.00024616029,0.00037051595,0.00024422375,0.0001092976,0.00017716584,0.0007488474,0.00013712146,0.000059673104],"category_scores_gemma":[0.000007802951,0.00021869359,0.000077823825,0.0008084607,0.00007328899,0.000088336026,0.00021368946,0.00028745056,0.00036742675],"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.000014900632,0.00015561612,0.000012819426,0.0000624921,0.0000265554,0.00002332775,0.000527429,0.000060270602,0.0002716637,0.9795017,0.005009083,0.014334134],"study_design_scores_gemma":[0.0007998431,0.000045729288,0.00004845001,0.00018542972,0.000020863743,0.000005766081,0.00012482492,0.64114875,0.00034765797,0.3544004,0.002511161,0.00036113238],"about_ca_topic_score_codex":0.000004010991,"about_ca_topic_score_gemma":0.0000022354827,"teacher_disagreement_score":0.93830353,"about_ca_system_score_codex":0.000040599607,"about_ca_system_score_gemma":0.00008413812,"threshold_uncertainty_score":0.8918066},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017995514,0.0013609149,0.011582824,0.00043832918,0.00033922607,0.00058795715,0.9838689,0.0000109890425,0.000011306739],"genre_scores_gemma":[0.09824193,0.000590928,0.0030894512,0.00009745466,0.000062970845,0.00010860677,0.89765143,0.000018781388,0.00013843169],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975574,0.00010543853,0.0005050035,0.00065071887,0.00078124733,0.00040017834],"domain_scores_gemma":[0.9981782,0.00034007063,0.00036390361,0.00037035407,0.00026887754,0.00047863394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017190102,0.00037755197,0.00047284612,0.00013006394,0.0005443085,0.00030723662,0.00019584167,0.00008537885,0.000027579194],"category_scores_gemma":[0.000053179396,0.00036401403,0.00000876997,0.00028556044,0.0001714761,0.00018437095,0.00018273169,0.00024190788,1.4187756e-8],"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.00003236484,0.000028920998,0.0012537781,0.0002790406,0.000051993902,0.00011120545,0.00020181524,0.0000034850937,0.0000038293997,0.002547601,0.98741263,0.008073356],"study_design_scores_gemma":[0.0010337378,0.0010233105,0.030388005,0.00027658185,0.00043998106,0.00022291475,0.0040137493,0.018673463,0.00003725015,0.0002881806,0.9418519,0.0017509126],"about_ca_topic_score_codex":0.95311487,"about_ca_topic_score_gemma":0.99496186,"teacher_disagreement_score":0.09644238,"about_ca_system_score_codex":0.0005494756,"about_ca_system_score_gemma":0.0017006756,"threshold_uncertainty_score":0.9998812},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000282511,0.00022370306,0.1507317,0.0024533572,0.0003696943,0.00040241636,0.8379417,0.0005497088,0.0072994377],"genre_scores_gemma":[0.0025598,0.0005833841,0.0014635875,0.0025534353,0.00018783542,5.4511215e-8,0.9917359,0.0006967742,0.00021927114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99694735,0.0005064041,0.000513729,0.0008385917,0.0007727604,0.00042115463],"domain_scores_gemma":[0.9974183,0.00007775359,0.00037330104,0.0012616917,0.00056080497,0.00030815668],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005584533,0.0003132602,0.00044018056,0.00022524784,0.0009863666,0.00078213675,0.0035496505,0.000190348,0.007534277],"category_scores_gemma":[0.0001657813,0.00032029895,0.000109652334,0.00066417275,0.00016409472,0.00029922574,0.0048007574,0.00070927234,0.009162511],"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.000042653217,0.00008834082,8.237045e-7,0.000047988706,0.000076707256,0.00007336991,0.00032348145,0.00002675747,0.000048192353,0.00036467565,0.97243905,0.026467983],"study_design_scores_gemma":[0.00037374685,0.00021617132,0.000020406733,0.00007421884,0.000034333218,0.000025381953,0.000028753584,0.0051460154,0.0000161413,0.00016037996,0.9935898,0.0003146489],"about_ca_topic_score_codex":0.000050217248,"about_ca_topic_score_gemma":0.0000013830963,"teacher_disagreement_score":0.15379412,"about_ca_system_score_codex":0.00008013317,"about_ca_system_score_gemma":0.000024911302,"threshold_uncertainty_score":0.9999249},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031261959,0.00068828167,0.8157016,0.0008287276,0.002505597,0.0022431163,0.000030697563,0.00053058984,0.17434521],"genre_scores_gemma":[0.074802496,0.0030971193,0.12218,0.0007337736,0.0015186085,0.000058921054,0.014925781,0.00025504967,0.78242826],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986889,0.000028648792,0.00023656357,0.0005319993,0.00021501668,0.0002989237],"domain_scores_gemma":[0.99872285,0.0002471419,0.00026607348,0.0005953466,0.00004499128,0.00012357041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007011748,0.00022725611,0.00033446355,0.00021540454,0.00026719095,0.00007021648,0.0012657025,0.00023747246,0.000038397313],"category_scores_gemma":[5.0993157e-7,0.000278694,0.00023604585,0.00044543523,0.000033133998,0.00043240775,0.00024284601,0.00015878692,0.000049684375],"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.00043040665,0.00034778097,0.00030627236,0.0018995854,0.0012431114,0.00039735195,0.009446607,0.0022518313,0.000006119528,0.21640159,0.37646982,0.39079952],"study_design_scores_gemma":[0.0007455001,0.00007401276,0.00021128284,0.00045696014,0.0002555187,0.0000040629684,0.0014013234,0.26089433,0.000014291858,0.0062158667,0.72910106,0.0006257895],"about_ca_topic_score_codex":0.00009033723,"about_ca_topic_score_gemma":0.00009850371,"teacher_disagreement_score":0.6935216,"about_ca_system_score_codex":0.000017921471,"about_ca_system_score_gemma":0.00012214287,"threshold_uncertainty_score":0.9999665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020745674,0.000001221972,0.9811643,0.0001469751,0.0013829214,0.00041853794,0.000104449355,0.0005793054,0.014127765],"genre_scores_gemma":[0.99089193,5.143625e-8,0.0074562198,0.0008792932,0.00018938052,0.0001668868,0.000112588554,0.000015396192,0.00028826587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970506,0.00038406308,0.00090325356,0.00031880615,0.0008364555,0.0005068248],"domain_scores_gemma":[0.9981369,0.000079112164,0.0005935734,0.00083518866,0.00013083118,0.00022441403],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001731705,0.00026459363,0.00031522216,0.0002630657,0.0014516868,0.00043165026,0.0007294674,0.00009983856,0.000054322638],"category_scores_gemma":[0.0000076187494,0.0002559838,0.00011825537,0.00077016326,0.000028865876,0.00067410024,0.0002818174,0.00047155895,0.00022323144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034667112,0.00007346447,0.12336338,0.00053987646,0.0002592758,0.0005808602,0.10512323,0.2122095,2.0342122e-7,0.3071117,0.018995648,0.23139618],"study_design_scores_gemma":[0.0006613486,0.00008907482,0.0011772849,0.000076791344,0.000017649827,0.00007838695,0.002631727,0.9939698,5.87672e-7,0.000018214474,0.0009837719,0.00029538065],"about_ca_topic_score_codex":0.000004330839,"about_ca_topic_score_gemma":4.7991307e-8,"teacher_disagreement_score":0.98881733,"about_ca_system_score_codex":0.00027294154,"about_ca_system_score_gemma":0.00022064516,"threshold_uncertainty_score":0.9999892},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10619637,0.0000896148,0.8844104,0.001108289,0.0009775376,0.0009128473,0.00007092227,0.00016892835,0.0060651056],"genre_scores_gemma":[0.9912808,0.0001070671,0.007060113,0.0006021711,0.000025282106,0.000107466956,0.00038681814,0.0000130067165,0.00041729741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980712,0.000042428266,0.00087390246,0.00027800942,0.00029244603,0.00044201294],"domain_scores_gemma":[0.9987974,0.00017915056,0.00022819589,0.00050083536,0.00017183613,0.0001225728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000530916,0.00026472216,0.00033338004,0.0004467071,0.00022294093,0.00042057753,0.0005659345,0.000199401,0.0000051844336],"category_scores_gemma":[0.000028246972,0.0002500305,0.000082317165,0.00062770274,0.000085671825,0.0023687426,0.00028224208,0.00027003617,0.000010204909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038387536,0.00083296007,0.062257126,0.0012444557,0.00019752707,0.000049820963,0.02673697,0.00033187843,0.00010786149,0.3020462,0.04317126,0.5626401],"study_design_scores_gemma":[0.0020379382,0.00011935842,0.002937628,0.00043074574,0.000020557736,0.000015665613,0.0010522682,0.9677581,0.00014668038,0.015732711,0.009343834,0.00040447954],"about_ca_topic_score_codex":0.000023112114,"about_ca_topic_score_gemma":0.000049667407,"teacher_disagreement_score":0.96742624,"about_ca_system_score_codex":0.000078502395,"about_ca_system_score_gemma":0.00008775495,"threshold_uncertainty_score":0.9999952},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15009548,0.00013047137,0.8002271,0.000089333014,0.0006759802,0.000078407866,0.0000016234245,0.000063648695,0.048637934],"genre_scores_gemma":[0.947043,0.000007723006,0.052386027,0.000073442956,0.00010363622,0.0000056333006,0.0000014102495,0.0000042355746,0.00037489654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.000021663758,0.00014578705,0.00010951519,0.00017912667,0.00022151369],"domain_scores_gemma":[0.99946576,0.00004283326,0.00006253282,0.0002949005,0.000030249772,0.00010374847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020468522,0.000063368425,0.00010117873,0.000034542278,0.00004827771,0.000016052358,0.00028113768,0.000027295879,0.00016032136],"category_scores_gemma":[0.0000024919696,0.000056017623,0.000037992424,0.00010513732,0.000026103726,0.00023997795,0.00015445561,0.00006603848,0.000029444414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000427808,0.00017820371,0.011537617,0.0000109638295,0.0000048148695,0.000031162097,0.00054852775,6.8450396e-7,0.008221132,0.055327807,0.0031724381,0.9209624],"study_design_scores_gemma":[0.0020571481,0.0005042242,0.06369244,0.00026009083,0.00016171567,0.0008922821,0.00028939318,0.84657586,0.017057773,0.022585984,0.04433808,0.0015850092],"about_ca_topic_score_codex":0.0000029425241,"about_ca_topic_score_gemma":2.673943e-7,"teacher_disagreement_score":0.9193774,"about_ca_system_score_codex":0.000008863768,"about_ca_system_score_gemma":0.00002166671,"threshold_uncertainty_score":0.22843324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015831698,0.0011185207,0.97521377,0.00040020182,0.00056159473,0.0004957163,0.000005668557,0.00036064442,0.006012214],"genre_scores_gemma":[0.9205562,0.000073860654,0.07591161,0.00074009737,0.00032875183,0.0000922149,0.000015285352,0.000031395553,0.0022505682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978513,0.000048443875,0.00041220128,0.0006098089,0.00029727933,0.0007809269],"domain_scores_gemma":[0.99857706,0.00025716095,0.00016454169,0.0006771926,0.000097555996,0.00022651836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496461,0.00024995493,0.00029103103,0.00007601673,0.000336684,0.00019767816,0.0008049041,0.00015382767,0.00007698602],"category_scores_gemma":[0.000007264156,0.00023886155,0.00015718548,0.0002981508,0.00006633057,0.00015139942,0.00026748973,0.00023932247,0.00005431271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002189856,0.00010333134,0.000022517346,0.000007990699,0.0000143452,0.000010236128,0.0003834217,0.09391997,0.00017025549,0.0015953995,0.0038721345,0.8998785],"study_design_scores_gemma":[0.0005206307,0.00015228525,0.00001772427,0.000028340179,0.000013850389,0.000033568092,0.000041018502,0.93754554,0.000024549714,0.0003556235,0.060982984,0.00028386954],"about_ca_topic_score_codex":8.203218e-7,"about_ca_topic_score_gemma":0.0000065222616,"teacher_disagreement_score":0.90472454,"about_ca_system_score_codex":0.00010049886,"about_ca_system_score_gemma":0.00009556271,"threshold_uncertainty_score":0.97404915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006038433,0.00025483596,0.6798059,0.03981042,0.006336804,0.061195657,0.0053840866,0.0010730778,0.20553537],"genre_scores_gemma":[0.4386706,0.0004310165,0.2212507,0.0042392653,0.02760717,0.09001994,0.013419802,0.0010428533,0.20331863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99158585,0.0001213594,0.00088217115,0.002044016,0.0037592074,0.0016074176],"domain_scores_gemma":[0.9925431,0.000883272,0.0003517423,0.0030052494,0.0023000492,0.00091657316],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003748948,0.00060636597,0.0005403212,0.003759653,0.0011346511,0.0052049356,0.005896839,0.00061063963,0.000585342],"category_scores_gemma":[0.0010784878,0.0005568435,0.0002468467,0.0074978974,0.0010632972,0.009182207,0.0036126098,0.00174338,0.001296585],"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.0001301547,0.00042417645,0.000029039154,0.00008804603,0.00007055177,0.000058693375,0.00008668776,0.0001778508,0.0004838823,0.21150178,0.7696629,0.01728625],"study_design_scores_gemma":[0.0011414868,0.00021489021,0.000041355746,0.000102028665,0.000009627417,0.00010687282,0.000029478198,0.12338209,0.0003527581,0.0056725354,0.8683523,0.0005945792],"about_ca_topic_score_codex":0.000035060977,"about_ca_topic_score_gemma":0.00011012914,"teacher_disagreement_score":0.4585552,"about_ca_system_score_codex":0.0001775388,"about_ca_system_score_gemma":0.002023143,"threshold_uncertainty_score":0.9996883},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005718764,0.0002866285,0.9424766,0.0070370957,0.0010071362,0.0022374026,0.00047106866,0.0002471234,0.04051822],"genre_scores_gemma":[0.9154728,0.000036924484,0.07694497,0.00035461353,0.0008170465,0.0003852773,0.00066953956,0.00008199947,0.0052368194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938138,0.00016767075,0.0007907171,0.0014672726,0.0024111092,0.0013494293],"domain_scores_gemma":[0.9951034,0.0012006918,0.00027919383,0.0007862015,0.0018238038,0.00080667564],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034403938,0.00046080674,0.00043444047,0.0039137527,0.0014527035,0.0049467785,0.0015645593,0.00030306305,0.00009127895],"category_scores_gemma":[0.0028990651,0.0004378932,0.00029270808,0.006770421,0.0003333311,0.003701327,0.0007163722,0.0005725939,0.00010872133],"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.00010309134,0.00029731012,0.000020351003,0.00006761284,0.000059342932,0.000022340895,0.00036695,0.0028987238,0.002294093,0.7885972,0.17803149,0.027241455],"study_design_scores_gemma":[0.00074240833,0.0003553288,0.000011536915,0.00019475681,0.000010420786,0.000053393265,0.00015476621,0.31070918,0.0009835681,0.0058875983,0.68042594,0.0004710952],"about_ca_topic_score_codex":0.000019294712,"about_ca_topic_score_gemma":0.000029383082,"teacher_disagreement_score":0.90975404,"about_ca_system_score_codex":0.0004315615,"about_ca_system_score_gemma":0.0012994278,"threshold_uncertainty_score":0.9998473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70758516,0.0028836906,0.17838547,0.000061712824,0.038559258,0.011511301,0.0074826027,0.005032894,0.048497908],"genre_scores_gemma":[0.98034483,0.000034148547,0.009796971,0.00025705734,0.0006617624,0.0006542354,0.0064243744,0.00017527361,0.001651326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454594,0.00046775487,0.0013301054,0.0013717398,0.001091058,0.0011934296],"domain_scores_gemma":[0.99582475,0.00042711847,0.0012868386,0.0010308381,0.0009458637,0.00048460497],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018190865,0.00089940935,0.0010520165,0.00034999638,0.001992568,0.00043287597,0.0018974219,0.0013711919,0.000047003767],"category_scores_gemma":[0.000058719288,0.0009923456,0.0006562113,0.0008995719,0.000044277676,0.0022980387,0.00022462672,0.0012482466,0.00009147211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036420923,0.0008480453,0.000041481755,0.0019121174,0.00036892603,0.0000656451,0.000031402964,0.001121297,0.0009884144,0.22352591,0.000093807874,0.77063876],"study_design_scores_gemma":[0.0076107387,0.0011245657,0.001881528,0.0030231872,0.002516027,0.00011316183,0.00088993326,0.81860244,0.0064899013,0.01554103,0.13442458,0.007782892],"about_ca_topic_score_codex":0.000110587775,"about_ca_topic_score_gemma":0.00039362386,"teacher_disagreement_score":0.81748116,"about_ca_system_score_codex":0.0008183618,"about_ca_system_score_gemma":0.0001768944,"threshold_uncertainty_score":0.99992526},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065123183,0.00050134805,0.88106763,0.0046108346,0.0021065595,0.0011885376,0.0003193166,0.0002901184,0.10340336],"genre_scores_gemma":[0.9762871,0.00016361938,0.016113164,0.00024834427,0.0006962894,0.00015160075,0.00044545298,0.00005639658,0.0058379974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99399334,0.00017512795,0.00066535076,0.0012825204,0.0026826446,0.0012010263],"domain_scores_gemma":[0.9960381,0.00050100527,0.00023063694,0.00086905103,0.0017864266,0.0005747821],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00257688,0.0004424247,0.00039667054,0.00364702,0.0007176957,0.0050987313,0.0017136575,0.00033124967,0.0001739898],"category_scores_gemma":[0.0009558613,0.00042633482,0.0002697175,0.007239958,0.0005249913,0.0056664925,0.0005960085,0.0006202339,0.00041483503],"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.000039608232,0.00028357928,0.000029085535,0.000025604368,0.000051949082,0.000031176332,0.0001383918,0.00072190363,0.00059225835,0.8223943,0.16666822,0.009023916],"study_design_scores_gemma":[0.00086888525,0.0002854573,0.000022741571,0.00007816228,0.000008572659,0.000091366936,0.00007546575,0.22328614,0.0010165098,0.019617269,0.7541176,0.0005318279],"about_ca_topic_score_codex":0.00002299214,"about_ca_topic_score_gemma":0.000036437334,"teacher_disagreement_score":0.96977484,"about_ca_system_score_codex":0.00042151546,"about_ca_system_score_gemma":0.0011709429,"threshold_uncertainty_score":0.99981886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.284618,0.0022859487,0.18004228,0.25928542,0.010314544,0.01127218,0.000594764,0.0007577014,0.25082916],"genre_scores_gemma":[0.9889781,0.000265986,0.0013265825,0.006554175,0.00043401893,0.00036958582,0.00024091893,0.00006075386,0.00176989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99316406,0.0018330163,0.0012085049,0.0013006974,0.0014954422,0.0009983038],"domain_scores_gemma":[0.99530387,0.0009860473,0.0011893457,0.0014036862,0.0003503132,0.0007667365],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021718002,0.0007932072,0.0006371601,0.0002826164,0.002551649,0.0010932855,0.0008423156,0.0005966805,0.00004578114],"category_scores_gemma":[0.00017305261,0.0006041301,0.00019828026,0.0008490652,0.00015975225,0.0007946269,0.00035934427,0.0015983905,0.000019066027],"study_design_candidate":"theoretical_or_conceptual","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.00030650536,0.00029536537,0.00017796205,0.00007406629,0.00024706856,0.0009387898,0.0047732424,0.0021889033,0.0006584198,0.9836907,0.0051724394,0.0014765614],"study_design_scores_gemma":[0.0037044263,0.00047278687,0.000959211,0.00037251253,0.00042241928,0.008116304,0.0029002842,0.35524786,0.00071280735,0.0049273847,0.62083924,0.0013247804],"about_ca_topic_score_codex":0.005137462,"about_ca_topic_score_gemma":0.20640978,"teacher_disagreement_score":0.9787633,"about_ca_system_score_codex":0.0023813958,"about_ca_system_score_gemma":0.004384277,"threshold_uncertainty_score":0.9999437},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020241603,0.0007711929,0.02067272,0.00048632777,0.0026785492,0.00059150805,0.000014820728,0.00054501736,0.97403747],"genre_scores_gemma":[0.105652936,0.00040625792,0.00034959562,0.000038316786,0.0018937569,0.000004099974,0.000023889093,0.0002657512,0.8913654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942193,0.0007364408,0.00040175795,0.0014032753,0.0013694125,0.0018698316],"domain_scores_gemma":[0.9953473,0.00044366746,0.00040186243,0.002484033,0.00016572756,0.001157399],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073216716,0.00059795217,0.0007460806,0.0017694583,0.00063519273,0.0003800975,0.0033877557,0.0008049687,0.0014324872],"category_scores_gemma":[0.000019002848,0.0006451541,0.0003411424,0.0016079411,0.00064461457,0.0005634529,0.0016132346,0.0016980802,0.002048638],"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.00007371554,0.00026652127,0.006932792,0.00016866393,0.0004187038,0.0063953386,0.00018355058,0.0000014496393,0.000059564692,0.060898047,0.918093,0.0065086],"study_design_scores_gemma":[0.0005124823,0.00017759291,0.00059600634,0.0001595671,0.00004637857,0.00020694702,0.00007228556,0.0013199727,0.0000858516,0.00055540877,0.9955253,0.0007422264],"about_ca_topic_score_codex":0.034324512,"about_ca_topic_score_gemma":0.0066920044,"teacher_disagreement_score":0.105450526,"about_ca_system_score_codex":0.000503867,"about_ca_system_score_gemma":0.0014296082,"threshold_uncertainty_score":0.9996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008107248,0.026994614,0.95855016,0.0026166267,0.0016655896,0.000997287,0.00000780402,0.00014199657,0.0009186609],"genre_scores_gemma":[0.9590978,0.036351725,0.0008812228,0.0003065141,0.000058507427,0.00010752644,0.0000066821485,0.00003590994,0.003154124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962156,0.00055868574,0.0007762918,0.0010089863,0.00031608556,0.0011243877],"domain_scores_gemma":[0.9976835,0.000519331,0.00033436,0.001112091,0.00014248298,0.00020819482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000995823,0.0005858824,0.00068802404,0.00019618237,0.001243598,0.00078678696,0.00049267313,0.00048510294,0.0000074629193],"category_scores_gemma":[0.00000300032,0.0006238338,0.00013242163,0.00087028707,0.00032166453,0.0007235941,0.000018924708,0.0013364283,0.000007113637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010501817,0.0011786509,0.00017837387,0.0013436673,0.0016252694,0.000045007204,0.008303144,0.41471842,0.0013079046,0.09224487,0.0038479988,0.4741565],"study_design_scores_gemma":[0.0011678439,0.00055020856,0.000024207993,0.0012976525,0.0002084899,0.000118000964,0.0011432815,0.99172556,0.000097253185,0.00089868816,0.002256804,0.00051202637],"about_ca_topic_score_codex":0.00048079202,"about_ca_topic_score_gemma":0.00093737856,"teacher_disagreement_score":0.95766896,"about_ca_system_score_codex":0.0005599328,"about_ca_system_score_gemma":0.0004933091,"threshold_uncertainty_score":0.9996213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02557723,0.0010940998,0.95101404,0.002293647,0.0017356123,0.0035309014,0.00020702365,0.00016124605,0.0143862115],"genre_scores_gemma":[0.98803884,0.00005516622,0.011493537,0.000048372858,0.000030168732,0.00006084384,0.0000013291237,0.000013618521,0.00025810316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969034,0.00065405946,0.0004529028,0.0005835402,0.00076543714,0.00064063485],"domain_scores_gemma":[0.9935203,0.001025643,0.00031561663,0.00086927705,0.0041377824,0.0001313648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001570741,0.00023793754,0.0005035862,0.00012798914,0.00071662903,0.00007667808,0.0011495233,0.000073501345,0.000007025532],"category_scores_gemma":[0.00029845067,0.00016347294,0.00010873396,0.0012597576,0.00059300615,0.00026265433,0.0005284755,0.0002958797,0.0000033765054],"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.0011629589,0.00047272988,0.0009320698,0.0009807779,0.0004259587,0.000037355792,0.012027444,0.0022779454,0.0022654918,0.95328623,0.0020121227,0.02411892],"study_design_scores_gemma":[0.0020086477,0.0005417337,0.000103401995,0.0021442412,0.000038517275,0.000001940215,0.025880817,0.9208246,0.037366576,0.009001597,0.0016323886,0.00045552774],"about_ca_topic_score_codex":0.000013603386,"about_ca_topic_score_gemma":0.00003896149,"teacher_disagreement_score":0.96246165,"about_ca_system_score_codex":0.000335532,"about_ca_system_score_gemma":0.00088511157,"threshold_uncertainty_score":0.6666233},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014451821,0.00037092654,0.9858846,0.000048937705,0.0061750757,0.0049266485,0.000031264026,0.00068197295,0.00043538166],"genre_scores_gemma":[0.9491453,0.000090671536,0.046694994,0.0006619286,0.00044777556,0.0006085518,0.000078967234,0.0001435725,0.0021282507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99112195,0.0006598494,0.00255658,0.0024702547,0.00082617556,0.0023651996],"domain_scores_gemma":[0.99410826,0.0019101471,0.0011593843,0.0015210597,0.000635445,0.0006656823],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002246504,0.0013644943,0.0015642192,0.0008890254,0.004082379,0.001172182,0.0015486703,0.00081574684,0.000081219005],"category_scores_gemma":[0.000019047153,0.0015591019,0.0010998445,0.0020130456,0.00044841,0.00043959054,0.000063418716,0.0023668013,0.000014673871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000199598,0.00085220835,0.00003253222,0.00031738475,0.00027883792,0.000026876107,0.00049257936,0.74394625,0.00003508622,0.00014386264,0.00006862072,0.25360617],"study_design_scores_gemma":[0.0045908694,0.0012370736,0.00000557763,0.0014411458,0.00060604454,0.000034199504,0.00055121584,0.98899984,0.00016281995,0.000015507301,0.0010159715,0.001339722],"about_ca_topic_score_codex":0.000110585795,"about_ca_topic_score_gemma":0.0000059923336,"teacher_disagreement_score":0.9477001,"about_ca_system_score_codex":0.0008386041,"about_ca_system_score_gemma":0.0014511906,"threshold_uncertainty_score":0.9999348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038811888,0.0012854473,0.94222766,0.0013745014,0.0068013137,0.00044361138,0.00012505137,0.00034139815,0.043519802],"genre_scores_gemma":[0.9603334,0.0003166674,0.003135094,0.0024254422,0.0005316716,0.00005763885,0.00002433663,0.000041511288,0.033134237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945495,0.00078072026,0.0008329742,0.0013322312,0.0013822152,0.0011223725],"domain_scores_gemma":[0.996648,0.0003411474,0.00052881456,0.0017375344,0.00014197118,0.0006025375],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016447199,0.0005004087,0.00056391663,0.00020025729,0.002368416,0.0005008252,0.0024966788,0.00014257673,0.011942288],"category_scores_gemma":[0.000008893252,0.00052372034,0.00033410167,0.0012064972,0.00015861898,0.00047050806,0.0034450823,0.0015094631,0.0005192907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009417379,0.00082723005,0.0014724942,0.000035840676,0.00017596282,0.0015402124,0.0027788188,0.019524816,0.0000034297495,0.017980412,0.26128322,0.6942834],"study_design_scores_gemma":[0.0007188788,0.00046570337,0.00013518432,0.000011731187,0.00006261144,0.00012584378,0.00068805274,0.87008077,0.0000060341213,0.0016007572,0.12547314,0.00063130225],"about_ca_topic_score_codex":0.00030513314,"about_ca_topic_score_gemma":0.000015709196,"teacher_disagreement_score":0.9564522,"about_ca_system_score_codex":0.00027353092,"about_ca_system_score_gemma":0.0008032778,"threshold_uncertainty_score":0.9997214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0368512,0.0003214796,0.9100765,0.0014053526,0.0032287089,0.00095431646,0.0000024887365,0.0005147649,0.046645164],"genre_scores_gemma":[0.86386514,0.00033740338,0.035822846,0.00016402265,0.00049650046,0.000079543875,0.000047987185,0.00004194075,0.09914462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405646,0.00073922815,0.0016773442,0.0015832552,0.000561125,0.0013825865],"domain_scores_gemma":[0.9974821,0.00060501636,0.0003972461,0.0007855697,0.0005167967,0.00021322894],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023250945,0.00065855065,0.00095378613,0.00020324111,0.0025300193,0.0015111835,0.0008044997,0.00045461766,0.0002892072],"category_scores_gemma":[0.000049406768,0.0005909517,0.0004892837,0.00060104294,0.0001329574,0.0013909307,0.0006737569,0.0006877295,0.00015538627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007604246,0.0007566921,0.003018188,0.0008610948,0.00089130586,0.000043908563,0.0068971305,0.005844137,0.0138600925,0.02016273,0.005755531,0.94114876],"study_design_scores_gemma":[0.0023045794,0.00027212405,0.00031836997,0.0008831244,0.0001916769,0.000007549193,0.0006107521,0.9651486,0.012798629,0.009298856,0.0071846643,0.000981033],"about_ca_topic_score_codex":0.00059680134,"about_ca_topic_score_gemma":0.0000062291756,"teacher_disagreement_score":0.9593045,"about_ca_system_score_codex":0.0003632835,"about_ca_system_score_gemma":0.00052700104,"threshold_uncertainty_score":0.9996542},"labels":[],"label_agreement":null}]}