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: "the feasibility of interference alignment over measured mimo ofdm channels"
  Abstract: Interference alignment (IA) has been shown to achieve the maximum achievable degrees of freedom in the interference channel. This results in sum rate scaling linearly with the number of users in the high signal-to-noise-ratio (SNR) regime. Linear scaling is achieved by precoding transmitted signals to align interference subspaces at the receivers, given channel knowledge of all transmit-receive pairs, effectively reducing the number of discernible interferers. The theory of IA was derived under assumptions about the richness of scattering in the propagation channel; practical channels do not guarantee such ideal characteristics. This paper presents the first experimental study of IA in measured multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) interference channels. Our measurement campaign includes a variety of indoor and outdoor measurement scenarios at The University of Texas at Austin. We show that IA achieves the claimed scaling factors, or degrees of freedom, in several measured channel settings for a 3 user, 2 antennas per node setup. In addition to verifying the claimed performance, we characterize the effect of Kronecker spatial correlation on sum rate and present two other correlation measures, which we show are more tightly related to the achieved sum rate.

Connected through hyperedge HE-1 (induced by source paper "delay rate tradeoff in ergodic interference alignment"):
  with members:
    - "the ergodic capacity of phase fading interference networks"
    - "interference alignment based sum capacity bounds for random dense gaussian interference networks"
    - "delay rate tradeoff for ergodic interference alignment in the gaussian case"
    - "asymptotic sum capacity of random gaussian interference networks using interference alignment"
    - "ergodic interference alignment"
    - "interference alignment for line of sight channels"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-2 (induced by source paper "mimo interference alignment over correlated channels with imperfect csi"):
  with members:
    - "cooperative algorithms for mimo interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "bit error rate is convex at high snr"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on the achievability of interference alignment in the k user constant mimo interference channel"
    - "opportunistic interference alignment in mimo interference channels"
    - "approaching the capacity of wireless networks through distributed interference alignment"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"

Connected through hyperedge HE-3 (induced by source paper "time interference alignment via delay offset for long delay networks"):
  with members:
    - "asynchronous interference alignment"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on feasibility of interference alignment in mimo interference networks"
    - "approaching the capacity of wireless networks through distributed interference alignment"
    - "interference alignment for line of sight channels"
    - "interference alignment on the deterministic channel and application to fully connected awgn interference networks"

Connected through hyperedge HE-4 (induced by source paper "receive diversity and ergodic performance of interference alignment on the mimo gaussian interference channel"):
  with members:
    - "on feasibility of interference alignment in mimo interference networks"
    - "mimo networks the effects of interference"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on the achievability of interference alignment in the k user constant mimo interference channel"
    - "the mimo iterative waterfilling algorithm"
    - "approaching the capacity of wireless networks through distributed interference alignment"
    - "degrees of freedom region for the mimo x channel"

Connected through hyperedge HE-5 (induced by source paper "asymptotic sum capacity of random gaussian interference networks using interference alignment"):
  with members:
    - "delay rate tradeoff in ergodic interference alignment"
    - "wireless network information flow a deterministic approach"
    - "interference alignment based sum capacity bounds for random dense gaussian interference networks"
    - "ergodic interference alignment"

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)