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 a random binning analogy"
  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 "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"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "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 "secure polar coding with delayed wiretapping information"):
  with members:
    - "secure polar coding for the two way wiretap channel"
    - "finite state markov wiretap channel with delayed feedback"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "secrecy results for compound wiretap channels"
    - "polar coding for secret key generation"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "secure polar coding for adversarial wiretap channel"):
  with members:
    - "polar coding for non stationary channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "polar coding for common message only wiretap broadcast channel"):
  with members:
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "universal polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"

Connected through hyperedge HE-5 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"):
  with members:
    - "secure massive mimo systems with limited rf chains"
    - "secure transmission with large numbers of antennas and finite alphabet inputs"
    - "probabilistically robust swipt for secrecy misome systems"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "full duplex bidirectional secure communications under perfect and distributionally ambiguous eavesdropper s csi"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "physical layer security aware routing and performance tradeoffs in ad hoc networks"
    - "hybrid procoder and combiner design for secure transmission in mmwave mimo systems"

Connected through hyperedge HE-6 (induced by source paper "strong coordination of signals and actions over noisy channels with two sided state information"):
  with members:
    - "persuasion with limited communication capacity"
    - "strong coordination of signals and actions over noisy channels"
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "joint coordination channel coding for strong coordination over noisy channels based on polar codes"
    - "empirical and strong coordination via soft covering with polar codes"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "secure cascade channel synthesis"
    - "correlation between channel state and information source with empirical coordination constraint"

Connected through hyperedge HE-7 (induced by source paper "a new coding paradigm for the primitive relay channel"):
  with members:
    - "capacity achieving rate compatible polar codes"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "capacity of a class of state dependent orthogonal relay channels"
    - "how to achieve the capacity of asymmetric channels"
    - "soft decoding based strategies for relay and interference channels analysis and achievable rates using ldpc codes"
    - "universal polar codes"
    - "wireless network information flow a deterministic approach"
    - "nested polar codes for wiretap and relay channels"

Connected through hyperedge HE-8 (induced by source paper "strong coordination over noisy channels with strictly causal encoding"):
  with members:
    - "strong coordination of signals and actions over noisy channels with two sided state information"
    - "polar codes for empirical coordination over noisy channels with strictly causal encoding"
    - "strong coordination of signals and actions over noisy channels"
    - "polar coding for secret key generation"
    - "simulation of a channel with another channel"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "hybrid codes needed for coordination over the point to point channel"

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)