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: "on the capacity regions of two way diamond channels"
  Abstract: In this paper, we study the capacity regions of two-way diamond channels. We show that for a linear deterministic model the capacity of the diamond channel in each direction can be simultaneously achieved for all values of channel parameters, where the forward and backward channel parameters are not necessarily the same. We divide the achievability scheme into three cases, depending on the forward and backward channel parameters. For the first case, we use a reverse amplify-and-forward strategy in the relays. For the second case, we use four relay strategies based on the reverse amplify-and-forward with some modifications in terms of replacement and repetition of some stream levels. For the third case, we use two relay strategies based on performing two rounds of repetitions in a relay. The proposed schemes for deterministic channels are used to find the capacity regions within constant gaps for two special cases of the Gaussian two-way diamond channel. First, for the general Gaussian two-way relay channel, the capacity within a constant gap is achieved with a simpler coding scheme as compared with the prior works. Then, a special symmetric Gaussian two-way diamond model is considered and the capacity region is achieved within four bits.

Connected through hyperedge HE-1 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "beyond one way communication degrees of freedom of multi way relay mimo interference networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "caching eliminates the wireless bottleneck in video aware wireless networks"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "nested lattice codes for gaussian two way relay channels"
    - "lattice coding for the two way two relay channel"
    - "two unicast two hop interference network finite field model"

Connected through hyperedge HE-2 (induced by source paper "the dof of two way butterfly networks"):
  with members:
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "beyond one way communication degrees of freedom of multi way relay mimo interference networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "caching eliminates the wireless bottleneck in video aware wireless networks"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "nested lattice codes for gaussian two way relay channels"
    - "lattice coding for the two way two relay channel"
    - "two unicast two hop interference network finite field model"

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)