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: "tempas temporal archive search based on tags"
  Abstract: Limited search and access patterns over Web archives have been well documented. One of the key reasons is the lack of understanding of the user access patterns over such collections, which in turn is attributed to the lack of effective search interfaces. Current search interfaces for Web archives are (a) either purely navigational or (b) have sub-optimal search experience due to ineffective retrieval models or query modeling. We identify that external longitudinal resources, such as social bookmarking data, are crucial sources to identify important and popular websites in the past. To this extent we present Tempas, a tag-based temporal search engine for Web archives.#R##N##R##N#Websites are posted at specific times of interest on several external platforms, such as bookmarking sites like Delicious. Attached tags not only act as relevant descriptors useful for retrieval, but also encode the time of relevance. With Tempas we tackle the challenge of temporally searching a Web archive by indexing tags and time. We allow temporal selections for search terms, rank documents based on their popularity and also provide meaningful query recommendations by exploiting tag-tag and tag-document co-occurrence statistics in arbitrary time windows. Finally, Tempas operates as a fairly non-invasive indexing framework. By not dealing with contents from the actual Web archive it constitutes an attractive and low-overhead approach for quick access into Web archives.

Connected through hyperedge HE-1 (induced by source paper "building and querying semantic layers for web archives extended version"):
  with members:
    - "towards a ranking model for semantic layers over digital archives"
    - "extracting event centric document collections from large scale web archives"
    - "can we find documents in web archives without knowing their contents"
    - "how to search the internet archive without indexing it"
    - "expedition a time aware exploratory search system designed for scholars"
    - "history by diversity helping historians search news archives"
    - "archivespark efficient web archive access extraction and derivation"
    - "routing memento requests using binary classifiers"

Connected through hyperedge HE-2 (induced by source paper "ranking archived documents for structured queries on semantic layers"):
  with members:
    - "expedition a time aware exploratory search system designed for scholars"
    - "history by diversity helping historians search news archives"

Connected through hyperedge HE-3 (induced by source paper "archiving software surrogates on the web for future reference"):
  with members:
    - "on the applicability of delicious for temporal search on web archives"
    - "the dawn of today s popular domains a study of the archived german web over 18 years"
    - "archivespark efficient web archive access extraction and derivation"
    - "best practices for scientific computing"
    - "swmath a new information service for mathematical software"
    - "profiling web archive coverage for top level domain and content language"
    - "losing my revolution how many resources shared on social media have been lost"
    - "how much of the web is archived"

Connected through hyperedge HE-4 (induced by source paper "linking mathematical software in web archives"):
  with members:
    - "the dawn of today s popular domains a study of the archived german web over 18 years"
    - "swmath a new information service for mathematical software"
    - "how much of the web is archived"

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.IR(Information Retrieval)