# US 2026/0064688 A1 · Predicting data availability and scheduling data pulls

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

- Number: US 2026/0064688 A1
- Document ID: US20260064688A1
- Status: Published application
- Kind: A1
- Application number: 19/382,358
- Filed: 2025-11-07
- Published: 2026-03-05
- Earliest claimed: 2023-03-06
- Assignees: Plaid Inc.
- Applicants: Plaid Inc.
- Inventors: Vivek Manoj GANDHI; Jeremy MASON-HERR; Maksim ROZEN
- Web page: https://patentgrep.com/patent/US20260064688A1

## CPC

- G06F 16/24542: {Plan optimisation}
- G06F 16/2455: Query execution
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06N 20/00: Machine learning
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

In some implementations, a data aggregator may receive an indication associated with a data record. The data aggregator may apply a model to the indication to generate a prediction regarding when new information associated with the data record will be available. Based on the prediction, the data aggregator may refrain from requesting new information and may schedule a pull for new information associated with the data record for a later time. Additionally, or alternatively, the data aggregator may receive an indication associated with a plurality of data pulls that are associated with a plurality of data records and may receive an indication of a rate limit associated with a host for the plurality of data records. The data aggregator may apply rules to generate a ranking of the plurality of data pulls and may schedule the plurality of data pulls based on the ranking and the rate limit.

## Claims

### Claim 1

A device, comprising:
one or more memories; and
one or more processors, coupled to the one or more memories, configured to:
receive requests for pulls for new information associated with at least one data record;
generate a ranking of the pulls;
apply a model to generate a prediction for when the new information is likely to be available at a host device;
schedule at least one of the pulls based on the ranking and the prediction; and
transmit at least one request for the new information based on the scheduled at least one pull,
wherein the at least one request for the new information includes, as a parameter for one or more calls to an application programming interface (API) associated with the host device, one or more credentials associated with the at least one data record.

### Claim 2 (depends on 1)

The device of claim 1, wherein the one or more processors are further configured to:
receive an indication of a rate limit, wherein the rate limit includes one or more of:
a quantity of authentications within a time window, or
a quantity of API calls within a time window.

### Claim 3 (depends on 2)

The device of claim 2, wherein the one or more processors, to schedule the at least one of the pulls, are configured to:
schedule the at least one of the pulls based on the rate limit.

### Claim 4 (depends on 3)

The device of claim 3, wherein the one or more processors, to schedule the at least one of the pulls, are configured to:
schedule, for a first interval, one or more first pulls until the rate limit is reached; and
schedule, for a second interval, one or more second pulls,
wherein the one or more second pulls do not satisfy a time threshold or a probability threshold.

### Claim 5 (depends on 1)

The device of claim 1, wherein the one or more processors are further configured to:
receive, based on the at least one request, an update associated with the at least one data record.

### Claim 6 (depends on 5)

The device of claim 5, wherein the update includes a new copy of the at least one data record.

### Claim 7 (depends on 5)

The device of claim 5, wherein the one or more processors are further configured to:
transmit the update or an updated copy of the at least one data record to a user device.

### Claim 8

A non-transitory computer-readable medium storing a set of instructions, the set of instructions comprising:
one or more instructions that, when executed by one or more processors of a device, cause the device to:
receive requests for pulls for new information associated with at least one data record;
generate a ranking of the pulls;
apply a model to generate a prediction for when the new information is likely to be available at a host device;
schedule at least one of the pulls based on the ranking and the prediction; and
transmit at least one request for the new information based on the scheduled at least one pull,
wherein the at least one request for the new information includes, as a parameter for one or more calls to an application programming interface (API) associated with the host device, one or more credentials associated with the at least one data record.

### Claim 9 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the one or more processors are further configured to:
receive an indication of a rate limit, wherein the rate limit includes one or more of:
a quantity of authentications within a time window, or
a quantity of API calls within a time window.

### Claim 10 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the one or more instructions, that cause the device to schedule the at least one of the pulls, cause the device to:
schedule the at least one of the pulls based on the rate limit.

### Claim 11 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein the one or more instructions, that cause the device to schedule the at least one of the pulls, cause the device to:
schedule, for a first interval, one or more first pulls until the rate limit is reached; and
schedule, for a second interval, one or more second pulls,
wherein the one or more second pulls do not satisfy a time threshold or a probability threshold.

### Claim 12 (depends on 8)

The non-transitory computer-readable medium of claim 8, wherein the one or more instructions further cause the device to:
receive, based on the at least one request, an update associated with the at least one data record.

### Claim 13 (depends on 12)

The non-transitory computer-readable medium of claim 12, wherein the update includes a new copy of the at least one data record.

### Claim 14 (depends on 12)

The non-transitory computer-readable medium of claim 12, wherein the one or more instructions further cause the device to:
transmit the update or an updated copy of the at least one data record to a user device.

### Claim 15

A method, comprising:
receiving, by a device, requests for pulls for new information associated with at least one data record;
generating, by the device, a ranking of the pulls;
applying, by the device, a model to generate a prediction for when the new information is likely to be available at a host device;
scheduling, by the device, at least one of the pulls based on the ranking and the prediction; and
transmitting, by the device, at least one request for the new information based on the scheduled at least one pull,
wherein the at least one request for the new information includes, as a parameter for one or more calls to an application programming interface (API) associated with the host device, one or more credentials associated with the at least one data record.

### Claim 16 (depends on 15)

The method of claim 15, further comprising:
receiving an indication of a rate limit, wherein the rate limit includes one or more of:
a quantity of authentications within a time window, or
a quantity of API calls within a time window.

### Claim 17 (depends on 16)

The method of claim 16, wherein scheduling the at least one of the pulls comprises:
scheduling the at least one of the pulls based on the rate limit.

### Claim 18 (depends on 17)

The method of claim 17, wherein scheduling the at least one of the pulls comprises:
scheduling, for a first interval, one or more first pulls until the rate limit is reached; and
scheduling, for a second interval, one or more second pulls,
wherein the one or more second pulls do not satisfy a time threshold or a probability threshold.

### Claim 19 (depends on 15)

The method of claim 15, further comprising:
receiving, based on the at least one request, an update associated with the at least one data record.

### Claim 20 (depends on 19)

The method of claim 19, further comprising:
transmitting the update or an updated copy of the at least one data record to a user device.
