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: "graphic lambda calculus"
  Abstract: We introduce and study graphic lambda calculus, a visual language which can be used for representing untyped lambda calculus, but it can also be used for computations in emergent algebras or for representing Reidemeister moves of locally planar tangle diagrams.

Connected through hyperedge HE-1 (induced by source paper "a theory of linear typings as flows on 3 valent graphs"):
  with members:
    - "linear lambda terms as invariants of rooted trivalent maps"
    - "counting isomorphism classes of β normal linear lambda terms"
    - "a correspondence between rooted planar maps and normal planar lambda terms"
    - "complete and easy bidirectional typechecking for higher rank polymorphism"

Connected through hyperedge HE-2 (induced by source paper "viral turing machines computation from noise and combinatorial hierarchies"):
  with members:
    - "molecular computers"
    - "info computationalism and philosophical aspects of research in information sciences"
    - "on the capacity of noisy computations"

Connected through hyperedge HE-3 (induced by source paper "chemlambda universality and self multiplication"):
  with members:
    - "glc actors artificial chemical connectomes topological issues and knots"
    - "chemical concrete machine"
    - "actor model of computation scalable robust information systems"

Connected through hyperedge HE-4 (induced by source paper "a correspondence between rooted planar maps and normal planar lambda terms"):
  with members:
    - "counting and generating lambda terms"
    - "how big is bci fragment of bck logic"

Connected through hyperedge HE-5 (induced by source paper "on rooted planar maps and normal planar lambda terms"):
  with members:
    - "counting and generating lambda terms"

Connected through hyperedge HE-6 (induced by source paper "glc actors artificial chemical connectomes topological issues and knots"):
  with members:
    - "chemical concrete machine"
    - "actor model of computation scalable robust information systems"

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.LO(Logic in Computer Science)