Predicted data use obligation match using data differentiators

A computer-implemented method, comprising:

• receiving an intended use request, wherein the intended use request comprises (a) a plurality of unique logical data record set identifiers and (b) an intended use identifier;
• receiving a cross-link relationship graph structure stored in a data repository, wherein (a) the cross-link relationship graph structure comprises a plurality of cross-link relationship graph nodes, (b) each cross-link relationship graph node is connected to at least one of a plurality of cross-link relationship graph edges, and (c) each cross-link relationship graph node is associated with a respective logical data record set identifier of the unique logical data record set identifiers associated with the intended use request;
• and
• for each unique logical data record set identifier,
• traversing the cross-link relationship graph structure;
• and
• based at least in part on (i) the intended use identifier, (ii) a separation measure associated with each cross-link relationship graph node of one or more cross-link relationship graph nodes associated with the unique logical data record set identifier, and (iii) time associated with each cross-link relationship graph node, generate one or more data use obligation scores for the unique logical data record set identifier, wherein (a) each data use obligation score represents a likelihood that a data use obligation associated with a given cross-link relationship graph node is associated with the unique logical data record set identifier, and (b) the data use obligation comprises one or more data use restrictions that apply to one or more data record identifiers associated with the unique logical data record set identifier.

A computer program product comprising at least one non-transitory computer readable storage medium comprising computer code that, when executed by an apparatus, configure the apparatus to:

• receive an intended use request, wherein the intended use request comprises (a) a plurality of unique logical data record set identifiers and (b) an intended use identifier;
• receive a cross-link relationship graph structure from a data repository, wherein (a) the cross-link relationship graph structure comprises a plurality of cross-link relationship graph nodes, (b) each cross-link relationship graph node is connected to at least one of a plurality of cross-link relationship graph edges, and (c) each cross-link relationship graph node is associated with a respective logical data record set identifier of the unique logical data record set identifiers associated with the intended use request;
• and
• for each unique logical data record set identifier,
• traverse the cross-link relationship graph structure;
• and
• based at least in part on (i) the intended use identifier, (ii) a separation measure associated with each cross-link relationship graph node of one or more cross-link relationship graph nodes associated with the unique logical data record set identifier, and (iii) time associated with each cross-link relationship graph node, generate one or more data use obligation scores for the unique logical data record set identifier, wherein (a) each data use obligation score represents a likelihood that a data use obligation associated with a given cross-link relationship graph node is associated with the unique logical data record set identifier, and (b) the data use obligation comprises one or more data use restrictions that apply to one or more data record identifiers associated with the unique logical data record set identifier.