Derives a tree of cards from the graph's own containment - repository, module, capability or package, type, member - so retrieval can descend structure rather than rank a flat list. Deterministic, fingerprinted against the graph it came from, and pinnable to a file.