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: "the oblivious transfer capacity of the wiretapped binary erasure channel"
  Abstract: We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).

Connected through hyperedge HE-1 (induced by source paper "privacy in index coding improved bounds and coding schemes"):
  with members:
    - "preserving privacy while broadcasting k limited access schemes"
    - "private broadcasting an index coding approach"
    - "the capacity of private information retrieval from coded databases"
    - "on the security of index coding with side information"

Connected through hyperedge HE-2 (induced by source paper "preserving privacy while broadcasting k limited access schemes"):
  with members:
    - "private broadcasting an index coding approach"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval from coded databases"
    - "index coding and network coding via rank minimization"
    - "a matrix completion approach to linear index coding problem"
    - "on the security of index coding with side information"

Connected through hyperedge HE-3 (induced by source paper "private broadcasting an index coding approach"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "content type coding"
    - "on the security of index coding with side information"

Connected through hyperedge HE-4 (induced by source paper "oblivious transfer over wireless channels"):
  with members:
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets"
    - "mimo precoding with x and y codes"
    - "the secrecy capacity of the mimo wiretap channel"
    - "commitment capacity of discrete memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "zero error function computation through a bidirectional relay"):
  with members:
    - "on network coding for sum networks"
    - "optimal function computation in directed and undirected graphs"

Connected through hyperedge HE-6 (induced by source paper "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"):
  with members:
    - "assisted common information with an application to secure two party sampling"

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.IT(Information Theory)