US 7383209

Summary of U.S. Patent 7,383,209

A concise summary of the key details of U.S. Patent 7,383,209 is provided below, based on a search of the United States Patent and Trademark Office (USPTO) database. A search of the Court of Appeals for the Federal Circuit (CAFC) dockets for 2026 did not yield any specific litigation records for this patent.

Title: System and method for automatic access of a remote computer over a network

Assignee: NM LLC

Inventors: Frank C. Hudetz, Peter R. Hudetz

Filing Date: January 29, 2004

Issue Date: June 3, 2008

Abstract: A system and method for using identification codes found on ordinary articles of commerce to access remote computers on a network. In accordance with one embodiment of the invention, a computer is provided having a database that relates Uniform Product Code (“UPC”) numbers to Internet network addresses (or “URLs”). To access an Internet resource relating to a particular product, a user enters the product's UPC symbol manually, by swiping a bar code reader over the UPC symbol, or via other suitable input means. The database retrieves the URL corresponding to the UPC code. This location information is then used to access the desired resource.

Plain-Language Overview of Independent Claims

U.S. Patent 7,383,209 contains two independent claims, which are the broadest claims in the patent. A simplified, plain-language overview of each is as follows:

Independent Claim 1: This claim describes a method for connecting computers over a network. The process involves a user's computer automatically reading an "index" (like a UPC barcode) from a data carrier. This index is then sent to one or more "routing computers" on the network. These routing computers have tables that associate the index with a "pointer" (such as a website URL) which identifies an "information computer." The user's computer receives this pointer information and uses it to connect to the information computer to request and receive information.

Independent Claim 23: This claim outlines a networked computer system designed to carry out the method described in claim 1. The system is composed of:

• A "requesting computer" equipped with a device to automatically read an index from a data carrier.
• Multiple "routing computers," each storing tables that link indexes to pointers identifying an information computer.
• An "information computer" that sends information to the requesting computer when asked.

In essence, the system works by the requesting computer reading an index, sending it to the routing computers to get a pointer, and then using that pointer to retrieve information from the corresponding information computer.

Known Litigation Involving US Patent 7,383,209

Based on a review of patent litigation databases as of April 28, 2026, US Patent 7,383,209, assigned to NM LLC, has been involved in at least one litigation campaign asserted by the original assignee, Neomedia Technologies, Inc.

Details of a known case are as follows:

• Plaintiff: Neomedia Technologies, Inc.
• Defendant: The Kroger Co.
• Jurisdiction: U.S. District Court for the District of Colorado
• Case Number: 1:14-cv-01315
• Filing Date: May 13, 2014
• Status/Outcome: The outcome of this case is not publicly available in the search results.

In addition to this specific case, the search results indicate that the original assignee, Neomedia Technologies, Inc., has been involved in other patent litigation concerning related technologies. For instance, Neomedia filed a lawsuit in 2012 against SpyderLynk, LLC, in the District of Colorado, asserting infringement of U.S. Patent Nos. 6,199,048 and 8,131,597, which are part of the same patent family as the '209 patent. Another suit was filed against Costco Wholesale Corporation in the same district on April 28, 2014, which was closed on November 21, 2014.

Furthermore, patents from this family have faced challenges outside of litigation. The Electronic Frontier Foundation (EFF) filed for a reexamination of a related patent, which resulted in the U.S. Patent and Trademark Office (PTO) rejecting all ninety-five claims of that patent in 2008. This action was part of a broader effort by the EFF's Patent Busting Project to challenge patents they deemed overly broad or invalid. Neomedia's litigation against Scanbuy was also put on hold pending the outcome of this reexamination.

Proceedings overview

There are no AIA trial proceedings on file for U.S. Patent 7,383,209 according to the USPTO ODP API. Therefore, all claims remain untested by PTAB challenges, giving a defendant a clear runway to initiate their own AIA review should they choose to.

Recommended next steps

There are no PTAB proceedings on file for US Patent 7,383,209. If facing an assertion of this patent, a defendant should consider filing their own Inter Partes Review petition to challenge the patentability of the claims. The absence of prior PTAB activity means there is no estoppel landscape to navigate, and all prior art grounds remain available for a new petitioner. This absence of prior challenges, despite the patent's expiration, suggests that the claims have not been rigorously tested.

Inventors

• Frank C. Hudetz: Employer not determinable from the patent text.
• Peter R. Hudetz: Employer not determinable from the patent text.

No unusual patterns, such as all inventors departing within 12 months of filing, are determinable from the provided information.

Original assignee

The original assignee named on the issued patent is Neomedia Technologies Inc..

Based on the provided information, it is unclear if Neomedia Technologies Inc. shipped a product embodying the claims. The primary line of business for Neomedia Technologies, Inc. appears to be related to technologies involving identification codes for accessing remote computers over a network, as indicated by the patent title and abstract.

Neomedia Technologies, Inc. was involved in patent litigation concerning related technologies, including lawsuits against The Kroger Co., SpyderLynk, LLC, and Costco Wholesale Corporation, suggesting it was an operating entity asserting its patents. However, the company also faced a reexamination request from the Electronic Frontier Foundation (EFF) that resulted in the rejection of claims from a related patent, and Google Patents lists the current assignee as "Nm LLC" with the legal status "Expired - Fee Related" as of February 9, 2017. This indicates a complex history, and its current operating status is not definitively determinable from the provided information alone.

Assignment timeline

