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: "lying your way to better traffic engineering"
  Abstract: To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands. TE in IP networks typically involves configuring static link weights and splitting traffic between the resulting shortest-paths via the Equal-Cost-MultiPath (ECMP) mechanism. Unfortunately, ECMP is a notoriously cumbersome and indirect means for optimizing traffic flow, often leading to poor network performance. Also, obtaining accurate knowledge of traffic demands as the input to TE is elusive, and traffic conditions can be highly variable, further complicating TE. We leverage recently proposed schemes for increasing ECMP's expressiveness via carefully disseminated bogus information ("lies") to design COYOTE, a readily deployable TE scheme for robust and efficient network utilization. COYOTE leverages new algorithmic ideas to configure (static) traffic splitting ratios that are optimized with respect to all (even adversarially chosen) traffic scenarios within the operator's "uncertainty bounds". Our experimental analyses show that COYOTE significantly outperforms today's prevalent TE schemes in a manner that is robust to traffic uncertainty and variation. We discuss experiments with a prototype implementation of COYOTE.

Connected through hyperedge HE-1 (induced by source paper "memento making sliding windows efficient for heavy hitters"):
  with members:
    - "optimal elephant flow detection"
    - "constant time updates in hierarchical heavy hitters"
    - "detecting heavy flows in the sdn match and action model"
    - "fast flow volume estimation"
    - "pay for a sliding bloom filter and get counting distinct elements and entropy for free"
    - "heavy hitter detection entirely in the data plane"
    - "randomized admission policy for efficient top k and frequency estimation"
    - "hierarchical heavy hitters with the space saving algorithm"

Connected through hyperedge HE-2 (induced by source paper "deltapath dataflow based high performance incremental routing"):
  with members:
    - "kulfi robust traffic engineering using semi oblivious routing"
    - "lightweight asynchronous snapshots for distributed dataflows"
    - "flexible network bandwidth and latency provisioning in the datacenter"
    - "merlin a language for provisioning network resources"
    - "jellyfish networking data centers randomly"
    - "bidirectional heuristic search reconsidered"

Connected through hyperedge HE-3 (induced by source paper "a constrained shortest path scheme for virtual network service management"):
  with members:
    - "a general constrained shortest path approach for virtual path embedding"
    - "a path generation approach to embedding of virtual 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.NI(Networking and Internet Architecture)