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 "exploring the limits of complexity a survey of empirical studies on graph visualisation"):
  Abstract: For decades, researchers in information visualisation and graph drawing have focused on developing techniques for the layout and display of very large and complex networks. Experiments involving human participants have also explored the readability of different styles of layout and representations for such networks. In both bodies of literature, networks are frequently referred to as being 'large' or 'complex', yet these terms are relative. From a human-centred, experiment point-of-view, what constitutes 'large' (for example) depends on several factors, such as data complexity, visual complexity, and the technology used. In this paper, we survey the literature on human-centred experiments to understand how, in practice, different features and characteristics of node-link diagrams affect visual complexity.

Includes members:
  Member "what would a graph look like in this layout a machine learning approach to large graph visualization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a deep generative model for graph layout")
  Member "experimental analysis of the accessibility of drawings with few segments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "drawing planar graphs with few segments on a polynomial grid")
  Member "many to many geographically embedded flow visualisation an evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "external labeling techniques a taxonomy and survey")
  Member "visual similarity perception of directed acyclic graphs a study on influencing factors":
    also connected through other hyperedges:
      (none)
  Member "evaluation of two interaction techniques for visualization of dynamic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "higher order visualization of causal structures in dynamics graphs")
  Member "on the readability of boundary labeling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "planar drawings of fixed mobile bigraphs")
  Member "node node link and node link group diagrams an evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multi level tree based approach for interactive graph visualization with semantic zoom")
  Member "a coloring algorithm for disambiguating graph and map drawings":
    also connected through other hyperedges:
      (none)

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.HC(Human-Computer Interaction)