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: "strong security and separated code constructions for the broadcast channels with confidential messages"
  Abstract: AbstractThe strong security criterion in the information theoretic security re-quires the mutual information between the secret information and the eaves-dropped information converges to zero as the code length goes to the inﬁnity,even when the mutual information is not divided by the code length, whilethe weak security criterion requires only the mutual information divided bythe code length converges to zero. The capacity region of the broadcastchannels with conﬁdential messages remains unknown when th e strong se-curity is required. We prove that the capacity region under the strong secu-rity criterion is the same as that under the weak one. Our proof techniqueattaches inverses of hash functions to a random coding argument for thebroadcast channel with degraded message sets, whose analysis on the de-coding error probability is carried over to our proof without change. Thus,our proof technique separates the analysis of secrecy from that of decod-ing error probability, and an advance in the upper bound on the decodingerror probability over the broadcast channels with degraded message setsautomatically also advances the decoding probability analysis of our prooftechnique.

Connected through hyperedge HE-1 (induced by source paper "plausible deniability over broadcast channels"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-2 (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"
    - "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-3 (induced by source paper "strong secrecy from channel resolvability"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strongly secure communications over the two way wiretap channel"
    - "capacity results for compound wiretap channels"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "strongly secure privacy amplification cannot be obtained by encoder of slepian wolf code"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

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