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 "cohomologous harmonic cochains"):
  Abstract: We describe algorithms for finding harmonic cochains, an essential ingredient for solving elliptic partial differential equations in exterior calculus. Harmonic cochains are also useful in computational topology and computer graphics. We focus on finding harmonic cochains cohomologous to a given cocycle. Amongst other things, this allows localization near topological features of interest. We derive a weighted least squares method by proving a discrete Hodge-deRham theorem on the isomorphism between the space of harmonic cochains and cohomology. The solution obtained either satisfies the Whitney form finite element exterior calculus equations or the discrete exterior calculus equations for harmonic cochains, depending on the discrete Hodge star used.

Includes members:
  Member "pydec software and algorithms for discretization of exterior calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "numerical experiments for darcy flow on a surface using mixed exterior calculus methods")
  Member "least squares ranking on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ranking a set of objects a graph based least square approach")
  Member "approaching optimality for solving sdd systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving linear programs with sqrt rank linear system solves")
  Member "well centered triangulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vorocrust voronoi meshing without clipping")
  Member "geometric and combinatorial properties of well centered triangulations in three and higher dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "well centered triangulation")
  Member "triangulation of simple 3d shapes with well centered tetrahedra":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "well centered triangulation")
  Member "nearly linear time algorithms for preconditioning and solving symmetric diagonally dominant linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "speeding up linear programming using randomized linear algebra")
  Member "nearly linear time algorithms for graph partitioning graph sparsification and solving linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "compressive sensing for cut improvement and local clustering")

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.CG(Computational Geometry)