CLS Bank v. Alice Corp., Federal Circuit 2013

The Federal Circuit reviewed an appeal by Alice Corp. of a district court (U.S. District Court for District of Columbia) holding that Alice’s asserted
method claims, computer readable media claims, and systems claims were not directed to eligible subject matter under 35 U.S.C. §101.

The ten-member en banc panel released seven different decisions. None of the opinions garnered majority support. Seven of the ten judges agreed that the method and computer-readable medium claims lack subject matter eligibility. Eight of the ten concluded that the software patent claims should rise and fall together regardless of their claim type.

The software patents concern “the management of risk relating to specified, yet unknown, future events.” In particular, the patents relate to a computerized trading platform used for conducting
financial transactions in which a third party settles obligations between a first and a second party so as to eliminate “counter party” or “settlement” risk. Settlement risk refers to the risk to each party in an exchange that only one of the two
parties will actually pay its obligation, leaving the paying party without its principal or the benefit of the counter-party’s performance. Alice’s patents address that risk by
relying on a trusted third party to ensure the exchange of either both parties’ obligations or neither obligation. For example, when two parties agree to perform a
trade, in certain contexts there may be a delay between the time that the parties enter
a contractual agreement obligating themselves to the trade and the time of settlement when the agreed trade is actually executed. Ordinarily, the parties would consummate the trade by paying or exchanging their mutual obligations after the intervening period, but in some cases one party might become unable to pay during that time and fail to notify the other
before settlement. As disclosed in Alice’s patents, a trusted third party can be used to verify each party’s ability to perform before actually exchanging either of the parties’ agreed-upon obligations.

The claims before the court recited methods of exchanging obligations
between parties, data processing systems, and computer-
readable media containing a program code for directing
an exchange of obligations.

A representative method claim is as follows:
          33. A method of exchanging obligations as between parties, each party holding a credit record
and a debit record with an exchange institution,
the credit records and debit records for exchange
of predetermined obligations, the method comprising the steps of:
          (a) creating a shadow credit record and a shadow
debit record for each stakeholder party to be
held independently by a supervisory institution from the exchange institutions;
          (b) obtaining from each exchange institution a start-of-day balance for each shadow credit
record and shadow debit record;
          (c) for every transaction resulting in an exchange
obligation, the supervisory institution adjusting each respective party’s shadow credit record or shadow debit record, allowing only
these transactions that do not result in the
value of the shadow debit record being less
than the value of the shadow credit record at
any time, each said adjustment taking place
in chronological order; and
          (d) at the end-of-day, the supervisory institution
instructing ones of the exchange institutions to exchange credits or debits to the credit record and debit record of the respective parties
in accordance with the adjustments of the said
permitted transactions, the credits and debits
being irrevocable, time invariant obligations
placed on the exchange institutions.

A representative apparatus claim is as follows:
          1. A data processing system to enable the exchange of
an obligation between parties, the system comprising:
          a data storage unit
having stored therein information about a shadow credit record and
shadow debit record for a party, independent
from a credit record and debit record maintained by an exchange institution; and
          a computer, coupled to said data storage unit, that
is configured to (a) receive a transaction;
(b)
electronically adjust said shadow credit
record and/or said shadow debit record in order to effect an exchange obligation arising
from said trans
action, allowing only those
transactions that do not result in a value of
said shadow debit record being less than a
value of said shadow credit record; and
(c)
generate an instruction to said exchange
institution at the end of a period of time to adjust said credit record and/or said debit record
in accordance with the adjustment of said
shadow credit record and/or said shadow debit
record, wherein said instruction being an irrevocable, time invariant obligation placed on
said exchange institution.

The district court granted summary judgment in favor of CLS, holding each of the asserted claims of Alice’s software patents invalid under §101.

The district court concluded that Alice’s method claims “are directed to an abstract idea of employing an intermediary to facilitate simultaneous exchange of obligations in order to minimize risk.”

Further, the district court held the asserted system claims similarly ineligible, as those claims “would preempt the use of the abstract concept of employing a neutral intermediary to facilitate simultaneous exchange of obligations in order to minimize risk on any computer, which is, as a practical matter, how these processes are likely to be
applied.”

The asserted media claims failed on the same ground as “directed to the same abstract concept
despite the fact they nominally recite a different category of invention.” The invalidation of the system claims and media claims are disconcerting. One would think that systems and media pass the “machine or transformation” test that was accepted by the Supreme Court as an indication of patent eligibility.

