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 precoding for the compute and forward protocol"
  Abstract: The compute-and-forward (CoF) is a relaying protocol, which uses algebraic structured codes to harness the interference and remove the noise in wireless networks. We propose the use of phase precoders at the transmitters of a network, where relays apply CoF strategy. We define the {\em phase precoded computation rate} and show that it is greater than the original computation rate of CoF protocol. We further give a new low-complexity method for finding network equations. We finally show that the proposed precoding scheme increases the degrees-of-freedom (DoF) of CoF protocol. This overcomes the limitations on the DoF of the CoF protocol, recently presented by Niesen and Whiting. Using tools from Diophantine approximation and algebraic geometry, we prove the existence of a phase precoder that approaches the maximum DoF when the number of transmitters tends to infinity.

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 precoded compute and forward with partial feedback"
    - "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 "efficient integer coefficient search for compute and forward"):
  with members:
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "a linearithmic time algorithm for a shortest vector problem in compute and forward design"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "compute and forward finding the best equation"
    - "an algebraic approach to physical layer network coding"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-3 (induced by source paper "a quadratic programming relaxation approach to compute and forward network coding design"):
  with members:
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "full diversity unitary precoded integer forcing"):
  with members:
    - "phase precoded compute and forward with partial feedback"
    - "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-5 (induced by source paper "phase precoded compute and forward with partial feedback"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "the degrees of freedom of compute and forward"
    - "physical layer network coding tutorial survey and beyond"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (induced by source paper "cooperative compute and forward"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "structured lattice codes for some two user gaussian networks with cognition coordination and two hops"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "asynchronous physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "a secure communication game with a relay helping the eavesdropper"
    - "wireless network information flow a deterministic approach"
    - "reliable 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)