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 "improved lower bounds on the size of balls over permutations with the infinity metric"):
  Abstract: We study the size (or volume) of balls in the metric space of permutations, $S_n$, under the infinity metric. We focus on the regime of balls with radius $r = \rho \cdot (n\!-\!1)$, $\rho \in [0,1]$, i.e., a radius that is a constant fraction of the maximum possible distance. We provide new lower bounds on the size of such balls. These new lower bounds reduce the asymptotic gap to the known upper bounds to at most $0.029$ bits per symbol. Additionally, they imply an improved ball-packing bound for error-correcting codes, and an improved upper bound on the size of optimal covering codes.

Includes members:
  Member "proof of a conjecture of klove on permutation codes under the chebychev distance":
    also connected through other hyperedges:
      (none)
  Member "limited magnitude error correcting gray codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "compression in the space of permutations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "new bounds for permutation codes in ulam metric":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new theoretical bounds and constructions of permutation codes under block permutation metric")
  Member "the bethe permanent of a nonnegative matrix":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gauges loops and polynomials for partition functions of graphical models")
  Member "systematic error correcting codes for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "systematic codes for rank modulation":
    also connected through other hyperedges:
      (none)
  Member "error correction in flash memories via codes in the ulam metric":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal constant weight codes under l_1 metric")

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)