{"id":"W2134627619","doi":"10.1109/wcnc.2008.565","title":"A Novel Fair Incentive Protocol for Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Incentive; Computer network; Mobile ad hoc network; Computer science; Selfishness; Wireless ad hoc network; Node (physics); Optimized Link State Routing Protocol; Protocol (science); Network packet; Computer security; Routing protocol; Microeconomics; Wireless; Telecommunications; Economics; Engineering; Law","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.0001967389,0.0002153756,0.0002278007,0.00005148859,0.0002468149,0.00008427497,0.001053861,0.0001237259,0.00006139049],"category_scores_gemma":[0.000013561,0.0001825062,0.0001308727,0.0004357488,0.00008482625,0.0005219952,0.0004075142,0.0001734695,0.00003884758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007037211,"about_ca_system_score_gemma":0.0001100418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004686763,"about_ca_topic_score_gemma":0.00002123387,"domain_scores_codex":[0.9982477,0.00002860717,0.0003132478,0.0006079363,0.000245591,0.0005569234],"domain_scores_gemma":[0.9986489,0.0001665576,0.000125437,0.0007443651,0.0001649665,0.0001497774],"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.0003834609,0.002169992,0.0009177892,0.0001158898,0.0001555926,0.00007227402,0.002162354,0.06636135,0.0005439114,0.06741885,0.2498496,0.6098489],"study_design_scores_gemma":[0.002038818,0.0004900068,0.0003962422,0.00003087981,0.000002572989,0.00003940262,0.00001440144,0.6566877,0.0003560676,0.0003999194,0.3392117,0.0003323271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.00007119832,0.00003696152,0.8427282,0.00006372634,0.0001604353,0.1544124,0.000001550483,0.0003296942,0.002195837],"genre_scores_gemma":[0.00819918,0.00000968969,0.1980772,0.000636367,0.0002250081,0.7904979,0.000002986276,0.00002445549,0.002327239],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6446511,"threshold_uncertainty_score":0.7442389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02825545921435674,"score_gpt":0.2825448835405545,"score_spread":0.2542894243261977,"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."}}