Skip to content

Archaic Legal Glossary & Citations

“Letters Patent”14th–20th Century
19th-C Meaning:

Open public letters from a monarch or government (literae patentes) granting monopoly rights.

Modern Engineering Decoded:Issued USPTO utility or design patent publication.
Historical note: Contrasted with 'letters close' (private sealed royal correspondence).
“In testimony whereof”19th Century
19th-C Meaning:

Formal concluding legal formula affirming under oath the execution of the instrument.

Modern Engineering Decoded:Inventor and witness digital/physical signatures.
Historical note: Required two witness attestations in 19th-century USPTO filing procedure.
“Aeroplane”Early 20th Century (Wright era)
19th-C Meaning:

A flat or cambered lifting aerofoil surface supported dynamically by air pressure.

Modern Engineering Decoded:Wing / Airfoil lifting surface (later evolved to mean the entire motorized aircraft).
Historical note: The Wrights used 'aeroplane' to denote the individual fabric-covered wings.
“Undulating Current”19th Century (Bell era)
19th-C Meaning:

An electric current whose magnitude varies continuously and periodically without interruption.

Modern Engineering Decoded:Continuous analog AC or audio-frequency electrical waveform.
Historical note: Bell's central legal weapon against telegraph companies who relied on pulsed DC make-and-break circuits.
“Subdivision of the Electric Light”1870s–1880s (Edison era)
19th-C Meaning:

The problem of operating numerous small domestic lamps off a single electrical generator.

Modern Engineering Decoded:Parallel circuit wiring of high-resistance incandescent electrical loads.
Historical note: Pundits claimed it was physically impossible until Edison increased filament resistance to 100 ohms.
“Optically Anisotropic Solution”1960s (Kwolek era)
19th-C Meaning:

A liquid solution that exhibits direction-dependent refractive indices due to molecular alignment.

Modern Engineering Decoded:Liquid crystalline nematic phase polymer dope.
Historical note: Technicians initially tried to throw out Kwolek's cloudy solution thinking it was contaminated.
“Unitary Body of Semiconductor Material”1950s–1960s (Noyce era)
19th-C Meaning:

A single continuous crystal structure of silicon or germanium.

Modern Engineering Decoded:Monolithic single-crystal silicon die / integrated circuit wafer.
Historical note: Differentiated Noyce's monolithic planar circuit from Jack Kilby's hybrid flying-wire prototype.
“Peculiar and Novel Construction”19th Century
19th-C Meaning:

A distinctive, patentable structural arrangement not found in prior art.

Modern Engineering Decoded:Novel and non-obvious mechanical embodiment under 35 U.S.C. § 103.
Historical note: Standard 19th-century legal terminology establishing novelty.

Museum Broadside & Archival Print Edition

Authentic archival layout formatted for framing, study, and high-resolution printing

Paper:
Theme:
The United States Patent & Trademark Archive

Historical Specification & Engineering Broadside

Curated, Verified & Restored by Classic Patents (classic-patents.com)
METHOD FOR NODE RANKING IN A LINKED DATABASEStochastic Link Transition Eigenvector & Random Surfer Centrality
US 6,285,999Class: G06F 17/30 (Information retrieval; Database structures)
Inventor(s):Lawrence Page
Origin / Location:Stanford, California
Grant & Filing:Filed January 9, 1998 · Granted September 4, 2001

I. Historical Context & Grant Summary

The Foundation of the Modern Internet Search Engine: Larry Page's 1998 patent revolutionized information retrieval by shifting the basis of relevance from simple on-page keyword matching to graph-theoretic link citation analysis. The PageRank algorithm models an idealized random surfer traversing the World Wide Web, calculating the stationary probability distribution of arriving at any given document.

II. Core Mechanism & Scientific Principles

The patent assigns scores to linked documents from the extrinsic structure of their graph. It treats a hyperlink as a directed relation, then recursively weights a destination by the ranks of its backlink pages and by each source page's number of forward links.

Physical Operation:The source uses alpha for the random-jump probability, typically around 0.1 to 0.15, and one minus alpha for normalized forward-link propagation. The resulting transition matrix is iterated from p0 toward a steady-state vector; this page does not substitute the later 0.85 convention for the patent's notation.
Governing Formulation:
Perron-Frobenius Theorem & Stationary Eigenvectors:r(A) = \frac{\alpha}{N} + (1-\alpha)\sum_{i=1}^{n}\frac{r(B_i)}{|B_i|}

III. The Granted Legal Monopoly (Key Claims)

Claim 1 (Independent)Hyperlink citation graph modeling

This foundational method claim scores a linked-document population from the scores of documents pointing to it, then uses those scores to process the documents; it requires establishing linked, linking, and dual-role graph relationships.

Claim 2 (Dependent)Degree-based link weighting

This dependent claim makes each source document's score contribution inversely or directly depend on the number of links associated with that source, adjusting each linking document's score based on that degree-based weighting factor.

Claim 3 (Dependent)Usage probability scaling

