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: "efficient synthesis of network updates"
  Abstract: Software-defined networking (SDN) is revolutionizing the networking industry, but current SDN programming platforms do not provide automated mechanisms for updating global configurations on the fly. Implementing updates by hand is challenging for SDN programmers because networks are distributed systems with hundreds or thousands of interacting nodes. Even if initial and final configurations are correct, naively updating individual nodes can lead to incorrect transient behaviors, including loops, black holes, and access control violations. This paper presents an approach for automatically synthesizing updates that are guaranteed to preserve specified properties. We formalize network updates as a distributed programming problem and develop a synthesis algorithm based on counterexample-guided search and incremental model checking. We describe a prototype implementation, and present results from experiments on real-world topologies and properties demonstrating that our tool scales to updates involving over one-thousand nodes.

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"
    - "event driven network programming"
    - "congestion free rerouting of flows on dags"

Connected through hyperedge HE-2 (induced by source paper "d2r dataplane only policy compliant routing under failures"):
  with members:
    - "heavy hitter detection entirely in the data plane"
    - "network wide configuration synthesis"
    - "merlin a language for provisioning network resources"

Connected through hyperedge HE-3 (induced by source paper "trufl distributed trust management framework in sdn"):
  with members:
    - "disco distributed multi domain sdn controllers"

Connected through hyperedge HE-4 (induced by source paper "decentralized consistent network updates in sdn with ez segway"):
  with members:
    - "survey of consistent network updates"
    - "merlin a language for provisioning network resources"

Connected through hyperedge HE-5 (induced by source paper "report on the nsf workshop on formal methods for security"):
  with members:
    - "rappor randomized aggregatable privacy preserving ordinal response"
    - "automated experiments on ad privacy settings a tale of opacity choice and discrimination"
    - "calibrating data to sensitivity in private data analysis"
    - "probabilistic analysis of onion routing in a black box model"

Connected through hyperedge HE-6 (induced by source paper "event driven network programming"):
  with members:
    - "snap stateful network wide abstractions for packet processing"
    - "packet transactions a programming model for data plane algorithms at hardware speed"
    - "a fast compiler for netkat"
    - "merlin a language for provisioning network resources"

Connected through hyperedge HE-7 (induced by source paper "survey of consistent network updates"):
  with members:
    - "transiently consistent sdn updates being greedy is hard"
    - "the case for data plane timestamping in sdn"
    - "oneclock to rule them all using time in networked applications"

Connected through hyperedge HE-8 (induced by source paper "access control synthesis for physical spaces"):
  with members:
    - "ptacl a language for attribute based access control in open systems"

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)