{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001137948,0.000167732,0.0003250433,0.00009940438,0.000136784,0.0004450658,0.002836506,0.0001037734,0.00001435061],"category_scores_gemma":[0.00008985509,0.0001475493,0.0001856714,0.0001503898,0.00004583117,0.0003972662,0.0002195087,0.0003406273,0.000004065895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008648418,"about_ca_system_score_gemma":0.0002940992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007736793,"about_ca_topic_score_gemma":7.795259e-7,"domain_scores_codex":[0.9976066,0.0002695019,0.001114405,0.0001829118,0.0006371501,0.0001894388],"domain_scores_gemma":[0.9958903,0.0005554186,0.001514002,0.0004738671,0.001331189,0.000235264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002078014,0.001066221,0.004579544,0.0001708991,0.001091737,0.0004099875,0.004590807,0.3492674,0.0002552765,0.4077438,0.08053259,0.1482137],"study_design_scores_gemma":[0.001822518,0.0001295965,0.00003009813,0.0002969883,0.00001242527,0.00005346466,0.00009835427,0.9272273,0.000009165706,0.0001858499,0.06999667,0.0001375771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00003054619,0.00006664229,0.9835097,0.00390117,0.0005585286,0.01034722,0.00001222918,0.00005532014,0.001518642],"genre_scores_gemma":[0.9748431,0.00001174419,0.01777522,0.001046392,0.0006353718,0.005576255,0.00002175908,0.00001908417,0.00007106551],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9748126,"threshold_uncertainty_score":0.6016885,"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."}}