The leading five-member opinion written by Judge Lourie noted that the patent statute sets forth four broadly stated categories of patent-eligible subject matter: processes, machines,
manufactures, and compositions of matter. As the Supreme Court has explained, Congress intended that the statutory categories would be broad and inclusive to best serve the patent system’s constitutional objective of encouraging innovation.
See Diamond v. Chakrabarty, 447 U.S. 303, 308-09 (1980).

While the categories of patent-eligible subject matter recited in §101 are broad, their scope is limited by three important judicially created exceptions.
“[L]aws of nature, natural phenomena, and abstract ideas” are excluded from patent eligibility,
because such fundamental discoveries represent “the basic tools of
scientific and technological work,” Gottschalk v. Benson,
409 U.S. 63, 67 (1972). Thus, even inventions that fit within one or more of the statutory categories are not patent eligible if drawn to a law of nature, a natural phenomenon, or an abstract idea. The underlying concern is that patents covering such elemental concepts would
reach too far and claim too much, on balance obstructing rather than catalyzing innovation. But danger also lies in applying the judicial exceptions too aggressively because “all inventions at some level embody, use, reflect, rest upon, or apply laws of nature, natural phenomena, or abstract ideas.”
Mayo Collaborative Servs. v. Prometheus
Labs., Inc.
, 132 S. Ct. 1289, 1293 (2012). Taken too far, the exceptions could swallow patent law entirely.

The opinion continued on to say that, accordingly, the basic steps in a patent-eligibility
analysis can be summarized as follows. We must first ask whether the claimed invention is a process, machine, manufacture, or composition of matter. If not, the claim is ineligible under §101. If the invention falls within one of the statutory categories, we must then determine
whether any of the three judicial exceptions nonetheless bars such a claim is the claim drawn to a patent ineligible law of nature, natural phenomenon, or abstract
idea? If so, the claim is not patent eligible. Only claims that pass both inquiries satisfy §101. While simple enough to state, the patent-eligibility test has proven quite difficult to apply.

The opinion discussed several Supreme Court cases and noted that several common themes that run through the Supreme Court’s decisions that should frame the analysis in this and other §101 cases.

First and foremost is an abiding concern that patents
should not be allowed to preempt the fundamental tools of
discovery.

Next, the cases repeatedly caution against overly formalistic approaches to subject-matter eligibility that invite manipulation by patent applicants such as
claim drafting strategies that attempt to circumvent the
basic exceptions to §101 using, for example, highly stylized language, hollow field-of-use limitations, or the recitation of token post-solution activity should not be
credited.

Finally, the cases urge a flexible, claim-by-claim approach to subject-matter eligibility that avoids rigid line drawing. Bright-line rules may be simple to apply, but they are often impractical and counterproductive when applied to §101. Such rules risk becoming outdated in
the face of continual advances in technology.

In this software patent, claim 33 plainly recites a process. The issue presented then becomes whether that process amounts to no more than a patent-ineligible abstract idea. As described,
the first step in that analysis requires identifying the
abstract idea represented in the claim. The methods
claimed here draw on the abstract idea of reducing settlement risk by effecting trades through a third-party intermediary (here, the supervisory institution) empowered to verify that both parties can fulfill their obligations before allowing the exchange—i.e., a form of escrow. CLS describes that concept as “fundamental and ancient,”
but
the latter is not determinative of the question of abstractness. Even venerable concepts, such as risk hedging in
commodity transactions, were once unfamiliar, just like the concepts inventors are
unlocking at the leading edges of technology today. But
whether long in use or just recognized, abstract ideas
remain abstract. The concept of reducing settlement risk
by facilitating a trade through third-party intermediation
is an abstract idea because it is a “disembodied” concept, a basic building block of human ingenuity, untethered from any real-world application. Standing alone,
that abstract idea is not patent-eligible subject matter.

The analysis therefore turns to whether the balance of
the claim of the software patent adds “significantly more.” Apart from the idea
of third-party intermediation, the claim’s substantive
limitations require creating shadow records, using a
computer to adjust and maintain those shadow records,
and reconciling shadow records and corresponding exchange institution accounts through end-of-day transactions. None of those limitations adds anything of
substance to the claim.

The opinion states that the requirement for computer implementation
could scarcely be introduced with less specificity; the
claim lacks
any
express language to define the computer’s
participation. In a claimed method comprising an abstract idea, generic computer automation of one or more
steps evinces little human contribution. There is no
specific or limiting recitation of essential, or improved computer technology, and no reason to view the computer limitation as anything but “insignificant post-solution activity” relative to the abstract idea.
Furthermore, simply appending generic computer functionality to lend speed or efficiency to the performance of an otherwise abstract
concept does not meaningfully limit claim scope for purposes of patent eligibility.  That is particularly apparent in this case. Because of the efficiency and
ubiquity of computers, essentially all practical, real-world
applications of the abstract idea implicated here would
rely, at some level, on basic computer functions

