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 "many one reductions and the category of multivalued functions"):
  Abstract: Multivalued functions are common in computable analysis (built upon the Type 2 Theory of Effectivity), and have made an appearance in complexity theory under the moniker  search problems  leading to complexity classes such as PPAD and PLS being studied. However, a systematic investigation of the resulting degree structures has only been initiated in the former situation so far (the Weihrauch-degrees). #N#                 A more general understanding is possible, if the category-theoretic properties of multivalued functions are taken into account. In the present paper, the category-theoretic framework is established, and it is demonstrated that many-one degrees of multivalued functions form a distributive lattice under very general conditions, regardless of the actual reducibility notions used (e.g. Cook, Karp, Weihrauch). #N#                 Beyond this, an abundance of open questions arises. Some classic results for reductions between functions carry over to multivalued functions, but others do not. The basic theme here again depends on category-theoretic differences between functions and multivalued functions.

Includes members:
  Member "on the algebraic structure of weihrauch degrees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "searching for an analogue of atr in the weihrauch lattice")
  Member "function spaces for second order polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative continuity and computable analysis in coq")
  Member "the degree structure of weihrauch reducibility":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "searching for an analogue of atr in the weihrauch lattice")
  Member "complexity theory for operators in analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on higher order cryptography long version")
  Member "computation with advice":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "searching for an analogue of atr in the weihrauch lattice")
  Member "on the complexity of local search for weighted standard set problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "many one reductions between search problems")
  Member "on the semi lattices induced by continuous reducibilities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "searching for an analogue of atr in the weihrauch lattice")

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.CC(Computational Complexity)