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: "joint source channel secrecy using uncoded schemes towards secure source broadcast"
  Abstract: This paper investigates joint source-channel secrecy for secure source broadcast in Shannon cipher system. We use a list secrecy to measure secrecy, in which an wiretapper is allowed to produce a list of reconstruction sequences and the secrecy is measured by the minimum distortion over the entire list. For discrete source case, we propose a permutation-based uncoded scheme, which cascades a random permutation with a symbol-by-symbol mapping. Using this scheme, we derive an inner bound for the admissible region of secret key rate, list rate, wiretapper distortion, and distortions of legitimate users. For the converse part, we provide an outer bound for the admissible region. Comparing the outer bound with the inner bound shows that the proposed scheme is optimal under certain conditions. Besides, we also extend the proposed scheme to the scalar and vector Gaussian communication scenarios. Furthermore, for these two cases, we also propose another uncoded scheme, orthogonal-transform-based scheme, which achieves the same inner bounds as the one achieved by the permutation-based scheme. Interestingly, by adding the random permutation or the random orthogonal transform operation into the traditional uncoded scheme, the proposed uncoded schemes, on one hand, provide a certain level of secrecy, and on the other hand, do not lose any performance in terms of the distortions for legitimate users.

Connected through hyperedge HE-1 (induced by source paper "source channel secrecy for shannon cipher system"):
  with members:
    - "joint source channel secrecy using hybrid coding"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "information spectrum approach to the source channel separation theorem"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "transmitting an analog gaussian source over a gaussian wiretap channel under snr mismatch"

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)