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: "covert channel detection using information theory"
  Abstract: This paper presents an information theory based detection framework for covert channels. We first show that the usual notion of interference does not characterize the notion of deliberate information flow of covert channels. We then show that even an enhanced notion of “iterated multivalued interference” can not capture flows with capacity lower than one bit of information per channel use. We then characterize and compute the capacity of covert channels that use control flows for a class of systems.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of covert packet insertion"):
  with members:
    - "covert communication over a k user multiple access channel"
    - "fundamental limits of invisible flow fingerprinting"
    - "fundamental limits of covert bit insertion in packets"
    - "privacy preserving mhealth data release with pattern consistency"
    - "covert capacity of non coherent rayleigh fading channels"
    - "towards provably invisible network flow fingerprints"
    - "covert wireless communication with artificial noise generation"
    - "covert communication over noisy channels a resolvability perspective"

Connected through hyperedge HE-2 (induced by source paper "covert channel detection framework for cloud using distributed machine learning"):
  with members:
    - "seeking black lining in cloud"
    - "determinating timing channels in compute clouds"

Connected through hyperedge HE-3 (induced by source paper "detection of information leakage in cloud"):
  with members:
    - "seeking black lining in cloud"

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)