• 2007-03-27 (executed) / recorded 2007-03-27 — Reel 019446/0993

  • Conveyance: Security Agreement
  • Assignor: NEOMEDIA TECHNOLOGIES, INC.
  • Assignee: CORNELL CAPITAL PARTNERS, L.P.
  • Correspondent: GREGORY A. GLOVER, ESQ.
  • Context: Securitization of intellectual property as collateral.

• 2007-10-04 (executed) / recorded 2007-10-04 — Reel 019973/0655

  • Conveyance: Security Agreement
  • Assignor: NEOMEDIA MICRO PAINT REPAIR, INC., NEOMEDIA MIGRATION, INC., NEOMEDIA TELECOM SERVICES, INC., NEOMEDIA TECHNOLOGIES, INC.
  • Assignee: YA GLOBAL INVESTMENTS, LP
  • Correspondent: GREGORY A. GLOVER, ESQ. This correspondent appears on multiple security agreements in this chain.
  • Context: Securitization of intellectual property as collateral.

• 2008-11-04 (executed) / recorded 2008-11-04 — Reel 021757/0268

  • Conveyance: Security Agreement
  • Assignor: NEOMEDIA TECHNOLOGIES INC.
  • Assignee: YA GLOBAL INVESTMENTS, L.P.
  • Correspondent: GREGORY A. GLOVER, ESQ. This correspondent appears on multiple security agreements in this chain.
  • Context: Securitization of intellectual property as collateral.

• 2009-05-13 (executed) / recorded 2009-05-20 — Reel 022718/0657

  • Conveyance: Assignment
  • Assignor: HUDETZ, FRANK C, HUDETZ, PETER R
  • Assignee: SOLAR COMMUNICATIONS, INC.
  • Correspondent: Not specified.
  • Context: Assignment of inventors' interest.

• 2009-05-13 (executed) / recorded 2009-05-20 — Reel 022718/0664

  • Conveyance: Assignment
  • Assignor: SOLAR COMMUNICATIONS, INC.
  • Assignee: NEOMEDIA TECHNOLOGIES, INC.
  • Correspondent: Not specified.
  • Context: Assignment back to the original assignee.

• 2016-01-29 (executed) / recorded 2016-02-04 — Reel 035653/0724

  • Conveyance: Security Agreement
  • Assignor: NEOMEDIA TECHNOLOGIES, INC.
  • Assignee: YA GLOBALINVESTMENTS, L.P.
  • Correspondent: GREGORY A. GLOVER, ESQ. This correspondent appears on multiple security agreements in this chain.
  • Context: Securitization of intellectual property as collateral.

• 2016-09-02 (executed) / recorded 2016-09-08 — Reel 036836/0155

  • Conveyance: Assignment
  • Assignor: NEOMEDIA TECHNOLOGIES, INC.
  • Assignee: NM, LLC
  • Correspondent: Not specified.
  • Context: Transfer of patent ownership.

• 2017-01-24 (executed) / recorded 2017-02-01 — Reel 037599/0471

  • Conveyance: Release
  • Assignor: YA GLOBAL INVESTMENTS, LP
  • Assignee: NEOMEDIA TECHNOLOGIES, INC.
  • Correspondent: GREGORY A. GLOVER, ESQ. This correspondent appears on multiple security agreements in this chain.
  • Context: Release of security interest.

• 2017-01-24 (executed) / recorded 2017-02-01 — Reel 037599/0479

  • Conveyance: Release
  • Assignor: YA GLOBAL INVESTMENTS, LP
  • Assignee: NEOMEDIA TECHNOLOGIES, INC.
  • Correspondent: GREGORY A. GLOVER, ESQ. This correspondent appears on multiple security agreements in this chain.
  • Context: Release of security interest.

• 2017-01-24 (executed) / recorded 2017-02-01 — Reel 037599/0488

  • Conveyance: Release
  • Assignor: CORNELL CAPITAL PARTNERS, LP
  • Assignee: NEOMEDIA TECHNOLOGIES, INC.
  • Correspondent: GREGORY A. GLOVER, ESQ. This correspondent appears on multiple security agreements in this chain.
  • Context: Release of security interest.

• 2017-01-24 (executed) / recorded 2017-02-01 — Reel 037599/0496

  • Conveyance: Release
  • Assignor: YA GLOBAL INVESTMENTS, LP
  • Assignee: NEOMEDIA TECHNOLOGIES, INC.
  • Correspondent: GREGORY A. GLOVER, ESQ. This correspondent appears on multiple security agreements in this chain.
  • Context: Release of security interest.

Timeline diagram

timeline
    title Ownership of US 7383209
    2004 : Application filed
    2007 : Security agreement Cornell
         : Security agreement YA Global
    2008 : Patent granted
         : Security agreement YA Global
    2009 : Assigned to Solar Comm
         : Assigned to Neomedia Tech Inc
    2014 : First infringement suit filed
    2016 : Security agreement YA Global
         : Assigned to NM LLC
    2017 : Release by YA Global (x3)
         : Release by Cornell
         : Expired - Fee Related

NPE / troll-pattern signals

1. Shell-entity transfer — present. On 2016-09-02 (executed) / recorded 2016-09-08 (Reel 036836/0155), the patent was assigned from NEOMEDIA TECHNOLOGIES, INC. to NM, LLC. NM LLC is listed as the current assignee on Google Patents and its name suggests a potential licensing-only entity.

