CLS Bank International v. Alice Corp. Pty. Ltd.
768 F. Supp. 2d 221
D.D.C.2011Background
- CLS Bank International seeks a declaratory judgment and Alice counters with infringement; four patents at issue relate to exchanging obligations in electronic systems.
- The patents include: '479 (claims 33-34), '510 (all claims), '720 (system claims), and '375 (system and program claims).
- Claims 33-34 of the '479 and all '510 claims are method claims; '720 and '375 are system/product claims.
- Alice asserts the claims implement a computer-implemented trading platform designed to reduce settlement risk via a supervisory/intermediary computer system.
- This court grants summary judgment that all asserted claims are directed to unpatentable subject matter under 35 U.S.C. § 101.
- The decision follows Supreme Court and Federal Circuit guidance on abstract ideas, transformation, and machine-implementation in the § 101 analysis.
Issues
| Issue | Plaintiff's Argument | Defendant's Argument | Held |
|---|---|---|---|
| Whether the method claims are patent-eligible under § 101. | Alice contends claims 33-34 ('479) and all '510 claims implement a concrete computer-implemented solution. | CLS argues claims are abstract ideas lacking patentable subject matter and not tied to a machine. | Invalid; claims are directed to abstract ideas under § 101. |
| Whether the system and product claims are patent-eligible under § 101. | Alice maintains system/product claims recite a machine/invention with tangible implementation. | CLS contends these claims merely recast abstract methods as hardware to evade § 101. | Invalid; system/product claims are not sufficiently tied to a patentable machine and preempt abstract concepts. |
| Whether the claims pass the machine-or-transformation test. | Alice asserts computer implementation ties to a machine and transforms data. | CLS argues no meaningful transformation or machine limitation exists. | Fail the MOT test; claims do not transform an article or tie to a specific machine in a meaningful way. |
| Whether, regardless of MOT, the claims fail as abstract ideas. | Alice argues claims address a concrete real-world problem with a computer-based solution. | CLS asserts the claims cover an abstract intermediary concept. | Invalid as abstract ideas with broad preemption. |
| If the claims were severed from the abstract concept, would remaining claims be patent-eligible? | Alice contends some dependent claims may survive. | CLS maintains all claims hinge on the same abstract concept. | No claims saved; remaining claims still directed to abstract idea. |
Key Cases Cited
- Diamond v. Diehr, 450 U.S. 175 (U.S. 1981) (process patentable when integrated with other steps, not mere formula)
- Bilski v. Kappos (Bilski II), 130 S. Ct. 3218 (2010) (abstract ideas and hedging; preemption concerns; not saved by generic computer implementation)
- Gottschalk v. Benson, 409 U.S. 63 (U.S. 1972) (algorithm as unpatentable abstract idea when claimed apart from application)
- In re Comiskey, 499 F.3d 1365 (Fed. Cir. 2007) (early test focus on abstract ideas and transformation, pre-Bilski lineage)
- State Street Bank & Trust Co. v. Signature Fin. Group, Inc., 149 F.3d 1368 (Fed. Cir. 1998) (useful, concrete, tangible result approach; later rejected as sole test)
- Alappat v. FCC, 33 F.3d 1526 (Fed. Cir. 1994) (special-purpose computer as machine after programming; limits on abstract ideas)
- Research Corp. Techs. v. Microsoft Corp., 627 F.3d 859 (Fed. Cir. 2010) (examines abstractness in technology claims; guidance on specific applications)
- Arrhythmia Research Techs. v. Corazonix Corp., 958 F.2d 1053 (Fed. Cir. 1992) (algorithmic data transformation; precedential limits on abstract ideas)