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: "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"
  Abstract: For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network . We show that this discrete superposition network provides a near-optimal digital interface for operating a class consisting of many Gaussian networks in the sense that any code for the discrete superposition network can be naturally lifted to a corresponding code for the Gaussian network, while achieving a rate that is no more than a constant number of bits lesser than the rate it achieves for the discrete superposition network. This constant depends only on the number of nodes in the network and not on the channel gains or SNR. Moreover the capacities of the two networks are within a constant of each other, again independent of channel gains and SNR. We show that the class of Gaussian networks for which this interface property holds includes relay networks with a single source-destination pair, interference networks, multicast networks, and the counterparts of these networks with multiple transmit and receive antennas. The code for the Gaussian relay network can be obtained from any code for the discrete superposition network simply by pruning it. This lifting scheme establishes that the superposition model can indeed potentially serve as a strong surrogate for designing codes for Gaussian relay networks. We present similar results for the K ×K Gaussian interference network, MIMO Gaussian interference networks, MIMO Gaussian relay networks, and multicast networks, with the constant gap depending additionally on the number of antennas in case of MIMO networks.

Connected through hyperedge HE-1 (induced by source paper "on the optimality of treating interference as noise general message sets"):
  with members:
    - "on the optimality of treating interference as noise"
    - "wireless network information flow a deterministic approach"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-2 (induced by source paper "compress and forward scheme for relay networks backword decoding and connection to bisubmodular flows"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on the optimal compressions in the compress and forward relay schemes"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "combinatiorial algorithms for wireless information flow"

Connected through hyperedge HE-3 (induced by source paper "near optimal quantization and linear network coding for relay networks"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "expansion coding achieving the capacity of an aen channel"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "capacity of multiple unicast in wireless networks a polymatroidal approach"
    - "wireless network information flow a deterministic approach"
    - "low complexity near optimal codes for gaussian relay networks"
    - "binary error correcting network codes"
    - "approximately achieving gaussian relay network capacity with lattice codes"

Connected through hyperedge HE-4 (induced by source paper "capacity of multiple unicast in wireless networks a polymatroidal approach"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "wireless network information flow a deterministic approach"
    - "computation alignment capacity approximation without noise accumulation"
    - "the degrees of freedom of the 2 hop 2 user interference channel with feedback"
    - "completely stale transmitter channel state information is still very useful"

Connected through hyperedge HE-5 (induced by source paper "interference alignment from degrees of freedom to constant gap capacity approximations"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "wireless network information flow a deterministic approach"
    - "the degrees of freedom of compute and forward"
    - "interference alignment at finite snr for time invariant channels"
    - "completely stale transmitter channel state information is still very useful"
    - "retrospective interference alignment"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"

Connected through hyperedge HE-6 (induced by source paper "approximately optimal wireless broadcasting"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "algebraic network coding approach to deterministic wireless relay networks"
    - "noisy network coding"
    - "linear finite field deterministic networks with many sources and one destination"
    - "reciprocity in linear deterministic networks under linear coding"
    - "on approximating gaussian relay networks by deterministic networks"
    - "a combinatorial study of linear deterministic relay networks"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-7 (induced by source paper "approximately achieving gaussian relay network capacity with lattice codes"):
  with members:
    - "wireless network information flow a deterministic approach"

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)