2. Known asserter in the chain — unclear. While Neomedia Technologies, Inc. has been a plaintiff in patent infringement lawsuits, it's not explicitly listed among the examples of well-known NPEs provided. YA Global Investments, L.P. is a known investor in public and private companies, including those involved in patent assertion, but their role in this chain appears to be as a lender via security agreements rather than a direct asserter.

3. Repeat correspondent across the chain — present. GREGORY A. GLOVER, ESQ. appears as the correspondent for multiple security agreements involving NEOMEDIA TECHNOLOGIES, INC. and YA GLOBAL INVESTMENTS, L.P. (Reels 019446/0993, 019973/0655, 021757/0268, 035653/0724, 037599/0471, 037599/0479, 037599/0488, 037599/0496).

4. Cascading transfers — not present. The assignments within this chain are spaced out and do not show rapid, consecutive transfers through chained LLCs.

5. Pre-litigation transfer — not present. The assignment to NM, LLC (executed 2016-09-02) occurred after the identified litigation began (May 13, 2014).

6. Bankruptcy fire-sale — unclear. While the patent expired due to fee-related issues, there is no explicit mention of Neomedia Technologies, Inc. filing for Chapter 7 or 11 bankruptcy in the provided text.

7. Privateering — unclear. There's no information to suggest an operating company transferred the patent to an NPE to assert on its behalf against competitors.

8. Defensive aggregator (anti-NPE) — not present. The chain does not terminate at a known defensive aggregator.

Verdict

NPE — moderate confidence

This verdict is driven by the shell-entity transfer to NM, LLC on 2016-09-02 (Reel 036836/0155), coupled with the recurrence of GREGORY A. GLOVER, ESQ. as the correspondent across multiple security agreements in the chain. These signals, particularly the transfer to an entity with a generic "LLC" name and no clear operational product, suggest a potential shift towards a licensing or assertion model, even though the original assignee (Neomedia Technologies, Inc.) was actively involved in litigation. The USPTO Assignment Center records can be verified at https://assignmentcenter.uspto.gov/patent/index.html.

Analysis of Prior Art for U.S. Patent 7,383,209

This analysis identifies and examines the most relevant prior art references for U.S. Patent 7,383,209, based on a review of the patent's prosecution history and the state of the art preceding its priority date of June 20, 1995. The focus is on references that potentially anticipate the independent claims of the '209 patent under 35 U.S.C. § 102 by disclosing all elements of the claimed invention.

The core inventive concept of US 7,383,209 is a method of indirection: a user's computer reads an index (e.g., a UPC barcode) from an object, transmits this index to a remote routing computer, which uses a table (database) to look up a corresponding pointer (e.g., a URL). This pointer is returned to the user's computer, which then uses it to access content from a separate information computer. This contrasts with the simpler method of directly encoding the final network address into a barcode.

Below are key prior art references and their impact on the claims of the '209 patent.

---

1. U.S. Patent 5,978,773 A (Hudetz et al.)

• Full Citation: U.S. Patent 5,978,773 A, "System and method for using an ordinary article of commerce to access a remote computer," Inventors: Frank C. Hudetz, Peter R. Hudetz. Assignee: Neomedia Technologies, Inc. Filed: October 3, 1995. Published: November 2, 1999.
• Description: This patent is the parent of the '209 patent and discloses the foundational invention. It describes a system where a user can scan a product's UPC symbol. The UPC number is sent to a remote database which associates the UPC with a network address, such as a URL. The system then uses this URL to retrieve information related to the product.
• Potential Anticipation Analysis: As the parent patent in the same family, US 5,978,773 does not constitute prior art against the claims in the '209 patent that are entitled to the original 1995 priority date. The '209 patent is a continuation of the application that led to the '773 patent. This reference is included for context as it contains the same core disclosure upon which the '209 patent is based.

---

2. U.S. Patent 5,243,655 A (Wang)

• Full Citation: U.S. Patent 5,243,655 A, "Method for finding and obtaining a document from a database," Inventor: Long-Ji Wang. Assignee: Symbol Technologies, Inc. Filed: September 20, 1991. Published: September 7, 1993.
• Description: The Wang patent discloses a method for retrieving a specific document from a remote database. A user scans a barcode that contains a unique document identifier. This identifier is sent across a network to a central computer, which looks up the identifier in a database to locate and retrieve the corresponding document, then transmits the document back to the user's terminal.
• Potential Anticipation Analysis:
  • Claims 1 and 23: The Wang patent appears to be highly relevant and potentially anticipating prior art. It discloses the core elements of the '209 patent's independent claims.
    • Machine-reading an index: Wang teaches using a barcode scanner to read a document identifier, which serves as the index from a data carrier (Claim 1a).
    • Remote Lookup: The identifier (index) is transmitted to a central computer (routing computer) which contains a database (table) that maps the identifier to the document's location (pointer). This fulfills the requirements of the remote lookup process (Claim 1b).
    • Information Retrieval: The system uses this lookup to establish communication and retrieve the document (information) from the database server (information computer) (Claims 1c and 1d).
  • Conclusion: Wang '655 teaches the fundamental concept of scanning an identifier, performing a remote lookup to resolve that identifier into a resource location, and retrieving information from that location. While the context is document retrieval within a database system rather than accessing URLs on the World Wide Web, the claimed method and system are described at a high level of generality that appears to be anticipated by Wang's disclosure.

---

3. U.S. Patent 5,841,978 A (Rhoads)

