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 "variable length non overlapping codes"):
  Abstract: We define a variable-length code having the property that no (non-empty) prefix of each its codeword is a suffix of any other one, and vice versa. This kind of code can be seen as an extension of two well-known codes in literature, called respectively fix-free code and non-overlapping code. In this paper, some constructive algorithms for such codes are presented as well as numerical results about their cardinality.

Includes members:
  Member "a gray code for cross bifix free sets":
    also connected through other hyperedges:
      (none)
  Member "non overlapping matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "construction of non expandable non overlapping sets of pictures")
  Member "dna based storage trends and methods":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the art of dna strings sixteen years of dna coding theory")
  Member "non overlapping codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mutually uncorrelated codes for dna storage")
  Member "a rewritable random access dna based storage system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "cross bifix free codes within a constant factor of optimality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mutually uncorrelated codes for dna storage")
  Member "a new approach to cross bifix free sets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mutually uncorrelated codes for dna storage")

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)