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: "the mathscheme library some preliminary experiments"
  Abstract: We present some of the e硰eriments we have performed to best test our design for a library for MathScheme, the mechanized mathe- matics software s祳tem we are building. We wish for our librar y design to use and reect, as much as possible, the mathematical structure present in the objects which populate the library.

Connected through hyperedge HE-1 (induced by source paper "building on the diamonds between theories theory presentation combinators"):
  with members:
    - "rapid prototyping formal systems in mmt 5 case studies"
    - "biform theories project description"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"
    - "theory presentation combinators"
    - "type classes for mathematics in type theory"
    - "a scalable module system"
    - "on duplication in mathematical repositories"

Connected through hyperedge HE-2 (induced by source paper "biform theories project description"):
  with members:
    - "hol light qe"
    - "incorporating quotation and evaluation into church s type theory"
    - "theory morphisms in church s type theory with quotation and evaluation"
    - "formalizing mathematical knowledge as a biform theory graph a case study"
    - "realms a structure for consolidating knowledge about mathematical theories"
    - "a universal machine for biform theory graphs"
    - "the formalization of syntax based mathematical algorithms using quotation and evaluation"
    - "theory presentation combinators"

Connected through hyperedge HE-3 (induced by source paper "theory presentation combinators"):
  with members:
    - "type classes for mathematics in type theory"
    - "nonuniform coercions via unification hints"
    - "a scalable module system"
    - "on duplication in mathematical repositories"
    - "parsimony principles for software components and metalanguages"

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.MS(Mathematical Software)