{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002131829,0.0002480697,0.0002616553,0.0001234811,0.00007763124,0.0001598596,0.001130336,0.0001779987,0.00007396451],"category_scores_gemma":[0.000009480224,0.0002182995,0.00007955435,0.001223853,0.00007573657,0.0003344312,0.0003589376,0.0005545705,0.00009068546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001658974,"about_ca_system_score_gemma":0.0001292439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004963596,"about_ca_topic_score_gemma":0.001330232,"domain_scores_codex":[0.9980518,0.00008919683,0.000317825,0.0006400992,0.0002717909,0.0006293314],"domain_scores_gemma":[0.9989325,0.00008005025,0.00008444428,0.000689612,0.00006368179,0.0001497444],"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.00008094627,0.0003886706,0.0009318061,0.00001687786,0.0000539895,0.0003852755,0.001345963,0.5469643,0.0002621173,0.1618587,0.00157175,0.2861395],"study_design_scores_gemma":[0.006952608,0.0007308978,0.01911648,0.0005067779,0.0000189013,0.000108473,0.0001499051,0.8937483,0.002890256,0.0594166,0.01416885,0.002191922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05755631,0.0005843209,0.930955,0.0008901482,0.0003271014,0.0003927088,7.080135e-7,0.0004126274,0.00888108],"genre_scores_gemma":[0.9804919,0.00009455135,0.01788596,0.0009430266,0.00008889967,0.00004487846,0.000006547139,0.00001853788,0.0004256986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9229356,"threshold_uncertainty_score":0.8901996,"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."}}