human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "when can you fold a map"
  Abstract: We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds; the simplest one-layer simple fold rotates a portion of paper about a crease in the paper by +-180 degrees. We first consider the analogous questions in one dimension lower -- bending a segment into a flat object -- which lead to interesting problems on strings. We develop efficient algorithms for the recognition of simply foldable 1D crease patterns, and reconstruction of a sequence of simple folds. Indeed, we prove that a 1D crease pattern is flat-foldable by any means precisely if it is by a sequence of one-layer simple folds. #R##N#Next we explore simple foldability in two dimensions, and find a surprising contrast: ``map'' folding and variants are polynomial, but slight generalizations are NP-complete. Specifically, we develop a linear-time algorithm for deciding foldability of an orthogonal crease pattern on a rectangular piece of paper, and prove that it is (weakly) NP-complete to decide foldability of (1) an orthogonal crease pattern on a orthogonal piece of paper, (2) a crease pattern of axis-parallel and diagonal (45-degree) creases on a square piece of paper, and (3) crease patterns without a mountain/valley assignment.

Connected through hyperedge HE-1 (induced by source paper "upward partitioned book embeddings"):
  with members:
    - "two page book embeddings of 4 planar graphs"
    - "advancements on sefe and partitioned book embedding problems"
    - "implementing a partitioned 2 page book embedding testing algorithm"

Connected through hyperedge HE-2 (induced by source paper "minimal forcing sets for 1d origami"):
  with members:
    - "minimum forcing sets for miura folding patterns"

Connected through hyperedge HE-3 (induced by source paper "recognizing weakly simple polygons"):
  with members:
    - "hanani tutte for approximating maps of graphs"
    - "embedding graphs into embedded graphs"
    - "detecting weakly simple polygons"
    - "flat foldings of plane graphs with prescribed angles and edge lengths"

Connected through hyperedge HE-4 (induced by source paper "folding a paper strip to minimize thickness"):
  with members:
    - "inapproximability of orthogonal compaction"

Connected through hyperedge HE-5 (induced by source paper "flat foldings of plane graphs with prescribed angles and edge lengths"):
  with members:
    - "a generalized carpenter s rule theorem for self touching linkages"

Connected through hyperedge HE-6 (induced by source paper "a generalized carpenter s rule theorem for self touching linkages"):
  with members:
    - "locked and unlocked chains of planar shapes"
    - "a locked orthogonal tree"

Connected through hyperedge HE-7 (induced by source paper "an algorithmic study of manufacturing paperclips and other folded structures"):
  with members:
    - "ununfoldable polyhedra with convex faces"
    - "locked and unlocked polygonal chains in 3d"

Question: Please tell me which class the center node 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.CG(Computational Geometry)