{"id":"W2101126543","doi":"10.1109/tc.2010.107","title":"On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Computer network; Equal-cost multi-path routing; Greedy algorithm; Face (sociological concept); Routing protocol; Distributed computing; Algorithm","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003205731,0.0002491135,0.0003065588,0.0002549864,0.0002390465,0.0001306797,0.0002976733,0.0001145115,0.000004315596],"category_scores_gemma":[0.000001844968,0.000262802,0.00007621527,0.0003310306,0.0001151149,0.0003576027,0.00001880591,0.0006058642,0.000001524939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000442974,"about_ca_system_score_gemma":0.00001678672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001122303,"about_ca_topic_score_gemma":0.0003452075,"domain_scores_codex":[0.9983884,0.00008748085,0.0003963604,0.0005348081,0.0002141611,0.0003787879],"domain_scores_gemma":[0.9987437,0.0005591716,0.0001206823,0.0004173775,0.00003405402,0.0001249837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001519569,0.0003085872,0.0004882147,0.00003830448,0.0001187195,0.0003864404,0.001680844,0.5652854,0.00166365,0.0003852167,0.00009464798,0.4293981],"study_design_scores_gemma":[0.001130278,0.0002364862,0.0006884463,0.0001826135,0.00001782459,0.000326522,0.0001006682,0.996276,0.0006861249,0.00005517291,0.00004168006,0.0002582278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4840427,0.00004677532,0.5149177,0.00006762113,0.0006875752,0.0001782226,0.000003886673,0.00004695398,0.000008580116],"genre_scores_gemma":[0.9679305,0.0001091986,0.03163378,0.0002536539,0.00003391897,0.0000137636,0.000001479572,0.00001771046,0.000005975026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4838878,"threshold_uncertainty_score":0.9999824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01313667641229026,"score_gpt":0.2241575904699583,"score_spread":0.211020914057668,"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."}}