# US 2026/0094007 A1 · System and method for generating ultimate reason codes for computer models

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

- Number: US 2026/0094007 A1
- Document ID: US20260094007A1
- Status: Published application
- Kind: A1
- Application number: 19/304,169
- Filed: 2025-08-19
- Published: 2026-04-02
- Earliest claimed: 2013-03-14
- Assignees: ElectrifAi, LLC
- Applicants: ElectrifAi, LLC
- Inventors: Joseph Milana; Yonghui Chen; Lujia Chen; Weiqiang Wang
- Web page: https://patentgrep.com/patent/US20260094007A1

## CPC

- G06N 5/00: Computing arrangements using knowledge-based models
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A system and method for generating ultimate reason codes for computer models is provided. The system for generating ultimate reason codes for computer models comprising a computer system for receiving a data set, and an ultimate reason code generation engine stored on the computer system which, when executed by the computer system, causes the computer system to train a base model with a plurality of reason codes, wherein each reason code includes one or more variables, each of which belongs to only one reason code, train a subsequent model using a subset of the plurality of reason codes, determine whether a high score exists in the base model, determine a scored difference if a high score exists in the base model, and designate a reason code having a largest drop of score as an ultimate reason code.

## Claims

### Claim 1

A system for generating ultimate reason codes for computer models comprising:
a computer system for receiving a data set;
an ultimate reason code generation engine stored on the computer system which, when executed by the computer system, causes the computer system to:
train a base model with a plurality of reason codes, wherein each reason code includes one or more variables, each of which belongs to only one reason code;
train a subsequent model using a subset of the plurality of reason codes;
determine whether a high score exists in the base model;
determine a scored difference if a high score exists in the base model; and
designate a reason code having a largest drop of score as an ultimate reason code.

### Claim 2 (depends on 1)

The system of claim 1, further comprising comparing a score difference between the base model and subsequent model.

### Claim 3 (depends on 1)

The system of claim 1, further comprising defining a next largest drop for a second ultimate reason code.

### Claim 4 (depends on 3)

The system of claim 3, wherein the ultimate reason codes are generated in real time.

### Claim 5 (depends on 1)

The system of claim 1, further comprising obtaining, for a high score record, one or more scores from the base model and subsequent model.

### Claim 6 (depends on 1)

The system of claim 1, further comprising ranking the reason codes based on relevance.

### Claim 7

A method for generating ultimate reason codes for computer models comprising:
receiving a data set at a computer system;
training a base model with a plurality of reason codes by an ultimate reason code generation engine stored on and executed by the computer system, wherein each reason code includes one or more variables, each of which belongs to only one reason code;
training by the ultimate reason code generation engine a subsequent model using a subset of the plurality of reason codes;
determining by the ultimate reason code generation engine whether a high score exists in the base model;
determining by the ultimate reason code generation engine a scored difference if a high score exists in the base model; and
designating by the ultimate reason code generation engine a reason code having a largest drop of score as an ultimate reason code.

### Claim 8 (depends on 7)

The method of claim 7, further comprising comparing a score difference between the base model and subsequent model.

### Claim 9 (depends on 7)

The method of claim 7, further comprising defining a next largest drop for a second ultimate reason code.

### Claim 10 (depends on 9)

The method of claim 9, wherein the ultimate reason codes are generated in real time.

### Claim 11 (depends on 7)

The method of claim 7, further comprising obtaining, for a high score record, one or more scores from the base model and subsequent model.

### Claim 12 (depends on 7)

The method of claim 7, further comprising ranking the reason codes based on relevance.

### Claim 13

A non-transitory computer-readable medium having computer-readable instructions stored thereon which, when executed by a computer system, cause the computer system to perform the steps of:
receiving a data set at the computer system;
training a base model with a plurality of reason codes by an ultimate reason code generation engine stored on and executed by the computer system, wherein each reason code includes one or more variables, each of which belongs to only one reason code;
training by the ultimate reason code generation engine a subsequent model using a subset of the plurality of reason codes;
determining by the ultimate reason code generation engine whether a high score exists in the base model;
determining by the ultimate reason code generation engine a scored difference if a high score exists in the base model; and
designating by the ultimate reason code generation engine a reason code having a largest drop of score as an ultimate reason code.

### Claim 14 (depends on 13)

The computer-readable medium of claim 13, further comprising comparing a score difference between the base model and subsequent model.

### Claim 15 (depends on 13)

The computer-readable medium of claim 13, further comprising defining a next largest drop for a second ultimate reason code.

### Claim 16 (depends on 15)

The computer-readable medium of claim 15, wherein the ultimate reason codes are generated in real time.

### Claim 17 (depends on 13)

The computer-readable medium of claim 13, further comprising obtaining, for a high score record, one or more scores from the base model and subsequent model.

### Claim 18 (depends on 13)

The computer-readable medium of claim 13, further comprising ranking the reason codes based on relevance.
