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: "polar coding for the broadcast channel with confidential messages and constrained randomization"
  Abstract: We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform randomness in the stochastic encoder, and avoiding assumptions regarding the symmetry or degraded nature of the channels. The price paid for these extensions is that the encoder and decoders are required to share a secret seed of negligible size and to increase the block length through chaining. We also highlight a close conceptual connection between the proposed polar coding scheme and a random binning proof of the secrecy capacity region.

Connected through hyperedge HE-1 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "semantic security capacity for wiretap channels of type ii"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "secrecy results for compound wiretap channels"
    - "polar coding for secret key generation"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-2 (induced by source paper "hierarchical polar coding for achieving secrecy over fading wiretap channels without any instantaneous csi"):
  with members:
    - "polar coding for secure transmission in miso fading wiretap 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"
    - "polar coding for fading channels binary and exponential channel cases"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "on mmse properties of codes for the gaussian broadcast and wiretap channels"):
  with members:
    - "polynomial time semantically secure encryption achieving the secrecy capacity"
    - "mmse of bad codes"
    - "statistical physics of signal estimation in gaussian noise theory and examples of phase transitions"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "construction of wiretap codes from ordinary channel codes"
    - "the secrecy capacity of the mimo wiretap channel"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-4 (induced by source paper "polar coding for the general wiretap channel"):
  with members:
    - "polar codes for broadcast channels"
    - "polar codes for distributed hierarchical source coding"
    - "universal polar codes for more capable and less noisy channels and sources"
    - "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 interference networks"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "polar codes for the two user multiple access channel"

Connected through hyperedge HE-5 (induced by source paper "polar coding for secret key generation"):
  with members:
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "universal source polarization and an application to a multi user problem"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "secure biometrics concepts authentication architectures and challenges"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "strong coordination with polar codes"
    - "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

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)