Identity Graph Opt-in Propagation via Primary Node Extraction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems for managing opt-ins in identity graphs face challenges in honoring user consent while maintaining the integrity and accuracy of the data structure, particularly in ensuring compliance with laws and regulations regarding personal data usage.
Innovation Solution
A method is introduced to propagate opt-in requests through an identity graph by traversing nodes and edges, selectively opting in touchpoint nodes, primary nodes, household node identifiers, and edges, ensuring that only relevant data is accessed and used, thereby maintaining data integrity and completeness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If opt-in requests are propagated through the entire identity graph to ensure complete user consent, then user privacy compliance is improved, but the complexity of managing opt-in status across multiple nodes increases
Solution Approach 1:
The patent extracts the opt-in status from individual nodes and centralizes it at the primary node level. When a user opts in through any touchpoint, the system extracts this consent status and propagates it to the primary node, which then manages the opt-in state for all associated touchpoints. This extraction approach simplifies management by consolidating consent tracking at a single location rather than distributing it across numerous nodes.
Solution Approach 2:
The patent merges the opt-in status of multiple touchpoint nodes into a single primary node. Instead of maintaining separate opt-in states for each touchpoint (email, phone, address), the system combines them under one unified opt-in status at the primary node level. This merging reduces complexity by consolidating multiple consent management operations into a single centralized control point.
2Reliability
If all nodes connected to a primary node are opted in when a touchpoint is opted in, then user consent coverage is improved, but the risk of unauthorized data access increases
Solution Approach 1:
The patent applies local quality by differentiating the opt-in propagation behavior based on the node type and its relationship to the primary node. Instead of uniformly opting in all connected nodes, the system selectively propagates opt-in status only to touchpoint nodes that are directly associated with the user's consent. Household nodes and other sensitive entities maintain their own independent opt-in requirements, applying different quality standards to different parts of the graph.
Solution Approach 2:
The patent segments the identity graph into distinct functional zones with different opt-in propagation rules. Touchpoint nodes (email, phone, address) are segmented as safe to propagate opt-in status, while household nodes and primary nodes are segmented as requiring independent consent. This segmentation allows the system to cover necessary touchpoints while isolating sensitive data areas from automatic opt-in propagation, reducing unauthorized access risk.
3Measurement precision
If the identity graph structure is modified to track opt-in status at multiple levels, then opt-in tracking accuracy is improved, but the data structure complexity increases
Solution Approach 1:
The patent implements preliminary action by pre-establishing the primary node as the central authority for opt-in management before any opt-in requests occur. The data structure is designed in advance with clear hierarchical relationships between primary nodes and touchpoint nodes, allowing the system to quickly determine propagation paths without complex real-time calculations. This preliminary structuring enables accurate opt-in tracking while maintaining relatively simple data operations.
Data Source
AI summary
A system and method for propagating an opt-in through an identity graph fully honors opt-in requests without otherwise modifying the graph data structure. From a node corresponding to the touchpoint of the opt-in, the graph is traversed to find the associated primary node, from which all connected edges are traversed. Nodes on paths that are not connected to other primary nodes are opted in, along with the primary node. Edges that lead to nodes which have edges to other primary nodes are not opted in, but only the edge from the primary node itself is opted in. If household nodes are used, an identifier for the person at the household node may be opted in without opting in other members of the household node by opting in only the edge between the primary opt-in node and the household node.


