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: "lattice index coding"
  Abstract: The index coding problem involves a sender with    $K$    messages to be transmitted across a broadcast channel, and a set of receivers each of which demands a subset of the    $K$    messages while having a prior knowledge of a different subset as side information. We consider the specific case of noisy index coding where the broadcast channel is Gaussian and every receiver demands all the messages from the source. Instances of this communication problem arise in wireless relay networks, sensor networks, and retransmissions in broadcast channels. We construct lattice index codes for this channel by encoding the    $K$    messages individually using    $K$    modulo lattice constellations and transmitting their sum modulo a coarse lattice. We introduce a design metric called side information gain that measures the advantage of a code in utilizing the side information at the receivers, and hence, its goodness as an index code. Based on the Chinese remainder theorem, we then construct lattice index codes with large side information gains using lattices over the following principal ideal domains: 1) rational integers; 2) Gaussian integers; 3) Eisenstein integers; and 4) Hurwitz quaternions. Among all lattice index codes constructed using any densest lattice of a given dimension, our codes achieve the maximum side information gain. Finally, using an example, we illustrate how the proposed lattice index codes can benefit Gaussian broadcast channels with more general message demands.

Connected through hyperedge HE-1 (induced by source paper "cache aided modulation for heterogeneous coded caching over a gaussian broadcast channel"):
  with members:
    - "device to device coded caching with distinct cache sizes"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the optimality of uncoded cache placement"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-2 (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-3 (induced by source paper "layered space time index coding"):
  with members:
    - "golden coded index coding"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "index coded psk modulation"
    - "optimal coding schemes for the three receiver awgn broadcast channel with receiver message side information"
    - "lattice index codes from algebraic number fields"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "fundamental limits of caching"
    - "broadcast capacity region of two phase bidirectional relaying"

Connected through hyperedge HE-4 (induced by source paper "on the design of multi dimensional irregular repeat accumulate lattice codes"):
  with members:
    - "leech constellations of construction a lattices"
    - "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions"
    - "construction of full diversity ldpc lattices for block fading channels"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattice index codes from algebraic number fields"
    - "lattices over eisenstein integers for compute and forward"
    - "low density lattice codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "golden coded index coding"):
  with members:
    - "wireless caching technical misconceptions and business barriers"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "fundamental limits of caching in wireless d2d networks"
    - "fundamental limits of caching"
    - "golden space time trellis coded modulation"

Connected through hyperedge HE-6 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information"):
  with members:
    - "capacity of coded index modulation"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "a lattice approach for optimal rate diverse wireless network coding"
    - "index coding with coded side information"
    - "lattice index codes from algebraic number fields"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "the capacity of three receiver awgn broadcast channels with receiver message side information"
    - "achieving awgn channel capacity with lattice gaussian coding"

Connected through hyperedge HE-7 (induced by source paper "lattice index codes from algebraic number fields"):
  with members:
    - "capacity of coded index modulation"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "construction pi_a and pi_d lattices construction goodness and decoding algorithms"
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "the capacity of three receiver awgn broadcast channels with receiver message side information"
    - "fundamental limits of caching"

Connected through hyperedge HE-8 (induced by source paper "optimal rate diverse wireless network coding"):
  with members:
    - "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information"
    - "on index coding in noisy broadcast channels with receiver message side information"
    - "wireless network coding via modified 802 11 mac phy design and implementation on sdr"
    - "compute and forward harnessing interference through structured codes"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "low density lattice codes"

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)