{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6MQMPNAC7YAZS5AENKIQGORLNI","short_pith_number":"pith:6MQMPNAC","schema_version":"1.0","canonical_sha256":"f320c7b402fe019974046a91033a2b6a3df1f621be236bf93b9aba84a6cf9fb4","source":{"kind":"arxiv","id":"2008.13537","version":3},"attestation_state":"computed","paper":{"title":"Neural Topic Model via Optimal Transport","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Dinh Phung, He Zhao, Trung Le, Viet Huynh, Wray Buntine","submitted_at":"2020-08-12T06:37:09Z","abstract_excerpt":"Recently, Neural Topic Models (NTMs) inspired by variational autoencoders have obtained increasingly research interest due to their promising results on text analysis. However, it is usually hard for existing NTMs to achieve good document representation and coherent/diverse topics at the same time. Moreover, they often degrade their performance severely on short documents. The requirement of reparameterisation could also comprise their training quality and model flexibility. To address these shortcomings, we present a new neural topic model via the theory of optimal transport (OT). Specificall"},"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":"2008.13537","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2020-08-12T06:37:09Z","cross_cats_sorted":["cs.CL","cs.LG","stat.ML"],"title_canon_sha256":"cb46ea02be91133620644c6575b88f46507ef1834871d4c78f3b8d4693f88bc6","abstract_canon_sha256":"5b6b921d7cba30c6cb9390309d6d3570477a7b070fbd8fa76134e17dc25d1103"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:27.434197Z","signature_b64":"/iuhLxkDmciYuUznmjFzNdXLGKinQuSHYMiU8/Ymglq83ybEgDaHIizl2oJSEk4HEA6QC1XQjmvaR7yokGxlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f320c7b402fe019974046a91033a2b6a3df1f621be236bf93b9aba84a6cf9fb4","last_reissued_at":"2026-07-05T04:27:27.433792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:27.433792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Topic Model via Optimal Transport","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Dinh Phung, He Zhao, Trung Le, Viet Huynh, Wray Buntine","submitted_at":"2020-08-12T06:37:09Z","abstract_excerpt":"Recently, Neural Topic Models (NTMs) inspired by variational autoencoders have obtained increasingly research interest due to their promising results on text analysis. However, it is usually hard for existing NTMs to achieve good document representation and coherent/diverse topics at the same time. Moreover, they often degrade their performance severely on short documents. The requirement of reparameterisation could also comprise their training quality and model flexibility. To address these shortcomings, we present a new neural topic model via the theory of optimal transport (OT). Specificall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.13537","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.13537/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.13537","created_at":"2026-07-05T04:27:27.433850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.13537v3","created_at":"2026-07-05T04:27:27.433850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.13537","created_at":"2026-07-05T04:27:27.433850+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MQMPNAC7YAZ","created_at":"2026-07-05T04:27:27.433850+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MQMPNAC7YAZS5AE","created_at":"2026-07-05T04:27:27.433850+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MQMPNAC","created_at":"2026-07-05T04:27:27.433850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.03174","citing_title":"LLM as Attention-Informed NTM and Topic Modeling as long-input Generation: Interpretability and long-Context Capability","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI","json":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI.json","graph_json":"https://pith.science/api/pith-number/6MQMPNAC7YAZS5AENKIQGORLNI/graph.json","events_json":"https://pith.science/api/pith-number/6MQMPNAC7YAZS5AENKIQGORLNI/events.json","paper":"https://pith.science/paper/6MQMPNAC"},"agent_actions":{"view_html":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI","download_json":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI.json","view_paper":"https://pith.science/paper/6MQMPNAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.13537&json=true","fetch_graph":"https://pith.science/api/pith-number/6MQMPNAC7YAZS5AENKIQGORLNI/graph.json","fetch_events":"https://pith.science/api/pith-number/6MQMPNAC7YAZS5AENKIQGORLNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI/action/storage_attestation","attest_author":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI/action/author_attestation","sign_citation":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI/action/citation_signature","submit_replication":"https://pith.science/pith/6MQMPNAC7YAZS5AENKIQGORLNI/action/replication_record"}},"created_at":"2026-07-05T04:27:27.433850+00:00","updated_at":"2026-07-05T04:27:27.433850+00:00"}