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: "capacity of the energy harvesting gaussian mac"
  Abstract: We consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by an exogenous stochastic energy harvesting process and equipped with finite batteries. We characterize the capacity region of this channel as n-letter mutual information rate and develop inner and outer bounds that differ by a constant gap. An interesting conclusion that emerges from our results is that the sum-capacity approaches that of a standard AWGN MAC (with only an average constraint on the transmitted power), as the number of users in the MAC becomes large.

Connected through hyperedge HE-1 (induced by source paper "capacity of a full duplex wirelessly powered communication system with self interference and processing cost"):
  with members:
    - "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities"
    - "capacity region of gaussian multiple access channels with energy harvesting and energy cooperation"
    - "capacity analysis of discrete energy harvesting channels"
    - "capacity of the two hop relay channel with wireless energy transfer from relay to source and energy transmission cost"
    - "weighted sum transmit power minimization for full duplex system with swipt and self energy recycling"
    - "capacity of the energy harvesting channel with a finite battery"
    - "energy recycling full duplex radios for next generation networks"
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"

Connected through hyperedge HE-2 (induced by source paper "online power control for block i i d energy harvesting channels"):
  with members:
    - "communication over a time correlated channel with an energy harvesting transmitter"
    - "on achievable rates of awgn energy harvesting channels with block energy arrival and non vanishing error probabilities"
    - "capacity analysis of discrete energy harvesting channels"
    - "capacity of the energy harvesting channel with a finite battery"
    - "universally near optimal online power control for energy harvesting nodes"
    - "closed form delay optimal power control for energy harvesting wireless system with finite energy storage"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "on online energy harvesting in multiple access communication systems"

Connected through hyperedge HE-3 (induced by source paper "sparse combinatorial group testing for low energy massive random access"):
  with members:
    - "on the optimality of the kautz singleton construction in probabilistic group testing"
    - "nearly optimal sparse group testing"
    - "low power wide area networks an overview"
    - "learning immune defectives graph through group tests"
    - "saffron a fast efficient and robust framework for group testing based on sparse graph codes"
    - "non adaptive probabilistic group testing with noisy measurements near optimal bounds with efficient algorithms"
    - "note on noisy group testing asymptotic bounds and belief propagation reconstruction"
    - "explicit non adaptive combinatorial group testing schemes"

Connected through hyperedge HE-4 (induced by source paper "sparse combinatorial group testing"):
  with members:
    - "nearly optimal sparse group testing"
    - "learning immune defectives graph through group tests"
    - "saffron a fast efficient and robust framework for group testing based on sparse graph codes"
    - "noise resilient group testing limitations and constructions"
    - "explicit non adaptive combinatorial group testing schemes"

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)