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 logarithmic loss"):
  Abstract: The $L$-link binary Chief Executive Officer (CEO) problem under logarithmic loss is investigated in this paper. A quantization splitting technique is applied to convert the problem under consideration to a $(2L-1)$-step successive Wyner-Ziv (WZ) problem, for which a practical coding scheme is proposed. In the proposed scheme, low-density generator-matrix (LDGM) codes are used for binary quantization while low-density parity-check (LDPC) codes are used for syndrome generation; the decoder performs successive decoding based on the received syndromes and produces a soft reconstruction of the remote source. The simulation results indicate that the rate-distortion performance of the proposed scheme can approach the theoretical inner bound based on binary-symmetric test-channel models.

Includes members:
  Member "successive wyner ziv coding for the binary ceo problem under log loss":
    also connected through other hyperedges:
      (none)
  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 log loss")
  Member "remote source coding under gaussian noise dueling roles of power and entropy power":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the ceo problem with rth power of difference and logarithmic distortions")
  Member "the ceo problem with rth power of difference and logarithmic distortions":
    also connected through other hyperedges:
      (none)
  Member "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "the non regular ceo problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the ceo problem with rth power of difference and logarithmic distortions")
  Member "how to achieve the capacity of asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "multiterminal source coding under logarithmic loss":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)