{"id":"W2077049284","doi":"10.1109/bsc.2010.5472958","title":"Achieving fair cooperation for multi-hop ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Selfishness; Computer science; Wireless ad hoc network; Computer network; Hop (telecommunications); Vehicular ad hoc network; Mobile ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Computer security; Routing protocol; Routing (electronic design automation); Telecommunications; Wireless","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":[],"consensus_categories":[],"category_scores_codex":[0.0003641881,0.0001427437,0.0001465733,0.00003843561,0.0002080626,0.0002807961,0.0007335489,0.000140577,0.00004212678],"category_scores_gemma":[0.00005702277,0.0001240429,0.00006730437,0.0002239584,0.00002950246,0.000585107,0.0002046556,0.0002773405,0.00003694136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001536857,"about_ca_system_score_gemma":0.00003752865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004418204,"about_ca_topic_score_gemma":0.0004971965,"domain_scores_codex":[0.9988626,0.00002839272,0.0002184139,0.000419312,0.0001152357,0.0003560848],"domain_scores_gemma":[0.9989028,0.0001484336,0.00006348682,0.0006395461,0.000134953,0.0001108032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001455502,0.0001283278,0.000505971,0.00001180294,0.00002172494,0.000003620396,0.0002513892,0.01893424,0.005210038,0.1285869,0.01599935,0.8303321],"study_design_scores_gemma":[0.0004072619,0.00006031388,0.0006889799,0.000006329848,0.000003177959,0.000006059336,0.000004168009,0.9637812,0.0002576564,0.00005503717,0.03455702,0.0001727744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006677351,0.0001805321,0.9895252,0.0006271617,0.001521542,0.000504471,6.20564e-7,0.0003450482,0.0006180457],"genre_scores_gemma":[0.5270455,0.00003277308,0.4702172,0.0007782201,0.0003493839,0.0001186894,0.000007939624,0.00001672709,0.001433555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.944847,"threshold_uncertainty_score":0.5058321,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02010089732099857,"score_gpt":0.2653099521824745,"score_spread":0.2452090548614759,"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."}}