{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EBE5NWRQRETAX2BLNR6RALU577","short_pith_number":"pith:EBE5NWRQ","canonical_record":{"source":{"id":"1812.03825","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T11:34:33Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"7529d70cff2509929a726ace6e23143e82ae9a4f987c39ceed03a589f1b3ba8d","abstract_canon_sha256":"629f48e05c4cf93c7bc6f65d50f80e43f92a25dddbca2a96513131deffffbe35"},"schema_version":"1.0"},"canonical_sha256":"2049d6da3089260be82b6c7d102e9dfff87a3dc11b6a151acea1e7e243de6aef","source":{"kind":"arxiv","id":"1812.03825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03825","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03825v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03825","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"EBE5NWRQRETA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EBE5NWRQRETAX2BL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EBE5NWRQ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EBE5NWRQRETAX2BLNR6RALU577","target":"record","payload":{"canonical_record":{"source":{"id":"1812.03825","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T11:34:33Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"7529d70cff2509929a726ace6e23143e82ae9a4f987c39ceed03a589f1b3ba8d","abstract_canon_sha256":"629f48e05c4cf93c7bc6f65d50f80e43f92a25dddbca2a96513131deffffbe35"},"schema_version":"1.0"},"canonical_sha256":"2049d6da3089260be82b6c7d102e9dfff87a3dc11b6a151acea1e7e243de6aef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:43.772777Z","signature_b64":"ycXNuSSsKH9Smp2bcK5zJSR8kYXVvqdJPqcH6dmOXAhbtqh1Uw0eyVxv8/IzD22pyTLdA7MESxDh7IpMAAbPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2049d6da3089260be82b6c7d102e9dfff87a3dc11b6a151acea1e7e243de6aef","last_reissued_at":"2026-05-17T23:58:43.772327Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:43.772327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.03825","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-17T23:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yk6ZK9SrGmBCYpXBK0sY7cuHUOqaQM7rQ8xcEKUJTvX+SBoc9ke1yxNd4d6L6v8paLHAn4G+u9EskJizFmK5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:06:39.949797Z"},"content_sha256":"47c0f0b73f9956cf6bc4028e59bf56c05c70924761c50b8255b61e1ccb541995","schema_version":"1.0","event_id":"sha256:47c0f0b73f9956cf6bc4028e59bf56c05c70924761c50b8255b61e1ccb541995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EBE5NWRQRETAX2BLNR6RALU577","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Training of Word Embeddings for Large Text Corpora","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Avishek Anand, Jan-Hendrik Zab, Jaspreet Singh, Megha Khosla, Zijian Zhang","submitted_at":"2018-12-07T11:34:33Z","abstract_excerpt":"Word embeddings are a powerful approach for analyzing language and have been widely popular in numerous tasks in information retrieval and text mining. Training embeddings over huge corpora is computationally expensive because the input is typically sequentially processed and parameters are synchronously updated. Distributed architectures for asynchronous training that have been proposed either focus on scaling vocabulary sizes and dimensionality or suffer from expensive synchronization latencies.\n  In this paper, we propose a scalable approach to train word embeddings by partitioning the inpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03825","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-17T23:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKHwEyBCS9bXJBsRElk4eJyHumVZdilj+xmVU6bNDjXBAFZDhU7FyywmKzJrZZfGfayyIl43OoIWtcyuFCq7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:06:39.950144Z"},"content_sha256":"a23a5cae903a2b9574fd955fa3c7e6bbc368d39a9b8d6710e76e476138f3ced1","schema_version":"1.0","event_id":"sha256:a23a5cae903a2b9574fd955fa3c7e6bbc368d39a9b8d6710e76e476138f3ced1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBE5NWRQRETAX2BLNR6RALU577/bundle.json","state_url":"https://pith.science/pith/EBE5NWRQRETAX2BLNR6RALU577/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBE5NWRQRETAX2BLNR6RALU577/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-27T17:06:39Z","links":{"resolver":"https://pith.science/pith/EBE5NWRQRETAX2BLNR6RALU577","bundle":"https://pith.science/pith/EBE5NWRQRETAX2BLNR6RALU577/bundle.json","state":"https://pith.science/pith/EBE5NWRQRETAX2BLNR6RALU577/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBE5NWRQRETAX2BLNR6RALU577/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EBE5NWRQRETAX2BLNR6RALU577","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":"629f48e05c4cf93c7bc6f65d50f80e43f92a25dddbca2a96513131deffffbe35","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T11:34:33Z","title_canon_sha256":"7529d70cff2509929a726ace6e23143e82ae9a4f987c39ceed03a589f1b3ba8d"},"schema_version":"1.0","source":{"id":"1812.03825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03825","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03825v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03825","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"EBE5NWRQRETA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EBE5NWRQRETAX2BL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EBE5NWRQ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:a23a5cae903a2b9574fd955fa3c7e6bbc368d39a9b8d6710e76e476138f3ced1","target":"graph","created_at":"2026-05-17T23:58:43Z","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":"Word embeddings are a powerful approach for analyzing language and have been widely popular in numerous tasks in information retrieval and text mining. Training embeddings over huge corpora is computationally expensive because the input is typically sequentially processed and parameters are synchronously updated. Distributed architectures for asynchronous training that have been proposed either focus on scaling vocabulary sizes and dimensionality or suffer from expensive synchronization latencies.\n  In this paper, we propose a scalable approach to train word embeddings by partitioning the inpu","authors_text":"Avishek Anand, Jan-Hendrik Zab, Jaspreet Singh, Megha Khosla, Zijian Zhang","cross_cats":["cs.DC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T11:34:33Z","title":"Asynchronous Training of Word Embeddings for Large Text Corpora"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03825","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:47c0f0b73f9956cf6bc4028e59bf56c05c70924761c50b8255b61e1ccb541995","target":"record","created_at":"2026-05-17T23:58:43Z","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":"629f48e05c4cf93c7bc6f65d50f80e43f92a25dddbca2a96513131deffffbe35","cross_cats_sorted":["cs.DC","stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2018-12-07T11:34:33Z","title_canon_sha256":"7529d70cff2509929a726ace6e23143e82ae9a4f987c39ceed03a589f1b3ba8d"},"schema_version":"1.0","source":{"id":"1812.03825","kind":"arxiv","version":1}},"canonical_sha256":"2049d6da3089260be82b6c7d102e9dfff87a3dc11b6a151acea1e7e243de6aef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2049d6da3089260be82b6c7d102e9dfff87a3dc11b6a151acea1e7e243de6aef","first_computed_at":"2026-05-17T23:58:43.772327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:43.772327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ycXNuSSsKH9Smp2bcK5zJSR8kYXVvqdJPqcH6dmOXAhbtqh1Uw0eyVxv8/IzD22pyTLdA7MESxDh7IpMAAbPCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:43.772777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.03825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47c0f0b73f9956cf6bc4028e59bf56c05c70924761c50b8255b61e1ccb541995","sha256:a23a5cae903a2b9574fd955fa3c7e6bbc368d39a9b8d6710e76e476138f3ced1"],"state_sha256":"691f494ff639cd944adb217a58b201babd16bce75cf496b1f18652f31ccb1561"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fidG+xhlKY+TYVBjOUmMuxf7+Drdi7OFiZg4G1Bc8PH6wNXD0mt6SDbDfLfMj1xTAEMmr3ZNBG6fmNO45KcACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:06:39.952038Z","bundle_sha256":"9b4adcd876fe860c8d343beb6e88b936b784bbb6766b5869dfea48058db523f9"}}