{"id":"W2781398886","doi":"10.1504/ijssc.2017.10010065","title":"A* search based next hop selection for routing in opportunistic networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Space-Based and Situated Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Geographic routing; Routing protocol; Hop (telecommunications); Node (physics); Routing (electronic design automation); Distributed computing; Dynamic Source Routing; Benchmark (surveying); Wireless Routing Protocol; Geography; Engineering","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.001443573,0.0001715137,0.0002864529,0.0003084984,0.0003957413,0.0009911238,0.0009488401,0.0001052442,0.000005109327],"category_scores_gemma":[0.00009605278,0.0001634498,0.0001160151,0.0001138926,0.00007255686,0.0004787837,0.0001401992,0.0004000322,6.48248e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173901,"about_ca_system_score_gemma":0.0004067633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007131352,"about_ca_topic_score_gemma":0.00001622675,"domain_scores_codex":[0.9982975,0.00007645576,0.000571767,0.0002673791,0.0004484847,0.0003383983],"domain_scores_gemma":[0.9976602,0.0005263101,0.0007255131,0.0001952434,0.0007183973,0.0001744053],"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.0005675952,0.0002960021,0.05403677,0.00003850821,0.0001857195,0.0006190009,0.0003880975,0.268338,0.0007333232,0.01809527,0.0005122444,0.6561894],"study_design_scores_gemma":[0.002076227,0.0001676385,0.002309399,0.0003880723,0.0000135139,0.00008684996,0.00004006884,0.9941206,0.0001091154,0.0004037876,0.0001181306,0.0001666064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08558986,0.00004962448,0.9100977,0.002938859,0.0009810379,0.0001161215,0.000002064515,0.00002622352,0.0001985401],"genre_scores_gemma":[0.972472,0.00001748794,0.02648401,0.0003989366,0.0005873445,0.000001216425,0.000007481475,0.00001279324,0.00001873619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8868821,"threshold_uncertainty_score":0.955743,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04688670825946679,"score_gpt":0.3033245187005038,"score_spread":0.256437810441037,"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."}}