Showing posts with label kappos. Show all posts
Showing posts with label kappos. Show all posts

26 July, 2014

Thoughts on the Alice Corp v CLS Bank Decision

Software is big business in the 21st century. With over 400 billion dollars worth of revenue having been created in 2013 alone, and arguably the market is growing by the year, you can't help but understand the vehement defense of those interests even if it often seems to be for nothing but profit, and not the defense of a legitimate product or competitive edge. What gives software, and subsequently software patents (discussed in more detail here), a bad name are so-called 'patent trolls', or more officially Non-Practicing Entities (sometimes also called Patent Assertion Entities). The companies rarely produce or use the patents they control, but merely use them as a means to recover licensing fees, potentially affecting the marketplace and software development quite negatively. In light of this whether software should be patentable or not, and if so what the limits are, has been highly contentious and of interest to many. Finally the matter arrived in the open arms of the United States Supreme Court, which issued is ruling on the question a bit over a month ago (discussion of the earlier decision can be found here).

The case of Alice Corporation v CLS Bank International dealt with Alice Corporation's patented method of mitigating 'settlement risk', which is the uncertainty of whether only one party will pay what it owes to another, by the use of a third-party. The software or computer process creates 'shadow records' of the parties' debits and credits, effectively mirroring their payment capabilities within their real world finances. It then allows or denies any transactions based on those records, should they fall within the payment capabilities of the owing party, finally issuing the payment order to the bank responsible for that transaction. This mitigates the risk of such transactions for both parties, leaving much less uncertainty as to the other party's payment capabilities. The patent's claims in question are as follows: "...(1) the foregoing method for exchanging obligations (the method claims), (2) a computer system configured to carry out the method for exchanging obligations (the system claims), and (3) a computer-readable medium containing program code for performing the method of exchanging obligations (the media claims)" - all of which are handled through a computer. CLS Bank handle currency exchanges internationally, and sought a declaratory judgment to invalidate Alice Corporation's patent under 35 USC 101.

What abstract truly looks like
In determining whether Alice Corporation's patent is invalid, the Supreme Court had to decide whether it would fall under a patent ineligible category such as laws of nature or an abstract idea. This assessment, as expressed by Justice Thompson in the unanimous judgment of the court, would entail: "First, we determine whether the claims at issue are directed to one of those patent-ineligible concepts... If so, we then ask, '[w]hat else is there in the claims before us?'" The second step entails an assessment of whether the patent is an 'inventive concept', or in other words, brings something more to the table than just the idea itself.

The Supreme Court in their judgment draw heavily from the case of Bilski v Kappos (more extensively discussed on this very blog). They aligned Bilski's method of hedging risk to Alice Corporation's mitigation method, and determined the patent was indeed an abstract idea and therefore ineligible for the patent. This is because, referring to the Bilski decision: "...all of the claims at issue were abstract ideas in the understanding that risk hedging was a ‘fundamental economic practice.’". As, according to Justice Thompson, there is no meaningful distinction between Alice Corporation's patent and Bilski's patent, the former can be concluded to be an abstract idea in the same vein.

Although the court did determine that the patent was ineligible it could still contain a transformative element which turns it into an 'inventive concept'.  To put into better terms, referring to Mayo Collaborative v Prometheus Labs: "A claim that recites an abstract idea must include “additional features” to ensure “that the [claim] is more than a drafting effort designed to monopolize the [abstract idea]". The mere addition of a computer into the process, as evident from the extensive precedent in this area, will not make non-patentable inventions into patentable ones unless the implementation via the computer is more extensive.

Alice Corporation's patent largely relies on a computerized method which handled the risk mitigation, and on the face of it, seems to fall within precedent as unpatentable. The court outright rejected Alice Corporation's argument that the computer plays a substantial and meaningful role and determined that the patent is not an 'inventive concept'. Expressed better by Justice Thompson: "...the claims at issue amount to “nothing significantly more” than an instruction to apply the abstract idea of intermediated settlement using some unspecified, generic computer". The Supreme Court therefore rejected the appeal and Alice Corporation's patent was deemed invalid.

