IP Library Granted Patent US 12,229,154
Granted Patent B2
US 12,229,154 · App. 18/330,746 · Granted Feb 18, 2025

Focused probabilistic entity resolution from multiple data sources

Inventors: Andrew Poh (San Francisco, CA); Anshuman Prasad (New York, NY); James Ding (New York, NY); John Holgate (Washington, DC); Ranajay Sen (Palo Alto, CA); Shuo Zheng (New York, NY)
Assignee: Palantir Technologies Inc.
G06F16/24578G06F3/04842G06F16/2455G06F16/335G06F16/93
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,229,154
App. No.
18/330,746
Granted
Feb 18, 2025
Kind
B2
Abstract

Various systems and methods are provided for performing soft entity resolution. A plurality of data objects are retrieved from a plurality of data stores to create aggregated data objects for one or more entities. One or more retrieved data objects may be associated with the same entity, based at least in part upon one or more attribute types and attribute values of the data objects. In response to a determination that the one or more of the retrieved data objects should be associated with the same entity, metadata is generated that associates the data objects with the entity, the metadata being stored separately from the data objects, such that the underlying data objects remain unchanged. In addition, one or more additional attributes may be determined for the entity, based upon the data objects associated with the entity.

Claims (69)

1. A computer-implemented method, comprising:

creating an aggregated data object for an entity, wherein creating the aggregated data object for the entity comprises:

determining a confidence value for an association between one or more of a plurality of data objects and the entity based at least in part upon one or more attribute values associated with the one or more data objects; and

generating metadata associating the one or more data objects with the entity based at least in part on the confidence value, wherein the metadata is stored separately from the one or more data objects; and

in response to receiving one or more events:

calculating a score for the aggregated data object; and

providing an alert associated with the score.

2. The computer-implemented method of claim 1 , wherein calculating the score for the aggregated data object further comprises:

applying a scoring model to the aggregated data object, wherein applying the scoring model further comprises:

extracting a plurality of scoring factors associated with the aggregated data object; and

combining the plurality of scoring factors and a plurality of weights, wherein combining the plurality of scoring factors and the plurality of weights results in the score.

3. The computer-implemented method of claim 2 , further comprising:

receiving training data comprising a plurality of entities and a plurality of events; and

training the scoring model with the training data.

4. The computer-implemented method of claim 1 , wherein calculating the score for the aggregated data object further comprises:

determining that an event corresponds to a certain type of event; and

in response to determining that the event corresponds to the certain type of event, increasing a value of the score to an updated score.

5. The computer-implemented method of claim 1 , wherein calculating the score for the aggregated data object further comprises:

determining that a plurality of events occurred within a period of time; and

in response to determining that a plurality of events occurred within the period of time, increasing a value of the score to an updated score.

6. The computer-implemented method of claim 1 , wherein calculating the score for the aggregated data object further comprises:

extracting a first attribute from the aggregated data object, wherein the first attribute indicates a first geographic location of the entity;

extracting a second attribute from an event, wherein the second attribute indicates a second geographic location of the event;

determining that the first geographic location is within a threshold distance of the second geographic location; and

in response to determining that the first geographic location is within the threshold distance of the second geographic location, increasing a value of the score to an updated score.

7. The computer-implemented method of claim 1 , further comprising:

causing presentation, in a user interface, of (i) a representation of the entity and (ii) the score.

8. The computer-implemented method of claim 7 , further comprising:

causing presentation, in the user interface, of (i) representations for a plurality of entities and (ii) a corresponding score for each entity of the plurality of entities.

9. The computer-implemented method of claim 8 , further comprising:

causing presentation, in the user interface, of a geographic location associated with each entity of the plurality of entities.

10. The computer-implemented method of claim 1 , wherein providing the alert further comprises:

transmitting the alert to a user computing device.

11. A computer system, comprising:

one or more computer readable storage mediums configured to store computer executable instructions; and

one or more computer processors in communication with the one or more computer readable storage mediums and configured to execute the computer executable instructions to cause the computer system to:

create an aggregated data object for an entity, wherein creating the aggregated data object for the entity comprises:

determining a confidence value for an association between one or more of a plurality of data objects and the entity based at least in part upon one or more attribute values associated with the one or more data objects; and

