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 "joint cluster unary loss for efficient cross modal hashing"):
  Abstract: With the rapid growth of various types of multimodal data, cross-modal deep hashing has received broad attention for solving cross-modal retrieval problems efficiently. Most cross-modal hashing methods follow the traditional supervised hashing framework in which the $O(n^2)$ data pairs and $O(n^3)$ data triplets are generated for training, but the training procedure is less efficient because the complexity is high for large-scale dataset. To address these issues, we propose a novel and efficient cross-modal hashing algorithm in which the unary loss is introduced. First of all, We introduce the Cross-Modal Unary Loss (CMUL) with $O(n)$ complexity to bridge the traditional triplet loss and classification-based unary loss. A more accurate bound of the triplet loss for structured multilabel data is also proposed in CMUL. Second, we propose the novel Joint Cluster Cross-Modal Hashing (JCCH) algorithm for efficient hash learning, in which the CMUL is involved. The resultant hashcodes form several clusters in which the hashcodes in the same cluster share similar semantic information, and the heterogeneity gap on different modalities is diminished by sharing the clusters. The proposed algorithm is able to be applied to various types of data, and experiments on large-scale datasets show that the proposed method is superior over or comparable with state-of-the-art cross-modal hashing methods, and training with the proposed method is more efficient than others.

Includes members:
  Member "cycle consistent deep generative hashing for cross modal retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "few shot deep adversarial learning for video based person re identification")
  Member "semantic cluster unary loss for efficient deep hashing":
    also connected through other hyperedges:
      (none)
  Member "self supervised adversarial hashing networks for cross modal retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on deep hashing methods")
  Member "deep sketch hashing fast free hand sketch based image retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a network pruning network approach to deep model compression")
  Member "fast training of triplet based deep binary embedding networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep heterogeneous hashing for face video retrieval")
  Member "correlation hashing network for efficient cross modal retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep sketch hashing fast free hand sketch based image retrieval")
  Member "deep cross modal hashing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "simultaneous feature learning and hash coding with deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on deep hashing methods")

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.IR(Information Retrieval)