{"id":"W2122642220","doi":"10.1109/icc.2008.429","title":"A Utility-Based Incentive Scheme for P2P File Sharing in Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; File sharing; Scheme (mathematics); Mobile ad hoc network; Incentive; Computer network; File transfer; Wireless ad hoc network; Download; Focus (optics); Peer-to-peer; Network topology; Distributed computing; Transfer (computing); Operating system; The Internet; Microeconomics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466949,0.0005747238,0.0007538936,0.0007312776,0.001196428,0.001179882,0.002219142,0.001036577,0.001333949],"category_scores_gemma":[0.006340414,0.000299292,0.0003864475,0.00124342,0.001071919,0.002561909,0.001828823,0.0009404186,0.0002998876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001024509,"about_ca_system_score_gemma":0.001313895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271724,"about_ca_topic_score_gemma":0.001219192,"domain_scores_codex":[0.9985334,0.000671042,0.00009394818,0.000134678,0.0004296839,0.000137241],"domain_scores_gemma":[0.9977951,0.000984269,0.0002264782,0.0003295892,0.000413025,0.0002515542],"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.0007803851,0.0004588032,0.001838648,0.0003534611,0.0001016664,0.0008715935,0.0005771682,0.3359532,0.01637346,0.3704999,0.008504912,0.2636867],"study_design_scores_gemma":[0.00008499144,0.0002755267,0.0003242492,0.00002301158,0.00002994112,0.0004728504,0.00006224278,0.9274537,0.003046619,0.05792486,0.01024477,0.00005731055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03206291,0.0004958127,0.9624537,0.0005652415,0.0001285598,0.0002276289,0.00007422398,0.0003958966,0.00359598],"genre_scores_gemma":[0.8667024,0.0003807483,0.1283252,0.00009735046,0.000122465,0.0002056145,0.00006644907,0.00003250468,0.004067253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002466949,"threshold_uncertainty_score":0.01304662,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02432406709599383,"score_gpt":0.2509586049763218,"score_spread":0.226634537880328,"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."}}