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: "phase precoded compute and forward with partial feedback"
  Abstract: In this work, we propose phase precoding for the compute-and-forward (CoF) protocol. We derive the phase precoded computation rate and show that it is greater than the original computation rate of CoF protocol without precoder. To maximize the phase precoded computation rate, we need to 'jointly' find the optimum phase precoding matrix and the corresponding network equation coefficients. This is a mixed integer programming problem where the optimum precoders should be obtained at the transmitters and the network equation coefficients have to be computed at the relays. To solve this problem, we introduce phase precoded CoF with partial feedback. It is a quantized precoding system where the relay jointly computes both a quasi-optimal precoder from a finite codebook and the corresponding network equations. The index of the obtained phase precoder within the codebook will then be fedback to the transmitters. A "deep hole phase precoder" is presented as an example of such a scheme. We further simulate our scheme with a lattice code carved out of the Gosset lattice and show that significant coding gains can be obtained in terms of equation error performance.

Connected through hyperedge HE-1 (induced by source paper "compute compress and forward exploiting asymmetry of wireless relay networks"):
  with members:
    - "asymmetric compute and forward with csit"
    - "mimo multiway relaying with clustered full data exchange signal space alignment and degrees of freedom"
    - "towards the asymptotic sum capacity of the mimo cellular two way relay channel"
    - "phase precoding for the compute and forward protocol"
    - "mimo multiway relaying with pairwise data exchange a degrees of freedom perspective"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "degrees of freedom for the mimo multi way relay channel"
    - "an algebraic approach to physical layer network coding"

Connected through hyperedge HE-2 (induced by source paper "robust successive compute and forward over multi user multi relay networks"):
  with members:
    - "full diversity unitary precoded integer forcing"
    - "compute and forward finding the best equation"
    - "lattices from codes for harnessing interference an overview and generalizations"
    - "compute and forward two way relaying"
    - "compute and forward on a multi user multi relay channel"
    - "successive integer forcing and its sum rate optimality"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "convolutional network coded cooperation in multi source networks with a multi antenna relay"

Connected through hyperedge HE-3 (induced by source paper "mobile lattice coded physical layer network coding with practical channel alignment"):
  with members:
    - "reliable physical layer network coding supporting real applications"
    - "asynchronous convolutional coded physical layer network coding"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "scalable synchronization and reciprocity calibration for distributed multiuser mimo"
    - "network coded multiple access"
    - "airsync enabling distributed multiuser mimo with full spatial multiplexing"
    - "the degrees of freedom of compute and forward"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-4 (induced by source paper "encoding and indexing of lattice codes"):
  with members:
    - "connections between construction d and related constructions of lattices"
    - "an algebraic approach to physical layer network coding"
    - "turbo lattices construction and error decoding performance"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

Connected through hyperedge HE-5 (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"
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "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-6 (induced by source paper "full diversity unitary precoded integer forcing"):
  with members:
    - "phase precoding for the compute and forward protocol"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "diversity of mimo linear precoding"
    - "integer forcing linear receivers"
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"

Connected through hyperedge HE-7 (induced by source paper "structured compute and forward with phase precoding scheme beyond integers"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "compute and forward for the interference channel diversity precoding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward harnessing interference through structured codes"
    - "capacity of symmetric k user gaussian very strong interference channels"

Connected through hyperedge HE-8 (induced by source paper "phase precoding for the compute and forward protocol"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "lattices over eisenstein integers for compute and forward"
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "computation alignment capacity approximation without noise accumulation"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"

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)