generating metadata associating the one or more data objects with the entity based at least in part on the confidence value, wherein the metadata is stored separately from the one or more data objects; and

in response to receive one or more events:

calculate a score for the aggregated data object; and

provide an alert associated with the score.

12. The computer system of claim 11 , wherein calculating the score for the aggregated data object further comprises:

applying a scoring model to the aggregated data object, wherein applying the scoring model further comprises:

extracting a plurality of scoring factors associated with the aggregated data object; and

combining the plurality of scoring factors and a plurality of weights, wherein combining the plurality of scoring factors and the plurality of weights results in the score.

13. The computer system of claim 12 , wherein the one or more computer processors are configured to execute the computer executable instructions to further cause the computer system to:

receive training data comprising a plurality of entities and a plurality of events; and

train the scoring model with the training data.

14. The computer system of claim 11 , wherein calculating the score for the aggregated data object further comprises:

determining that an event corresponds to a certain type of event; and

in response to determining that the event corresponds to the certain type of event, increasing a value of the score to an updated score.

15. The computer system of claim 11 , wherein calculating the score for the aggregated data object further comprises:

determining that a period of time has passed following an event; and

in response to determining that the period of time has passed following the event, decreasing a value of the score to an updated score.

16. The computer system of claim 15 , wherein decreasing the value of the score further comprises:

decreasing a weight associated with the event.

17. The computer system of claim 11 , wherein calculating the score for the aggregated data object further comprises:

extracting a first attribute from the aggregated data object, wherein the first attribute indicates a first geographic location of the entity;

extracting a second attribute from an event, wherein the second attribute indicates a second geographic location of the event;

determining that the first geographic location is within a threshold distance of the second geographic location; and

in response to determining that the first geographic location is within the threshold distance of the second geographic location, increasing a value of the score to an updated score.

18. The computer system of claim 11 , wherein the one or more computer processors are configured to execute the computer executable instructions to further cause the computer system to:

cause presentation, in a user interface, of (i) a representation of the entity and (ii) the score.

19. The computer system of claim 18 , wherein the one or more computer processors are configured to execute the computer executable instructions to further cause the computer system to:

cause presentation, in the user interface, of (i) representations for a plurality of entities and (ii) a corresponding score for each entity of the plurality of entities.

20. The computer system of claim 18 , wherein the one or more computer processors are configured to execute the computer executable instructions to further cause the computer system to:

re-calculate an updated score for the aggregated data object based at least in part on a second event; and

