US 11222349

The patent details are extracted from the provided text.
The CAFC 2026 dockets search results indicate general information about CAFC case information and PACER, but no specific dockets for patent US11222349 in 2026. I explicitly searched for "CAFC dockets US11222349 2026" and did not find relevant results. The search results mainly link to the main pages for case information and search systems (PACER, UJS Portal). One result mentioned "2026 Dockets" but it was for Oklahoma.gov, not CAFC.

Therefore, I can conclude there's no publicly available CAFC docket information for US11222349 in 2026 based on the provided search.

Here's the summary:

Summary of US Patent 11222349

• Title: Discovering neighborhood clusters and uses therefor
• Assignee: The original assignee was Carnegie Mellon University. As of June 18, 2025, the patent was assigned to the NATIONAL SCIENCE FOUNDATION via a confirmatory license.
• Inventors: Justin Cranshaw, Raz Schwartz, Jason I. Hong, Norman Sadeh-Koniecpol
• Filing Date: July 13, 2020 (Application number US16/927,671)
• Issue Date: January 11, 2022
• Abstract: The patent describes computer-based systems and methods for identifying neighborhood clusters within a geographic region. These clusters feature a diverse mix of venues and are formed using venue check-in data. The criteria for determining the mix of venues can include social similarity between venues, characteristics emblematic of specific neighborhood typologies, or patterns of temporal check-in types, or combinations thereof. The discovered neighborhood clusters are applicable for various commercial and civic purposes.

Plain-Language Overview of Independent Claims:

• Independent Claim 1 (System Claim): This claim describes a computer-based system designed to discover geographic clusters of venues. The system includes a computer database storing venue check-in data from many users across multiple venues in a region. This data can come from mobile check-in apps, point-of-sale transactions, or venue rating/review systems. The system also has one or more processors. These processors are programmed to:

  1. Generate a "check-in intensity vector" for each venue. This vector has elements corresponding to individual venue visitors, with values based on how frequently those visitors checked into that venue over a specified period.
  2. Create a "pairwise venue similarity matrix." This matrix contains similarity scores for every pair of venues. Each score is calculated based on the similarity between the check-in intensity vectors of the two venues in the pair, considering both geographical and social distance. The social distance is determined by whether common users (or groups of users) visit both venues. The similarity score can also be zero if venues are beyond a certain geographical distance or not among each other's closest neighbors.
  3. Identify two or more geographic clusters of venues within the region, utilizing the pairwise venue similarity matrix.

• Independent Claim 13 (Method Claim): This claim outlines a computer-based method for discovering geographic clusters of venues. The method involves:

  1. Storing venue check-in data from multiple venue visitors for multiple venues in a geographic region in a computer database. The check-in data sources are similar to those in Claim 1 (e.g., mobile apps, POS, rating/review systems).
  2. Using one or more processors to generate a check-in intensity vector for each venue, similar to Claim 1, reflecting visitor check-in intensity over time.
  3. Using one or more processors to generate a pairwise venue similarity matrix, similar to Claim 1, where similarity scores between venue pairs are based on both geographical and social distance (common visitors).
  4. Using one or more processors to identify two or more geographic clusters of venues in the region based on the pairwise venue similarity matrix.

• Independent Claim 18 (Computer-Readable Medium Claim): This claim covers a computer-readable medium that stores computer-executable instructions. When these instructions are run by one or more processors, they cause the processors to perform the method described in Claim 13.

Uncertainty Regarding CAFC Dockets:
As of April 26, 2026, searches for US11222349 in CAFC (U.S. Court of Appeals for the Federal Circuit) 2026 dockets did not yield any specific results indicating litigation or other case activity related to this patent. It is possible that such information exists but is not publicly indexed or easily searchable through general queries, or that no such cases have been filed or advanced to the CAFC in 2026.