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 "reliability and local delay in wireless networks does bandwidth partitioning help"):
  Abstract: This paper studies the effect of bandwidth partitioning (BWP) on the reliability and delay performance in infrastructureless wireless networks. The reliability performance is characterized by the density of concurrent transmissions that satisfy a certain reliability (outage) constraint and the delay performance by so-called local delay, defined as the average number of time slots required to successfully transmit a packet. We concentrate on the ultrareliable regime where the target outage probability is close to 0. BWP has two conflicting effects: while the interference is reduced as the concurrent transmissions are divided over multiple frequency bands, the signal-to-interference ratio (SIR) requirement is increased due to smaller allocated bandwidth if the data rate is to be kept constant. Instead, if the SIR requirement is to be kept the same, BWP reduces the data rate and in turn increases the local delay. For these two approaches with adaptive and fixed SIR requirements, we derive closed-form expressions of the local delay and the maximum density of reliable transmissions in the ultrareliable regime. Our analysis shows that, in the ultrareliable regime, BWP leads to the reliability-delay tradeoff.

Includes members:
  Member "the spatial outage capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "per link reliability and rate control two facets of the sir meta distribution")
  Member "the meta distribution of the sir in poisson bipolar and cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "managing interference correlation through random medium access":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "access point density and bandwidth partitioning in ultra dense wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cross mode interference characterization in cellular networks with voronoi guard regions")
  Member "a new phase transitions for local delays in manets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "bandwidth partitioning in decentralized wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance of multiantenna linear mmse receivers in doubly stochastic networks")

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)