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: "enhancing the delay performance of dynamic backpressure algorithms"
  Abstract: For general multi-hop queueing networks, delay optimal network control has unfortunately been an outstanding problem. The dynamic backpressure (BP) algorithm elegantly achieves throughput optimality, but does not yield good delay performance in general. In this paper, we obtain an asymptotically delay optimal control policy, which resembles the BP algorithm in basing resource allocation and routing on a backpressure calculation, but differs from the BP algorithm in the form of the backpressure calculation employed. The difference suggests a possible reason for the unsatisfactory delay performance of the BP algorithm, i.e., the myopic nature of the BP control. Motivated by this new connection, we introduce a new class of enhanced backpressure-based algorithms which incorporate a general queue-dependent bias function into the backpressure term of the traditional BP algorithm to improve delay performance. These enhanced algorithms exploit queue state information beyond one hop. We prove the throughput optimality and characterize the utility-delay tradeoff of the enhanced algorithms. We further focus on two specific distributed algorithms within this class, which have demonstrably improved delay performance as well as acceptable implementation complexity.

Connected through hyperedge HE-1 (induced by source paper "adaptive matching for expert systems with uncertain task types"):
  with members:
    - "matching while learning"
    - "approval voting and incentives in crowdsourcing"
    - "near optimal bayesian active learning for decision making"
    - "delay based back pressure scheduling in multihop wireless networks"
    - "backpressure with adaptive redundancy bwar"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "budget optimal task allocation for reliable crowdsourcing systems"
    - "analysis of thompson sampling for the multi armed bandit problem"

Connected through hyperedge HE-2 (induced by source paper "a distributed scheduling algorithm to provide quality of service in multihop wireless networks"):
  with members:
    - "joint routing scheduling and power control providing hard deadline in wireless multihop networks"
    - "a distributed algorithm for quality of service provisioning in multihop networks"
    - "throughput optimal decentralized scheduling of multi hop networks with end to end deadline constraints unreliable links"
    - "incremental gradient subgradient and proximal methods for convex optimization a survey"
    - "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning"

Connected through hyperedge HE-3 (induced by source paper "distributed control and quality of service in multihop wireless networks"):
  with members:
    - "joint routing scheduling and power control providing hard deadline in wireless multihop networks"
    - "throughput optimal decentralized scheduling of multi hop networks with end to end deadline constraints unreliable links"
    - "incremental gradient subgradient and proximal methods for convex optimization a survey"
    - "a survey on delay aware resource control for wireless systems large deviation theory stochastic lyapunov drift and distributed stochastic learning"

Connected through hyperedge HE-4 (induced by source paper "enhanced vip algorithms for forwarding caching and congestion control in named data networks"):
  with members:
    - "forwarding caching and congestion control in named data networks"
    - "vip a framework for joint dynamic forwarding and caching in named data 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)