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 "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory"):
  Abstract: The present work focuses on geometrically exact finite elements for highly slender beams. It aims at the proposal of novel formulations of Kirchhoff–Love type, a detailed review of existing formulations of Kirchhoff–Love and Simo–Reissner type as well as a careful evaluation and comparison of the proposed and existing formulations. Two different rotation interpolation schemes with strong or weak Kirchhoff constraint enforcement, respectively, as well as two different choices of nodal triad parametrizations in terms of rotation or tangent vectors are proposed. The combination of these schemes leads to four novel finite element variants, all of them based on a \(C^1\)-continuous Hermite interpolation of the beam centerline. Essential requirements such as representability of general 3D, large deformation, dynamic problems involving slender beams with arbitrary initial curvatures and anisotropic cross-section shapes, preservation of objectivity and path-independence, consistent convergence orders, avoidance of locking effects as well as conservation of energy and momentum by the employed spatial discretization schemes, but also a range of practically relevant secondary aspects will be investigated analytically and verified numerically for the different formulations. It will be shown that the geometrically exact Kirchhoff–Love beam elements proposed in this work are the first ones of this type that fulfill all these essential requirements. On the contrary, Simo–Reissner type formulations fulfilling these requirements can be found in the literature very well. However, it will be argued that the shear-free Kirchhoff–Love formulations can provide considerable numerical advantages such as lower spatial discretization error levels, improved performance of time integration schemes as well as linear and nonlinear solvers and smooth geometry representation as compared to shear-deformable Simo–Reissner formulations when applied to highly slender beams. Concretely, several representative numerical test cases confirm that the proposed Kirchhoff–Love formulations exhibit a lower discretization error level as well as a considerably improved nonlinear solver performance in the range of high beam slenderness ratios as compared to two representative Simo–Reissner element formulations from the literature.

Includes members:
  Member "a unified approach for beam to beam contact":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "investigation of the peeling and pull off behavior of adhesive elastic fibers via a novel computational beam interaction model")
  Member "a finite element approach for the line to line contact interaction of thin beams with arbitrary orientation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "investigation of the peeling and pull off behavior of adhesive elastic fibers via a novel computational beam interaction model")

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.CE(Computational Engineering, Finance, and Science)