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 reduction over imaginary quadratic fields"
  Abstract: In this work, we extend the celebrated Lenstra-Lenstra-Lov\'asz (LLL) reduction from over real bases to over complex bases. The complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. We first analyze properties of these algebraic lattices, and then construct a general algebraic LLL reduction algorithm for them. Properties and implementations of the algorithm are examined. In particular, satisfying Lov\'asz's condition requires the ring to be Euclidean. As an application, we use the algebraic LLL algorithm to find the network coding matrix in compute-and-forward. Such lattice reduction-based approaches have low complexity which is not dictated by the signal-to-noise (SNR) ratio. Moreover, such approaches can not only preserve the degree-of-freedom of computation rates, but ensure the independence in the code space as well.

Connected through hyperedge HE-1 (induced by source paper "optimal space time block code designs based on irreducible polynomials of degree two"):
  with members:
    - "lattice index codes from algebraic number fields"

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)