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: "towards non threaded concurrent constraint programming for implementing multimedia interaction systems"
  Abstract: In this work we explain the implementation of event-driven real-time interpreters for the Concurrent Constraint Programming (CCP) and Non-deterministic Timed Concurrent Constraint (NTCC) formalisms. The CCP interpreter was tested with a program to find, concurrently, paths in a graph and it will be used in the future to find musical sequences in the music improvisation software Omax, developed by the French Acoustics/Music Research Institute (IRCAM). In the other hand, the NTCC interpreter was tested with a music improvisation system based on NTCC (CCFOMI), developed by the AVISPA research group and IRCAM. Additionally, we present GECOL 2, a wrapper for the Generic Constraints Development Environment (GECODE) to Common LISP, developed to port the interpreters to Common LISP in the future. We concluded that using GECODE for the concurrency control avoids the need of having threads and synchronizing them, leading to a simple and efficient implementation of CCP and NTCC. We also noticed that the time units in NTCC interpreter do not represent discrete time units, because when we simulate the NTCC specifications in the interpreter, the time units have different durations. In the future, we propose forcing the duration of each time unit to a fix time, that way we would be able to reason about NTCC time units as we do with discrete time units.

Connected through hyperedge HE-1 (induced by source paper "gelisp a library to represent musical csps and search strategies"):
  with members:
    - "a model for interactive scores with temporal constraints and conditional branching"
    - "structured interactive music scores"
    - "an extension of interactive scores for multimedia scenarios with temporal relations for micro and macro controls"
    - "efficient constraint propagation engines"

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.MM(Multimedia)