One of the key reasons for using Docmaps is to enable consumers of the historical data about a document/manuscript to define their own notions of "acceptable science" and efficiently decide whether a given document meets that standard. Standard peer-review is an example of such a notion. In principle, we can move away from relying on a binary decision at all.
Using RDF/Semantic Web tools, we can express a bundle of acceptability rules as some inference rules and attempt to reason whether a given Docmaps graph meets the given criteria -- i suspect by inferring whether a "Certificate" (for example) can be inferred. This would allow a tool for consuming a docmap (web UI of some page such as bioRxiv, configured based on your account preferences; or a browser extension or other application) to be loaded with a set of rules (possibly some sane defaults), changed by the viewer if they want, and be presented with very clear summary of the acceptability of the document.
For this issue, we need to investigate whether inference is indeed the thing we mean to use for this behavior, and get a working example.
Unclear how the prov vocab would fit into this, and whether any graph-signing libraries/ontologies exist that would help support authentication.
One of the key reasons for using Docmaps is to enable consumers of the historical data about a document/manuscript to define their own notions of "acceptable science" and efficiently decide whether a given document meets that standard. Standard peer-review is an example of such a notion. In principle, we can move away from relying on a binary decision at all.
Using RDF/Semantic Web tools, we can express a bundle of acceptability rules as some inference rules and attempt to reason whether a given Docmaps graph meets the given criteria -- i suspect by inferring whether a "Certificate" (for example) can be inferred. This would allow a tool for consuming a docmap (web UI of some page such as bioRxiv, configured based on your account preferences; or a browser extension or other application) to be loaded with a set of rules (possibly some sane defaults), changed by the viewer if they want, and be presented with very clear summary of the acceptability of the document.
For this issue, we need to investigate whether inference is indeed the thing we mean to use for this behavior, and get a working example.
Unclear how the
provvocab would fit into this, and whether any graph-signing libraries/ontologies exist that would help support authentication.