Building a Social Graph Using Sharing Activity of Users of the Open Web by Identifying Nodes in the Social Graph and Adjusting Weights Associated with Edges
US 9,135,653 Lapsed on the fee recordLapsed Sep 15, 2023 on the fee record · High confidence
20-year base term ends Jun 18, 2032
Second maintenance fee unpaid; grace period ended.
Jun 18, 2012
Sep 15, 2023
Sep 15, 2015
Jun 18, 2032
How we calculated this date
| Step | Input | Date after this step | Confidence |
|---|---|---|---|
| Base term, 20 years from filing | Clock starts Jun 18, 2012, when the earliest non-provisional application in its chain was filed (this one was filed Nov 5, 2014) | Jun 18, 2032 | High confidence |
| Continuity chain | Every parent in the chain resolved | no change | High confidence |
| Patent term adjustment | None on file | no change | High confidence |
| Terminal disclaimer cap | Disclaimer resolved from the filed document (refs US 8,751,621, US 8,892,734, US 9,110,997, US 9,117,240, US 9,317,610) | resolves to Jun 18, 2032, no earlier than this term, so no change | High confidence |
| Patent term extension | None on file | no change | High confidence |
| Fee events | 1 of 3 maintenance fees paid | lapsed Sep 15, 2023 | High confidence |
| Computed term end | The steps above, in order | Sep 15, 2023 | High confidence |
Sources
Google Patents · The patent document at USPTO · Assignment records at USPTO
USPTO account required: This application in Patent Center · USPTO's maintenance fee lookup
Maintenance fee events come from USPTO's own fee records. Its fee lookup asks for the patent number and the application number.
Not on this page: the patent's family, its recorded assignments and its citation count. USPTO's assignment records, linked above, list every recorded assignment.
Every date shows its work: the base term, any term adjustment or extension, any disclaimer cap, and the maintenance fee record, each with a confidence tier. How this record was built
Computed patent terms end on the dates shown. Related patents and pending applications may cover overlapping subject matter.