US 5978772

I'll search for this specific patent number and any related litigation activity.

Let me check specifically for any litigation or CAFC activity involving this patent.

US Patent 5,978,772 — Summary

Caveat on the search scope: I found no authoritative evidence of any CAFC docket, district-court litigation, or USPTO post-grant proceeding involving this patent number. A targeted search of CAFC 2026 dockets for "5978772" / "5,978,772" returned zero results, and there is no litigation-history field on the public record I retrieved. I cannot confirm a "no litigation" conclusion — only that my searches surfaced nothing. Treat the litigation point as unverified. (Note also that Google Patents renders the patent as US5978772A; it is the same document, and I have not altered either identifier.)

Bibliographic data

Date discrepancy to flag: Google Patents gives priority 1996-10-11, filing 1997-10-07, grant 1999-11-02, expiration 2017-10-07. The Unified Patents portal lists slightly shifted values (priority 1996-10-10, application date 1997-10-06, grant 1999-11-01, expiration 2017-10-06). Per your instruction, I prefer the authoritative full text (Google Patents) values above, but the ±1 day variation is unresolved.

Abstract (as issued)

"A merchandise checkout system in which a first scanning device is brought into service at peak times to scan the bar codes of checkout items held by waiting customers in a checkout lane. Each first scanning device is preferably a mobile unit linked with a central computer tuned to a single transceiver frequency associated with each lane so that multiple scanning units may be placed into service simultaneously. Purchase information is transmitted both to a tote display screen for review by a customer and to a temporary holding memory of the computer, linked with the computerized cash register of a lane. A specialized bagging cart is described to assist a clerk during scanning. After the checkout items are totalled, a multi-part queue number-total/subtotal slip including a bar code readable by a second scanning device at a cash register component is generated and presented to the waiting purchaser for later presentation to the cashier. The computer memory is capable of storing multiple files of purchase information associated with each lane. The cashier is thereby freed to only scan the queue number-total/subtotal slip to verify and tender the payments of customers serviced by the first scanning device, thereby increasing throughput. The queue number-total/subtotal is retrieved from the customer before payment, whereupon the customer is presented with an enlarged, organized receipt."

Independent claim in plain language

Claim 1 (the only independent claim) recites a two-stage point-of-sale system with four cooperating pieces:

1. Portable bar-code reading component (first clerk, mobile/roaming location). Must include a first optical scanner; a first alphanumeric display; a first input means built around an alphanumeric keypad with arithmetic functions plus a specific enumerated key set — price-lookup, save (compound key), input-addition, overring-voiding, register-totalling, delete-input, and final-transaction keys; and a first printer that produces a queue slip.

2. A printed, two-part queue slip generated by that printer and given to the customer. It has a first part and a detachable second part. Both parts carry a queue bar code, a queue number, the balance due, and an item count. (This is the feature the patent expressly uses to distinguish the Bravman et al. reference, which it says lacks a two-part queue slip that must be tendered before an itemized receipt is issued.)

3. Cash register component (second clerk, fixed second location). Must include a second scanner that reads both the queue bar code and individual item bar codes; a second printer for the sales receipt; a second alphanumeric display; and a second input means plus a third display for completing itemization, with its own keypad and mandated key set (price-lookup, save command, input-addition, delete-input, final-transaction).

4. Computing means linked by a communications means to both components, containing:

   • a database of item descriptions and prices;
   • a numeric sequence generator that assigns each queue slip a queue number in the sequential order the slips are printed;
   • a temporary holding memory that, upon entry of the save command, defines a checkout file in temporary memory;
   • a microprocessing means with five enumerated functions: (i) retrieve retail information from the database into temporary memory in response to a bar-code detection by either scanner or either input means; (ii) generate the queue bar code from the retail information and the queue number held in the checkout file; (iii) compare each scanned queue number against the numeric sequence to build a "correlating sequence" of queue numbers sequentially presented at the register; (iv) process item-price totals; and
   • a permanent storage memory for a final transaction file.

