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 "binsec rel efficient relational symbolic execution for constant time at binary level"):
  Abstract: The constant-time programming discipline (CT) is an efficient countermeasure against timing side-channel attacks, requiring the control flow and the memory accesses to be independent from the secrets. Yet, writing CT code is challenging as it demands to reason about pairs of execution traces (2- hypersafety property) and it is generally not preserved by the compiler, requiring binary-level analysis. Unfortunately, current verification tools for CT either reason at higher level (C or LLVM), or sacrifice bug-finding or bounded-verification, or do not scale. We tackle the problem of designing an efficient binary-level verification tool for CT providing both bug-finding and bounded-verification. The technique builds on relational symbolic execution enhanced with new optimizations dedicated to information flow and binary-level analysis, yielding a dramatic improvement over prior work based on symbolic execution. We implement a prototype, Binsec/Rel, and perform extensive experiments on a set of 338 cryptographic implementations, demonstrating the benefits of our approach in both bug-finding and bounded-verification. Using Binsec/Rel, we also automate a previous manual study of CT preservation by compilers. Interestingly, we discovered that gcc -O0 and backend passes of clang introduce violations of CT in implementations that were previously deemed secure by a state-of-the-art CT verification tool operating at LLVM level, showing the importance of reasoning at binary-level.

Includes members:
  Member "get rid of inline assembly through verification oriented lifting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "binary level directed fuzzing for use after free vulnerabilities")
  Member "symbolic verification of cache side channel freedom":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "kleespectre detecting information leakage through speculative cache attacks via symbolic execution")
  Member "eliminating timing side channel leaks using program repair":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a compiler assisted scheduler for detecting and mitigating cache based side channel attacks")
  Member "microwalk a framework for finding side channels in binaries":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "copycat controlled instruction level attacks on enclaves for maximal key extraction")
  Member "time protection the missing os abstraction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "specfuzz bringing spectre type vulnerabilities to the surface")
  Member "relational symbolic execution":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proving differential privacy with shadow execution")
  Member "a software approach to defeating side channels in last level caches":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a compiler assisted scheduler for detecting and mitigating cache based side channel attacks")
  Member "rigorous analysis of software countermeasures against cache attacks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "specusym speculative symbolic execution for cache timing leak detection")

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.CR(Cryptography and Security)