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: "empirical and strong coordination via soft covering with polar codes"
  Abstract: We design polar codes for empirical coordination and strong coordination in two-node networks. Our constructions hinge on the fact that polar codes enable explicit low-complexity schemes for soft covering. We leverage this property to propose explicit and low-complexity coding schemes that achieve the capacity regions of both empirical coordination and strong coordination for sequences of actions taking value in an alphabet of prime cardinality. Our results improve previously known polar coding schemes, which (i) were restricted to uniform distributions and to actions obtained via binary symmetric channels for strong coordination, (ii) required a non-negligible amount of common randomness for empirical coordination, and (iii) assumed that the simulation of discrete memoryless channels could be perfectly implemented. As a by-product of our results, we obtain a polar coding scheme that achieves channel resolvability for an arbitrary discrete memoryless channel whose input alphabet has prime cardinality.

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"
    - "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"
    - "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 "physical layer security for rf satellite channels in the finite length regime"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "free space optical channel estimation for physical layer security"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "information theoretic physical layer security for satellite channels"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "joint power control in wiretap interference channels"
    - "secrecy analysis on network coding in bidirectional multibeam satellite communications"

Connected through hyperedge HE-3 (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"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "secure cascade channel synthesis"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "correlation between channel state and information source with empirical coordination constraint"

Connected through hyperedge HE-4 (induced by source paper "joint coordination channel coding for strong coordination over noisy channels based on polar codes"):
  with members:
    - "strong coordination of signals and actions over noisy channels"
    - "strong coordination over noisy channels is separation sufficient"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "polar codes for broadcast channels"
    - "strong coordination over multi hop line networks"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "strong coordination over a line network"

Connected through hyperedge HE-5 (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"
    - "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"

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)