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: "graphical reasoning in compact closed categories for quantum computation"
  Abstract: Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning about such graphs and develop this into a generic proof system with a fixed logical kernel for equational reasoning about compact closed categories. Automating this reasoning process is motivated by the slow and error prone nature of manual graph manipulation. A salient feature of our system is that it provides a formal and declarative account of derived results that can include `ellipses'-style notation. We illustrate the framework by instantiating it for a graphical language of quantum computation and show how this can be used to perform symbolic computation.

Connected through hyperedge HE-1 (induced by source paper "tensors graphs and non commutative quantum structures extended version"):
  with members:
    - "compositional distributional semantics with compact closed categories and frobenius algebras"
    - "tensors graphs and non commutative quantum structures"
    - "reasoning with graphs"
    - "proceedings sixth workshop on developments in computational models causality computation and physics edinburgh scotland 9 10th july 2010"

Connected through hyperedge HE-2 (induced by source paper "encoding tensors as graphs with neighbourhood orders"):
  with members:
    - "graphs with trivial overlap are context free"
    - "compositional distributional semantics with compact closed categories and frobenius algebras"
    - "tensors graphs and non commutative quantum structures"
    - "reasoning with graphs"

Connected through hyperedge HE-3 (induced by source paper "graphs with trivial overlap are context free"):
  with members:
    - "quantomatic a proof assistant for diagrammatic reasoning"
    - "tensors graphs and non commutative quantum structures"
    - "reasoning with graphs"

Connected through hyperedge HE-4 (induced by source paper "tensors graphs and non commutative quantum structures"):
  with members:
    - "compositional distributional semantics with compact closed categories and frobenius algebras"
    - "reasoning with graphs"
    - "proceedings sixth workshop on developments in computational models causality computation and physics edinburgh scotland 9 10th july 2010"

Connected through hyperedge HE-5 (induced by source paper "reasoning with graphs"):
  with members:
    - "synthesising graphical theories"

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.SC(Symbolic Computation)