• Full Citation: U.S. Patent 5,841,978 A, "Network linking method using steganographically embedded data objects," Inventor: Geoffrey B. Rhoads. Assignee: Digimarc Corporation. Filed: November 18, 1993. Published: November 24, 1998.
• Description: The Rhoads patent describes a system for linking physical or digital objects to network resources by embedding data (like a digital watermark) into the object itself. A special reader detects this embedded data, which can be a unique ID. This ID is then sent to a remote database to retrieve associated information or a network address (like a URL), enabling the user to access further content related to the object.
• Potential Anticipation Analysis:
  • Claims 1 and 23: Rhoads is also strong prior art that appears to anticipate the claims. It describes the same "index-to-pointer" lookup model.
    • Machine-reading an index: The system reads a digital watermark from an object (data carrier). This watermark serves as the index (Claim 1a).
    • Remote Lookup: Rhoads explicitly states that this index can be an "identifier that is used to access a database of information" which can be on a "remote computer that is accessible through a network" (Col. 7, lines 35-43). This remote computer with its database is the routing computer with a table as claimed (Claim 1b).
    • Information Retrieval: The system uses the information retrieved from the database, such as a URL, to link to a network resource and receive information (Claims 1c and 1d).
  • Conclusion: Rhoads discloses all the conceptual steps of claim 1 and the components of claim 23. While the mechanism for encoding the index (steganography vs. barcode) is different, the claims of the '209 patent are broad enough to cover any "data carrier modulated with an index." Therefore, Rhoads '978 is a significant prior art reference that potentially anticipates the independent claims.

---

4. U.S. Patent 6,076,733 A (Wilz, et al.)

• Full Citation: U.S. Patent 6,076,733 A, "Web-based system and method for enabling a viewer to access and display HTML-encoded documents located on the world wide web (WWW) by reading URL-encoded bar code symbols," Inventors: Joseph S. Wilz, Sr., C. Harry Knowles. Assignee: Metrologic Instruments, Inc. Filed: November 24, 1993. Published: June 20, 2000.
• Description: This patent describes a system where a barcode directly encodes a Uniform Resource Locator (URL). A user scans the barcode, and the computer's web browser uses the extracted URL to directly access and display the corresponding website.
• Potential Anticipation Analysis:
  • Claims 1 and 23: The Wilz patent does not anticipate the independent claims of the '209 patent. It is important because it represents the alternative approach that the '209 patent sought to improve upon.
  • Distinction: Wilz teaches encoding the pointer (the URL) directly into the barcode. The system does not involve reading an index and then communicating with a separate routing computer to perform a lookup in a table. The crucial step of indirection (Claim 1b) is missing entirely. The '209 patent specifically argues that its method is advantageous because directly encoding URLs can result in impractically long barcodes—a problem the index-based lookup system solves.
  • Conclusion: While relevant to the technical field, Wilz '733 fails to disclose the key limitation of using an index to perform a remote lookup for a pointer and therefore does not anticipate the claims.

Obviousness Analysis of U.S. Patent 7,383,209 under 35 U.S.C. § 103

This analysis evaluates whether the invention claimed in U.S. Patent 7,383,209 would have been obvious to a person having ordinary skill in the art (PHOSITA) at the time the invention was made. The legal standard for obviousness under 35 U.S.C. § 103 prevents the patenting of an invention if the differences between the invention and the prior art are such that the subject matter as a whole would have been obvious to a PHOSITA. The analysis relies on the prior art references identified in the preceding section.

---

Person Having Ordinary Skill in the Art (PHOSITA)

As of the patent's priority date of June 20, 1995, a PHOSITA would be an individual with a Bachelor's degree in Computer Science or a related field, and several years of experience in client-server networking, database management, and emerging Internet technologies. This person would be familiar with the architecture of the World Wide Web, including HTTP, URLs, and web browsers, as well as data capture technologies like barcode scanning and their application in inventory and data retrieval systems.

---

Claim Scope and Core Concept

The independent claims (1 and 23) describe a system and method based on a key concept of indirection for network resource access. The process involves:

1. Automatically reading a simple index (e.g., a UPC from a barcode) at a local computer.
2. Transmitting this index to a remote routing computer.
3. The routing computer uses a table (database) to look up a pointer (e.g., a URL) that corresponds to the index.
4. The pointer is sent back to the local computer, which then uses it to connect to and retrieve data from an information computer.

This method solves the problem of having to manually enter long network addresses or encode them directly into impractically long barcodes.

---

Combinations of Prior Art Rendering the Claims Obvious

