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 "topolines topological smoothing for line charts"):
  Abstract: Line charts are commonly used to visualize a series of data samples. When the data are noisy, smoothing is applied to make the signal more apparent. However, the difference between signal and noise is ill-defined, as it depends upon the application domain of the data. Common methods used to smooth line charts, such as rank filters, convolutional filters, frequency domain filters, and subsampling, optimize on various properties of the data. However, these methods are only ideal in certain limited scenarios. We present TopoLines, a method for smoothing line charts by leveraging techniques from Topological Data Analysis. The design goal of TopoLines is to smooth line charts while maintaining prominent peaks, as defined by persistent homology, in the data. We compare TopoLines to 5 popular line smoothing methods using data from 4 application domains. We evaluate TopoLines in terms of $l^2$-norm of the residual as the simplification threshold is varied, and we perform a user study to evaluate users' perception of the accuracy of TopoLines.

Includes members:
  Member "at a glance pixel approximate entropy as a measure of line chart complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "what do people see in a twenty second glimpse of bivariate vector field visualizations")
  Member "the topology toolkit":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "progressive wasserstein barycenters of persistence diagrams")
  Member "task based effectiveness of basic visualizations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "viznet towards a large scale visualization learning and benchmarking repository")

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.GR(Graphics)