{"id":"W2074266386","doi":"10.1109/ccece.2008.4564610","title":"ε -Optimal approximation scheme for on-demand multipath routing in Ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Wireless ad hoc network; Distance-vector routing protocol; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Limiting; Network packet; Distributed computing; Telecommunications; Wireless; Engineering","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003035136,0.0004673086,0.000481396,0.0004999345,0.0002637024,0.0004240483,0.0007661728,0.0002695679,0.000006692016],"category_scores_gemma":[0.0000814493,0.0004878103,0.00007649767,0.0007493669,0.00005485262,0.0004854996,0.0001102718,0.0007192303,0.000008222982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002662421,"about_ca_system_score_gemma":0.0003557088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001829423,"about_ca_topic_score_gemma":0.0004009916,"domain_scores_codex":[0.9970754,0.00001573819,0.000461994,0.0009713434,0.0002841653,0.001191291],"domain_scores_gemma":[0.9985487,0.0001664729,0.0001226891,0.0002464198,0.00027332,0.0006423541],"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.0001186752,0.0002090686,0.003066033,0.0001484199,0.00007959395,0.00006814198,0.003200883,0.03697331,0.0005429493,0.6694175,0.001289127,0.2848863],"study_design_scores_gemma":[0.0006845272,0.0003925581,0.003163978,0.0002107032,0.0000043983,0.00005075267,0.00000663277,0.9932354,0.00005455508,0.0002965526,0.001339355,0.0005605487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114659,0.0001723725,0.8865324,0.0004263142,0.0002037444,0.0006894288,0.000003207421,0.000212121,0.0002944662],"genre_scores_gemma":[0.9443634,0.000210815,0.05454935,0.0003683012,0.00020789,0.0002043178,0.00001102827,0.00003169237,0.00005318594],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9562621,"threshold_uncertainty_score":0.9997573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02266715873121872,"score_gpt":0.2094686368479869,"score_spread":0.1868014781167682,"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."}}