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: "a unified algorithm for accelerating edit distance computation via text compression"
  Abstract: We present a unified framework for accelerating edit-distance computation between two compressible strings using straight-line programs. For two strings of total length $N$ having straight-line program representations of total size $n$, we provide an algorithm running in $O(n^{1.4}N^{1.2})$ time for computing the edit-distance of these two strings under any rational scoring function, and an $O(n^{1.34}N^{1.34})$ time algorithm for arbitrary scoring functions. This improves on a recent algorithm of Tiskin that runs in $O(nN^{1.5})$ time, and works only for rational scoring functions. Also, in the last part of the paper, we show how the classical four-russians technique can be incorporated into our SLP edit-distance scheme, giving us a simple $\Omega(\lg N)$ speed-up in the case of arbitrary scoring functions, for any pair of strings.

Connected through hyperedge HE-1 (induced by source paper "scalable partial least squares regression on grammar compressed data matrices"):
  with members:
    - "compact q gram profiling of compressed strings"
    - "feature hashing for large scale multitask learning"
    - "b bit minwise hashing"

Connected through hyperedge HE-2 (induced by source paper "improved esp index a practical self index for highly repetitive texts"):
  with members:
    - "on compressing permutations and adaptive sorting"
    - "improved grammar based compressed indexes"
    - "fast q gram mining on slp compressed strings"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-3 (induced by source paper "fully online grammar compression in constant space"):
  with members:
    - "a succinct grammar compression"
    - "fast q gram mining on slp compressed strings"

Connected through hyperedge HE-4 (induced by source paper "efficient lz78 factorization of grammar compressed text"):
  with members:
    - "speeding up q gram mining on grammar based compressed texts"
    - "lyndon words and short superstrings"
    - "a bijective string sorting transform"
    - "fast q gram mining on slp compressed strings"
    - "tying up the loose ends in fully lzw compressed pattern matching"
    - "pattern matching in lempel ziv compressed strings fast simple and deterministic"
    - "faster fully compressed pattern matching by recompression"
    - "random access to grammar compressed strings"

Connected through hyperedge HE-5 (induced by source paper "speeding up q gram mining on grammar based compressed texts"):
  with members:
    - "fast q gram mining on slp compressed strings"
    - "pattern matching in lempel ziv compressed strings fast simple and deterministic"

Connected through hyperedge HE-6 (induced by source paper "computing q gram non overlapping frequencies on slp compressed texts"):
  with members:
    - "fast q gram mining on slp compressed strings"
    - "random access to grammar compressed strings"

Connected through hyperedge HE-7 (induced by source paper "unified compression based acceleration of edit distance computation"):
  with members:
    - "faster subsequence recognition in compressed strings"
    - "semi local string comparison algorithmic techniques and applications"
    - "fast and compact regular expression matching"

Connected through hyperedge HE-8 (induced by source paper "random access to grammar compressed strings"):
  with members:
    - "identifying hierarchical structure in sequences a linear time algorithm"

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.CC(Computational Complexity)