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: "improving robustness via disjunctive statements in imperative programming"
  Abstract: AbstractTo deal with failures as simply as possible, we propose a new foun-dation for the core (untyped) C, which is based on a new logic calledtasklogicorimperativelogic. Wethenintroduceasequential-disjunctivestatementoftheformS:R. Thisstatementhasthefollowingsemantics:execute S and R sequentially. It is considered a success if at least oneofS,R is asuccess. This statement is usefulfor dealing with inessentialerrorswithoutexplicitlycatchingthem. 1 Introduction Imperative programming is an important modern programming paradigm. Suc-cessful languages in this paradigm includes C and Java. Despite much attrac-tiveness, imperative languages have traditionally lacked fundamental notion ofsuccess/failure for indicating whether a statement can be successfully completedor not. Lacking such a notion, imperative programming relies on nonlogical,awkward devices such as exception handling to deal with failures. One majorproblem with exception handling is that the resulting language becomes com-plicated and not easy to use.To deal with failures as simply as possible, we propose a new foundation forthe core (untyped) C, which is based on a new logic called task logic [1, 2] orimperative logic. The task logic expands the traditional t/f (true/false) so as toinclude T/ F(success/failure). The task logic interprets each statement as T/F,depending on whether it can be successfully completed or not. The prematureexit of a statement due to failures can be problematic. To avoid this, we adopt“all-or-nothing” semantics discussed in [3] to guarantee atomicity. Thus, if afailure occurs in the couse of executing a statement, we assume that the machinerolls back partial updates.We can then extend this “logic-based”C with other useful logical operations.To improve robustness, we introduce a sequential-disjunctive statement of theform S: R. Here, to avoid complications, we assume that Sand Rare indepen-dent of each other, i.e., no variables appear in both S and R. This statementhas the following semantics: execute S and R sequentially. It is considered a1

Connected through hyperedge HE-1 (induced by source paper "bounded choice queries for logic programming"):
  with members:
    - "sequential operators in computability logic"

Connected through hyperedge HE-2 (induced by source paper "a new statement for selection and exception handling in imperative languages"):
  with members:
    - "sequential operators in computability logic"

Connected through hyperedge HE-3 (induced by source paper "bounded choice statements for user interaction in imperative and object oriented programming"):
  with members:
    - "sequential operators in computability logic"

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.PL(Programming Languages)