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 shifting bloom filter framework for set queries"
  Abstract: Set queries are fundamental operations in computer systems and applications.This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory. We propose a Shifting Bloom Filter (ShBF) framework for representing and querying sets. We demonstrate the effectiveness of ShBF using three types of popular set queries: membership, association, and multiplicity queries. The key novelty of ShBF is on encoding the auxiliary information of a set element in a location offset. In contrast, prior BF based set data structures allocate additional memory to store auxiliary information. To evaluate ShBF in comparison with prior art, we conducted experiments using real-world network traces. Results show that ShBF significantly advances the state-of-the-art on all three types of set queries.

Connected through hyperedge HE-1 (induced by source paper "bloom filter variants for multiple sets a comparative assessment"):
  with members:
    - "optimizing bloom filter challenges solutions and comparisons"
    - "bloomier filters a second look"

Connected through hyperedge HE-2 (induced by source paper "a new frequency estimation sketch for data streams"):
  with members:
    - "mining top k frequent itemsets through progressive sampling"

Connected through hyperedge HE-3 (induced by source paper "multiple set matching and pre filtering with bloom multifilters"):
  with members:
    - "the case for learned index structures"

Connected through hyperedge HE-4 (induced by source paper "optimizing bloom filter challenges solutions and comparisons"):
  with members:
    - "a survey on security and privacy issues of bitcoin"
    - "a model for learned bloom filters and related structures"
    - "the case for learned index structures"
    - "adaptive cuckoo filters"
    - "location privacy preservation in database driven wireless cognitive networks through encrypted probabilistic data structures"
    - "cuckoo filter simplification and analysis"
    - "yes no bloom filter a way of representing sets with fewer false positives"
    - "don t thrash how to cache your hash on flash"

Connected through hyperedge HE-5 (induced by source paper "sf sketch slim fat sketch with gpu assistance"):
  with members:
    - "count min log sketch approximately counting with approximate counters"

Connected through hyperedge HE-6 (induced by source paper "memory efficient and ultra fast network lookup and forwarding using othello hashing"):
  with members:
    - "scalable routing on flat names"

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.DS(Data Structures and Algorithms)