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 multiplex network coding"
  Abstract: In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent messages to be kept secret from an eavesdropper. The proposed scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the secure network coding.

Connected through hyperedge HE-1 (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"
    - "secure multi source multicast"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "universal secure multiplex network coding with dependent and non uniform messages"):
  with members:
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "a numerical study on the wiretap network with a simple network topology"
    - "universal secure network coding via rank metric codes"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "strong secrecy from channel resolvability"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-3 (induced by source paper "relative generalized rank weight of linear codes and its applications to network coding"):
  with members:
    - "generalized rank weights a duality statement"
    - "new parameters of linear codes expressing security performance of universal secure network coding"
    - "universal secure network coding via rank metric codes"
    - "vulnerability of mrd code based universal secure network coding against stronger eavesdroppers"
    - "secure network coding for wiretap networks of type ii"
    - "on metrics for error correction in network coding"
    - "mds codes on the erasure erasure wiretap channel"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-4 (induced by source paper "secure multiplex coding over interference channel with confidential messages"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "strong security and separated code constructions for the broadcast channels with confidential messages"
    - "interference channels with strong secrecy"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure multiplex coding to attain the channel capacity in wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "new parameters of linear codes expressing security performance of universal secure network coding"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "secure network coding for wiretap networks of type ii"
    - "on metrics for error correction in network coding"
    - "mds codes on the erasure erasure wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "universal strongly secure network coding with dependent and non uniform messages"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "secure network coding for wiretap networks of type ii"
    - "on wiretap networks ii"
    - "secure multiplex coding to attain the channel capacity in wiretap channels"

Connected through hyperedge HE-7 (induced by source paper "universally attainable error and information exponents and equivocation rate for the broadcast channels with confidential messages"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "strong security and separated code constructions for the broadcast channels with confidential messages"
    - "on the compound mimo broadcast channels with confidential messages"
    - "general non asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire tap channel"

Connected through hyperedge HE-8 (induced by source paper "secure multiplex coding with a common message"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "universally attainable error and information exponents and equivocation rate for the broadcast channels with confidential messages"
    - "strong security and separated code constructions for the broadcast channels with confidential messages"
    - "secure multiplex coding to attain the channel capacity in wiretap channels"

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)