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 "cross modal scene graph matching for relationship aware image text retrieval"):
  Abstract: Image-text retrieval of natural scenes has been a popular research topic. Since image and text are heterogeneous cross-modal data, one of the key challenges is how to learn comprehensive yet unified representations to express the multi-modal data. A natural scene image mainly involves two kinds of visual concepts, objects and their relationships, which are equally essential to image-text retrieval. Therefore, a good representation should account for both of them. In the light of recent success of scene graph in many CV and NLP tasks for describing complex natural scenes, we propose to represent image and text with two kinds of scene graphs: visual scene graph (VSG) and textual scene graph (TSG), each of which is exploited to jointly characterize objects and relationships in the corresponding modality. The image-text retrieval task is then naturally formulated as cross-modal scene graph matching. Specifically, we design two particular scene graph encoders in our model for VSG and TSG, which can refine the representation of each node on the graph by aggregating neighborhood information. As a result, both object-level and relationship-level cross-modal features can be obtained, which favorably enables us to evaluate the similarity of image and text in the two levels in a more plausible way. We achieve state-of-the-art results on Flickr30k and MSCOCO, which verifies the advantages of our graph matching based approach for image-text retrieval.

Includes members:
  Member "polysemous visual semantic embedding for cross modal retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "noise estimation using density estimation for self supervised multimodal learning")
  Member "a comprehensive survey on graph neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "neighbourhood watch referring expression comprehension via language guided graph attention networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi task collaborative network for joint referring expression comprehension and segmentation")
  Member "stacked cross attention for image text matching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarial ranking attack and defense")
  Member "scene graph parsing as dependency parsing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an empirical study on leveraging scene graphs for visual question answering")
  Member "auto encoding scene graphs for image captioning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relationship embedded representation learning for grounding referring expressions")
  Member "image generation from scene graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pt2pc learning to generate 3d point cloud shapes from part tree conditions")
  Member "exploring visual relationship for image captioning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "relationship embedded representation learning for grounding referring expressions")

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.CV(Computer Vision and Pattern Recognition)