{"id":"W2136371315","doi":"10.1109/icc.2008.541","title":"Practical Coding-Aware Mechanism for Opportunistic Routing in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Linear network coding; Computer network; Wireless mesh network; Coding (social sciences); Routing protocol; Network packet; Throughput; Distributed computing; Multipath routing; Dynamic Source Routing; Wireless network; Wireless; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high","status":"direct model label, unvalidated"}],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972904,0.0004860459,0.0004666465,0.0006718186,0.0007470677,0.0006412682,0.001674218,0.0009093517,0.0007378676],"category_scores_gemma":[0.005800833,0.0002688502,0.0002955176,0.0007396173,0.001156987,0.001445339,0.00166545,0.0008249297,0.0001322686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006830589,"about_ca_system_score_gemma":0.00120671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007345326,"about_ca_topic_score_gemma":0.0009426703,"domain_scores_codex":[0.9989797,0.0004064376,0.0000511985,0.0001136529,0.0003187668,0.0001301588],"domain_scores_gemma":[0.9970779,0.001575815,0.0003036457,0.000534518,0.0004145546,0.00009346646],"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.0002499532,0.0001549985,0.0007890508,0.0002168025,0.00007437333,0.0004273635,0.0004315708,0.3720978,0.04746645,0.4434535,0.003441355,0.1311969],"study_design_scores_gemma":[0.00004569361,0.0001193177,0.0001409827,0.00002041186,0.00002683057,0.0002949151,0.00004371919,0.92849,0.005371734,0.06214133,0.003266471,0.0000387106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02037972,0.0003317685,0.9760893,0.0002666245,0.00007888126,0.00007989463,0.0000247767,0.0001785686,0.002570408],"genre_scores_gemma":[0.8943275,0.0003327215,0.103435,0.0001643712,0.00008977969,0.0002255899,0.00004131521,0.00001892642,0.001364751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001972904,"threshold_uncertainty_score":0.01043379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1277974383378275,"score_gpt":0.3334111982811271,"score_spread":0.2056137599432996,"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."}}