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: "how big is bci fragment of bck logic"
  Abstract: We investigate quantitative properties of BCI and BCK logics. The first part of the paper compares the number of formulas provable in BCI versus BCK logics. We consider formulas built on implication and a fixed set of $k$ variables. We investigate the proportion between the number of such formulas of a given length $n$ provable in BCI logic against the number of formulas of length $n$ provable in richer BCK logic. We examine an asymptotic behavior of this fraction when length $n$ of formulas tends to infinity. This limit gives a probability measure that randomly chosen BCK formula is also provable in BCI. We prove that this probability tends to zero as the number of variables tends to infinity. The second part of the paper is devoted to the number of lambda terms representing proofs of BCI and BCK logics. We build a proportion between number of such proofs of the same length $n$ and we investigate asymptotic behavior of this proportion when length of proofs tends to infinity. We demonstrate that with probability 0 a randomly chosen BCK proof is also a proof of a BCI formula.

Connected through hyperedge HE-1 (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"
    - "counting isomorphism classes of β normal linear lambda terms"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "a logic programming playground for lambda terms combinators types and tree based arithmetic computations"):
  with members:
    - "a generic numbering system based on catalan families of combinatorial objects"
    - "counting and generating lambda terms"
    - "very simple chaitin machines for concrete ait"

Connected through hyperedge HE-3 (induced by source paper "a correspondence between rooted planar maps and normal planar lambda terms"):
  with members:
    - "graphic lambda calculus"
    - "counting and generating 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)