{"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,"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","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.004657858,0.000186207,0.0002564909,0.000170726,0.000470374,0.0002751248,0.0009289486,0.00008709538,0.000001276686],"category_scores_gemma":[0.00008023473,0.0001075849,0.00007956008,0.000525947,0.00004256986,0.0002411041,0.0001308257,0.0004945539,0.000001043054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067457,"about_ca_system_score_gemma":0.0001441208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005926046,"about_ca_topic_score_gemma":0.000002371805,"domain_scores_codex":[0.9979025,0.0003075791,0.0008152243,0.0001331362,0.0004640214,0.0003775251],"domain_scores_gemma":[0.9975475,0.001185439,0.0004667371,0.0003756679,0.0002980144,0.0001266048],"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.00003759717,0.00001328964,0.0004809615,0.00001092578,0.000004961292,0.000001049774,0.0009450692,0.7518777,0.000002482682,0.002095804,0.0003671974,0.244163],"study_design_scores_gemma":[0.0005189533,0.0001715686,0.006414172,0.000365215,0.00002058216,0.00004387227,0.0007243664,0.991045,0.000002664501,0.0001473546,0.0004221151,0.0001241574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04899405,0.00003650582,0.9471698,0.002345908,0.0009354692,0.00030534,0.000001135042,0.0000255742,0.0001861978],"genre_scores_gemma":[0.9885285,0.000003091983,0.008135655,0.002071039,0.001242093,0.000002908126,0.000004718257,0.00001061426,0.000001366823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9395345,"threshold_uncertainty_score":0.4387184,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009991258978234632,"score_gpt":0.2177091045419444,"score_spread":0.2077178455637098,"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."}}