PTAB
Advanced fields
2 decisions · 324msnewest first
  • Google Inc. v. Patrick ZuiliAll claims unpatentable
    PTAB · Apr 24, 2017 · CBM2016-00008 · APJ Stacey G White · CBM · Final written decision

    Claims 1, 5, 9, and 11 are unpatentable under § 101 and obvious over IAB 1 and IAB 2; claims 5 and 11 are also obvious over IAB 1, IAB 2, and Laurent.

    RulingsFinal written decision
    • Expert testimonyPetitioner expert creditedDecided for petitioner

      “a first code on the server side computing device . . . sending said first code to said at least one device over a communication network. PO Resp. 144. According to Patent Owner, Petitioner “inconsistently pointed [] to cookies as constituting a first code,” and Patent Owner alleges that this is insufficient because claim 1 does not discuss cookies. Id. at 146. Patent Owner contends that Petitioner has equated code generation with cookies and that is improper because cookies are used only to store the code after it has been generated. Id. We do not agree with Patent Owner’s analysis. Petitioner’s declarant, Stephen Gray, asserts that “[c]ookies are set by servers that store the cookie in the client. That cookie is then transmitted back from the client to the server upon subsequent accesses by the user to the origin server that set the cookie.” Ex. 1006 ¶ 60. Gray opines that one of ordinary skill in the art would have known that “when a user clicks a cookie-enabled website, a cookie is generated on the server and this cookie is stored on the client computer along with all of the information.” Ex. 1006 ¶ 105. We find that this comports with IAB 1’s description of measuring the number of visits to a web site by using a “Unique Cookie with Heuristic.” Ex. 1004, 5. IAB 1’s server stores “a small piece of information with a browser.” Id. IAB 2 notes that “[t]he web server responds to the user browser by checking for an existing cookie and creating one if one does not exist.” Ex. 1005, 27 (emphasis added). As described in the IAB references, cookies are designed to be unique to each browser, or if possible, the cookies should be unique to each user. Ex. 1004, 5, Ex. 1005, 21–22, 27. We find that these disclosures from IAB 1 and IAB 2 would have taught one of ordinary skill in the art the claimed first code.” slip op. at 32

    • Skill levelOther
    • Claim Construction › Threshold & procedure › Whether a term needs construction (O2 Micro)No construction neededOther

      “analyze patentability using the broadest reasonable construction of the claims in light of the specification. 37 C.F.R. § 42.100(b); Cuozzo Speed Techs., LLC v. Lee, 136 S. Ct. 2131, 2144–46 (2016) (upholding the use of the broadest reasonable interpretation standard under 37 C.F.R. § 42.100(b)). Neither party makes an explicit claim construction argument in the proceeding. See generally PO Resp., Reply. For purposes of this Final Written Decision, we determine that no claim terms require express construction. See Vivid Techs., Inc. v. Am. Sci. & Eng’g, Inc., 200 F.3d 795, 803 (Fed. Cir. 1999) (“[O]nly those terms need be construed that are in controversy, and only to the extent necessary to resolve the controversy.”).” slip op. at 17

    • Patent Eligibility (§101) › Alice/Mayo step one — 'directed to'Step1 directed to exceptionDecided for petitioner

      “Intellectual Ventures I LLC v. Erie Indemnity Co., 850 F.3d 1315, 1325 (Fed. Cir. 2017) (citation omitted). Thus, we must determine whether the claims are directed to “longstanding conduct that existed well before the advent of computers and the Internet.” Id. at 1327. What we are presented with is a system for marking the occurrence of two events and making a determination about the validity of the second occurrence based on the time elapsed between occurrences. We find that this is a longstanding business practice as exemplified by Petitioner’s pharmacy example. See Pet. 47. Patent Owner asserts that the ’057 patent is different from the sort of fraud detection that may be performed by a pharmacist because the challenged claims are “able to handle millions of clicks in real time whether from the same or different users.” PO Resp. 90. We do not agree. The claims recite only two data points, a time associated with click one and a time associated with click two. Thus, a pharmacist comparing the dates or times for two prescription requests is performing the same comparison as the one recited in the claims. There is no requirement in the claims that the system be able to handle millions of data points. Further, there is no discussion of the determination being made in real time and to the contrary the specification states that “by observing a metric like the number of clicks for a given period of time, be it a short time or a longer period, such as a day or a week, the system can automatically determine if certain clicks are illegitimate.” Ex. 1001, 2:64‒3:2. In addition, while the claims recite the creation of codes and encoded codes none of this is used by the claimed method to perform its determination. That data merely is sent from one place to another while the system marks the time associated with a click. The only information used in the determination is the time of the two clicks. The claims are not directed to improving the function of the computer or its associated software; instead, they are directed to using a computer to perform a well-known business task. See Bancorp Servs., LLC v. Sun Life Assurance Co., 687 F.3d 1266, 1278 (Fed. Cir. 2012) (“[T]he fact that the required calculations could be performed more efficiently via a computer does not materially alter the patent eligibility of the claimed subject matter.”). Therefore, we are persuaded that the challenged claims are directed to a longstanding economic task and not to an improvement to the computer functionality itself. Cf. Enfish, LLC v. Microsoft Corp., 822 F.3d 1327, 1336 (Fed. Cir. 2016). For all of the foregoing reasons, we find that Petitioner has established that claims 1, 5, 9, and 11 are directed to an abstract idea.” slip op. at 23

    Patent outcomesUS 8,671,057 unpatentable
    Claim construction§ 101 eligibility§ 103 obviousnesscites Alice · Mayo · Enfish
    Patents in suitUS 8,671,057
  • PTAB · Aug 31, 2015 · CBM2014-00079 · APJ Donna M Praiss · CBM · Final written decision

    Claims 1–17 are unpatentable under § 101 because they claim an abstract mathematical correlation implemented with generic computer functions.

    RulingsFinal written decision
    • Patent Eligibility (§101) › Alice/Mayo step one — 'directed to'Step1 directed to exceptionUnpatentable

      “We agree with Petitioner that Digitech is instructive guidance concerning claims to “a process that employs mathematical algorithms to manipulate existing information to generate additional information.” Digitech, 758 F.3d at 1351 (citing Parker v. Flook, 437 U.S. at 595) (concluding such claims are ineligible subject matter). Like the ’196 patent claims, the process claim in Digitech did not recite expressly mathematical formulae or equations. It claimed, in prose, generating two data sets by taking existing information, such as measured chromatic stimuli, spatial stimuli, and device response characteristic functions, and organizing the information into a new form called a device profile. Digitech, 758 F.3d at 1350–51. The method claim was determined to be an abstract idea “because it describes a process of organizing information through mathematical correlations and is not tied to a specific structure or machine.” Id. at 1350. The absence of expressly recited mathematical formulae or equations in the claim carried no significance in determining whether the claims as a whole were directed to the abstract idea. See also Alice, 134 S. Ct. at 2356–57 (noting that no special significance was given to the fact that one of the claims in Bilski reduced hedging to a mathematical formula). In sum, because we agree with Petitioner that the challenged claims involve determining a mathematical correlation, like the claims in Digitech, we conclude that the first step in the Alice/Mayo test is met for claims 1–17.” slip op. at 12

    • Patent Eligibility (§101) › Alice/Mayo step two — inventive conceptStep2 no inventive conceptUnpatentable

      “The fact that a claim relies on a method that is implemented on a computer does not, by itself, demonstrate that the claim is patent eligible. Rather, a challenged claim, properly construed, must incorporate enough meaningful limitations to ensure that what is claimed is more than just an abstract idea, and is not a mere “drafting effort designed to monopolize [an abstract idea] itself.” Mayo, 132 S. Ct. at 1297. In order for a machine to impose a meaningful limitation on the scope of a method claim, it must play “a significant part in permitting the claimed method to be performed, rather than function solely as an obvious mechanism for permitting a solution to be achieved more quickly.” SiRF Tech., Inc. v. Int’l Trade Comm’n, 601 F.3d 1319, 1333 (Fed. Cir. 2010). Claims that recite a method of doing business on a computer, and do no more than merely recite the use of the computer for its ordinary function of performing repetitive calculations, are not patent eligible. Bancorp Servs., L.L.C. v. Sun Life Assurance Co., 687 F.3d 1266, 1278–79 (Fed. Cir. 2012) (finding computer used for its most basic function, the performance of repetitive calculation, does not impose a meaningful claim limitation). We are persuaded that Petitioner has shown by a preponderance of the evidence that the extent to which a computer aids the performance of the claimed invention is no more than the ordinary function of common computer software programs, such as the Microsoft Excel spreadsheet used by Patent Owner’s expert. Reply 7 (citing Ex. 1012, 153:15–154:21). Patent Owner’s argument that the computer technology required by the ’196 patent claims “is integral to meeting the requirements of accuracy, precision and timeliness” (PO Resp. 27 (citing Ex. 2004 ¶ 96)) focuses on a specific commercial application of the patent claims “[i]n the private equity world” (id. (citing Ex. 2004 ¶¶ 86–95)). We are not persuaded by Patent Owner’s arguments because they presume particular mathematical computation methods not required by the claims, and reinforce that the nature of the invention is a patent ineligible mathematical algorithm. For example, Patent Owner contends that when presented with a problem to solve at his deposition, Petitioner’s expert, Dr. Robinson, inaccurately computed a real rate of return on an investment because he used quarterly compounding rather than daily compounding. Ex. 2004 ¶ 87. According to Mr. Reyes, Patent Owner’s expert, “daily cashflow (as opposed to monthly or quarterly) has been recognized as a requisite compounding frequency as far back as the 1960s.” Id. at ¶ 91. Such mathematical computations, even if required by the claims, are not sufficient to transform the claims into patent eligible subject matter.” slip op. at 15

    • ExcludeMotion to exclude, deniedDenied

      “For the reasons that follow, we determine that Petitioner has shown by a preponderance of the evidence that claims 1–17 of the ’196 patent are unpatentable under 35 U.S.C. § 101. Because our determination does not rely on the deposition testimony subject to Patent Owner’s Motion to Exclude, we dismiss the motion as moot.” slip op. at 2

    • Expert testimonyOther

      “We are persuaded that Petitioner has shown by a preponderance of the evidence that the extent to which a computer aids the performance of the claimed invention is no more than the ordinary function of common computer software programs, such as the Microsoft Excel spreadsheet used by Patent Owner’s expert. Reply 7 (citing Ex. 1012, 153:15–154:21). Patent Owner’s argument that the computer technology required by the ’196 patent claims “is integral to meeting the requirements of accuracy, precision and timeliness” (PO Resp. 27 (citing Ex. 2004 ¶ 96)) focuses on a specific commercial application of the patent claims “[i]n the private equity world” (id. (citing Ex. 2004 ¶¶ 86–95)). We are not persuaded by Patent Owner’s arguments because they presume particular mathematical computation methods not required by the claims, and reinforce that the nature of the invention is a patent ineligible mathematical algorithm. For example, Patent Owner contends that when presented with a problem to solve at his deposition, Petitioner’s expert, Dr. Robinson, inaccurately computed a real rate of return on an investment because he used quarterly compounding rather than daily compounding. Ex. 2004 ¶ 87. According to Mr. Reyes, Patent Owner’s expert, “daily cashflow (as opposed to monthly or quarterly) has been recognized as a requisite compounding frequency as far back as the 1960s.” Id. at ¶ 91. Such mathematical computations, even if required by the claims, are not sufficient to transform the claims into patent eligible subject matter.” slip op. at 16

    Patent outcomesUS 7,698,196 unpatentable
    § 101 eligibilitycites Alice · Mayo · Bilski
    Patents in suitUS 7,698,196

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.