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 "hybrid resource scheduling for aggregation in massive machine type communication networks"):
  Abstract: Data aggregation is a promising approach to enable massive machine-type communication (mMTC). Here, we first characterize the aggregation phase where a massive number of machine-type devices transmits to their respective aggregator. By using non-orthogonal multiple access (NOMA), we present a hybrid access scheme where several machine-type devices (MTDs) share the same orthogonal channel. Then, we assess the relaying phase where the aggregatted data is forwarded to the base station. The system performance is investigated in terms of average number of MTDs that are simultaneously served under imperfect successive interference cancellation (SIC) at the aggregator for two scheduling schemes, namely random resource scheduling (RRS) and channel-dependent resource scheduling (CRS), which is then used to assess the performance of data forwarding phase.

Includes members:
  Member "finite blocklength communications in smart grids for dynamic spectrum access and locally licensed scenarios":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a throughput and energy efficiency scheme for unlicensed massive machine type communications")
  Member "massive multiple access based on superposition raptor codes for cellular m2m communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient scheduling for the massive random access gaussian channel")
  Member "massive non orthogonal multiple access for cellular iot potentials and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "aggregation and resource scheduling in machine type communication networks a stochastic geometry approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "spatiotemporal stochastic modeling of iot enabled cellular networks scalability and stability analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "massive machine type communication with data aggregation and resource scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "maximizing the link throughput between smart meters and aggregators as secondary users under power and outage constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite blocklength communications in smart grids for dynamic spectrum access and locally licensed scenarios")
  Member "asymptotics and approximation of the sir distribution in general cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sir analysis via signal fractions")

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.NI(Networking and Internet Architecture)