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: "zero error shift correcting and shift detecting codes"
  Abstract: Motivated by communication scenarios such as timing channels (in queuing systems, molecular communications, etc.) and bit-shift channels (in magnetic recording systems), we study the error control problem in cases where the dominant type of noise are symbol shifts. In particular, two channel models are introduced and their zero-error capacities determined by an explicit construction of optimal zero-error codes. Model A can be informally described as follows: 1) The information is stored in an n-cell register, where each cell can either be left empty, or can contain a particle of one of P possible types, and 2) due to the imperfections of the device every particle is shifted k cells away from its original position over time, where k is drawn from a certain range of integers, without the possibility of reordering particles. Model B is an abstraction of a singleserver queue: 1) The transmitter sends symbols/packets from a P -ary alphabet through a queuing system with an infinite buffer, and 2) each packet is being processed by the server for a number of time slots k ∈ {0, 1, . . . ,K}. Several variations of the above models are also discussed, e.g., with multiple particles per cell, with additional types of noise, and the continuous-time case. The models are somewhat atypical due to the fact that the length of the channel output in general differs from that of the corresponding input, and that this length depends on the noise (shift) pattern as well as on the input itself. This will require the notions of a zero-error code and the zero-error capacity, as introduced by Shannon, to be generalized.

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)