{"id":"W1975358388","doi":"10.1109/infcomw.2011.5928774","title":"Lightweight privacy-preserving routing and incentive protocol for hybrid ad hoc wireless network","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Computer security; Node (physics); Overhead (engineering); Routing protocol; Vehicular ad hoc network; Protocol (science); Cryptography; Payment; Hash function; Routing (electronic design automation); Wireless; Telecommunications; World Wide Web","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.0004696072,0.0002358213,0.0002579361,0.00004059622,0.0002960423,0.0002089715,0.001510425,0.00007099316,0.00006032864],"category_scores_gemma":[0.00003432759,0.0001973198,0.00006941122,0.0002587901,0.00005301805,0.0008117753,0.001978031,0.0001686572,0.0000113807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003967341,"about_ca_system_score_gemma":0.00005450986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001659331,"about_ca_topic_score_gemma":0.00002329517,"domain_scores_codex":[0.9979966,0.00008214858,0.0003654507,0.0006761163,0.0002065459,0.0006731361],"domain_scores_gemma":[0.9984497,0.0001881375,0.0002003772,0.0008679346,0.0001271819,0.0001667016],"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.0004486625,0.000520034,0.01980305,0.0004274197,0.0002346713,0.0000988281,0.007136045,0.0001967312,0.0002279134,0.3585725,0.07370143,0.5386328],"study_design_scores_gemma":[0.00237338,0.0004883739,0.003785331,0.0004227746,0.00001589455,0.00002168158,0.00004221938,0.8925787,0.007351383,0.03516661,0.05690555,0.0008480747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002687392,0.00003769186,0.8944185,0.0001466648,0.0002193833,0.0936914,9.698629e-7,0.00035578,0.008442267],"genre_scores_gemma":[0.2033722,0.000009889903,0.4727849,0.000605592,0.0006008328,0.3214169,0.000002658824,0.00006274554,0.001144222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.892382,"threshold_uncertainty_score":0.8046466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03340060382103124,"score_gpt":0.2653636414735488,"score_spread":0.2319630376525176,"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."}}