Before revision:  Our proposed model, entitled Network Centrality Approximation using Graph Embedding (NCA-GE), receives  the adjacency matrix of a graph and the degree of every node as input and computes the approximate desired centrality rank for every node.
After revision:  Our proposed model, entitled Network Centrality Approximation using Graph Embedding (NCA-GE), receives the adjacency matrix of a graph and a set of features for each node (here, we use only the degree) and computes the approximate desired centrality rank for every node.