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 "on geodesic triangles with right angles in a dually flat space"):
  Abstract: The dualistic structure of statistical manifolds in information geometry yields eight types of geodesic triangles passing through three given points, the triangle vertices. The interior angles of geodesic triangles can sum up to $\pi$ like in Euclidean/Mahalanobis flat geometry, or exhibit otherwise angle excesses or angle defects. In this paper, we initiate the study of geodesic triangles in dually flat spaces, termed Bregman manifolds, where a generalized Pythagorean theorem holds. We consider non-self dual Bregman manifolds since Mahalanobis self-dual manifolds amount to Euclidean geometry. First, we show how to construct geodesic triangles with either one, two, or three interior right angles, whenever it is possible. Second, we report a construction of triples of points for which the dual Pythagorean theorems hold simultaneously at a point, yielding two dual pairs of dual-type geodesics with right angles at that point.

Includes members:
  Member "on a convergence property of a geometrical algorithm for statistical manifolds":
    also connected through other hyperedges:
      (none)
  Member "an elementary introduction to information geometry":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the alpha divergences associated with a pair of strictly comparable quasi arithmetic means")
  Member "monte carlo information geometry the dually flat case":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the jensen shannon symmetrization of distances relying on abstract means")
  Member "topological data analysis with bregman divergences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "convergence of hierarchical clustering and persistent homology methods on directed networks")
  Member "cramer rao lower bound and information geometry":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an elementary introduction to information geometry")
  Member "the burbea rao and bhattacharyya centroids":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the alpha divergences associated with a pair of strictly comparable quasi arithmetic means")
  Member "statistical exponential families a digest with flash cards":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the jensen shannon symmetrization of distances relying on abstract means")

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)