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

Connected through hyperedge HE-1 (induced by source paper "probabilistic rateless multiple access for machine to machine communication"):
  with members:
    - "near capacity adaptive analog fountain codes for wireless channels"
    - "fundamentals of throughput maximization with random arrivals for m2m communications"
    - "distributed raptor coding for erasure channels partially and fully coded cooperation"
    - "power efficient system design for cellular based machine to machine communications"
    - "spatially coupled random access on graphs"

Connected through hyperedge HE-2 (induced by source paper "multiple access analog fountain codes"):
  with members:
    - "near capacity adaptive analog fountain codes for wireless channels"

Connected through hyperedge HE-3 (induced by source paper "low latency data sharing in erasure multi way relay channels"):
  with members:
    - "joint compute and forward for the two way relay channel with spatially coupled ldpc codes"
    - "an optimal coding strategy for the binary multi way relay channel"
    - "the multi way relay channel"
    - "capacity theorems for the awgn multi way relay channel"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-4 (induced by source paper "joint compute and forward for the two way relay channel with spatially coupled ldpc codes"):
  with members:
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "asynchronous physical layer network coding"
    - "optimal decoding algorithm for asynchronous physical layer network coding"
    - "reliable physical layer network coding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universal codes for the gaussian mac via spatial coupling"
    - "spatially coupled codes over the multiple access channel"
    - "channel coding and decoding in a relay system operated with 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)