{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:R6SBWRTGHWY22GS7PYELIHHTRP","short_pith_number":"pith:R6SBWRTG","schema_version":"1.0","canonical_sha256":"8fa41b46663db1ad1a5f7e08b41cf38bec2662d5bd8fbfb957044b221ed575d0","source":{"kind":"arxiv","id":"1901.02412","version":1},"attestation_state":"computed","paper":{"title":"Forecasting Granular Audience Size for Online Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Atanu R Sinha, Deepak Pai, Dhruv Singal, Kushal Chawla, Pranav Maneriker, Ritwik Sinha, Yash Shrivastava","submitted_at":"2019-01-08T17:13:51Z","abstract_excerpt":"Orchestration of campaigns for online display advertising requires marketers to forecast audience size at the granularity of specific attributes of web traffic, characterized by the categorical nature of all attributes (e.g. {US, Chrome, Mobile}). With each attribute taking many values, the very large attribute combination set makes estimating audience size for any specific attribute combination challenging. We modify Eclat, a frequent itemset mining (FIM) algorithm, to accommodate categorical variables. For consequent frequent and infrequent itemsets, we then provide forecasts using time seri"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.02412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-01-08T17:13:51Z","cross_cats_sorted":[],"title_canon_sha256":"d4bbc9e17356f9a7eea943efab44941627dbed3746856a8704a21c84fed94f21","abstract_canon_sha256":"9ec84cbe5f15ca980726d9bf845e3fe95308fbf653f6a830cb36c48aac0ee459"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:43.409614Z","signature_b64":"n1rJRIdQqLgtnsui3I87590oW9URvrYxFxQaHCQCIlkeXLvptm6PB5fv+WM/28UMvhdG0d+A91JzFfC72DTsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fa41b46663db1ad1a5f7e08b41cf38bec2662d5bd8fbfb957044b221ed575d0","last_reissued_at":"2026-05-17T23:56:43.409229Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:43.409229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forecasting Granular Audience Size for Online Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Atanu R Sinha, Deepak Pai, Dhruv Singal, Kushal Chawla, Pranav Maneriker, Ritwik Sinha, Yash Shrivastava","submitted_at":"2019-01-08T17:13:51Z","abstract_excerpt":"Orchestration of campaigns for online display advertising requires marketers to forecast audience size at the granularity of specific attributes of web traffic, characterized by the categorical nature of all attributes (e.g. {US, Chrome, Mobile}). With each attribute taking many values, the very large attribute combination set makes estimating audience size for any specific attribute combination challenging. We modify Eclat, a frequent itemset mining (FIM) algorithm, to accommodate categorical variables. For consequent frequent and infrequent itemsets, we then provide forecasts using time seri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02412","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.02412","created_at":"2026-05-17T23:56:43.409285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02412v1","created_at":"2026-05-17T23:56:43.409285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02412","created_at":"2026-05-17T23:56:43.409285+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6SBWRTGHWY2","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6SBWRTGHWY22GS7","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6SBWRTG","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP","json":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP.json","graph_json":"https://pith.science/api/pith-number/R6SBWRTGHWY22GS7PYELIHHTRP/graph.json","events_json":"https://pith.science/api/pith-number/R6SBWRTGHWY22GS7PYELIHHTRP/events.json","paper":"https://pith.science/paper/R6SBWRTG"},"agent_actions":{"view_html":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP","download_json":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP.json","view_paper":"https://pith.science/paper/R6SBWRTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02412&json=true","fetch_graph":"https://pith.science/api/pith-number/R6SBWRTGHWY22GS7PYELIHHTRP/graph.json","fetch_events":"https://pith.science/api/pith-number/R6SBWRTGHWY22GS7PYELIHHTRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP/action/storage_attestation","attest_author":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP/action/author_attestation","sign_citation":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP/action/citation_signature","submit_replication":"https://pith.science/pith/R6SBWRTGHWY22GS7PYELIHHTRP/action/replication_record"}},"created_at":"2026-05-17T23:56:43.409285+00:00","updated_at":"2026-05-17T23:56:43.409285+00:00"}