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: "a fast compiler for netkat"
  Abstract: High-level programming languages play a key role in a growing number of networking platforms, streamlining application development and enabling precise formal reasoning about network behavior. Unfortunately, current compilers only handle "local" programs that specify behavior in terms of hop-by-hop forwarding behavior, or modest extensions such as simple paths. To encode richer "global" behaviors, programmers must add extra state -- something that is tricky to get right and makes programs harder to write and maintain. Making matters worse, existing compilers can take tens of minutes to generate the forwarding state for the network, even on relatively small inputs. This forces programmers to waste time working around performance issues or even revert to using hardware-level APIs. This paper presents a new compiler for the NetKAT language that handles rich features including regular paths and virtual networks, and yet is several orders of magnitude faster than previous compilers. The compiler uses symbolic automata to calculate the extra state needed to implement "global" programs, and an intermediate representation based on binary decision diagrams to dramatically improve performance. We describe the design and implementation of three essential compiler stages: from virtual programs (which specify behavior in terms of virtual topologies) to global programs (which specify network-wide behavior in terms of physical topologies), from global programs to local programs (which specify behavior in terms of single-switch behavior), and from local programs to hardware-level forwarding tables. We present results from experiments on real-world benchmarks that quantify performance in terms of compilation time and forwarding table size.

Connected through hyperedge HE-1 (induced by source paper "viscr intuitive conflict free automation for securing the dynamic consumer iot infrastructures"):
  with members:
    - "soteria automated iot safety and security analysis"
    - "sensitive information tracking in commodity iot"
    - "iotc2 a formal method approach for detecting conflicts in large scale iot systems"
    - "fog computing for sustainable smart cities a survey"
    - "decoupled ifttt constraining privilege in trigger action platforms for the internet of things"
    - "snap stateful network wide abstractions for packet processing"
    - "merlin a language for provisioning network resources"

Connected through hyperedge HE-2 (induced by source paper "agile network access control in the container age"):
  with members:
    - "semantics preserving simplification of real world firewall rule sets"
    - "demonstrating topos theorem prover based synthesis of secure network configurations"
    - "analysis of docker security"
    - "verifying security policies using host attributes"
    - "directed security policies a stateful network implementation"
    - "merlin a language for provisioning network resources"

Connected through hyperedge HE-3 (induced by source paper "scalable verification of probabilistic networks"):
  with members:
    - "cantor meets scott semantic foundations for probabilistic networks"
    - "revisiting the equivalence problem for finite multitape automata"

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

Connected through hyperedge HE-5 (induced by source paper "cantor meets scott semantic foundations for probabilistic networks"):
  with members:
    - "event driven network programming"
    - "measure transformer semantics for bayesian machine learning"

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

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

Connected through hyperedge HE-8 (induced by source paper "demonstrating topos theorem prover based synthesis of secure network configurations"):
  with members:
    - "semantics preserving simplification of real world firewall rule sets"
    - "verifying security policies using host attributes"
    - "directed security policies a stateful network implementation"
    - "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)