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 "limited magnitude error correcting gray codes for rank modulation"):
  Abstract: We construct error-correcting codes over permutations under the infinity-metric, which are also Gray codes in the context of rank modulation, i.e., are generated as simple circuits in the rotator graph. These errors model limited-magnitude or spike errors, for which only single-error-detecting Gray codes are currently known. Surprisingly, the error-correcting codes we construct achieve a better asymptotic rate than that of presently known constructions not having the Gray property, and exceed the Gilbert-Varshamov bound. Additionally, we present efficient ranking and unranking procedures, as well as a decoding procedure that runs in linear time. Finally, we also apply our methods to solve an outstanding issue with error-detecting rank-modulation Gray codes (also known in this context as snake-in-the-box codes) under a different metric, the Kendall    $\tau $   -metric, in the group of permutations over an even number of elements    $S_{2n}$   , where we provide asymptotically optimal codes.

Includes members:
  Member "constructions of snake in the box codes under ell_ infty metric for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "improved lower bounds on the size of balls over permutations with the infinity metric":
    also connected through other hyperedges:
      (none)
  Member "snake in the box codes for rank modulation under kendall s tau metric":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new theoretical bounds and constructions of permutation codes under block permutation metric")
  Member "systematic error correcting codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "constructions of snake in the box codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "generalized gray codes for local rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constructions of snake in the box codes under ell_ infty metric for rank modulation")
  Member "snake in the box codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "constructions of rank modulation codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "infinity norm permutation covering codes from cyclic groups")

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)