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: "on interface conditions for flows in coupled free porous media"
  Abstract: Many processes in nature (e.g., physical and biogeochemical processes in hyporheic zones, and arterial mass transport) occur near the interface of free-porous media. A firm understanding of these processes needs an accurate prescription of flow dynamics near the interface which (in turn) hinges on an appropriate description of interface conditions along the interface of free-porous media. Although the conditions for the flow dynamics at the interface of free-porous media have received considerable attention, many of these studies were empirical and lacked a firm theoretical underpinning. In this paper, we derive a complete and self-consistent set of conditions for flow dynamics at the interface of free-porous media. We first propose a principle of virtual power by incorporating the virtual power expended at the interface of free-porous media. Then by appealing to the calculus of variations, we obtain a complete set of interface conditions for flows in coupled free-porous media. A noteworthy feature of our approach is that the derived interface conditions apply to a wide variety of porous media models. We also show that the two most popular interface conditions -- the Beavers-Joseph condition and the Beavers-Joseph-Saffman condition -- are special cases of the approach presented in this paper. The proposed principle of virtual power also provides a minimum power theorem for a class of flows in coupled free-porous media, which has a similar mathematical structure as the ones enjoyed by flows in uncoupled free and porous media.

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)