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: "sum capacity of interference channels with a local view impact of distributed decisions"
  Abstract: Due to the large size of wireless networks, it is often impractical for nodes to track changes in the complete network state. As a result, nodes have to make distributed decisions about their transmission and reception parameters based on their local view of the network. In this paper, we characterize the impact of distributed decisions on the global network performance in terms of achievable sum rates. We first formalize the concept of local view by proposing a protocol abstraction using the concept of local message passing. In the proposed protocol, nodes forward information about the network state to other neighboring nodes, thereby allowing network-state information to trickle to all the nodes. The protocol proceeds in rounds, where all transmitters send a message followed by a message by all receivers. The number of rounds then provides a natural metric to quantify the extent of local information at each node. We next study two network connectivities, Z-channel, and a three-user double Z-channel. In each case, we characterize achievable sum rate with partial message passing leading to two main results. First, in many cases, nodes can make distributed decisions with only local information about the network and can still achieve the same sum capacity as can be attained with global information irrespective of the actual channel gains. We label such schemes as universally optimal. Second, for the case of three-user double Z-channel, we show that universal optimality is not achievable if the per node information is below a threshold. In fact, distributed decisions can lead to unbounded losses compared to full information case for some channel gains.

Connected through hyperedge HE-1 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "achievable dof regions of mimo networks with imperfect csit"
    - "on the degrees of freedom of the k user distributed broadcast channel"
    - "degrees of freedom of the two user mimo broadcast channel with private and common messages under hybrid csit models"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "completely stale transmitter channel state information is still very useful"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-2 (induced by source paper "leveraging physical layer capabilites distributed scheduling in interference networks with local views"):
  with members:
    - "topological interference management through index coding"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "on the capacity of multi hop wireless networks with partial network knowledge"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "local multicoloring algorithms computing a nearly optimal tdma schedule in constant time"
    - "distributed link scheduling with constant overhead"

Connected through hyperedge HE-3 (induced by source paper "degrees of freedom of certain interference alignment schemes with distributed csit"):
  with members:
    - "csit sharing over finite capacity backhaul for spatial interference alignment"
    - "interference alignment with quantized grassmannian feedback in the k user constant mimo interference channel"
    - "interference alignment with incomplete csit sharing"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "geometry of the 3 user mimo interference channel"
    - "on the capacity of memoryless finite state multiple access channels with asymmetric state information at the encoders"
    - "cooperative algorithms for mimo interference channels"
    - "downlink interference alignment"

Connected through hyperedge HE-4 (induced by source paper "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"):
  with members:
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "fundamental limits of cooperation"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "multi user mimo with outdated csi training feedback and scheduling"
    - "interference channels with rate limited feedback"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "interference networks with no csit impact of topology"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "topological interference management through index coding"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "degrees of freedom of two hop wireless networks everyone gets the entire cake"
    - "elements of cellular blind interference alignment aligned frequency reuse wireless index coding and interference diversity"
    - "dynamic interference mitigation for generalized partially connected quasi static mimo interference channel"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "interference cooperation and connectivity a degrees of freedom perspective"

Connected through hyperedge HE-6 (induced by source paper "wireless network coding with local network views coded layer scheduling"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "completely stale transmitter channel state information is still very useful"
    - "retrospective interference alignment"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "on the capacity of multi hop wireless networks with partial network knowledge"
    - "interference alignment with analog channel state feedback"

Connected through hyperedge HE-7 (induced by source paper "two user interference channels with local views on capacity regions of tdm dominating policies"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "a coordinate system for gaussian networks"
    - "aiming perfectly in the dark blind interference alignment through staggered antenna switching"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "an axiomatic theory of fairness in network resource allocation"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

Connected through hyperedge HE-8 (induced by source paper "on achieving local view capacity via maximal independent graph scheduling"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "distributed universally optimal strategies for interference channels with partial message passing"
    - "the two user gaussian compound 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)