human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the stability of contention resolution diversity slotted aloha crdsa"
  Abstract: The stability of Random Access protocols is of high importance to ensure an efficient usage of resources and good service perception by the users. In this paper the stability region for the recently proposed Contention Resolution Diversity Slotted ALOHA random access protocol is discussed for finite user populations. The system dynamics of a CRDSA Random Access channel are described and a mathematical model is formulated, which allows predicting the stability of the system. From the derived model quantitative approximations of the stability regions and parameter selection for stable operation are provided. Numerical results are derived by means of simulations for validating the mathematical model and the quantitative approximations of the stability region

Connected through hyperedge HE-1 (induced by source paper "enhancing contention resolution aloha using combining techniques"):
  with members:
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "all to all broadcast for vehicular networks based on coded slotted aloha"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "cooperative slotted aloha for multi base station systems"
    - "the throughput of slotted aloha with diversity"
    - "aloha random access that operates as a rateless code"
    - "optimum header positioning in successive interference cancellation sic based aloha"
    - "sliding window based contention resolution diversity slotted aloha"

Connected through hyperedge HE-2 (induced by source paper "exploiting combination techniques in random access mac protocols enhanced contention resolution aloha"):
  with members:
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "aloha random access that operates as a rateless code"
    - "optimum header positioning in successive interference cancellation sic based aloha"
    - "sliding window based contention resolution diversity slotted aloha"
    - "frameless aloha protocol for wireless networks"

Connected through hyperedge HE-3 (induced by source paper "efficient and scalable distributed autonomous spatial aloha networks via local leader election"):
  with members:
    - "aloha games with spatial reuse"
    - "distributed spectrum access with spatial reuse"
    - "a game theoretic approach to distributed opportunistic scheduling"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-4 (induced by source paper "on the stability of asynchronous random access schemes"):
  with members:
    - "crdsa crdsa and irsa stability and performance evaluation"
    - "enhanced contention resolution aloha ecra"

Question: Please tell me which class the center node 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)