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: "an achievable rate region for the broadcast wiretap channel with asymmetric side information"
  Abstract: The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as follows. First, an achievable rate region is provided for the (general) case of discrete-input discrete-output channels, generalizing existing results. Second, the obtained theorem is used to derive achievable transmission rates for two practical cases of Gaussian channels. It is shown that known perturbations can enlarge the rate region of broadcast wiretap channels with side information and having side information at the decoder as well can increase the secrecy rate of channels with side information. Third, we establish for the first time an explicit connection between multiuser channels and observation structures in dynamic games. In this respect, we show how to exploit the proved achievability theorem (discrete case) to derive a communication-compatible upper bound on the minmax level of a player.

Connected through hyperedge HE-1 (induced by source paper "information design for strategic coordination of autonomous devices with non aligned utilities"):
  with members:
    - "on the role of side information in strategic communication"
    - "empirical and strong coordination via soft covering with polar codes"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "coordination in distributed networks via coded actions with application to power control"
    - "empirical coordination with two sided state information and correlated source and state"
    - "empirical coordination with channel feedback and strictly causal or causal encoding"
    - "correlation between channel state and information source with empirical coordination constraint"
    - "rate distortion theory for secrecy systems"

Connected through hyperedge HE-2 (induced by source paper "empirical coordination with two sided state information and correlated source and state"):
  with members:
    - "coordination in distributed networks via coded actions with application to power control"
    - "empirical coordination with channel feedback and strictly causal or causal encoding"
    - "joint empirical coordination of source and channel"
    - "coded power control performance analysis"
    - "correlation between channel state and information source with empirical coordination constraint"
    - "causal state communication"
    - "strong coordination with polar codes"
    - "hybrid codes needed for coordination over the point to point channel"

Connected through hyperedge HE-3 (induced by source paper "empirical coordination with channel feedback and strictly causal or causal encoding"):
  with members:
    - "coordination in distributed networks via coded actions with application to power control"
    - "empirical coordination with two sided state information and correlated source and state"
    - "correlation between channel state and information source with empirical coordination constraint"
    - "empirical coordination in a triangular multiterminal network"
    - "strong coordination with polar codes"
    - "hybrid codes needed for coordination over the point to point channel"
    - "coordination using implicit communication"

Connected through hyperedge HE-4 (induced by source paper "joint empirical coordination of source and channel"):
  with members:
    - "strong coordination of signals and actions over noisy channels"
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "coordination in distributed networks via coded actions with application to power control"
    - "secure cascade channel synthesis"
    - "strong coordination over multi hop line networks"
    - "zero error coordination"
    - "empirical coordination with two sided state information and correlated source and state"

Connected through hyperedge HE-5 (induced by source paper "empirical coordination for joint source channel coding"):
  with members:
    - "coordination in distributed networks via coded actions with application to power control"
    - "secure cascade channel synthesis"
    - "strong coordination over multi hop line networks"
    - "zero error coordination"
    - "coordination in state dependent distributed networks the two agent case"
    - "coded power control performance analysis"
    - "correlation between channel state and information source with empirical coordination constraint"
    - "strong coordination over a line network"

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)