The technical heart of the claim is the combination of (a) temporally separated scan-then-tender via a stored checkout file, (b) the detachable two-part bar-coded queue slip as the retrieval token, and (c) the sequential-number comparison that flags an out-of-sequence slip (e.g., #00004 presented after #00005) as a potential fraud and suppresses retrieval of its file.

Dependent claims (for context; none is independent)

• 2 – adds a tote display showing item description + price, linked to the computer.
• 3 – tote display clears only after at least two items have been shown for a predetermined number of seconds.
• 4 – tote display is an enlarged screen showing at least four items, persisting until filled and a further item is entered.
• 5 – first scanner includes a magnetic-strip reader for electronic funds transfers.
• 6 – portable housing enclosing scanner, printer, display, and input means.
• 7 – wireless communications: a first transceiver in the reading component and a second in the computer.
• 8 – harness belt worn by the first clerk supporting the transceiver.
• 9 – the computer means is housed inside the cash register component.
• 10 – the final transaction file contains customer information including EFT information and checkout files.

Transcription artifacts (flagged, not corrected)

The claim text as rendered on Google Patents / FreePatentsOnline / SumoBrain contains character-level artifacts — e.g., "alphaaaaanumeric," "arithemetic," "the order iu which," "position in teh numeric sequence," and "a pricw lookup key means." These appear to be OCR/rendering errors in the public reproductions rather than substantive limitations. Per your strict rule, I am not auto-correcting them; if the exact claim language matters for your analysis, the USPTO PatentCenter/Global Dossier copy of US08/946,653 should be treated as controlling.

Prior art cited on the face of the patent (17 references)

Notable ones: US 5,393,965 (Bravman et al., Symbol Technologies) — the principal two-stage-checkout reference the patent distinguishes; US 5,311,969 (Dickover et al., Checkrobot); US 5,179,270 (Taussig et al.); US 4,859,838 (Okiharu); US 5,386,106 (Kumar); US 4,850,009 (Zook et al.); US 5,029,183 (Tymes); US 5,448,046 (Swartz); US 5,424,524 (Ruppert et al.); WO 90/16051 (Raimbault); EP 0199252 (Sato); plus queue-management references such as US 4,675,647 (Salin) and US 5,245,163 (queue monitoring/control). Two references post-dating the priority date but appearing in the "cited" list — US 5,793,861 and US 5,804,807 ("Scan-ahead system for processing merchandise at a checkout register," Symbol Technologies) — are worth noting, since US 5,804,807 was filed 1996-09-12 and is frequently discussed as relevant art in this space.

Associated family / related application

• Provisional US 60/028,464 (filed 1996-10-11) — benefit claimed; no separate publication listed.
• No non-US family members were retrieved (Google Patents lists family size 1, country status US only; Unified Patents likewise lists Parent Company "Individual").

Bottom line

US 5,978,772 is a sole-inventor, individually-owned, now-expired (2017) patent on a two-stage supermarket checkout architecture whose distinguishing limitations are the detachable two-part bar-coded queue slip and the sequential-queue-number anti-fraud comparison in the register's computer. It is best known as an improvement over the Bravman et al. two-stage checkout scheme, expressly because it needs no specialized shopping cart (retrofit-friendly) and requires the queue slip to be surrendered before the itemized receipt is issued. Any assertion about CAFC 2026 activity or litigation would be speculation — my searches returned nothing, and I have no authoritative docket information.

I'll research litigation involving US patent 5978772 using multiple sources.

Let me search additional litigation-specific sources.

Let me try more targeted searches across docket and litigation databases.

Summary finding: No litigation located for US Patent 5978772

I searched for litigation specifically involving US Patent 5,978,772 ("Merchandise checkout system," inventor Jeffrey W. Mold, granted 1999‑11‑02, expired 2017‑10‑07). I found no record of any district court case, ITC investigation, PTAB proceeding, or CAFC appeal involving this patent.

Searches performed

I was not able to complete direct queries against Justia Dockets, RPX Insight/Corp., PlainSite, or the Unified Patents litigation caselist for this specific number before the tool limit was hit, so I cannot claim exhaustive negative coverage of those databases.

Corroborating indicators (why "no litigation" is plausible)

1. Ownership: Google Patents lists the current assignee as "Individual" — i.e., the inventor, Jeffrey W. Mold. There is no recorded assignment to a patent monetization entity (NPE) or corporate acquirer. The overwhelming majority of litigation on ~1990s checkout/POS patents comes from entities that acquired them for assertion.
2. No reissue/continuation family: The record shows "Family Members (0)" and no continuations, divisions, or CIPs — nothing for a litigant to assert alongside it.
3. Expired: Anticipated expiration 2017‑10‑07; legal status "Expired – Lifetime." Any suit would have had to be filed before that date, and none appears.
4. The "Cited By" list is not litigation: The ~102–179 later documents citing the '772 patent (e.g., NCR, IBM, Symbol Technologies, Walmart Apollo filings) are citation references to it as prior art/background, not assertions of it. Unified's patent page confirms the record contains litigation/reference data only in that form.

What I can and cannot state

• I can state: Based on the sources successfully queried, no litigation is known involving US Patent 5,978,772. I found no plaintiff, defendant, jurisdiction, case number, or filing date to report.
• I cannot state with high confidence that no suit was ever filed, because I did not successfully query PACER/Justia Dockets, RPX, or the Unified litigation caselist for this number directly. A definitive negative would require (a) PACER/RECAP docket search for "5,978,772" and "5978772," (b) Westlaw/Lexis or Lex Machina patent case search on the patent number, and (c) the Unified Patents litigation caselist at portal.unifiedpatents.com/litigation.

Caveat on identifiers

Per your strict rule, I did not auto-correct any identifier. Note that a search for "5978772" can surface the visually similar designation "5,978,772" — these are the same number in different formatting, and both are the patent at issue. I excluded all results for other numbers (e.g., the 7172123 result that merely cites Mold's '772 patent in its references list is not litigation and was disregarded).

Bottom line: No known litigation involving US Patent 5,978,772. Recommended next step for a definitive check: PACER/RECAP and Lex Machina searches on the patent number, plus the Unified Patents caselist, since my query attempts against those databases did not complete.

I'll verify the structured data against live sources before reporting.

PTAB / AIA Trial Proceedings — US 5,978,772 ("Merchandise checkout system")

Verification note. The structured "PTAB proceedings on file" block supplied with this prompt (USPTO Open Data Portal, most recent ingest) reports no AIA trial proceedings. I ran independent web searches for IPR/PGR/CBM activity, for Federal Circuit appeals involving Jeffrey W. Mold, and for docket references to the patent number; all returned nothing relevant. I therefore report the canonical list as empty and flag no proceedings beyond it.

---

Proceedings overview

Total proceedings on file: zero — 0 instituted, 0 claims invalidated, 0 claims sustained, 0 settled, 0 institution denials. The bottom line for a defendant is not a hardened patent and not a canceled one: it is an untested patent whose entire term has run out, so the dispositive defensive fact is expiration, not PTAB outcome.

Key date facts (from the authoritative patent text and the ODP/Google record):

• Provisional priority: US 60/028,464, filed 1996-10-11
• Non-provisional filed: 1997-10-07 (US 08/946,653)
• Granted: 1999-11-02
• Google Patents legal status: Expired – Lifetime; anticipated expiration 2017-10-07 (i.e., full 20-year term; no reported term extension and no lapse-for-fee status)
• Current assignee: Individual (Jeffrey W. Mold) — not a defensive aggregator, not an NPE portfolio entity

---

Proceedings (most-impactful first)

None — no AIA trial proceeding has ever been filed against US 5,978,772

• Type: N/A
• Filed: N/A
• Status: No proceeding on file (USPTO ODP, most recent ingest). No IPR, PGR, or CBM petition appears in PTAB records; no Federal Circuit appeal of any PTAB decision exists because there is no decision to appeal.
• Judge panel: None convened.
• Petition grounds: None. For completeness, two of the three AIA vehicle types could not have reached this patent at all in the relevant window:
  • PGR is unavailable — post-grant review applies only to patents subject to the first-inventor-to-file provisions (effective filing date on or after 2013-03-16). This patent's effective filing date is 1996/1997.
  • CBM (AIA § 18) was theoretically available for this kind of pre-2013 business-method patent, but the transitional program sunset on 2020-09-16; a CBM petition is now time-barred regardless of merit.
  • IPR (§ 311) is the only vehicle not categorically foreclosed, but it produces no useful relief here (see defensive value below), and none was filed.
• Institution decision: None.
• Final Written Decision: None. No claim of US 5,978,772 has ever been canceled, confirmed, or construed by the PTAB. All of claims 1–10 are legally untested at the Board — and claims 2, 3, 4, 5, 6, 7, 8, 9 and 10 (the dependent set) are untested in any adversarial forum as far as public records show.
• Settlement / termination: N/A.
• Appeal: None.
• Defensive value: A defendant cannot point to a canceled claim, but does not need to. The patent expired 2017-10-07 and is recorded as "Expired – Lifetime." Combined with 35 U.S.C. § 286's six-year damages lookback, a complaint filed today (2026-09-17) could only reach infringement occurring on or after 2020-09-17 — a window lying entirely after the patent's expiration. There is no recoverable damages period left.

---

Strategic summary

Which claims are canceled vs. sustained vs. untested. None are canceled; none are sustained. Every claim — independent claim 1 and dependents 2–10 — is untested by any AIA trial. That is an unusual posture: most commercially asserted software/business-method patents of this vintage accumulated at least one IPR (often two or three, frequently funded by a defensive aggregator). The absence here is itself the signal, and it points the same direction as the ownership and status data: an individually owned, never-asserted-at-scale patent that ran quietly to full-term expiration in 2017. Nothing about the record suggests a coordinated monetization campaign, and nothing suggests a defensive-aggregator filing chain (no Unified Patents, no RPX, no NCR/Symbol/IBM interest beyond citations).

Estoppel landscape. There is nothing to estop. Because no IPR, PGR, or CBM was ever instituted, no petitioner is subject to § 315(e)(2) or § 325(e)(2) estoppel, and no patent-owner-side estoppel or IPR-driven narrowing exists either. For a defendant, the practical consequence is that the entire prior-art universe remains available — there is no estoppel wall, no "could reasonably have been raised" trap, and no need to build an invalidity case around surviving claims. If invalidity must be pleaded (e.g., for a declaratory-judgment counterclaim or fee-shifting narrative), the § 102/§ 103 art of record is unusually rich: the applicant's own specification identifies US 5,393,965 (Bravman), US 5,311,969 (Dickover), US 5,179,270 (Taussig), US 5,386,106 (Kumar), US 4,850,009 (Zook), US 5,029,183 (Tymes), and US 5,448,046 (Swartz), and the prosecution citation list also carries US 5,804,807 (Symbol, "Scan-ahead system for processing merchandise at a checkout register," priority 1996-09-12, granted 1998-09-08) — a reference whose pre-1996-10-11 effective date makes it facially relevant under pre-AIA § 102(e). I have not independently verified how the examiner treated that reference, so treat it as a lead to pull from the file history rather than a settled conclusion.

Pattern signals. No repeat-petitioner pattern (no petitioners at all). No patent-owner appellate activity (no CAFC appeals). No defensive aggregator in the chain. All three "pattern" indicators are negative — consistent with a patent that was never a litigation target.

---

Recommended next steps

1. Lead with expiration, not invalidity. The patent is recorded Expired – Lifetime with an anticipated expiration of 2017-10-07 (Google Patents; Unified Patents portal record). Demand letters citing it are best answered by noting that (a) the term has run, and (b) § 286 leaves no damages window — any damages period reachable by a complaint filed on or after 2026-09-17 post-dates expiration entirely.
2. Confirm the expiration date against the face of the patent and the fee record before putting it in a letter. Google states 2017-10-07 (20 years from the 1997-10-07 filing date); the Unified portal record renders the same milestone as 2017-10-06 and shows priority 1996-10-10 — off-by-one artifacts (date-shift/time-zone handling) that I could not resolve from the sources available. Use the USPTO Patent Center patent term adjustment and maintenance-fee history, not a third-party aggregator, as the citable source.
3. If a demand letter is actually in hand, the correct response posture is a § 285 / Rule 11 letter rather than a PTAB filing: an expired patent asserted for post-expiration conduct is a strong candidate for exceptional-case treatment. A declaratory judgment of invalidity is technically available (the expired patent creates the requisite "case or controversy" only if there is a concrete assertion), but it is a poor use of budget compared with a well-supported pre-suit warning letter.
4. No PTAB milestones to track. There is no institution deadline, no oral hearing, and no statutory one-year FWD clock running on this patent, because there is no proceeding. To re-verify at any time, search the patent number at the PTAB E2E / PTAB Center (https://ptab.uspto.gov/) and check the Federal Circuit docket and CourtListener for appeals — my searches of both channels returned no hits.

Caveat on the empty list. "No PTAB activity" is a positive finding about AIA trials only. I did not exhaustively search district court dockets, ITC investigations, or state-court actions, and I found no litigation history for assignee Jeffrey W. Mold in my searches. If the client has an actual demand letter, treat the letter itself — not the search results — as the trigger, and pull the litigation history from PACER/DPI before responding.

One drafting flag, unrelated to PTAB: the patented claim text as published contains obvious OCR/typographical corruption — e.g., claim 1 recites "arithemetic," "pricw lookup," "an i put addition," "order iu which," "teh numeric sequence," "alphaaaaanumeric," and "price lookup key means" is misspelled as "pricw." These are artifacts of the text rendering on Google Patents/FPO, not the claim language as granted. Quote claims from the USPTO Patent Center PDF, never from an aggregator page, in any filing.

I'll research the assignment chain for US 5,978,772 across USPTO Assignment Center, Google Patents legal events, and NPE directories.

I hit my tool-call budget before I could query the USPTO Assignment Center directly, so I'll be explicit about the limits of what I verified.

Assignment reconstruction — US 5,978,772 (US5978772A)

Verification status first. I was not able to execute a direct query against the USPTO Patent Assignment Search / Assignment Center (https://assignmentcenter.uspto.gov/ or https://assignment.uspto.gov/patent/index.html) before my tool budget ran out. Every search I ran returned bibliographic, full-text, or citation data — never an assignment/reel-frame hit. So I cannot certify "no assignment records exist"; I can only report that none were surfaced, and that the independent ownership indicators below all point the same way. Treat the "no assignments" conclusion as strongly indicated but unverified against the primary register.

---

Inventors

Basis: Google Patents lists inventor "Jeffrey W. Mold" (singular) for US08/946,653; the fetched full text names exactly one inventor; Unified Patents lists "Mold Jeffrey W" and "Parent Company: Individual." The Chinese aggregator record (Baidu Xueshu) lists 申请(专利权)人 (applicant/patentee) as "MOLD; JEFFREY W." — i.e., the applicant was the inventor personally, not a company.

Unusual-pattern check — and the answer is negative. The classic "all inventors bolted within 12 months → portfolio fire-sale" tell cannot be present here, because there is only one inventor and the application was filed in his own name rather than assigned to an employer. That is the signature of an independently developed, self-funded invention, not a corporate R&D pipeline spinoff. No inventor-departure pattern exists to detect. Employer identity is simply absent from the face of the patent — a Gap I will not fill by guessing.

---

Original assignee

Jeffrey W. Mold, an individual — not a corporation.

• Google Patents: original assignee = "Individual"; current assignee = "Individual."
• Unified Patents portal: Original Assignee "Individual"; Current Assignee "Individual"; Parent Company "Individual"; Family Members (0).
• There is no corporate assignee of record on the issued patent. Unlike most patents in this space (Bravman's US 5,393,965 → Symbol Technologies; Dickover's US 5,311,969 → Checkrobot), the '772 patent was never company-owned on its face.

Did the assignee ship a product embodying the claims? Almost certainly no, based on the record I retrieved. The specification describes a system to be retrofitted into preexisting grocery retail facilities ("The present invention may be applied as a retrofit device and method for use in preexisting shopping facilities") — language consistent with a design/consulting-originated concept rather than a productized SKU. However, I found no evidence either way about whether Mold operated a business, licensed the design, or commercialized it. I will not assert "no product" as a finding — there is no assignment record, SEC filing, or corporate record to support it.

Primary line of business: not determinable. Current status: not determinable (no corporate entity to check for operating/acquired/dissolved/bankruptcy status).

---

Assignment timeline

No recorded assignment was located for this patent. The Google Patents legal-events block, as rendered in the authoritative full text I was given, contains only these events: application filed (1997-10-07), priority to US08/946,653, application granted (1999-11-02), publication of US5978772A (1999-11-02), anticipated expiration (2017-10-07). There is no "Owner name" / "Assignment" event line in the retrieved record — which is notable, because Google Patents does render owner-name-change events when a reassignment has been recorded (its EPO sibling pages display that field).

Consequently:

• No reel/frame entries exist to report. I will not invent them.
• No correspondent of record exists to capture. The whole point of your correspondent-analysis instruction — catching a repeat-player attorney who records transfers for a family of shell LLCs — has no application where there are zero assignment filings. (Prosecution correspondence — the prosecuting attorney on US08/946,653 — would live in the file wrapper under PEDS/PatentCenter, not the assignment register; I did not retrieve it. If the prosecution attorney is the same person who later records an assignment, that would become relevant — but there is no later recording here.)
• This is itself a finding, per your framing: an issued patent with the inventor listed as assignee and no post-issuance transfer means the patent most likely never left the inventor's hands for its entire 20-year term.

One weak, flagged inference: Google Patents classifies the patent as "Expired – Lifetime" (natural end of term) rather than "Expired – Fee Related" (lapsed for non-payment). That classification implies maintenance fees were paid through term, meaning some owner was attentive to the asset until 2017. Unified Patents' "Lifetime Renewal Fees: $0" field does not contradict this but is ambiguous formatting. I flag this as an inference from a status label, not a documented payment record.

---

Timeline diagram

timeline
    title Ownership of US 5978772
    1996 : Provisional filed by sole inventor Mold
    1997 : Non provisional filed in Mold's own name
    1999 : Patent issued to Mold as an individual
         : No assignment recorded at issue
    2017 : Patent reaches end of term 20 years

---

NPE / troll-pattern signals

Preface: with zero recorded assignments, most of these signals are structurally incapable of being "present." I mark them accordingly rather than stretching.

Warning against a false positive: the "Cited By" lists (~102–179 later documents from NCR, IBM, Symbol Technologies, PSC Scanning/Datalogic, Seiko Epson, Walmart Apollo, etc.) are citations to the '772 patent as prior art/background — not ownership records and not assertions of it. It would be an error to read NCR's or Walmart's appearance in that list as an assignee or an NPE. I explicitly exclude them.

Also excluded as non-ownership: the patents.justia.com and FreePatentsOnline hits showing "5978772 | November 2, 1999 | Mold" are reference tables inside other patents. Likewise the retrieved EPO page EP0476026B1 (Raimbault, the WO 90/16051 family) merely cites Mold — EP0476026B1 is not an assignment target and is unrelated in ownership. And per the identifier rule: US5978772A and US 5,978,772 are the same document; I have auto-corrected neither.

---

Verdict

Insufficient data — and specifically, an inventor-retained patent with no recorded chain of title.

Justification: the only ownership record that exists is the original one — Jeffrey W. Mold as an individual, confirmed by three independent sources (Google Patents original/current assignee "Individual"; Unified Patents Origin/Current/Parent "Individual"; Baidu Xueshu listing the applicant as "MOLD; JEFFREY W."). Google Patents' legal-events block for US08/946,653 shows no owner-name-change entry across the patent's full 1997–2017 life. There is therefore no shell-entity transfer, no asserter, no cascading LLC chain, and no defensive aggregator to evaluate — the NPE framework has nothing to bite on. This dovetails with the earlier sections' finding of no known litigation, since an individually-owned, never-assigned patent with no continuation family is an implausible assertion vehicle. Caveat: because I could not complete a direct Assignment Center query, this verdict rests on secondary-source agreement rather than on a primary-register negative, and should be re-run against https://assignmentcenter.uspto.gov/ (search term: 5978772 and assignor Mold) plus a PACER/RECAP check before being treated as final.

Contradiction flagged for the record: the previously generated sections continue to carry the date discrepancy I could not resolve — Google Patents gives priority 1996-10-11, filing 1997-10-07, grant 1999-11-02, expiration 2017-10-07; Unified Patents gives 1996-10-10, 1997-10-06, 1999-11-01, 2017-10-06. That ±1 day gap persists and is unrelated to ownership, but it would matter if you ever need to pin an expiration-to-the-day. Nothing in this assignment analysis resolves it.

Verification links:

• USPTO Assignment Center: https://assignmentcenter.uspto.gov/ (search 5978772)
• USPTO Patent Assignment Search (indexed view): https://assignment.uspto.gov/patent/index.html
• Google Patents record: https://patents.google.com/patent/US5978772A/en
• Unified Patents record: https://portal.unifiedpatents.com/patents/patent/US-5978772-A

I'll verify the key references against live sources before building the §102 analysis. Let me start with the most claim-critical references.

Good grounding on the two Symbol references. Let me verify the remaining claim-critical references.

Now the queue-sequence references and remaining claim-relevant art.

Prior-Art Analysis for US Patent 5,978,772

Note on scope and verification. The authoritative source I worked from is the full text of application US08/946,653 as published (Google Patents mirror of the USPTO record for US5978772A). I verified four of the claim-critical references against live sources (US5,804,807; US5,393,965; US5,311,969; US5,179,270; and US5,245,163). I hit the tool step limit before I could pull independent USPTO pages for the remaining twelve, so for those I relied on the citation list and the applicant's own discussion in the specification. That distinction is marked in the "verified" column below. Per my standing rule, no patent number or identifier has been auto-corrected; where the applicant's prose and the citation list render the same number differently, I say so rather than normalizing.

One framing correction that governs everything below. All ten claims stand or fall with claim 1. Claims 2–10 are dependent and therefore incorporate every limitation of claim 1. Under §102 a single reference must disclose all limitations arranged as in the claim; a reference that shows only some elements does not anticipate, it merely becomes §103 material. So the honest short answer to "which claim(s) does each reference potentially anticipate" is: no reference listed on the face of US5,978,772 anticipates claim 1, and therefore none anticipates any of claims 2–10 as issued. What the references do provide is element-by-element §103 fodder, and one of them (US5,804,807) is close enough to warrant real attention. I've mapped each reference accordingly.

---

Reference-by-reference

Group A — Two-stage / pre-scan checkout systems (the real anticipation candidates)

A1. US 5,393,965 A — "Flexible merchandise checkout and inventory management system"
Bravman et al.; Symbol Technologies, Inc. Priority 1990‑11‑13; Appl. No. 923,766 filed 1992‑08‑03; issued 1995‑02‑28. (Verified.)
Discloses an auxiliary checkout station using a portable two‑dimensional bar‑code scanner/data terminal during peak traffic, "permitting two or more checkers to empty a shopping cart at once," with separable modules for scanning purchased items and for receiving customer payments, plus EFT processing of tendered checks and an inventory‑replenishment scheme.
§102 mapping: Discloses the fundamental two‑stage architecture of claim 1 (a portable scanning component at one location + a payment station at another, linked to a checkout computer), and its card/EFT handling touches the subject matter of claim 5. It does not disclose (i) a printed queue slip having a first part and a detachable second part with an item count on both; (ii) a numeric sequence generator assigning queue numbers by print order; or (iii) the sequential‑comparison "correlating sequence" rejection function. The applicant expressly distinguishes Bravman on exactly these points (specification: Bravman "fails to include a two‑part queue slip system wherein the queue slip must be tendered for acceptance of payment"). Verdict: does not anticipate claim 1; it is the primary §103 reference and the reference the applicant self‑identified as closest.

A2. US 5,804,807 A — "Scan-ahead system for processing merchandise at a checkout register"
Murrah et al. (Lanzaro listed); Symbol Technologies, Inc. Filed 1996‑09‑12; issued 1998‑09‑08. (Verified in detail.)
Roving attendant with a portable terminal (integrated bar‑code scanner 51, printer 55, magnetic card reader 56, display 57, keypad 58, RF transmitter 53) pre‑processes the queue; a customer data file is created and updated in a central processor; the customer gets a printed transaction identifier ticket (high‑density bar code such as PDF417, or an address/pointer code); the register reads the ticket to retrieve the file, and payment is taken at the register. Claim 19 expressly recites printing the receipt on the portable terminal; claim 14 recites reading a two‑dimensional receipt at the register.
§102 mapping and the §102(e) issue: Because its filing date (1996‑09‑12) precedes the '772 priority date (1996‑10‑11), this is pre‑AIA §102(e) art despite issuing after the '772 filing. It discloses more of claim 1 than any other reference: the portable reading component with display/keypad/printer (claim 1 element (a)); the magnetic‑strip reader (claim 5); RF communication between terminal and computer (claim 7); and a stored customer data file retrieved at the register via a scanned identifier (claim 1's temporary‑holding‑memory/retrieval concept). It does not disclose the detachable two‑part queue slip bearing item count on both parts, nor the numeric sequence generator + sequential "correlating sequence" comparison. Verdict: does not anticipate claim 1; it is the single most dangerous piece of art in the set — the strongest single‑reference §103 challenge, and a genuine §102(e) reference for claims 5 and 7 standing alone (though those claims still import claim 1).

A3. US 5,311,969 A — "Article checkout system with enhanced throughput"
Dickover et al.; Checkrobot, Inc. Priority 1992‑03‑17; issued 1994‑05‑17. (Verified.)
Lane configuration with a first checkout module (first UPC scanner + conveyor + first bagging area), a second module as an adjacent lane, and a single cashier station between the lanes for receiving payment only, the scanners being used by customers who self‑scan in parallel lanes.
§102 mapping: Touches the two‑stage/single‑payment‑station concept and the parallel‑throughput objective, but there is no portable first scanning device operated by a clerk, no printed two‑part queue slip, and no sequence comparison. The applicant criticizes it for "reliance on the skill and honor system of scanning by a customer." Verdict: no anticipation; §103 background only.

A4. US 5,497,853 A — "Labor-saving consolidated checkout system"
NCR Corporation. Priority 1992‑06‑15; issued 1996‑03‑12.
(Not independently verified — tool limit; characterized from the face citation and title.) Appears directed at consolidating checkout functions to reduce labor. I cannot state its disclosure with confidence, so I do not assert any claim mapping beyond noting it is examiner‑cited architecture art. Verdict: cannot substantiate an anticipation position; treat as §103 background pending full‑text review.

A5. US 5,424,524 A — "Personal scanner/computer for displaying shopping lists and scanning barcodes to aid shoppers"
Ruppert, Jonathan P. Priority 1993‑06‑24; issued 1995‑06‑13.
Personal shopper‑operated scanner storing expenditures, later downloaded to the store computer. The applicant notes it "fails to teach its use in combination with a queue ticket for speeding the throughput when an existing line of customers is already present." Verdict: no anticipation of claim 1.

A6. WO 90/16051 A1 — "Process and device for registering and checking items"
Pierre Raimbault. Priority 1989‑06‑14; published 1990‑12‑27.
(Verified only as to bibliographic data.) An item registration/checking process. The applicant argues it lacks the queue‑ticket combination. Verdict: no anticipation of claim 1.

Group B — Portable bar‑code terminals / RF scanners (claim 1 component art)

B1. US 5,386,106 A — "Integrated portable device for point of sale transactions"
Kumar; Khyber Technologies Corporation. Priority 1991‑09‑27; issued 1995‑01‑31.
Hand‑held bar‑code gun with visual display, numeric keypad + feature buttons, magnetic card swipe, receipt printer, wireless link to a register. The applicant concedes the Kumar device "furnishes all functions necessary to facilitate a complete point of sale credit card transaction" but "fails to teach the use of the gun for increasing throughput in the manner described … nor in combination with … a queue ticket having a bar‑code for scanning and retrieval of the pre‑scanned merchandise."
§102 mapping: Directly relevant to the portable component limitations of claim 1 (scanner, display, keypad, printer) and to claim 5 (magnetic strip). Verdict: no anticipation of claim 1 (no two‑stage method, no queue slip, no sequence); high‑value §103 art for the claim‑1 portable sub‑combination and claims 5/6.

B2. US 5,448,046 A — "Arrangement for and method of expediting commercial product transactions at a point‑of‑sale site"
Swartz et al.; Symbol Technologies, Inc. Priority 1987‑12‑28; issued 1995‑09‑05.
Field‑portable optical reader on a belt/shoulder strap communicating with a host computer (which may be a cash register) to supply retail price information used to update inventory labelling. §102 mapping: portable reader + host computer + worn harness → relates to claim 1's portable component and to claim 8 (harness). Verdict: no anticipation of claim 1; §103 art for claims 1/8.

B3. US 4,850,009 A — "Portable handheld terminal including optical bar code reader and electromagnetic transceiver means…"
Clinicom Incorporated. Priority 1986‑05‑12; issued 1989‑07‑18.
Portable terminal with optical bar‑code reader and transceiver for interactive wireless communication with a base station. §102 mapping: wireless portable scanning component → claim 1/7. Verdict: no anticipation; §103 art for claim 7.

B4. US 5,029,183 A — "Packet data communication network"
Tymes; Symbol Technologies, Inc. Priority 1989‑06‑29; issued 1991‑07‑02.
RF packet network for portable readers communicating with a remote computer. §102 mapping: communications means between portable reader and host (claim 1, claim 7). Verdict: no anticipation; §103 art.

B5. US 5,272,324 A — "Portable scanner system with transceiver for two‑way radio frequency communication"
Interlink Technologies, Inc. Priority 1990‑08‑10; issued 1993‑12‑21.
Portable scanner with two‑way RF transceiver. §102 mapping: same as B4. Verdict: no anticipation; §103 art for claim 7.

B6. US 5,179,270 A — "Scanner system interface"
Spectra‑Physics, Inc. Priority 1989‑05‑08; issued 1993‑01‑12. (Verified as to title/abstract.)
An optical checkout scanner with an internal interface (interface microprocessor, memory, driver circuit) letting the scanner communicate directly with a cash‑register system such as the IBM 4683.
Flag (contradiction to surface): the applicant's specification describes "U.S. Pat. No. 5,179,270 … to Taussig et al." as "a two‑stage retail checkout system in which a customer's items are first scanned by a specially adapted bar‑code gun … in direct communication with a separate cash register device by means of an improved internal interface." The verified reference is a scanner‑to‑cash‑register interface patent, and the applicant's "two‑stage checkout / bar‑code gun" characterization is not supported by the verified abstract. Note also that the number appears as both "5,179,270" and "5179270A" across the record — the same number, differently rendered, and I have not altered either.
§102 mapping: communication/interface between a scanner and a register → relates to the claim‑1 "communication means" between the two components. Verdict: no anticipation of claim 1; §103 art for the inter‑component communication limitation.

Group C — Queue‑sequencing / sequentially‑numbered ticket art (claim 1's anti‑fraud core)

C1. US 5,245,163 A — "Queue monitoring and/or control system"
Bar‑Yehuda; The Taylor Institute for Industrial Management Science Ltd. Filed 1992‑05‑26 (priority 1991‑05‑28); issued 1993‑09‑14. (Verified.)
A card dispenser dispenses sequentially‑numbered cards, the number being coded as a bar code; a card reader at each clerk position reads the bar code when the customer reaches the clerk; a central data processor with a real‑time clock processes joining and reaching times against permissible queue parameters.
§102 mapping — this is the most on‑point art for the anti‑fraud heart of claim 1. It discloses the combination of (i) a numeric sequence generator producing sequentially numbered, bar‑coded tickets and (ii) reading those bar codes at the service point, which is conceptually the "numeric sequence generator" and much of the queue‑number‑issuing/reading machinery of claim 1. What it does not disclose is anything resembling a merchandise checkout: no item database, no checkout file, no price/total, no two‑part detachable slip, and no merchandise‑specific "reject the out‑of‑sequence slip" comparison tied to a stored purchase file. Verdict: does not anticipate claim 1; it is the strongest §103 reference for the "numeric sequence generator" + "correlating sequence" limitations, and an attacker would combine it with Bravman (A1) or Scan‑ahead (A2).

C2. US 4,675,647 A — "System for determining a queue sequence for serving customers at a plurality of service points"
Rune Salin. Priority 1981‑07‑20; issued 1987‑06‑23.
Determining queue service order across multiple service points. §102 mapping: general queue‑ordering concept; relevant background to claim 1's sequence concept, but no bar‑code ticket, no POS, no checkout file. Verdict: no anticipation; §103 background for the sequence‑ordering idea.

Group D — POS terminal / printer / label art

D1. US 4,859,838 A — "POS terminal device"
Okiharu; Omron Tateisi Electronics Co. Priority 1986‑11‑14; issued 1989‑08‑22.
POS terminal that continues registration processing even if the memory holding the PLU (price‑look‑up) files fails. §102 mapping: touchscreen of the claim‑1 "database" containing item description/price and PLU operation, and robustness of the computing means. No queue slip, no two‑stage scanning, no sequence. Verdict: no anticipation; §103 background for the database/PLU limitation.

D2. EP 0 199 252 A2 — "Thermal label printer"
Kabushiki Kaisha Sato. Priority 1985‑04‑19; published 1986‑10‑29.
The applicant characterizes it as "an optical reader with a printer directed at labelling." §102 mapping: printer + reader combination → at most, background for the claim‑1 first printing means; it is a labelling device, not a queue‑slip printer. Verdict: no anticipation; §103 background at most.

Group E — Transaction processing

E1. US 5,793,861 A — "Transaction processing system and method"
Executone Information Systems, Inc. Filed 1996‑06‑11; issued 1998‑08‑11.
(Not independently verified — tool limit.) Filed before the '772 priority date (1996‑10‑11), so it is likewise pre‑AIA §102(e) candidate art. I cannot describe its disclosure with confidence, so I assert no claim mapping. Verdict: potential §102(e) art to be evaluated; I cannot presently substantiate an anticipation position, and on its title/subject matter it does not appear to reach the two‑part detachable queue slip or the sequential comparison.

---

Summary matrix

---

Conclusions

1. No §102 anticipation of any of claims 1–10. Claim 1's three distinguishing pillars — (a) the detachable two‑part queue slip bearing a queue bar code, queue number, balance due and item count on both parts; (b) the numeric sequence generator assigning queue numbers by print order; and (c) the sequential "correlating sequence" comparison that suppresses retrieval of an out‑of‑sequence checkout file — are not found together in any single listed reference. Because all of claims 2–10 depend from claim 1, they inherit that conclusion.

2. The realistic invalidity theory is §103, and it is a three‑reference combination. The natural attack is Bravman (US 5,393,965) or Scan‑ahead (US 5,804,807) for the two‑stage pre‑scan architecture, Kumar (US 5,386,106) for the portable gun with printer/display/keypad, and Taylor Institute (US 5,245,163) for the sequentially numbered bar‑coded ticket read at the service point. A secondary reference such as Okiharu (US 4,859,838) supplies the PLU database, and any of Tymes/Zook/Interlink (US 5,029,183 / 4,850,009 / 5,272,324) supplies the wireless link.

3. Two references are §102(e) references by date. US 5,804,807 (filed 1996‑09‑12) and US 5,793,861 (filed 1996‑06‑11) both predate the '772 priority date of 1996‑10‑11 yet issued in 1998. US 5,804,807 in particular is the examiner's own citation and the most complete single disclosure in the set — but even it lacks the two‑part detachable slip and the sequence comparison.

4. Consistency flags to carry forward:

   • The applicant's characterization of US 5,179,270 as a "two‑stage retail checkout system … bar‑code gun" is not supported by the verified reference, which is a scanner‑to‑cash‑register interface patent. This is an inconsistency between the specification's prior‑art narrative and the art itself.
   • The ±1‑day date discrepancies noted in the earlier bibliographic section (Google Patents vs. Unified Patents) remain unresolved; I have used the authoritative Google‑Patents/USPTO full‑text dates throughout.
   • I did not independently verify the full text of US 5,497,853, US 5,793,861, or WO 90/16051 before the tool limit was reached, and I have said so rather than inferring their content. Anyone relying on this for a validity opinion should pull those three (plus the full text of US 5,804,807 for the §102(e) analysis) from PatentCenter/Global Dossier for application US08/946,653.
   • The character‑level artifacts in the issued claim text ("alphaaaaanumeric," "arithemetic," "iu which," "teh numeric sequence," "pricw lookup") were noted in the earlier section and, per instruction, were not corrected; they do not change the element mapping above.

I'll ground the analysis in the actual cited references before building the § 103 combinations.

Now let me characterize the remaining key references.

Obviousness Analysis — US 5,978,772 under 35 U.S.C. § 103

Patent: US5978772A, "Merchandise checkout system" (Mold, sole inventor; individual assignee)
Priority date: 1996-10-11 (provisional US 60/028,464) · Filed: 1997-10-07 · Issued: 1999-11-02 · Expired 2017-10-07
Claim set: 10 claims, one independent (claim 1)

---

0. Scope, method, and explicit caveats

Framework applied. Graham v. John Deere Co., 383 U.S. 1 (1966) (scope/content of claim; differences from prior art; level of ordinary skill; secondary considerations), applied through KSR Int'l Co. v. Teleflex Inc., 550 U.S. 398 (2007) (predictable variations, known techniques, design incentives, "obvious to try") and MPEP §§ 2141–2144.04.

Caveats I want on the record before the analysis:

1. No file wrapper. I have the issued text and the face-of-patent citations, not the prosecution history (Office Actions, rejections, examiner's reasons for allowance). I therefore cannot say why claim 1 issued over the references below. Per your rule, nothing here should be read as a legal opinion of validity.
2. Claim-text artifacts. As flagged in the previously generated summary, the public reproductions contain OCR errors ("alphaaaaanumeric," "arithemetic," "the order iu which," "position in teh numeric sequence," "a pricw lookup key means"). My element mapping treats these as the obvious underlying terms, but any literal claim-scope conclusion must be confirmed against the USPTO PatentCenter/Global Dossier copy of US08/946,653.
3. Verification asymmetry. In this session I independently retrieved and read the full text/claims of US 5,804,807 ('807), US 5,393,965 ('965), US 4,675,647 ('647), US 5,245,163 ('163), and US 5,497,853 ('853). I did not independently retrieve US 5,386,106 (Kumar), US 4,850,009 (Zook), US 5,448,046 (Swartz), US 5,179,270 (Taussig), US 5,424,524 (Ruppert), or US 5,272,324 (Interlink) — my search budget was exhausted. For those I rely on (a) the '772 specification's own characterizations and (b) my training knowledge. I flag each such reliance inline. Do not treat those characterizations as independently verified.
4. The date discrepancy already flagged stands. Google Patents: priority 1996-10-11, filing 1997-10-07, grant 1999-11-02. Unified Patents portal: 1996-10-10 / 1997-10-06 / 1999-11-01. For § 103 purposes a ±1 day shift is immaterial unless it changes the § 102(e) status of a reference — and it does not here (see § 5).
5. The cited-by-examiner asterisks are not reliably readable in the rendered Google Patents citation table — every row appears to carry "*". I therefore cannot confirm from this source which of the 17 references were examiner citations versus third-party submissions. This matters (see § 5) and needs the file wrapper.

---

1. Level of ordinary skill in the art (PHSITA)

The person having ordinary skill as of October 1996 would have:

• a bachelor's degree in electrical engineering or computer science (or equivalent), plus 2–4 years of experience designing or integrating retail point-of-sale/checkout terminals; or
• a lesser technical degree with 5+ years of hands-on POS integration experience;

and would be familiar with: handheld laser bar-code scanners and their decoders; RF/wireless data networks linking handheld terminals to host POS systems; price-look-up (PLU) databases; receipt/journal printers; magnetic-stripe readers; and conventional cash-register function keys (PLU, void/overring, subtotal, total/save). This is a systems-integration skill level, and — critically — the '772 specification itself repeatedly describes the constituent hardware as "well known," "conventional," and "as is well known in the prior art."

---

2. The '772 specification's own admissions (usable as prior-art admissions)

Under MPEP § 2129, statements in the specification about what was known are admissions usable in a § 103 challenge. Three matter here:

This is the single most damaging structural fact about the patent: the specification concedes that every hardware element of claim 1 existed, and that the two-stage workflow existed. The only candidates for patentable weight are (i) the two-part detachable queue slip and (ii) the numeric-sequence generator + sequential-presentation comparator.

---

3. Element-by-element mapping of claim 1

Notation: [V] = verified this session; [S] = supported by the '772's own characterization + training knowledge, not independently verified here.

Result: two reference families cover the field of claim 1 almost completely, and the only gaps in the closest single reference ('807) are the two-part detachable slip and the sequential-number comparator — both of which are expressly present in queue-management prior art of the same era.

---

4. The '807 reference deserves separate treatment

US 5,804,807 — "Scan-ahead system for processing merchandise at a checkout register," Symbol Technologies, inventors Murrah & Lanzaro, filed 1996-09-12, issued 1998-09-08 (expired). Verified from FreePatentsOnline, Justia, RPX Insight, patentimages PDF, and Google Patents. Its claim 11 is worth quoting because it is uncomfortably close to '772 claim 1:

"a portable terminal having i) an integrated bar code reader … ii) a communication means … for transmitting the decoded bar coded item identification indicia … over the wireless communication network and for receiving a transaction summary code … and iii) a printer for printing a receipt of said transaction summary code; b) a central data process and storage means … for compiling a customer data file … and for generating the transaction summary code …; c) a point of sale terminal comprising i) data retrieval means … for retrieving the customer data file … and ii) payment processing means for receiving payment from the customer; and d) a securable storage container…"

And its specification expressly teaches the exact workflow of the '772's "itemization function": the roving attendant scans the customer's items, the handheld transmits the record to a central processor, the processor returns an acknowledgment and a file address, the handheld prints a bar-coded ticket, the customer's file is later retrieved by scanning that ticket at the register, and the register attendant adds or deletes items before payment. It also describes bagging the merchandise at scan time, and even bag identification codes for security.

Consequence: for claim 1, the '807-vs-'772 delta is narrow and concrete. Everything else in claim 1 is disclosed or is admitted conventional in the '772's own text.

---

5. Threshold § 102(e) flag before reaching § 103

US 5,804,807 was filed 1996-09-12, which is before the '772's 1996-10-11 provisional priority date. Under pre-AIA § 102(e), a U.S. patent granted on an application filed before the applicant's invention date is prior art as of its filing date. '807 therefore appears to be § 102(e) prior art against the '772 — not merely § 103 art. A same-family Symbol filing, US 5,984,182 (priority listed as 1996-09-11, filed 1998-09-07, granted 1999-11-15, inventors Murrah & Lanzaro), also surfaced and appears to be a continuation/divisional relative of the scan-ahead family. I flag this rather than assert it, because '182's own application date post-dates the '772 priority date and its entitlement to an earlier § 102(e) date would depend on which subject matter it carries over from its parent — a question I cannot resolve without the family papers.

Two further notes:

• '807 appears in the "Citations (17)" table on the '772's Google Patents page together with US 5,793,861 (Executone, priority 1996-06-11) — both post-dating nothing (both pre-date the '772 priority) and both therefore citable. If '807 was an examiner citation, the examiner had it. I cannot confirm that from the rendering (§ 0.5), and I cannot retrieve the reasons for allowance.
• I found no evidence the examiner ever combined '807 with a queue-sequence reference. That is precisely the combination below.

---

6. The obviousness combinations

Combination 1 (primary): '807 + '647 — and optionally '163

References: US 5,804,807 (Symbol scan-ahead) in view of US 4,675,647 (Salin turn-number/queue-sequence system, issued 1987-06-23; verified). Optionally further in view of US 5,245,163 (Bar-Yehuda, Taylor Institute, issued 1993-09-14; verified).

What '807 supplies: elements 1.1–1.5, 1.7–1.12, 1.14–1.16, 1.18, 1.19 — i.e., the entire two-stage checkout architecture, the portable scanner/printer/display/keypad unit, the RF link, the central customer-data file, the printed bar-coded retrieval ticket read at the register, the register-side add/delete, and payment.

What '647 supplies:

• The sequential-number-to-printed-ticket mechanism — the turn-number device 1 with allocating unit 4; computer 6 having read-write memory 6A, ROM 6B, CPU 6C, I/O 6D; and, per the patent's own FIG. 6, a program for the "movement sequence of the turn-numbers." Verified.
• The perforated, separable ticket structure — number slips 21, 21′ on a tape 22, with "a gap formed as a perforation 21A, preferably in the center of the tape 22," plus edge weakened areas 21B "facilitating separation of the tickets 21, 21′ from each other when they are fed out." Verified. This is the structural antecedent for claim 1's "detachable" second part separated by perforations 56.
• The detection/alerting of an anomalous sequence — photocell units 35/36 with an AND gate 37B and alarm signalling "when there is a long delay between indication of the perforation 21A" — i.e., the concept of electronically flagging when a ticket does not arrive at the expected point in the sequence.

What '163 supplies (if needed): sequential numbering combined with bar coding on the very token the customer later hands to the service clerk, read by a clerk-side card reader and processed centrally by a data processor — plus a real-time clock for comparing issuance time against service time. This maps to claim 1.13 and 1.17 with almost embarrassing precision.

Motivation to combine:

1. Same field of endeavor and same problem. Both '807 and '647/'163 address serving a queue of waiting persons efficiently. '807's stated object is "reduce waiting time for customers waiting to purchase selected items in checkout queues"; '647's title is literally "System for determining a queue sequence for serving customers"; '163 is a "queue monitoring and/or control system … so as to minimize the average waiting time." A POS artisan addressing the '772's problem ("lines build up contributing to the waste of the consumer's time") would look to queue-management art as a matter of course.
2. The combination is a use of a known technique for its known purpose. '807 already issues a printed, bar-coded ticket to the queued customer and later reads it at the register. Assigning that ticket a sequential queue number (rather than an arbitrary file address) is applying '647's known sequential-ticket technique to '807's known printed-ticket step. Under KSR, "if a technique has been used to improve one device, and a person of ordinary skill in the art would recognize that it would improve similar devices in the same way, using the technique is obvious."
3. The result is predictable and mechanical. No new physical principle is required: the "save" command already generates a file in '807; appending a counter value from a numeric sequence generator to the record and to the printed bar code is a routine software step, and the comparator is a comparison of two stored integers against a stored sequence.
4. Both references are analogous art — with respect to claim 1 all references are from the same field of endeavor (retail/teller checkout and queue service), so no In re Bigio / field-of-invention problem arises.
5. No teaching away. Neither '647 nor '163 disparages printed sequential tickets or bar-coded queue tokens; both are built on them.

Expected result: claim 1 obvious.

---

Combination 2 (alternative primary, avoids reliance on the post-'772-family Symbol art): '965 + '106 + '647 + '163

References: US 5,393,965 (Bravman et al., Symbol; priority 1990-11-13; issued 1995-02-28) + US 5,386,106 (Kumar, Khyber Technologies; issued 1995-01-31) [S] + US 4,675,647 + US 5,245,163.

Why this works:

• '965 (verified) supplies the two-stage, peak-hour, retrofittable checkout: "a portable … bar code scanner/data terminal as part of an auxiliary checkout station for use during times of peak customer traffic, permitting two or more checkers to empty a shopping cart at once"; "separable modules for scanning purchased items and for receiving customer payments"; FIG. 7 retrofittable lane; FIG. 8A transportable checkout station and payment station; RF transceiver 34/44; host processor 10 with DBMS; printer 33A; EFT orders. That is claim elements 1.1–1.3, 1.5, 1.7–1.9, 1.11, 1.12, 1.14, 1.16, 1.18, 1.19.
• Kumar '106 supplies the handheld unit's claimed complement — visual display, numeric keypad with feature buttons, magnetic-card swipe, printer, wireless communication with a register — precisely claim 1's first-component hardware plus dependent claim 5's magnetic-stripe reader. (Also flagged by the '772's own specification as disclosing exactly this combination — an admission.)
• '647 + '163 supply the sequential queue numbering and the bar-coded sequential queue token, exactly as in Combination 1.

Motivation: '965's own stated object is higher throughput at peak volume through auxiliary scanning; the artisan improving '965's "sales slip with transaction bar code" naturally reaches for the queue-management art to (a) order the queue and (b) detect slips presented out of order. Because '965 already contemplates an auxiliary scanner operated by a different clerk, a bar-coded slip, and a separate payment station, the additional step is incremental.

Important limitation of this combination: the '772's principal argument against '965 is that '965 ties a cart code to the sales slip and thus "requir[es] the specialization of shopping carts," while the '772 "may be applied as a retrofit." This is an advantage argument, not a claim limitation. Claim 1 does not recite the absence of a cart code, does not recite retrofitability, and does not recite "no specialized cart." Under Graham step 2, unclaimed advantages cannot supply patentability. This is the single most likely place the patentee would err.

---

Combination 3 (dependent-claim-only challenge; useful if claim 1 survives)

Even if the two-part slip and comparator were held non-obvious, claims 2–10 fall individually:

---

7. The two genuinely contested limitations, and why they are still obvious

7.1 The "two-part detachable" queue slip

Three independent lines of reasoning defeat this:

(a) Anticipation by, or obviousness over, '647's perforated ticket tape.
'647 discloses a continuous tape of sequentially numbered slips separated by a perforation 21A and edge weakened areas 21B "facilitating separation of the tickets 21, 21′ from each other." Claim 1's "detachable second part" separated from a "first part" by perforations 56 is the same structure at a different granularity. Substituting a customer-retained stub / clerk-surrendered ticket split for '647's slip-to-slip split is a rearrangement of parts with no change in function — MPEP 2144.04(II).

(b) Duplication of parts. By the literal claim language, both parts carry the same four data items (queue bar code, queue number, balance due, item count). A duplicate copy of a ticket, perforated for tearing, is the archetypal obvious duplication of parts (In re Harza), and it produces no new or unexpected function — the second part performs the identical function as the first.

(c) A cross-reference discrepancy the patentee must address — and I flag this as a contradiction with the earlier-generated summary. The previously generated summary states, correctly, that claim 1 requires both parts to carry the bar code, queue number, balance due, and item count. But the specification's description of FIG. 4 does not clearly support that:

"The presentable portion 53 is presented to the second clerk for scanning and includes at least the queue bar code 62, human readable, queue number characters 60 and the balance due 64 … The retainable portion 51 includes at a minimum the human readable queue number 60 and the total price 64."

So the specification places the queue bar code (and, on this text, the item count) on the presentable portion only, and describes the retainable portion as carrying only a human-readable queue number and a total. The claim's requirement that the bar code and item count appear on both parts is therefore not clearly described. This is a § 112(a) written-description problem, and it materially weakens the patentee's ability to argue that the two-part structure is a considered, supported limitation rather than a drafting artifact. A challenger should press this. It also contaminates claim differentiation arguments for claims 2–4.

7.2 The sequential-queue-number anti-fraud comparator

This is the most "inventive-looking" element, and it is still obvious:

• '647's entire raison d'être is determining a queue sequence. Its computer 6 executes a program for the "movement sequence of the turn-numbers" (FIG. 6) and its photocell/AND-gate/alarm circuit signals when a ticket position is not where the sequence says it should be. Reading a scanned number and comparing it to the issued sequence is the disclosed purpose of the reference.
• '163 goes further: bar-coded sequentially numbered tokens, read by clerk-side readers, matched by a central data processor with a real-time clock that records joining time and service time — i.e., a central comparison of a token's number and timestamp against the issued sequence. That is elements 1.13, 1.15 and 1.17, plus the '772's own date 68/time 70 anti-reuse programming (which the '772 never claims).
• Motivation is expressly stated in the art and in the '772 itself. The '772 says the comparison exists "to alert the second clerk that the customer has returned the customer line after an absence" and "to prevent the later reuse of a queue number-total/subtotal slip." Queue-management references ('647, '163) exist to enforce queue order; retail-loss references exist to prevent slip reuse. Combining an ordering/verification function with a retrieval token is the natural, and indeed the only sensible, engineering step once a sequentially numbered token is in place — a predictable use of a known technique to improve a similar device (KSR).
• Implementation is trivial at the PHSITA level. A counter, a stored sequence of prior scans, and an integer comparison. No new hardware. No unexpected result.

---

8. Rebuttal of the likely patentee arguments

---

9. Bottom-line assessment

Overall: this is a patent whose entire hardware and entire workflow were, by the applicant's own admission in the Background, known in the art. The invention reduces to two software/printing refinements — assign sequential queue numbers to retrieval tokens, and make the token a perforated two-part slip — layered onto a pre-existing Symbol scan-ahead system ('807) that already printed a bar-coded retrieval ticket for a queued customer. Queue-management prior art ('647, '163) supplies both refinements for their known purposes. The § 103 case is strong on the printed record.

---

10. What would change this conclusion, and what I could not verify

Material I could not obtain that could move the needle:

1. The prosecution file wrapper of US 08/946,653. If the examiner applied '807 and the applicant traversed it with a specific argument (e.g., a teaching-away or unexpected-results argument), that argument is now the battleground. I have no Office Action text.
2. Independent verification of US 5,386,106 (Kumar), 4,850,009 (Zook), 5,448,046 (Swartz), 5,179,270 (Taussig), 5,424,524 (Ruppert), 5,272,324 (Interlink). My searches for these were cut off by the tool step limit. My statements about them rest on the '772's own characterizations plus training knowledge and are marked [S] throughout. Verification could only strengthen the combinations (each is a hardware element the '772 admits is conventional), but I am flagging the gap rather than papering over it.
3. Whether '807 (and '861) were examiner citations or third-party submissions — the Google Patents citation table's "*" marker appears on every row in the rendered text, so the legend is unusable as rendered.
4. The '807/'182 family relationship. US 5,984,182 (Symbol, priority listed 1996-09-11, filed 1998-09-07) appears related to the scan-ahead family; whether it is a continuation, divisional, or CIP of '807's application, and what subject matter it carries, affects the § 102(e) analysis but not the § 103 conclusion.

What would genuinely defeat the § 103 case: (a) a claim construction that reads "two-part…detachable" narrowly enough to require something structurally distinct in the second part beyond a perforated duplicate — but that construction collides with the claim's own requirement that both parts list the same four data items, and with the specification's contrary FIG. 4 description; or (b) evidence of unexpected results in the sequential-comparator implementation, for which nothing in the specification suggests any.

Caveat on identifiers (applied strictly): I have not auto-corrected any patent number or identifier. "US5978772A" and "US 5,978,772" are the same document in two formats; both are used above only as they appear in the record. "US5804807A"/"US 5,804,807", "US5393965A"/"US 5,393,965", "US4675647A"/"US 4,675,647", "US5245163A"/"US 5,245,163", "US5497853A"/"US 5,497,853", "US5984182"/"US 5,984,182", and "US5793861"/"US 5,793,861" are likewise presented as retrieved and have not been altered.