The problem: classification-bounded search produces undefensible landscapes

A patent landscape is only as trustworthy as the search behind it. The Manual of Patent Examining Procedure, 35 U.S.C. 102, and 35 U.S.C. 103 do not limit prior art to a classification bucket. They demand reasonable diligence across the universe of accessible publications, in any language, regardless of how an examiner happened to file a document. Boolean keyword search layered over CPC and IPC filters cannot meet that bar in two ways that matter to a practitioner.

First, recall is hostage to vocabulary. A reference that describes the same mechanism in different words, or that was drafted by a different firm with different house terminology, or that was translated from another language, sits outside the keyword net. The searcher who misses it has no way to know the gap exists.

Second, the search is undefensible. When a freedom-to-operate opinion is challenged, or a validity position is tested in an inter partes review before the Patent Trial and Appeal Board, the search itself becomes evidence. A query string and a result count do not establish reasonable diligence, do not show what was considered and excluded, and do not survive an examiner or an opposing expert asking why a particular reference was not found.

The governed semantic discovery layer disclosed in United States Patent Application 19/647,395 addresses both problems with the same architecture. It is described here as an applied deployment pattern: the technology is the patent's; the patent-landscape application is the use case built on top of it.

What the disclosed technology actually does

This application is rooted in the Semantic Discovery inventive step disclosed in United States Patent Application 19/647,395 (Chapter 10), and draws on sibling inventions in the same portfolio: the governance and admissibility substrate (the model proposes, the substrate decides), the lineage mechanism that records every traversal decision, and the structured-alias addressing scheme. The following capabilities are disclosed in that application and are the load-bearing primitives for patent landscape work. None of them is invented here; every one traces to the specification.

The discovery object is a persistent, typed traversal entity. Per the disclosure, every query that enters the index is instantiated not as a keyword list or a vector but as a discovery object: a memory-resident semantic entity with seven typed fields. An intent field encodes the structured objective (goal type, domain scope, resolution criterion, specificity constraints). A context field encodes situational parameters. A memory field accumulates the partial results and structural observations established by previously admitted steps. A policy field encodes the governance constraints in force. A lineage field records the ordered sequence of admitted transitions. An affect field and a confidence field modulate how the traversal evaluates candidates and whether continued traversal is justified. The object persists across every step, accumulating state rather than being evaluated once and discarded.

Each step is a three-in-one traversal: search, inference, execution. At each anchor boundary the discovery object undergoes three structurally coupled phases. The search step evaluates the object's current state against the anchor's published reachable semantic neighborhood and produces a candidate transition set. The inference step scores and selects among candidates and updates the object's intent, memory, and confidence. The execution step evaluates the selected transition for admissibility under deterministic policy and returns one of three outcomes: admit, reject, or decompose. No transition through the index is possible without completing all three phases. This is the distinction the disclosure draws against multi-hop knowledge-graph traversal, where each hop is a lookup that returns connected entities; here the index actively participates in the reasoning.

Governance is a constituent phase, not a post-filter. The disclosure is explicit that the model proposes and the substrate decides. The execution step evaluates each proposed transition against policy constraints, lineage continuity, entropy bounds, and temporal validity, and records the determination in the lineage field whether the transition is admitted, rejected, or decomposed. The complete governance history, including the transitions that were evaluated and rejected and the reasons for rejection, is preserved.

Relevance is post-PageRank and query-specific. The disclosure replaces link-count relevance with traversal-based relevance: a semantic object is relevant to a query if and only if the three-in-one step admitted every transition on the path from the query's initial state to the object. Relevance is not a precomputed global score; it is an admissibility-verified traversal history, and the same object may be reached by different paths for different queries or not reached at all.

Per-step overhead is bounded. Per the disclosure, the governance cost per step is bounded by the schema complexity of the discovery object and the governance configuration of the current anchor, neither of which grows with traversal length. A traversal of three steps incurs the same per-step governance cost as a traversal of three hundred steps. The article makes no claim about absolute latency, throughput, or any benchmark number, because the specification discloses none.

Alias resolution is navigational. Semantic objects are addressed by structured aliases of the form [email protected]/path, resolved by stepwise traversal of the alias path through the live index rather than by consulting a lookup table. Resolution participates in the same governance framework, so possessing an alias does not confer access that the traversal governance would otherwise deny.

Applying the substrate to a patent corpus

The application framing is the practitioner's, and it is where the value of the disclosure becomes concrete. Mapping a patent corpus onto the disclosed substrate is a faithful, enabling implementation of the technology, not a new mechanism.

Anchors govern semantic regions of the corpus rather than classification codes. An anchor may correspond to a technical-concept cluster, a domain, a jurisdiction's publication set, or an assignee's portfolio, and each anchor publishes a reachable semantic neighborhood describing the territory it covers. Because the neighborhood publication is a description of semantic content rather than an enumeration of documents indexed by CPC, a traversal can move from a region described in one vocabulary to an adjacent region described in another. This is the mechanism by which discovery follows a technical concept across CPC and IPC boundaries, across firm-specific terminology, and across the language and jurisdiction lines that defeat keyword search. The cross-boundary reach is a consequence of semantic-neighborhood traversal, not a separately invented feature.

