{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004759818,0.0001321609,0.0001925856,0.00007162418,0.0003568306,0.00008562532,0.0005959522,0.00007253445,0.00002672119],"category_scores_gemma":[0.0001511021,0.0001261336,0.00005329282,0.0003507774,0.00003806313,0.0003440542,0.000362696,0.0002225335,0.000007750396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006356698,"about_ca_system_score_gemma":0.0001365109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006287034,"about_ca_topic_score_gemma":0.00007430482,"domain_scores_codex":[0.9987749,0.0001224147,0.000309974,0.000315853,0.000144525,0.0003323231],"domain_scores_gemma":[0.9985638,0.000552303,0.00008863798,0.0005075817,0.0001797967,0.0001078595],"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.000003911176,0.00004109128,0.0001461383,0.000002363626,0.000004579316,0.00001824157,0.0001555364,0.000003092234,0.0000639278,0.9939386,0.001524825,0.004097722],"study_design_scores_gemma":[0.0003593149,0.00004163751,0.000176426,0.00002980943,0.000002342694,0.0000494281,0.0000380226,0.9978339,0.0001530056,0.001052284,0.00009031082,0.0001735002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008512666,0.000001631198,0.9935992,0.002862344,0.000192225,0.0002731784,5.857921e-7,0.0001586107,0.002060944],"genre_scores_gemma":[0.9700674,0.0004734258,0.02761694,0.001158001,0.00006051373,0.00005647149,0.000007334649,0.0000105824,0.0005492989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9978308,"threshold_uncertainty_score":0.5143577,"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."}}