{"id":"W2612436241","doi":"","title":"A hop-by-hop delay-constrained routing algorithm with explicit loop avoidance and backup routing information: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Static routing; Distributed computing; Dynamic Source Routing; Link-state routing protocol; Equal-cost multi-path routing; Routing Information Protocol; Policy-based routing; Destination-Sequenced Distance Vector routing; Geographic routing; Path vector protocol; Routing table; Multipath routing; Backup; Source routing; Routing protocol; Routing (electronic design automation)","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002945126,0.0001404131,0.0002285025,0.0002790606,0.0002647068,0.001049108,0.00208892,0.00007253978,0.000003860417],"category_scores_gemma":[0.0001628525,0.000121558,0.00004839472,0.0004455845,0.0001360555,0.00282987,0.0004201267,0.0005834169,0.00001657569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002859454,"about_ca_system_score_gemma":0.000210839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002021524,"about_ca_topic_score_gemma":0.00001657924,"domain_scores_codex":[0.9970379,0.000365434,0.0009538223,0.0001490863,0.001232897,0.0002608204],"domain_scores_gemma":[0.9956918,0.0005170151,0.000899163,0.0005748932,0.002178708,0.0001384339],"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.0002209501,0.0004329182,0.004735062,0.00003841629,0.0008135719,0.0001267716,0.02483944,0.08359061,0.001411112,0.4188426,0.002108908,0.4628397],"study_design_scores_gemma":[0.007967478,0.0006953453,0.001442399,0.003898633,0.00002811196,0.005564949,0.01129075,0.9384392,0.001775348,0.005294454,0.02279532,0.000807939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07633851,0.001533345,0.9172519,0.003366286,0.0002923471,0.0002455324,0.000006044217,0.00004426645,0.0009216986],"genre_scores_gemma":[0.9544927,0.0002510089,0.04489468,0.0001451045,0.0001440737,0.00002090683,0.000005436169,0.000009500709,0.00003662027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8781542,"threshold_uncertainty_score":0.9999879,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02802959245960825,"score_gpt":0.2980345726466356,"score_spread":0.2700049801870274,"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."}}