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 "maximum sum rate of slotted aloha with capture"):
  Abstract: The sum rate performance of random-access networks crucially depends on the access protocol and receiver structure. Despite extensive studies, how to characterize the maximum sum rate of the simplest version of random access, Aloha, remains an open question. In this paper, a comprehensive study of the sum rate performance of slotted Aloha networks is presented. By extending the unified analytical framework proposed in [20], [21] from the classical collision model to the capture model, the network steady-state point in saturated conditions is derived as a function of the signal-to-interference-plus-noise ratio (SINR) threshold which determines a fundamental tradeoff between the information encoding rate and the network throughput. To maximize the sum rate, both the SINR threshold and backoff parameters of nodes should be properly selected. Explicit expressions of the maximum sum rate and the optimal setting are obtained, which show that similar to the sum capacity of the multiple access channel, the maximum sum rate of slotted Aloha also logarithmically increases with the mean received signal-to-noise ratio (SNR), but the high-SNR slope is only $e^{-1}$. Effects of backoff and power control on the sum rate performance of slotted Aloha networks are further discussed, which shed important light on the practical network design.

Includes members:
  Member "coded random access applying codes on graphs to design random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "massive unsourced random access based on uncoupled compressive sensing another blessing of massive mimo")
  Member "managing interference correlation through random medium access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "adaptive spatial aloha fairness and stochastic geometry":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adaptive csma under the sinr model efficient approximation algorithms for throughput and utility maximization")
  Member "random access an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interference prediction in wireless networks stochastic geometry meets recursive filtering")
  Member "random access with physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random access for massive machine type communications")
  Member "an overview of the transmission capacity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "smart radio environments empowered by ai reconfigurable meta surfaces an idea whose time has come")
  Member "spatial and temporal correlation of the interference in aloha ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spatio temporal modeling for massive and sporadic access")

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)