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 "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.

Includes members:
  Member "nested lattice codes for gaussian relay networks with interference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized compute compress and forward")
  Member "lattice codes for the gaussian relay channel decode and forward and compress and forward":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "capacity of the gaussian two way relay channel to within 1 2 bit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "successive integer forcing and its sum rate optimality")
  Member "lattice strategies for the dirty multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")
  Member "joint physical layer coding and network coding for bi directional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compute and forward relaying with ldpc codes over qpsk scheme")

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)