DETAILED ACTION
This action is responsive to continuation filed on September 30th, 2025.
Claims 1~20 are examined.
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 09/30/25 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Double Patenting
The nonstatutory 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 nonstatutory 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 nonstatutory 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 §§ 706.02(l)(1) - 706.02(l)(3) 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).
Claims 1~20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1~20 of U.S Patent 12,437,067. Although the claims at issue are not identical, they are not patentably distinct from each other because the additional elements in the instant application such as utilization of an RNN, hidden layers, and vector matrices (or tensors) are inherently mathematical transformations thus would have been obvious for one of ordinary skill in the art to apply the features of an RNN to process text of filenames to determine or predict whether filename was randomly generated. Doing so would allow a security analyst to determine whether the file is malware or benign more accurately. Claims 1 of the instant application and the patent for comparison is provided below:
Instant Application 19/293,950
U.S Patent 12,437,067
1. A computer-implemented method, comprising: performing a training process on a character-level recurrent neural network (RNN) on a training set of historical text filenames with each of the training set of historical text filenames is assigned to one of a plurality of classes, wherein the character-level RNN is comprised of an input layer, one or more hidden layers, an output layer, and an activation function layer; obtaining a text filename for which a suspiciousness score is to be generated; generating a set of character vectors where each character of the text filename is represented by an individual character vector of the set of character vectors; generating a set of character-level class predictions for the text filename by processing each character by: feeding a character vector to the input layer of the character-level RNN, updating a hidden state of the character-level RNN based on the character vector, generating a character-level class prediction based on the character vector and the hidden state, and sequentially feeding subsequent character vectors to the input layer of the character- level RNN resulting in generation of subsequent character-level class predictions; and generating a suspiciousness score for the text filename based on a character-level class prediction of a final character of the text filename.
1. A computer-implemented method, comprising: performing text pre-processing on a filename resulting in a pre-processed filename; generating a tensor from the pre-processed filename; deploying a character-level recurrent neural network (RNN) by feeding the tensor as input thereto, wherein the character-level RNN includes a first linear layer that is configured to analyze the pre-processed filename character-by-character resulting in a RNN output; converting the RNN output to a prediction score by obtaining an exponent of the RNN output; performing a threshold comparison between the prediction score and a suspiciousness threshold; and generating a graphical user interface indicating that the filename is suspicious when the threshold comparison was not satisfied.
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.
Claims 1~20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter.
Step 2A Prong One: Claims 1 and 15 recite:
Claims 1 and 15 recite: “performing a training process on a character-level recurrent neural network (RNN) on a training set of historical text filenames with each of the training set of historical text filenames is assigned to one of a plurality of classes, wherein the character-level RNN is comprised of an input layer, one or more hidden layers, an output layer, and an activation function layer; obtaining a text filename for which a suspiciousness score is to be generated; generating a set of character vectors where each character of the text filename is represented by an individual character vector of the set of character vectors; generating a set of character-level class predictions for the text filename by processing each character by: feeding a character vector to the input layer of the character-level RNN, updating a hidden state of the character-level RNN based on the character vector, generating a character-level class prediction based on the character vector and the hidden state, and sequentially feeding subsequent character vectors to the input layer of the character- level RNN resulting in generation of subsequent character-level class predictions; and generating a suspiciousness score for the text filename based on a character-level class prediction of a final character of the text filename.”
The limitation, as drafted, is a process that, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of generic computer components. That is, other than reciting, “computing device” and “medium”, nothing in the claim elements preclude the steps from practically being performed in the mind. For example, but for the reciting “computing device” and “medium”, language, “performing…”, “obtaining…“generating…”, “generating…”, and “generating…” in the context of these claims encompasses concepts of a training process on a character-level recurrent neural network (RNN), generating character vectors, updating hidden states, and generating class predictions. These steps represent mathematical algorithms, formulas, and statistical models applied to text data. The core concept of analyzing a string of characters (a filename) one by one to determine if it is "suspicious" based on historical patterns is an activity that can be (and historically has been) performed in the human mind or using a pencil and paper. If a claim limitation, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of generic computer components, then it falls within the “Mental Processes” grouping of abstract ideas. Accordingly, the claims recite an abstract idea.
Step 2A Prong Two: This judicial exception is not integrated into a practical application because:
1. The claims recite additional elements reciting, “computing device” and “medium”, which are recited at a high-level of generality such that it amounts no more than mere instructions to apply the exception using a generic computer component. Accordingly, this additional element does not integrate the abstract idea into a practical application because it does not impose any meaningful limits on practicing the abstract idea.
2. The claims do not recite additional elements which taken individually amounts to adding insignificant extra solution activity to the judicial exception. Accordingly, this additional element does not integrate the abstract idea into a practical application because claims 1 and 15 as a whole is silent regarding specific limitations directed to improving a computer system, processor, memory, network, database, or the Internet, nor do Applicants direct any attention to such specific limitations.
Accordingly, claims 1 and 15 are directed to an abstract idea.
Step 2B: Claims 1 and 15 do not include additional elements that are sufficient to amount to significantly more than the judicial exception.
As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of “computing device” and “medium”, amount to no more than mere instructions to apply the exception using a generic computer component. Mere instructions to apply an exception using a generic computer component cannot provide an inventive concept.
Software elements such as “input layer,” “hidden layers,” “an output layer,” and an “activation function layer” are components that represent standard, conventional features of a generic Recurrent Neural Network (RNN). The specification does not disclose any improvements to the functioning of the computer or the neural network architecture itself. The sequential steps of feeding data into a network, updating an internal state, and generating an output based on the final token are the well-known, routine, and conventional functions of standard character-level RNNs (e.g., standard text classification or sequence-to-sequence modeling). The claims merely applies standard machine learning techniques to a specific data type ("historical text filenames") to achieve a predictable result ("generating a suspiciousness score"). It does not solve a technical problem in computer functionality or improve the operations of the network itself. Rather, it simply uses the network as a tool to process data. Lastly, courts recognize performing repetitive calculations, electronic recordkeeping, and storing and retrieving information in memory (see MPEP 2106.05(d)(II)).
Thus, taken alone, the additional elements do not amount to significantly more than a judicial exception. Looking at the limitations as an ordered combination adds nothing that is not already present when looking at the elements taken individually. There is no indication that the combination of elements improves the functioning of a computer or improves any other technology. The claims when read as an ordered combination is not significantly more than a judicial exception. For these reasons, claims 1 and 15 are not patent eligible.
Regarding dependent claims 2~14 and 16~20
Claims 2~14 and 16~20 recite elements/limitations that also fall within the “Mental Processes” grouping of abstract ideas and/or elements/limitations that are insignificant extra solution activity which simply appends well-understood, routine and conventional activities previously known to the industry, specified at a high level of generality, to the judicial exception.
Looking at the limitations as an ordered combination adds nothing that is not already present when looking at the elements taken individually. There is no indication that the combination of elements improves the functioning of a computer or improves any other technology. The claims when read as an ordered combination is not significantly more than a judicial exception. For these reasons, claims 2~14 and 16~20 are not patent eligible.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to HEE SOO KIM whose telephone number is (571)270-3229. The examiner can normally be reached M-F 9AM-5PM.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Nicholas Taylor can be reached on (571) 272-3889. 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.
/HEE SOO KIM/Primary Examiner, Art Unit 2443