Abstract: A method comprising receiving, at a first computing system, encrypted identifiers, performing, by the first computing system, a concealing operation on the encrypted identifiers to produce concealed encrypted identifiers, wherein the concealing operation conceals the encrypted identifiers from the first computing system and a second computing system but enables matching between the concealed encrypted identifiers, decrypting, by the second computing system, the concealed encrypted identifiers to produce concealed identifiers, analyzing, by the second computing system using one or more match rules, the concealed identifiers to generate one or more associations between the concealed identifiers, and generating, by the second computing system, one or more universal identifiers based on the one or more associations.

Abstract: A method comprising receiving, at a first computing system, encrypted identifiers, performing, by the first computing system, a concealing operation on the encrypted identifiers to produce concealed encrypted identifiers, wherein the concealing operation conceals the encrypted identifiers from the first computing system and a second computing system but enables matching between the concealed encrypted identifiers, decrypting, by the second computing system, the concealed encrypted identifiers to produce concealed identifiers, analyzing, by the second computing system using one or more match rules, the concealed identifiers to generate one or more associations between the concealed identifiers, and generating, by the second computing system, one or more universal identifiers based on the one or more associations.

Abstract: Systems and methods for detecting a collision when combining a first encrypted data structure and a second encrypted data structure are disclosed. The system can receive the first encrypted data structure representative of a first plurality of registers. Each register in the first plurality of registers can have an encrypted fingerprint value, and an encrypted register identifier value. The system can receive the second encrypted data structure representative of a second plurality of registers. The system can calculate a first sum associated with a first register of the first plurality of registers based on the fingerprint value of the first register. The system can calculate a second sum associated with a second register of the second plurality of registers. The system can determine a validity bit associated with the collision based on a comparison of the first sum and the second sum.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Systems and methods for detecting a collision when combining a first encrypted data structure and a second encrypted data structure are disclosed. The system can receive the first encrypted data structure representative of a first plurality of registers. Each register in the first plurality of registers can have an encrypted fingerprint value, and an encrypted register identifier value. The system can receive the second encrypted data structure representative of a second plurality of registers. The system can calculate a first sum associated with a first register of the first plurality of registers based on the fingerprint value of the first register. The system can calculate a second sum associated with a second register of the second plurality of registers. The system can determine a validity bit associated with the collision based on a comparison of the first sum and the second sum.

Abstract: This disclosure relates to systems and techniques that can be implemented by content platforms to optimize (a) demographic-based digital component distribution used to categorize each user into a particular demographic so as to appropriately target that user for purposes of maximizing the efficacy of digital components shown to that user, and (b) demographic reporting used to report to digital component providers the effectiveness of the digital component.

Abstract: An example method includes: serving content to a plurality of client devices associated with a plurality of tag values; predicting, using a prediction system, a plurality of attributes respectively associated with the plurality of tag values; generating a data sketch descriptive of the plurality of predicted attributes; noising the data sketch, wherein the noised data sketch satisfies a differential privacy criterion; transmitting the noised data sketch to a reference system; and receiving, from the reference system, estimated performance data associated with the predicted attributes, wherein the estimated performance data is based on an evaluation of: reference attribute data associated with one or more of the plurality of tag values and the predicted attributes for the one or more of the plurality of tag values.

Abstract: Systems and methods for fast merging of panelist activity are disclosed. The system can maintain a plurality of panelist identifiers each stored with a respective plurality of offline content events, and identify, from the plurality of panelist identifiers, a subset of panelist identifiers that are stored with a respective offline content event that matches a target offline content event. The system can map each of the subset to a respective plurality of unique identifiers corresponding to virtual devices having virtual device attributes. The system can reduce, for each of the subset, the respective plurality of unique identifiers to a sketch that represents the respective plurality of unique identifiers. The system can combine the sketch of each of the subset of panelist identifiers into an aggregated sketch, and transmit the aggregated sketch to a computing device for analysis with an aggregated sketch representing online content events.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Systems and methods for the meta-estimation of data structures representing identifiers are disclosed. The system maintain one or more data records comprising one or more identifiers and one or more attributes. Using the data records, the system can generate a first data structure, such as a probabilistic data structure, that represents the plurality of data records. The first data structure can have a plurality of registers. The system can identify a subset of the plurality of registers that are equal to a predetermined value, and generate a second data structure that represents the subset of the plurality of registers. The system can then store the second data structure as a meta-estimation of the first, and can utilize the second data structure in further processing operations.

Abstract: The present disclosure is directed to automatically generating estimation reports of an online audience. In particular, the system can include a server having a first dataset with a plurality of dimensions. Additionally, the system can receive, from a client device, a query request to estimate the online audience of the content item. The system can process, using a first machine-learned model, the query request to generate a configuration file associated with the first dataset. Moreover, the system can present, on a user interface of a client device, the configuration file. Furthermore, the system can receive a user input in response to the presentation of the configuration file and retrieve data from the first dataset based on the configuration file and the user input. Subsequently, the system can generate, using the first machine-learned model, the report based on the retrieved data from the first dataset.

Abstract: Systems and methods for fast merging of panelist activity are disclosed. The system can maintain a plurality of panelist identifiers each stored with a respective plurality of offline content events, and identify, from the plurality of panelist identifiers, a subset of panelist identifiers that are stored with a respective offline content event that matches a target offline content event. The system can map each of the subset to a respective plurality of unique identifiers corresponding to virtual devices having virtual device attributes. The system can reduce, for each of the subset, the respective plurality of unique identifiers to a sketch that represents the respective plurality of unique identifiers. The system can combine the sketch of each of the subset of panelist identifiers into an aggregated sketch, and transmit the aggregated sketch to a computing device for analysis with an aggregated sketch representing online content events.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: In one aspect, there is provided a method performed by one or more computers, the method including: obtaining multiple observed frequency histograms that each correspond to a respective observed transmission commitment, where a transmission commitment corresponds to a subset of publishers from a set of publishers; generating a frequency model based on the observed frequency histograms, where the frequency model is a parametric model parameterized by a set of model parameters; receiving a request to predict a frequency histogram for a target transmission commitment corresponding to a target subset of publishers; and in response to receiving the request: generating a predicted frequency histogram for the target transmission commitment using the frequency model, and generating one or more predictions characterizing the target transmission commitment using the predicted frequency histogram.

Abstract: Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, that facilitate resource and space efficient analysis of large scale datasets. Methods include obtaining activity data for objects in a dataset. For each data item in the dataset, a hashed parameter having a binary representation is generated using an identifier for the object. A register is identified from among a set of registers based on the hashed parameter. A determination is made that the hashed parameter for the object contributes to an aggregation amount that specifies a number of occurrences of the object in the dataset. Based on this determination, an aggregation amount stored in the register is updated. Based on aggregation amounts stored in the set of registers, a reporting output is generated that provides an aggregate distribution of the objects in the dataset based on the activity data for the objects.