{"id":"W2527374865","doi":"","title":"PReFilter: A Privacy-preserving Relay Filtering Scheme for Delay Tolerant Networks","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Relay; Computer science; Scheme (mathematics); Computer network; Information privacy; Computer security; Mathematics","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.002851847,0.0008986468,0.001874965,0.0008986528,0.001187681,0.001856534,0.002474177,0.002032972,0.004151382],"category_scores_gemma":[0.004610622,0.0004384721,0.0007776705,0.001259504,0.001108003,0.003956704,0.003209859,0.00221019,0.001065231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001205072,"about_ca_system_score_gemma":0.001576662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001179507,"about_ca_topic_score_gemma":0.001414172,"domain_scores_codex":[0.9979132,0.0004456816,0.0001290376,0.0005053623,0.0006746177,0.0003320253],"domain_scores_gemma":[0.9962883,0.001113852,0.0002512781,0.001839739,0.0003601483,0.0001467544],"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.003705801,0.0004779021,0.0008858284,0.0005584653,0.0002038465,0.0005653835,0.0006741628,0.1143304,0.08850957,0.1936968,0.02306358,0.5733281],"study_design_scores_gemma":[0.0003406365,0.0009816251,0.0005786106,0.00006918134,0.0001135161,0.000902593,0.0001298528,0.7530556,0.06122401,0.1608444,0.02157069,0.0001893842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01935902,0.0004483052,0.9750397,0.0004136235,0.0001305469,0.0001751515,0.0005116536,0.002008638,0.001913386],"genre_scores_gemma":[0.6335372,0.0006805218,0.349108,0.0006999064,0.0002736748,0.0002601086,0.00115844,0.0002037827,0.01407836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004151382,"threshold_uncertainty_score":0.01508218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02600145949633002,"score_gpt":0.2383620188322639,"score_spread":0.2123605593359338,"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."}}