{"id":"W2477768964","doi":"10.1142/9789812770103_0014","title":"Hash-Binary-Tree Based Group Key Distribution with Time-Limited Node Revocation","year":2007,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Revocation; Computer science; Hash function; Key (lock); Node (physics); Binary tree; Tree (set theory); Computer network; Computer security; Mathematics; Algorithm; Operating system; Combinatorics; Engineering","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":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001537437,0.0007898691,0.0006478822,0.0009816349,0.0008669162,0.001188167,0.002114642,0.0004570273,0.0001620119],"category_scores_gemma":[0.00001550347,0.0007700124,0.0002733992,0.00050335,0.0009456354,0.0003059385,0.0003789364,0.001024956,0.000836876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005612839,"about_ca_system_score_gemma":0.0002762721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001158786,"about_ca_topic_score_gemma":0.001587214,"domain_scores_codex":[0.9943066,0.0000977974,0.0008226014,0.002020137,0.001811128,0.0009416828],"domain_scores_gemma":[0.9949955,0.0003161873,0.0007370284,0.002960009,0.0006199996,0.0003712779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002293101,0.0002484714,0.00005020489,0.0002259555,0.0001965526,0.0005049593,0.0008301039,0.001288213,0.001467257,0.7925571,0.1371123,0.06528959],"study_design_scores_gemma":[0.0009028453,0.0001559953,0.00008611548,0.001306269,0.0001179528,0.00002830266,0.000004379712,0.1239855,0.0009537836,0.004612232,0.8663294,0.001517247],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002270129,0.0002835002,0.2384519,0.0004816451,0.002751908,0.001299823,0.000132549,0.001146026,0.7552256],"genre_scores_gemma":[0.01580766,0.000001423919,0.01702151,0.000485742,0.0004247021,0.00003882094,0.001671565,0.000128692,0.9644199],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7879449,"threshold_uncertainty_score":0.9999411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02216156873861589,"score_gpt":0.2230902329969173,"score_spread":0.2009286642583014,"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."}}