human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "calibrate frequency estimation and heavy hitter identification with local differential privacy via incorporating prior knowledge"):
  Abstract: Estimating frequencies of certain items among a population is a basic step in data analytics, which enables more advanced data analytics (e.g., heavy hitter identification, frequent pattern mining), client software optimization, and detecting unwanted or malicious hijacking of user settings in browsers. Frequency estimation and heavy hitter identification with local differential privacy (LDP) protect user privacy as well as the data collector. Existing LDP algorithms cannot leverage 1) prior knowledge about the noise in the estimated item frequencies and 2) prior knowledge about the true item frequencies. As a result, they achieve suboptimal performance in practice. #R##N#In this work, we aim to design LDP algorithms that can leverage such prior knowledge. Specifically, we design ${Calibrate}$ to incorporate the prior knowledge via statistical inference. ${Calibrate}$ can be appended to an existing LDP algorithm to reduce its estimation errors. We model the prior knowledge about the noise and the true item frequencies as two probability distributions, respectively. Given the two probability distributions and an estimated frequency of an item produced by an existing LDP algorithm, our ${Calibrate}$ computes the conditional probability distribution of the item's frequency and uses the mean of the conditional probability distribution as the calibrated frequency for the item. It is challenging to estimate the two probability distributions due to data sparsity. We address the challenge via integrating techniques from statistics and machine learning. Our empirical results on two real-world datasets show that ${Calibrate}$ significantly outperforms state-of-the-art LDP algorithms for frequency estimation and heavy hitter identification.

Includes members:
  Member "blender enabling local search with a hybrid differential privacy model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the power of synergy in differential privacy combining a small curator with local randomizers")
  Member "hadamard response estimating distributions privately efficiently and with little communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a workload adaptive mechanism for linear queries under local differential privacy")
  Member "practical locally private heavy hitters":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a workload adaptive mechanism for linear queries under local differential privacy")
  Member "locally differentially private heavy hitter identification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "crypt epsilon crypto assisted differential privacy on untrusted servers")
  Member "optimal schemes for discrete distribution estimation under locally differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a workload adaptive mechanism for linear queries under local differential privacy")
  Member "heavy hitters and the structure of local privacy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pure differentially private summation from anonymous messages")
  Member "collecting telemetry data privately":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "locally private hypothesis selection")
  Member "building a rappor with the unknown privacy preserving learning of associations and data dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wireless federated learning with local differential privacy")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CR(Cryptography and Security)