human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "safety certified cooperative adaptive cruise control under unreliable inter vehicle communications"):
  Abstract: Cooperative adaptive cruise control(CACC) system provides a great promise to significantly reduce traffic congestion while maintaining a high level of safety. Recent years have seen an increase of using formal methods in the analysis and design of cooperative adaptive cruise control systems. However, most existing results using formal methods usually assumed an ideal inter-vehicle communication, which is far from the real world situation. Hence, we are motivated to close the gap by explicitly considering non-deterministic time delay and packet dropout due to unreliable inter-vehicle communications. In particular, we consider a passive safety property, which requests a vehicle to avoid any collisions that can be considered as its fault. Under the assumption that the communication delay is bounded and we know the upper bound, we then formally verify the passivity safety of a class of hybrid CACC systems. This result allows us to define a safe control envelope that will guide the synthesis of control signals. Vehicles under the CACC within the safe control envelope are guaranteed to avoid active collisions.

Includes members:
  Member "the complexity of cylindrical algebraic decomposition with respect to polynomial degree":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")
  Member "a uniform substitution calculus for differential dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constructive hybrid games")
  Member "the structure of differential invariants and differential cut elimination":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward structured proofs for dynamic logics")

Question: Please tell me which class the source paper 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.SY(Systems and Control)