{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VC364GUBHKU7JFECGMCGIQ6T6O","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":"05671b6f17246e8ab3f0dde7fa89a77587b07d20b8b556a7dee6f7442ce2f416","cross_cats_sorted":["cs.DC","cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-17T11:52:42Z","title_canon_sha256":"c552fd1f4fb57fbe51c7274ff57a3381d2f6d6ad56626a5ad210fcb1c040de0c"},"schema_version":"1.0","source":{"id":"1311.4150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4150","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4150v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4150","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"VC364GUBHKU7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VC364GUBHKU7JFEC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VC364GUB","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:b220f0ccc43d9cce9fdf799a1b26636e4e5f8c0a16696a25e48ab9badc957732","target":"graph","created_at":"2026-05-18T03:06: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":"To solve the big topic modeling problem, we need to reduce both time and space complexities of batch latent Dirichlet allocation (LDA) algorithms. Although parallel LDA algorithms on the multi-processor architecture have low time and space complexities, their communication costs among processors often scale linearly with the vocabulary size and the number of topics, leading to a serious scalability problem. To reduce the communication complexity among processors for a better scalability, we propose a novel communication-efficient parallel topic modeling architecture based on power law, which c","authors_text":"Jian-feng Yan, Jia Zeng, Yang Gao, Zhi-Qiang Liu","cross_cats":["cs.DC","cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-17T11:52:42Z","title":"Towards Big Topic Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4150","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:945a02317679c9ed0cdba11a5b5bb76096494ba303c8ea68d0a08e0cce455150","target":"record","created_at":"2026-05-18T03:06: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":"05671b6f17246e8ab3f0dde7fa89a77587b07d20b8b556a7dee6f7442ce2f416","cross_cats_sorted":["cs.DC","cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-17T11:52:42Z","title_canon_sha256":"c552fd1f4fb57fbe51c7274ff57a3381d2f6d6ad56626a5ad210fcb1c040de0c"},"schema_version":"1.0","source":{"id":"1311.4150","kind":"arxiv","version":1}},"canonical_sha256":"a8b7ee1a813aa9f4948233046443d3f3ad295484d5197bd60d6854d9aa1170af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8b7ee1a813aa9f4948233046443d3f3ad295484d5197bd60d6854d9aa1170af","first_computed_at":"2026-05-18T03:06:53.470278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:53.470278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"etbfzFxgcDT+Fy0njT4xkLWywN8v3/nLs/eDbV20ShoMDPTcTDdOz9cxUrUoG9Idji7a1qXT3oD2DPoVEqbmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:53.470895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:945a02317679c9ed0cdba11a5b5bb76096494ba303c8ea68d0a08e0cce455150","sha256:b220f0ccc43d9cce9fdf799a1b26636e4e5f8c0a16696a25e48ab9badc957732"],"state_sha256":"e47cc7ab8cd158edc5e208f51f8e101b54deca71338b66fffc76e8fa64ec08c2"}