{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PSPMCUI2PO7IV662CDDX36QHWT","short_pith_number":"pith:PSPMCUI2","canonical_record":{"source":{"id":"1510.08628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-29T10:33:20Z","cross_cats_sorted":["cs.DC","cs.IR","cs.LG"],"title_canon_sha256":"8f6c1e845ca6e6ec25abad57acee93fde71622f8fad22fb753faa7a9a2a30161","abstract_canon_sha256":"ed21e0188a02ec976f9a9f1d6d11e9f9b8e0f3e3fdc7161763e0ca7840c95a38"},"schema_version":"1.0"},"canonical_sha256":"7c9ec1511a7bbe8afbda10c77dfa07b4eb133f03c34f97c0c0f08f431b57dd9c","source":{"kind":"arxiv","id":"1510.08628","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08628","created_at":"2026-05-18T01:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08628v2","created_at":"2026-05-18T01:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08628","created_at":"2026-05-18T01:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"PSPMCUI2PO7I","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSPMCUI2PO7IV662","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSPMCUI2","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PSPMCUI2PO7IV662CDDX36QHWT","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-29T10:33:20Z","cross_cats_sorted":["cs.DC","cs.IR","cs.LG"],"title_canon_sha256":"8f6c1e845ca6e6ec25abad57acee93fde71622f8fad22fb753faa7a9a2a30161","abstract_canon_sha256":"ed21e0188a02ec976f9a9f1d6d11e9f9b8e0f3e3fdc7161763e0ca7840c95a38"},"schema_version":"1.0"},"canonical_sha256":"7c9ec1511a7bbe8afbda10c77dfa07b4eb133f03c34f97c0c0f08f431b57dd9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:44.092704Z","signature_b64":"z0Hq1yyx3Xto9JQbnR66YYJGVlWv/rIIjQEB6yNkveBKqChKaP8/1Cu6p4fnOLTJvg5d5PcV/wM31o3riX3wAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c9ec1511a7bbe8afbda10c77dfa07b4eb133f03c34f97c0c0f08f431b57dd9c","last_reissued_at":"2026-05-18T01:19:44.091819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:44.091819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08628","source_version":2,"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-18T01:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwYaJzYIjiMLUwaivW/ydNIt9p09XILGq6lzy5S9M2Swr2oVO5OBh6s5BQqozjQDEZgirDl3Z2pRJmMif4bBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:52:44.950189Z"},"content_sha256":"85495f2b10fc252dc8a3c7ecd779f5c4645a16aa47fb0e0eea0e3c14bc01c36c","schema_version":"1.0","event_id":"sha256:85495f2b10fc252dc8a3c7ecd779f5c4645a16aa47fb0e0eea0e3c14bc01c36c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PSPMCUI2PO7IV662CDDX36QHWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"WarpLDA: a Cache Efficient O(1) Algorithm for Latent Dirichlet Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jianfei Chen, Jun Zhu, Kaiwei Li, Wenguang Chen","submitted_at":"2015-10-29T10:33:20Z","abstract_excerpt":"Developing efficient and scalable algorithms for Latent Dirichlet Allocation (LDA) is of wide interest for many applications. Previous work has developed an O(1) Metropolis-Hastings sampling method for each token. However, the performance is far from being optimal due to random accesses to the parameter matrices and frequent cache misses.\n  In this paper, we first carefully analyze the memory access efficiency of existing algorithms for LDA by the scope of random access, which is the size of the memory region in which random accesses fall, within a short period of time. We then develop WarpLDA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08628","kind":"arxiv","version":2},"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-18T01:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cVsmS4WPf3gux/0JvlK1E1SXJn2xIf7iL9VbbU0yhCYFL/TBdHeXEw6/gyD0WZ4ab/tDtQ8QNHyIOrEdgUMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:52:44.950780Z"},"content_sha256":"bbdc9efea4d9df18198147610fef56503521dcf87f605eed39ccaa599ae71ffa","schema_version":"1.0","event_id":"sha256:bbdc9efea4d9df18198147610fef56503521dcf87f605eed39ccaa599ae71ffa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSPMCUI2PO7IV662CDDX36QHWT/bundle.json","state_url":"https://pith.science/pith/PSPMCUI2PO7IV662CDDX36QHWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSPMCUI2PO7IV662CDDX36QHWT/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-05-30T06:52:44Z","links":{"resolver":"https://pith.science/pith/PSPMCUI2PO7IV662CDDX36QHWT","bundle":"https://pith.science/pith/PSPMCUI2PO7IV662CDDX36QHWT/bundle.json","state":"https://pith.science/pith/PSPMCUI2PO7IV662CDDX36QHWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSPMCUI2PO7IV662CDDX36QHWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PSPMCUI2PO7IV662CDDX36QHWT","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":"ed21e0188a02ec976f9a9f1d6d11e9f9b8e0f3e3fdc7161763e0ca7840c95a38","cross_cats_sorted":["cs.DC","cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-29T10:33:20Z","title_canon_sha256":"8f6c1e845ca6e6ec25abad57acee93fde71622f8fad22fb753faa7a9a2a30161"},"schema_version":"1.0","source":{"id":"1510.08628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08628","created_at":"2026-05-18T01:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08628v2","created_at":"2026-05-18T01:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08628","created_at":"2026-05-18T01:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"PSPMCUI2PO7I","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSPMCUI2PO7IV662","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSPMCUI2","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:bbdc9efea4d9df18198147610fef56503521dcf87f605eed39ccaa599ae71ffa","target":"graph","created_at":"2026-05-18T01:19:44Z","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":"Developing efficient and scalable algorithms for Latent Dirichlet Allocation (LDA) is of wide interest for many applications. Previous work has developed an O(1) Metropolis-Hastings sampling method for each token. However, the performance is far from being optimal due to random accesses to the parameter matrices and frequent cache misses.\n  In this paper, we first carefully analyze the memory access efficiency of existing algorithms for LDA by the scope of random access, which is the size of the memory region in which random accesses fall, within a short period of time. We then develop WarpLDA","authors_text":"Jianfei Chen, Jun Zhu, Kaiwei Li, Wenguang Chen","cross_cats":["cs.DC","cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-29T10:33:20Z","title":"WarpLDA: a Cache Efficient O(1) Algorithm for Latent Dirichlet Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08628","kind":"arxiv","version":2},"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:85495f2b10fc252dc8a3c7ecd779f5c4645a16aa47fb0e0eea0e3c14bc01c36c","target":"record","created_at":"2026-05-18T01:19:44Z","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":"ed21e0188a02ec976f9a9f1d6d11e9f9b8e0f3e3fdc7161763e0ca7840c95a38","cross_cats_sorted":["cs.DC","cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-29T10:33:20Z","title_canon_sha256":"8f6c1e845ca6e6ec25abad57acee93fde71622f8fad22fb753faa7a9a2a30161"},"schema_version":"1.0","source":{"id":"1510.08628","kind":"arxiv","version":2}},"canonical_sha256":"7c9ec1511a7bbe8afbda10c77dfa07b4eb133f03c34f97c0c0f08f431b57dd9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c9ec1511a7bbe8afbda10c77dfa07b4eb133f03c34f97c0c0f08f431b57dd9c","first_computed_at":"2026-05-18T01:19:44.091819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:44.091819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z0Hq1yyx3Xto9JQbnR66YYJGVlWv/rIIjQEB6yNkveBKqChKaP8/1Cu6p4fnOLTJvg5d5PcV/wM31o3riX3wAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:44.092704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85495f2b10fc252dc8a3c7ecd779f5c4645a16aa47fb0e0eea0e3c14bc01c36c","sha256:bbdc9efea4d9df18198147610fef56503521dcf87f605eed39ccaa599ae71ffa"],"state_sha256":"0cd66040fddb4a86f80aafdf5ff8331fdc62bb3802e63e757a9f8d6c195d4fac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+C/fbb021T9F/Uod69pUqq4j9PqFnUcmw8BEoqL004J37j+H4OLpSDy3HQ1P902eLre0ntoIwfVN7eCn7vYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:52:44.953478Z","bundle_sha256":"26fcfd78707dd6af50d58052386c2265962d85885f3a6c25fc1d583b40484ff9"}}