IP Library Granted Patent US 12,585,674
Granted Patent B2
US 12,585,674 · App. 18/946,810 · Granted Mar 24, 2026

Metadata tag auto-application to posted entries

Inventors: Satyavrat Mudgil (Bengaluru, IN); Anant Sitaram (San Ramon, CA)
Assignee: Tekion Corp
G06F16/285G06F16/245G06N5/04G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,585,674
App. No.
18/946,810
Granted
Mar 24, 2026
Kind
B2
Abstract

A system and a method are disclosed for receiving, from a source of a plurality of candidate sources, a payload comprising content and metadata. The system selects a destination to which to route the payload based on the source and the content, and generates an entry at the destination based on the content. The system inputs the metadata into a classification engine, and receives, as output from the classification engine, one or more classifications for the payload. The system applies a metadata tag to the entry, the metadata tag indicating the one or more classifications. The system receives a search request from a client device specifying at least one of the one or more classifications, and, in response to receiving the search request, provides the entry to the client device based on a matching classification.

Claims (64)

1 . A non-transitory computer-readable medium comprising memory with instructions encoded thereon, the instructions, when executed, causing one or more processors to perform operations, the instructions comprising instructions to:

receive a search query, the search query comprising a classification;

search entries tagged with the classification, the classification reducing a search space to entries having a metadata tag indicating the classification; and

return a search result having data matching the search query, wherein data entries within the search space are generated by:

receiving, from a source of a plurality of candidate sources, a payload comprising content and metadata;

selecting a destination to which to route the payload based on the source and the content;

generating an entry at the destination based on the content;

inputting the metadata into a classification engine;

receiving, as output from the classification engine, one or more classifications for the payload; and

applying a metadata tag to the entry, the metadata tag indicating the one or more classifications.

2 . The non-transitory computer-readable medium of claim 1 , wherein each of the plurality of candidate sources generate payloads based on input into respective, different user interfaces.

3 . The non-transitory computer-readable medium of claim 1 , wherein selecting the destination to which to route the payload based on the source and the content comprises:

selecting a root of a plurality of candidate root based on the source, wherein each candidate root corresponds to a different one of the plurality of candidate sources;

selecting a leaf of the root, of a plurality of candidate leaves, based on the content, wherein the leaf corresponds to the destination.

4 . The non-transitory computer-readable medium of claim 1 , wherein the classification engine identifies the one or more classifications by comparing the metadata to entries of a database, the entries corresponding candidate metadata to corresponding classifications.

5 . The non-transitory computer-readable medium of claim 1 , wherein the classification engine is a machine learning model that takes the metadata as input and outputs probabilities corresponding to candidate classifications, and wherein receiving the one or more classifications for the payload comprises:

receiving the probabilities;

identifying one or more respective probabilities that meet or exceed a threshold; and

selecting the one or more candidate classifications based on their respective probabilities having met or exceeded the threshold.

6 . The non-transitory computer-readable medium of claim 5 , wherein the machine learning model is trained using training data comprising combinations of metadata paired with labels, the labels indicating a classification corresponding to the combinations of metadata.

7 . The non-transitory computer-readable medium of claim 1 , wherein generating the entry comprises determining a discrepancy between a value stored at the destination, and a corresponding value shown within the contents, and wherein the data entries are further generated by providing an identification of the discrepancy to a client device performing a search request that specifies the classification.

8 . A computer-implemented method comprising:

receiving a search query, the search query comprising a classification;

searching entries tagged with the classification, the classification reducing a search space to entries having a metadata tag indicating the classification; and

returning a search result having data matching the search query, wherein data entries within the search space are generated by:

receiving, from a source of a plurality of candidate sources, a payload comprising content and metadata;

selecting a destination to which to route the payload based on the source and the content;

generating an entry at the destination based on the content;

inputting the metadata into a classification engine;

receiving, as output from the classification engine, one or more classifications for the payload; and

applying a metadata tag to the entry, the metadata tag indicating the one or more classifications.

9 . The computer-implemented method of claim 8 , wherein each of the plurality of candidate sources generate payloads based on input into respective, different user interfaces.

10 . The computer-implemented method of claim 8 , wherein selecting the destination to which to route the payload based on the source and the content comprises:

selecting a root of a plurality of candidate root based on the source, wherein each candidate root corresponds to a different one of the plurality of candidate sources;

selecting a leaf of the root, of a plurality of candidate leaves, based on the content, wherein the leaf corresponds to the destination.

11 . The computer-implemented method of claim 8 , wherein the classification engine identifies the one or more classifications by comparing the metadata to entries of a database, the entries corresponding candidate metadata to corresponding classifications.

12 . The computer-implemented method of claim 8 , wherein the classification engine is a machine learning model that takes the metadata as input and outputs probabilities corresponding to candidate classifications, and wherein receiving the one or more classifications for the payload comprises:

receiving the probabilities;

