{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3KIMN5OSIX67I5NJKQCKDY6NL6","short_pith_number":"pith:3KIMN5OS","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"},"canonical_sha256":"da90c6f5d245fdf475a95404a1e3cd5fb2ea2e6764c596babc834c9468081d94","source":{"kind":"arxiv","id":"1206.2190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2190","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2190v1","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2190","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"3KIMN5OSIX67","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3KIMN5OSIX67I5NJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3KIMN5OS","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3KIMN5OSIX67I5NJKQCKDY6NL6","target":"record","payload":{"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"},"canonical_sha256":"da90c6f5d245fdf475a95404a1e3cd5fb2ea2e6764c596babc834c9468081d94","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"},"source_kind":"arxiv","source_id":"1206.2190","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FEpexIw0owo2SkJOBPGbfaolXN9PfdgeGiEyG0LMnrGh8DXGRb4V0cafxv0GgGrgduwXVK96no0jyDIvLCaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:04:00.010703Z"},"content_sha256":"e088bd96a50e4ffa8bd9459a97a0e9dacfa224cdcb0399746562a3fa7054363b","schema_version":"1.0","event_id":"sha256:e088bd96a50e4ffa8bd9459a97a0e9dacfa224cdcb0399746562a3fa7054363b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3KIMN5OSIX67I5NJKQCKDY6NL6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJvmEJgXmNPiQAixaHu8dSgh0Bp4XIxJCB+zuPAkCI6gTeQPMEgCMq6MX/CcwV6yG3H9xQ6RTvz+evyrtl8BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:04:00.011618Z"},"content_sha256":"5d5b714fe752077cb384f0989f2a16b4a10cf57349ce19a9965b133ae0740025","schema_version":"1.0","event_id":"sha256:5d5b714fe752077cb384f0989f2a16b4a10cf57349ce19a9965b133ae0740025"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/bundle.json","state_url":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T18:04:00Z","links":{"resolver":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6","bundle":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/bundle.json","state":"https://pith.science/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KIMN5OSIX67I5NJKQCKDY6NL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3KIMN5OSIX67I5NJKQCKDY6NL6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"97cc5df700688cc4181062329562658b0616aece625f93a2362c2745f6b92940","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-11T13:00:51Z","title_canon_sha256":"b4ebc4c25d355d4910aa765bda48fddf6ac978b2f959b519930bd73b6e4ae15d"},"schema_version":"1.0","source":{"id":"1206.2190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2190","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2190v1","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2190","created_at":"2026-05-18T03:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"3KIMN5OSIX67","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3KIMN5OSIX67I5NJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3KIMN5OS","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:5d5b714fe752077cb384f0989f2a16b4a10cf57349ce19a9965b133ae0740025","target":"graph","created_at":"2026-05-18T03:53:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jian-feng Yan, Jia Zeng, Yang Gao, Zhi-Qiang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-11T13:00:51Z","title":"Communication-Efficient Parallel Belief Propagation for Latent Dirichlet Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2190","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e088bd96a50e4ffa8bd9459a97a0e9dacfa224cdcb0399746562a3fa7054363b","target":"record","created_at":"2026-05-18T03:53:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"97cc5df700688cc4181062329562658b0616aece625f93a2362c2745f6b92940","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-11T13:00:51Z","title_canon_sha256":"b4ebc4c25d355d4910aa765bda48fddf6ac978b2f959b519930bd73b6e4ae15d"},"schema_version":"1.0","source":{"id":"1206.2190","kind":"arxiv","version":1}},"canonical_sha256":"da90c6f5d245fdf475a95404a1e3cd5fb2ea2e6764c596babc834c9468081d94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da90c6f5d245fdf475a95404a1e3cd5fb2ea2e6764c596babc834c9468081d94","first_computed_at":"2026-05-18T03:53:53.238329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:53.238329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TU1TnDTGx5/0zMZgfg8X+GdN0a3f3T6fY7nKOI1VCIeblGwwp79zrsiOGTOYR0AuTK08LvG0zAMg2k/Lpe3rBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:53.239028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e088bd96a50e4ffa8bd9459a97a0e9dacfa224cdcb0399746562a3fa7054363b","sha256:5d5b714fe752077cb384f0989f2a16b4a10cf57349ce19a9965b133ae0740025"],"state_sha256":"24df39add653b4593b11abd5d6b415aeb31936a828f5b90e8f1bd63a7cf42454"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BoLVCUZqPnN0WEqia8qJXKZUQPoDjMXLwqoiGJaaSVYDSLDIs+xQLFwDbgj2HAxwZLc3JYqu2g8Tcpup6By+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:04:00.015505Z","bundle_sha256":"88a7c071937052693c775c236b94901d71b25eff399c00206966426f57a07a6d"}}