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: "wireless network information flow a deterministic approach"
  Abstract: In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach. First, we propose a deterministic channel model which captures the key wireless properties of signal strength, broadcast and superposition. We obtain an exact characterization of the capacity of a network with nodes connected by such deterministic channels. This result is a natural generalization of the celebrated max-flow min-cut theorem for wired networks. Second, we use the insights obtained from the deterministic analysis to design a new quantize-map-and-forward scheme for Gaussian networks. In this scheme, each relay quantizes the received signal at the noise level and maps it to a random Gaussian codeword for forwarding, and the final destination decodes the source's message based on the received signal. We show that, in contrast to existing schemes, this scheme can achieve the cut-set upper bound to within a gap which is independent of the channel parameters. In the case of the relay channel with a single relay as well as the two-relay Gaussian diamond network, the gap is 1 bit/s/Hz. Moreover, the scheme is universal in the sense that the relays need no knowledge of the values of the channel parameters to (approximately) achieve the rate supportable by the network. We also present extensions of the results to multicast networks, half-duplex networks, and ergodic networks.

Connected through hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks"):
  with members:
    - "efficiently finding simple schedules in gaussian half duplex relay line networks"
    - "on the optimality of simple schedules for networks with multiple half duplex relays"
    - "softnull many antenna full duplex wireless via digital beamforming"
    - "wireless communications with unmanned aerial vehicles opportunities and challenges"
    - "unmanned aerial vehicle with underlaid device to device communications performance and tradeoffs"
    - "wireless network simplification beyond diamond networks"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "gaussian half duplex relay networks improved constant gap and connections with the assignment problem"

Connected through hyperedge HE-2 (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"
    - "throughput region of spatially correlated interference packet networks"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "lattice coding for downlink multiuser transmission"):
  with members:
    - "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"
    - "optimal resource allocation for power efficient mc noma with imperfect channel state information"
    - "improved decoding and error floor analysis of staircase codes"
    - "performance analysis of a hybrid downlink uplink cooperative noma scheme"
    - "on non orthogonal multiple access with finite alphabet inputs in z channels"

Connected through hyperedge HE-4 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"):
  with members:
    - "on multi cell uplink downlink duality with treating inter cell interference as noise"
    - "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "opportunistic treating interference as noise"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"

Connected through hyperedge HE-5 (induced by source paper "on the optimality of treating inter cell interference as noise downlink cellular networks and uplink downlink duality"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "opportunistic treating interference as noise"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference networks"

Connected through hyperedge HE-6 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "achievable dof regions of mimo networks with imperfect csit"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"

Connected through hyperedge HE-7 (induced by source paper "two way function computation"):
  with members:
    - "two way interference channel capacity how to have the cake and eat it too"
    - "feedback through overhearing"
    - "capacity of a post channel with and without feedback"
    - "perfect output feedback in the two user decentralized interference channel"
    - "computation in multicast networks function alignment and converse theorems"
    - "two way interference channels"
    - "on network coding for sum networks"
    - "two way networks when adaptation is useless"

Connected through hyperedge HE-8 (induced by source paper "on the optimality of treating inter cell interference as noise in uplink cellular networks"):
  with members:
    - "on multi cell uplink downlink duality with treating inter cell interference as noise"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "opportunistic treating interference as noise"
    - "interference as noise friend or foe"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference 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)