{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007587636,0.0002074157,0.0002697743,0.0000501478,0.001485165,0.0004082885,0.001376227,0.00008429096,0.000004589123],"category_scores_gemma":[0.00001770632,0.0001754637,0.0001097788,0.0003705166,0.0001750866,0.0000973108,0.001101016,0.0003753768,0.000002057908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003322346,"about_ca_system_score_gemma":0.0002038235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002208982,"about_ca_topic_score_gemma":0.000005811763,"domain_scores_codex":[0.9983906,0.0001879751,0.0004299179,0.0004296709,0.0001684047,0.0003934876],"domain_scores_gemma":[0.9942703,0.002912001,0.0002145012,0.002223345,0.0002434456,0.0001363722],"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.000002246196,0.0001102318,0.00009114536,0.000007873678,0.00002202421,0.000008224999,0.0001863574,0.01113154,0.000004991088,0.01697282,0.0002249063,0.9712377],"study_design_scores_gemma":[0.0004303734,0.00005302875,0.00006437906,0.0001367255,0.00002951529,0.00002710547,0.0001760525,0.9894915,0.000004151977,0.0001714353,0.009203992,0.000211741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003630935,0.00112214,0.995551,0.001234683,0.0003030037,0.0003999151,0.00001108483,0.0001436914,0.0008713361],"genre_scores_gemma":[0.8228009,0.000413619,0.1750692,0.001353851,0.000116555,0.00009557651,0.00006813155,0.00001923444,0.00006291863],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9783599,"threshold_uncertainty_score":0.9998147,"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."}}