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: "a proof theoretic view of constraint programming"
  Abstract: We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for linear constraints over interval domains, and illustrate their use by analyzing the constraint propagation process for the {\tt SEND + MORE = MONEY} puzzle. We also show how this approach allows one to build new constraint solvers.

Connected through hyperedge HE-1 (induced by source paper "integrating interval constraints into logic programming"):
  with members:
    - "set theoretic preliminaries for computer scientists"
    - "the essence of constraint propagation"

Connected through hyperedge HE-2 (induced by source paper "explaining constraint programming"):
  with members:
    - "automatic generation of chr constraint solvers"
    - "schedulers and redundancy for a class of constraint propagation rules"
    - "the role of commutativity in constraint propagation algorithms"
    - "constraint programming viewed as rule based programming"
    - "some remarks on boolean constraint propagation"
    - "the essence of constraint propagation"

Connected through hyperedge HE-3 (induced by source paper "an analysis of arithmetic constraints on integer intervals"):
  with members:
    - "a comparative study of arithmetic constraints on integer intervals"

Connected through hyperedge HE-4 (induced by source paper "automatic generation of chr constraint solvers"):
  with members:
    - "automatic generation of constraint propagation algorithms for small finite domains"

Connected through hyperedge HE-5 (induced by source paper "constraint programming viewed as rule based programming"):
  with members:
    - "some remarks on boolean constraint propagation"
    - "the rough guide to constraint propagation"
    - "automatic generation of constraint propagation algorithms for small finite domains"
    - "the essence of constraint propagation"

Connected through hyperedge HE-6 (induced by source paper "some remarks on boolean constraint propagation"):
  with members:
    - "automatic generation of constraint propagation algorithms for small finite domains"

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.AI(Artificial Intelligence)