Prosecution Insights
Last updated: July 17, 2026
Application No. 18/097,889

DISTRIBUTING OBJECTS ACROSS DEDUPLICATION DOMAINS BASED ON A STORAGE DISTRIBUTION MODE

Non-Final OA §103
Filed
Jan 17, 2023
Examiner
CORRIELUS, JEAN M
Art Unit
2159
Tech Center
2100 — Computer Architecture & Software
Assignee
Cohesity Inc.
OA Round
5 (Non-Final)
84%
Grant Probability
Favorable
5-6
OA Rounds
0m
Est. Remaining
97%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allowance Rate
863 granted / 1025 resolved
+29.2% vs TC avg
Moderate +13% lift
Without
With
+12.9%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
28 currently pending
Career history
1052
Total Applications
across all art units

Statute-Specific Performance

§101
13.5%
-26.5% vs TC avg
§103
54.7%
+14.7% vs TC avg
§102
14.0%
-26.0% vs TC avg
§112
6.0%
-34.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1025 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . This office action is in response to the Appeal brief filed on March 30, 2026, in which claims 6, 8, 13 and 15 were cancelled and claims 1-5, 7, 9-12, 14 and 16-20 are presented for further examination. Response to Arguments Applicant’s arguments with respect to claims 1-5, 7, 9-12, 14 and 16-20 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument set forth in the Appeal Brief. Remark Note that the claim invention is involved in grouping objects by shared attributes and dynamically choosing how to distribute each group across storage clusters based on optimization criteria. If deduplication is favored, the objects are stored in one cluster; if faster restore is needed, the objects are spread across multiple clusters for parallel backup/restore handling. A cloud-based management service then causes the selected mode to be implemented and keeps track of the storage locations. Applicant should duly note that the method claims include conditional steps. The precedential PTAB decision (Ex Parte Schulhauser) clarified that conditional limitations in method claims generally carry no patentable weight. Ex Parte Schulhauser involved an appeal of a patent application for implantable medical devices for monitoring cardiac conditions, where the claims included conditional steps—for example, performing certain monitoring actions only if specific physiological criteria were met. The PTAB reviewed claims 1 and 11, representing method and system claims, respectively, and addressed whether conditional language in these claims affected patentability. The PTAB held that conditional steps in method claims do not carry patentable weight. This means that if a step is performed only when a condition is met, an anticipatory reference or combination of references need only disclose one of the conditional paths to render the claim obvious. For example, in Schulhauser, a method claim had two mutually exclusive paths: one including steps A, B, C, and the other including steps A, B, D-H. The Board determined that the broadest reasonable interpretation of the claim could cover only the first path, making it obvious over prior art that disclosed steps 1–3 Therefore, based on the precedential PTAB decision, the method claims 1-5, 7, 9-12, 14 and 16-18 include conditional limitations that carry no patentable weight. A new ground of rejection is as follow. 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, 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. Claims 1-5, 7, 9-12, 14 and 16-18 are rejected under 35 U.S.C. 103 as being unpatentable over Filippi et al., (hereinafter “Filippi”) US 10,977,316 in view Ge et al., (hereinafter “Ge”) CN-115113800. As to claim 1, Filippi discloses a method comprising: identifying a plurality of objects sharing one or more common attributes (see fig.2, col.9, line 48-col.10, line 67, all the data that are collected from a plurality of sources and stored together according to the data type, which the forwarders that receive data from a variety of input data sources) ; determining a storage distribution mode for the plurality of objects sharing the one or more common attributes based at least in part on one or more optimization criteria, wherein the one or more optimization criteria are based on one or more of: an expected deduplication efficiency, a predicted deduplication efficiency, a target deduplication ratio, a recovery time objective, a recovery point objective, or a cluster performance metric (see fig.2 and col25, lines 10-25, the forwarders would identify which indexers would receive data collected from a data source based on cluster-related performance metrics); and in response to determining the storage distribution mode is a restore distribution mode, implementing the restore distribution mode by providing to a first storage cluster a first command to back up a first subset of the plurality of objects and providing to a second storage cluster a second command to back up a second subset of the plurality of objects, wherein the first storage cluster and the second storage cluster are different clusters (see fig.2, in response to identify the which indexer would receive the data collected from the source, forward the data to the appropriate indexers). Ge, see abstract, receives a cluster management request from the corresponding management node, the cluster management request is used for requesting to perform management operation for the storage cluster; based on the cluster management request, determining the target storage cluster in the plurality of storage clusters; sending the operation request to the target storage cluster, to request to perform the management operation storage cluster. Therefore, it would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to have modified the system of Filippi to manage a multi-cluster by using a computing device based on distributed storage system, disclosed by the system of Ge, in order to keep the storage clusters transparent to a user, thus avoiding presence of storage clusters for user operation trouble, and hence improving stability and reliability of the storage service. The combination of Filippi and Ge receives a data protection specification, wherein the data protection specification identifies a set of objects associated with a source system that are to be protected; identifying, from among the set of objects associated with the source system, the plurality of objects sharing one or more common attributes, wherein the common attributes comprise one or more of a source system, an object type, a size, an application, a retention policy, a creation date, a tag, a permissions group, a recovery time objective, a label, a prefix, an author, a geolocation, or a creator, wherein the storage distribution mode for the plurality of objects sharing the one or more common attributes is determined using one or more machine learning models, wherein a deduplication distribution mode is determined for the plurality of objects sharing the one or more common attributes based on a determination that the plurality of objects sharing the one or more common attributes are expected to have an expected deduplication ratio that is above a deduplication ratio threshold, wherein in response to determining the storage distribution mode is the deduplication distribution mode, implementing the deduplication distribution mode by providing to the first storage cluster a command to back up the plurality of objects sharing the one or more common attributes, wherein in response to receiving the command to back up the plurality of objects sharing the one or more common attributes, the first storage cluster requests data associated with the plurality of objects sharing the one or more common attributes from a source system, wherein the first storage cluster receives and stores the data associated with the plurality of objects sharing the one or more common attributes from the source system, wherein the one or more optimization criteria are based on restore distribution mode is determined for the plurality of objects sharing the one or more common attributes in response to a determination that a particular the recovery time objective is to be satisfied for the plurality of objects sharing the one or more common attributes, wherein in response to receiving the first command to back up the first subset of the plurality of objects, the first storage cluster requests data associated with the first subset of the plurality of objects from a source system, and wherein in response to receiving the second command to back up the second subset of the plurality of objects sharing one or more common attributes, the second storage cluster requests data associated with the second subset of the plurality of objects from the source system, wherein the first storage cluster stores the data associated with the first subset of the plurality of objects from the source system, and wherein the second storage cluster stores the data associated with the second subset of the plurality of objects from the source system; and updates a map that indicates a storage location for the plurality of objects sharing the one or more common attributes. Claim 20 is allowed in light of the prior art made of record. None of the prior art of record, singular and any order combination, provides to a first storage cluster a first command to back up a first subset of the plurality of objects and provides to a second storage cluster a second command to back up a second subset of the plurality of objects, wherein the first storage cluster and the second storage cluster are different clusters. This claimed features render claim 20 allow. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JEAN M CORRIELUS whose telephone number is (571)272-4032. The examiner can normally be reached Monday-Friday 6:30a-10p(Midflex). Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Ann J Lo can be reached at (571)272-9767. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /JEAN M CORRIELUS/Primary Examiner, Art Unit 2159 June 3, 2026
Read full office action

