{"id":"W2091788990","doi":"10.1145/2069000.2069012","title":"Towards end-to-end routing for periodic mobile objects","year":2011,"lang":"en","type":"article","venue":"","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Flooding (psychology); Dijkstra's algorithm; Shortest path problem; Routing (electronic design automation); Path (computing); Base station; Computer network; Graph; Distributed computing; Domain (mathematical analysis); Real-time computing; Theoretical computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001186661,0.0004870317,0.0005218566,0.000717659,0.0007948732,0.001545254,0.001821694,0.001369523,0.001577701],"category_scores_gemma":[0.002674532,0.0004574849,0.0004233803,0.0008780989,0.00069139,0.002966197,0.001434351,0.001133525,0.0005776663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006475368,"about_ca_system_score_gemma":0.0005575701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001441992,"about_ca_topic_score_gemma":0.002226972,"domain_scores_codex":[0.9994383,0.0001471509,0.00004661464,0.00009913427,0.0002016061,0.00006711984],"domain_scores_gemma":[0.9990945,0.0003754772,0.0001014739,0.0002339706,0.0001351692,0.00005948401],"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.000343705,0.0002117309,0.001416278,0.0004830263,0.00008698391,0.0005330667,0.0007014993,0.4164962,0.02867319,0.2654455,0.01249806,0.2731107],"study_design_scores_gemma":[0.00003147678,0.00012525,0.000365455,0.00004617905,0.00001792905,0.0002620576,0.0002115089,0.8483736,0.004160431,0.1234636,0.02291732,0.00002507548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01146859,0.0005314535,0.9849461,0.0005111677,0.00006408995,0.00005830682,0.00004937697,0.0004104172,0.00196042],"genre_scores_gemma":[0.1827032,0.001327228,0.8103182,0.0001726769,0.00008158981,0.0001130965,0.0003561265,0.0001114944,0.004816396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001821694,"threshold_uncertainty_score":0.006275713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04428165183777826,"score_gpt":0.2571505747786604,"score_spread":0.2128689229408822,"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."}}