Prosecution Insights
Last updated: October 02, 2026
Application No. 19/194,679

Virtual Drive Layer Storage And Replication Of External Datasets In A Cloud Environment

Final Rejection §103
Filed
Apr 30, 2025
Priority
Mar 10, 2017 — provisional 62/470,172 +9 more
Examiner
MOBIN, HASANUL
Art Unit
2168
Tech Center
2100 — Computer Architecture & Software
Assignee
Pure Storage Inc.
OA Round
2 (Final)
75%
Grant Probability
Favorable
3-4
OA Rounds
1y 11m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
519 granted / 689 resolved
+20.3% vs TC avg
Strong +39% interview lift
Without
With
+38.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
14 currently pending
Career history
701
Total Applications
across all art units

Statute-Specific Performance

§101
17.7%
-22.3% vs TC avg
§103
54.8%
+14.8% vs TC avg
§102
11.8%
-28.2% vs TC avg
§112
8.6%
-31.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 689 resolved cases

Office Action

§103
DETAILED ACTION Remarks This communication is in response to the amendment/arguments filed on June 9, 2026 has been fully considered. The rejection is made final. Claims 1-20 are pending for examination. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. Examiner Notes Examiner cites particular columns and line numbers in the references as applied to the claims below for the convenience of the applicant. Although the specified citations are representative of the teachings in the art and are applied to the specific limitations within the individual claim, other passages and figures may apply as well. It is respectfully requested that, in preparing responses, the applicant fully consider the references in entirety as potentially teaching all or part of the claimed invention, as well as the context of the passage as taught by the prior art or disclosed by the examiner. The examiner requests, in response to this Office action, support is shown for language added to any original claims on amendment and any new claims. That is, indicate support for newly added claim language by specifically pointing to page(s) and line no(s) in the specification and/or drawing figure(s). This will assist the examiner in prosecuting the application. When responding to this office action, Applicant is advised to clearly point out the patentable novelty which he or she thinks the claims present, in view of the state of the art disclosed by the references cited or the objections made. He or she must also show how the amendments avoid such references or objections See 37 CFR 1.111(c). Response to Amendment Applicant’s arguments/amendment filed on June 9, 2026, with respect to the rejection(s) of amended claim(s) 1-20 under 35 U.S.C. § 101 have been fully considered and are persuasive. Therefore, the rejection has been withdrawn. Response to Arguments Applicant's arguments filed June 9, 2026 have been fully considered but they are not persuasive. Applicant’s argument on pages 12-13 for claims 1, 11 and 19 that “Bk describe a cloud storage tier that stores object-based data via references to remote cloud storage, but fail to describe a virtual drive layer comprising cloud computing instances that provide block-based local storage and store data blocks at that layer, as claimed. … Bk's "cloud drives" do not store data blocks locally, but instead reference remote cloud storage capacity", is acknowledged but not deemed to be persuasive. Bk, Col 1, lines 34-49 discloses that the set of storage tiers comprises one or more storage tiers forming at least one storage array configured to store block-based data (i.e., storing data blocks) in association with the respective sets of storage drives of the one or more storage tiers. The set of storage tiers further comprises a storage tier utilizing a cloud infrastructure configured to store object-based data in association with the set of storage drives of the storage tier. Bk, Col 4, lines 19-35, Col 6, lines 38-42 discloses that storage from public/private cloud providers is used to provide a new virtual drive type called a “cloud drive.” This virtual drive forms a new tier (i.e., virtual drive layer) called “cloud tier” in the storage pool facilitating the data to be moved onto the cloud storage (i.e., receive and store the one or more data blocks of the dataset at a virtual drive layer of the cloud-based storage system and the virtual drive layer comprising one or more cloud computing instances with block-based local storage) A given cloud drive is a virtual drive that is composed of the private/public cloud storage capacity that is assigned to the given cloud drive. Bk, Col 5, lines 9-26 discloses tiering software 302 controls placement of data associated with a virtual storage pool 304 … Virtual storage pool 304 comprises … a cloud tier 318 which includes cloud drives 320. Bk, Col 6, lines 5-20 discloses that when tiering software 302 identifies the frigid data and selects the cloud tier 318 as the destination tier, the tiering software 302 issues the SCSI mappings to relocate the data from the source tier … to the cloud tier 318 … during relocation as the data is being written to the cloud tier 318. Since cloud tier 318 includes cloud drive 320 cloud tier 318 read as virtual drive layer stores data blocks locally. Therefore, Bk teaches above limitations of claim 1, 11 and 19 In response to Applicant’s argument on page 14 for claims 1, 11 and 19 that “The cited combination therefore fails to teach or suggest the claimed configuration in which a cloud-based storage system includes a virtual drive layer that actively receives and stores data blocks at cloud computing instances with block-based local storage", is acknowledged but not deemed to be persuasive. With a broadest reasonable interpretation (BRI), the recitation of “receive and store the one or more data blocks” does not necessarily means “actively receives and stores data blocks”. The recitation of Bk, Col 6, lines 5-9 “when tiering software 302 identifies the frigid data and selects the cloud tier 318” interpreted as cloud tier (i.e., virtual drive layer) receives and stores data blocks. Therefore, Bk teaches above limitations of claim 1, 11 and 19. In response to applicant’s argument on page 14 that there is no teaching, suggestion, or motivation to combine the references, the examiner recognizes that obviousness may be established by combining or modifying the teachings of the prior art to produce the claimed invention where there is some teaching, suggestion, or motivation to do so found either in the references themselves or in the knowledge generally available to one of ordinary skill in the art. See In re Fine, 837 F.2d 1071, 5 USPQ2d 1596 (Fed. Cir. 1988), In re Jones, 958 F.2d 347, 21 USPQ2d 1941 (Fed. Cir. 1992), and KSR International Co. v. Teleflex, Inc., 550 U.S. 398, 82 USPQ2d 1385 (2007). In this case, Powell and Bk are analogous art. They teaches in the same technology of the art. Powell [0051-0052], [0055] and Fig 2 discloses virtual volume and layer of virtualization. Powell [0039] disclose that replication of block based data may be implemented for and/or between any type of computing environment, and may be transferrable between physical devices and/or a cloud computing environment. Whereas, Bk, abstract discloses that the set of storage tiers comprises one or more storage tiers forming at least one storage array configured to store block-based data in association with the respective sets of storage drives of the one or more storage tiers. The set of storage tiers further comprises a storage tier utilizing a cloud infrastructure configured to store object-based data in association with the set of storage drives of the storage tier. Therefore, one would have been motivated to combine Powell with Bk for the benefit of providing Powell an application programming interface is configured to convert block-based data and object-based data for moving data between the one or more storage tiers associated with the storage array and the storage tier associated with the cloud infrastructure. Applicant’s argument on pages 14-15 for claims 7 and 15 that “Hirakawa therefore fails to teach or suggest that two or more storage systems collectively replicate the dataset to a target storage system. … "identify a portion of the dataset that is not being asynchronously replicated to the target storage system by any of the set of storage systems", is acknowledged but not deemed to be persuasive. Hirakawa [0125] discloses Numeral 280 represents a read of in the secondary storage system 100C from the secondary storage system 100B in asynchronization with the data updating and journal creation/storing into the primary storage system 100A and the secondary storage system 100B (i.e., two storage systems 100C and 100B asynchronously replicating dataset to the target storage 100A). Therefore, Hirakawa teaches above limitations of claims 7 and 15. Applicant’s argument on pages 15-16 for claims 8 and 16 that “Pangal does not teach or suggest "store, in object storage of the cloud-based storage system, the data", is acknowledged but not deemed to be persuasive. Pangal [0077] discloses the cloud storage array 500 (i.e., cloud based storage system) will generally use some type of REST-ful protocol on an internet connection. The back-end interface will generally allow the cloud storage array 500 to issue commands such as create a data storage object (i.e., object storage), update a data storage object (i.e., store data). Therefore, Pangal teaches above limitations of claims 8 and 16. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102 of this title, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. The factual inquiries set forth in Graham v. John Deere Co., 383 U.S. 1, 148 USPQ 459 (1966), that are applied for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claims 1-2, 11-12, and 19 are rejected under 35 U.S.C. 103 as being unpatentable over Powell et al. (US Patent Publication No. 2017/0155713 A1, ‘Powell’, hereafter, provided by the IDS) in view of Bk Suhas et al. (US Patent No. 10,534,566 B1, ‘Bk’, hereafter). Regarding claim 1. Powell teaches a storage system comprising: a cloud-based storage system; and a processing device, operatively coupled to the cloud-based storage system (Powell [0027] and Fig. 1 discloses clustered network environment 100 comprises data storage systems 102 and 104, Powell [0042] and Fig. 2 discloses that the node 202 comprises one or more processors 204, a memory 206, a network adapter 210, a cluster access adapter 212, and a storage adapter 214 interconnected by a system bus 242, Powell [0042] discloses that the operating system 208, portions of which are typically resident in the memory 206 and executed by the processing elements, functionally organizes the storage system by, among other things, invoking storage operations in support of a file service implemented by the storage system. Powell [0039], [0055-0057] and Fig. 1 discloses synchronous replication may be implemented for and/or between any type of computing environment, and may be transferrable between physical devices (e.g., node 116, node 118, etc.) and/or a cloud computing environment. Please also see “cloud computing environment (e.g., remote to the node 202 and/or the host device 205)”, Powell [0055] and Fig. 2. The nodes on clustered data storage systems can comprise network or host nodes that are interconnected as a cluster to provide data storage and management services, such as to an enterprise having remote locations, cloud storage, cloud computing environment, Powell [0030], [0039], [0055] and Fig. 1), configured to: identify a dataset that is being replicated across a set of storage systems that are external to a cloud environment (Powell [0055] and Fig. 2 discloses identifying data such as files, metadata, objects that are stored in the network node that are external to the cloud computing environment. “… synchronous replication may be implemented for the data storage system 200. In an example, a synchronous replication relationship may be established between the node 202 (e.g., a first storage controller) and another node (e.g., a second storage controller) (i.e., external storages external to the cloud environment). In this way, data operations, offloaded operations, error handling operations, SAN control operations, and/or other operations and use cases (e.g., data access, control, and metadata; offloaded and/or error handling operations on various storage containers such as files, SAN Logical Units, or Objects) may be synchronized between the node 202 and the other node (e.g., synchronization at a file or LUN level of granularity). It may be appreciated that synchronous replication may be implemented for and/or between any type of computing environment, and may be transferrable between physical devices (e.g., node 202, host device 205, etc.) and/or a cloud computing environment (i.e., remote to the node 202 and/or the host device 205)”. Please see also [0039], [0056-0059]); establish a connection to the set of storage systems (synchronous replication may be implemented within the clustered network environment 100. In an example, a synchronous replication relationship may be established between the node 116 (e.g., a first storage controller) and the node 118 (e.g., a second storage controller) … synchronous replication may be implemented for and/or between any type of computing environment, and may be transferrable between physical devices (e.g., node 116, node 118, etc.) and/or a cloud computing environment (i.e., establish a connection to the set of storage systems), Powell [0039], [0055]); determine, by a storage controller application within the cloud-based storage system, one or more data blocks of the dataset to receive (a data operation (i.e., reading and writing operation on a received data) may be received by the first storage controller, as illustrated in FIG. 4A. FIG. 4B illustrates the data operation being implemented in parallel by the first storage controller and the second storage controller. For example, the data operation may be locally implemented by the first storage controller. The data operation may be replicated to the second storage controller as a replication data operation that is remotely implemented by the second storage controller (i.e., determine, by a storage controller application within the cloud-based storage system, one or more data blocks of the dataset to receive), Powell [0065-0067]); and Powell does not teach receive and store the one or more data blocks of the dataset at a virtual drive layer of the cloud-based storage system, the virtual drive layer comprising one or more cloud computing instances with block-based local storage. However, Bk teaches receive and store the one or more data blocks of the dataset at a virtual drive layer of the cloud-based storage system, the virtual drive layer comprising one or more cloud computing instances with block-based local storage (Bk, Col 1, lines 34-49 discloses that the set of storage tiers comprises one or more storage tiers forming at least one storage array configured to store block-based data (i.e., storing data blocks) in association with the respective sets of storage drives of the one or more storage tiers. The set of storage tiers further comprises a storage tier utilizing a cloud infrastructure configured to store object-based data in association with the set of storage drives of the storage tier. Bk, Col 4, lines 19-35, Col 6, lines 38-42 discloses that storage from public/private cloud providers is used to provide a new virtual drive type called a “cloud drive”. This virtual drive forms a new tier (i.e., virtual drive layer) called “cloud tier” in the storage pool facilitating the data to be moved onto the cloud storage (i.e., receive and store the one or more data blocks of the dataset at a virtual drive layer of the cloud-based storage system and the virtual drive layer comprising one or more cloud computing instances with block-based local storage) A given cloud drive is a virtual drive that is composed of the private/public cloud storage capacity that is assigned to the given cloud drive. Bk, Col 5, lines 9-26 discloses tiering software 302 controls placement of data associated with a virtual storage pool 304 … Virtual storage pool 304 comprises … a cloud tier 318 which includes cloud drives 320. Bk, Col 6, lines 5-20 discloses that when tiering software 302 identifies the frigid data and selects the cloud tier 318 as the destination tier, the tiering software 302 issues the SCSI mappings to relocate the data from the source tier … to the cloud tier 318 … during relocation as the data is being written to the cloud tier 318. Since cloud tier 318 includes cloud drive 320 cloud tier 318 read as virtual drive layer stores data blocks locally). Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention was made having the teachings of Powell and Bk before him/her, to modify Powell with the teaching of Bk’s cloud storage tiering using application programming interface. One would have been motivated to do so for the benefit of providing Powell an application programming interface is configured to convert block-based data and object-based data for moving data between the one or more storage tiers associated with the storage array and the storage tier associated with the cloud infrastructure (Bk, Abstract). Regarding claim 2. Powell as modified teaches, wherein the processing device is further configured to: receiving a request to read a portion of the dataset; and processing the request to read the portion of the dataset locally (storage access request will be satisfied by local node, Powell [0030-0031], [0055]). Regarding claims 11-12, although claims 11-12 directed to a method, it is similar in scope to claims 1-2. The system steps of claims 1-2 substantially encompass the method recited in claims 11-12. Therefore; claims 11-12 are rejected for at least the same reason as claims 1-2 above. Regarding claim 19. Powell teaches a non-transitory computer readable storage medium having instructions stored thereon, that when executed by a processing device (a computer-readable medium comprising processor-executable instructions configured to implement one or more of the techniques presented herein … This computer-readable data 806, such as binary data comprising at least one of a zero or a one, in turn comprises a processor-executable computer instructions 804 configured to operate according to one or more of the principles set forth herein. In some embodiments, the processor-executable computer instructions 804 are configured to perform a method 802, such as at least some of the exemplary method 300 of FIG. 3, for example. In some embodiments, the processor-executable computer instructions 804 are configured to implement a system and method, Powell [0086-0088]), cause the processing device to: although claim 19 directed to a medium, it is similar in scope to claim 1. The system steps of claim 1 substantially encompass the medium recited in claim 19. Therefore; claim 19 is rejected for at least the same reason as claim 1 above. Claims 4-6 and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Powell et al. (US Patent Publication No. 2017/0155713 A1, ‘Powell’, hereafter) in view of Bk Suhas et al. (US Patent No. 10,534,566 B1, ‘Bk’, hereafter) and further in view of Chen et al. (US Patent Publication No. 2019/0303490 A1, ‘Chen’, hereafter). Regarding claim 4. Powell and Bk do not teach wherein the dataset is synchronously replicated across the set of storage systems. However, Chen teaches wherein the dataset is synchronously replicated across the set of storage systems (Chen [0047], [0064], [0071-0072]). Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention was made having the teachings of Powell, Bk and Chen before him/her, to further modify Powell with the teaching of Chen’s storage system with fast recovery and resumption of previously-terminated synchronous replication. One would have been motivated to do so for the benefit of providing Powell a storage system for highly efficient recovery and resumption of a synchronous replication process in the presence of one or more replication failure conditions in a manner that automatically maintains target replica consistency in the presence of potentially dependent mirrored host writes. The need for a time-consuming full data re-synchronization is advantageously avoided. Moreover, such advantages are provided without adversely impacting system performance (Chen, Abstract and [0006]). Regarding claim 5. Powell as modified teaches, wherein the dataset is asynchronously replicated across the set of storage systems (Chen [0047], [0064]). Regarding claim 6. Powell as modified teaches, wherein the dataset is replicated across the set of storage systems using snapshot-based replication (Chen [0008], [0069]). Regarding claim 20. Powell as modified teaches, wherein the virtual drive layer receives instructions from the storage controller application to perform data management operations on the received one or more data blocks (Chen [0022], [0031], [0045], [0050], [0200-0201], [0214-0215]). Claims 7 and 15 is/are rejected under 35 U.S.C. 103 as being unpatentable over Powell and Bk above and further in view of Hirakawa et al. (US 2005/0273565 A1, ‘Hirakawa’, hereafter). Regarding claim 7. Powell and Bk do not teach, wherein the processing device is further configured to: identifying a target storage system for asynchronously receiving the dataset, wherein the target storage system is not one of the of the set of storage systems across which the dataset is synchronously replicated; identifying a portion of the dataset that is not being asynchronously replicated to the target storage system by any of the set of storage systems; and asynchronously replicate, to the target storage system, the portion of the dataset that is not being asynchronously replicated to the target storage system by any of the set of storage systems, wherein two or more storage systems of the set of storage systems collectively replicate dataset to the target storage system. However, Hirakawa teaches wherein the processing device is further configured to: identifying a target storage system for asynchronously receiving the dataset, wherein the target storage system is not one of the of the set of storage systems across which the dataset is synchronously replicated (in the event of executing updating of replication target data in the storage system, a journal regarding the updating is created and stored into a storage area, and data replication is executed in accordance with the journal. Journals are retained in the individual storage systems, asynchronous and synchronous data replication, Hirakawa [0124-0125]); identifying a portion of the dataset that is not being asynchronously replicated to the target storage system by any of the set of storage systems (Hirakawa [0124-0125]); and asynchronously replicate, to the target storage system, the portion of the dataset that is not being asynchronously replicated to the target storage system by any of the set of storage systems, wherein two or more storage systems of the set of storage systems collectively replicate dataset to the target storage system (Hirakawa [0124-0125]). Therefore, it would have been obvious to one having ordinary skill in the art prior to the effective filing date of the claimed invention was made having the teachings of Powell, Bk and Hirakawa before him/her, to further modify Powell’s system to not only synchronously but also asynchronously replicate data among the data storage systems. Furthermore, it would have been obvious to one having ordinary skill in the art prior to the effective filing date to utilize incremental backup to asynchronously replicate data among the storage systems. Regarding claim 15, although claim 15 directed to a method, it is similar in scope to claim 7. The method steps of claim 15 substantially encompass the system recited in claim 7. Therefore; claim 15 is rejected for at least the same reason as claim 7 above. Claims 8-10 and 16-18 is/are rejected under 35 U.S.C. 103 as being unpatentable over Powell and Bk above and further in view of Pangal et al. (US Patent Publication No. 2011/0167221 A1, ‘Pangal’, hereafter). Regarding claim 8. Powell and Bk do not teach, wherein the processing device is further configured to: receive, by the storage system, a request to write data to the storage system; store, in solid-state storage of the cloud-based storage system, the data; and store, in object-storage of the cloud-based storage system, the data. However, Pangal teaches wherein the processing device is further configured to: receive, by the storage system, a request to write data to the storage system (write request to cloud storage system, Pangal [0084], [0113-0114] and Fig. 8); store, in solid-state storage of the cloud-based storage system, the data; and store, in object-storage of the cloud-based storage system, the data (write request to local storage system (i.e., solid state drive (SSD)), Pangal [0063] and [0115]). Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention was made having the teachings of Powell, Bk and Pangal before him/her, to further modify Powell with the teaching of Pangal’s system and method for efficiently creating off-site data volume back-ups. One would have been motivated to do so for the benefit of providing Powell a system and method for efficiently back-up data volumes. The data back-up system divides data volumes into fingerprinted data slices. Redundant data slices are then removed. Unique fingerprinted data slices are then copied to an internet based storage provider (i.e., cloud storage providers) (Pangal, Abstract and [0002-0005]). Regarding claim 9. Powell as modified teaches, wherein to store, in solid-state storage of the cloud-based storage system, the data, wherein the processing device is further configured to: store, in local storage of one or more cloud computing instances, the data (Pangal [0126], Fig. 3). Regarding claim 10. Powell as modified teaches, wherein to store, in object-storage of the cloud-based storage system, the data, wherein the processing device is further configured to: create one or more equal sized objects, wherein each equal sized object includes a distinct chunk of the data (Pangal [0016-0017], [0102-0103]). Regarding claims 16-18, the system steps of claims 8-10 substantially encompass the method recited in claims 16-18. Therefore, claims 16-18 are rejected for at least the same reason as claims 8-10 above. Allowable Subject Matter Claims 3 and 13 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims and overcome any objection and/or any rejection of the claims. With respect to claim 14 this claim would be allowable by the virtue of their dependency on objected claim 13 respectively. If the Applicant agreed to the allowable subject matter, Examiner respectfully request the Applicant to make the similar modification to the other independent claims. Conclusion THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to HASANUL MOBIN whose telephone number is (571)270-1289. The examiner can normally be reached on 9:30AM to 6:00PM EST M-F. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Charles Rones can be reached at 571-272-4085. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /HASANUL MOBIN/ Primary Examiner, Art Unit 2168
Read full office action

Prosecution Timeline

Apr 30, 2025
Application Filed
Mar 09, 2026
Non-Final Rejection mailed — §103
Jun 09, 2026
Response Filed
Aug 21, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12748973
NEURAL NETWORK OPTIMIZATION USING KNOWLEDGE REPRESENTATIONS
3y 6m to grant Granted Sep 29, 2026
Patent 12730791
COORDINATING STORAGE OPERATIONS BETWEEN STORAGE NODES OF A STORAGE SYSTEM
1y 7m to grant Granted Sep 08, 2026
Patent 12724744
SYSTEM FOR DATA STRUCTURE AND FILE MANAGEMENT BY SELECTING DATATYPES AND INTEGRATING DATA FROM STORED DATA
2y 2m to grant Granted Sep 01, 2026
Patent 12711425
MACHINE LEARNING EMBEDDINGS FOR EVOLVING CATEGORY SETS
3y 2m to grant Granted Aug 18, 2026
Patent 12711102
STORAGE SYSTEM CONFIGURATION BASED FILESYSTEM DESTINATIONS
1y 9m to grant Granted Aug 18, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
75%
Grant Probability
99%
With Interview (+38.8%)
3y 4m (~1y 11m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 689 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month