{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001636149,0.0006059754,0.0007469233,0.0005196556,0.0002229822,0.0002098467,0.004872168,0.0004086124,0.00001183791],"category_scores_gemma":[0.0001266375,0.0004607886,0.0001818525,0.0009984662,0.0009678116,0.0003589857,0.001969858,0.001745507,0.000008639203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000452139,"about_ca_system_score_gemma":0.0003420966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004759392,"about_ca_topic_score_gemma":0.0002064176,"domain_scores_codex":[0.9955426,0.00009638536,0.000874377,0.0016739,0.0009514464,0.0008612524],"domain_scores_gemma":[0.9949629,0.00206471,0.0004755214,0.00220636,0.0001702568,0.0001202163],"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.00001396218,0.0000600765,0.0002820506,0.00003814918,0.000008286751,0.00009044293,0.001276996,0.6658461,0.00004434039,0.01166103,0.00002541155,0.3206531],"study_design_scores_gemma":[0.0002228661,0.0001694209,0.0004926925,0.001199869,0.000002346681,0.0000288214,1.562648e-7,0.9733838,0.0005006171,0.02350461,0.00004102031,0.0004537125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006041131,0.000146597,0.9899508,0.0002338374,0.001425308,0.0009527089,0.000001678106,0.00007275192,0.001175145],"genre_scores_gemma":[0.9633191,0.00007241705,0.03573163,0.0005322565,0.0002398965,0.00003437363,0.000001398681,0.00003435346,0.00003456591],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.957278,"threshold_uncertainty_score":0.9997844,"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."}}