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: "schemas for unordered xml on a dime"
  Abstract: We investigate schema languages for unordered XML having no relative order among siblings. First, we propose unordered regular expressions (UREs), essentially regular expressions with unordered concatenation instead of standard concatenation, that define languages of unordered words to model the allowed content of a node (i.e., collections of the labels of children). However, unrestricted UREs are computationally too expensive as we show the intractability of two fundamental decision problems for UREs: membership of an unordered word to the language of a URE and containment of two UREs. Consequently, we propose a practical and tractable restriction of UREs, disjunctive interval multiplicity expressions (DIMEs). Next, we employ DIMEs to define languages of unordered trees and propose two schema languages: disjunctive interval multiplicity schema (DIMS), and its restriction, disjunction-free interval multiplicity schema (IMS). We study the complexity of the following static analysis problems: schema satisfiability, membership of a tree to the language of a schema, schema containment, as well as twig query satisfiability, implication, and containment in the presence of schema. Finally, we study the expressive power of the proposed schema languages and compare them with yardstick languages of unordered trees (FO, MSO, and Presburger constraints) and DTDs under commutative closure. Our results show that the proposed schema languages are capable of expressing many practical languages of unordered trees and enjoy desirable computational properties.

Connected through hyperedge HE-1 (induced by source paper "grammar based compression of unranked trees"):
  with members:
    - "balancing straight line programs"
    - "slowing down top trees for better worst case bounds"
    - "compressed tree canonization"
    - "tree compression with top trees revisited"
    - "context unification is in pspace"
    - "faster fully compressed pattern matching by recompression"

Connected through hyperedge HE-2 (induced by source paper "containment of shape expression schemas for rdf"):
  with members:
    - "relational to rdf data exchange in presence of a shape expression schema"
    - "tightening the complexity of equivalence problems for commutative grammars"

Connected through hyperedge HE-3 (induced by source paper "practical study of deterministic regular expressions from large scale xml and schema data"):
  with members:
    - "discovering restricted regular expressions with interleaving"
    - "answering regular path queries on workflow provenance"

Connected through hyperedge HE-4 (induced by source paper "discovering restricted regular expressions with interleaving"):
  with members:
    - "simple schemas for unordered xml"
    - "learning schemas for unordered xml"
    - "learning deterministic regular expressions for the inference of schemas from xml data"

Connected through hyperedge HE-5 (induced by source paper "validating rdf with shape expressions"):
  with members:
    - "simple schemas for unordered xml"

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.DB(Databases)