for
example, to quickly and reliably calculate balances or
exchange data among financial institutions. At its most
basic, a computer is just a calculator capable of performing mental steps faster than a human could. Unless the
claims require a computer to perform operations that are
not merely accelerated calculations, a computer does not
itself confer patent eligibility. In short, the requirement
for computer participation in these claims fails to supply
an “inventive concept” that represents a nontrivial, non-conventional human contribution or materially narrows
the claims relative to the abstract idea they embrace.

Considering the computer readable storage medium claims of the software patent, the opinion noted that although the claim’s preamble appears to invoke a physical object, the claim term “computer readable storage
medium” is stated in broad and functional terms

incidental to the claim

and every substantive limitation
presented in the body of the claim pertains to the method steps of the
program code “embodied in the medium.” Therefore,
the claim is not “truly drawn to a specific computer readable medium, rather than to the underlying method” of
reducing settlement risk using a third

party intermediary. Despite their
Beauregard
format, Alice’s “computer readable medium claims” are thus
equivalent to the methods they recite for §
101 purposes.

Considering the software patent’s apparatus claims, the opinion states that the representative apparatus claim recites a computerized system configured to carry out a series of steps that mirror Alice’s
method claims

maintaining shadow records, allowing
only those transactions supported by adequate
value in
the shadow records, adjusting the shadow records pursuant to such transactions, and later instructing exchange institutions to execute the allowed transactions. Indeed,
Alice’s method and system claims use similar and often
identical language to
describe those actions. The
system claims are different, however, in that they also
recite tangible devices as system components, including at
least “a computer” and “a data storage unit.” Other
claims specify additional components, such as a “first
party device” and a “communications controller.”

Similar to the computer
readable medium claims, the system claims are formally
drawn to physical objects and therefore raise a question
whether they deserve to be evaluated differently under
the abstract ideas exception from the accompanying
method claims discussed above. Careful analysis shows
that they do not.
The computer-based limitations recited in the
system
claims here cannot support any meaningful distinction
from the computer-based limitations that failed to supply
an “inventive concept” to the related method claims.

The
shadow record and transaction limitations in Alice’s
method claims require “a computer,” evidently capable of calculation, storage,
and data exchange. The system claims are little different.
They set forth the same steps for performing third-party
intermediation and provide for computer implementation
at an incrementally reduced, though still striking level of
generality. Instead of wholly implied computer limitations, the system claims recite a handful of computer
components in generic, functional terms that would
encompass any device capable of performing the same
ubiquitous calculation, storage, and connectivity functions
required by the method claims. Though the
system claims associate certain computer components
with some of the method steps, none of the recited hardware offers a meaningful limitation beyond generally
linking “the use of the [method] to a particular technological environment,” that is, implementation via computers.

For all practical purposes,
every
general-purpose computer will include “a computer,” “a data
storage unit,” and “a communications controller” that
would be capable of performing the same generalized
functions required of the claimed systems to carry out the
otherwise abstract methods recited therein.

Therefore, as with the asserted method claims, such
limitations are not actually limiting in the sense required
under §
101; they provide no significant “inventive concept.” The system claims are instead akin to stating the
abstract idea of third

party
intermediation and adding
the words: “apply it” on a computer. That is not sufficient for patent eligibility, and
the system claims before us fail to define patent

eligible
subject matter under §
101, just as do the method and
computer-readable medium claims.

The opinion notes that one of the separate opinions (one with which Malhotra Law Firm, PLLC agrees) in this case takes aim at this opinion, asserting that the system claims here are simply claims to a
patent-eligible machine, a tangible item one can put
on
one’s desk.   Machines are unquestionably eligible for patenting, states the opinion, although the system claims
here clearly track the method claims that the separate
opinion concedes are not patent eligible.
That conclusion is surely correct as an abstract proposition. A particular computer system, composed of wires,
plastic, and silicon, is no doubt a tangible machine. But
that is not the question. The question we must consider is
whether a
patent claim
that ostensibly describes such a
system on its
face represents something more than an
abstract idea in legal substance.  Claims to computers
were, and still are, eligible for patent. No question should
have arisen concerning the eligibility of claims to basic
computer hardware under §
101 when such devices were
first invented. But we are living and judging now
(or at
least as of the patents’ priority dates), and have before us
not the patent eligibility of specific types of computers or
computer components, but computers that
have
routinely
been
adapted by software consisting of abstract ideas, and
claimed as such, to do all sorts of tasks that formerly were
performed by humans. And the Supreme Court has told
us that, while avoiding confusion between §
101 and
§§
102 and 103, merely adding existing computer technology to abstract ideas

