The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Dec. 29, 2020
Filed:
Apr. 29, 2019
Applicant:
People.ai, Inc., San Francisco, CA (US);
Inventors:
Oleg Rogynskyy, Menlo Park, CA (US);
Yurii Brunets, San Francisco, CA (US);
Stefan Hermanek, San Francisco, CA (US);
Yury Markovsky, San Francisco, CA (US);
Assignee:
People.ai, Inc., San Francisco, CA (US);
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/00 (2019.01); G06F 16/335 (2019.01); G06F 16/23 (2019.01); G06Q 10/10 (2012.01); H04L 12/58 (2006.01); G06F 16/901 (2019.01); G06F 11/34 (2006.01); G06F 16/21 (2019.01); G06F 16/22 (2019.01); G06F 16/28 (2019.01); G06F 16/215 (2019.01); G06N 20/00 (2019.01); H04L 29/08 (2006.01); G06F 16/11 (2019.01); G06F 16/9035 (2019.01); G06F 16/178 (2019.01); G06F 16/17 (2019.01); G06Q 10/06 (2012.01); G06F 16/25 (2019.01); G06F 16/27 (2019.01); H04L 12/24 (2006.01); G06N 3/08 (2006.01); G06F 16/903 (2019.01); G06F 16/906 (2019.01); G06F 16/9535 (2019.01); G06F 7/14 (2006.01); H04L 29/12 (2006.01); G06F 16/2457 (2019.01); G06F 16/2458 (2019.01); G06F 16/29 (2019.01); G06F 16/245 (2019.01); H04L 12/26 (2006.01); G06F 16/2455 (2019.01); G06F 11/30 (2006.01); G06F 21/62 (2013.01); G06F 16/26 (2019.01); G06F 16/35 (2019.01); G06N 5/04 (2006.01); G06Q 10/04 (2012.01); G16H 50/20 (2018.01); G06Q 50/22 (2018.01); G06N 7/02 (2006.01); H04M 3/436 (2006.01); G06F 40/205 (2020.01); G06F 40/295 (2020.01); G06F 40/20 (2020.01); H04M 15/00 (2006.01); H04M 3/56 (2006.01);
U.S. Cl.
CPC ...
G06F 16/337 (2019.01); G06F 7/14 (2013.01); G06F 11/3024 (2013.01); G06F 11/3452 (2013.01); G06F 11/3495 (2013.01); G06F 16/122 (2019.01); G06F 16/178 (2019.01); G06F 16/1734 (2019.01); G06F 16/212 (2019.01); G06F 16/215 (2019.01); G06F 16/219 (2019.01); G06F 16/22 (2019.01); G06F 16/221 (2019.01); G06F 16/2228 (2019.01); G06F 16/2264 (2019.01); G06F 16/2272 (2019.01); G06F 16/23 (2019.01); G06F 16/235 (2019.01); G06F 16/2365 (2019.01); G06F 16/2379 (2019.01); G06F 16/2386 (2019.01); G06F 16/245 (2019.01); G06F 16/2457 (2019.01); G06F 16/2477 (2019.01); G06F 16/24558 (2019.01); G06F 16/24564 (2019.01); G06F 16/24575 (2019.01); G06F 16/24578 (2019.01); G06F 16/254 (2019.01); G06F 16/256 (2019.01); G06F 16/26 (2019.01); G06F 16/27 (2019.01); G06F 16/273 (2019.01); G06F 16/28 (2019.01); G06F 16/285 (2019.01); G06F 16/288 (2019.01); G06F 16/289 (2019.01); G06F 16/29 (2019.01); G06F 16/355 (2019.01); G06F 16/901 (2019.01); G06F 16/906 (2019.01); G06F 16/9024 (2019.01); G06F 16/9035 (2019.01); G06F 16/90344 (2019.01); G06F 16/9535 (2019.01); G06F 21/6218 (2013.01); G06F 40/20 (2020.01); G06F 40/205 (2020.01); G06F 40/295 (2020.01); G06N 3/08 (2013.01); G06N 5/04 (2013.01); G06N 7/02 (2013.01); G06N 20/00 (2019.01); G06Q 10/04 (2013.01); G06Q 10/06312 (2013.01); G06Q 10/06393 (2013.01); G06Q 10/06398 (2013.01); G06Q 10/107 (2013.01); G06Q 10/1091 (2013.01); G06Q 10/1095 (2013.01); G06Q 50/22 (2013.01); G16H 50/20 (2018.01); H04L 41/14 (2013.01); H04L 43/026 (2013.01); H04L 43/045 (2013.01); H04L 43/062 (2013.01); H04L 43/065 (2013.01); H04L 43/067 (2013.01); H04L 43/0876 (2013.01); H04L 43/14 (2013.01); H04L 51/046 (2013.01); H04L 51/22 (2013.01); H04L 51/34 (2013.01); H04L 61/15 (2013.01); H04L 67/125 (2013.01); H04L 67/22 (2013.01); H04L 67/30 (2013.01); H04L 67/306 (2013.01); H04M 3/436 (2013.01); H04M 15/755 (2013.01); G06Q 10/10 (2013.01); H04L 61/307 (2013.01); H04M 3/56 (2013.01);
Abstract
The present disclosure relates to a method for generating a group node profile based on member nodes. Member node profiles may be maintained. A subset of member node profiles may be identified. Each member node profile of the subset may correspond to a group entity. A set of member node fields to populate values for a group node profile of the group entity may be identified. A corresponding group node field of the group node profile may be updated in accordance with a group node population policy. A field value of the member node field to the group node field may be added. An entry to a value data structure of the field value of the group node field may be added.