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 "binary ceo problem under log loss with bsc test channel model"):
  Abstract: In this paper, we propose an efficient coding scheme for the two-link binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. The exact rate-distortion bound for a two-link binary CEO problem under the logarithmic loss has been obtained by Courtade and Weissman. We propose an encoding scheme based on compound LDGM-LDPC codes to achieve the theoretical bounds. In the proposed encoding, a binary quantizer using LDGM codes and a syndrome-coding employing LDPC codes are applied. An iterative joint decoding is also designed as a fusion center. The proposed CEO decoder is based on the sum-product algorithm and a soft estimator.

Includes members:
  Member "analysis and code design for the binary ceo problem under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "successive wyner ziv coding for the binary ceo problem under logarithmic loss")
  Member "universality of logarithmic loss in lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian ceo problem under logarithmic loss")
  Member "multiterminal source coding under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "distributed source coding of correlated gaussian remote sources":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "successive wyner ziv coding for the binary ceo problem under log loss")
  Member "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of distributed tracking")

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)