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: "capacity of a class of symmetric simo gaussian interference channels within o 1"
  Abstract: The N+1 user, 1 x N single input multiple output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has N antennas is studied. The symmetric capacity within O(1) is characterized for the symmetric case where all direct links have the same signal-to-noise ratio (SNR) and all undesired links have the same interference-to-noise ratio (INR). The gap to the exact capacity is a constant which is independent of SNR and INR. To get this result, we first generalize the deterministic interference channel introduced by El Gamal and Costa to model interference channels with multiple antennas. We derive the capacity region of this deterministic interference channel. Based on the insights provided by the deterministic channel, we characterize the generalized degrees of freedom (GDOF) of Gaussian case, which directly leads to the O(1) capacity approximation. On the achievability side, an interesting conclusion is that the generalized degrees of freedom (GDOF) regime where treating interference as noise is found to be optimal in the 2 user interference channel, does not appear in the N+1 user, 1 x N SIMO case. On the converse side, new multi-user outer bounds emerge out of this work that do not follow directly from the 2 user case. In addition to the GDOF region, the outer bounds identify a strong interference regime where the capacity region is established.

Connected through hyperedge HE-1 (induced by source paper "on the performance of optimized dense device to device wireless networks"):
  with members:
    - "on the optimality of treating interference as noise"
    - "improved capacity approximations for gaussian relay networks"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "capacity scaling of wireless ad hoc networks shannon meets maxwell"
    - "compute and forward harnessing interference through structured codes"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "on information theoretic scaling laws for wireless networks"

Connected through hyperedge HE-2 (induced by source paper "on interference networks over finite fields"):
  with members:
    - "two hop interference channels impact of linear schemes"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "two hop interference channels impact of linear time varying schemes"
    - "on the capacity of the finite field counterparts of wireless interference networks"
    - "structured lattice codes for some two user gaussian networks with cognition coordination and two hops"
    - "the awgn red alert problem"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-3 (induced by source paper "two unicast two hop interference network finite field model"):
  with members:
    - "on interference networks over finite fields"
    - "structured lattice codes for some two user gaussian networks with cognition coordination and two hops"
    - "wireless network information flow a deterministic approach"
    - "compute and forward harnessing interference through structured codes"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-4 (induced by source paper "structured lattice codes for 2 times 2 times 2 mimo interference channel"):
  with members:
    - "compute and forward harnessing interference through structured codes"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "capacity of linear two hop mesh networks with rate splitting decode and forward relaying and cooperation"

Connected through hyperedge HE-5 (induced by source paper "a reconfigurable distributed algorithm for k user mimo interference networks"):
  with members:
    - "interference alignment a one sided approach"
    - "cooperative algorithms for mimo interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "linear transceiver design for interference alignment complexity and computation"
    - "on feasibility of interference alignment in mimo interference networks"
    - "degrees of freedom of the k user m times n mimo interference channel"

Connected through hyperedge HE-6 (induced by source paper "interference decoding for deterministic channels"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "lecture notes on network information theory"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on the sum capacity of a class of cyclically symmetric deterministic interference channels"
    - "compute and forward harnessing interference through structured codes"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-7 (induced by source paper "on the generalized degrees of freedom of the k user symmetric mimo gaussian interference channel"):
  with members:
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "the generalized degrees of freedom of the mimo interference channel"
    - "interference alignment for the k user mimo interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"
    - "degrees of freedom of the k user m times n mimo interference channel"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "on the capacity and generalized degrees of freedom of the x channel"

Connected through hyperedge HE-8 (induced by source paper "the generalized degrees of freedom region of the mimo interference channel"):
  with members:
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"
    - "on degrees of freedom region of mimo networks without csit"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

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)