- Samsung Electronics Co., Ltd. v. Infobridge Pte. Ltd.No claims unpatentablePTAB · Apr 23, 2018 · IPR2017-00099 · APJ John P Pinkerton · IPR · Final written decision
Claims 1–7 were not proven unpatentable because Samsung did not establish that WD4 was a prior art printed publication under § 102(b).
RulingsFinal written decision- Novelty / Anticipation (§102) › Prior-art status of a reference › Printed publication / public accessibilityPrinted publication not establishedNot shown unpatentable
“evidence does not establish WD4 was indexed in a manner that one ordinarily skilled in the art, exercising reasonable diligence, could locate it. See Response 45. There is no evidence that the JCT-VC site provided users sufficient guidance on finding documents of interest. Importantly, there is no evidence that one could search for or locate WD4 based on its subject matter. Although the Torino document register contains the number, title, and source (i.e, authors’ names) of each document, the subject of the document is not listed or identified. See In re Cronyn, 890 F.2d 1158, 1160– 61 (Fed. Cir. 1989) (finding references were not publicly accessible, despite the use of indexing, because the references were indexed only by title and author’s name, rather than by subject). Furthermore, identifying a meeting location was key to navigating the JCT-VC site; however, there is no evidence showing that persons of skill in the art outside of JCT-VC would have had any knowledge or familiarity with the cities in which the JCT-VC meetings were conducted or that the names of the cities were helpful in any respect in locating a document on the site. For these reasons, the evidence does not support the conclusion by a preponderance of the evidence that persons interested and ordinarily skilled in the art at the time of the invention would have been aware of the JCT-VC document repository site, or that, if they were aware of the site, would have been able to locate the WD4 document relied upon by Samsung.” slip op. at 19
- Expert testimonyPetitioner expert discountedDecided for patent owner
“Mr. Bross’s testimony is conclusory and insufficiently factually supported. We understand Mr. Bross to be testifying in this regard as a fact witness pursuant to Federal Rule of Evidence 602, rather than as an expert witness pursuant to Federal Rule of Evidence 702. Under Rule 602, a fact witness may testify as to a matter only if “evidence is introduced sufficient to support a finding that the witness has personal knowledge of the matter.” Fed. R. Evid. 602. Here, Mr. Bross’s testimony is based on his “knowledge and recollection” and “the prominence of the JCT-VC” in the video coding industry. However, the particular factual knowledge on which the testimony is based is not described. Similarly, the “prominence” of the JCT-VC is nothing more than an unsupported assumption. We also find Mr. Bross has not been shown to have the requisite personal knowledge to testify about persons “who would regularly visit the JCT-VC site.” Even if we accepted Mr. Bross’s premise of the “prominence of the JCT-VC,” we would not find that to be a sufficient basis for Mr. Bross to reliably testify about persons “regularly visit[ing]” the JCT-VC site.” slip op. at 16
Patent outcomesUS 8,917,772 not shown unpatentable§ 102 anticipationPatents in suitUS 8,917,772 - NXP USA, Inc. v. Inside Secure And NFC Technology, LLCNo claims unpatentablePTAB · Aug 30, 2017 · IPR2016-00692 · APJ Patrick M Boucher · IPR · Final written decision
The Board held claims 1, 3, 7, 11, 12, 14, 18, and 22 not shown unpatentable over either § 103 combination because Petitioner failed to establish key routing-table and header-field limitations.
RulingsFinal written decision- Skill levelSkill level petitioner adoptedDecided for petitioner
“contends that a person of ordinary skill in the art at the time of the claimed invention would have “a minimum of a bachelor’s degree in electrical engineering, computer engineering, computer science, or a comparable field, and approximately two years of professional experience with data communications and routing, including in the context of wireless communications as applied to RFID systems, or other relevant industry experience.” Pet. 13 (citing Ex. 1003 ¶ 30). Patent Owner does not dispute” slip op. at 11
- Claim Construction › Threshold & procedure › Whether a term needs construction (O2 Micro)Term construed patent owner constructionOther
“Although the Federal Circuit has endorsed application of the broadest reasonable interpretation in construing claims during postgrant proceedings before the Board, it has cautioned that such endorsement “is not to say, however, that the Board may construe claims during IPR so broadly that its constructions are unreasonable under general claim construction principles.” Microsoft Corp. v. Proxyconn, Inc., 789 F.3d 1292, 1298 (Fed. Cir. 2015). “Rather, ‘claims should always be read in light of the specification and teachings in the underlying patent.’” Id. (quoting Suitco Surface, Inc., 603 F.3d 1255, 1260 (Fed. Cir. 2010)). In addition, “[t]he PTO should also consult the patent’s prosecution history in proceedings in which the patent has been brought back to the agency for a second review.” Id. (citing Tempo Lighting Inc. v. Tivoli LLC, 742 F.3d 973, 978 (Fed. Cir. 2014)). The Federal Circuit has emphasized that, even under the broadest reasonable interpretation, “the Board’s construction ‘cannot be divorced from the specification and record evidence,’” id. (quoting In re NTP, Inc., 654 F.3d 1279, 1288 (Fed. Cir. 2011)), and “‘must be consistent with the one that those skilled in the art would reach,’” Id. (quoting In re Cortright, 165 F.3d 1353, 1358 (Fed. Cir. 1999)). With these principles in mind, we determine that Patent Owner’s proposed construction conforms with the broadest reasonable interpretation of “header field,” which excludes the “routing parameters” that are saved in the “routing table.” At the oral hearing, Patent Owner conceded that “if you look at the term header field in a vacuum without any context, it could mean” slip op. at 14
- Obviousness (§103) › Graham factors (scope of art, differences, level of skill)Not shown unpatentableNot shown unpatentable
“unpatentability, we determine that there are multiple deficiencies with Petitioner’s showing with respect to the proposed combination as related to specifically recited claim limitations. See 35 U.S.C. § 316(e); 35 U.S.C. § 312(a) (requiring the petition to identify “in writing and with particularity . . . the grounds on which the challenge to each claim is based”); see also 37 C.F.R. § 42.104(b) (requiring “a statement of the precise relief request”). Because we find that even the combination, if effected in the manner proposed by Petitioner, does not meet all limitations recited in the challenged claims, we do not reach the issue of whether Petitioner articulates sufficient reasoning with rational underpinning to effect the combination. See Pet. 21–28; PO Resp. 21–47. First, we agree with Patent Owner that Petitioner insufficiently shows that the combination it proposes teaches or suggests “using the routing channel number as an index to select the destination point to which the 7 Although we rely on illustrations of Petitioner’s proposed combination as set forth in the Reply because they are more clear, we find those illustrations consistent with the position taken by Petitioner in the Petition. See Pet. 24– 27. controller subsequently sends the data.” PO Resp. 59–61. This limitation is recited in both independent claims 1 and 12 in the context of searching for a destination point of the data in the routing table. Ex. 1001, col. 19, ll. 6–9, col. 20, ll. 40–43. In articulating how it draws a correspondence between elements recited in the claims and entries of its proposed routing table, Petitioner makes the following identifications: (1) the recited “routing channel number” corresponds to the channel identifier in the inbound VCI allocated to a first data path defined by the card access module and router; (2) the recited “source point” corresponds to “an identifier of the SAP associated with a smart card application on the contact smart card . . . in the inbound ‘VPI’; and (3) the recited “destination point” corresponds to “an identifier of an SAP associated with software . . . in the outbound VPI.” Pet. 36. With these correspondences, we agree with Patent Owner that the channel identifier in the inbound VCI cannot function as an “index to select the destination point” as the claims require because there is no unique association of the outbound VPI with the inbound VCI.8 PO Resp. 59. This is evident from the table provided in the Reply, and reproduced above, in 8 Although we agree with Petitioner, as explained above in Section II.C.3, that a construction of “routing table” does not require a “one-to-one correspondence between the routing channel number and each corresponding routing parameter,” see PO Resp. 57 (emphasis added), the nature of an “index” nevertheless requires a unique association of the index with what it indexes. That is, an “index to select the destination point” must uniquely identify the selected destination point, even if the same destination point can be selected by multiple indexes. A “one-to-one” correspondence would additionally require that each destination point be selected only by a single index. which the same VCIin value of “Chin 1” is associated with different values of VPIout, namely “CPU SAP 1” in the first row and “RF SAP 1” in the third row.” slip op. at 29
- Strike new argumentNew argument disregardedDecided for patent owner
“Petitioner also contends that “even under [Patent Owner’s] improper interpretation, it would have been an obvious implementation choice to use unique channel numbers as discussed in §V.B [of the Reply], such that the destination point is selected only with the channel number.” Reply 27–28 (citing Ex. 1024 ¶ 123). We do not consider this argument because it goes beyond the scope of argument made in the Petition. Intelligent Bio-Systems, Inc. v. Illumina Cambridge Ltd., 821 F.3d 1359, 1369 (Fed. Cir. 2016) (“It is of the utmost importance that petitioners in the IPR proceedings adhere to the requirement that the initial petition identify ‘with particularity’ the ‘evidence that supports the grounds for the challenge to each claim’ [as required by 35 U.S.C. § 312(a)(3)].”).” slip op. at 31
Patent outcomesUS 7,905,419 not shown unpatentableClaim construction§ 103 obviousnesscites KSR · GrahamPatents in suitUS 7,905,419 - Elekta, Inc. v. Varian Medical Systems, Inc.No claims unpatentablePTAB · Jun 5, 2017 · IPR2016-00380 · APJ Patrick M Boucher · IPR · Final written decision
Claims 1, 2, and 4–9 were not shown unpatentable under either § 103 ground; claims 13 and 18 were canceled after Patent Owner’s motion to amend was granted.
RulingsFinal written decision- Claim Construction › Functional claiming / §112(f) means-plus-function › Whether §112(f) applies (Williamson, nonce words)§112(f) appliesDecided for patent owner
“Although a claim term that does not include the word “means” is presumed not to invoke a means-plus-function analysis, that presumption may be overcome if the limitation does not “recite sufficiently definite structure” or recites a “function without reciting sufficient structure for performing that function.” Williamson v. Citrix Online, LLC, 792 F.3d 2 Section 4(c) of the Leahy-Smith America Invents Act (“AIA”) redesignated 35 U.S.C. § 112, ¶ 6, as 35 U.S.C. § 112(f). Pub. L. No. 112- 29, 125 Stat. 284, 296 (2011). Because the ’703 patent has a filing date before September 16, 2012 (effective date of § 4(c)), we refer to the pre-AIA version of § 112. 1339, 1349 (Fed. Cir. 2015). Petitioner’s expert, Russell J. Hamilton, Ph.D., testifies that “the term ‘logic’ would not be recognized by one of ordinary skill in the art as providing sufficiently definite structure for performing the claimed functions,” and that “[l]ogic can be implemented in software, in hardware, and in combinations of hardware and software.” Ex. 1021 ¶ 122. The parties provide sufficient reasoning to overcome the presumption against a means-plus-function construction, and we accordingly construe “first logic” and “second logic” in accordance with 35 U.S.C. § 112 ¶ 6.” slip op. at 9
- Claim Construction › Functional claiming / §112(f) means-plus-function › Corresponding structure / algorithm (indefinite if none)Term construed patent owner constructionDecided for patent owner
“untenable because its broad identification only of “computer software and/or computer hardware” as structure for performing the recited function is too generic. The law regarding construction of means-plus-function limitations as applied to computer-implemented elements is well-established: For computer-implemented means-plus-function claims where the disclosed structure is a computer programmed to implement an algorithm, “the disclosed structure is not the general purpose computer, but rather the special purpose computer programmed to perform the disclosed algorithm.” . . . This court permits a patentee to express that algorithm in any understandable terms including as a mathematical formula, in prose, . . . , or as a flow chart, or in any other manner that provides sufficient structure. Finisar Corp. v. DirecTV Group, Inc., 523 F.3d 1323, 1340 (Fed. Cir. 2008) (citations omitted). Patent Owner’s proposed construction is superior because it identifies the algorithm through explicit reference to the flow chart of Figure 4 and related disclosure in the Specification. Patent Owner’s position is supported by testimony of its expert, Sasa Mutic, Ph.D., who refers to those disclosures in opining that “the [’703] patent describes a process of steps for obtaining the result of properly positioning a patient to begin a treatment” and that “Fig. 4 of the [’703] patent provides a flowchart of a process for use of an embodiment of the invention.” Ex. 2012 ¶ 69. Petitioner takes the position that the ultimate scope of the corresponding algorithm “does not matter” because Petitioner contends that the challenged claims are unpatentable even under Patent Owner’s proposed construction. Pet. Reply 315, 3. Nevertheless, Petitioner attacks Patent Owner’s proposed construction as “implicitly adopt[ing]” two “additional but unreasonable limitations.” Id. First, Petitioner contends that “the claims do not require the performance of the function of the second logic to be fully automated and instead permit human interaction with the second logic.” Id. Second, Petitioner contends that blocks 520 (“Position Patient”), 525 (“Register Treatment Image Data with Simulator/Reference Image Data and Reposition Patient”), and 530 (“Position Clinical Treatment Machine”) of Figure 4 “need not be performed in their entirety by logic so long as the second logic is used for some step in each block.” Id. at 4. We find no inconsistency in these positions with Patent Owner’s proposed construction. In light of the foregoing considerations, we adopt Patent Owner’s proposed construction.” slip op. at 14
- PTAB / AIA Trials › §315(e) estoppelEstoppel does not applyDecided for patent owner
“Petitioner contends that the claims canceled in IPR2016-00341 “were directed to methods that recited the function performed by the second logic,” and that “Patent Owner is now estopped from arguing the subject matter of the same scope is patentable.” Pet. Reply 315, 1. Petitioner cites no authority to support this position, which improperly focuses on only one limitation of the claims, divorced from the claims’ other limitations. We reject Petitioner’s contention because the method claims canceled in IPR2016-00341 do not constitute “subject matter of the same scope” as the apparatus claims challenged in these proceedings.” slip op. at 16
- Skill levelSkill level petitioner adoptedDecided for petitioner
“skill in the art relevant to the ’703 patent “would be a person with a graduate degree (MS or PhD) in medical physics or a related field (e.g. Physics, Engineering) and three years of experience in radiation oncology beyond the completion date of their degree.” Ex. 1021 ¶ 17. Patent Owner’s expert, Dr. Mutic, expresses a level of ordinary skill that is generally similar to Petitioner’s expert, but accounts for the possibility of a medical education instead of a medical-physics education: [A] person of ordinary skill in the art . . . would be a medical physicist with a Ph.D. (or similar advanced degree) in physics, medical physics, or a related field, and two or more years of experience in radiation oncology physics and image processing/computer programming related to radiation oncology applications. Alternatively, one of ordinary skill in the art might have an M.D. degree in the same relevant fields and two or more years of practical experience with image processing and the use of computer systems that is related to medical applications. Ex. 2012 ¶ 36. The similarity in the experts’ opinions is reinforced by Dr. Mutic’s assertion that he has “considered Dr. Hamilton’s definition of the level of ordinary skill in the art and determined that it does not differ from [his] own expressions of this concept in any way that is relevant to the opinions” he expresses in his Declaration. Id. ¶ 38. Based on the expert testimony in the record, we agree with and adopt the level of skill expressed by Dr. Hamilton.” slip op. at 17
Patent outcomesUS 8,867,703 not shown unpatentableClaim construction§ 103 obviousnesscites KSR · GrahamPatents in suitUS 8,867,703 - Elekta, Inc. v. Varian Medical Systems, Inc.No claims unpatentablePTAB · Jun 5, 2017 · IPR2016-00315 · APJ Patrick M Boucher · IPR · Final written decision
Claims 1, 2, and 4–9 were not shown unpatentable under either §103 ground because the references did not disclose the claimed second logic; claims 13 and 18 were canceled by motion.
RulingsFinal written decision- Claim Construction › Functional claiming / §112(f) means-plus-function › Whether §112(f) applies (Williamson, nonce words)§112(f) appliesDecided for patent owner
“Although a claim term that does not include the word “means” is presumed not to invoke a means-plus-function analysis, that presumption may be overcome if the limitation does not “recite sufficiently definite structure” or recites a “function without reciting sufficient structure for performing that function.” Williamson v. Citrix Online, LLC, 792 F.3d 2 Section 4(c) of the Leahy-Smith America Invents Act (“AIA”) redesignated 35 U.S.C. § 112, ¶ 6, as 35 U.S.C. § 112(f). Pub. L. No. 112- 29, 125 Stat. 284, 296 (2011). Because the ’703 patent has a filing date before September 16, 2012 (effective date of § 4(c)), we refer to the pre-AIA version of § 112. 1339, 1349 (Fed. Cir. 2015). Petitioner’s expert, Russell J. Hamilton, Ph.D., testifies that “the term ‘logic’ would not be recognized by one of ordinary skill in the art as providing sufficiently definite structure for performing the claimed functions,” and that “[l]ogic can be implemented in software, in hardware, and in combinations of hardware and software.” Ex. 1021 ¶ 122. The parties provide sufficient reasoning to overcome the presumption against a means-plus-function construction, and we accordingly construe “first logic” and “second logic” in accordance with 35 U.S.C. § 112 ¶ 6.” slip op. at 9
- Claim Construction › Functional claiming / §112(f) means-plus-function › Corresponding structure / algorithm (indefinite if none)Term construed patent owner constructionDecided for patent owner
“untenable because its broad identification only of “computer software and/or computer hardware” as structure for performing the recited function is too generic. The law regarding construction of means-plus-function limitations as applied to computer-implemented elements is well-established: For computer-implemented means-plus-function claims where the disclosed structure is a computer programmed to implement an algorithm, “the disclosed structure is not the general purpose computer, but rather the special purpose computer programmed to perform the disclosed algorithm.” . . . This court permits a patentee to express that algorithm in any understandable terms including as a mathematical formula, in prose, . . . , or as a flow chart, or in any other manner that provides sufficient structure. Finisar Corp. v. DirecTV Group, Inc., 523 F.3d 1323, 1340 (Fed. Cir. 2008) (citations omitted). Patent Owner’s proposed construction is superior because it identifies the algorithm through explicit reference to the flow chart of Figure 4 and related disclosure in the Specification. Patent Owner’s position is supported by testimony of its expert, Sasa Mutic, Ph.D., who refers to those disclosures in opining that “the [’703] patent describes a process of steps for obtaining the result of properly positioning a patient to begin a treatment” and that “Fig. 4 of the [’703] patent provides a flowchart of a process for use of an embodiment of the invention.” Ex. 2012 ¶ 69.” slip op. at 14
- PTAB / AIA Trials › §315(e) estoppelEstoppel does not applyDecided for patent owner
“Petitioner contends that the claims canceled in IPR2016-00341 “were directed to methods that recited the function performed by the second logic,” and that “Patent Owner is now estopped from arguing the subject matter of the same scope is patentable.” Pet. Reply 315, 1. Petitioner cites no authority to support this position, which improperly focuses on only one limitation of the claims, divorced from the claims’ other limitations. We reject Petitioner’s contention because the method claims canceled in IPR2016-00341 do not constitute “subject matter of the same scope” as the apparatus claims challenged in these proceedings.” slip op. at 16
- Skill levelSkill level petitioner adoptedDecided for petitioner
“skill in the art relevant to the ’703 patent “would be a person with a graduate degree (MS or PhD) in medical physics or a related field (e.g. Physics, Engineering) and three years of experience in radiation oncology beyond the completion date of their degree.” Ex. 1021 ¶ 17. Patent Owner’s expert, Dr. Mutic, expresses a level of ordinary skill that is generally similar to Petitioner’s expert, but accounts for the possibility of a medical education instead of a medical-physics education: [A] person of ordinary skill in the art . . . would be a medical physicist with a Ph.D. (or similar advanced degree) in physics, medical physics, or a related field, and two or more years of experience in radiation oncology physics and image processing/computer programming related to radiation oncology applications. Alternatively, one of ordinary skill in the art might have an M.D. degree in the same relevant fields and two or more years of practical experience with image processing and the use of computer systems that is related to medical applications. Ex. 2012 ¶ 36. The similarity in the experts’ opinions is reinforced by Dr. Mutic’s assertion that he has “considered Dr. Hamilton’s definition of the level of ordinary skill in the art and determined that it does not differ from [his] own expressions of this concept in any way that is relevant to the opinions” he expresses in his Declaration. Id. ¶ 38. Based on the expert testimony in the record, we agree with and adopt the level of skill expressed by Dr. Hamilton.” slip op. at 17
Patent outcomesUS 8,867,703 not shown unpatentableClaim construction§ 103 obviousnesscites KSR · GrahamPatents in suitUS 8,867,703 - Palo Alto Networks, Inc. v. Finjan, Inc.No claims unpatentablePTAB · Mar 17, 2017 · IPR2016-00956 · APJ Patrick M Boucher · IPR · Final written decision
The Board held claims 1, 3–7, 9, 12–16, 18–23, 29, and 35 not shown unpatentable because the asserted combinations did not teach dynamically building a parse tree while receiving incoming code.
RulingsFinal written decision- Claim Construction › Threshold & procedure › Whether a term needs construction (O2 Micro)Term construed board ownOther
“We have considered these constructions in light of the full trial record. We see no compelling reason to alter these constructions in light of the parties’ 4 We repeat our observation from the Institution Decision that claim 9 recites “detecting any one of a plurality of programming languages in which the incoming stream is written” (emphasis added), but requires instantiating the scanner “in response to said determining” (emphasis added), without apparent antecedent basis. We consider “said determining” in claim 9 as intended to refer to the previously recited “detecting,” in parallel with the structure of claims 1 and 22. Dec. 11 n.4. positions as developed during the trial, and we therefore adopt them for this Final Written Decision. See PO Resp. 12–13 (“Although Patent Owner maintains that the terms ‘dynamically building’ and ‘dynamically detecting’ do not require construction, it does not contest these constructions for purposes of this proceeding, and they are, therefore, controlling.”); Reply 3 (noting Patent Owner does not contest the preliminary constructions of “dynamically building” and “dynamically detecting”).” slip op. at 8
- Skill levelSkill level petitioner adoptedDecided for petitioner
“2. Level of Skill in the Art Based on its expert’s testimony, Petitioner contends that a person of ordinary skill in the art at the time of the claimed invention would have held a bachelor’s degree or the equivalent in computer science or related academic fields, and three to four years of additional experience in the field of computer security, or equivalent work experience. Pet. 2001, 14 (citing Ex. 1002 ¶ 33). Patent Owner does not dispute Petitioner’s contention, and its expert’s opinion on the level of ordinary skill is generally similar to that of Petitioner’s expert, differing only by about a year in minimum work experience and suggesting an advanced degree as a substitute for work experience. See Ex. 2007 ¶ 37. Furthermore, Patent Owner’s expert, Dr. Medvidovic, asserts that the opinions stated in his Declaration “would be the same if rendered from the perspective of a person of ordinary skill in the art set out by [Petitioner’s expert,] Dr. Rubin.” Id. at ¶ 40. Based on the expert testimony in the record, we agree with and adopt the level of skill advocated by Petitioner.” slip op. at 10
- Expert testimonyPatent owner expert creditedPetitioner expert discountedDecided for patent owner
“We have considered the opinions of both experts and the underlying bases for those opinions. In light of specific disclosures in Chandnani, we conclude that Patent Owner’s expert, Dr. Medvidovic, articulates the more compelling position. Of particular relevance is the following disclosure from Chandnani: The script language virus detection methodologies described herein may be performed by a computer in one or a combination of the following circumstances. The script language virus detection methodologies may be performed periodically (e.g., once/twice per day) or at selected times (e.g., each time the computer is powered up or restarted) by the computer on all relevant electronic files. In addition, the script language virus detection methodologies may be performed on a file (or a data stream received by the computer through a network) before the file is stored/copied/executed/opened on the computer. Ex. 1003, col. 9, ll. 6–16 (emphasis added). In considering this passage, Petitioner’s expert, Dr. Rubin, makes the conclusory statement that “[t]hus, under [Patent Owner’s] own interpretation of the claim language, the Chandnani+Kolawa combination teaches the ‘dynamically building’ limitation.” Ex. 1002 ¶ 167. We accord such a conclusory assertion little weight. See Verlander v. Garner, 348 F.3d 1335, 1371 (Fed. Cir. 2003) (Board has discretion to accord little weight to broad conclusory statements from expert witness).” slip op. at 18
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation not foundNot shown unpatentableNot shown unpatentable
“Consequently, Dr. Medvidovic opines, and we agree, that “simply because Chandnani’s tokenizer operates on a data stream does not demand or even imply that the data stream is being received while being tokenized.” Id. As Patent Owner contends, because Chandnani discloses that operation of the tokenizer “only occurs on the second pass through the data stream, . . . the data stream must have already been received before the stream of tokens is generated.” PO Resp. 21. “[W]hile it is conceivable (though not explicitly disclosed) that a data stream might be ‘incoming’ while Chandnani uses the ‘language check data to select the language definition data to use for the detection process,’ it is not possible for the data stream to still be ‘incoming’ when the data stream ‘is lexically analyzed again, this time using the language definition data, to generate a stream of tokens.’” Id. (citing Ex. 1003, col. 8, ll. 4–17; Ex. 2007 ¶¶ 73–74).” slip op. at 20
Patent outcomesUS 8,225,408 not shown unpatentableClaim construction§ 103 obviousnesscites KSR · GrahamPatents in suitUS 8,225,408 - Palo Alto Networks, Inc. v. Finjan, Inc.No claims unpatentablePTAB · Mar 17, 2017 · IPR2016-00955 · APJ Patrick M Boucher · IPR · Final written decision
Claims 1, 3–7, 9, 12–16, 18–23, 29, and 35 were not shown unpatentable under the asserted obviousness combinations because the art did not teach dynamically building a parse tree while receiving the incoming stream.
RulingsFinal written decision- BurdenNot shown unpatentable
“The dispositive issue is whether Petitioner demonstrates, by a preponderance of the evidence, that the combination of Chandnani and Kolawa teaches or suggests “dynamically building” a parse tree “while” receiving an incoming stream of program code. Although the specific language differs in immaterial respects by reciting or omitting the structural elements of a “computer” or a “receiver,” such a limitation appears in each of independent claims 1, 9, 22, 23, 29, and 35 through a combination of recitations that include receipt of the incoming stream of programming code and “dynamically building” the parse tree “while” receiving the incoming stream. Petitioner contends that all limitations of independent claims 1, 9, 22, 23, 29, and 35 are taught by Chandnani “except for the use of a parse tree to store and analyze programming code,” and that “[i]t would have been obvious to combine Chandnani’s scanner with the parse-tree teachings of Kolawa” to meet the full set of limitations of each independent claim. Pet. 2001, 19–20. Although the parties agree that Chandnani describes lexical analysis of a “data stream” to generate a stream of tokens, they disagree whether Chandnani discloses that such lexical analysis occurs while receiving the incoming data stream, as recited in each of the independent claims. That is, the parties disagree whether Chandnani discloses a time period for generation of the token stream that overlaps a time period during which the incoming stream is received, as required by our construction of “dynamically building.”” slip op. at 16
- Obviousness (§103) › Motivation to combine / reasonable expectation of successNot reached
“The dispositive issue is whether Petitioner demonstrates, by a preponderance of the evidence, that the combination of Chandnani and Kolawa teaches or suggests “dynamically building” a parse tree “while” receiving an incoming stream of program code. Although the specific language differs in immaterial respects by reciting or omitting the structural elements of a “computer” or a “receiver,” such a limitation appears in each of independent claims 1, 9, 22, 23, 29, and 35 through a combination of recitations that include receipt of the incoming stream of programming code and “dynamically building” the parse tree “while” receiving the incoming stream. Petitioner contends that all limitations of independent claims 1, 9, 22, 23, 29, and 35 are taught by Chandnani “except for the use of a parse tree to store and analyze programming code,” and that “[i]t would have been obvious to combine Chandnani’s scanner with the parse-tree teachings of Kolawa” to meet the full set of limitations of each independent claim. Pet. 2001, 19–20. Although the parties agree that Chandnani describes lexical analysis of a “data stream” to generate a stream of tokens, they disagree whether Chandnani discloses that such lexical analysis occurs while receiving the incoming data stream, as recited in each of the independent claims. That is, the parties disagree whether Chandnani discloses a time period for generation of the token stream that overlaps a time period during which the incoming stream is received, as required by our construction of “dynamically building.”” slip op. at 16
- Expert testimonyPatent owner expert creditedPetitioner expert discountedDecided for patent owner
“We have considered the opinions of both experts and the underlying bases for those opinions. In light of specific disclosures in Chandnani, we conclude that Patent Owner’s expert, Dr. Medvidovic, articulates the more compelling position. Of particular relevance is the following disclosure from Chandnani: The script language virus detection methodologies described herein may be performed by a computer in one or a combination of the following circumstances. The script language virus detection methodologies may be performed periodically (e.g., once/twice per day) or at selected times (e.g., each time the computer is powered up or restarted) by the computer on all relevant electronic files. In addition, the script language virus detection methodologies may be performed on a file (or a data stream received by the computer through a network) before the file is stored/copied/executed/opened on the computer. Ex. 1003, col. 9, ll. 6–16 (emphasis added). In considering this passage, Petitioner’s expert, Dr. Rubin, makes the conclusory statement that “[t]hus, under [Patent Owner’s] own interpretation of the claim language, the Chandnani+Kolawa combination teaches the ‘dynamically building’ limitation.” Ex. 1002 ¶ 167. We accord such a conclusory assertion little weight. See Verlander v. Garner, 348 F.3d 1335, 1371 (Fed. Cir. 2003) (Board has discretion to accord little weight to broad conclusory statements from expert witness).” slip op. at 18
- Skill levelSkill level petitioner adoptedDecided for petitioner
“2. Level of Skill in the Art Based on its expert’s testimony, Petitioner contends that a person of ordinary skill in the art at the time of the claimed invention would have held a bachelor’s degree or the equivalent in computer science or related academic fields, and three to four years of additional experience in the field of computer security, or equivalent work experience. Pet. 2001, 14 (citing Ex. 1002 ¶ 33). Patent Owner does not dispute Petitioner’s contention, and its expert’s opinion on the level of ordinary skill is generally similar to that of Petitioner’s expert, differing only by about a year in minimum work experience and suggesting an advanced degree as a substitute for work experience. See Ex. 2007 ¶ 37. Furthermore, Patent Owner’s expert, Dr. Medvidovic, asserts that the opinions stated in his Declaration “would be the same if rendered from the perspective of a person of ordinary skill in the art set out by [Petitioner’s expert,] Dr. Rubin.” Id. at ¶ 40. Based on the expert testimony in the record, we agree with and adopt the level of skill advocated by Petitioner.” slip op. at 10
Patent outcomesUS 8,225,408 not shown unpatentableClaim construction§ 103 obviousnesscites KSR · GrahamPatents in suitUS 8,225,408 - Palo Alto Networks, Inc. v. Finjan, Inc.No claims unpatentablePTAB · Mar 17, 2017 · IPR2016-00157 · APJ Patrick M Boucher · IPR · Final written decision
The Board held claims 1, 3–7, 9, 12–16, 18–23, 29, and 35 not shown unpatentable under the instituted §103 grounds because the art did not teach dynamically building a parse tree while receiving the code …
RulingsFinal written decision- Obviousness (§103) › Motivation to combine / reasonable expectation of successNot shown unpatentableMotivation not foundNot shown unpatentable
“The dispositive issue is whether Petitioner demonstrates, by a preponderance of the evidence, that the combination of Chandnani and Kolawa teaches or suggests “dynamically building” a parse tree “while” receiving an incoming stream of program code. Although the specific language differs in immaterial respects by reciting or omitting the structural elements of a “computer” or a “receiver,” such a limitation appears in each of independent claims 1, 9, 22, 23, 29, and 35 through a combination of recitations that include receipt of the incoming stream of programming code and “dynamically building” the parse tree “while” receiving the incoming stream. Petitioner contends that all limitations of independent claims 1, 9, 22, 23, 29, and 35 are taught by Chandnani “except for the use of a parse tree to store and analyze programming code,” and that “[i]t would have been obvious to combine Chandnani’s scanner with the parse-tree teachings of Kolawa” to meet the full set of limitations of each independent claim. Pet. 2001, 19–20. Although the parties agree that Chandnani describes lexical analysis of a “data stream” to generate a stream of tokens, they disagree whether Chandnani discloses that such lexical analysis occurs while receiving the incoming data stream, as recited in each of the independent claims. That is, the parties disagree whether Chandnani discloses a time period for generation of the token stream that overlaps a time period during which the incoming stream is received, as required by our construction of “dynamically building.”” slip op. at 16
- Expert testimonyPetitioner expert discountedPatent owner expert creditedOther
“We have considered the opinions of both experts and the underlying bases for those opinions. In light of specific disclosures in Chandnani, we conclude that Patent Owner’s expert, Dr. Medvidovic, articulates the more compelling position. Of particular relevance is the following disclosure from Chandnani: The script language virus detection methodologies described herein may be performed by a computer in one or a combination of the following circumstances. The script language virus detection methodologies may be performed periodically (e.g., once/twice per day) or at selected times (e.g., each time the computer is powered up or restarted) by the computer on all relevant electronic files. In addition, the script language virus detection methodologies may be performed on a file (or a data stream received by the computer through a network) before the file is stored/copied/executed/opened on the computer. Ex. 1003, col. 9, ll. 6–16 (emphasis added). In considering this passage, Petitioner’s expert, Dr. Rubin, makes the conclusory statement that “[t]hus, under [Patent Owner’s] own interpretation of the claim language, the Chandnani+Kolawa combination teaches the ‘dynamically building’ limitation.” Ex. 1002 ¶ 167. We accord such a conclusory assertion little weight. See Verlander v. Garner, 348 F.3d 1335, 1371 (Fed. Cir. 2003) (Board has discretion to accord little weight to broad conclusory statements from expert witness).” slip op. at 18
- Skill levelSkill level petitioner adoptedDecided for petitioner
“2. Level of Skill in the Art Based on its expert’s testimony, Petitioner contends that a person of ordinary skill in the art at the time of the claimed invention would have held a bachelor’s degree or the equivalent in computer science or related academic fields, and three to four years of additional experience in the field of computer security, or equivalent work experience. Pet. 2001, 14 (citing Ex. 1002 ¶ 33). Patent Owner does not dispute Petitioner’s contention, and its expert’s opinion on the level of ordinary skill is generally similar to that of Petitioner’s expert, differing only by about a year in minimum work experience and suggesting an advanced degree as a substitute for work experience. See Ex. 2007 ¶ 37. Furthermore, Patent Owner’s expert, Dr. Medvidovic, asserts that the opinions stated in his Declaration “would be the same if rendered from the perspective of a person of ordinary skill in the art set out by [Petitioner’s expert,] Dr. Rubin.” Id. at ¶ 40. Based on the expert testimony in the record, we agree with and adopt the level of skill advocated by Petitioner.” slip op. at 10
- ExcludeMotion to exclude, deniedDenied
“At the oral hearing, we expressed surprise that a party would seek to exclude the cross-examination testimony of its own expert witness. See Tr. 49:19–52:8. Patent Owner’s counsel explained that it “provided a motion to exclude based on the way that the evidence was used in the reply.” Tr. 50:1–6. But the Board has previously explained that “neither a motion to strike nor a motion to exclude is a proper mechanism to present argument that a reply contains new arguments.” Ultratec, Inc. v. Sorenson Communications, Inc., Case IPR2013-00288, Paper 38 at 2 (PTAB May 23, 2014). Rather, an evaluation of the propriety of, and weight to be accorded to, arguments made in a reply is left to the determination of the Board, with parties afforded various opportunities to provide context for the evidence. See 37 C.F.R. §§ 42.23, 42.65. We, therefore, consider Patent Owner’s arguments as going to the weight that should be given to the cross-examination testimony and related deposition exhibit, not to the admissibility of that evidence. See Liquid Dynamics Corp. v. Vaughan Co., 449 F.3d 1209, 1221 (Fed. Cir. 2006) (“Vaughan’s challenge goes to the weight of the evidence rather than the admissibility of Lueptow’s testimony and analysis.”). As indicated above, we have considered and weighed the testimony provided by Dr. Medvidovic and have not relied on the testimony of Dr. Bims in reaching our decision. Accordingly, we deny Patent Owner’s Motion to Exclude.” slip op. at 25
Patent outcomesUS 8,225,408 not shown unpatentable§ 103 obviousnesscites KSR · GrahamPatents in suitUS 8,225,408 - Palo Alto Networks, Inc. v. Finjan, Inc.No claims unpatentablePTAB · Mar 17, 2017 · IPR2015-02001 · APJ Patrick M Boucher · IPR · Final written decision
Claims 1, 3–7, 9, 12–16, 18–23, 29, and 35 were not shown unpatentable because the asserted combinations did not teach dynamically building a parse tree while receiving code.
RulingsFinal written decision- Expert testimonyPetitioner expert discountedDecided for patent owner
“We have considered the opinions of both experts and the underlying bases for those opinions. In light of specific disclosures in Chandnani, we conclude that Patent Owner’s expert, Dr. Medvidovic, articulates the more compelling position. Of particular relevance is the following disclosure from Chandnani: The script language virus detection methodologies described herein may be performed by a computer in one or a combination of the following circumstances. The script language virus detection methodologies may be performed periodically (e.g., once/twice per day) or at selected times (e.g., each time the computer is powered up or restarted) by the computer on all relevant electronic files. In addition, the script language virus detection methodologies may be performed on a file (or a data stream received by the computer through a network) before the file is stored/copied/executed/opened on the computer. Ex. 1003, col. 9, ll. 6–16 (emphasis added). In considering this passage, Petitioner’s expert, Dr. Rubin, makes the conclusory statement that “[t]hus, under [Patent Owner’s] own interpretation of the claim language, the Chandnani+Kolawa combination teaches the ‘dynamically building’ limitation.” Ex. 1002 ¶ 167. We accord such a conclusory assertion little weight. See Verlander v. Garner, 348 F.3d 1335, 1371 (Fed. Cir. 2003) (Board has discretion to accord little weight to broad conclusory statements from expert witness).” slip op. at 18
- Skill levelSkill level petitioner adoptedDecided for petitioner
“2. Level of Skill in the Art Based on its expert’s testimony, Petitioner contends that a person of ordinary skill in the art at the time of the claimed invention would have held a bachelor’s degree or the equivalent in computer science or related academic fields, and three to four years of additional experience in the field of computer security, or equivalent work experience. Pet. 2001, 14 (citing Ex. 1002 ¶ 33). Patent Owner does not dispute Petitioner’s contention, and its expert’s opinion on the level of ordinary skill is generally similar to that of Petitioner’s expert, differing only by about a year in minimum work experience and suggesting an advanced degree as a substitute for work experience. See Ex. 2007 ¶ 37. Furthermore, Patent Owner’s expert, Dr. Medvidovic, asserts that the opinions stated in his Declaration “would be the same if rendered from the perspective of a person of ordinary skill in the art set out by [Petitioner’s expert,] Dr. Rubin.” Id. at ¶ 40. Based on the expert testimony in the record, we agree with and adopt the level of skill advocated by Petitioner.” slip op. at 10
- Obviousness (§103) › Motivation to combine / reasonable expectation of successNot shown unpatentableMotivation not foundNot shown unpatentable
“The dispositive issue is whether Petitioner demonstrates, by a preponderance of the evidence, that the combination of Chandnani and Kolawa teaches or suggests “dynamically building” a parse tree “while” receiving an incoming stream of program code. Although the specific language differs in immaterial respects by reciting or omitting the structural elements of a “computer” or a “receiver,” such a limitation appears in each of independent claims 1, 9, 22, 23, 29, and 35 through a combination of recitations that include receipt of the incoming stream of programming code and “dynamically building” the parse tree “while” receiving the incoming stream. Petitioner contends that all limitations of independent claims 1, 9, 22, 23, 29, and 35 are taught by Chandnani “except for the use of a parse tree to store and analyze programming code,” and that “[i]t would have been obvious to combine Chandnani’s scanner with the parse-tree teachings of Kolawa” to meet the full set of limitations of each independent claim. Pet. 2001, 19–20. Although the parties agree that Chandnani describes lexical analysis of a “data stream” to generate a stream of tokens, they disagree whether Chandnani discloses that such lexical analysis occurs while receiving the incoming data stream, as recited in each of the independent claims. That is, the parties disagree whether Chandnani discloses a time period for generation of the token stream that overlaps a time period during which the incoming stream is received, as required by our construction of “dynamically building.”” slip op. at 16
- Obviousness (§103) › Objective indicia / secondary considerationsNot reached
“5. Conclusion Having considered the arguments and evidence presented by both parties, we conclude that Petitioner has not shown, by a preponderance of the evidence, that any of challenged claims 1, 9, 22, 23, 29, or 35 would have been obvious over the combination of Chandnani and Kolawa, or would have been obvious over that combination in further combination with Walls. Because the challenges of the dependent claims suffer from the same deficiencies, we further conclude that Petitioner has not shown, by a preponderance of the evidence, that those dependent claims would have been obvious over the combinations of art it presents. Because we determine that the art does not disclose “dynamically building” a parse tree “while” receiving an incoming stream of program code, we need not consider whether a further conclusion of nonobviousness is warranted because of evidence of secondary considerations.” slip op. at 24
Patent outcomesUS 8,225,408 not shown unpatentable§ 103 obviousnesscites KSR · GrahamPatents in suitUS 8,225,408 - Palo Alto Networks, Inc. / Blue Coat Systems, Inc. v. Finjan, Inc.No claims unpatentablePTAB · Mar 16, 2017 · IPR2016-00480 · APJ Miriam L Quinn · IPR · Final written decision
Claims 14 and 19 were not shown unpatentable because neither Shin nor Poison Java and Brown teaches executable code received at the destination without modification.
RulingsFinal written decision- Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITAPlain and ordinary meaningDecided for patent owner
“according to the entire disclosure of the ’633 patent specification the executable code is received at the destination without modification. See Vitronics Corp. v. Conceptronic, Inc., 90 F.3d 1576, 1582 (Fed. Cir. 1996) (the specification is “the single best guide to the meaning of a disputed term,” and “acts as a dictionary when it expressly defines terms used in the claims or when it defines terms by implication.”). “The specification may define claim terms ‘by implication’ such that the meaning may be ‘found in or ascertained by a reading of the patent documents.’” Bell Atl. Network Servs., Inc. v. Covad Communications Group, Inc., 262 F.3d 1258, 1268 (Fed.Cir.2001) (quoting Vitronics, 90 F.3d at 1582, 1584 n. 6). We also confirm the scope of the “executable code” in light of the advantage of the invention, e.g., to protect against malicious code without modifying the executable code, thereby minimizing resources. See Toro Co. v. White Consol. Indus., Inc., 199 F.3d 1295, 1301 (Fed. Cir. 1999) (construing a ring as permanently attached to the cover because all embodiments read together suggest this relationship and the specification describes the advantages of the unitary structure). Although the specification describes additional advantages, such as not requiring pre-installation of security code within the destination, the claims need not encompass all stated advantages. See Golight, Inc. v. Wal-Mart Stores, Inc., 355 F.3d 1327, 1331 (Fed. Cir. 2004) (“[P]atentees [are] not required to include within each of their claims all of [the] advantages or features described as significant or important in the written description.”). Finally, all the embodiments are consistent with and support the inventors’ characterization of the problem solved: avoiding the resource intensive modification by communicating to the destination the mobile protection code and the detected executable code. See Ex. 1001, 10:39−45; 1:63−3:6; see also O.I. Corp. v. Tekmar Co., 115 F.3d 1576, 1581 (Fed. Cir. 1997) (relying on the consistent disclosure of structures as being either non-smooth or conical and the statements distinguishing prior art where structures were smooth). In light of the disclosure, the plain and ordinary meaning of the disputed claim language emerges: the executable code whose operations are processed by the mobile protection code at the destination is the same as the executable code received, i.e., it undergoes no modification. In sum, we determine that the “executable code” at the destination is not modified.” slip op. at 17
- Novelty / Anticipation (§102) › Prior-art status of a reference › Printed publication / public accessibilityPrinted publication establishedDecided for petitioner
“research at Stanford, and archived by archive.org, shows that the article’s title was listed and that the article was publicly available through the Internet as of April 14, 1998. Ex. 1095. As explained in the affidavit proffered by Christopher Butler, Office Manager of Internet Archive, the URL format for captured website, “19980418130342/http://www-cs-students.stanford.edu/~ishin/research.html,” establishes that the website posting the abstract and the title of the article with a link to the article itself were archived on April 18, 1998 at 13:03:42. Id. The article was available as a PDF file, downloadable from the same page. Id. (identifying in a cover page the URL showing that Ex. 1009 was available from www-cs-students.stanford.edu/~ishin/paper.ps, as of April 18, 1998). We find this evidence credible and undisputed. Finally, there is also undisputed evidence that Dr. Rubin read Shin in 1998. Ex. 2022, 70:20−71:13. Accordingly, we find that Shin was publicly available and sufficiently accessible online to persons interested in applet security no later than April 14, 1998.” slip op. at 19
- Obviousness (§103) › Graham factors (scope of art, differences, level of skill)Not shown unpatentableNot shown unpatentable
“We find that Shin’s constant pool is not the same as the IAT embodiment described in the ’633 patent. As stated above, the mobile protection code modifies the IAT at the destination while processing the one or more operations of the executable code. In contrast, Shin’s applet is modified at the proxy server, and its modification constitutes rewriting the bytecode of the applet, which is executable. See Ex. 1009, 2 (“we propose a technique, called bytecode modification, through which we put restrictions on applets by inserting additional bytecode instructions that will perform the necessary run-time tests”), 4 (“modified executable entities are inserted in Java bytecode”). As explained by Shin, the constant pool is part of the class file of the applet. Id. at 5. Further, the bytecode modification is not performed at run-time, like the IAT modification table scenario. See id. at 2 (“HTTP proxy server []modifies classes before they are received by the browser”), 4 (Shin explaining that the “safety mechanism must be applied before the applet is executed”). The differences are significant, for the modification of the applet at the server is precisely the type of modification that the ’633 patent sought to avoid. The applet is undisputedly executable code, and is what Petitioner pointed to in Shin as disclosing executable code. See Pet. 43 (“Shin also discloses that the safeguarding code processes operations attempted by the applet (‘executable code’) . . . .”). By describing that the server modifies the constant pool in the applet, we find that Shin teaches modifying the executable code before the applet is processed at the client browser. Therefore, Petitioner has failed to show by a preponderance of the evidence that Shin teaches or suggests that the applet is “executable code” as we have construed the claim language, supra.” slip op. at 26
- ExcludeMotion to exclude, deniedDenied
“and 2048 in general as irrelevant, potentially confusing, and prejudicial. Id. at 8−15. Petitioner’s Motion to Exclude is denied as moot, because that evidence objected to is not relied upon in reaching our determination that Petitioner has not met its burden of showing that claims 14 and 19 are unpatentable.” slip op. at 34
Patent outcomesUS 7,647,633 not shown unpatentableClaim construction§ 102 anticipation§ 103 obviousnesscites KSR · GrahamPatents in suitUS 7,647,633 - Palo Alto Networks, Inc. v. Finjan, Inc.No claims unpatentablePTAB · Mar 16, 2017 · IPR2015-01974 · APJ Miriam L Quinn · IPR · Final written decision
Claims 14 and 19 were not shown unpatentable under either § 103 ground because both relied on modified executable code, contrary to the Board’s construction.
RulingsFinal written decision- Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed board ownDecided for patent owner
“To conclude, our determination is based on the plain and ordinary meaning of the claims within the context of the specification. First, 7 Similarly, Petitioner relies on testimony from the deposition of Finjan’s expert in the District Court litigation, Dr. Nenad Medvidovic, Exhibit 1100. Reply 5 (citing Ex. 1100). 8 We do not rely on expert testimony also because extrinsic evidence may not be used to contradict claim meaning that is unambiguous in light of the intrinsic record. Summit 6, LLC v. Samsung Elecs. Co., 802 F.3d 1283, 1290 (Fed. Cir. 2015). according to the entire disclosure of the ’633 patent specification the executable code is received at the destination without modification. See Vitronics Corp. v. Conceptronic, Inc., 90 F.3d 1576, 1582 (Fed. Cir. 1996) (the specification is “the single best guide to the meaning of a disputed term,” and “acts as a dictionary when it expressly defines terms used in the claims or when it defines terms by implication.”). “The specification may define claim terms ‘by implication’ such that the meaning may be ‘found in or ascertained by a reading of the patent documents.’” Bell Atl. Network Servs., Inc. v. Covad Communications Group, Inc., 262 F.3d 1258, 1268 (Fed.Cir.2001) (quoting Vitronics, 90 F.3d at 1582, 1584 n. 6). We also confirm the scope of the “executable code” in light of the advantage of the invention, e.g., to protect against malicious code without modifying the executable code, thereby minimizing resources. See Toro Co. v. White Consol. Indus., Inc., 199 F.3d 1295, 1301 (Fed. Cir. 1999) (construing a ring as permanently attached to the cover because all embodiments read together suggest this relationship and the specification describes the advantages of the unitary structure). Although the specification describes additional advantages, such as not requiring pre-installation of security code within the destination, the claims need not encompass all stated advantages. See Golight, Inc. v. Wal-Mart Stores, Inc., 355 F.3d 1327, 1331 (Fed. Cir. 2004) (“[P]atentees [are] not required to include within each of their claims all of [the] advantages or features described as significant or important in the written description.”). Finally, all the embodiments are consistent with and support the inventors’ characterization of the problem solved: avoiding the resource intensive modification by communicating to the destination the mobile protection code and the detected executable code. See Ex. 1001, 10:39−45; 1:63−3:6; see also O.I. Corp. v. Tekmar Co., 115 F.3d 1576, 1581 (Fed. Cir. 1997) (relying on the consistent disclosure of structures as being either non-smooth or conical and the statements distinguishing prior art where structures were smooth). In light of the disclosure, the plain and ordinary meaning of the disputed claim language emerges: the executable code whose operations are processed by the mobile protection code at the destination is the same as the executable code received, i.e., it undergoes no modification. In sum, we determine that the “executable code” at the destination is not modified.” slip op. at 16
- Novelty / Anticipation (§102) › Prior-art status of a reference › Printed publication / public accessibilityPrinted publication establishedDecided for petitioner
“publication or dissemination. See Ex. 1009. Petitioner, however, has provided other evidence establishing that Shin was publicly available no later than April 1998. A printout of the website directed to Mr. Shin’s research at Stanford, and archived by archive.org, shows that the article’s title was listed and that the article was publicly available through the Internet as of April 14, 1998. Ex. 1095. As explained in the affidavit proffered by Christopher Butler, Office Manager of Internet Archive, the URL format for captured website, “19980418130342/http://www-cs-students.stanford.edu/~ishin/research.html,” establishes that the website posting the abstract and the title of the article with a link to the article itself were archived on April 18, 1998 at 13:03:42. Id. The article was available as a PDF file, downloadable from the same page. Id. (identifying in a cover page the URL showing that Ex. 1009 was available from www-cs-students.stanford.edu/~ishin/paper.ps, as of April 18, 1998). We find this evidence credible and undisputed. Finally, there is also undisputed evidence that Dr. Rubin read Shin in 1998. Ex. 2022, 70:20−71:13. Accordingly, we find that Shin was publicly available and sufficiently accessible online to persons interested in applet security no later than April 14, 1998.” slip op. at 18
- Obviousness (§103) › Graham factors (scope of art, differences, level of skill)Not shown unpatentableNot shown unpatentable
“We find that Shin’s constant pool is not the same as the IAT embodiment described in the ’633 patent. As stated above, the mobile protection code modifies the IAT at the destination while processing the one or more operations of the executable code. In contrast, Shin’s applet is modified at the proxy server, and its modification constitutes rewriting the bytecode of the applet, which is executable. See Ex. 1009, 2 (“we propose a technique, called bytecode modification, through which we put restrictions on applets by inserting additional bytecode instructions that will perform the necessary run-time tests”), 4 (“modified executable entities are inserted in Java bytecode”). As explained by Shin, the constant pool is part of the class file of the applet. Id. at 5. Further, the bytecode modification is not performed at run-time, like the IAT modification table scenario. See id. at 2 (“HTTP proxy server []modifies classes before they are received by the browser”), 4 (Shin explaining that the “safety mechanism must be applied before the applet is executed”). The differences are significant, for the modification of the applet at the server is precisely the type of modification that the ’633 patent sought to avoid. The applet is undisputedly executable code, and is what Petitioner pointed to in Shin as disclosing executable code. See Pet. 43 (“Shin also discloses that the safeguarding code processes operations attempted by the applet (‘executable code’) . . . .”). By describing that the server modifies the constant pool in the applet, we find that Shin teaches modifying the executable code before the applet is processed at the client browser. Therefore, Petitioner has failed to show by a preponderance of the evidence that Shin teaches or suggests that the applet is “executable code” as we have construed the claim language, supra.” slip op. at 26
- ExcludeMotion to exclude, deniedDenied
“and 2048 in general as irrelevant, potentially confusing, and prejudicial. Id. at 8−15. Petitioner’s Motion to Exclude is denied as moot, because that evidence objected to is not relied upon in reaching our determination that Petitioner has not met its burden of showing that claims 14 and 19 are unpatentable.” slip op. at 34
Patent outcomesUS 7,647,633 not shown unpatentableClaim construction§ 102 anticipation§ 103 obviousnesscites KSR · GrahamPatents in suitUS 7,647,633
Holdings, summaries, rulings, issues, outcomes, winners and claim constructions shown for a decision were generated by a large language model reading the opinion. They are a guide to the decision, not the decision. Confirm every one against the court's own text before relying on it. Outcomes read from the patent owner’s side. Party names are extracted from the decision and are missing on about 900 short Director denials and scans, which carry the trial number instead.