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: "tuplix calculus specifications of financial transfer networks"
  Abstract: We study the application of Tuplix Calculus in modular financial budget design. We formalize organizational structure using financial transfer networks. We consider the notion of flux of money over a network, and a way to enforce the matching of influx and outflux for parts of a network. We exploit so-called signed attribute notation to make internal streams visible through encapsulations. Finally, we propose a Tuplix Calculus construct for the definition of data functions.

Connected through hyperedge HE-1 (induced by source paper "a process calculus with finitary comprehended terms"):
  with members:
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "transmission protocols for instruction streams"
    - "the structure of finite meadows"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"

Connected through hyperedge HE-2 (induced by source paper "on the expressiveness of single pass instruction sequences"):
  with members:
    - "indirect jumps improve instruction sequence performance"
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "autosolvability of halting problem instances for instruction sequences"
    - "program algebra with a jump shift instruction"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"

Connected through hyperedge HE-3 (induced by source paper "data linkage dynamics with shedding"):
  with members:
    - "data linkage algebra data linkage dynamics and priority rewriting"
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"
    - "instruction sequences with indirect jumps"
    - "heap reference analysis using access graphs"

Connected through hyperedge HE-4 (induced by source paper "formaleuros formalcoins and virtual monies"):
  with members:
    - "searching publications on operating systems"
    - "on the definition of a theoretical concept of an operating system"
    - "an interface group for process components"
    - "machine structure oriented control code logic"
    - "a static theory of promises"
    - "interface groups and financial transfer architectures"

Connected through hyperedge HE-5 (induced by source paper "instruction sequence notations with probabilistic instructions"):
  with members:
    - "instruction sequence processing operators"
    - "on the expressiveness of single pass instruction sequences"
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "transmission protocols for instruction streams"
    - "square root meadows"
    - "an instruction sequence semigroup with involutive anti automorphisms"
    - "program algebra with a jump shift instruction"

Connected through hyperedge HE-6 (induced by source paper "a protocol for instruction stream processing"):
  with members:
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "transmission protocols for instruction streams"
    - "program algebra with a jump shift instruction"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"

Connected through hyperedge HE-7 (induced by source paper "transmission protocols for instruction streams"):
  with members:
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "program algebra with a jump shift instruction"
    - "instruction sequences and non uniform complexity theory"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"
    - "projection semantics for rigid loops"
    - "instruction sequences with indirect jumps"

Connected through hyperedge HE-8 (induced by source paper "instruction sequences and non uniform complexity theory"):
  with members:
    - "on the expressiveness of single pass instruction sequences"
    - "indirect jumps improve instruction sequence performance"
    - "an interface group for process components"
    - "instruction sequences with dynamically instantiated instructions"
    - "autosolvability of halting problem instances for instruction sequences"
    - "program algebra with a jump shift instruction"
    - "thread extraction for polyadic instruction sequences"
    - "interface groups and financial transfer architectures"

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)