There are a number of AP projects, like openEngiadina, that want to delve deeply into Linked Data capabilities. At the risk of saying stupid things by lack of knowledge, when looking at the Interop spec I see concepts that come close, not to auth/authz, but to the de-facto NodeInfo / NodeInfo2 standards. I believe NodeInfo was invented to convey the bare minimum of info about instances, while avoiding the complexity of exchanging the entire federation model in machine-readable way (added to this was the informal convention of providing a
FEDERATION.md for devs to figure that out more easily).
In this spec (which tbh seems to be very complex to me) there’s the definition of the
Application agent with properties such as
interop:applicationDescription, and it describes how agents (actors) register applications. In particular there are
interop:DataRegistration in such registries, that define a type and the shape of that type using Shape Trees Specification:
Semantic Web Applications interoperate by sharing semantics of terms and constellations of resource-oriented data structures. This specification defines shape trees, a mechanism for declaring and operating over constellations of resource-oriented data structures.