{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113031,0.0002743122,0.0003715221,0.00004378545,0.0005724178,0.0002211018,0.001760557,0.000119347,0.000009141038],"category_scores_gemma":[0.0002336851,0.0002171406,0.000174209,0.001347681,0.0001569518,0.00045858,0.0008532379,0.0004475758,0.00001758864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001698064,"about_ca_system_score_gemma":0.00006696633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006780164,"about_ca_topic_score_gemma":0.000001440185,"domain_scores_codex":[0.9969716,0.0003104439,0.0007194949,0.0004147928,0.0005202577,0.001063379],"domain_scores_gemma":[0.9972594,0.0007326314,0.0005030557,0.001104283,0.0001914525,0.0002091484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002506805,0.0008553764,0.196035,0.0001484234,0.000400205,0.00002984193,0.004428699,0.05621134,0.001231401,0.4577634,0.004956369,0.2779149],"study_design_scores_gemma":[0.0003381468,0.00003126511,0.03338959,0.00009121,0.0000259615,0.00004057147,0.0002469205,0.9599534,0.00220018,0.0006849957,0.002658164,0.0003395645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03473182,0.0003571889,0.9628279,0.0002992589,0.0009409295,0.0002511865,0.00006781268,0.000309705,0.0002142141],"genre_scores_gemma":[0.9873247,0.000002932678,0.01196134,0.0001052867,0.0004440508,0.000007116283,0.0001361156,0.00001578038,0.000002741655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9525928,"threshold_uncertainty_score":0.8854737,"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."}}