{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MUDJCPJR7KEOCLS7LQZ3HQET7B","short_pith_number":"pith:MUDJCPJR","schema_version":"1.0","canonical_sha256":"6506913d31fa88e12e5f5c33b3c093f87abed79e212095377cab65736f7ac0b5","source":{"kind":"arxiv","id":"1707.00206","version":1},"attestation_state":"computed","paper":{"title":"Efficient Correlated Topic Modeling with Topic Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric P. Xing, Junxian He, Taylor Berg-Kirkpatrick, Ying Huang, Zhiting Hu","submitted_at":"2017-07-01T21:10:15Z","abstract_excerpt":"Correlated topic modeling has been limited to small model and problem sizes due to their high computational cost and poor scaling. In this paper, we propose a new model which learns compact topic embeddings and captures topic correlations through the closeness between the topic vectors. Our method enables efficient inference in the low-dimensional embedding space, reducing previous cubic or quadratic time complexity to linear w.r.t the topic size. We further speedup variational inference with a fast sampler to exploit sparsity of topic occurrence. Extensive experiments show that our approach i"},"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":"1707.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-01T21:10:15Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"69313876baf657eeb5266ddd5529f6e5a69136330d1f382db67d241bc5d7b67a","abstract_canon_sha256":"ea8383e6681387e6c82bc9e19e8198819fcc4f2c1062f912ebbd18505bf36dc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:04.140120Z","signature_b64":"hIVRHtHMMvECIjapUXIYNYqQ4yKBNNoEL/7zmuke2vErD+lgeBbQnSwby5+KarQMsBq6OVAUi7PoB0bJBGazDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6506913d31fa88e12e5f5c33b3c093f87abed79e212095377cab65736f7ac0b5","last_reissued_at":"2026-05-18T00:41:04.139494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:04.139494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Correlated Topic Modeling with Topic Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric P. Xing, Junxian He, Taylor Berg-Kirkpatrick, Ying Huang, Zhiting Hu","submitted_at":"2017-07-01T21:10:15Z","abstract_excerpt":"Correlated topic modeling has been limited to small model and problem sizes due to their high computational cost and poor scaling. In this paper, we propose a new model which learns compact topic embeddings and captures topic correlations through the closeness between the topic vectors. Our method enables efficient inference in the low-dimensional embedding space, reducing previous cubic or quadratic time complexity to linear w.r.t the topic size. We further speedup variational inference with a fast sampler to exploit sparsity of topic occurrence. Extensive experiments show that our approach i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00206","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":"1707.00206","created_at":"2026-05-18T00:41:04.139592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00206v1","created_at":"2026-05-18T00:41:04.139592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00206","created_at":"2026-05-18T00:41:04.139592+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUDJCPJR7KEO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUDJCPJR7KEOCLS7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUDJCPJR","created_at":"2026-05-18T12:31:31.346846+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/MUDJCPJR7KEOCLS7LQZ3HQET7B","json":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B.json","graph_json":"https://pith.science/api/pith-number/MUDJCPJR7KEOCLS7LQZ3HQET7B/graph.json","events_json":"https://pith.science/api/pith-number/MUDJCPJR7KEOCLS7LQZ3HQET7B/events.json","paper":"https://pith.science/paper/MUDJCPJR"},"agent_actions":{"view_html":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B","download_json":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B.json","view_paper":"https://pith.science/paper/MUDJCPJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00206&json=true","fetch_graph":"https://pith.science/api/pith-number/MUDJCPJR7KEOCLS7LQZ3HQET7B/graph.json","fetch_events":"https://pith.science/api/pith-number/MUDJCPJR7KEOCLS7LQZ3HQET7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B/action/storage_attestation","attest_author":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B/action/author_attestation","sign_citation":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B/action/citation_signature","submit_replication":"https://pith.science/pith/MUDJCPJR7KEOCLS7LQZ3HQET7B/action/replication_record"}},"created_at":"2026-05-18T00:41:04.139592+00:00","updated_at":"2026-05-18T00:41:04.139592+00:00"}