{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475177,0.000217467,0.000202025,0.0001318247,0.0009762037,0.0001452782,0.0004804793,0.0001007231,0.00001540802],"category_scores_gemma":[0.000006492543,0.0002209355,0.00008825041,0.0004205341,0.00005969076,0.0002017325,0.00002230246,0.0002989737,0.000007970178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006089159,"about_ca_system_score_gemma":0.0000340839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007612568,"about_ca_topic_score_gemma":0.00002268795,"domain_scores_codex":[0.99858,0.0001599111,0.0003150171,0.0004967905,0.0001294712,0.0003188465],"domain_scores_gemma":[0.9988238,0.0002282068,0.0001122188,0.0004807985,0.000247136,0.0001078085],"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.00007105198,0.0007661265,0.00001711223,0.00004436931,0.0001175778,0.000006231737,0.01307156,0.5054235,0.007791643,0.09528309,0.0001019374,0.3773058],"study_design_scores_gemma":[0.0006003793,0.0001927732,0.00001647364,0.00006136086,0.00001517526,0.000004154198,0.0001038887,0.9753377,0.02312753,0.0001654914,0.0001343434,0.0002406831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02931028,0.0001785162,0.9684656,0.00005637801,0.0007927947,0.0008077998,0.000003887606,0.0002421539,0.0001425441],"genre_scores_gemma":[0.9632168,0.0001454446,0.03617981,0.0002215811,0.00005151983,0.00009913764,0.000003327282,0.00001961812,0.00006276794],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9339065,"threshold_uncertainty_score":0.9009487,"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."}}