{"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,"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)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276706,0.0003934145,0.0004350836,0.0006263942,0.000601199,0.0006799803,0.0007643951,0.0004984739,0.0007537632],"category_scores_gemma":[0.002720936,0.0001730323,0.0003400022,0.0005220615,0.0004303587,0.001085477,0.001410107,0.0006886465,0.0001985076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007734303,"about_ca_system_score_gemma":0.001229413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00177295,"about_ca_topic_score_gemma":0.001599988,"domain_scores_codex":[0.9992637,0.0001907978,0.00007235828,0.0000758155,0.0002877649,0.0001095139],"domain_scores_gemma":[0.998727,0.0004310032,0.0002824125,0.0002090183,0.0002808242,0.00006973494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001153111,0.0002234577,0.003549658,0.0007511019,0.0002953616,0.0016287,0.001050343,0.3541025,0.0907475,0.150736,0.01498374,0.3807785],"study_design_scores_gemma":[0.0001036492,0.0003954353,0.0007144419,0.0000454641,0.00008454771,0.0006382486,0.0001412462,0.9169161,0.02058702,0.03104616,0.0292485,0.00007919823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0751924,0.001185457,0.9138253,0.0007160259,0.000287777,0.0003705292,0.0002271347,0.00177567,0.006419778],"genre_scores_gemma":[0.9278319,0.0003591253,0.06860209,0.0001081458,0.00004762746,0.0002465535,0.0002089322,0.00003119689,0.002564432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00177295,"threshold_uncertainty_score":0.005611658,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08319818159866635,"score_gpt":0.3402505668820672,"score_spread":0.2570523852834009,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}