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 "an efficient algorithm for designing optimal crcs for tail biting convolutional codes"):
  Abstract: This paper proposes an efficient algorithm for designing the distance-spectrum-optimal (DSO) cyclic redundancy check (CRC) polynomial for a given tail-biting convolutional code (TBCC). Lou et al. proposed DSO CRC design methodology for a given zero-terminated convolutional code (ZTCC), in which the fundamental design principle is to maximize the minimum distance at which an undetectable error event of ZTCC first occurs. This paper applies the same principle to design the DSO CRC for a given TBCC. Our algorithm is based on partitioning the tail-biting trellis into several disjoint sets of tail-biting paths that are closed under cyclic shifts. This paper shows that the tail-biting path in each set can be constructed by concatenating the irreducible error events and/or circularly shifting the resultant path. This motivates an efficient collection algorithm that aims at gathering irreducible error events, and a search algorithm that reconstructs the full list of error events in the order of increasing distance, which can be used to find the DSO CRC for a given TBCC.

Includes members:
  Member "efficient error correcting codes in the short blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "convolutional code specific crc code design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "crc selection for decoding of crc polar concatenated codes")

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)