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: "throughput region of spatially correlated interference packet networks"
  Abstract: In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for packet retransmission. Conventional random access protocols interrupt communication to resolve contention which reduces network throughput and increases latency and power consumption. In this work we take a different approach and we develop opportunistic random access protocols rather than pursuing conventional methods. We allow wireless nodes to communicate without interruption and to observe the interference pattern. We then use this interference pattern knowledge and channel statistics to counter the negative impact of interference. The result of our approach is better use of resources (e.g., time and energy) and higher network throughput. We prove the optimality of our protocols using an extremal rank-ratio inequality. An important part of our contributions is the integration of spatial correlation in our assumptions and results. We identify spatial correlation regimes in which inherently outdated feedback becomes as good as idealized instantaneous feedback, and correlation regimes in which feedback does not provide any throughput gain.

Connected through hyperedge HE-1 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback"):
  with members:
    - "capacity region of erasure broadcast channels with common message and feedback"
    - "two user erasure interference channels with local delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "topological interference management with alternating connectivity"
    - "wireless network information flow a deterministic approach"
    - "interference channels with rate limited feedback"

Connected through hyperedge HE-2 (induced by source paper "on the degrees of freedom of two unicast wireless networks with delayed csit"):
  with members:
    - "two user erasure interference channels with local delayed csit"
    - "alignment based network coding for two unicast z networks"
    - "informational bottlenecks in two unicast wireless networks with delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "wireless network information flow a deterministic approach"
    - "two unicast information flows over linear deterministic networks"
    - "multiple unicast capacity of 2 source 2 sink networks"

Connected through hyperedge HE-3 (induced by source paper "capacity results for finite field x channels with delayed csit"):
  with members:
    - "two user erasure interference channels with local delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "topological interference management with alternating connectivity"
    - "interference channels with rate limited feedback"
    - "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)