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 "a practical approach to navigating the tradeoff between privacy and precise utility"):
  Abstract: Due to the recent popularity of online social networks, coupled with people's propensity to disclose personal information in an effort to achieve certain gratifications, the problem of navigating the tradeoff between privacy and utility attracted a lot of recent interest and generated a rich body of research. A critical prerequisite to solving the problem is to appropriately capture the privacy and the utility aspects in the problem formulation. Most of the existing works' focus is on the notion of privacy, while utility loss is often treated as the undesirable but necessary distortion of the true data, introduced by the privacy mechanism. By contrast, we are interested in modelling utility differently, by associating it with specific attributes of a user, just like privacy is associated with specific private attributes in the literature. Our model of utility facilitates a better and more precise privacy mechanism, and achieves better privacy-utility tradeoffs. We further incorporate into our problem formulation a practical constraint on acceptable loss in utility per unit gain in privacy, which allows users to customize the privacy mechanisms in order to account for the relative values that each user associates with their own privacy and utility. This paper discusses the intricacies of our utility model and the corresponding privacy-utility tradeoff, and introduces a heuristic greedy algorithm to solve the problem.

Includes members:
  Member "the utility cost of robust privacy guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the robustness of information theoretic privacy measures and mechanisms")
  Member "hypothesis testing under maximal leakage privacy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "an estimation theoretic view of privacy":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the robustness of information theoretic privacy measures and mechanisms")
  Member "on maximal correlation mutual information and data privacy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local information privacy and its application to privacy preserving data aggregation")
  Member "maximal correlation secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the robustness of information theoretic privacy measures and mechanisms")
  Member "from the information bottleneck to the privacy funnel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "utility privacy tradeoffs in databases an information theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning generative adversarial representations gap under fairness and censoring constraints")
  Member "privacy against statistical inference":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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.IT(Information Theory)