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: "capacity bounds and lattice coding for the star relay network"
  Abstract: A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The receivers decode their desired messages by using side information and the signals received from the relay. We derive an outer bound on the capacity region of any two phase protocol as well as 3 achievable regions by employing different relaying strategies. In particular, we combine physical and network layer coding to take advantage of the interference at the relay, using, for example, lattice-based codes. We then specialize our results to the exchange rate. It is shown that for any snr, we can achieve within 0.5 bit of the upper bound by lattice coding and within 0.34 bit, if we take the best of the 3 strategies. Also, for high snr, lattice coding is within log(3)/4 ~ 0.4 bit of the upper bound.

Connected through hyperedge HE-1 (induced by source paper "building blocks of physical layer network coding"):
  with members:
    - "joint design of channel and network coding for star networks"
    - "joint channel estimation and channel decoding in physical layer network coding systems an em bp factor graph framework"
    - "asynchronous convolutional coded physical layer network coding"
    - "asynchronous physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"
    - "implementation of physical layer network coding"
    - "compute and forward harnessing interference through structured codes"
    - "physical layer network coding"

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)