{"id":"W1964687629","doi":"10.1109/tmc.2011.92","title":"FESCIM: Fair, Efficient, and Secure Cooperation Incentive Mechanism for Multihop Cellular Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Network packet; Overhead (engineering); Relay; Collusion; Computer security; Payment; Node (physics); Incentive","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.002653051,0.0006526473,0.0007353528,0.001137985,0.001198279,0.0008161025,0.002191649,0.001114993,0.002346096],"category_scores_gemma":[0.004465522,0.0001895505,0.0004814124,0.0007413844,0.0008369811,0.001570984,0.00171581,0.0007368276,0.0003624157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344205,"about_ca_system_score_gemma":0.00207292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00181463,"about_ca_topic_score_gemma":0.001702479,"domain_scores_codex":[0.9987521,0.0003691165,0.00006723758,0.0001194064,0.0004101894,0.0002819134],"domain_scores_gemma":[0.9987078,0.0003984903,0.0001959778,0.0002472332,0.0003196096,0.0001309328],"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.001449064,0.0005025647,0.002450963,0.0004705812,0.0001597933,0.001137468,0.0004944076,0.2532432,0.02471558,0.3271799,0.02212314,0.3660732],"study_design_scores_gemma":[0.0002545906,0.0004621669,0.0007838756,0.00004405645,0.0000521338,0.0005563574,0.00006208501,0.8891328,0.01011455,0.07659991,0.02184333,0.00009406377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0546041,0.0007012388,0.9349001,0.0006714129,0.0003209698,0.0005772964,0.0002054358,0.001624513,0.006394965],"genre_scores_gemma":[0.8995123,0.0002394991,0.09384679,0.0001889334,0.00008909711,0.0003715401,0.0001418766,0.00002872251,0.005581261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002653051,"threshold_uncertainty_score":0.01403081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03204691487117699,"score_gpt":0.252424370414075,"score_spread":0.220377455542898,"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."}}