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: "multistage compute and forward with multilevel lattice codes based on product constructions"
  Abstract: A novel construction of lattices is proposed. This construction can be thought of as Construction A with codes that can be represented as the Cartesian product of $L$ linear codes over $\mathbb{F}_{p_1},\ldots,\mathbb{F}_{p_L}$, respectively; hence, is referred to as the product construction. The existence of a sequence of such lattices that are good for quantization and Poltyrev-good under multistage decoding is shown. This family of lattices is then used to generate a sequence of nested lattice codes which allows one to achieve the same computation rate of Nazer and Gastpar for compute-and-forward under multistage decoding, which is referred to as lattice-based multistage compute-and-forward. #R##N#Motivated by the proposed lattice codes, two families of signal constellations are then proposed for the separation-based compute-and-forward framework proposed by Tunali \textit{et al.} together with a multilevel coding/multistage decoding scheme tailored specifically for these constellations. This scheme is termed separation-based multistage compute-and-forward and is shown having a complexity of the channel coding dominated by the greatest common divisor of the constellation size (may not be a prime number) instead of the constellation size itself.

Connected through hyperedge HE-1 (induced by source paper "construction pi_a and pi_d lattices construction goodness and decoding algorithms"):
  with members:
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "polar lattices for lossy compression"
    - "construction of capacity achieving lattice codes polar lattices"
    - "lattices from codes for harnessing interference an overview and generalizations"
    - "lattices over eisenstein integers for compute and forward"
    - "connections between construction d and related constructions of lattices"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"

Connected through hyperedge HE-2 (induced by source paper "adaptive compute and forward with lattice codes over algebraic integers"):
  with members:
    - "construction pi_a and pi_d lattices construction goodness and decoding algorithms"
    - "lattice index codes from algebraic number fields"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "phase precoded compute and forward with partial feedback"
    - "lattices from codes for harnessing interference an overview and generalizations"
    - "lattices over eisenstein integers for compute and forward"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "multilevel coding schemes for compute and forward with flexible decoding"

Connected through hyperedge HE-3 (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"
    - "lattice index coding"
    - "construction pi_a and pi_d lattices construction goodness and decoding algorithms"
    - "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-4 (induced by source paper "lattice index coding"):
  with members:
    - "capacity of coded index modulation"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "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"
    - "index coding via linear programming"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "a multilevel framework for lattice network coding"):
  with members:
    - "communication over finite chain ring matrix channels"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (induced by source paper "lattices from codes for harnessing interference an overview and generalizations"):
  with members:
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "phase precoded compute and forward with partial feedback"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-7 (induced by source paper "asynchronous physical layer network coding with quasi cyclic codes"):
  with members:
    - "asynchronous convolutional coded physical layer network coding"
    - "an algebraic approach to physical layer network coding"
    - "asynchronous physical layer network coding"
    - "joint ldpc and physical layer network coding for asynchronous bi directional relaying"
    - "reliable physical layer network coding"
    - "integer forcing linear receivers"
    - "cyclic coded integer forcing equalization"
    - "channel coding and decoding in a relay system operated with physical layer network coding"

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)