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: "evaluating sliding and sticky target policies by measuring temporal drift in acyclic walks through a web archive"
  Abstract: When a user views an archived page using the archive's user interface (UI), the user selects a datetime to view from a list. The archived web page, if available, is then displayed. From this display, the web archive UI attempts to simulate the web browsing experience by smoothly transitioning between archived pages. During this process, the target datetime changes with each link followed; drifting away from the datetime originally selected. When browsing sparsely-archived pages, this nearly-silent drift can be many years in just a few clicks. We conducted 200,000 acyclic walks of archived pages, following up to 50 links per walk, comparing the results of two target datetime policies. The Sliding Target policy allows the target datetime to change as it does in archive UIs such as the Internet Archive's Wayback Machine. The Sticky Target policy, represented by the Memento API, keeps the target datetime the same throughout the walk. We found that the Sliding Target policy drift increases with the number of walk steps, number of domains visited, and choice (number of links available). However, the Sticky Target policy controls temporal drift, holding it to less than 30 days on average regardless of walk length or number of domains visited. The Sticky Target policy shows some increase as choice increases, but this may be caused by other factors. We conclude that based on walk length, the Sticky Target policy generally produces at least 30 days less drift than the Sliding Target policy.

Connected through hyperedge HE-1 (induced by source paper "focused crawl of web archives to build event collections"):
  with members:
    - "scraping serps for archival seeds it matters when you start"
    - "extracting event centric document collections from large scale web archives"
    - "routing memento requests using binary classifiers"
    - "icrawl improving the freshness of web collections by integrating social web and focused web crawling"
    - "carbon dating the web estimating the age of web resources"

Connected through hyperedge HE-2 (induced by source paper "how php releases are adopted in the wild"):
  with members:
    - "adscape harvesting and analyzing online display ads"
    - "detecting memory and structure in human navigation patterns using markov chain models of varying order"

Connected through hyperedge HE-3 (induced by source paper "avoiding spoilers in fan wikis of episodic fiction"):
  with members:
    - "a framework for evaluation of composite memento temporal coherence"
    - "bringing web time travel to mediawiki an assessment of the memento mediawiki extension"
    - "mj no more using concurrent wikipedia edit spikes with social network plausibility checks for breaking news detection"
    - "memento time travel for the web"

Connected through hyperedge HE-4 (induced by source paper "bringing web time travel to mediawiki an assessment of the memento mediawiki extension"):
  with members:
    - "a framework for evaluation of composite memento temporal coherence"
    - "who and what links to the internet archive"
    - "access patterns for robots and humans in web archives"
    - "an http based versioning mechanism for linked data"

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.DL(Digital Libraries)