During backtracking, pseudo-nodes are expanded into an acyclic directed graph, i.e., our final category topic hierarchy H c .
after replacing the tags in a CT (see Fig.1) with the topics they belong to, we can then get a topic hierarchy H a = {T a , R a } for each article a.