Hey everyone! We have a similar question as the previous conversation here: Is it possible / is there a preferred way to get all the permissions that connect two nodes in the graph? E.g. I have a user that has write and delete permission on a document, the operation would return both of these. We were thinking that we could either: - create a flattened version of the graph and search in that or - expand from the document interactions to get all the possible permissions (through an abstraction), then individually check for all the permissions Our concerns are that the flattened version might be tricky to create and maintain, while the expansion into 2-5 checks might be very costly.