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: "leveraging ebpf for programmable network functions with ipv6 segment routing"
  Abstract: With the advent of Software Defined Networks (SDN), Network Function Virtualisation (NFV) or Service Function Chaining (SFC), operators expect networks to support flexible services beyond the mere forwarding of packets. The network programmability framework which is being developed within the IETF by leveraging IPv6 Segment Routing enables the realisation of in-network functions.   In this paper, we demonstrate that this vision of in-network programmability can be realised. By leveraging the eBPF support in the Linux kernel, we implement a flexible framework that allows network operators to encode their own network functions as eBPF code that is automatically executed while processing specific packets. Our lab measurements indicate that the overhead of calling such eBPF functions remains acceptable. Thanks to eBPF, operators can implement a variety of network functions. We describe the architecture of our implementation in the Linux kernel. This extension has been released with Linux 4.18. We illustrate the flexibility of our approach with three different use cases: delay measurements, hybrid networks and network discovery. Our lab measurements also indicate that the performance penalty of running eBPF network functions on Linux routers does not incur a significant overhead.

Connected through hyperedge HE-1 (induced by source paper "segment routing a comprehensive survey of research activities standardization efforts and implementation results"):
  with members:
    - "srperf a performance evaluation framework for ipv6 segment routing"
    - "an efficient linux kernel implementation of service function chaining for legacy vnfs based on ipv6 segment routing"
    - "node constrained traffic engineering theory and applications"
    - "sdn architecture and southbound apis for ipv6 segment routing enabled wide area networks"
    - "flexible failure detection and fast reroute using ebpf and srv6"
    - "centrality based middlepoint selection for traffic engineering with segment routing"
    - "implementation of virtual network function chaining through segment routing in a linux based nfv infrastructure"
    - "control exchange points providing qos enabled end to end services via sdn based inter domain routing orchestration"

Connected through hyperedge HE-2 (induced by source paper "beyond socket options making the linux tcp stack truly extensible"):
  with members:
    - "demystifying tcp initial window configurations of content distribution networks"
    - "tcpsnitch dissecting the usage of the socket api"

Connected through hyperedge HE-3 (induced by source paper "flexible failure detection and fast reroute using ebpf and srv6"):
  with members:
    - "traffic engineering with segment routing sdn based architectural design and open source implementation"

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)