{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003910446,0.0006514281,0.0007190518,0.0006417594,0.0005768913,0.0008420661,0.001339798,0.0009169988,0.002660427],"category_scores_gemma":[0.0009580484,0.0002186778,0.0003575594,0.001297784,0.0004202878,0.001074715,0.0005793367,0.0005761937,0.0006593192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006035879,"about_ca_system_score_gemma":0.001199634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002936576,"about_ca_topic_score_gemma":0.002263539,"domain_scores_codex":[0.9996808,0.00006999691,0.00002450659,0.00008860767,0.0001026925,0.0000333875],"domain_scores_gemma":[0.9996517,0.0001302224,0.00004274998,0.0000638167,0.0000875319,0.00002390749],"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.0003259844,0.0002323926,0.0008511187,0.0003888129,0.0001089159,0.0001337771,0.0001365345,0.3797729,0.02588275,0.02173116,0.007638465,0.5627972],"study_design_scores_gemma":[0.00003910262,0.00009241666,0.0001712838,0.00001969115,0.00001914261,0.0001424377,0.00001919833,0.9821861,0.003825138,0.005212119,0.00825528,0.00001809778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01864351,0.001679279,0.9746728,0.0002911336,0.0001680339,0.0001520013,0.00006858633,0.000798148,0.003526518],"genre_scores_gemma":[0.2886775,0.001627398,0.7005996,0.0002217808,0.0001293203,0.0002344481,0.000384776,0.0001389988,0.007986197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002936576,"threshold_uncertainty_score":0.008899987,"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."}}