human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "scalar quantize and forward for symmetric half duplex two way relay channels"
  Abstract: Scalar Quantize & Forward (QF) schemes are studied for the Two-Way Relay Channel. Different QF approaches are compared in terms of rates as well as relay and decoder complexity. A coding scheme not requiring Slepian-Wolf coding at the relay is proposed and properties of the corresponding sum-rate optimization problem are presented. A numerical scheme similar to the Blahut-Arimoto algorithm is derived that guides optimized quantizer design. The results are supported by simulations.

Connected through hyperedge HE-1 (induced by source paper "scalar quantizer design for two way channels"):
  with members:
    - "joint source channel coding for the transmission of correlated sources over two way channels"
    - "lossy transmission of correlated sources over two way channels"

Connected through hyperedge HE-2 (induced by source paper "resource allocation for energy efficient 3 way relay channels"):
  with members:
    - "spectral and energy efficiency in 3 way relay channels with circular message exchanges"
    - "energy efficiency optimization in relay assisted mimo systems with perfect and statistical csi"
    - "the capacity region of multiway relay channels over finite fields with full data exchange"
    - "framework for link level energy efficiency optimization with informed transmitter"
    - "capacity theorems for the awgn multi way relay channel"

Question: Please tell me which class the center node 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)