human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "joint coordination channel coding for strong coordination over noisy channels based on polar codes"):
  Abstract: We construct a joint coordination-channel polar coding scheme for strong coordination of actions between two agents X and Y, which communicate over a discrete memoryless channel (DMC) such that the joint distribution of actions follows a prescribed probability distribution. We show that polar codes are able to achieve our previously established inner bound to the strong noisy coordination capacity region and thus provide a constructive alternative to a random coding proof. Our polar coding scheme also offers a constructive solution to a channel simulation problem where a DMC and shared randomness are together employed to simulate another DMC. In particular, our proposed solution is able to utilize the randomness of the DMC to reduce the amount of local randomness required to generate the sequence of actions at agent Y. By leveraging our earlier random coding results for this problem, we conclude that the proposed joint coordination-channel coding scheme strictly outperforms a separate scheme in terms of achievable communication rate for the same amount of injected randomness into both systems.

Includes members:
  Member "strong coordination of signals and actions over noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "empirical coordination subject to a fidelity criterion")
  Member "strong coordination over noisy channels is separation sufficient":
    also connected through other hyperedges:
      (none)
  Member "empirical and strong coordination via soft covering with polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar coding for empirical coordination of signals and actions over noisy channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coordination through shared randomness")
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes simplicity random codes durability")
  Member "strong coordination over multi hop line networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal communication rates and combinatorial properties for distributed simulation")
  Member "asymmetric error correction and flash memory rewriting using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a new coding paradigm for the primitive relay channel")
  Member "polar coding for the broadcast channel with confidential messages a random binning analogy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

Question: Please tell me which class the source paper 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)