{"id":"W2170543182","doi":"10.1007/978-3-540-79549-0_80","title":"On the Probability of Finding Non-interfering Paths in Wireless Multihop Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Multipath routing; Computer network; Multipath propagation; Wireless network; Distributed computing; Wireless; Topology (electrical circuits); Routing (electronic design automation); Routing protocol; Dynamic Source Routing; Algorithm; Telecommunications; Mathematics","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.01513807,0.002673981,0.005200554,0.004675463,0.002204385,0.005376182,0.008588838,0.0053326,0.006580211],"category_scores_gemma":[0.09783696,0.002937864,0.001763261,0.007099891,0.009328494,0.01132518,0.005068474,0.006301996,0.0009258986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003543606,"about_ca_system_score_gemma":0.001672415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001733757,"about_ca_topic_score_gemma":0.001295388,"domain_scores_codex":[0.9906317,0.003354395,0.000505946,0.001240922,0.003331227,0.0009357833],"domain_scores_gemma":[0.75717,0.2281499,0.004447124,0.003953441,0.004371713,0.001907773],"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.001231389,0.0002115699,0.006069332,0.001548803,0.0003025957,0.0005821676,0.0008736909,0.5839585,0.003017285,0.3417512,0.008023825,0.05242974],"study_design_scores_gemma":[0.0001034208,0.0002361082,0.002108986,0.0002648336,0.000191819,0.001060682,0.0002615291,0.7440232,0.001373872,0.2479231,0.002314646,0.0001378656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07778084,0.01742175,0.8750336,0.005722801,0.001186747,0.0002492016,0.0007402339,0.0007197495,0.02114507],"genre_scores_gemma":[0.8707906,0.02226671,0.08434181,0.0009906379,0.004420955,0.0007925148,0.0009277595,0.0006635041,0.0148056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01513807,"threshold_uncertainty_score":0.08005875,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01920068363068638,"score_gpt":0.2300343396504656,"score_spread":0.2108336560197792,"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."}}