{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003392334,0.000152668,0.0001931166,0.00006633917,0.0001799236,0.0001312172,0.0006526958,0.00007221436,0.0003978974],"category_scores_gemma":[0.000008380768,0.0001283969,0.00009282135,0.0002069455,0.0000347037,0.000231119,0.0002567419,0.00008560144,0.0001080635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000249699,"about_ca_system_score_gemma":0.0001638387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001158282,"about_ca_topic_score_gemma":0.00001827235,"domain_scores_codex":[0.9986656,0.00002139083,0.0002422335,0.0004182821,0.0001989219,0.0004535762],"domain_scores_gemma":[0.9990739,0.00006828667,0.00005750027,0.0004743215,0.00008579076,0.0002402502],"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.00002294106,0.0001001068,0.0003192412,0.00001637901,0.00002542563,0.00003946049,0.00802642,0.00002150714,0.00008046101,0.08082331,0.005998387,0.9045264],"study_design_scores_gemma":[0.0008699609,0.001031743,0.0008774539,0.00004988686,0.0000290912,0.00007068925,0.0008891705,0.9593303,0.002050957,0.007254724,0.02671866,0.0008273727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00417411,0.00004016852,0.8800707,0.00007964668,0.0005797218,0.0003458965,0.000003888433,0.0002182475,0.1144876],"genre_scores_gemma":[0.8497939,0.000003568319,0.1470174,0.0009956717,0.0001313741,0.00008391673,0.000002836121,0.00001057418,0.001960818],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9593088,"threshold_uncertainty_score":0.5235873,"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."}}