Microsoft's Aug. 13 application drop opens with three pending independent claims directed to time-partitioned retrieval. The lead record, Temporal GraphRAG (US20260236502A1), does not merely attach documents to a prompt. It groups source text by period, extracts concepts for each period, builds graph communities, summarizes them, and decides which period or community a question concerns before composing an answer. That sequence matters for datasets such as incident logs, project histories, financial disclosures, or research archives, where an answer can be wrong even when every retrieved sentence is individually accurate because the system has mixed different moments in time.

The application was published, not granted, so its claims remain pending. Its abstract describes an incremental architecture for a changing corpus: new text can be processed for a later period without rebuilding the earlier graph. Claim 1 recites the end-to-end method, while claim 9 turns the same idea into a system that creates first-period and subsequent-period summaries. Claim 18 adds an explicit resource-saving limitation: the later graph is extracted without re-extracting the earlier one. The record therefore frames chronology as both an answer-quality problem and a computing-cost problem.

The description relates to providing meaningful information relating to a dataset, especially a dynamic dataset that changes over time. One example can obtain text chunks of the dataset grouped by period and extract concepts from the text chunks by period.— Temporal GraphRAG, US20260236502A1

What the record actually covers

The independent claims divide the work into three layers. First comes ingestion by period and extraction of entities or concepts. Second comes community detection and period summaries. Third comes query routing: a question may concern one period, several periods, or an all-time view, and the system maps that question to the corresponding chunks or summaries. Dependent claim 3 adds semantic ranking and language-model relevance tests, stopping after successive irrelevant judgments. Claims 14 and 18 tie incremental processing to using fewer resources than rebuilding the combined history.

That is a more specific proposition than generic retrieval. A conventional vector search can locate passages that look similar to a query, but similarity alone does not say whether a passage describes the current state, a superseded state, or a transition. The application makes period membership part of the graph and part of query interpretation. It also permits periods to be fixed time windows or triggered when new data arrives. The filing does not disclose benchmark accuracy, latency, production deployment, or a named commercial feature, and publication does not establish that Microsoft practices the claims.

The same Aug. 13 cohort shows a broader effort to organize context before a generative model answers. Retrieval-Augmented Generation for Software Code (US20260236241A1) and Applications of Retrieval-Augmented Generation for Software Code (US20260236231A1) both turn source code into a graph of entities and relationships, then associate model-generated augmentation data with graph nodes. Enriching Language Model Input With Contextual Data (US20260236678A1) supplements model input with corpus data so the model can distinguish general-language meaning from domain-specific concepts. The shared pattern is not a larger model; it is a more structured evidence layer placed in front of the model.

The portfolio context

The code records and Temporal GraphRAG solve different indexing problems. Source code has explicit entities and dependency relationships, while a changing document collection has events, concepts, and chronology. Yet both use graphs to preserve structure that would be flattened by a simple bag of text chunks. The paired code applications also have different CPC placements, one oriented to code processing and one to software development operations. That split cautions against treating the five-record group as one patent family or one finished product.

A fifth application, Automated Generation of Machine Learning Models (US20260236780A1), moves one layer deeper by describing an iterative model-growing process that modifies parent models into child models and selects candidate layers based on learned initialization weights. It is not a retrieval filing, but it reinforces the cohort's systems emphasis: data organization, model inputs, and model construction are treated as separate engineering control points. The five applications were all published on Aug. 13, giving a same-day snapshot rather than proof of when any underlying work began; publication normally trails filing activity.

The prosecution posture limits every scope conclusion. Publication exposes the application and its pending claim set, but examination can amend, reject, divide or allow those claims in a different form. Independent claims deserve separate treatment because each defines its own statutory combination; a system claim does not automatically import limitations from a method claim, and a storage-medium claim can frame the same workflow with materially different language. Dependent claims add limitations only to the claim from which they depend. They are evidence of narrower fallback positions, not requirements of the broadest claim unless expressly incorporated. Classification codes help locate the technical field, but they do not decide novelty, validity or infringement. Nor does the abstract control coverage when its wording differs from the claims. The safest reading is consequently element-by-element: identify the required components or steps, note express thresholds and relationships, and flag the details left open. That discipline is especially important for a newly published application because there is no issued claim to enforce. The record can support a precise statement about what the applicant is seeking and how the claims are organized. It cannot support a conclusion that the applicant owns the whole concept, that a competing product falls within the language, or that the eventual patent—if one issues—will retain today's boundaries.

Taken together, the records point to an AI software stack built around controlled context. The lead application's clearest limitation is temporal partitioning joined to graph communities and query routing. The code filings use graph structure to retain relationships inside repositories, and the contextual-input filing separates domain knowledge from general language knowledge. What the public record cannot answer is whether these approaches share an implementation, whether they are deployed together, or how examiners will treat the pending claims. For now, the evidence supports a filing-direction conclusion, not a product or performance claim.