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 "multi agent path finding with capacity constraints"):
  Abstract: In multi-agent path finding (MAPF) the task is to navigate agents from their starting positions to given individual goals. The problem takes place in an undirected graph whose vertices represent positions and edges define the topology. Agents can move to neighbor vertices across edges. In the standard MAPF, space occupation by agents is modeled by a capacity constraint that permits at most one agent per vertex. We suggest an extension of MAPF in this paper that permits more than one agent per vertex. Propositional satisfiability (SAT) models for these extensions of MAPF are studied. We focus on modeling capacity constraints in SAT-based formulations of MAPF and evaluation of performance of these models. We extend two existing SAT-based formulations with vertex capacity constraints: MDD-SAT and SMT-CBS where the former is an approach that builds the model in an eager way while the latter relies on lazy construction of the model.

Includes members:
  Member "multi agent path finding with deadlines":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi agent pathfinding definitions variants and benchmarks")
  Member "lazy modeling of variants of token swapping problem and multi agent path finding through combination of satisfiability modulo theories and conflict based search":
    also connected through other hyperedges:
      (none)
  Member "towards search based motion planning for micro aerial vehicles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decentralized multi target tracking in urban environments overview and challenges")
  Member "overview generalizations of multi agent path finding to real world scenarios":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a job assignment heuristic for lifelong multi agent path finding problem with multiple delivery locations")
  Member "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ddm fast near optimal multi robot path planning using diversified path and optimal sub problem solution database heuristics")
  Member "exploiting subgraph structure in multi robot path planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the tour towards dpll mapf and beyond")

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.MA(Multiagent Systems)