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: "mitigating timing side channel in shared schedulers"
  Abstract: In this work, we study information leakage in timing side channels that arise in the context of shared event schedulers. Consider two processes, one of them an innocuous process (referred to as Alice) and the other a malicious one (referred to as Bob), using a common scheduler to process their jobs. There are other innocuous users in addition to Alice and Bob using the scheduler to process their jobs. Based on when his jobs get processed, Bob wishes to learn about the pattern (size and timing) of Alice's jobs. Depending on the context, knowledge of this pattern could have serious implications on Alice's privacy and security. For instance, shared routers can reveal traffic patterns, shared memory access can reveal cloud usage patterns, and suchlike. We present a formal framework to study the information leakage in shared resource schedulers using the pattern estimation error as a performance metric. The first-come-first-serve (FCFS) scheduling policy and time-division-multiple-access (TDMA) are identified as two extreme policies on the privacy metric, FCFS has the least, and TDMA has the highest. However, on performance-based metrics, such as throughput and delay, it is well known that FCFS significantly outperforms TDMA. We then derive two parameterized policies, accumulate and serve, and proportional TDMA, which take two different approaches to offer a tunable trade-off between privacy and performance.

Connected through hyperedge HE-1 (induced by source paper "on scheduler side channels in dynamic priority real time systems"):
  with members:
    - "a novel side channel in real time schedulers"
    - "exploring opportunistic execution for integrating security into legacy hard real time systems"
    - "quantifying the information leakage in timing side channels in deterministic work conserving schedulers"

Connected through hyperedge HE-2 (induced by source paper "pacer network side channel mitigation in the cloud"):
  with members:
    - "measuring information leakage in website fingerprinting attacks and defenses"
    - "netspectre read arbitrary memory over network"
    - "obladi oblivious serializable transactions in the cloud"
    - "loophole timing attacks on shared event loops in chrome"
    - "robust and efficient elimination of cache and timing side channels"
    - "drama exploiting dram addressing for cross cpu attacks"
    - "k fingerprinting a robust scalable website fingerprinting technique"
    - "deterministically deterring timing attacks in deterland"

Connected through hyperedge HE-3 (induced by source paper "an operational approach to information leakage"):
  with members:
    - "estimation efficiency under privacy constraints"
    - "technical privacy metrics a systematic survey"
    - "measuring secrecy by the probability of a successful guess"
    - "principal inertia components and applications"
    - "privacy utility tradeoffs under constrained data release mechanisms"
    - "hypothesis testing under maximal leakage privacy constraints"
    - "a large deviations approach to secure lossy compression"
    - "hiding the rumor source"

Connected through hyperedge HE-4 (induced by source paper "securing real time internet of things"):
  with members:
    - "contego an adaptive framework for integrating security tasks in real time systems"
    - "exploring opportunistic execution for integrating security into legacy hard real time systems"
    - "internet of things iot a vision architectural elements and future directions"

Connected through hyperedge HE-5 (induced by source paper "a novel side channel in real time schedulers"):
  with members:
    - "quantifying the information leakage in timing side channels in deterministic work conserving schedulers"

Connected through hyperedge HE-6 (induced by source paper "measuring secrecy by the probability of a successful guess"):
  with members:
    - "a large deviations approach to secure lossy compression"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "rate distortion theory for secrecy systems"
    - "improved rate equivocation regions for secure cooperative communication"
    - "lossless compression with security constraints"
    - "anonymous networking amidst eavesdroppers"
    - "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels"

Connected through hyperedge HE-7 (induced by source paper "loophole timing attacks on shared event loops in chrome"):
  with members:
    - "rowhammer js a remote software induced fault attack in javascript"

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