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 "graphical contrastive losses for scene graph parsing"):
  Abstract: Most scene graph parsers use a two-stage pipeline to detect visual relationships: the first stage detects entities, and the second predicts the predicate for each entity pair using a softmax distribution. We find that such pipelines, trained with only a cross entropy loss over predicate classes, suffer from two common errors. The first, Entity Instance Confusion, occurs when the model confuses multiple instances of the same type of entity (e.g. multiple cups). The second, Proximal Relationship Ambiguity, arises when multiple subject-predicate-object triplets appear in close proximity with the same predicate, and the model struggles to infer the correct subject-object pairings (e.g. mis-pairing musicians and their instruments). We propose a set of contrastive loss formulations that specifically target these types of errors within the scene graph parsing problem, collectively termed the Graphical Contrastive Losses. These losses explicitly force the model to disambiguate related and unrelated instances through margin constraints specific to each type of confusion. We further construct a relationship detector, called RelDN, using the aforementioned pipeline to demonstrate the efficacy of our proposed losses. Our model outperforms the winning method of the OpenImages Relationship Detection Challenge by 4.7\% (16.5\% relative) on the test set. We also show improved results over the best previous methods on the Visual Genome and Visual Relationship Detection datasets.

Includes members:
  Member "introduction to the 1st place winning model of openimages relationship detection challenge":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "2nd place solution to the gqa challenge 2019")
  Member "shuffle then assemble learning object agnostic visual relationship features":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unpaired image captioning via scene graph alignments")
  Member "graph r cnn for scene graph generation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "relatext exploiting visual relationships for arbitrary shaped scene text detection with graph convolutional networks")
  Member "zoom net mining deep feature interactions for visual relationship recognition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unbiased scene graph generation from biased training")
  Member "mattnet modular attention network for referring expression comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "relationship embedded representation learning for grounding referring expressions")
  Member "large scale visual relationship understanding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mutual mean teaching pseudo label refinery for unsupervised domain adaptation on person re identification")
  Member "an interpretable model for scene graph generation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "differentiable scene graphs")
  Member "query guided regression network with context policy for phrase grounding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi task collaborative network for joint referring expression comprehension and segmentation")

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)