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: "invertible bloom lookup tables"
  Abstract: We present a version of the Bloom filter data structure that supports not only the insertion, deletion, and lookup of key-value pairs, but also allows a complete listing of its contents with high probability, as long the number of key-value pairs is below a designed threshold. Our structure allows the number of key-value pairs to greatly exceed this threshold during normal operation. Exceeding the threshold simply temporarily prevents content listing and reduces the probability of a successful lookup. If later entries are deleted to return the structure below the threshold, everything again functions appropriately. We also show that simple variations of our structure are robust to certain standard errors, such as the deletion of a key without a corresponding insertion or the insertion of two distinct values for a key. The properties of our structure make it suitable for several applications, including database and networking applications that we highlight.

Connected through hyperedge HE-1 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures"):
  with members:
    - "dense peelable random uniform hypergraphs"
    - "fast scalable construction of minimal perfect hash functions"
    - "bubing massive crawling for the masses"
    - "the multiple orientability thresholds for random hypergraphs"
    - "on the insertion time of random walk cuckoo hashing"
    - "high speed hashing for integers and strings"
    - "cache oblivious peeling of random hypergraphs"
    - "thresholds of spatially coupled systems via lyapunov s method"

Connected through hyperedge HE-2 (induced by source paper "performance driven internet path selection"):
  with members:
    - "contra a programmable system for performance aware routing"
    - "dapper data plane performance diagnosis of tcp"

Connected through hyperedge HE-3 (induced by source paper "multiset synchronization with counting cuckoo filters"):
  with members:
    - "optimizing bloom filter challenges solutions and comparisons"

Connected through hyperedge HE-4 (induced by source paper "dense peelable random uniform hypergraphs"):
  with members:
    - "fast scalable construction of minimal perfect hash functions"
    - "the multiple orientability thresholds for random hypergraphs"
    - "cache oblivious peeling of random hypergraphs"
    - "biff bloom filter codes fast error correction for large data sets"
    - "sharp load thresholds for cuckoo hashing"
    - "bloomier filters a second look"
    - "straggler identification in round trip data streams via newton s identities and invertible bloom filters"

Connected through hyperedge HE-5 (induced by source paper "a fast and compact invertible sketch for network wide heavy flow detection"):
  with members:
    - "optimal elephant flow detection"
    - "heavy hitter detection entirely in the data plane"
    - "randomized admission policy for efficient top k and frequency estimation"
    - "amon an open source architecture for online monitoring statistical analysis and forensics of multi gigabit streams"
    - "straggler identification in round trip data streams via newton s identities and invertible bloom filters"

Connected through hyperedge HE-6 (induced by source paper "building scalable decentralized payment systems"):
  with members:
    - "a scalable verification solution for blockchains"
    - "incentives in ethereum s hybrid casper protocol"
    - "atomic cross chain swaps"
    - "consensus in the age of blockchains"
    - "casper the friendly finality gadget"

Connected through hyperedge HE-7 (induced by source paper "scalable string reconciliation by recursive content dependent shingling"):
  with members:
    - "a compression algorithm using mis aligned side information"
    - "efficiently decoding strings from their shingles"

Connected through hyperedge HE-8 (induced by source paper "matrix bloom filter an efficient probabilistic data structure for 2 tuple batch lookup"):
  with members:
    - "bloomier filters a second look"

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)