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: "interference alignment in dense wireless networks"
  Abstract: We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer bounds for the $n\times n$-dimensional unicast and the $n\times 2^n$-dimensional multicast capacity regions of such a wireless network. These inner and outer bounds differ only by a factor $O(\log(n))$, yielding a fairly tight scaling characterization of the entire regions. The communication schemes achieving the inner bounds use interference alignment as a central technique and are, at least conceptually, surprisingly simple.

Connected through hyperedge HE-1 (induced by source paper "ad hoc networking with cost effective infrastructure generalized capacity scaling"):
  with members:
    - "scaling laws for infrastructure single and multihop wireless networks in wideband regimes"
    - "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks"
    - "parallel opportunistic routing in wireless networks"
    - "improved capacity scaling in wireless networks with infrastructure"
    - "the balanced unicast and multicast capacity regions of large wireless networks"
    - "on capacity scaling in arbitrary wireless networks"
    - "information theoretic operating regimes of large wireless networks"

Connected through hyperedge HE-2 (induced by source paper "capacity of multiple unicast in wireless networks a polymatroidal approach"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "wireless network information flow a deterministic approach"
    - "computation alignment capacity approximation without noise accumulation"
    - "the degrees of freedom of the 2 hop 2 user interference channel with feedback"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"

Connected through hyperedge HE-3 (induced by source paper "computation alignment capacity approximation without noise accumulation"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "an algebraic approach to physical layer network coding"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "the degrees of freedom of compute and forward"
    - "nested lattice codes for gaussian relay networks with interference"
    - "two unicast wireless networks characterizing the degrees of freedom"
    - "multiple unicast capacity of 2 source 2 sink networks"

Connected through hyperedge HE-4 (induced by source paper "interference mitigation in large random wireless networks"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "boolean compressed sensing and noisy group testing"
    - "wireless network information flow a deterministic approach"
    - "interference alignment based sum capacity bounds for random dense gaussian interference networks"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "neighbor discovery for wireless networks via compressed sensing"
    - "delay rate tradeoff for ergodic interference alignment in the gaussian case"
    - "asymptotic sum capacity of random gaussian interference networks using interference alignment"

Connected through hyperedge HE-5 (induced by source paper "the approximate capacity of the gaussian n relay diamond network"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on the capacity of the half duplex diamond channel"
    - "the balanced unicast and multicast capacity regions of large wireless networks"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "on capacity scaling in arbitrary wireless networks"
    - "a new achievable rate for the gaussian parallel relay channel"
    - "capacity of a class of diamond channels"
    - "on the capacity of the diamond half duplex relay channel"

Connected through hyperedge HE-6 (induced by source paper "ergodic interference alignment"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "delay rate tradeoff in ergodic interference alignment"
    - "the ergodic capacity of phase fading interference networks"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "interference alignment based sum capacity bounds for random dense gaussian interference networks"
    - "ergodic fading interference channels sum capacity and separability"

Connected through hyperedge HE-7 (induced by source paper "on secrecy capacity scaling in wireless networks"):
  with members:
    - "interference alignment for secrecy"
    - "on capacity scaling in arbitrary wireless networks"
    - "ergodic interference alignment"
    - "the secrecy graph and some of its properties"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

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)