Prosecution Insights
Prosecution Insights
4 pending office actions • 3 art units • 2 examiners • 0 of 4 (0%) have an AI response strategy ready • 3 patents granted in the last 365 days
Based on the USPTO statutory response window for each pending office action. 1 of the docket's apps have a known mailing date; the rest are excluded from the tile counts.
Difficulty is derived from the rejection statutes on the most recent pending office action. §101-driven and multi-statute cases are graded Hard; §112-only and obviousness-type double-patenting cases are graded Easy; everything else is Medium. "Unknown" means we have not yet parsed a statute for that office action.
| Bucket | Cases |
|---|---|
| §101 + other | 2 (50%) |
| §103 only | 2 (50%) |
How the docket's pending cases split across USPTO tech-center bands.
Manual office-action response work runs about 10 hours per case. The time-saved bands below show what IP Author's prosecution pipeline typically delivers — a conservative 20% on the low end, 35% in the middle, 50% on the high end.
| Examiner | Apps on this docket | Allow rate | Interview lift |
|---|---|---|---|
| CHEUNG, HUBERT G | 3 | 63.2% | +48.0% |
| MARI VALCARCEL, FERNANDO MARIANO | 1 | 50.0% | +19.5% |
Multi-statute / §101-driven matters, or cases in front of an examiner with an allow rate under 30%. The top 2 ordered by deadline are shown.
| App # | Title | Examiner | Due in |
|---|---|---|---|
| 19318514 | DATA SLABS AND SORTED SLABS OF A PARALLELIZED DATABASE SYSTEM | CHEUNG, HUBERT G | — |
| 19286847 | GENERATION OF AN OPTIMIZED QUERY PLAN WITH MULTIPLE EXECUTION PATHS | CHEUNG, HUBERT G | — |
Cases in front of an examiner whose interview lift is 10 percentage points or more — i.e. interviewed cases historically resolve more favorably than non-interviewed ones. The top 4 ordered by deadline are shown.
| App # | Title | Examiner | Due in |
|---|---|---|---|
| 18648342 | DISTRIBUTED DATABASE SYSTEM | CHEUNG, HUBERT G | 12d |
| 19318514 | DATA SLABS AND SORTED SLABS OF A PARALLELIZED DATABASE SYSTEM | CHEUNG, HUBERT G | — |
| 19286847 | GENERATION OF AN OPTIMIZED QUERY PLAN WITH MULTIPLE EXECUTION PATHS | CHEUNG, HUBERT G | — |
| 18796490 | DIVIDED MAIN MEMORY WITH COMPUTING DEVICE MEMORY SECTION AND DATABASE MEMORY SECTION | MARI VALCARCEL, FERNANDO MARIANO | — |
| Art Unit | Apps |
|---|---|
| 2161 | 1 |
| 2159 | 1 |
| 2152 | 1 |
| App # | Title | Examiner | Art Unit | Statutes | Status | Due in | AI | Filed |
|---|---|---|---|---|---|---|---|---|
| 19318514 | DATA SLABS AND SORTED SLABS OF A PARALLELIZED DATABASE SYSTEM | CHEUNG, HUBERT G | 2161 | §101§102§103 | Non-Final OA | — | Pending | Sep 04, 2025 |
| 19286847 | GENERATION OF AN OPTIMIZED QUERY PLAN WITH MULTIPLE EXECUTION PATHS | CHEUNG, HUBERT G | — | §101§103§112 | Non-Final OA | — | Pending | Jul 31, 2025 |
| 18796490 | DIVIDED MAIN MEMORY WITH COMPUTING DEVICE MEMORY SECTION AND DATABASE MEMORY SECTION | MARI VALCARCEL, FERNANDO MARIANO | 2159 | §103 | Non-Final OA | — | Pending | Aug 07, 2024 |
| 18648342 | DISTRIBUTED DATABASE SYSTEM | CHEUNG, HUBERT G | 2152 | §103 | Final Rejection | 12d | Pending | Apr 27, 2024 |
IP Author helps IP teams respond to office actions faster with AI-generated responses, examiner analytics, and prosecution intelligence.
Start Free Trial