human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "decoding in compute and forward relaying real lattices and the flatness of lattice sums"):
  Abstract: In a distributed communications scenario, a relay applying the compute-and-forward strategy for the real-valued channel model aims to decode an integer linear combination of transmitted messages, a task of very complex nature for which general efficient algorithms for dimension n > 1 have not yet been developed. Nonetheless, the maximum-likelihood decoding metric related to solving for the desired lattice point exhibits interesting properties which lead to partial design criteria for lattice codes in compute-and-forward. #R##N#This article generalizes maximum-likelihood decoding at the relay to allow for arbitrary real lattice codes at the transmitters, and studies the behavior of the resulting decoding metric using an approximation of the theta series of a lattice, which is itself derived in this article. For the first time, the resulting random sums of lattices over whose points the relay needs to perform a sum are analyzed and furthermore, previous related work is extended to the case of K > 2 transmitters. The specific cases K = 2 and K = 3 are studied empirically.

Includes members:
  Member "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "adaptive compute and forward with lattice codes over algebraic integers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure modulo sum via multiple access channel")
  Member "a low complexity message recovery method for compute and forward relaying":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "the compute and forward protocol implementation and practical aspects":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized compute compress and forward")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private information retrieval over gaussian mac")

Question: Please tell me which class the source paper 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)