# US 2026/0310450 A1 · Context-aware bug grouping and prioritization system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0310450 A1
- Document ID: US20260310450A1
- Status: Published application
- Kind: A1
- Application number: 19/098,685
- Filed: 2025-04-02
- Published: 2026-10-08
- Earliest claimed: 2025-04-02
- Assignees: Microsoft Technology Licensing, LLC
- Applicants: Microsoft Technology Licensing, LLC
- Inventors: Shubham AGARWAL; Vijay SONI; Vinay GUPTA
- Web page: https://patentgrep.com/patent/US20260310450A1

## CPC

- G06F 8/70: Software maintenance or management
- G06F 16/35: Clustering; Classification
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Provided herein are systems, methods, machine-readable media, and the like, for bug mitigation in a software application. A method includes receiving a bug report associated with a bug, the bug report including a title, reproduction steps, and a description, generating, by a transformer model, respective embeddings of the title and the description resulting in a title embedding and a description embedding, generating a functional intent signature (FIS) of the bug based on the reproduction steps, clustering the bug based on the FIS, the title embedding and the description embedding, determining the bug belongs to a highest priority cluster, and mitigating the bug responsive to determining the bug belongs to a highest priority cluster resulting in an updated software application.

## Claims

### Claim 1

A method for bug mitigation in a software application, the method comprising:
receiving a bug report associated with a bug, the bug report including a title, reproduction steps, and a description;
generating, by a transformer model, respective embeddings of the title and the description resulting in a title embedding and a description embedding;
generating a functional intent signature (FIS) of the bug based on the reproduction steps;
clustering the bug based on the FIS, the title embedding and the description embedding;
determining the bug belongs to a highest priority cluster; and
mitigating the bug responsive to determining the bug belongs to a highest priority cluster resulting in an updated software application.

### Claim 2 (depends on 1)

The method of claim 1, wherein the bug report further includes metadata indicating a compute platform on which the bug was realized and a timestamp indicating a date and time at which the bug experienced.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
generating a metadata vector that indicates the metadata; and
wherein the clustering is further performed based on the metadata vector.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
generating a graph in which the bug, and prior bugs, are represented as nodes and relationships between the nodes are indicated by labeled edges, the labeled edges including respective weight values indicating a likelihood that the bugs are related; and
wherein the clustering is further performed based on the graph.

### Claim 5 (depends on 1)

The method of claim 1, wherein generating the FIS includes:
determining probabilities of transitioning from a directly adjacent steps of the reproduction steps resulting in a transition matrix; and
determining Eigenvectors of the transition matrix;
wherein the FIS is formed based on the determined Eigenvectors.

### Claim 6 (depends on 5)

The method of claim 5, wherein generating the FIS further includes performing dimensionality reduction on the transition matrix, resulting in the FIS.

### Claim 7 (depends on 4)

The method of claim 4, wherein the clustering includes generating an adjacency matrix based on the graph, the adjacency matrix includes the bug, and the prior bugs, listed on columns and rows and entries include respective weight values indicating a likelihood that the bugs are related.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
determining a graph Laplacian of the adjacency matrix;
determining Eigenvectors of the graph Laplacian, resulting in graph Eigenvectors; and
clustering the bug represented by the graph based on the graph Eigenvectors.

### Claim 9 (depends on 8)

The method of claim 8, further comprising second clustering using hierarchical clustering.

### Claim 10 (depends on 1)

The method of claim 1, wherein clustering the bug includes matching an intent of the bug with corresponding intents of previously clustered bugs.

### Claim 11 (depends on 10)

The method of claim 10, wherein matching the intent includes identifying prior bugs with a similarity score that meet a specified criterion, the similarity scores indicate respective similarities between the titles, descriptions, and the FIS of respective prior bugs and the bug resulting in identified bugs.

### Claim 12 (depends on 11)

The method of claim 11, wherein matching the intent further includes:
comparing respective dependency graphs of the identified bugs to a dependency graph of the bug, the dependency graphs indicating code modules and file dependencies; and
identifying identified bugs that most closely match the bug based on the dependency graphs.

### Claim 13 (depends on 1)

The method of claim 1, further comprising determining a priority score for the bug and prior bugs based on a platform on which the bug was realized, how often the bug is reported, and the functionality of the software application that is affected by the bug.

### Claim 14 (depends on 13)

The method of claim 13, further comprising determining the bug belongs to the highest priority cluster by determining the bug is associated with a highest priority score.

### Claim 15

A non-transitory machine-readable medium including instructions that, when executed by a machine, cause the machine to perform operations for bug mitigation, the operations comprising:
receiving a bug report associated with a bug, the bug report including a title, reproduction steps, and a description;
generating, based on the bug report, a graph representing relationships between the bug and prior bugs, the graph including the bug, and the prior bugs represented as nodes and the relationships between the nodes are indicated by labeled edges, the labeled edges including respective weight values indicating a likelihood that the bugs are related;
generating an adjacency matrix based on the graph, the adjacency matrix includes the bug, and the prior bugs, listed on columns and rows and entries include respective weight values indicating a likelihood that the bugs are related;
clustering the bug based on the adjacency matrix; and
mitigating the bug responsive to determining the bug belongs to a cluster whose priority satisfies a specified criterion.

### Claim 16 (depends on 15)

The non-transitory machine-readable medium of claim 15, wherein the operations further comprise:
generating respective embeddings of the title and the description resulting in a title embedding and a description embedding;
generating a functional intent signature (FIS) of the bug based on the reproduction steps;
and wherein the relationships between the bug and the prior bugs is determined based on the title embedding, the description embedding, and the reproduction steps.

### Claim 17 (depends on 16)

The non-transitory machine-readable medium of claim 16, wherein generating the FIS includes:
determining probabilities of transitioning from a directly adjacent steps of the reproduction steps resulting in a transition matrix; and
determining Eigenvectors of transition matrix;
wherein the FIS is formed based on the determined Eigenvectors.

### Claim 18 (depends on 17)

The non-transitory machine-readable medium of claim 17, wherein generating the FIS further includes performing dimensionality reduction on the transition matrix, resulting in the FIS.

### Claim 19

A system comprising:
a vector database storing bug identifications and corresponding features, the features including a title embedding, a description embedding, and a functional intent signature (FIS) for each of the bugs;
a bug database storing the bug identifications and corresponding bug reports and cluster data for each of the bugs, the cluster data indicating a cluster of which the bug is a member; and
processing circuitry configured to:
receive a new bug report;
query the vector database to determine which bug associated with the bug identifications is most similar to bug associated with the bug report resulting in a most similar bug;
discard the bug report responsive to determining the bug associated with the bug report is identical to the most similar bug; and
increment a recurrence value associated with the cluster of which the most similar bug is a member resulting in an incremented recurrence value; and
increasing a priority value of the cluster based on the incremented recurrence value.

### Claim 20 (depends on 19)

The system of claim 19, wherein the processing circuitry is further configured to determine the FIS based on a graph in which the bug, and prior bugs, are represented as nodes and relationships between the nodes are indicated by labeled edges, the labeled edges including respective weight values indicating a likelihood that the bugs are related.
