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 .
Claims 1-20 are pending for examination in the instant application.
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claim(s) 1-17 is /are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter. The claim(s) does/do not fall within at least one of the four categories of patent eligible subject matter. Regarding claim 1, the term "processors" may still be construed as encompassing software per se because [0046] broadly defines a processing system as one or more processors that perform computational tasks and further states that the processing system may exist as a SoC. In addition, [0047] explains that the SoC processing system may include "software for controlling integrated resources and processors, as well as peripheral devices," and the Specification does not expressly exclude software implementations from the scope of the claimed processors. However, this issue may be sufficiently overcome by further limiting the claims to recite, for example, "hardware processors" or processors associated with tangible hardware components such as "memory or storage devices."
Double Patenting
The non-statutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A non-statutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on non-statutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a non-statutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claims 1, 18 and 20 are rejected on the ground of non-statutory double patenting as being unpatentable over claims 1, 18 and 20 of U.S. Co-pending Application No. 19/079,984. Although the claims at issue are not identical, they are not patentably distinct from each other because see the table below:
Instant application: 19/080,002 Co-Pending application: 19/079,984
1. A computing system, comprising: a processing system comprising one or more processors configured to: receive input data associated with a unique decentralized identifier (DID),wherein the DID digitally represents an entity or an event; segment the input data into a plurality of encrypted data segments, wherein each encrypted data segment comprises a segment identifier cryptographically linked to the DID; distribute each encrypted data segment across decentralized storage nodes within a decentralized storage system, wherein: the decentralized storage nodes span multiple distributed computing platforms; and distribution comprises replicating encrypted data segments according to a redundancy scheme configured to maintain data availability; generate a lineage record corresponding to the input data, wherein the lineage record comprises cryptographic metadata comprising: the segment identifiers, a timestamp associated with creation of the encrypted data segments, and a cryptographic hash linked to the DID; store the lineage record within a decentralized ledger; and reconstruct the input data by retrieving, decrypting, and cryptographically verifying the plurality of encrypted data segments based upon the lineage record stored within the decentralized ledger in response to an authenticated access request referencing the DID.
1. A computing system, comprising: a processing system comprising one or more processors configured to: segment a dataset associated with a unique decentralized identifier (DID) into multiple encrypted data shards, each shard encrypted with a shard-specific cryptographic key linked to the DID; distribute each encrypted data shard to a corresponding decentralized storage node, wherein distribution includes replication according to a redundancy policy for fault tolerance; memorialize an event associated with the dataset as a cryptographically immutable event record within a distributed ledger, wherein the memorialized event record comprises: a cryptographic hash derived from the dataset; an event timestamp; and a reference linking the event record to the DID; detect, via sensors within the decentralized storage nodes, an anomaly indicating a potential unauthorized modification of stored data shards based upon monitored deviations from predefined operational thresholds; generate an automated security alert referencing the detected anomaly and including the DID and the event timestamp; and reconstruct the dataset by retrieving and decrypting the encrypted data shards from the decentralized storage nodes and verifying authenticity of each data shard by comparing cryptographic hashes of the retrieved data shards against the cryptographic hash recorded within the event record stored in the distributed ledger.
18. A computer-implemented method performed by a processing system in a computing system for decentralized data management across interoperable decentralized platforms, the method comprising: receiving input data associated with a unique decentralized identifier (DID), wherein the DID digitally represents an entity or an event; segmenting the input data into a plurality of encrypted data segments, each encrypted data segment having a segment identifier cryptographically linked to the unique identifier; distributing each encrypted data segment across decentralized storage nodes within a decentralized storage system, wherein: the decentralized storage nodes span multiple distributed computing platforms; and the distributing includes replicating encrypted data segments according to a redundancy scheme configured to maintain data availability; generating a lineage record corresponding to the input data, wherein the lineage record comprises cryptographic metadata including: the segment identifiers, a timestamp associated with creation of the encrypted data segments, and a cryptographic hash linked to the unique identifier; storing the lineage record within a decentralized ledger; and reconstructing the input data by retrieving, decrypting, and cryptographically verifying the plurality of encrypted data segments based on the lineage record stored within the decentralized ledger in response to receiving an authenticated access request referencing the unique identifier.
18. A computer-implemented method performed by a processing system for securely storing, accessing, and restoring data within a distributed computing system, the method comprising: segmenting a dataset associated with a unique decentralized identifier (DID) into multiple encrypted data shards, each shard encrypted with a shard-specific cryptographic key linked to the DID; distributing each encrypted data shard to a corresponding decentralized storage node, wherein distribution includes replication according to a redundancy policy for fault tolerance; memorializing an event associated with the dataset as a cryptographically immutable event record within a distributed ledger, the memorialized event record comprising: a cryptographic hash derived from the dataset, an event timestamp, and a reference linking the event record to the DID; detecting, by sensors within the decentralized storage nodes, an anomaly indicating a potential unauthorized modification of stored data shards based on monitored deviations from predefined operational thresholds; generating an automated security alert referencing the detected anomaly and including the DID and the event timestamp; and reconstructing the dataset by retrieving and decrypting the encrypted data shards from the decentralized storage nodes, verifying authenticity of each data shard by comparing cryptographic hashes of the retrieved data shards against the cryptographic hash recorded within the event record stored in the distributed ledger.
20. A non-transitory processor-readable storage medium having stored thereon processor- executable instructions configured to cause a processing system in a computing device to perform operations for decentralized data management across interoperable decentralized platforms, the operations comprising: receiving input data associated with a unique decentralized identifier (DID), wherein the DID digitally represents an entity or an event; segmenting the input data into a plurality of encrypted data segments, each encrypted data segment having a segment identifier cryptographically linked to the unique identifier; distributing each encrypted data segment across decentralized storage nodes within a decentralized storage system, wherein: the decentralized storage nodes span multiple distributed computing platforms; and the distributing includes replicating encrypted data segments according to a redundancy scheme configured to maintain data availability; generating a lineage record corresponding to the input data, wherein the lineage record comprises cryptographic metadata including: the segment identifiers, a timestamp associated with creation of the encrypted data segments, and a cryptographic hash linked to the unique identifier; storing the lineage record within a decentralized ledger; and reconstructing the input data by retrieving, decrypting, and cryptographically verifying the plurality of encrypted data segments based on the lineage record stored within the decentralized ledger in response to receiving an authenticated access request referencing the unique identifier.
20. A non-transitory processor-readable storage medium having stored thereon processor- executable instructions configured to cause a processing system in a computing device to perform operations for securely storing, accessing, and restoring data within a distributed computing environment, the operations comprising: segmenting a dataset associated with a unique decentralized identifier (DID) into multiple encrypted data shards, each shard encrypted with a shard-specific cryptographic key linked to the DID; distributing each encrypted data shard to a corresponding decentralized storage node, wherein distribution includes replication according to a redundancy policy for fault tolerance; memorializing an event associated with the dataset as a cryptographically immutable event record within a distributed ledger, the memorialized event record comprising: a cryptographic hash derived from the dataset, an event timestamp, and a reference linking the event record to the DID; detecting, by sensors within the decentralized storage nodes, an anomaly indicating a potential unauthorized modification of stored data shards based on monitored deviations from predefined operational thresholds; generating an automated security alert referencing the detected anomaly and including the DID and the event timestamp; and reconstructing the dataset by retrieving and decrypting the encrypted data shards from the decentralized storage nodes, verifying authenticity of each data shard by comparing cryptographic hashes of the retrieved data shards against the cryptographic hash recorded within the event record stored in the distributed ledger.
As can be seen from the above table both the inventions encompass over each other and trying to solve the same issue e.g., described is a decentralized data management across interoperable distributed platforms are disclosed. A computing system receives input data associated with a unique decentralized identifier (DID) representing an entity or event. The computing system segments the input data into encrypted data segments, each cryptographically linked to the DID, and distributes these encrypted segments across decentralized storage nodes according to a redundancy scheme. A cryptographic lineage record, including segment identifiers, timestamps, and hashes linked to the DID, is stored in a decentralized ledger. In response to authenticated access requests, the computing system reconstructs the input data by retrieving, decrypting, and cryptographically verifying the distributed data segments against the lineage record. Authorized entities access the reconstructed data through interfaces enforcing cryptographically secured access permissions defined within the decentralized ledger, providing enhanced security, provenance verification, and data resilience.
The difference being that the instant claims are broader than the conflicting claims and the conflicting claims contain specific information regarding interfaces and presentation of data. Hence the conflicting claims are a species of a genus of the instant claims.
The instant claims merely broaden the scope of the conflicting claims. It is well settled that broadening the scope of claims would have been obvious to one of ordinary skill in the art in view of the narrower issued claims. In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982) and In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993).
The dependent claims 2-17 and 19 carries the deficiencies from the base claim 1.
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Please see the attached PTO-892.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to TAUQIR HUSSAIN whose telephone number is (571)270-1247. The examiner can normally be reached M-F 7:00 - 8:00 with IFP.
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, Brian J Gillis can be reached at 571 272-7952. 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.
/Tauqir Hussain/Primary Examiner, Art Unit 2446
Prosecution Insights