{"id":"W2799292918","doi":"10.1109/tmc.2018.2831679","title":"Multipath Cooperative Routing with Efficient Acknowledgement for LEO Satellite Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":165,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer network; Computer science; Multipath routing; Dynamic Source Routing; Acknowledgement; Routing protocol; Distributed computing; Network packet; Linear network coding; Static routing; Retransmission; Multipath propagation; Channel (broadcasting)","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005650203,0.0002799231,0.0002587357,0.0001341844,0.001475856,0.0002528538,0.0007213908,0.00006745871,0.00002198663],"category_scores_gemma":[0.000009103613,0.000242541,0.0001025873,0.0007611904,0.0001390625,0.0001523396,0.00002283585,0.0003051184,0.00004596293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000144145,"about_ca_system_score_gemma":0.00007857921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002289909,"about_ca_topic_score_gemma":0.00006148602,"domain_scores_codex":[0.9981275,0.0001815983,0.0003859159,0.0006105826,0.0002008231,0.0004936116],"domain_scores_gemma":[0.9979382,0.000493601,0.0001395759,0.000729951,0.000575358,0.0001233343],"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.000036839,0.0002097398,0.00001375508,0.000006643451,0.00004737965,9.871502e-7,0.002230219,0.6373525,0.0002649946,0.001472657,0.00004483663,0.3583194],"study_design_scores_gemma":[0.000856852,0.0007223054,0.00006113148,0.0001706757,0.00001549185,0.000005835068,0.0001217108,0.987036,0.007971344,0.000005204639,0.002721931,0.0003114923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01308436,0.0002059946,0.9837743,0.000117592,0.0009017491,0.001024236,0.000002486634,0.0003274315,0.0005618293],"genre_scores_gemma":[0.957207,0.00007884223,0.04188072,0.0002724561,0.0002170731,0.0001453991,0.000002523308,0.00002701169,0.0001689511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9441227,"threshold_uncertainty_score":0.9998241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02644118996341843,"score_gpt":0.2862196929497967,"score_spread":0.2597785029863782,"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."}}