human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a finite element approach for the line to line contact interaction of thin beams with arbitrary orientation"
  Abstract: Abstract   The objective of this work is the development of a novel finite element formulation describing the contact interaction of slender beams in complex 3D configurations involving arbitrary beam-to-beam orientations. It is shown in a mathematically concise manner that standard beam contact models based on a point-wise contact force fail to describe a considerable range of configurations, which are, however, likely to occur in practical applications. On the contrary, the formulation proposed here models beam-to-beam contact by means of distributed line forces, a procedure that is shown to be applicable for arbitrary geometrical configurations. The proposed formulation is based on a Gauss-point-to-segment type contact discretization and a penalty regularization of the contact constraint. By means of detailed theoretical and numerical investigations, it is shown that this approach is more suitable for beam contact than possible alternatives based on mortar type contact discretizations or constraint enforcement by means of Lagrange multipliers. The proposed formulation is enhanced by a consistently linearized integration interval segmentation avoiding numerical integration across strong discontinuities. In combination with a smoothed contact force law and the employed      C    1     -continuous beam elements, this procedure drastically reduces the numerical integration error, an essential prerequisite for optimal spatial convergence rates. The resulting line-to-line contact algorithm is supplemented by contact contributions of the beam endpoints, which represent boundary minima of the underlying minimal distance problem. Finally, a series of numerical test cases is analyzed in order to investigate the accuracy and consistency of the proposed formulation regarding integration error, spatial convergence behavior and resulting contact force distributions. For one of these test cases, an analytical solution based on the Kirchhoff theory of thin rods is derived, which can serve as valuable benchmark for the proposed model but also for future beam-to-beam contact formulations.

Connected through 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"):
  with members:
    - "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory"
    - "a computational model for molecular interactions between curved slender fibers undergoing large 3d deformations with a focus on electrostatic van der waals and repulsive steric forces"
    - "a unified approach for beam to beam contact"
    - "geometrically exact beam elements and smooth contact schemes for the modeling of fiber based materials and structures"

Connected through hyperedge HE-2 (induced by source paper "a computational model for molecular interactions between curved slender fibers undergoing large 3d deformations with a focus on electrostatic van der waals and repulsive steric forces"):
  with members:
    - "investigation of the peeling and pull off behavior of adhesive elastic fibers via a novel computational beam interaction model"
    - "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory"
    - "a unified approach for beam to beam contact"
    - "geometrically exact beam elements and smooth contact schemes for the modeling of fiber based materials and structures"

Connected through hyperedge HE-3 (induced by source paper "a mortar type finite element approach for embedding 1d beams into 3d solid volumes"):
  with members:
    - "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory"
    - "geometrically exact beam elements and smooth contact schemes for the modeling of fiber based materials and structures"

Connected through hyperedge HE-4 (induced by source paper "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory"):
  with members:
    - "a unified approach for beam to beam contact"

Connected through hyperedge HE-5 (induced by source paper "a unified approach for beam to beam contact"):
  with members:
    - "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory"

Connected through hyperedge HE-6 (induced by source paper "geometrically exact beam elements and smooth contact schemes for the modeling of fiber based materials and structures"):
  with members:
    - "geometrically exact finite element formulations for slender beams kirchhoff love theory versus simo reissner theory"
    - "a unified approach for beam to beam contact"

Question: Please tell me which class the center node 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)