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: "quantifying the information leakage in timing side channels in deterministic work conserving schedulers"
  Abstract: When multiple job processes are served by a single scheduler, the queueing delays of one process are often affected by the others, resulting in a timing side channel that leaks the arrival pattern of one process to the others. In this work, we study such a timing side channel between a regular user and a malicious attacker. Utilizing Shannon's mutual information as a measure of information leakage between the user and attacker, we analyze privacy-preserving behaviors of common work-conserving schedulers. We find that the attacker can always learn perfectly the user's arrival process in a longest-queue-first (LQF) scheduler. When the user's job arrival rate is very low (near zero), first-come-first-serve (FCFS) and round robin schedulers both completely reveal the user's arrival pattern. The near-complete information leakage in the low-rate traffic region is proven to be reduced by half in a work-conserving version of TDMA (WC-TDMA) scheduler, which turns out to be privacy-optimal in the class of deterministic-working-conserving (det-WC) schedulers, according to a universal lower bound on information leakage we derive for all det-WC schedulers.

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"
    - "mitigating timing side channel in shared 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"
    - "mitigating timing side channel in shared schedulers"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "a novel side channel in real time schedulers"):
  with members:
    - "mitigating timing side channel in shared schedulers"

Connected through hyperedge HE-4 (induced by source paper "a covert queueing channel in fcfs schedulers"):
  with members:
    - "a covert queueing channel in round robin schedulers"
    - "covert communications on renewal packet channels"
    - "covert bits through queues"
    - "covert communications on poisson packet channels"

Connected through hyperedge HE-5 (induced by source paper "covert bits through queues"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "effective secrecy reliability confusion and stealth"

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.IT(Information Theory)