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: "multi stage robust chinese remainder theorem"
  Abstract: It is well-known that the traditional Chinese remainder theorem (CRT) is not robust in the sense that a small error in a remainder may cause a large reconstruction error. A robust CRT was recently proposed for a special case when the greatest common divisor (gcd) of all the moduli is more than 1 and the remaining integers factorized by the gcd are co-prime. It basically says that the reconstruction error is upper bounded by the remainder error level tau if tau is smaller than a quarter of the gcd of all the moduli. In this paper, we consider the robust reconstruction problem for a general set of moduli. We first present a necessary and sufficient condition on the remainder errors with a general set of moduli and also a corresponding robust reconstruction method. This can be thought of as a single-stage robust CRT. We then propose a two-stage robust CRT by grouping the moduli into several groups as follows. First, the single-stage robust CRT is applied to each group. Then, with these robust reconstructions from all the groups, the single-stage robust CRT is applied again across the groups. This is easily generalized to multi-stage robust CRT. With this two-stage robust CRT, the robust reconstruction holds even when the remainder error level tau is above the quarter of the gcd of all the moduli, and an algorithm on how to group a set of moduli for a better reconstruction robustness is proposed in some special cases.

Connected through hyperedge HE-1 (induced by source paper "exact and robust reconstruction of integer vectors based on multidimensional chinese remainder theorem md crt"):
  with members:
    - "on solving ambiguity resolution with robust chinese remainder theorem for multiple numbers"
    - "towards robustness in residue number systems"
    - "selecting wavelengths for least squares range estimation"
    - "a robust generalized chinese remainder theorem for two integers"
    - "on solving a generalized chinese remainder theorem in the presence of remainder errors"

Connected through hyperedge HE-2 (induced by source paper "on solving ambiguity resolution with robust chinese remainder theorem for multiple numbers"):
  with members:
    - "towards robustness in residue number systems"
    - "performance of ml range estimator in radio interferometric positioning systems"

Connected through hyperedge HE-3 (induced by source paper "robustness in chinese remainder theorem"):
  with members:
    - "towards robustness in residue number systems"
    - "a robust generalized chinese remainder theorem for two integers"
    - "on solving a generalized chinese remainder theorem in the presence of remainder errors"

Connected through hyperedge HE-4 (induced by source paper "towards robustness in residue number systems"):
  with members:
    - "on solving a generalized chinese remainder theorem in the presence of remainder errors"
    - "error correction in polynomial remainder codes with non pairwise coprime moduli and robust chinese remainder theorem for polynomials"

Connected through hyperedge HE-5 (induced by source paper "selecting wavelengths for least squares range estimation"):
  with members:
    - "finding a closest point in a lattice of voronoi s first kind"

Connected through hyperedge HE-6 (induced by source paper "a robust generalized chinese remainder theorem for two integers"):
  with members:
    - "performance of ml range estimator in radio interferometric positioning systems"
    - "on solving a generalized chinese remainder theorem in the presence of remainder errors"
    - "cryptanalyzing a class of image encryption schemes based on chinese remainder theorem"

Connected through hyperedge HE-7 (induced by source paper "on solving a generalized chinese remainder theorem in the presence of remainder errors"):
  with members:
    - "on the algorithmic significance and analysis of the method of dayan deriving one"
    - "fast arithmetics using chinese remaindering"

Connected through hyperedge HE-8 (induced by source paper "error correction in polynomial remainder codes with non pairwise coprime moduli and robust chinese remainder theorem for polynomials"):
  with members:
    - "on polynomial remainder codes"
    - "on the joint error and erasure decoding for irreducible polynomial remainder codes"

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)