cause presentation, in the user interface, of the updated score.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 24, 2023
From: POH, ANDREW; PRASAD, ANSHUMAN; DING, JAMES; HOLGATE, JOHN; SEN, RANAJAY; ZHENG, SHUO
To: PALANTIR TECHNOLOGIES INC.
Reel/Frame 064367/0671 →
Continuity (4)
Continuation 17657907 · Apr 4, 2022
Continuation 16562201 · Sep 5, 2019
Continuation 15242335 · Aug 19, 2016
Related Publication 20230367779A1 · Nov 16, 2023
References Cited (190)
US 4899161A · Morin et al. · 1990 [cited by applicant]
US 4958305A · Piazza · 1990 [cited by applicant]
US 5754182A · Kobayashi · 1998 [cited by applicant]
US 5781195A · Marvin · 1998 [cited by applicant]
US 6157747A · Szeliski et al. · 2000 [cited by applicant]
US 6173067B1 · Payton et al. · 2001 [cited by applicant]
US 6178432B1 · Cook et al. · 2001 [cited by applicant]
US 6389289B1 · Voce et al. · 2002 [cited by applicant]
US 6414683B1 · Gueziec · 2002 [cited by applicant]
US 6483509B1 · Rabenhorst · 2002 [cited by applicant]
US 6529900B1 · Patterson et al. · 2003 [cited by applicant]
US 6662103B1 · Skolnick et al. · 2003 [cited by applicant]
US 6757445B1 · Knopp · 2004 [cited by applicant]
US 7375732B2 · Arcas · 2008 [cited by applicant]
US 7457706B2 · Malero et al. · 2008 [cited by applicant]
US 7519470B2 · Brasche et al. · 2009 [cited by applicant]
US 7529195B2 · Gorman · 2009 [cited by applicant]
US 7529734B2 · Dirisala · 2009 [cited by applicant]
US 7539666B2 · Ashworth et al. · 2009 [cited by applicant]
US 7546245B2 · Surpin et al. · 2009 [cited by applicant]
US 7640173B2 · Surpin et al. · 2009 [cited by applicant]
US 7663621B1 · Allen et al. · 2010 [cited by applicant]
US 7716067B2 · Surpin et al. · 2010 [cited by applicant]
US 7791616B2 · Ioup et al. · 2010 [cited by applicant]
US 7872647B2 · Mayer et al. · 2011 [cited by applicant]
US 7945852B1 · Pilskains · 2011 [cited by applicant]
US 8010886B2 · Gusmorino et al. · 2011 [cited by applicant]
US 8019709B2 · Norton et al. · 2011 [cited by applicant]
US 8065080B2 · Koch · 2011 [cited by applicant]
US 8082172B2 · Chao et al. · 2011 [cited by applicant]
US 8085268B2 · Carrino et al. · 2011 [cited by applicant]
US 8325178B1 · Doyle, Jr. · 2012 [cited by applicant]
US 8400448B1 · Doyle, Jr. · 2013 [cited by applicant]
US 8407180B1 · Ramesh et al. · 2013 [cited by applicant]
US 8411046B2 · Kruzeniski et al. · 2013 [cited by applicant]
US 8412234B1 · Gatmir-Motahari et al. · 2013 [cited by applicant]
US 8422825B1 · Neophytou et al. · 2013 [cited by applicant]
US 8508533B2 · Cervelli et al. · 2013 [cited by applicant]
US 8514229B2 · Cervelli et al. · 2013 [cited by applicant]
US 8554840B1 · Milgramm · 2013 [cited by applicant]
US 8564596B2 · Carrino et al. · 2013 [cited by applicant]
US 8676597B2 · Buehler et al. · 2014 [cited by applicant]
US 8707185B2 · Robinson et al. · 2014 [cited by applicant]
US 8756244B2 · Dassa et al. · 2014 [cited by applicant]
US 8768009B1 · Smith · 2014 [cited by applicant]
US 8799812B2 · Parker · 2014 [cited by applicant]
US 8868486B2 · Tamayo · 2014 [cited by applicant]
US 9892020B1 · Ophir et al. · 2018 [cited by applicant]
US 10042524B2 · Bogomolov et al. · 2018 [cited by applicant]
US 10096034B2 · Kass et al. · 2018 [cited by applicant]
US 10198491B1 · Semturs et al. · 2019 [cited by applicant]
US 10423890B1 · Fogarty et al. · 2019 [cited by applicant]
US 10437840B1 · Poh et al. · 2019 [cited by applicant]
US 10585893B2 · Dantressangle et al. · 2020 [cited by applicant]
US 10922354B2 · Circlaeys et al. · 2021 [cited by applicant]
US 10986106B2 · Muddu et al. · 2021 [cited by applicant]
US 11294915B2 · Poh et al. · 2022 [cited by applicant]
US 11709848B2 · Poh et al. · 2023 [cited by applicant]
US 20020003539A1 · Abe · 2002 [cited by applicant]
US 20020130867A1 · Yang et al. · 2002 [cited by applicant]
US 20030052896A1 · Higgins et al. · 2003 [cited by applicant]
US 20030061200A1 · Hubert et al. · 2003 [cited by applicant]
US 20030103049A1 · Kindratenko et al. · 2003 [cited by applicant]
US 20040030492A1 · Fox et al. · 2004 [cited by applicant]
US 20040039498A1 · Ollis et al. · 2004 [cited by applicant]
US 20040098236A1 · Mayer et al. · 2004 [cited by applicant]
US 20040194549A1 · Noel · 2004 [cited by applicant]
US 20040210847A1 · Berson et al. · 2004 [cited by applicant]
US 20050031197A1 · Knopp · 2005 [cited by applicant]
US 20050034062A1 · Bufkin et al. · 2005 [cited by applicant]
US 20050182502A1 · Iyengar · 2005 [cited by applicant]
US 20050267652A1 · Allstadt et al. · 2005 [cited by applicant]
US 20060146050A1 · Yamauchi · 2006 [cited by applicant]
US 20060235831A1 · Adinolfi et al. · 2006 [cited by applicant]
US 20060251307A1 · Florin et al. · 2006 [cited by applicant]
US 20070024620A1 · Muller-Fischer et al. · 2007 [cited by applicant]
US 20070188516A1 · Loup et al. · 2007 [cited by applicant]
US 20070208681A1 · Bucholz · 2007 [cited by applicant]
US 20070258642A1 · Thota · 2007 [cited by applicant]
US 20080010605A1 · Frank · 2008 [cited by applicant]
US 20080016216A1 · Worley et al. · 2008 [cited by applicant]
US 20080082578A1 · Hogue et al. · 2008 [cited by applicant]
US 20080098085A1 · Krane et al. · 2008 [cited by applicant]
US 20080140684A1 · O'Reilly et al. · 2008 [cited by applicant]
US 20080162616A1 · Gross et al. · 2008 [cited by applicant]
US 20080163073A1 · Becker et al. · 2008 [cited by applicant]
US 20080192053A1 · Howell et al. · 2008 [cited by applicant]
US 20080223834A1 · Griffiths et al. · 2008 [cited by applicant]
US 20080228512A1 · Calkins et al. · 2008 [cited by applicant]
US 20080229056A1 · Agarwal et al. · 2008 [cited by applicant]
US 20080255973A1 · El Wade et al. · 2008 [cited by applicant]
US 20080270468A1 · Mao · 2008 [cited by applicant]
US 20080294678A1 · Gorman et al. · 2008 [cited by applicant]
US 20090077081A1 · Sarma et al. · 2009 [cited by applicant]
US 20090089273A1 · Hicks · 2009 [cited by applicant]
US 20090100018A1 · Roberts · 2009 [cited by applicant]
US 20090115786A1 · Shmiasaki et al. · 2009 [cited by applicant]
US 20090158185A1 · Lacevic et al. · 2009 [cited by applicant]
US 20100063961A1 · Guiheneuf et al. · 2010 [cited by applicant]
US 20100076968A1 · Boyns et al. · 2010 [cited by applicant]
US 20100106420A1 · Mattikalli et al. · 2010 [cited by applicant]
US 20110022312A1 · McDonough et al. · 2011 [cited by applicant]
US 20110106781A1 · Pearson · 2011 [cited by applicant]
US 20120105632A1 · Renkis · 2012 [cited by applicant]
US 20120159363A1 · DeBacker et al. · 2012 [cited by applicant]
US 20120206469A1 · Hulubei et al. · 2012 [cited by applicant]
US 20120215791A1 · Malik et al. · 2012 [cited by applicant]
US 20130021445A1 · Cossette-Pacheco et al. · 2013 [cited by applicant]
US 20130024202A1 · Harris et al. · 2013 [cited by applicant]
US 20130076732A1 · Cervelli et al. · 2013 [cited by applicant]
US 20130100134A1 · Cervelli et al. · 2013 [cited by applicant]
US 20130282723A1 · Petersen et al. · 2013 [cited by applicant]
US 20140064112A1 · Das et al. · 2014 [cited by applicant]
US 20140188847A1 · Tang et al. · 2014 [cited by applicant]
US 20140361899A1 · Layson · 2014 [cited by applicant]
US 20150029176A1 · Baxter et al. · 2015 [cited by applicant]
US 20160105334A1 · Boe et al. · 2016 [cited by applicant]
US 20160179806A1 · Mortensen et al. · 2016 [cited by applicant]
US 20160224532A1 · Miller et al. · 2016 [cited by applicant]
US 20160381535A1 · Chen et al. · 2016 [cited by applicant]
US 20170235848A1 · Van Dusen et al. · 2017 [cited by applicant]
US 20180181646A1 · Balasa et al. · 2018 [cited by applicant]
US 20180307391A1 · Bogomolov et al. · 2018 [cited by applicant]
US 20190026495A1 · Cipiere · 2019 [cited by applicant]
US 20190228007A1 · Beard et al. · 2019 [cited by applicant]
DE 102013222023 · 2015 [cited by applicant]
EP 0763201 · 1997 [cited by applicant]
EP 2575107 · 2013 [cited by applicant]
EP 2778913 · 2014 [cited by applicant]
EP 2778983 · 2014 [cited by applicant]
EP 2779082 · 2014 [cited by applicant]
EP 2881868 · 2015 [cited by applicant]
WO WO95032424 · 1995 [cited by applicant]
WO WO2004057268 · 2004 [cited by applicant]
WO WO2005013200 · 2005 [cited by applicant]
WO WO2009123975 · 2009 [cited by applicant]
WO WO2011058507 · 2011 [cited by applicant]
“Andy Turner's GISRUK 2012 Notes” <https://docs.google.com/document/d/1cTmxg7mVx5gd89IqbICYvCEnHA4QAivH414WpyPsqE4/edit?pli=1> printed Sep. 16, 2013 in 15 pages. [cited by applicant]
Barnes et al., “Viewshed Analysis”, GIS-ARC/INFO 2001, <www.evsc.virginia.edu/˜jhp7e/evsc466/student_pres/Rounds.pdf>. [cited by applicant]
Carver et al., “Real-Time Visibility Analysis and Rapid Viewshed Calculation Using a Voxel-Based Modelling Approach,” GISRUK 2012 Conference, Apr. 11-13, Lancaster UK, Apr. 13, 2012, pp. 6. [cited by applicant]
Ghosh, P., “A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations,” Computer Vision, Graphics, and Image Processing, 1990, vol. 49, pp. 1-35. [cited by applicant]
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages. [cited by applicant]
Haralick et al., “Image Analysis Using Mathematical Morphology,” Pattern Analysis and Machine Intelligence, IEEE Transactions, Jul. 1987, vol. PAMI-9, No. 4, pp. 532-550. [cited by applicant]
“HunchLab; Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v414/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages. [cited by applicant]
Ipbucker, C., “Inverse Transformation for Several Pseudo-cylindrical Map Projections Using Jacobian Matrix,” ICCSA 2009, Part 1 LNCS 5592, pp. 553-564. [cited by applicant]
Levine, N., “Crime Mapping and the Crimestat Program,” Geographical Analysis, 2006, vol. 38, pp. 41-56. [cited by applicant]
Mandagere, Nagapramod, “Buffer Operations in GIS,” <http://www-users.cs.umn.edu/˜npramod/enc_pdf.pdf> retrieved Jan. 28, 2010, pp. 7. [cited by applicant]
Murray, C., Oracle Spatial Developer's Guide—6 Coordinate Systems (Spatial Reference Systems), <http://docs.oracle.com/cd/B28359_01/appdev.111/b28400.pdf>, Jun. 2009. [cited by applicant]
Open Street Map, “Amm's Diary: Unconnected ways and other data quality issues,” http://www.openstreetmap.org/user/amm/diary printed Jul. 23, 2012 in 3 pages. [cited by applicant]
Poi Editor, “How To: Create Your Own Points of Interest,” <http://www.poieditor.com/articles/how_to_create your own_points_of_interest/> printed Jul. 22, 2012 in 4 pages. [cited by applicant]
Pozzi et al., “Vegetation and Population Density in Urban and Suburban Areas in the U.S.A.” Third International Symposium of Remote Sensing of Urban Areas. [cited by applicant]
Reddy et al., “Under the hood of GeoVRML 1.0,” SRI International, Proceedings of the fifth symposium on Vurtual Reality Modeling Language (Web3D-VRML), New York, NY, Feb. 2000, pp. 23-28. <http://pdf.aminer.org/000/648/… [cited by applicant]
Reibel et al., “Areal Interpolation of Population Counts Using Pre-classi_ed Land Cover Data,” Population Research and Policy Review, 2007, vol. 26, pp. 619-633. [cited by applicant]
Reibel, M., “Geographic Information Systems and Spatial Data Processing in Demography: a Review,” Population Research and Policy Review, 2007, vol. 26, pp. 601-618. [cited by applicant]
Rizzardi et al., “Interfacing U.S. Census Map Files with Statistical Graphics Software: Application and Use in Epidemiology,” Statistics in Medicine, Oct. 1993, vol. 12, No. 19-20, pp. 1953-1964. [cited by applicant]
Snyder, “Map Projections—A Working Manual,” U.S. Geological Survey Professional paper 1395, United States Government Printing Office, Washington: 1987, pp. 11-21 and 60-70. [cited by applicant]
Sonris, “Using the Area of Interest Tools,” <http:/web.archive.org/web/20061001053327/http://sonris-www.dnr.state.la.us/gis/instruct_files/tutslide12> printed Jan. 3, 2013 in 1 page. [cited by applicant]
Tangelder et al., “Freeform Shape Matching Using Minkowski Operations,” The Netherlands, Jun. 1996, pp. 12. [cited by applicant]
Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): Wirn Vietri 2002, LNCS 2486, pp. 3-20. [cited by applicant]
VB Forums, “Buffer A Polygon,” Internet Citation, <http://www.vbforums.com/showthread.php?198436-Buffer-a-Polygon>, Specifically Thread #1, #5 & #11 retrieved on May 2, 2013, pp. 8. [cited by applicant]
Vivid Solutions, “JTS Topology Suite: Technical Specifications,” <http://www.vividsolutions.com/jts/bin/JTS%20Technical%20Specs.pdf> Version 1.4, 2003, pp. 36. [cited by applicant]
Wikipedia, “Douglas_Peucker-Algorithms,” <http://de.wikipedia.org/w/index.php?title=Douglas-Peucker-Algorithmus&oldid=91846042> printed Jul. 2011, pp. 2. [cited by applicant]
Wikipedia, “Ramer_Douglas_Peucker Algorithm,” <http://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm> printed Jul. 2011, pp. 3. [cited by applicant]
Wongsuphasawat et al., “Visual Analytics for Transportation Incident Data Sets,” Transportation Research Record 2138, 2009, pp. 135-145. [cited by applicant]
Woodbridge, Stephen, “[geos-devel] Polygon simplification,” <http://lists.osgeo.org/pipermail/geos-devel/2011-May/005210.html> dated May 8, 2011, pp. 3. [cited by applicant]
International Search Report and Written Opinion in Application No. PCT/US2009/056703 dated Mar. 15, 2010. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/581,823 dated Apr. 6, 2018. [cited by applicant]
Official Communication for European Application No. 14189347.9 dated Jun. 8, 2018. [cited by applicant]
Official Communication for U.S. Appl. No. 14/672,009 dated Jan. 9, 2018. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 13/948,859 dated Dec. 10, 2014. [cited by applicant]
Official Communication for Australian Patent Application No. 2010227081 dated Mar. 18, 2011. [cited by applicant]
Official Communication for Australian Patent Application No. 2010257305 dated Apr. 12, 2011. [cited by applicant]
Official Communication for Australian Patent Application No. 2010257305 dated Sep. 22, 2011. [cited by applicant]
Official Communication for European Patent Application No. 08839003.4 dated Jun. 12, 2013. [cited by applicant]
Official Communication for European Patent Application No. 08839003.4 dated Aug. 14, 2012. [cited by applicant]
Official Communication for European Patent Application No. 10195798.3 dated May 17, 2011. [cited by applicant]
Official Communication for European Patent Application No. 12186236.1 dated May 17, 2013. [cited by applicant]
Official Communication for European Patent Application No. 14189347.9 dated Oct. 13, 2017. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1319225.7 dated May 2, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 616167 dated Oct. 10, 2013. [cited by applicant]
Official Communication for U.S. Appl. No. 12/840,673 dated Sep. 17, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 12/840,673 dated Jan. 2, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/728,879 dated Mar. 17, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/728,879 dated Jan. 27, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/135,289 dated Oct. 14, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 14/306,147 dated Feb. 19, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/581,823 dated Sep. 1, 2017. [cited by applicant]
Official Communication for U.S. Appl. No. 14/581,823 dated Nov. 2, 2017. [cited by applicant]
Official Communication for U.S. Appl. No. 14/672,009 dated Jul. 14, 2017. [cited by applicant]