{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3KIMN5OSIX67I5NJKQCKDY6NL6","short_pith_number":"pith:3KIMN5OS","schema_version":"1.0","canonical_sha256":"da90c6f5d245fdf475a95404a1e3cd5fb2ea2e6764c596babc834c9468081d94","source":{"kind":"arxiv","id":"1206.2190","version":1},"attestation_state":"computed","paper":{"title":"Communication-Efficient Parallel Belief Propagation for Latent Dirichlet Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian-feng Yan, Jia Zeng, Yang Gao, Zhi-Qiang Liu","submitted_at":"2012-06-11T13:00:51Z","abstract_excerpt":"This paper presents a novel communication-efficient parallel belief propagation (CE-PBP) algorithm for training latent Dirichlet allocation (LDA). Based on the synchronous belief propagation (BP) algorithm, we first develop a parallel belief propagation (PBP) algorithm on the parallel architecture. Because the extensive communication delay often causes a low efficiency of parallel topic modeling, we further use Zipf's law to reduce the total communication cost in PBP. Extensive experiments on different data sets demonstrate that CE-PBP achieves a higher topic modeling accuracy and reduces more"},"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":"1206.2190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-11T13:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"b4ebc4c25d355d4910aa765bda48fddf6ac978b2f959b519930bd73b6e4ae15d","abstract_canon_sha256":"97cc5df700688cc4181062329562658b0616aece625f93a2362c2745f6b92940"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:53.239028Z","signature_b64":"TU1TnDTGx5/0zMZgfg8X+GdN0a3f3T6fY7nKOI1VCIeblGwwp79zrsiOGTOYR0AuTK08LvG0zAMg2k/Lpe3rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da90c6f5d245fdf475a95404a1e3cd5fb2ea2e6764c596babc834c9468081d94","last_reissued_at":"2026-05-18T03:53:53.238329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:53.238329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Parallel Belief Propagation for Latent Dirichlet Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian-feng Yan, Jia Zeng, Yang Gao, Zhi-Qiang Liu","submitted_at":"2012-06-11T13:00:51Z","abstract_excerpt":"This paper presents a novel communication-efficient parallel belief propagation (CE-PBP) algorithm for training latent Dirichlet allocation (LDA). Based on the synchronous belief propagation (BP) algorithm, we first develop a parallel belief propagation (PBP) algorithm on the parallel architecture. Because the extensive communication delay often causes a low efficiency of parallel topic modeling, we further use Zipf's law to reduce the total communication cost in PBP. Extensive experiments on different data sets demonstrate that CE-PBP achieves a higher topic modeling accuracy and reduces more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2190","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":"1206.2190","created_at":"2026-05-18T03:53:53.238450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.2190v1","created_at":"2026-05-18T03:53:53.238450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2190","created_at":"2026-05-18T03:53:53.238450+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KIMN5OSIX67","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KIMN5OSIX67I5NJ","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KIMN5OS","created_at":"2026-05-18T12:26:50.516681+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/3KIMN5OSIX67I5NJKQCKDY6NL6","json":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6.json","graph_json":"https://pith.science/api/pith-number/3KIMN5OSIX67I5NJKQCKDY6NL6/graph.json","events_json":"https://pith.science/api/pith-number/3KIMN5OSIX67I5NJKQCKDY6NL6/events.json","paper":"https://pith.science/paper/3KIMN5OS"},"agent_actions":{"view_html":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6","download_json":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6.json","view_paper":"https://pith.science/paper/3KIMN5OS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.2190&json=true","fetch_graph":"https://pith.science/api/pith-number/3KIMN5OSIX67I5NJKQCKDY6NL6/graph.json","fetch_events":"https://pith.science/api/pith-number/3KIMN5OSIX67I5NJKQCKDY6NL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/action/storage_attestation","attest_author":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/action/author_attestation","sign_citation":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/action/citation_signature","submit_replication":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/action/replication_record"}},"created_at":"2026-05-18T03:53:53.238450+00:00","updated_at":"2026-05-18T03:53:53.238450+00:00"}