human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "inferring concept hierarchies from text corpora via hyperbolic embeddings"):
  Abstract: We consider the task of inferring is-a relationships from large text corpora. For this purpose, we propose a new method combining hyperbolic embeddings and Hearst patterns. This approach allows us to set appropriate constraints for inferring concept hierarchies from distributional contexts while also being able to predict missing is-a relationships and to correct wrong extractions. Moreover -- and in contrast with other methods -- the hierarchical nature of hyperbolic space allows us to learn highly efficient representations and to improve the taxonomic consistency of the inferred hierarchies. Experimentally, we show that our approach achieves state-of-the-art performance on several commonly-used benchmarks.

Includes members:
  Member "learning continuous hierarchies in the lorentz model of hyperbolic geometry":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discriminative topic mining via category name guided text embedding")
  Member "poincar e glove hyperbolic word embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "binarized pmi matrix bridging word embeddings and hyperbolic spaces")
  Member "taskonomy disentangling task transfer learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mti net multi scale task interaction networks for multi task learning")
  Member "hearst patterns revisited automatic hypernym detection from large text corpora":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "keml a knowledge enriched meta learning framework for lexical relation classification")
  Member "embedding text in hyperbolic spaces":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "latent variable modelling with hyperbolic normalizing flows")
  Member "hierarchical density order embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "query2box reasoning over knowledge graphs in vector space using box embeddings")
  Member "hyperbolic entailment cones for learning hierarchical embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discriminative topic mining via category name guided text embedding")
  Member "why we have switched from building full fledged taxonomies to simply detecting hypernymy relations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "concurrent learning of semantic relations")

Question: Please tell me which class the source paper 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.CL(Computation and Language)