NAISC-L users and are completed when users actively update the Interlink Graph with the additions, deletions or revisions they have made to the linkset. A linkset has only one named graph that contains all of its active interlinks. This design allows for simple and efficient querying of the interlinks. 2. Provenance graph: This is a named graph, in the form of a prov:Bundle, that contains the provenance **data** of the links in an Interlink Graph. Multiple provenance graphs can be associated with one Interlink Graph, as a new provenance graph is created for every interlinking session. A Provenance Graph contains the origin **data** of the interlinks created during an interlinking session, as well as the origin **data** for the linkset itself. It also provides a history of the interlink deletion and revision activities that occurred during an interlinking session. These descriptions are provided using RDF Reification (Manola and Miller 2004). 3. Relationship graph: This is a named graph containing a set of statements linking an Interlink Graph with its Provenance Graphs using the property prov:has_ Provenance. This property, which is part of PROV-AQ: Provenance Access and Query 17 (Moreau et al. 2013), specifies how to obtain a provenance record associated with a resource.