{"id":"W2072592698","doi":"10.1007/s00446-012-0179-3","title":"Bounding the locality of distributed routing algorithms","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Locality; Computer science; Bounding overwatch; Dilation (metric space); Equal-cost multi-path routing; Static routing; Node (physics); Neighbourhood (mathematics); Shortest path problem; Routing (electronic design automation); Mathematics; Algorithm; Computer network; Graph; Combinatorics; Routing protocol; Theoretical computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008003347,0.0008020556,0.002270128,0.002214291,0.002230418,0.003123683,0.0037077,0.002841071,0.002088577],"category_scores_gemma":[0.06333081,0.001017513,0.0007505124,0.002566535,0.004282678,0.008459055,0.006230128,0.003264179,0.0004707647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002948495,"about_ca_system_score_gemma":0.002204258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002176788,"about_ca_topic_score_gemma":0.002083359,"domain_scores_codex":[0.9899555,0.004897049,0.0003275739,0.001396075,0.002583446,0.0008403225],"domain_scores_gemma":[0.893239,0.08628561,0.004410473,0.01019388,0.004240687,0.001630386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008203935,0.0002431828,0.006019201,0.000411209,0.0001585162,0.0001930059,0.0006716617,0.6006088,0.008165318,0.3267012,0.005622089,0.05038544],"study_design_scores_gemma":[0.00003715072,0.00006984924,0.0003727352,0.00002079886,0.00002926792,0.00006529313,0.00007382999,0.8657991,0.00175338,0.1303283,0.001434197,0.00001618682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1317197,0.003089936,0.8486084,0.003873344,0.0002158625,0.0001019019,0.0001900201,0.001218869,0.01098194],"genre_scores_gemma":[0.9084959,0.0008130398,0.08700293,0.0003158364,0.0003175649,0.0001867443,0.0001870083,0.0003019728,0.002379029],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008003347,"threshold_uncertainty_score":0.04232621,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01993346998580042,"score_gpt":0.2626555313645435,"score_spread":0.2427220613787431,"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."}}