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: "coding schemes for achieving strong secrecy at negligible cost"
  Abstract: We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without secrecy constraints. Specifically, we propose and analyze two source-channel coding architectures, in which secrecy is achieved by multiplexing public and confidential messages. In both cases, our main contribution is to show that secrecy can be achieved without compromising communication rate and by requiring only randomness of asymptotically vanishing rate. Our first source-channel coding architecture relies on a modified wiretap channel code, in which randomization is performed using the output of a source code. In contrast, our second architecture relies on a standard wiretap code combined with a modified source code termed uniform compression code, in which a small shared secret seed is used to enhance the uniformity of the source code output. We carry out a detailed analysis of uniform compression codes and characterize the optimal size of the shared seed.

Connected through hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "empirical and strong coordination via soft covering with polar codes"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "an information theoretic approach to secret sharing"
    - "polar coding for secret key generation"

Connected through hyperedge HE-2 (induced by source paper "universal covertness for discrete memoryless sources"):
  with members:
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "achievability proof via output statistics of random binning"
    - "perfectly secure steganography capacity error exponents and code constructions"

Connected through hyperedge HE-3 (induced by source paper "r enyi resolvability and its applications to the wiretap channel"):
  with members:
    - "corrections to wyner s common information under r enyi divergence measures"
    - "exact channel synthesis"
    - "asymptotic coupling and its applications in information theory"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "analysis of remaining uncertainties and exponents under various conditional r e nyi entropies"
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "distributed simulation of continuous random variables"

Connected through hyperedge HE-4 (induced by source paper "polar coding for the broadcast channel with confidential messages and constrained randomization"):
  with members:
    - "polar codes for broadcast channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the general wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for secret key generation"
    - "on secure communication with constrained randomization"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-5 (induced by source paper "polar coding for the broadcast channel with confidential messages a random binning analogy"):
  with members:
    - "polar codes for broadcast channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar coding for secret key generation"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "on secure communication with constrained randomization"
    - "achievability proof via output statistics of random binning"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

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)