human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "two party function computation on the reconciled data"):
  Abstract: Assume a distributed system with two users, each user possesses a collection of binary strings. We introduce a new problem termed function computation on the reconciled data, which generalizes a set reconciliation problem in the literature. It is shown that any deterministic protocol that computes a sum and a product of reconciled sets of nonnegative integers has to communicate at least $2^n + n - 1$ and $2^n + n - 3$ bits in the worst-case scenario, respectively, where $n$ is the length of the binary string representations of the numbers. Connections to other problems in computer science, such as set disjointness and finding the intersection, are established, yielding a variety of additional bounds on the communication complexity. A protocol, which is based on use of a family of hash functions is presented, and its characteristics are analyzed.

Includes members:
  Member "biff bloom filter codes fast error correction for large data sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "invertible bloom lookup tables":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")

Question: Please tell me which class the source paper 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.IT(Information Theory)