{"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,"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","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.0004540269,0.0005360459,0.0005728105,0.0008700013,0.0009982346,0.0006988252,0.001139041,0.0005574955,0.00146755],"category_scores_gemma":[0.001922417,0.0002254161,0.00044785,0.000940808,0.0003451773,0.001445782,0.000814518,0.0005971156,0.0002865843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00098936,"about_ca_system_score_gemma":0.001331372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01095166,"about_ca_topic_score_gemma":0.01171372,"domain_scores_codex":[0.999707,0.00005243595,0.00001986535,0.0000732599,0.0001007021,0.00004664261],"domain_scores_gemma":[0.9995245,0.0001729588,0.00007161544,0.00005507824,0.000147204,0.00002868802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001317201,0.00007270439,0.002607976,0.0001064159,0.00004338555,0.0001519105,0.0002197711,0.7423877,0.005089619,0.02107029,0.005732283,0.2223862],"study_design_scores_gemma":[0.000009684685,0.00002520206,0.0001596568,0.000004947684,0.00000836596,0.00006064271,0.00002797185,0.9940024,0.0004984703,0.003946265,0.001248062,0.000008312057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02426016,0.00023925,0.9718109,0.0002010624,0.00008133865,0.0001113776,0.0001033405,0.0005162215,0.002676295],"genre_scores_gemma":[0.6547738,0.0007081585,0.3369459,0.0001631622,0.00007579544,0.0003744322,0.0006507345,0.0001013561,0.006206714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01095166,"threshold_uncertainty_score":0.02177584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03862385346765099,"score_gpt":0.285488202555875,"score_spread":0.246864349088224,"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."}}