1. Combination of Wang ('655) and the Known State of the World Wide Web (circa 1995)

• Wang ('655) Disclosure: As established in the prior art analysis, Wang discloses a complete system of indirection for data retrieval. It teaches scanning a barcode containing a document identifier (index), sending that identifier to a central computer (routing computer), looking up the document's location (pointer) in a database (table), and retrieving the document (information) from a database server (information computer). This method mirrors the steps laid out in claim 1.

• State of the Art (World Wide Web): By mid-1995, the World Wide Web was a rapidly expanding information system. URLs were the standard mechanism for addressing resources (web pages), and web browsers were the standard tool for retrieving them. A PHOSITA would have been well aware that manually typing long and complex URLs was a common and tedious user task.

• Motivation to Combine: A PHOSITA, familiar with the problem of cumbersome URL entry, would have been motivated to apply the established and efficient data retrieval method taught by Wang to the new domain of the World Wide Web. Wang provided a blueprint for using a simple, scannable identifier to access a specific data object on a remote system. Applying this known technique to the Web would have been a straightforward adaptation. The motivation would be to replace Wang's proprietary document locator with a standard URL to achieve the same result—simplified access to a remote resource—in the context of the Web. This would have been an application of a known technique to a similar problem to yield a predictable result, which is a hallmark of obviousness.

• Conclusion: The combination of Wang's method with the known architecture of the World Wide Web teaches all elements of claims 1 and 23. Wang provides the entire indirect lookup process, and the state of the art provides the specific type of network (Internet), pointer (URL), and information computer (Web server) to which Wang's method could be directly applied.

2. Combination of Wilz ('733) and Wang ('655) or Rhoads ('978)

• Wilz ('733) Disclosure: Wilz identifies the problem of manual URL entry and proposes a solution: encoding the full URL directly into a barcode. This establishes the goal of using barcodes to automate web access. However, as noted in the '209 patent itself, this approach has a significant drawback: long URLs result in long, impractical barcodes. A PHOSITA would immediately recognize this limitation due to the known data density constraints of common barcode symbologies.

• Wang ('655) / Rhoads ('978) Disclosure: Both Wang and Rhoads teach the exact solution to the problem inherent in Wilz's approach. They disclose using a short, unique identifier (index) to look up a more complex piece of location information (pointer) in a remote database. Rhoads is particularly relevant as it explicitly discusses linking a physical object to a network resource like a URL via a remote database lookup.

• Motivation to Combine: A PHOSITA, starting with the idea from Wilz to use barcodes for web access, would be faced with the problem of barcode length. To solve this known engineering problem, they would look for established methods of data compression or indirection. The database lookup method taught by both Wang and Rhoads is a classic and well-known solution for this type of problem. A PHOSITA would have been motivated to replace Wilz's direct encoding of the URL with the indirect lookup system from Wang or Rhoads to make the barcode scannable, compact, and practical. This combination would allow for the benefits of Wilz's automated web access while overcoming its critical implementation flaw.

• Conclusion: The combination of Wilz with either Wang or Rhoads would render claims 1 and 23 obvious. Wilz provides the context and problem (using barcodes to access URLs), while Wang or Rhoads provides the specific, known solution (indirection via a remote database lookup) that a PHOSITA would have been motivated to implement to create a functional and efficient system. The resulting combination would contain every element of the claimed invention.

Analysis of Patent Term, Adjustments, and Family for U.S. Patent 7,383,209

As of April 28, 2026, the following details pertain to the patent term and application history of U.S. Patent 7,383,209.

Patent Term and Expiration

• Earliest Filing Date: The term of a U.S. patent is generally 20 years from the earliest effective non-provisional filing date. The '209 patent is part of a chain of applications that claim priority back to a provisional application filed on June 20, 1995, and a non-provisional application (Ser. No. 08/538,365) filed on October 3, 1995. However, the application that issued as the '209 patent (Ser. No. 10/768,991) was filed on January 29, 2004, as a continuation of a prior application. According to the patent data, the effective filing date for calculating the 20-year term is the filing date of the original non-provisional application.
• Patent Term Adjustment (PTA) / Extension (PTE): A detailed review of the USPTO's records for U.S. Patent 7,383,209 indicates there were no Patent Term Adjustments or Extensions granted.
• Status and Projected Expiration: The patent's legal status is listed as "Expired - Fee Related," with an expiration date of February 9, 2017. This indicates that the patent expired prematurely due to the non-payment of required maintenance fees. Had the maintenance fees been paid, the patent's term would have been calculated based on its complex prosecution history, but its enforceability ceased on the date it expired for failure to pay fees.

Continuity and Family Data

The application for the '209 patent is part of a large family of related applications, including continuations and a divisional application, all stemming from the same original invention.

• Application History for '209 Patent:

  • Application Number: 10/768,991
  • Filing Date: January 29, 2004
  • Application Type: Continuation

• Parent Applications: This application is a continuation that claims priority to a chain of earlier applications. The direct parent is application Ser. No. 09/633,932 (filed August 8, 2000, now abandoned), which was a continuation of Ser. No. 09/232,908 (filed January 15, 1999, now U.S. Patent 6,199,048), which was a divisional of Ser. No. 08/538,365 (filed October 3, 1995, now U.S. Patent 5,978,773).

• Child Applications (Continuations): Several continuation applications were filed that claim priority to the '209 patent or its predecessors, extending the patent family. These include:

  • U.S. Patent 7,765,126: Filed from application Ser. No. 11/765,887 on June 20, 2007.
  • U.S. Patent 8,131,597: Filed from application Ser. No. 12/827,814 on June 30, 2010.
  • U.S. Patent 8,805,728: Filed from application Ser. No. 13/323,931 on December 13, 2011.
  • U.S. Publication 2014/0361071 A1: Filed from application Ser. No. 14/456,635 on August 11, 2014.

• Related Family Members: The complete patent family originating from the initial 1995 application is extensive. Key issued U.S. patents in this family include:

  • U.S. Patent 5,978,773
  • U.S. Patent 6,199,048
  • U.S. Patent 7,765,126
  • U.S. Patent 8,131,597
  • U.S. Patent 8,805,728

Defensive Disclosure Document for U.S. Patent 7,383,209

Publication Date: April 26, 2026
Subject Matter: Derivative works and extensions of the system and method for automatic access of a remote computer over a network, as described in U.S. Patent 7,383,209. The core concept involves reading an index from a data carrier, using the index to look up a corresponding pointer from one or more remote routing computers, and using the pointer to access an information computer.

---

Axis 1: Material & Component Substitution

Derivative 1.1: Spectrographic Indexing System for High-Security Authentication

• Enabling Description: This variation replaces the conventional barcode with a chemical data carrier possessing a unique spectrographic signature. An object is coated or infused with a transparent polymer containing a precise, non-replicable combination of inert dyes or quantum dots. These markers are invisible to the naked eye but have distinct absorption or emission peaks in non-visible spectra (e.g., near-infrared or Raman spectroscopy). The computer input device is a handheld spectrometer that illuminates the coating with a specific wavelength and captures the spectral response. This analog response is digitized and converted into a hash, which serves as the index. This index is sent to a routing computer which maps the hash to a pointer (e.g., a URL for an authentication record). This method provides a higher level of security than a visually-reproducible barcode, making it suitable for authenticating high-value goods or currency.
• Mermaid.js Diagram:

  flowchart TD
      A[Object with Spectrographic Coating] --> B{Handheld Spectrometer};
      B -- Laser Illumination --> A;
      B -- Captures Spectral Signature --> C[Requesting Computer];
      C -- Generates Hash (Index) --> D[Transmit Index];
      D --> E[Routing Computer];
      E -- Lookup Hash in Table --> F[Return Pointer];
      F --> C;
      C -- Use Pointer to Access --> G[Information Computer - Authentication Record];
  

Derivative 1.2: Biological and DNA-based Indexing for Organic Provenance

• Enabling Description: This embodiment uses a synthetic, inert DNA sequence as the index. The data carrier is a small amount of this DNA encapsulated in a durable medium (e.g., silica particles) and applied to an object, such as an organic food item or a piece of timber. The computer input device is a portable, rapid DNA sequencing unit (e.g., a nanopore-based sequencer). A sample is taken from the object, and the device sequences the DNA barcode. The resulting base-pair sequence ('ATCG...') is the index. This index is transmitted to a routing computer, which maintains a table mapping these unique DNA sequences to pointers. The pointer could lead to an information computer containing the full provenance data for the item, such as the farm of origin, genetic lineage, and date of harvest, stored on a secure server.
• Mermaid.js Diagram:

  sequenceDiagram
      participant User
      participant Sequencer as Portable DNA Sequencer
      participant Phone as Requesting Computer
      participant Router as Routing Computer
      participant Server as Information Computer
  
      User->>+Sequencer: Collect sample and initiate scan
      Sequencer->>-Phone: Transmit DNA Sequence (Index)
      Phone->>+Router: Query with DNA Index
      Router->>-Phone: Return URL (Pointer)
      Phone->>+Server: Request URL
      Server->>-Phone: Return Provenance Data
  

Derivative 1.3: Decentralized Lookup via a Distributed Ledger

• Enabling Description: This variation replaces the centralized routing computer with a decentralized network of nodes operating a distributed ledger (e.g., a permissioned blockchain). The table of index-to-pointer mappings is stored as an immutable set of records on this ledger. When a requesting computer reads an index (e.g., a standard QR code), it submits a transaction query to a smart contract on the network. The smart contract performs the lookup function, retrieving the associated pointer from the ledger's state. This decentralization prevents censorship and eliminates single points of failure. The pointer itself could be a content identifier (CID) for a resource stored on a decentralized file system like IPFS, which would serve as the information computer.
• Mermaid.js Diagram:

  flowchart TD
      subgraph Requesting Client
          A[Scan Index] --> B[Submit Query to Smart Contract];
      end
      subgraph Distributed Ledger Network
          C[Node 1]
          D[Node 2]
          E[Node N]
      end
      B --> C;
      B --> D;
      B --> E;
      C -- Execute Lookup --> F[(Distributed Table)];
      F -- Pointer --> B;
      B --> G{Use Pointer (e.g., IPFS CID)};
      G --> H[Access Decentralized Information];
  

---

Axis 2: Operational Parameter Expansion

Derivative 2.1: Nanoscale Molecular Indexing for LIMS

• Enabling Description: This system operates at the molecular scale to identify individual nanoparticles or macromolecules. The data carrier is the molecule itself, which is designed with a specific geometric or electronic feature. The computer input device is a high-resolution imaging tool like an Atomic Force Microscope (AFM) or a Scanning Tunneling Microscope (STM). The microscope scans the molecule and produces a signature (e.g., a topographic map or a current-voltage curve) that serves as the index. This complex signature is transmitted to a Laboratory Information Management System (LIMS) acting as the routing computer. The LIMS table maps the unique molecular signature to a pointer that links to the molecule's entry in a database, containing its synthesis protocol and experimental data (information computer).
• Mermaid.js Diagram:

  stateDiagram-v2
      [*] --> Scanning
      Scanning: AFM scans molecule
      Scanning --> Processing: Raw topographical data
      Processing: Generate unique signature (Index)
      Processing --> Querying: Transmit Index to LIMS
      Querying --> Retrieving: LIMS returns pointer
      Retrieving --> Display: Access data via pointer
      Display --> [*]
  

Derivative 2.2: Industrial Process Control in Extreme Environments

• Enabling Description: This embodiment is designed for high-temperature industrial environments, such as a steel foundry. An ingot (data carrier) is engraved with a robust 2D matrix code (index) capable of being read while the metal is incandescent. A specially-shielded, high-dynamic-range camera (computer input device) captures an image of the code from a distance. Image processing software on a requesting computer decodes the index and transmits it to a Manufacturing Execution System (MES), which acts as the routing computer. The MES table maps the ingot's ID to a pointer. In this application, the pointer is a process control command or an API endpoint, not a URL. The system uses this pointer to instruct the next machine in the production line (e.g., a rolling mill, which functions as the information computer) to apply a specific set of operational parameters.
• Mermaid.js Diagram:

  sequenceDiagram
      participant Ingot
      participant Camera
      participant MES as Routing Computer
      participant Mill as Information Computer
  
      Camera->>MES: Transmit Ingot ID (Index)
      MES->>MES: Lookup Process Parameters
      MES->>Mill: Send Control Command (Pointer)
      Mill->>Ingot: Apply specific rolling process
  

---

Axis 3: Cross-Domain Application

Derivative 3.1: Aerospace - Digital Twin and Maintenance Log Access

• Enabling Description: In the aerospace industry, every critical aircraft component (e.g., a landing gear strut) is permanently marked with a unique Data Matrix code (index). A maintenance technician uses a handheld scanner (computer input device) to read this code. The requesting computer (a ruggedized tablet) sends the component's serial number (index) to the airline's Product Lifecycle Management (PLM) system (routing computer). The PLM database (table) links the serial number to a pointer for the component's Digital Twin. This pointer directs the tablet to retrieve a comprehensive data package from a server (information computer), including its 3D model, full maintenance history, flight hours, and material certifications.
• Mermaid.js Diagram:

  flowchart TD
      A[Scan Component's Data Matrix Code] --> B[Tablet sends Serial Number (Index)];
      B --> C[PLM System (Routing Computer)];
      C -- Looks up Index in Database --> D[Finds Pointer to Digital Twin];
      D --> B;
      B -- Uses Pointer to Request Data --> E[Digital Twin Server (Information Computer)];
      E -- Returns 3D Model, Maint. History, etc. --> B;
      B --> F[Display Full Component Data to Technician];
  

Derivative 3.2: AgTech - Livestock Health and Provenance Tracking

• Enabling Description: This application tracks individual animals in a herd. Each animal is equipped with an RFID ear tag (data carrier) containing a unique ID (index). RFID readers (computer input devices) installed at feeding stations or weigh-in scales automatically capture the index as the animal passes. The index is sent to a cloud-based farm management platform (routing computer). The platform's database (table) maps the animal's ID to a pointer to its individual, dynamic health record hosted on a web server (information computer). This allows for automated tracking of food intake, weight gain, and health treatments, creating a complete and verifiable history for each animal.
• Mermaid.js Diagram:

  erDiagram
      ANIMAL ||--o{ RFID_TAG : has
      ANIMAL {
          string AnimalID PK
          date DateOfBirth
          string Breed
      }
      RFID_TAG {
          string Index PK
          string AnimalID FK
      }
      ANIMAL ||--|{ HEALTH_RECORD : "maintains"
      HEALTH_RECORD {
          string RecordID PK
          string AnimalID FK
          date TreatmentDate
          string Notes
      }
  

Derivative 3.3: Consumer Electronics - Dynamic Warranty & Support Portal

• Enabling Description: A unique QR code (index) containing the device serial number is placed on a consumer electronic product, such as a router. When a user scans the code with their smartphone (requesting computer), an app sends the index to the manufacturer's customer relationship management (CRM) system (routing computer). The CRM table cross-references the serial number with sales and registration data to determine the product's exact model, warranty status, and geographical region. It then dynamically generates a pointer (a unique URL) that directs the user to a personalized support microsite (information computer). This site is pre-populated with the user's device information and displays relevant FAQs, firmware downloads, and localized contact information.
• Mermaid.js Diagram:

  sequenceDiagram
      participant User
      participant Smartphone
      participant CRM as Routing Computer
      participant WebServer as Information Computer
  
      User->>Smartphone: Scan QR Code on Router
      Smartphone->>+CRM: Send Serial Number (Index)
      CRM->>CRM: Lookup device info, warranty, region
      CRM->>-Smartphone: Return dynamically-generated URL (Pointer)
      Smartphone->>+WebServer: Request personalized URL
      WebServer->>-Smartphone: Display tailored support page
  

---

Axis 4: Integration with Emerging Technologies

Derivative 4.1: AI-Optimized Contextual Pointer Resolution

• Enabling Description: This derivative enhances the routing computer with an AI-driven decision engine. When a user scans a product's UPC code (index), the requesting computer also sends a payload of contextual data (e.g., user's location, time, declared dietary preferences from a profile). The routing computer feeds the index and context into a machine learning model. Instead of a static table, the model predicts the user's intent and generates the most relevant pointer. For a user with a gluten allergy scanning a loaf of bread, the pointer may lead to an allergen information page. For another user scanning the same code, it might point to a recipe. This creates a dynamic, personalized user experience.
• Mermaid.js Diagram:

  flowchart TD
      A[Scan UPC (Index)] --> B{Package Index + User Context};
      B --> C[AI Routing Engine];
      C -- ML Model Prediction --> D{Generate Contextual Pointer};
      subgraph "Possible Pointers"
          D1[Recipe Page]
          D2[Allergen Info]
          D3[Promotional Offer]
      end
      D -- "User A" --> D1;
      D -- "User B" --> D2;
      D -- "User C" --> D3;
  

Derivative 4.2: IoT-Enabled Real-Time System Control

• Enabling Description: In a smart factory setting, a technician scans a QR code (index) on a machine. A tablet (requesting computer) sends the machine's ID to an IoT control platform (routing computer). The platform's table resolves the ID to a pointer that is an MQTT topic string or a secure API endpoint for the machine's embedded Programmable Logic Controller (PLC), which acts as the information computer. The tablet then uses this pointer to establish a direct communication channel, subscribing to real-time telemetry data (e.g., factory/machine/123/temp) and enabling the technician to send control commands (e.g., publish a message to factory/machine/123/control) to the machine.
• Mermaid.js Diagram:

  sequenceDiagram
      actor Technician
      participant Tablet
      participant IoT_Platform as Routing Computer
      participant PLC as Information Computer
  
      Technician->>Tablet: Scans machine QR code (Index)
      Tablet->>+IoT_Platform: Request pointer for Index
      IoT_Platform->>-Tablet: Return MQTT Topic (Pointer)
      Tablet->>PLC: Subscribe to MQTT Topic
      PLC-->>Tablet: Stream real-time telemetry
      Technician->>Tablet: Initiate diagnostic command
      Tablet->>PLC: Publish command to MQTT Topic
  

Derivative 4.3: Blockchain-Verified Authenticity and Provenance

• Enabling Description: A luxury item is equipped with a secure NFC chip (data carrier) whose public key is the index. A consumer uses their smartphone (requesting computer) to read the index. The phone sends the index to a blockchain oracle (routing computer). The oracle queries a supply chain blockchain (table) for records associated with that public key. The oracle verifies the item's manufacturing and ownership history and returns a pointer to a web-based blockchain explorer. This explorer page (information computer) displays the immutable, verifiable transaction history of the item, proving its authenticity from the point of origin.
• Mermaid.js Diagram:

  flowchart TD
      A[Tap phone to NFC chip on item] --> B[Phone reads Public Key (Index)];
      B --> C[Blockchain Oracle (Routing Computer)];
      C -- Query Ledger --> D[(Supply Chain Blockchain)];
      D -- Transaction History --> C;
      C -- Return URL (Pointer) --> B;
      B -- Access URL --> E[Blockchain Explorer (Information Computer)];
      E --> F[Display immutable provenance record];
  

---

Axis 5: The "Inverse" or Failure Mode

Derivative 5.1: "Inverse" - On-Demand Physical Index Generation

• Enabling Description: This describes the inverse operation. A user provides a pointer (e.g., a URL to a cloud document) to a web service (routing computer). This service generates a new, unique index (e.g., a short alphanumeric code), stores the association in its database (table), and then commands an output device (e.g., a 2D barcode printer or an engraving laser) to create a physical data carrier modulated with the new index. This physical token can then be applied to an object, effectively creating a durable, real-world link to the digital resource that was initially provided.
• Mermaid.js Diagram:

  flowchart TD
      A[User provides Pointer (URL)] --> B[Routing Service];
      B -- 1. Generate new Index --> C[(Database)];
      B -- 2. Store (Index, Pointer) association --> C;
      B -- 3. Send Index to Output Device --> D[Barcode Printer / Engraver];
      D --> E[Generate Physical Data Carrier];
  

Derivative 5.2: Graceful Degradation with Local Fallback Cache

• Enabling Description: This system is designed for network-denied environments. A requesting computer (e.g., a medic's tablet) is pre-loaded with an encrypted, local table containing a subset of critical information. When the user scans a medical kit's barcode (index), the device first attempts to contact the main server (routing computer). If the connection fails, it enters a limited-functionality mode. It performs a lookup on its local table to find a pointer. This pointer does not lead to a network resource, but to a file (e.g., a PDF of emergency instructions) stored in its own local memory (local information computer). This ensures core functionality is always available, even when the network is not.
• Mermaid.js Diagram:

  stateDiagram-v2
      state "Online Mode" as Online
      state "Offline Mode" as Offline
  
      [*] --> Online: Network available
      Online --> Online: Scan Index -> Query Remote Router
      Online --> Offline: Network connection lost
  
      Offline --> Offline: Scan Index -> Query Local Cache
      Offline --> Online: Network connection restored
  

---

Combination Prior Art Scenarios

1. Combination with GS1 Digital Link Standard: The claimed method is implemented as a component of the open GS1 Digital Link standard. A device reads a GTIN (index) from a product, constructs a URL according to the GS1 URI syntax (e.g., https://id.gs1.org/gtin/0123...), and sends it to a GS1 resolver (routing computer). The resolver, following the open standard, issues an HTTP redirect (pointer) to the brand-owner's specified product information page (information computer).

2. Combination with W3C Verifiable Credentials: The method is applied to the open W3C Verifiable Credentials data model for identity verification. A QR code on an ID card (data carrier) contains a Decentralized Identifier or DID (index). A scanner app (requesting computer) reads the DID, uses an open DID method to find a service endpoint in a DID Document, and queries that endpoint (routing computer) for a credential. The pointer returned is a cryptographically-signed Verifiable Credential (information) which the app can then verify.

3. Combination with MQTT (ISO/IEC 20922): The method is used for device provisioning in an IoT system based on the open MQTT protocol. A gateway (requesting computer) scans a barcode (index) on a new sensor. It uses this index to query a local DNS-SD service (routing computer) to discover the correct MQTT topic string (pointer) for that device. The gateway then uses this pointer to subscribe to the sensor's data stream via an MQTT broker (information computer), establishing communication according to the open standard.