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: "lattice coding for the two way two relay channel"
  Abstract: We develop a novel lattice coding scheme for the Two-way Two-relay Channel: 1 ↔ 2 ↔ 3 ↔ 4, where Node 1 and 4 communicate with each other through two relay nodes 2 and 3. Each node only communicates with its neighboring nodes. The key technical contribution is the lattice-based achievability strategy, where each relay is able to remove the noise while decoding the sum of several signals in a Block Markov strategy and then re-encode the signal into another lattice codeword using the so-called “Re-distribution Transform”. This allows nodes further down the line to again decode sums of lattice codewords. The symmetric rate achieved by the proposed lattice coding scheme is within 1/2 log 3 bit/Hz/s of the symmetric rate capacity.

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"
    - "on the capacity regions of two way diamond channels"
    - "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"
    - "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"
    - "on the capacity regions of two way diamond channels"
    - "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"
    - "two unicast two hop interference network finite field model"

Connected through hyperedge HE-3 (induced by source paper "on the degrees of freedom of the mimo three way channel with intermittent connectivity"):
  with members:
    - "adaptation is useless for two discrete additive noise two way channels"
    - "degrees of freedom of the bursty mimo x channel without feedback"
    - "three way channels with multiple unicast sessions capacity approximation via network transformation"
    - "gaussian interference channel with intermittent feedback"
    - "binary fading interference channel with no csit"
    - "in band full duplex wireless challenges and opportunities"
    - "capacity results for two classes of three way channels"
    - "two way networks when adaptation is useless"

Connected through hyperedge HE-4 (induced by source paper "on the capacity regions of two way diamond channels"):
  with members:
    - "on the symmetric k user interference channels with limited feedback"
    - "on the capacity and degrees of freedom regions of two user mimo interference channels with limited receiver cooperation"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "nested lattice codes for gaussian two way relay channels"
    - "the gaussian two way diamond channel"
    - "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "outer bounds for the capacity region of a gaussian two way relay channel"

Connected through hyperedge HE-5 (induced by source paper "achievable rate regions for two way relay channel using nested lattice coding"):
  with members:
    - "a lattice compress and forward scheme"
    - "lattice codes for the gaussian relay channel decode and forward and compress and forward"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "compute and forward harnessing interference through structured codes"
    - "physical layer network coding"
    - "performance bounds for bi directional coded cooperation protocols"

Connected through hyperedge HE-6 (induced by source paper "the degrees of freedom of the mimo y channel"):
  with members:
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "on the sum capacity of the y channel"
    - "the multi way relay channel"
    - "capacity theorems for the awgn multi way relay channel"
    - "bidirectional multi pair network with a mimo relay beamforming strategies and lack of duality"
    - "capacity of the gaussian two way relay channel to within 1 2 bit"
    - "broadcast capacity region of two phase bidirectional relaying"

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)