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 "lossy compression with privacy constraints optimality of polar codes"):
  Abstract: A lossy source coding problem with privacy constraint is studied in which two correlated discrete sources $X$ and $Y$ are compressed into a reconstruction $\hat{X}$ with some prescribed distortion $D$. In addition, a privacy constraint is specified as the equivocation between the lossy reconstruction $\hat{X}$ and $Y$. This models the situation where a certain amount of source information from one user is provided as utility (given by the fidelity of its reconstruction) to another user or the public, while some other correlated part of the source information $Y$ must be kept private. In this work, we show that polar codes are able, possibly with the aid of time sharing, to achieve any point in the optimal rate-distortion-equivocation region identified by Yamamoto, thus providing a constructive scheme that obtains the optimal tradeoff between utility and privacy in this framework.

Includes members:
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability")
  Member "asymmetric error correction and flash memory rewriting using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new coding paradigm for the primitive relay channel")
  Member "achieving marton s region for broadcast channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achieving the uniform rate region of general multiple access channels by polar coding")
  Member "lossy source coding with reconstruction privacy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secret key based identification and authentication with a privacy constraint")
  Member "from the information bottleneck to the privacy funnel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "a practical approach to navigating the tradeoff between privacy and precise utility")
  Member "rate distortion theory for secrecy systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "calibrating data to sensitivity in private data analysis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "locally private hypothesis selection")

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)