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: "on multiply exponential write once turing machines"
  Abstract: AbstractInthisworkweanalyzethemultiply-exponentialcomplexityclassesforwrite-onceTuringmachines,i.e. machinesthatcanwritetoagiventapecellatmostonce. We show that k–DExpWOSpace = k–DExpWOTime = k–ExpTimeandthenondeterministiccounterpart. Foralternatingmachinesweshowthatk–AExpWOTime = k–AExpTime = k-1–ExpSpace.Keywords: computationalcomplexity,write-onceTuringmachine1. IntroductionTheideaofwrite-oncemachineswasﬁrststudiedbyHaoWang[1]in1957.ThosemachinesareanalogoustotheTuringmachines,withtheexceptionthatwriting is possible only to blank spaces; this model ﬁts manytypes of storagewhichareusedbothtodayandhistorically,forexamplepunchcardsandtapesand recordable optical discs (CD-R, DVD-R etc.). Those machines are equiv-alent to Turing machines with respect to the languages they accept. In thispaperwecharacterizesomecomplexityclassesofwrite-oncemachinesandshowwhat are the corresponding complexity classes for the usual Turing machines.Additionally,weconsiderafurtherrestrictionofwrite-oncemachines,thatareallowedtowriteonlyattheendofthetape,andshowthatthisclassofmachinesisnotuniversal.2. KnownresultsIn 1960 Lee [2] has shown many useful conversions of programs for usualTuring machines to programs for write-only machines with their complexities.SubsequentlyRivestandShamir[3]haveshownacodingschemewhichallowsfor eﬃcient simulation of updates; one of their most important results is thata value can be stored in a way which permits t updates at the expense ofincreasing the storage size asymptotically t=logt times. We will be using this

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.CC(Computational Complexity)