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 new upperbound for the oblivious transfer capacity of discrete memoryless channels"
  Abstract: We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels. The main tool we use is the tension region of a pair of random variables introduced in Prabhakaran and Prabhakaran (2014) where it was used to derive upper bounds on rates of secure sampling in the source model. In this paper, we consider secure computation of string oblivious transfer in the channel model. Our bound is based on a monotonicity property of the tension region in the channel model. We show that our bound strictly improves upon the upper bound of Ahlswede and Csisz\'ar (2013).

Connected through hyperedge HE-1 (induced by source paper "lower bounds for interactive function computation via wyner common information"):
  with members:
    - "information complexity is computable"
    - "assisted common information with an application to secure two party sampling"
    - "tension bounds for information complexity"
    - "the infinite message limit of two terminal interactive source coding"

Connected through hyperedge HE-2 (induced by source paper "multipartite monotones for secure sampling by public discussion from noisy correlations"):
  with members:
    - "on the duality of additivity and tensorization"
    - "assisted common information with an application to secure two party sampling"
    - "on the efficiency of classical and quantum secure function evaluation"
    - "the common information of n dependent random variables"

Connected through hyperedge HE-3 (induced by source paper "universal hashing for information theoretic security"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "principles of physical layer security in multiuser wireless networks a survey"

Connected through hyperedge HE-4 (induced by source paper "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "converses for secret key agreement and secure computing"
    - "secret key agreement general capacity and second order asymptotics"
    - "the complexity of estimating r enyi entropy"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "principles of physical layer security in multiuser wireless networks a survey"

Connected through hyperedge HE-5 (induced by source paper "converses for secret key agreement and secure computing"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "interactive communication for data exchange"
    - "information complexity density and simulation of protocols"
    - "secret key agreement general capacity and second order asymptotics"
    - "assisted common information with an application to secure two party sampling"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "on the efficiency of classical and quantum secure function evaluation"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"

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)