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: "finding a closest point in a lattice of voronoi s first kind"
  Abstract: We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice vectors that converges to a closest lattice point is found. We show that the series converges after at most $n$ terms. Each vector in the series can be efficiently computed in $O(n^3)$ operations using an algorithm to compute a minimum cut in an undirected flow network.

Connected through hyperedge HE-1 (induced by source paper "deciding whether a lattice has an orthonormal basis is in co np"):
  with members:
    - "deciding orthogonality in construction a lattices"
    - "on the lattice isomorphism problem"

Connected through hyperedge HE-2 (induced by source paper "on compact representations of voronoi cells of lattices"):
  with members:
    - "just take the average an embarrassingly simple 2 n time algorithm for svp and cvp"
    - "short paths on the voronoi graph and the closest vector problem with preprocessing"

Connected through hyperedge HE-3 (induced by source paper "lattice based locality sensitive hashing is optimal"):
  with members:
    - "tight lower bounds for data dependent locality sensitive hashing"
    - "solving the closest vector problem in 2 n time the discrete gaussian strikes again"
    - "short paths on the voronoi graph and the closest vector problem with preprocessing"
    - "optimal lower bounds for locality sensitive hashing except when q is tiny"

Connected through hyperedge HE-4 (induced by source paper "selecting wavelengths for least squares range estimation"):
  with members:
    - "multi stage robust chinese remainder theorem"

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)