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: "congestion control of tcp flows in internet routers by means of index policy"
  Abstract: In this paper we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a source using the Transmission Control Protocol (TCP) and a bottleneck router with the objective of designing optimal packet admission controls in the router queue. We focus on the relaxed version of the problem obtained by relaxing the fixed buffer capacity constraint that must be satisfied at all time epoch. The relaxation allows us to reduce the multi-flow problem into a family of single-flow problems, for which we can analyze both theoretically and numerically the existence of optimal control policies of special structure. In particular, we show that for a variety of parameters, TCP flows can be optimally controlled in routers by so-called index policies, but not always by threshold policies. We have also implemented the index policy in Network Simulator-3 and tested in a simple topology their applicability in real networks. The simulation results show that the index policy achieves a wide range of desirable properties with respect to fairness between different TCP versions, across users with different round-trip-time and minimum buffer required to achieve full utility of the queue.

Connected through hyperedge HE-1 (induced by source paper "on the whittle index for restless multi armed hidden markov bandits"):
  with members:
    - "whittle index policy for crawling ephemeral content"
    - "on optimality of myopic sensing policy with imperfect sensing in multi channel opportunistic access"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "exploiting channel memory for joint estimation and scheduling in downlink networks"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors"

Connected through hyperedge HE-2 (induced by source paper "learning unknown service rates in queues a multi armed bandit approach"):
  with members:
    - "regret of queueing bandits"
    - "combinatorial semi bandit with known covariance"
    - "combinatorial bandits revisited"
    - "regret bounds for restless markov bandits"
    - "analysis of thompson sampling for the multi armed bandit problem"

Connected through hyperedge HE-3 (induced by source paper "whittle index policy for crawling ephemeral content"):
  with members:
    - "timely crawling of high quality ephemeral new content"
    - "refining recency search results with user click feedback"
    - "optimal threshold control by the robots of web search engines with obsolescence of documents"

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.NI(Networking and Internet Architecture)