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 coding to attain the channel capacity in wiretap channels"
  Abstract: It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_S$, which is usually smaller than the channel capacity $C$. In order to remove the loss $C - C_S$, we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multiplex coding scheme can attain the channel capacity as the total rate of the plural messages and the perfect secrecy for each message. The coding theorem is proved by extending Hayashi's proof, in which the coding of the channel resolvability is applied to wiretap channels.

Connected through hyperedge HE-1 (induced by source paper "secure multiplex coding with dependent and non uniform multiple messages"):
  with members:
    - "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secure multiplex coding with a common message"
    - "universal strongly secure network coding with dependent and non uniform messages"
    - "universally attainable error and information exponents and equivocation rate for the broadcast channels with confidential messages"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "construction of wiretap codes from ordinary channel codes"

Connected through hyperedge HE-2 (induced by source paper "broadcast channels with confidential messages by randomness constrained stochastic encoder"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "on secure communication with constrained randomization"
    - "wiretap channels implications of the more capable condition and cyclic shift symmetry"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "capacity results for relay channels with confidential messages"
    - "3 receiver broadcast channels with common and confidential messages"
    - "capacity regions of two new classes of 2 receiver broadcast channels"

Connected through hyperedge HE-3 (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"
    - "secure multiplex network coding"
    - "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"

Connected through hyperedge HE-4 (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 multiplex network coding"
    - "secure network coding for wiretap networks of type ii"
    - "on wiretap networks ii"

Connected through hyperedge HE-5 (induced by source paper "secure multiplex network coding"):
  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"
    - "vulnerability of mrd code based universal secure network coding against stronger eavesdroppers"
    - "on wiretap networks ii"

Connected through hyperedge HE-6 (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"
    - "secure multiplex network coding"
    - "strong security and separated code constructions for the broadcast channels with confidential messages"

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)