US2024013302A1PendingUtilityA1

Systems and methods of creating order lifecycles via daisy chain linkage

Assignee: FIDELITY NAT INFORMATION SERVICES INCPriority: Aug 4, 2015Filed: Sep 25, 2023Published: Jan 11, 2024
Est. expiryAug 4, 2035(~9 yrs left)· nominal 20-yr term from priority
G06Q 40/04G06F 16/2365
81
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Systems, devices, and methods for linking orders to develop a consolidated audit trail (CAT) are configured to receive event data for one or more orders based on one or more order characteristics; determine linkages between the one or more orders based on parent relationships of the one or more orders; verify the linkages between the one or more orders based on the event data; and determine order lifecycles based on the linkages between the one or more orders.

Claims

exact text as granted — not AI-modified
1 . A computer system, comprising:
 a non-transitory memory; and   one or more hardware processors coupled to the non-transitory memory that execute instructions to perform operations comprising:   obtaining an order,   determining linkages of the order to previously received orders, and   in response to determining the order has a parent-child relationship to a previously received order,
 generating an order lifecycle of the order that includes linkage information of the order and previously received order, and 
 updating a previous order lifecycle of the previously received order to include linkage information of the order and previously received order. 
   
     
     
         2 . The computer system of  claim 1 , wherein the order lifecycle and previous order lifecycle are stored in a lifecycle matrix that includes linkage information that establishes a parent-child relationship between each order. 
     
     
         3 . The computer system of  claim 2 , wherein the lifecycle matrix identifies each order by a respective order identifier and a consolidated audit trail identifier. 
     
     
         4 . The computer system of  claim 1 , wherein the determining involves performing a graph walk to determine if the order is a child of a previously received order. 
     
     
         5 . The computer system of  claim 1 , wherein the determining involves searching a Bloom filter for an originator ID of a previously received order that is the same as an originator ID of the order. 
     
     
         6 . The computer system of  claim 5 , wherein the one or more hardware processors execute the instructions to perform:
 in response to determining the order has a parent-child relationship to a previously received order, updating the Bloom filter.   
     
     
         7 . The computer system of  claim 1 , wherein the one or more hardware processors execute the instructions to perform:
 in response to determining in response to determining the order does not have a parent-child relationship to a previously received order, generating a new order lifecycle.   
     
     
         8 . The computer system of  claim 1 , wherein the one or more hardware processors execute the instructions to perform:
 verifying the order lifecycle is valid by determining that the order has a linkage to a new order.   
     
     
         9 . The computer system of  claim 8 , wherein the one or more hardware processors execute the instructions to perform:
 in response to verifying the order lifecycle is valid, outputting a reporting presentation including the order lifecycle.   
     
     
         10 . The computer system of  claim 1 , wherein the one or more hardware processors execute the instructions to perform:
 detecting an order lifecycle error which is at least one selected from the group consisting of an order lifecycle that includes a fill order that is a parent order, an order lifecycle in which none of the orders of the order lifecycle is a new order, an order lifecycle in which none of the orders of the order lifecycle is a fill order, and an order lifecycle that includes a new order that is a child order.   
     
     
         11 . The computer system of  claim 10 , wherein the one or more hardware processors execute the instructions to perform:
 in response to detecting an order lifecycle error, outputting an error signal.   
     
     
         12 . A non-transitory computer readable medium having instructions stored therein, which when executed by a processor in a computer system causes the processor to execute a method comprising:
 obtaining an order,   determining linkages of the order to previously received orders, and   in response to determining the order has a parent-child relationship to a previously received order,
 generating an order lifecycle of the order that includes linkage information of the order and previously received order, and 
 updating a previous order lifecycle of the previously received order to include linkage information of the order and previously received order. 
   
     
     
         13 . The non-transitory computer readable medium of  claim 12 , wherein the order lifecycle and previous order lifecycle are stored in a lifecycle matrix that includes linkage information that establishes a parent-child relationship between each order. 
     
     
         14 . The non-transitory computer readable medium of  claim 13 , wherein the lifecycle matrix identifies each order by a respective order identifier and a consolidated audit trail identifier. 
     
     
         15 . The non-transitory computer readable medium of  claim 12 , wherein the determining involves performing a graph walk to determine if the order is a child of a previously received order. 
     
     
         16 . The non-transitory computer readable medium of  claim 12 , wherein the determining involves searching a Bloom filter for an originator ID of a previously received order that is the same as an originator ID of the order. 
     
     
         17 . The non-transitory computer readable medium of  claim 16 , wherein the method further comprises:
 in response to determining the order has a parent-child relationship to a previously received order, updating the Bloom filter.   
     
     
         18 . The non-transitory computer readable medium of  claim 12 , wherein the method further comprises:
 in response to determining in response to determining the order does not have a parent-child relationship to a previously received order, generating a new order lifecycle.   
     
     
         19 . The non-transitory computer readable medium of  claim 12 , wherein the method further comprises:
 verifying the order lifecycle is valid by determining that the order has a linkage to a new order; and   in response to verifying the order lifecycle is valid, outputting a reporting presentation including the order lifecycle.   
     
     
         20 . A method performed in a computer system, comprising:
 obtaining an order,   determining linkages of the order to previously received orders, and   in response to determining the order has a parent-child relationship to a previously received order,
 generating an order lifecycle of the order that includes linkage information of the order and previously received order, and 
   
       updating a previous order lifecycle of the previously received order to include linkage information of the order and previously received order.

Join the waitlist — get patent alerts

Track US2024013302A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.