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 "on modulo sum computation over an erasure multiple access channel"):
  Abstract: We study computation of a modulo-sum of two binary source sequences over a two-user erasure multiple access channel. The channel is modeled as a binary-input, erasure multiple access channel, which can be in one of three states - either the channel output is a modulo-sum of the two input symbols, or the channel output equals the input symbol on the first link and an erasure on the second link, or vice versa. The associated state sequence is independent and identically distributed. We develop a new upper bound on the sum-rate by revealing only part of the state sequence to the transmitters. Our coding scheme is based on the compute and forward and the decode and forward techniques. When a (strictly) causal feedback of the channel state is available to the encoders, we show that the modulo-sum capacity is increased. Extensions to the case of lossy reconstruction of the modulo-sum and to channels involving additional states are also treated briefly.

Includes members:
  Member "anti structure problems":
    also connected through other hyperedges:
      (none)
  Member "on the capacity of abelian group codes over discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable rate region for three user discrete broadcast channel based on coset codes")
  Member "multilevel coding schemes for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space time coded spatial modulated physical layer network coding for two way relaying")
  Member "providing secrecy with structured codes tools and applications to two user gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  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 "on the secrecy rate of interference networks using structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy transmit beamforming for heterogeneous networks")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)