identifying one or more respective probabilities that meet or exceed a threshold; and

selecting the one or more candidate classifications based on their respective probabilities having met or exceeded the threshold.

13 . The computer-implemented method of claim 12 , wherein the machine learning model is trained using training data comprising combinations of metadata paired with labels, the labels indicating a classification corresponding to the combinations of metadata.

14 . The computer-implemented method of claim 8 , wherein generating the entry comprises determining a discrepancy between a value stored at the destination, and a corresponding value shown within the contents, and wherein the method further comprises providing an identification of the discrepancy to a client device performing a search request that specifies the classification.

15 . A system comprising:

memory with instructions encoded thereon; and

one or more processors that, when executing the instructions, are caused to perform operations comprising:

receiving a search query, the search query comprising a classification;

searching entries tagged with the classification, the classification reducing a search space to entries having a metadata tag indicating the classification; and

returning a search result having data matching the search query, wherein data entries within the search space are generated by:

receiving, from a source of a plurality of candidate sources, a payload comprising content and metadata;

selecting a destination to which to route the payload based on the source and the content;

generating an entry at the destination based on the content;

inputting the metadata into a classification engine;

receiving, as output from the classification engine, one or more classifications for the payload; and

applying a metadata tag to the entry, the metadata tag indicating the one or more classifications.

16 . The system of claim 15 , wherein each of the plurality of candidate sources generate payloads based on input into respective, different user interfaces.

17 . The system of claim 15 , wherein selecting the destination to which to route the payload based on the source and the content comprises:

selecting a root of a plurality of candidate root based on the source, wherein each candidate root corresponds to a different one of the plurality of candidate sources;

selecting a leaf of the root, of a plurality of candidate leaves, based on the content, wherein the leaf corresponds to the destination.

18 . The system of claim 15 , wherein the classification engine identifies the one or more classifications by comparing the metadata to entries of a database, the entries corresponding candidate metadata to corresponding classifications.

19 . The system of claim 15 , wherein the classification engine is a machine learning model that takes the metadata as input and outputs probabilities corresponding to candidate classifications, and wherein receiving the one or more classifications for the payload comprises:

receiving the probabilities;

identifying one or more respective probabilities that meet or exceed a threshold; and

selecting the one or more candidate classifications based on their respective probabilities having met or exceeded the threshold.

20 . The system of claim 19 , wherein the machine learning model is trained using training data comprising combinations of metadata paired with labels, the labels indicating a classification corresponding to the combinations of metadata.

Assignments (2)
SECURITY INTEREST Recorded Mar 2, 2026
From: TEKION CORP
To: MUFG BANK, LTD.
Reel/Frame 075012/0335 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 26, 2024
From: MUDGIL, SATYAVRAT; SITARAM, ANANT
To: TEKION CORP
Reel/Frame 069412/0263 →
Continuity (4)
Continuation 18224438 · Jul 20, 2023
Continuation 17379463 · Jul 19, 2021
Continuation 17175284 · Feb 12, 2021
Related Publication 20250068656A1 · Feb 27, 2025
References Cited (18)
US 8190769B1 · Shukla et al. · 2012 [cited by applicant]
US 11080308B1 · Mudgil et al. · 2021 [cited by applicant]
US 20050015712A1 · Plastina et al. · 2005 [cited by applicant]
US 20140029615A1 · Baldwin et al. · 2014 [cited by applicant]
US 20150149420A1 · Lee · 2015 [cited by applicant]
US 20180276561A1 · Pasternack et al. · 2018 [cited by applicant]
US 20180300390A1 · Burchard et al. · 2018 [cited by applicant]
US 20210026982A1 · Amarendran et al. · 2021 [cited by applicant]
US 20220138826A1 · Wang · 2022 [cited by examiner]
WO WO2018084860A1 · 2018 [cited by applicant]
Benzineb, K. et al., “Automated Patent Classification,” In: Current Challenges in Patent Information Retrieval, vol. 29, Jan. 2011, pp. 239-261. [cited by applicant]
European Patent Office, Extended European Search Report and Opinion, EP Patent Application No. 22753162.1, Sep. 17, 2024, 11 pages. [cited by applicant]
International Search Report and Written Opinion, Patent Cooperation Treaty Application No. PCT/US2022/015148, May 18, 2022, 10 pages. [cited by applicant]
Segal, R. B et al., “MailCat: An Intelligent Assistant for Organizing E-Mail,” Proceedings of the 3rd Annual Conference on Autonomous Agents, May 1999, pp. 276-282. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/175,284, Apr. 8, 2021, 10 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 17/379,463, Feb. 13, 2023, 17 pages. [cited by applicant]
United States Office Action, U.S. Appl. No. 18/224,438, Apr. 29, 2024, 16 pages. [cited by applicant]
Australian Patent Office, Examination Report, Australian Patent Application No. 2024200889, Oct. 23, 2025, 3 pages. [cited by applicant]