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 ergodic capacity of phase fading interference networks"
  Abstract: We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a K user phase-fading interference network, i.e., an interference network where the fading process is restricted primarily to independent and uniform phase variations while the channel magnitudes are held fixed across time. It is shown that even though there are K(K-1) cross-links, only about K/2 disjoint and equal strength interference links suffice to determine the capacity of the network regardless of the strengths of the rest of the cross channels. This scenario is called a minimal bottleneck state. It is shown that ergodic interference alignment is capacity optimal for a network in a minimal bottleneck state. The results are applied to large networks. It is shown that large networks are close to bottleneck states with a high probability, so that ergodic interference alignment is close to optimal for large networks. Limitations of the notion of bottleneck states are also highlighted for channels where both the phase and the magnitudes vary with time. It is shown through an example that for these channels, joint coding across different bottleneck states makes it possible to circumvent the capacity bottlenecks.

Connected through hyperedge HE-1 (induced by source paper "on cooperation and interference in the weak interference regime full version with detailed proofs"):
  with members:
    - "cooperation for interference management a gdof perspective"
    - "diversity multiplexing tradeoff for the interference channel with a relay"
    - "incremental relaying for the gaussian interference channel with a degraded broadcasting relay"
    - "capacity theorems for the fading interference channel with a relay and feedback links"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-2 (induced by source paper "control data separation across edge and cloud for uplink communications in c ran"):
  with members:
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "inter layer per mobile optimization of cloud mobile computing a message passing approach"
    - "distributed rate adaptation and power control in fading multiple access channels"

Connected through hyperedge HE-3 (induced by source paper "on the scaling of interference alignment under delay and power constraints"):
  with members:
    - "channel diversity needed for vector space interference alignment"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "n k user interference channels degrees of freedom"
    - "ergodic interference alignment"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "topological interference management through index coding"):
  with members:
    - "cognitive wyner networks with clustered decoding"
    - "optimality of orthogonal access for one dimensional convex cellular networks"
    - "degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "degrees of freedom of mimo x networks spatial scale invariance one sided decomposability and linear feasibility"
    - "degrees of freedom of interference channels with comp transmission and reception"

Connected through hyperedge HE-5 (induced by source paper "on the optimality of treating interference as noise for k user parallel gaussian interference networks"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the optimality of treating interference as noise"
    - "wireless network information flow a deterministic approach"
    - "ergodic fading interference channels sum capacity and separability"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "sum capacity and the unique separability of the parallel gaussian mac z bc network"
    - "on the capacity of the k user cyclic gaussian interference channel"

Connected through hyperedge HE-6 (induced by source paper "topological interference management with alternating connectivity"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "topological interference management through index coding"
    - "interference networks with no csit impact of topology"
    - "index coding an interference alignment perspective"
    - "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity"
    - "on the synergistic benefits of alternating csit for the miso bc"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"
    - "degrees of freedom region for the mimo x channel"

Connected through hyperedge HE-7 (induced by source paper "estimation in phase shift and forward wireless sensor networks"):
  with members:
    - "phase only analog encoding for a multi antenna fusion center"
    - "on scaling laws of diversity schemes in decentralized estimation"
    - "distributed detection over fading macs with multiple antennas at the fusion center"
    - "universal distributed estimation over multiple access channels with constant modulus signaling"
    - "optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming"
    - "estimation diversity and energy efficiency in distributed sensing"

Connected through hyperedge HE-8 (induced by source paper "degrees of freedom for mimo two way x relay channel"):
  with members:
    - "linear precoding designs for amplify and forward multiuser two way relay systems"
    - "an optimal coding strategy for the binary multi way relay channel"
    - "the multi way relay channel"
    - "physical layer network coding"
    - "interference alignment and the degrees of freedom for the k user interference channel"

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)