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: "mechanized semantics for the clight subset of the c language"
  Abstract: This article presents the formal semantics of a large subset of the C language called Clight. Clight includes pointer arithmetic, struct and union types, C loops and structured switch statements. Clight is the source language of the CompCert verified compiler. The formal semantics of Clight is a big-step operational semantics that observes both terminating and diverging executions and produces traces of input/output events. The formal semantics of Clight is mechanized using the Coq proof assistant. In addition to the semantics of Clight, this article describes its integration in the CompCert verified compiler and several ways by which the semantics was validated.

Connected through hyperedge HE-1 (induced by source paper "skeletal semantics and their interpretations"):
  with members:
    - "coinductive big step semantics for concurrency"
    - "abstracting abstract machines a systematic approach to higher order program analysis"
    - "abstracting abstract machines"

Connected through hyperedge HE-2 (induced by source paper "executable formal semantics for the posix shell"):
  with members:
    - "oxide the essence of rust"
    - "rust distilled an expressive tower of languages"
    - "nofaq synthesizing command repairs from examples"

Connected through hyperedge HE-3 (induced by source paper "fether an extensible definitional interpreter for smart contract verifications in coq"):
  with members:
    - "lolisa formal syntax and semantics for a subset of the solidity programming language"
    - "a general formal memory framework in coq for verifying the properties of programs based on higher order logic theorem proving with increased automation consistency and reusability"
    - "simplicity a new language for blockchains"
    - "a survey of symbolic execution techniques"

Connected through hyperedge HE-4 (induced by source paper "translating xd c programs to msvl programs"):
  with members:
    - "t2 temporal property verification"
    - "software model checking via large block encoding"
    - "cpachecker a tool for configurable software verification"

Connected through hyperedge HE-5 (induced by source paper "exploiting pointer analysis in memory models for deductive verification"):
  with members:
    - "on the complexity of pointer arithmetic in separation logic an extended version"
    - "a decision procedure for separation logic in smt"
    - "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"

Connected through hyperedge HE-6 (induced by source paper "high assurance separation kernels a survey on formal methods"):
  with members:
    - "reasoning about information flow security of separation kernels with channel based communication"
    - "event based formalization of safety critical operating system standards an experience report on arinc 653 using event b"
    - "a temporal logic for hyperproperties"

Connected through hyperedge HE-7 (induced by source paper "verified low level programming embedded in f"):
  with members:
    - "dijkstra monads for free"

Connected through hyperedge HE-8 (induced by source paper "renaming global variables in c mechanically proved correct"):
  with members:
    - "transformations between composite and visitor implementations in java"
    - "invertible program restructurings for continuing modular maintenance"

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)