mental steps

does not as a matter
of substance convert an abstract idea into a machine.

Malhotra Law Firm, PLLC (patentsusa.com) takes the position that apparatus claims reciting computer components clearly pass the machine-or-transformation test.

That is what we face when we have a series of claims
to abstract methods and computers fitted to carry out
those methods. We are not here faced with a computer
per
se
. Such are surely patent

eligible machines. We are
faced with abstract methods coupled with computers
adapted to perform those methods. And that is the fallacy
of relying on
Alappat
, as the concurrence in part does.
Not only has the world of technology changed, but the
legal world has changed. The Supreme Court has spoken
since
Alappat
on the question of patent eligibility, and we
must take note of that change. Abstract methods do not become patent-eligible machines
by being clothed in
computer language.

In view of this decision, Malhotra Law Firm, PLLC recommends reciting hardware as possible in patent claims, and integrating that hardware into the software method as much as possible.  There has been much lobbying against patenting of financial methods so it is possible that other software methods will be received more favorably.  This decision seems to be contrary to the machine-or-transformation test accepted by the Supreme Court in Bilski as one possible test, at least in my opinion.  Perhaps the Supreme Court will shed more light on the matter some day.  Until then, we have muddy guidance from our Federal Circuit.  They caution against bright line tests and with this decision have certainly not provided any bright lines.  After 20 years we still do not have any clear guidance on what sort of software should be patent-eligible.

In re Beauregard, 1995

Beauregard was a very important case in the History of Software Patents.  In re Beauregard is the case that opened things up completely for software patents. It signaled the end of the U.S. Patent and Trademark Office’s resistance to allow patent applications that contained algorithms.

Beauregard’s invention, described in U.S. Patent Application Serial No. 07/521,858, now U.S. Patent No. 5,710,578 (to IBM), related to graphical raster displays, and to a system and method for filling in the area defined by the boundaries of a polygon that is being displayed on a graphical raster display system. The software patent relates to accurately filling a polygon by including the points in an algorithm, called the Bresenham algorithm, that define the boundaries of a polygon in the resulting filled polygon.

The claims of this software patent recited “a computer usable medium” on which was stored “computer readable program code means,” i.e., a particular piece of computer software for filling a polygon displayed on a graphics display device. Claim 22 was representative:

Claim 22. An article of manufacture comprising:
a computer usable medium having computer readable program code means embodied therein for causing a polygon having a boundary definable by a plurality of selectable pels on a graphics display to be filled, the computer readable program code means in said article of manufacture comprising:
computer readable program code means for causing a computer to effect, with respect to one boundary line at a time, a sequential traverse of said plurality of selectable pels of each respective said boundary line;
computer readable program code means for causing the computer to store in an array during said traverse a value of an outer pel of said boundary of said plurality of selectable pels for each one of a plurality of scan lines of said polygon; and
computer readable program code means for causing the computer to draw a fill line, after said traverse, between said outer pels having said stored values, for each said one of said scan lines.

The USPTO Board rejected the claims using a variant of the printed matter rejection similar to that used in Lowry.

The California Multimedia and Software Patent Alliance filed a Amicus brief that asserted the following points, which were representative of the points raised by those who believed software patents were necessary:

The issue of whether a computer usable medium on which a particular piece of computer software is stored is protectable under the patent system is a particularly important one to the California multimedia and software industry for three reasons.

First, the copyright laws, perceived by many to be the most appropriate means for achieving protection of computer software, are inadequate. Under the abstraction/filtration/comparison test, which has been adopted in various forms by both the Ninth and Second Circuits as the appropriate method of defining the protectable aspects of computer software under the copyright laws, the ideas behind (or functions performed by) software are not protectable under the copyright laws. Thus, the scope of protection available is narrow and undefined.

Many other groups also filed Amicus briefs supporting Beauregard.

The Patent and Trademark Office filed a Motion to Dismiss stating that it was in agreement with the applicant that its claims recited statutory subject matter. The Federal Circuit noted that the parties were in agreement and that no case or controversy existed. The Federal Circuit vacated the Board of Appeals’s decision and remanded.

This was good news indeed for applicants and an important turning point in the history of software patents.