{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MCDTEFXXG4HXQ7AOYKJQYBIX5H","short_pith_number":"pith:MCDTEFXX","canonical_record":{"source":{"id":"1604.04661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-15T23:40:04Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"6e9c58b8d6c5dc3a1ca8c46dac77bea5d8ad50ec29bd33a9573a7f9fdf2597be","abstract_canon_sha256":"ecd777b1a5afa2bec95ef2266f98160739259ceeff0042d442a0415e866358cc"},"schema_version":"1.0"},"canonical_sha256":"60873216f7370f787c0ec2930c0517e9d6ba4116af04741c8b7cd31097aa2c7a","source":{"kind":"arxiv","id":"1604.04661","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04661","created_at":"2026-05-18T01:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04661v2","created_at":"2026-05-18T01:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04661","created_at":"2026-05-18T01:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"MCDTEFXXG4HX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCDTEFXXG4HXQ7AO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCDTEFXX","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MCDTEFXXG4HXQ7AOYKJQYBIX5H","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-15T23:40:04Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"6e9c58b8d6c5dc3a1ca8c46dac77bea5d8ad50ec29bd33a9573a7f9fdf2597be","abstract_canon_sha256":"ecd777b1a5afa2bec95ef2266f98160739259ceeff0042d442a0415e866358cc"},"schema_version":"1.0"},"canonical_sha256":"60873216f7370f787c0ec2930c0517e9d6ba4116af04741c8b7cd31097aa2c7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:39.876930Z","signature_b64":"EsqABPvrlMw9osXBHvYtROt702qvg9pAr293pq/PBIQ3XRpbDjzdov4vewWlScftWU+EOw862IpydAFyi75kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60873216f7370f787c0ec2930c0517e9d6ba4116af04741c8b7cd31097aa2c7a","last_reissued_at":"2026-05-18T01:09:39.876546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:39.876546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04661","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:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDv7SExpmB4rsNAzwehznstSYyvhDhDzb3QYEidxAKkAxXcl/Xfb/nlWoQqmftkZFsBCVXTgiV565N64MVTAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:20:25.282842Z"},"content_sha256":"80e782333094b0b449de5418a702f96ff480092038e32951dca0f7024eeb1dcb","schema_version":"1.0","event_id":"sha256:80e782333094b0b449de5418a702f96ff480092038e32951dca0f7024eeb1dcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MCDTEFXXG4HXQ7AOYKJQYBIX5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallelizing Word2Vec in Shared and Distributed Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.DC","authors_text":"Nadathur Satish, Pradeep Dubey, Sheng Li, Shihao Ji","submitted_at":"2016-04-15T23:40:04Z","abstract_excerpt":"Word2Vec is a widely used algorithm for extracting low-dimensional vector representations of words. It generated considerable excitement in the machine learning and natural language processing (NLP) communities recently due to its exceptional performance in many NLP applications such as named entity recognition, sentiment analysis, machine translation and question answering. State-of-the-art algorithms including those by Mikolov et al. have been parallelized for multi-core CPU architectures but are based on vector-vector operations that are memory-bandwidth intensive and do not efficiently use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04661","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:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8UfjjF2LX8subk7bGad3WDBQMJoqAP2Lo3qYnjswF7Gw3v63tqee/QM7FAVxOMtdNxfse2SRV+Me3dsCmyFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:20:25.283431Z"},"content_sha256":"6fae647e55b590efb6ca3a44cd98afe57f9da0e977fe990e739d388e867f8fc5","schema_version":"1.0","event_id":"sha256:6fae647e55b590efb6ca3a44cd98afe57f9da0e977fe990e739d388e867f8fc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCDTEFXXG4HXQ7AOYKJQYBIX5H/bundle.json","state_url":"https://pith.science/pith/MCDTEFXXG4HXQ7AOYKJQYBIX5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCDTEFXXG4HXQ7AOYKJQYBIX5H/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-06T22:20:25Z","links":{"resolver":"https://pith.science/pith/MCDTEFXXG4HXQ7AOYKJQYBIX5H","bundle":"https://pith.science/pith/MCDTEFXXG4HXQ7AOYKJQYBIX5H/bundle.json","state":"https://pith.science/pith/MCDTEFXXG4HXQ7AOYKJQYBIX5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCDTEFXXG4HXQ7AOYKJQYBIX5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MCDTEFXXG4HXQ7AOYKJQYBIX5H","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":"ecd777b1a5afa2bec95ef2266f98160739259ceeff0042d442a0415e866358cc","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-15T23:40:04Z","title_canon_sha256":"6e9c58b8d6c5dc3a1ca8c46dac77bea5d8ad50ec29bd33a9573a7f9fdf2597be"},"schema_version":"1.0","source":{"id":"1604.04661","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04661","created_at":"2026-05-18T01:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04661v2","created_at":"2026-05-18T01:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04661","created_at":"2026-05-18T01:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"MCDTEFXXG4HX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCDTEFXXG4HXQ7AO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCDTEFXX","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:6fae647e55b590efb6ca3a44cd98afe57f9da0e977fe990e739d388e867f8fc5","target":"graph","created_at":"2026-05-18T01:09:39Z","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":"Word2Vec is a widely used algorithm for extracting low-dimensional vector representations of words. It generated considerable excitement in the machine learning and natural language processing (NLP) communities recently due to its exceptional performance in many NLP applications such as named entity recognition, sentiment analysis, machine translation and question answering. State-of-the-art algorithms including those by Mikolov et al. have been parallelized for multi-core CPU architectures but are based on vector-vector operations that are memory-bandwidth intensive and do not efficiently use","authors_text":"Nadathur Satish, Pradeep Dubey, Sheng Li, Shihao Ji","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-15T23:40:04Z","title":"Parallelizing Word2Vec in Shared and Distributed Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04661","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:80e782333094b0b449de5418a702f96ff480092038e32951dca0f7024eeb1dcb","target":"record","created_at":"2026-05-18T01:09:39Z","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":"ecd777b1a5afa2bec95ef2266f98160739259ceeff0042d442a0415e866358cc","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-15T23:40:04Z","title_canon_sha256":"6e9c58b8d6c5dc3a1ca8c46dac77bea5d8ad50ec29bd33a9573a7f9fdf2597be"},"schema_version":"1.0","source":{"id":"1604.04661","kind":"arxiv","version":2}},"canonical_sha256":"60873216f7370f787c0ec2930c0517e9d6ba4116af04741c8b7cd31097aa2c7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60873216f7370f787c0ec2930c0517e9d6ba4116af04741c8b7cd31097aa2c7a","first_computed_at":"2026-05-18T01:09:39.876546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:39.876546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EsqABPvrlMw9osXBHvYtROt702qvg9pAr293pq/PBIQ3XRpbDjzdov4vewWlScftWU+EOw862IpydAFyi75kBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:39.876930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04661","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80e782333094b0b449de5418a702f96ff480092038e32951dca0f7024eeb1dcb","sha256:6fae647e55b590efb6ca3a44cd98afe57f9da0e977fe990e739d388e867f8fc5"],"state_sha256":"6cf9432cbfffe2458330762908b4a3549b4357392a3441c17a440c831e0873e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mjUroaAXuZ/hMNnWNaLiUgy6MblvHC7sJauJHBhXuHie0broHxEkaVT214sXlm5p5K1gDZLzW2PPdG4SMAvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:20:25.286642Z","bundle_sha256":"2dbf7ea27c94a51b95ef34a1a1641d75fc9197cabcb7ce6f2751af917607874f"}}