{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857215,0.0004684169,0.0006663206,0.0005390749,0.0008645086,0.0008746848,0.001840481,0.0008881878,0.0008263788],"category_scores_gemma":[0.002056531,0.0002780591,0.0004844518,0.0006375776,0.0006919255,0.002349424,0.00202247,0.001016489,0.000230111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005441915,"about_ca_system_score_gemma":0.0007340123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000308371,"about_ca_topic_score_gemma":0.0003471621,"domain_scores_codex":[0.9985252,0.000533206,0.000125872,0.0001540599,0.0005432299,0.0001184731],"domain_scores_gemma":[0.9986172,0.0004504428,0.0002384578,0.0003353954,0.0002317971,0.0001268101],"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.0008590736,0.0004721968,0.002696407,0.0008970604,0.00031185,0.001830753,0.0008962463,0.1766531,0.09761194,0.353677,0.01073891,0.3533556],"study_design_scores_gemma":[0.0001930333,0.0006134596,0.0006005947,0.00003274829,0.0001275219,0.001409958,0.0001138861,0.8653491,0.01648375,0.08803497,0.02691497,0.00012602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01971319,0.0004501423,0.9770467,0.0003055631,0.0001271796,0.0001542062,0.00004010777,0.0005230514,0.001639904],"genre_scores_gemma":[0.7551328,0.000411157,0.239215,0.0002349481,0.0001341817,0.0004942729,0.0001769844,0.00004332294,0.004157357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001857215,"threshold_uncertainty_score":0.009822071,"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."}}