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: "bridging the gap between programming languages and hardware weak memory models"
  Abstract: We develop a new intermediate weak memory model, IMM, as a way of modularizing the proofs of correctness of compilation from concurrent programming languages with weak memory consistency semantics to mainstream multi-core architectures, such as POWER and ARM. We use IMM to prove the correctness of compilation from the promising semantics of Kang et al. to POWER (thereby correcting and improving their result) and ARMv7, as well as to the recently revised ARMv8 model. Our results are mechanized in Coq, and to the best of our knowledge, these are the first machine-verified compilation correctness results for models that are weaker than x86-TSO.

Connected through hyperedge HE-1 (induced by source paper "qed at large a survey of engineering of formally verified software"):
  with members:
    - "automatic software repair a bibliography"
    - "the redprl proof assistant invited paper"
    - "verifying strong eventual consistency in distributed systems"
    - "algebraic foundations of proof refinement"
    - "deep network guided proof search"
    - "understanding and maintaining tactics graphically or how we are learning that a diagram can be worth more than 10k loc"
    - "gradual certified programming in coq"
    - "automatic and transparent transfer of theorems along isomorphisms in the coq proof assistant"

Connected through hyperedge HE-2 (induced by source paper "reconciling event structures with modern multiprocessors"):
  with members:
    - "on thin air reads towards an event structures model of relaxed memory"
    - "operational aspects of c c concurrency"
    - "herding cats modelling simulation testing and data mining for weak memory"

Connected through hyperedge HE-3 (induced by source paper "verifying that a compiler preserves concurrent value dependent information flow security"):
  with members:
    - "time protection the missing os abstraction"

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)