Order-Agnostic Dynamic Citation Networks for Document Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional graph network generation technologies rely on specific read orders of documents, leading to erroneous networks that are immutable and require high precision in read order, often resulting in incomplete or incorrect relationships between documents.
Innovation Solution
A method and system for generating a dynamic graph network that allows documents to be added in any order, with nodes and edges adjusted based on document origination and modification dates, enabling updates and connections to be made dynamically.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional graph network generation relies on specific read order of documents, then the graph network structure is determined, but the network becomes erroneous and immutable when documents are added in wrong order
Solution Approach 1:
The patent implements a dynamic graph network where nodes and edges can be added, removed, or modified as documents are processed in any order. The system maintains document metadata (creation dates, modification dates) and uses this information to dynamically adjust the graph structure, allowing the network to adapt rather than requiring a fixed read order.
Solution Approach 2:
The system changes the state parameters of graph nodes and edges based on document metadata. When a document is added or updated, its creation date and modification date parameters are used to determine how existing connections should be adjusted, allowing the graph to reflect the true temporal relationships regardless of processing order.
2Stability of the object's composition
If conventional graph network generation establishes immutable connections, then the network structure is fixed, but any edits require adding new later-dated documents resulting in incomplete relationships
Solution Approach 1:
The system implements feedback mechanisms where adding or updating a document triggers re-evaluation of existing graph connections. The modification date parameter serves as feedback to determine whether existing edges should be updated or new edges created, ensuring the graph continuously reflects the most accurate document relationships.
Solution Approach 2:
The patent stores document metadata (creation dates, modification dates) as preliminary information before graph construction. This preliminary data allows the system to pre-determine the correct temporal relationships and connection structures, so when documents are processed in any order, the graph can be correctly assembled using this pre-stored temporal information.
3Measurement precision
If conventional technology requires high precision in read order, then correct relationships can be established, but the system becomes complex and error-prone
Solution Approach 1:
The patent introduces document metadata (creation dates, modification dates) as intermediary elements between the raw documents and the graph structure. These metadata parameters serve as mediators that automatically determine connection timing and direction, eliminating the need for complex read-order validation logic and simplifying the overall system.
Data Source
AI summary
A method and system for generating a dynamic graph network for a plurality of documents in a corpus are disclosed. The method includes analyzing a first document among the plurality of documents included in the corpus; generating a first node for the first document in the dynamic graph network; extracting one or more values included in the first document; assigning a key for each of the one or more values included in the first document; identifying at least one entity for the one or more values extracted from the first document; generating a second node for the at least one entity in the dynamic graph network; setting a status identifier for each of the first node and the second node generated; generating a first edge for the first node and the second node; and establishing a connection between the first node and the second node via the first edge.