This dependent claim permits an access-weighting factor based on an estimation of the probability that a linking document will actually be navigated or accessed by users, adjusting graph contributions accordingly.

IV. Mechanical Organ Breakdown

Hyperlink Citation AggregationTerm: “” →

A destination receives weighted contributions from the documents that link to it.

Damping Factor & Random SurferTerm: “” →

A random-jump term limits concentration in link loops and supports a bounded iterative model.

CLASSIC PATENTS DIGITAL ARCHIVE • PERMANENT EXHIBIT ID: us-6285999-pagerank
classic-patents.com/patents/us-6285999-pagerank
Original USPTO PDF
Classic Patents/US 6,285,999
Internet & Modern Computing (1990–Present)Information Retrieval & Web Algorithms

Google PageRank Algorithm

US 6,285,999

Stochastic Link Transition Eigenvector & Random Surfer Centrality

Inventor(s)Lawrence Page
Grant DateSeptember 4, 2001
Filing DateJanuary 9, 1998
LocationStanford, California
The Foundation of the Modern Internet Search Engine: Larry Page's 1998 patent revolutionized information retrieval by shifting the basis of relevance from simple on-page keyword matching to graph-theoretic link citation analysis. The PageRank algorithm models an idealized random surfer traversing the World Wide Web, calculating the stationary probability distribution of arriving at any given document.
USPTO PDF
Audio Engineering Breakdown~1 min listen

Listen to the narrated mechanical breakdown and civilizational context

Engineering Analysis & Physical Principles

How It Works: Step-by-Step Mechanical & Physical Breakdown

The patent assigns scores to linked documents from the extrinsic structure of their graph. It treats a hyperlink as a directed relation, then recursively weights a destination by the ranks of its backlink pages and by each source page's number of forward links.
The Core Breakthrough Mechanism

The source uses alpha for the random-jump probability, typically around 0.1 to 0.15, and one minus alpha for normalized forward-link propagation. The resulting transition matrix is iterated from p0 toward a steady-state vector; this page does not substitute the later 0.85 convention for the patent's notation.

Interactive Real-Time Physical Simulation

Drag to rotate · Pinch to zoom · Shared controls update the displayed model
INITIALIZING THREE.JS WEBGL SIMULATION...
Markov Chain Stationary Distributions & Link Centrality.
Host-Model Telemetry/Computed Readout
Markov Chain Stationary Distributions & Link Centrality
Max Node Centrality
0.475PR[1]
Random Jump Probability
15.0%α[1]
Random Surfer Transition Probability
∂P_trans / ∂d (host sensitivity)
1 probability / unit
Link-follow probability (1−α)0.85
Energy · network_dynamics
Server Rack Electrical Input
350 W
Markov Transition Matrix Eigenvector Compute
217 W
Processor Heat Sink & Fan Heat Rejection
133 W
Interval ghosts
Damping0.8 d · [0.5, 0.99]
Fidelity / MMS residual
Power-iteration convergence vs Stanford 1998 web
model24 steps
reference25 steps
residual-1 steps
Coupled channels
server power → Markov transition matrix217 W
Dated scenarios

Detailed Component Architecture

1Hyperlink Citation Aggregation
A destination receives weighted contributions from the documents that link to it.

For a source B, its rank is divided by |B|, the number of forward links, before its contribution is added to a destination; alpha/N supplies the random-jump term.

2Damping Factor & Random Surfer
A random-jump term limits concentration in link loops and supports a bounded iterative model.

The patent discusses childless pages, removing them during iteration and adding them back, and normalizing the vector. It does not promise a universal iteration count or claim that every graph is irreducible.

Engineering Principles & Equations

Governing Equations & Engineering Principles

Authored explanation paired with its stated mathematical relation

Stationary Markov Link Transition Eigenvector

Information Retrieval & Web Graph CentralityClaim 1
Mathematical Governing Law
Terms:
Plain English DecoderHover or tap any highlighted phrase
The global is the stationary distribution of a random surfer clicking links with across the and teleporting uniformly across .
r\mathbf{r}
Stationary PageRank Distribution Vector
Probability vector whose i-th component represents the long-term visitation probability of document i
dimensionless

Documents with higher stationary probability possess higher global authority and rank higher in search results.

Physical Principle & Engineering Insight

PageRank converts subjective human hyperlinking choices into an objective mathematical eigenvector, turning link topology into collective intelligence.

Historical Context: The foundational search algorithm that powered Google and revolutionized global information retrieval.

Perron-Frobenius Theorem & Stationary EigenvectorsAuthored Principle 1
Stated relationr(A)=αN+(1−α)∑i=1nr(Bi)∣Bi∣r(A) = \frac{\alpha}{N} + (1-\alpha)\sum_{i=1}^{n}\frac{r(B_i)}{|B_i|}
The source defines alpha as the probability of a random jump, normalizes each backlink contribution by its forward-link count, and interprets the converged vector as a steady-state probability distribution. The implementation exposes the source-bounded recurrence rather than asserting an unproved runtime guarantee.

Interactive Schematic Sheet (Fig. 1)