The decision is very important, however is not necessarily the axe to the head of software patents on the block. Although the Supreme Court rejected patents which merely give instructions to a computer, if applied more thoroughly and in such a way that it solves a problem such as in Diamond v Diehr. This distinction was expressed incredibly well by David Kappos for SCOTUSBlog: "[t]he distinction between patentable software in Diamond v. Diehr and unpatentable software in Bilski and CLS Bank is not about software at all; rather, the difference is the presence or absence of a definitive invention versus abstraction. Diehr's new and useful process for curing rubber was held to be innately patentable – the fact that it happened to be manifest in a software language was tributary". To put into different terms, software patents should be a nuanced application, a solution to a distinct problem rather than a blanket cover for a larger area, stifling progression and potentially causing issues in the technological developments of the future. The reception of the decision has been wildly mixed, and rightfully so, since the decision does both good and bad things to the patent sphere in the US. What impact it will have remains to be seen more down the line, but hopefully this will tackle patent trolls more than it does legitimate businesses - regardless of your definition of 'legitimate'.

Source: The Verge

16 May, 2014

Retrospective - Software Patents in the US

With the Alice Corporation v CLS Bank Supreme Court decision looming in the horizon, and the patentability of software in the US faces its most recent judicial challenge, this writer thought it was best to look at the origins of the current stance of such patents in the United States. Software patents are incredibly lucrative, generating an estimated 20 billion dollars yearly to tech giants such as Google and IBM. Regardless of this their patentability can be questioned, and an answer that still stands today was provided by the US Supreme Court 4 years ago, which is now effectively being challenged by Alice v CLS.

The case in question is Bilski v Kappos, decided in mid-2010. It dealt with Bernard Bilski and Rand Warsaw's application for a patent (found on page 79) for a method which hedged risks in the selling of commodities over time. The method, roughly explained, would have a third party selling the commodities in question to parties at a fixed price, mitigating any spikes in price should a single entity buy those commodities in large quantities at once. This also ensures that the providers of the commodities would not suffer either, as the third party purchaser would safeguard them from a lull in demand after a big buyer would take their share, ensuring that the price of the commodities would not dip below the third party's fixed price. The patent application for this method, more specifically described under Claim 1 and Claim 4 (both under contention), the latter of which puts the former in a mathematical equation, were initially rejected by the patent examiner. The decision was subsequently appealed, and through an en banc decision of the Court of Appeals, finally ended in the US Supreme Court.

What the Court was faced was an assessment of whether the patent contravened 35 USC § 101, under which one cannot patent fundamental principles, abstract ideas, laws of nature or natural phenomena. Could a process such as Bilski's one be patented as a process under section 101, or would it be merely patenting an abstract idea? The Supreme Court would have to assess Bilski's method under the machine-or-transformation test to determine if it is a process or not: "...(1) it is tied to a particular machine or apparatus, or (2) it transforms a particular article into a different state or thing". What this could be is the method's usage through a computer for example, making the method a more specific one as opposed to just a pure idea, being a process and thus patentable. The machine-to-transformation is not, according to the US Supreme Court, the only definitive test, but more of "...a useful and important clue, an investigative tool, for determining whether some claimed inventions are processes under §101".

Gavin always thought in the abstract
The majority's decision hinged heavily on its previous decisions of Gottschalk v Benson, Parker v Flook and Diamond v Diehr. The three decisions quite heavily dismiss the possibility of patenting processes very similar to the one which Bilski was attempting to patent, as the Court saw in each case that those processes would merely be patenting abstract ideas, leaving them outside the remit of patentability. Although Benson and Flook failed, Diehr succeeded as the process which was attempted to be patented was an actual process, unlike in the former two which attempted to patent formulas rather than real processes, leaving the door open for such attempts should they sufficiently fall within the Diehr precedent's line.

In the end the majority rejected Bilski's appeal, stating that "The concept of hedging, described in claim 1 and reduced to a mathematical formula in claim 4, is an unpatentable abstract idea, just like the algorithms at issue in Benson and Flook. Allowing petitioners to patent risk hedging would pre-empt use of this approach in all fields, and would effectively grant a monopoly over an abstract idea". This can be said to be right based on the precedents used by the Court in their decision. Bilski attempted to patent an idea of how to hedge risks, lacking a secondary component which would make the method a process aside from just a principle under which a business would operate, clearly making it just an idea, not a process.

What the Bilski case establishes does have an impact on software patents, but can be argued to be distinguishable from the forthcoming Alice case to an extent. What Bilski attempted to patent was just an idea of a process; however should a software patent sufficiently establish a process akin to what was seen in Diehr, it could very well be patentable. On the face of it the Alice patent would seemingly fall under the Benson and Flook precedent, potentially causing it to be not eligible for patentability; however this remains to be seen once the Supreme Court presents its decision on the case.