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: "on prefix normal words"
  Abstract: We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length k, no factor of length k has more a's than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contained in the language of pre-necklaces, which are prefixes of powers of Lyndon words. We discuss further properties and state open problems.

Connected through hyperedge HE-1 (induced by source paper "generating a gray code for prefix normal words in amortized polylogarithmic time per word"):
  with members:
    - "on collapsing prefix normal words"
    - "bubble flip a new generation algorithm for prefix normal words"
    - "on prefix normal words and prefix normal forms"
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "on hardness of jumbled indexing"
    - "new algorithms for binary jumbled pattern matching"

Connected through hyperedge HE-2 (induced by source paper "on collapsing prefix normal words"):
  with members:
    - "bubble flip a new generation algorithm for prefix normal words"
    - "on prefix normal words and prefix normal forms"
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-3 (induced by source paper "on prefix normal words and prefix normal forms"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "indexes for jumbled pattern matching in strings trees and graphs"
    - "binary jumbled string matching for highly run length compressible texts"
    - "binary jumbled pattern matching on trees and tree like structures"

Connected through hyperedge HE-4 (induced by source paper "bubble flip a new generation algorithm for prefix normal words"):
  with members:
    - "on prefix normal words and prefix normal forms"
    - "clustered integer 3sum via additive combinatorics"
    - "on combinatorial generation of prefix normal words"
    - "normal abby normal prefix normal"
    - "on hardness of jumbled indexing"
    - "new algorithms for binary jumbled pattern matching"
    - "binary jumbled pattern matching on trees and tree like structures"
    - "algorithms for jumbled pattern matching in strings"

Connected through hyperedge HE-5 (induced by source paper "normal abby normal prefix normal"):
  with members:
    - "on combinatorial generation of prefix normal words"
    - "binary jumbled pattern matching via all pairs shortest paths"
    - "new algorithms for binary jumbled pattern matching"
    - "indexes for jumbled pattern matching in strings trees and graphs"
    - "binary jumbled string matching for highly run length compressible texts"
    - "binary jumbled pattern matching on trees and tree like structures"

Connected through hyperedge HE-6 (induced by source paper "on combinatorial generation of prefix normal words"):
  with members:
    - "new algorithms for binary jumbled pattern matching"
    - "indexes for jumbled pattern matching in strings trees and graphs"
    - "binary jumbled string matching for highly run length compressible texts"
    - "binary jumbled pattern matching on trees and tree like structures"

Connected through hyperedge HE-7 (induced by source paper "binary jumbled string matching for highly run length compressible texts"):
  with members:
    - "algorithms for jumbled pattern matching in strings"

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.FL(Formal Languages and Automata Theory)