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: "distributed random access algorithm scheduling and congesion control"
  Abstract: This paper provides proofs of the rate stability, Harris recurrence, and epsilon-optimality of CSMA algorithms where the backoff parameter of each node is based on its backlog. These algorithms require only local information and are easy to implement. #R##N#The setup is a network of wireless nodes with a fixed conflict graph that identifies pairs of nodes whose simultaneous transmissions conflict. The paper studies two algorithms. The first algorithm schedules transmissions to keep up with given arrival rates of packets. The second algorithm controls the arrivals in addition to the scheduling and attempts to maximize the sum of the utilities of the flows of packets at the different nodes. For the first algorithm, the paper proves rate stability for strictly feasible arrival rates and also Harris recurrence of the queues. For the second algorithm, the paper proves the epsilon-optimality. Both algorithms operate with strictly local information in the case of decreasing step sizes, and operate with the additional information of the number of nodes in the network in the case of constant step size.

Connected through hyperedge HE-1 (induced by source paper "adaptive csma under the sinr model efficient approximation algorithms for throughput and utility maximization"):
  with members:
    - "spatial csma a distributed scheduling algorithm for the sir model with time varying channels"
    - "how well can graphs represent wireless interference"
    - "exploiting the past to reduce delay in csma scheduling a high order markov chain approach"
    - "loopy belief propagation for approximate inference an empirical study"
    - "adaptive spatial aloha fairness and stochastic geometry"
    - "applications of belief propagation in csma wireless networks"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "towards a queueing based framework for in network function computation"):
  with members:
    - "network coding for computing cut set bounds"
    - "optimal computation of symmetric boolean functions in tree networks"
    - "information theoretic bounds for multiround function computation in collocated networks"
    - "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"

Connected through hyperedge HE-3 (induced by source paper "distributed throughput optimal scheduling in ad hoc wireless networks"):
  with members:
    - "greedy maximal scheduling in wireless networks"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "randomized scheduling algorithm for queueing networks"

Connected through hyperedge HE-4 (induced by source paper "approaching throughput optimality in distributed csma scheduling algorithms with collisions"):
  with members:
    - "back of the envelope computation of throughput distributions in csma wireless networks"

Connected through hyperedge HE-5 (induced by source paper "performance of csma in multi channel wireless networks"):
  with members:
    - "on the stability of flow aware csma"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "randomized scheduling algorithm for queueing networks"

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)