{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4HOMJ4TATN7FCLNCLYZWURSM3H","short_pith_number":"pith:4HOMJ4TA","schema_version":"1.0","canonical_sha256":"e1dcc4f2609b7e512da25e336a464cd9e54a8774a2c5de40f884430ec9763d30","source":{"kind":"arxiv","id":"1301.3570","version":1},"attestation_state":"computed","paper":{"title":"A Nested HDP for Hierarchical Topic Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chong Wang, David Blei, John Paisley, Michael I. Jordan","submitted_at":"2013-01-16T03:24:43Z","abstract_excerpt":"We develop a nested hierarchical Dirichlet process (nHDP) for hierarchical topic modeling. The nHDP is a generalization of the nested Chinese restaurant process (nCRP) that allows each word to follow its own path to a topic node according to a document-specific distribution on a shared tree. This alleviates the rigid, single-path formulation of the nCRP, allowing a document to more easily express thematic borrowings as a random effect. We demonstrate our algorithm on 1.8 million documents from The New York Times."},"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":"1301.3570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-16T03:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"a38ef239a6ab928754b6cf9b96f8629903bc5bd097afb5c038c4375dac14fb42","abstract_canon_sha256":"813d4a1127f61e744b18eb83526652c31021dde8af38caa92fe6fc435822c0d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:17.439707Z","signature_b64":"pX5Tzt6ir8p16UlHzX4YN9xPe5lYNkiMi/m65F9lR/wCOaI3VAV+wCZmNq2pt/dLtb86QvXfmXfrlMj5kIT3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1dcc4f2609b7e512da25e336a464cd9e54a8774a2c5de40f884430ec9763d30","last_reissued_at":"2026-05-18T03:36:17.439219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:17.439219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nested HDP for Hierarchical Topic Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Chong Wang, David Blei, John Paisley, Michael I. Jordan","submitted_at":"2013-01-16T03:24:43Z","abstract_excerpt":"We develop a nested hierarchical Dirichlet process (nHDP) for hierarchical topic modeling. The nHDP is a generalization of the nested Chinese restaurant process (nCRP) that allows each word to follow its own path to a topic node according to a document-specific distribution on a shared tree. This alleviates the rigid, single-path formulation of the nCRP, allowing a document to more easily express thematic borrowings as a random effect. We demonstrate our algorithm on 1.8 million documents from The New York Times."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3570","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":"1301.3570","created_at":"2026-05-18T03:36:17.439293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3570v1","created_at":"2026-05-18T03:36:17.439293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3570","created_at":"2026-05-18T03:36:17.439293+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HOMJ4TATN7F","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HOMJ4TATN7FCLNC","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HOMJ4TA","created_at":"2026-05-18T12:27:34.582898+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/4HOMJ4TATN7FCLNCLYZWURSM3H","json":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H.json","graph_json":"https://pith.science/api/pith-number/4HOMJ4TATN7FCLNCLYZWURSM3H/graph.json","events_json":"https://pith.science/api/pith-number/4HOMJ4TATN7FCLNCLYZWURSM3H/events.json","paper":"https://pith.science/paper/4HOMJ4TA"},"agent_actions":{"view_html":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H","download_json":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H.json","view_paper":"https://pith.science/paper/4HOMJ4TA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3570&json=true","fetch_graph":"https://pith.science/api/pith-number/4HOMJ4TATN7FCLNCLYZWURSM3H/graph.json","fetch_events":"https://pith.science/api/pith-number/4HOMJ4TATN7FCLNCLYZWURSM3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H/action/storage_attestation","attest_author":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H/action/author_attestation","sign_citation":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H/action/citation_signature","submit_replication":"https://pith.science/pith/4HOMJ4TATN7FCLNCLYZWURSM3H/action/replication_record"}},"created_at":"2026-05-18T03:36:17.439293+00:00","updated_at":"2026-05-18T03:36:17.439293+00:00"}