{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VC364GUBHKU7JFECGMCGIQ6T6O","short_pith_number":"pith:VC364GUB","canonical_record":{"source":{"id":"1311.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-17T11:52:42Z","cross_cats_sorted":["cs.DC","cs.IR","stat.ML"],"title_canon_sha256":"c552fd1f4fb57fbe51c7274ff57a3381d2f6d6ad56626a5ad210fcb1c040de0c","abstract_canon_sha256":"05671b6f17246e8ab3f0dde7fa89a77587b07d20b8b556a7dee6f7442ce2f416"},"schema_version":"1.0"},"canonical_sha256":"a8b7ee1a813aa9f4948233046443d3f3ad295484d5197bd60d6854d9aa1170af","source":{"kind":"arxiv","id":"1311.4150","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VC364GUBHKU7JFECGMCGIQ6T6O","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-17T11:52:42Z","cross_cats_sorted":["cs.DC","cs.IR","stat.ML"],"title_canon_sha256":"c552fd1f4fb57fbe51c7274ff57a3381d2f6d6ad56626a5ad210fcb1c040de0c","abstract_canon_sha256":"05671b6f17246e8ab3f0dde7fa89a77587b07d20b8b556a7dee6f7442ce2f416"},"schema_version":"1.0"},"canonical_sha256":"a8b7ee1a813aa9f4948233046443d3f3ad295484d5197bd60d6854d9aa1170af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:53.470895Z","signature_b64":"etbfzFxgcDT+Fy0njT4xkLWywN8v3/nLs/eDbV20ShoMDPTcTDdOz9cxUrUoG9Idji7a1qXT3oD2DPoVEqbmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8b7ee1a813aa9f4948233046443d3f3ad295484d5197bd60d6854d9aa1170af","last_reissued_at":"2026-05-18T03:06:53.470278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:53.470278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4150","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:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Omf81An/zfc+mvnImN8WPaEp/3TZVaQMU4yyGsAu+IKv57l6BTscYR8pOqs2ae7OunA0xX/vwDKta+gqn/fzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:38:59.606729Z"},"content_sha256":"945a02317679c9ed0cdba11a5b5bb76096494ba303c8ea68d0a08e0cce455150","schema_version":"1.0","event_id":"sha256:945a02317679c9ed0cdba11a5b5bb76096494ba303c8ea68d0a08e0cce455150"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VC364GUBHKU7JFECGMCGIQ6T6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Big Topic Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian-feng Yan, Jia Zeng, Yang Gao, Zhi-Qiang Liu","submitted_at":"2013-11-17T11:52:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4150","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:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDzp04GH0waIGnY0Ir0QqpQvIeREikIFVQXURBWstc8X2KYFFJWP364pQX4bMEvRtSFj6j1mkafsRCloduNvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:38:59.607462Z"},"content_sha256":"b220f0ccc43d9cce9fdf799a1b26636e4e5f8c0a16696a25e48ab9badc957732","schema_version":"1.0","event_id":"sha256:b220f0ccc43d9cce9fdf799a1b26636e4e5f8c0a16696a25e48ab9badc957732"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VC364GUBHKU7JFECGMCGIQ6T6O/bundle.json","state_url":"https://pith.science/pith/VC364GUBHKU7JFECGMCGIQ6T6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VC364GUBHKU7JFECGMCGIQ6T6O/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-07T15:38:59Z","links":{"resolver":"https://pith.science/pith/VC364GUBHKU7JFECGMCGIQ6T6O","bundle":"https://pith.science/pith/VC364GUBHKU7JFECGMCGIQ6T6O/bundle.json","state":"https://pith.science/pith/VC364GUBHKU7JFECGMCGIQ6T6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VC364GUBHKU7JFECGMCGIQ6T6O/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdDC+URk5tyv4/oSObOnfAM3nWoDtSRucW0w37qnDujpRlJUTkGujvoMozVu0J2r9tiowki2wAGF34+4hQN/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:38:59.611180Z","bundle_sha256":"0c60fa3ec6d6498627317acdbdce0359c5951549aa885a04394144516eb6ab32"}}