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 "on the symmetric feedback capacity of the k user cyclic interference channel"):
  Abstract: The K-user cyclic interference channel models a situation in which the kth transmitter causes interference only to the (k − 1)mod(K)th receiver. The impact of noiseless feedback on the capacity of this channel is studied by focusing on the linear shift deterministic cyclic interference channel (LD-CIC). For the case of symmetric channel parameters, the symmetric feedback capacity is characterized for all interference regimes. It is shown that the symmetric feedback capacity is in general a function of K, the number of users. Furthermore, the capacity gain obtained due to feedback decreases as K increases.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "dependence balance based outer bounds for gaussian networks with cooperation and feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint state sensing and communication over memoryless multiple access channels")
  Member "on the sum capacity of k user cascade gaussian z interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels")
  Member "k user interference channels general outer bound and sum capacity for certain gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels")
  Member "feedback capacity of the gaussian interference channel to within 2 bits":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity limits of full duplex cellular network")
  Member "on the capacity of the k user cyclic gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the optimality of treating inter cell interference as noise in uplink cellular networks")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)