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: "counting isomorphism classes of β normal linear lambda terms"
  Abstract: Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by appeal to a theorem of Arqu\`es and Beraud) that the sequence counting isomorphism classes of $\beta$-normal linear lambda terms up to free exchange of adjacent lambda abstractions coincides with the sequence counting isomorphism classes of rooted maps on oriented surfaces (A000698).

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"
    - "a correspondence between rooted planar maps and normal planar lambda terms"
    - "complete and easy bidirectional typechecking for higher rank polymorphism"
    - "graphic lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "quantitative aspects of linear and affine closed lambda terms"):
  with members:
    - "linear lambda terms as invariants of rooted trivalent maps"
    - "a natural counting of lambda terms"
    - "counting and generating terms in the binary lambda calculus extended version"
    - "a correspondence between rooted planar maps and normal planar lambda terms"
    - "boltzmann samplers for random generation of lambda terms"
    - "counting and generating lambda terms"
    - "on counting untyped lambda terms"
    - "how big is bci fragment of bck logic"

Connected through hyperedge HE-3 (induced by source paper "linear lambda terms as invariants of rooted trivalent maps"):
  with members:
    - "a correspondence between rooted planar maps and normal planar lambda terms"

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)