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 "cooperative slotted aloha for multi base station systems"):
  Abstract: We introduce a framework to study slotted Aloha with cooperative base stations. Assuming a geographic-proximity communication model, we propose several decoding algorithmswith different degrees of base stations' cooperation (non-cooperative, spatial, temporal, and spatio-temporal). With spatial cooperation, neighboring base stations inform each other whenever they collect a user within their coverage overlap; temporal cooperation corresponds to (temporal) successive interference cancellation done locally at each station. We analyze the four decoding algorithms and establish several fundamental results. With all algorithms, the peak throughput (average number of decoded users per slot, across all base stations) increases linearly with the number of base stations. Further, temporal and spatio-temporal cooperations exhibit a threshold behavior with respect to the normalized load (number of users per station, per slot). There exists a positive load $G^\star$, such that, below $G^\star$, the decoding probability is asymptotically maximal possible, equal the probability that a user is heard by at least one base station; with non-cooperative decoding and spatial cooperation, we show that $G^\star$ is zero. Finally, with spatio-temporal cooperation, we optimize the degree distribution according to which users transmit their packet replicas; the optimum is in general very different from the corresponding optimal distribution of the single-base station system.

Includes members:
  Member "coded slotted aloha a graph based method for uncoordinated multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "phase transition analysis for covariance based massive random access with massive mimo")
  Member "slotted aloha for networked base stations with spatial and temporal diversity":
    also connected through other hyperedges:
      (none)
  Member "slotted aloha for networked base stations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "slotted aloha for networked base stations with spatial and temporal diversity")
  Member "coded random access how coding theory helps to build random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless access in ultra reliable low latency communication urllc")
  Member "exploiting capture effect in frameless aloha for massive wireless random access":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the modeling and performance assessment of random access with sic")
  Member "characterization of coded random access with compressive sensing based multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g networks")
  Member "the throughput of slotted aloha with diversity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enhancing contention resolution aloha using combining techniques")
  Member "aloha random access that operates as a rateless code":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")

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)