{"id":"W2152964432","doi":"10.1109/rttas.2004.1317247","title":"FAIR: fee arbitrated incentive architecture in wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Wireless ad hoc network; Incentive; Computer science; Relay; Throughput; Wireless network; Wireless; Vehicular ad hoc network; Protocol (science); Telecommunications; Microeconomics; Economics","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.003528502,0.0005389176,0.0006167305,0.0007350435,0.001654572,0.00174869,0.002010476,0.001314228,0.002450023],"category_scores_gemma":[0.00712964,0.0003976719,0.0004147178,0.0009337185,0.001734014,0.00374312,0.001233712,0.001350016,0.0002796148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001741179,"about_ca_system_score_gemma":0.002627193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005569944,"about_ca_topic_score_gemma":0.004011857,"domain_scores_codex":[0.998859,0.0004238736,0.00006910294,0.0001148121,0.0003876791,0.0001455592],"domain_scores_gemma":[0.9983851,0.0007456682,0.0001365758,0.0002214148,0.000359667,0.0001515957],"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.0004064305,0.0002169218,0.001368786,0.0001732146,0.00006308143,0.0002790672,0.0004361099,0.435906,0.007087852,0.4429927,0.00571997,0.10535],"study_design_scores_gemma":[0.0001397012,0.0002363108,0.0003200372,0.00002998164,0.00004013609,0.0001329975,0.00004470784,0.8122993,0.003866895,0.1663841,0.01644627,0.00005960093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03248372,0.001037535,0.9577285,0.0006792276,0.0002727541,0.0003581608,0.0001075347,0.001154929,0.006177577],"genre_scores_gemma":[0.7139392,0.0008198982,0.2783881,0.0002124919,0.0001266515,0.000383149,0.0001091169,0.00008062417,0.005940625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005569944,"threshold_uncertainty_score":0.01866072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006232819693949206,"score_gpt":0.2103394302265829,"score_spread":0.2041066105326337,"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."}}