{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IY5HAP5EWEFZD7EMMURIZMIR4G","short_pith_number":"pith:IY5HAP5E","schema_version":"1.0","canonical_sha256":"463a703fa4b10b91fc8c65228cb111e18bb0f3bea5dff02833e4122344414874","source":{"kind":"arxiv","id":"1605.05798","version":2},"attestation_state":"computed","paper":{"title":"MCMC for Imbalanced Categorical Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaron Smith, David B. Dunson, James E. Johndrow, Natesh Pillai","submitted_at":"2016-05-19T02:45:46Z","abstract_excerpt":"Many modern applications collect highly imbalanced categorical data, with some categories relatively rare. Bayesian hierarchical models combat data sparsity by borrowing information, while also quantifying uncertainty. However, posterior computation presents a fundamental barrier to routine use; a single class of algorithms does not work well in all settings and practitioners waste time trying different types of MCMC approaches. This article was motivated by an application to quantitative advertising in which we encountered extremely poor computational performance for common data augmentation "},"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":"1605.05798","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-05-19T02:45:46Z","cross_cats_sorted":["cs.CC","stat.CO","stat.TH"],"title_canon_sha256":"55df3ebd83b7597ab8ac8ec9e73f810694c0c841b199d1da5ba82f9ff644cbab","abstract_canon_sha256":"00e617c417c521bace32da3275620702d00b2657207b33ba72d05487af24b9c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:46.454260Z","signature_b64":"GQ1lkoPalItRgcX+tD9kBivBFzU1FaN1CNhEYR0v4Ngfu8cfmzbGDNtpE74O5RIiTIPRRYNA8tON7JQCXXK2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"463a703fa4b10b91fc8c65228cb111e18bb0f3bea5dff02833e4122344414874","last_reissued_at":"2026-05-18T00:41:46.453651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:46.453651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MCMC for Imbalanced Categorical Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Aaron Smith, David B. Dunson, James E. Johndrow, Natesh Pillai","submitted_at":"2016-05-19T02:45:46Z","abstract_excerpt":"Many modern applications collect highly imbalanced categorical data, with some categories relatively rare. Bayesian hierarchical models combat data sparsity by borrowing information, while also quantifying uncertainty. However, posterior computation presents a fundamental barrier to routine use; a single class of algorithms does not work well in all settings and practitioners waste time trying different types of MCMC approaches. This article was motivated by an application to quantitative advertising in which we encountered extremely poor computational performance for common data augmentation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05798","kind":"arxiv","version":2},"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":"1605.05798","created_at":"2026-05-18T00:41:46.453737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05798v2","created_at":"2026-05-18T00:41:46.453737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05798","created_at":"2026-05-18T00:41:46.453737+00:00"},{"alias_kind":"pith_short_12","alias_value":"IY5HAP5EWEFZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IY5HAP5EWEFZD7EM","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IY5HAP5E","created_at":"2026-05-18T12:30:22.444734+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/IY5HAP5EWEFZD7EMMURIZMIR4G","json":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G.json","graph_json":"https://pith.science/api/pith-number/IY5HAP5EWEFZD7EMMURIZMIR4G/graph.json","events_json":"https://pith.science/api/pith-number/IY5HAP5EWEFZD7EMMURIZMIR4G/events.json","paper":"https://pith.science/paper/IY5HAP5E"},"agent_actions":{"view_html":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G","download_json":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G.json","view_paper":"https://pith.science/paper/IY5HAP5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05798&json=true","fetch_graph":"https://pith.science/api/pith-number/IY5HAP5EWEFZD7EMMURIZMIR4G/graph.json","fetch_events":"https://pith.science/api/pith-number/IY5HAP5EWEFZD7EMMURIZMIR4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G/action/storage_attestation","attest_author":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G/action/author_attestation","sign_citation":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G/action/citation_signature","submit_replication":"https://pith.science/pith/IY5HAP5EWEFZD7EMMURIZMIR4G/action/replication_record"}},"created_at":"2026-05-18T00:41:46.453737+00:00","updated_at":"2026-05-18T00:41:46.453737+00:00"}