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 "managing interference correlation through random medium access"):
  Abstract: The capacity of wireless networks is fundamentally limited by interference. However, little research has focused on the interference correlation, which may greatly increase the local delay (namely the number of time slots required for a node to successfully transmit a packet). This paper focuses on the question whether increasing randomness in the MAC, specifically frequency-hopping multiple access (FHMA) and ALOHA, helps to reduce the effect of interference correlation. We derive closed-form results for the mean and variance of the local delay for the two MAC protocols and evaluate the optimal parameters that minimize the mean local delay. Based on the optimal parameters, we identify two operating regimes, the correlation-limited regime and the bandwidth-limited regime. Our results reveal that while the mean local delays for FHMA with N sub-bands and for ALOHA with transmit probability p essentially coincide when p=1/N, a fundamental discrepancy exists between their variances. We also discuss implications from the analysis, including an interesting mean delay-jitter tradeoff, and convenient bounds on the tail probability of the local delay, which shed useful insights into system design.

Includes members:
  Member "diversity polynomials for the analysis of temporal correlations in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "diversity loss due to interference correlation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatio temporal correlation of interference in manet under spatially correlated shadowing environment")
  Member "a new phase transitions for local delays in manets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "spatial and temporal correlation of the interference in aloha ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "reliability and local delay in wireless networks does bandwidth partitioning help")

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)