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: "on the role of side information in strategic communication"
  Abstract: This paper analyzes the fundamental limits of strate- gic communication in network settings. Strategic communication differs from the conventional communication paradigms in in- formation theory since it involves different objectives for the encoder and the decoder, which are aware of this mismatch and act accordingly. This leads to a Stackelberg game where both agents commit to their mappings ex-ante. Building on our prior work on the point-to-point setting, this paper studies the compression and communication problems with the receiver and/or transmitter side information setting. The equilibrium strategies and associated costs are characterized for the Gaussian variables with quadratic cost functions. Several questions on the benefit of side information in source and joint source-channel coding in such strategic settings are analyzed. Our analysis has uncovered an interesting result on optimality of uncoded mappings in strategic source-channel coding in networks.

Connected through hyperedge HE-1 (induced by source paper "strategic communication with side information at the decoder"):
  with members:
    - "strong coordination of signals and actions over noisy channels with two sided state information"
    - "persuasion with limited communication capacity"
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "information theoretic approach to strategic communication as a hierarchical game"
    - "persuasion with limited communication"
    - "algorithmic bayesian persuasion"
    - "empirical coordination with two sided state information and correlated source and state"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"

Connected through hyperedge HE-2 (induced by source paper "information design for strategic coordination of autonomous devices with non aligned utilities"):
  with members:
    - "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"
    - "hybrid codes needed for coordination over the point to point channel"

Connected through hyperedge HE-3 (induced by source paper "information theoretic approach to strategic communication as a hierarchical game"):
  with members:
    - "privacy constrained information processing"
    - "estimation with strategic sensors"
    - "on zero delay source channel coding"

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)