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: "event driven network programming"
  Abstract: Software-defined networking (SDN) programs must simultaneously describe static forwarding behavior and dynamic updates in response to events. Event-driven updates are critical to get right, but difficult to implement correctly due to the high degree of concurrency in networks. Existing SDN platforms offer weak guarantees that can break application invariants, leading to problems such as dropped packets, degraded performance, security violations, etc. This paper introduces EVENT-DRIVEN CONSISTENT UPDATES that are guaranteed to preserve well-defined behaviors when transitioning between configurations in response to events. We propose NETWORK EVENT STRUCTURES (NESs) to model constraints on updates, such as which events can be enabled simultaneously and causal dependencies between events. We define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. Finally, we evaluate our approach empirically, demonstrating that it gives well-defined consistency guarantees while avoiding expensive synchronization and packet buffering.

Connected through hyperedge HE-1 (induced by source paper "survey of consistent software defined network updates"):
  with members:
    - "short schedules for fast flow rerouting"
    - "network slicing for 5g with sdn nfv concepts architectures and challenges"
    - "towards adaptive state consistency in distributed sdn control plane"
    - "renaissance self stabilizing distributed sdn control plane"
    - "transiently consistent sdn updates being greedy is hard"
    - "the case for data plane timestamping in sdn"
    - "congestion free rerouting of flows on dags"
    - "oneclock to rule them all using time in networked applications"

Connected through hyperedge HE-2 (induced by source paper "optimal state replication in stateful data planes"):
  with members:
    - "snap stateful network wide abstractions for packet processing"
    - "software defined networking a comprehensive survey"

Connected through hyperedge HE-3 (induced by source paper "sdn access control for the masses"):
  with members:
    - "trust anchors in software defined networks"
    - "trusdn bootstrapping trust in cloud network infrastructure"

Connected through hyperedge HE-4 (induced by source paper "p4cep towards in network complex event processing"):
  with members:
    - "spectre supporting consumption policies in window based parallel complex event processing"
    - "snap stateful network wide abstractions for packet processing"

Connected through hyperedge HE-5 (induced by source paper "kleene algebra modulo theories"):
  with members:
    - "snap stateful network wide abstractions for packet processing"
    - "comparing weakest precondition and weakest liberal precondition"
    - "a fast compiler for netkat"
    - "symbolic algorithms for language equivalence and kleene algebra with tests"
    - "inferring loop invariants using postconditions"

Connected through hyperedge HE-6 (induced by source paper "why and how networks should run themselves"):
  with members:
    - "heavy hitter detection entirely in the data plane"
    - "snap stateful network wide abstractions for packet processing"
    - "merlin a language for provisioning network resources"

Connected through hyperedge HE-7 (induced by source paper "cantor meets scott semantic foundations for probabilistic networks"):
  with members:
    - "a fast compiler for netkat"
    - "measure transformer semantics for bayesian machine learning"

Connected through hyperedge HE-8 (induced by source paper "snap stateful network wide abstractions for packet processing"):
  with members:
    - "programmable packet scheduling"
    - "a fast compiler for netkat"
    - "verifying isolation properties in the presence of middleboxes"
    - "merlin a language for provisioning network resources"

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.PL(Programming Languages)