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: "secure multi source multicast"
  Abstract: The principal mission of Multi-Source Multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In many of them, securing the messages disseminated is critical. A common secure model is to consider a network where there is an eavesdropper which is able to observe a subset of the network links, and seek a code which keeps the eavesdropper ignorant regarding all the messages. While this is solved when all messages are located at a single source, Secure MSM (SMSM) is an open problem, and the rates required are hard to characterize in general. In this paper, we consider Individual Security, which promises that the eavesdropper has zero mutual information with each message individually. We completely characterize the rate region for SMSM under individual security, and show that such a security level is achievable at the full capacity of the network, that is, the cut-set bound is the matching converse, similar to non-secure MSM. Moreover, we show that the field size is similar to non-secure MSM and does not have to be larger due to the security constraint.

Connected through hyperedge HE-1 (induced by source paper "secrecy rates for a channel with two senders and two receivers"):
  with members:
    - "energy efficient multicell multigroup multicasting with joint beamforming and antenna selection"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "strong secrecy for multiple access channels"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "multi receiver wiretap channel with public and confidential messages"

Connected through hyperedge HE-2 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes"):
  with members:
    - "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "coding across unicast sessions can increase the secure message capacity"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "coding against a limited view adversary the effect of causality and feedback"

Connected through hyperedge HE-3 (induced by source paper "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"):
  with members:
    - "secure network code for adaptive and active attacks with no randomness in intermediate nodes"
    - "universal construction of cheater identifiable secret sharing against rushing cheaters without honest majority"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "coding against a limited view adversary the effect of causality and feedback"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"

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)