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 "a unified approach for beam to beam contact"):
  Abstract: Abstract   Existing beam contact formulations can be categorized in point-to-point contact models that consider a discrete contact force at the closest point of the beams, and line-to-line contact models that assume distributed contact forces. In this work, it will be shown that line contact formulations applied to slender beams provide accurate and robust mechanical models in the range of small contact angles, whereas the computational efficiency considerably decreases with increasing contact angles. On the other hand, point contact formulations serve as sufficiently accurate and very efficient models in the regime of large contact angles, while they are not applicable for small contact angles as a consequence of non-unique closest point projections. In order to combine the advantages of these basic formulations, a novel all-angle beam contact ( ABC ) formulation is developed that applies a point contact formulation in the range of large contact angles and a recently developed line contact formulation in the range of small contact angles, the two being smoothly connected by means of a variationally consistent model transition. Based on a stringent analysis, two different transition laws are investigated, optimal algorithmic parameters are suggested and conservation of linear momentum, angular momentum and total energy is shown. All configuration-dependent quantities within the point-, the line- and the transition-contact regime are consistently linearized, thus allowing for their application within implicit time integration schemes. Furthermore, a step size control of the nonlinear solution scheme is proposed that allows for displacement increments per time step that exceed the order of magnitude of the beam cross-section radius. For many standard beam-to-beam contact algorithms, this is the typical limitation concerning possible time step sizes, especially when considering high beam slenderness ratios. Finally, an efficient two-stage contact search based on dynamically adapted search segments is proposed. This algorithm yields in a tight set of potential contact pairs and enables a subdivision into potential point and potential line contact pairs, which is essential in order to fully exploit the efficiency potential of the proposed contact formulation. A series of numerical test cases is analyzed in order to verify the accuracy and consistency of the proposed contact model transition regarding contact force distributions and conservation properties, but also for quantifying the efficiency gains as compared to standard beam contact formulations.

Includes members:
  Member "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory":
    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)