Are k-cores meaningful for temporal graph analysis?

Communities and dense substructures are one of the fundamental concepts in graph analysis, and the k-core is one of the most widely used models for its simplicity and effectiveness. As temporal graphs become more commonly available and larger, the algorithmic community is taking the fundamentals of static graph analysis and defining parallel concepts on temporal graphs. These adaptations, however, seem to follow the goal of being intuitive and concise, but there is yet to be a study showing whether they actually capture useful information in real temporal graphs.