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 "noncoherent interference alignment trade signal power for diversity towards multiplexing"):
  Abstract: This paper proposes the first known universal interference alignment scheme for general $(1\times{}1)^K$ interference networks, either Gaussian or deterministic, with only 2 symbol extension. While interference alignment is theoretically powerful to increase the total network throughput tremendously, no existing scheme can achieve the degree of freedom upper bound exactly with finite complexity. This paper starts with detailed analysis of the diagonality problem of naive symbol extension in small $(1\times1)^3$ networks, a technique widely regarded as necessary to achieve interference alignment with insufficient diversity. Then, a joint bandpass noncoherent demodulation and interference alignment scheme is proposed to solve the diagonality problem by trading signal power for increased system diversity, which is further traded for multiplexing improvement. Finally, the proposed noncoherent interference alignment scheme is extended to general $(1\times{}1)^K$ cases and is proven to achieve the degree of freedom upper bound exactly. Simulation results verify the correctness and powerfulness of the proposed scheme and show significant degree of freedom improvement compared to the conventional orthogonal transmission scheme.

Includes members:
  Member "on the degrees of freedom of the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "real interference alignment exploiting the potential of single antenna systems")
  Member "interference alignment with limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "opportunistic downlink interference alignment for multi cell mimo networks")
  Member "ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)