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 "optimal permutation codes and the kendall s τ metric"):
  Abstract: The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on $n$ elements, $S_n$, using the Kendall's $\tau$-metric. We will consider either optimal codes such as perfect codes or concepts related to optimal codes. We prove that there are no perfect single-error-correcting codes in $S_n$, where $n>4$ is a prime or $4\leq n\leq 10$. We also prove that if such a code exists for $n$ which is not a prime then the code should have some uniform structure. We consider optimal anticodes and diameter perfect codes in $S_n$. As a consequence we obtain a new upper bound on the size of a code in $S_n$ with even minimum Kendall's $\tau$-distance. We define some variations of the Kendall's $\tau$-metric and consider the related codes. Specifically, we present perfect single-error-correcting codes in $S_5$ for these variations. Furthermore, using these variations we present larger codes than the known ones in $S_5$ and $S_7$ with the Kendall's $\tau$-metric. These codes have a large automorphism group.

Includes members:
  Member "an upper bound on the number of circular transpositions to sort a permutation":
    also connected through other hyperedges:
      (none)
  Member "product constructions for perfect lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "50 years of the golomb welch conjecture")

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)