Diagram of three interconnected documents A, B, and C with directed hyperlinks.

1.00x
US 6,285,999 · FIG. 1
Tap any numbered pin3 Curated Callouts
Callout Pin Inspector

Select Any Numbered Pin

Click pins on the schematic or select from the list below to inspect historical specifications.

Why It Still Matters

The patent’s link-based score became a foundation for Web search and later graph-centrality work. Its enduring lesson is narrower than a claim that it alone built modern search: rank can be computed from a graph’s directed relationships, then combined with text, anchor context, titles, and user-specific starting distributions.

Legal Claims Decoder (29 Numbered Claims)

Compare dense legalistic claims directly with decoded plain-English functional specifications.
Claim #1Independent Master Claim
1/29
Verbatim Historical Legal Text
“A computer implemented method of scoring a plurality of linked documents, comprising: obtaining a plurality of documents, at least some of the documents being linked documents, at least some of the documents being linking documents, and at least some of the documents being both linked documents and linking documents, each of the linked documents being pointed to by a link in one or more of the linking documents; assigning a score to each of the linked documents based on scores of the one or more linking documents and processing the linked documents according to their scores.”
Plain English Engineering Translation
This foundational method claim scores a linked-document population from the scores of documents pointing to it, then uses those scores to process the documents; it requires establishing linked, linking, and dual-role graph relationships.
Key Protected Innovations:
Hyperlink citation graph modelingRecursive backlink propagationDamping factor integration

The Historical Bottleneck

Early search engines indexed web pages solely by keyword density, enabling webmasters to spam results with invisible repeated text.

Why Prior Art Failed

  • •Keyword stuffing
  • •No concept of editorial authority
  • •Manual directory curation could not scale
The Breakthrough Insight
“Academic citation indexing (where citations indicate influence) could be adapted to recursive web hyperlink topologies.”

Patent Wars & Legal Litigations

Vs. Robin Li & RankDex / BaiduInfringement Challenge
Rival Claim & Defense:
Robin Li invented RankDex in 1996 and was granted US Patent No. 5,920,859 in 1999 for hyperlink analysis to score website popularity, claiming earlier priority over Page's 1998 PageRank filing.
Litigation Conflict:
Li's RankDex scored search results by analyzing anchor text and inbound links. Page and Brin's PageRank introduced a mathematical Markov random walk model where the authority of the linking page recursively weighted the target page.
Final Resolution & Judicial Outcome:
The USPTO determined that PageRank's recursive eigenvector probability distribution constituted a distinct, patentable algorithm, granting US 6,285,999 to Stanford University, which exclusively licensed it to Google.
After the Grant
The patent was granted September 4, 2001, and the record identifies Stanford as assignee. Google Patents lists the patent as expired after its term; later family continuations are separate records and are not folded into this edition.
Civilizational Impact
The source-bounded contribution is a scalable way to rank nodes from directed relationships, not a promise that rank equals truth or traffic. That graph perspective influenced Web search and subsequent network-analysis systems.
Further Context
  • The specification acknowledges Sergey Brin, Scott Hassan, Rajeev Motwani, Alan Steremberg, and Terry Winograd for support in reducing the invention to practice.
  • The certificate of correction in the pinned twelve-page PDF replaces the government-support paragraph with a statement referring to contract 9411306 awarded by the National Science Foundation.
Technological Lineage & Descent

The Silicon Microelectronics Revolution

From Punched-Card Tabulators to Multi-Touch Human Interfaces

The digital computation lineage that replaced mechanical gear teeth with point-contact semiconductor switches, monolithic planar circuits, personal computers, and touch glass.

1889Electromechanical Data Storage
US 395,781

Record-Card Statistical Compiler

Conductive mercury cup contacts sensing punched holes in structured card records.

1950Solid-State Transistor Origin
US 2,524,035

Bardeen and Brattain Point-Contact Transistor

Point-contact emitter/collector gold cat-whiskers modulating minority carrier diffusion.

1961Planar Monolithic Circuit
US 2,981,877

Oxide-insulated semiconductor leads

Oxide passivation, photolithographic isolation, and evaporated aluminium leads on silicon.

1964Miniaturized Solid Circuit
US 3,138,743

Jack Kilby Monolithic Integrated Circuit

Semiconductor wafer containing active transistors and passive resistive components.

1970Interactive Spatial Input
US 3,541,541

Two-Wheel Position Indicator

Orthogonal rolling wheels driving potentiometers to translate hand motion to screen cursor.

1979Integrated Microcomputer
US 4,136,359

Wozniak Video Timing and Color Circuit

Shared-RAM timing generator enabling flicker-free color microprocessor video generation.

2001Global Information GraphThis Patent
US 6,285,999

Google PageRank Algorithm

Eigenvector centrality algorithm weighting web document importance by hyperlink graph.

2009Capacitive Gestural Surface
US 7,479,949

Apple iPhone Multi-Touch Heuristics

Mutual capacitance sensor matrix resolving concurrent discrete finger touch trajectories.