A landscape query is instantiated as a discovery object whose intent field encodes the actual analytical objective, for example "identify prior art bearing on the novelty of independent claim 1 under 35 U.S.C. 102, restricted to publications before a stated priority date." The temporal scope and the priority-date constraint live in the context field and are enforced at every step by the execution phase through its temporal-validity check, so references outside the date window are rejected as a matter of policy rather than filtered after the fact. The policy field carries jurisdictional scope, confidentiality constraints on the matter, and any work-product boundaries the firm imposes.

As the object traverses, the memory field accumulates the references and structural observations that earlier admitted steps established, and the inference step at each subsequent anchor evaluates new candidates against that accumulated trajectory. This prevents the traversal from looping back over ground already covered and from drifting away from the claim language that defines the inquiry. The confidence field governs whether continued traversal is justified, so a search terminates on a principled signal rather than on an arbitrary result cap.

Why the result is defensible landscape evidence

The lineage field is the feature that turns a search into evidence. Every admitted transition is recorded with its anchor identifier, timestamp, the semantic state mutation applied, and the admissibility determination that permitted it; rejected and decomposed transitions are recorded too, with their reasons. For a patentability opinion this produces a record of what was considered and why each path was followed or abandoned. For a freedom-to-operate clearance it produces a record that the date and jurisdiction constraints were enforced at every step rather than asserted afterward. For a validity challenge before the Patent Trial and Appeal Board it produces an admissibility-verified traversal history that can support a reasonable-diligence position, in a form that an opposing expert can inspect rather than a query string that conveys nothing about coverage.

Because relevance is query-specific and traversal-based, the landscape is reproducible: the same discovery object, run against the same corpus state, walks the same governed path. Because per-step overhead is bounded, a deep landscape that crosses many anchors does not pay a governance penalty that grows with depth. And because governance is a constituent phase, confidentiality and work-product policy are enforced as the traversal runs, which matters when a clearance search touches a competitor's portfolio under privilege.

Embodiments and deployment variations

The disclosed substrate admits several deployment configurations for patent work, and a landscape practice would select among them by matter type.

  • Patentability and novelty mapping. The intent field encodes a single independent claim and its resolution criterion; the traversal accumulates candidate anticipating references and records, in lineage, why each near-miss was admitted or rejected against the claim elements.
  • Freedom-to-operate clearance. The context field fixes a product description and a date and jurisdiction envelope; the execution phase enforces the envelope at every step, and decomposition lets a coarse product-level query break into element-level sub-traversals when a whole-product transition is inadmissible but its components are not.
  • Validity and invalidity search. Multiple discovery objects, each seeded from a different claim or a different prior-art theory, traverse the same corpus; the multi-discovery coordination disclosed in the application lets these traversals proceed without collapsing into a single undifferentiated result set, and each produces its own lineage.
  • Portfolio and white-space mapping. Anchors scoped to assignees or technical clusters let a traversal characterize where a portfolio is dense and where neighboring semantic territory is sparse, using the entropy summary each anchor publishes as a signal of how much undiscovered material a region may hold.
  • Cross-jurisdiction and cross-language reach. Because anchors govern semantic regions rather than national classification schemes, a single traversal can carry a concept across jurisdictional publication sets without a separate translation-and-reclassification step, subject to the policy field's jurisdictional scope.

A skilled implementer building this would map the corpus into anchors with published neighborhoods, instantiate landscape queries as discovery objects with the intent, context, and policy fields populated from the matter, run the three-in-one step at each anchor boundary, and surface the lineage field as the deliverable alongside the reference set. Each of those steps corresponds to a mechanism disclosed in the cited application; the patent-landscape mapping supplies the domain semantics.

What this article does not claim

To keep the disclosure honest, this article asserts no ranking metric, recall percentage, precision figure, latency number, corpus size, or benchmark, because the cited specification discloses none for this use case. It does not claim that the substrate replaces the legal judgment of a patent professional. It claims only that the disclosed mechanisms, applied to a patent corpus as described above, produce cross-classification reach and an auditable search history, and that those two properties are what classification-bounded keyword search structurally cannot deliver.

Disclosure Scope

The technology described in this article, including the discovery object and its typed fields, the three-in-one traversal step of search, inference, and execution, governance as a constituent admit/reject/decompose phase, bounded per-step overhead, navigational alias resolution, and post-PageRank query-specific traversal-based relevance, is disclosed in United States Patent Application 19/647,395. The patent-landscape application, deployment configurations, and analytical workflows described here are an enabling implementation of that disclosed technology applied to prior art search, freedom-to-operate clearance, validity analysis, and portfolio mapping. This article is offered as a dated public disclosure of that application of the cited invention.