Prosecution Timeline

Show 15 earlier events
Sep 18, 2025
Response Filed
Nov 18, 2025
Final Rejection mailed — §103
Jan 30, 2026
Notice of Allowance
Jan 30, 2026
Response after Non-Final Action
Feb 19, 2026
Response after Non-Final Action
Mar 30, 2026
Response after Non-Final Action
Apr 16, 2026
Response after Non-Final Action
Jun 08, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12681938
Methods and Apparatus For Determining A Mood Profile Associated With Media Data
3y 6m to grant Granted Jul 14, 2026
Patent 12681927
LARGE LANGUAGE MODEL-BASED QUESTION PROCESSING METHOD AND APPARATUS, ELECTRONIC DEVICE, AND STORAGE MEDIUM
2y 0m to grant Granted Jul 14, 2026
Patent 12664137
SYSTEMS AND METHODS FOR GENERATING DATA LINEAGE AND TRACING DATA CHANGES
3y 4m to grant Granted Jun 23, 2026
Patent 12657021
SCHEMA TRANSFORMATION FOR MANAGING AN APPLICATION BUILD
3y 9m to grant Granted Jun 16, 2026
Patent 12651033
UTILIZING A QUERY RESPONSE TO AUTOMATE A TASK ASSOCIATED WITH A WEBPAGE
1y 8m to grant Granted Jun 09, 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

5-6
Expected OA Rounds
84%
Grant Probability
97%
With Interview (+12.9%)
2y 9m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 1025 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