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 "successive wyner ziv coding for the binary ceo problem under log loss"):
  Abstract: An $l$-link binary CEO problem is considered in this paper. We present a practical encoding and decoding scheme for this problem employing the graph-based codes. A successive coding scheme is proposed for converting an $l$-link binary CEO problem to the $(2l-1)$ single binary Wyner-Ziv (WZ) problems. By using the compound LDGM-LDPC codes, the theoretical bound of each binary WZ is asymptotically achievable. Our proposed decoder successively decodes the received data by employing the well-known Sum-Product (SP) algorithm and leverages them to reconstruct the source. The sum-rate distortion performance of our proposed coding scheme is compared with the theoretical bounds under the logarithmic loss (log-loss) criterion.

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 "multiterminal source coding under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "binary ceo problem under log loss with bsc test channel model")
  Member "successive wyner ziv coding scheme and its application to the quadratic gaussian ceo problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of distributed tracking")
  Member "binary quantization using belief propagation with decimation over factor graphs of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "successive wyner ziv coding for the binary ceo problem under logarithmic loss")

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)