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: "cross bifix free codes within a constant factor of optimality"
  Abstract: A cross-bifix-free code is a set of words in which no prefix of any length of any word is the suffix of any word in the set. Cross-bifix-free codes arise in the study of distributed sequences for frame synchronization. We provide a new construction of cross-bifix-free codes which generalizes the construction in Bajic (2007) to longer code lengths and to any alphabet size. The codes are shown to be nearly optimal in size. We also establish new results on Fibonacci sequences, that are used in estimating the size of the cross-bifix-free codes.

Connected through hyperedge HE-1 (induced by source paper "mutually uncorrelated codes for dna storage"):
  with members:
    - "codes correcting a burst of deletions or insertions"
    - "non overlapping codes"
    - "a rewritable random access dna based storage system"
    - "time space constrained codes for phase change memories"
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-2 (induced by source paper "a gray code for cross bifix free sets"):
  with members:
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-3 (induced by source paper "variable length non overlapping codes"):
  with members:
    - "a gray code for cross bifix free sets"
    - "non overlapping matrices"
    - "dna based storage trends and methods"
    - "non overlapping codes"
    - "a rewritable random access dna based storage system"
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-4 (induced by source paper "non overlapping matrices"):
  with members:
    - "non overlapping codes"
    - "cross bifix free sets in two dimensions"
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-5 (induced by source paper "construction of non expandable non overlapping sets of pictures"):
  with members:
    - "non overlapping matrices"
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-6 (induced by source paper "non overlapping codes"):
  with members:
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-7 (induced by source paper "cross bifix free sets in two dimensions"):
  with members:
    - "a new approach to cross bifix free sets"

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)