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 "comparison of lz77 type parsings"):
  Abstract: We investigate the relations between different variants of the LZ77 parsing existing in the literature. All of them are defined as greedily constructed parsings encoding each phrase by reference to a string occurring earlier in the input. They differ by the phrase encodings: encoded by pairs (length + position of an earlier occurrence) or by triples (length + position of an earlier occurrence + the letter following the earlier occurring part); and they differ by allowing or not allowing overlaps between the phrase and its earlier occurrence. For a given string of length $n$ over an alphabet of size $\sigma$, denote the numbers of phrases in the parsings allowing (resp., not allowing) overlaps by $z$ (resp., $\hat{z}$), for "pairs", and by $z_3$ (resp., $\hat{z}_3$), for "triples". We prove the following bounds and provide series of examples showing that these bounds are tight: #R##N#$\bullet$ $z \le \hat{z} \le z \cdot O(\log\frac{n}{z\log_\sigma z})$ and $z_3 \le \hat{z}_3 \le z_3 \cdot O(\log\frac{n}{z_3\log_\sigma z_3})$; #R##N#$\bullet$ $\frac{1}2\hat{z} < \hat{z}_3 \le \hat{z}$ and $\frac{1}2 z < z_3 \le z$.

Includes members:
  Member "at the roots of dictionary compression string attractors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards a definitive measure of repetitiveness")
  Member "relations between greedy and bit optimal lz77 encodings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lempel ziv like parsing in small space")
  Member "optimal time text indexing in bwt runs bounded space":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast indexes for gapped pattern matching")
  Member "a separation between run length slps and lz77":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the approximation ratio of greedy parsings")
  Member "on the size of lempel ziv and lyndon factorizations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lyndon words versus inverse lyndon words queries on suffixes and bordered words")
  Member "approximation of grammar based compression via recompression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on string constraint solving")
  Member "pattern matching in lempel ziv compressed strings fast simple and deterministic":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal time dictionary compressed indexes")

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)