{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:W2DEKMNW6BUHZJDEIB3OUD4UCC","short_pith_number":"pith:W2DEKMNW","canonical_record":{"source":{"id":"1310.4546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-10-16T23:28:53Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ab41f5bb6a50af5ed6b2de5b71ceb23ce1502d482c786756f2cd0a7a8f4e24e4","abstract_canon_sha256":"08bef1944f845244c5069673effb546b4fd2cdf9c9f2233ab295a02596f27585"},"schema_version":"1.0"},"canonical_sha256":"b6864531b6f0687ca4644076ea0f9410b933bf42001086c8ce168e008b927d63","source":{"kind":"arxiv","id":"1310.4546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4546","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4546v1","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4546","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"W2DEKMNW6BUH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W2DEKMNW6BUHZJDE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W2DEKMNW","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:W2DEKMNW6BUHZJDEIB3OUD4UCC","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-10-16T23:28:53Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ab41f5bb6a50af5ed6b2de5b71ceb23ce1502d482c786756f2cd0a7a8f4e24e4","abstract_canon_sha256":"08bef1944f845244c5069673effb546b4fd2cdf9c9f2233ab295a02596f27585"},"schema_version":"1.0"},"canonical_sha256":"b6864531b6f0687ca4644076ea0f9410b933bf42001086c8ce168e008b927d63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:13.812231Z","signature_b64":"/JdcAIPvgC4pt/nU4O/kol2/CVNTUY1B/G5U/JkqYtWj4F27MyMlKbik/EeoMlmTxN7FK4KfZqC2cYyR+x6gCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6864531b6f0687ca4644076ea0f9410b933bf42001086c8ce168e008b927d63","last_reissued_at":"2026-05-18T03:10:13.811642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:13.811642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4546","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:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjaZ25jrYP+L9ko+fP1yZWzzWcDS8vgqk5A4pME5qAJqjhaaQZf5wtDj3pGwCXzC+EdJs/UZwvIRbbQ1GbXpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:05:54.506533Z"},"content_sha256":"1cb1f4032faec81da84e13d5db14eaaf9bb134c781ac490e724358ead1f1b8c0","schema_version":"1.0","event_id":"sha256:1cb1f4032faec81da84e13d5db14eaaf9bb134c781ac490e724358ead1f1b8c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:W2DEKMNW6BUHZJDEIB3OUD4UCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Representations of Words and Phrases and their Compositionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Greg Corrado, Ilya Sutskever, Jeffrey Dean, Kai Chen, Tomas Mikolov","submitted_at":"2013-10-16T23:28:53Z","abstract_excerpt":"The recently introduced continuous Skip-gram model is an efficient method for learning high-quality distributed vector representations that capture a large number of precise syntactic and semantic word relationships. In this paper we present several extensions that improve both the quality of the vectors and the training speed. By subsampling of the frequent words we obtain significant speedup and also learn more regular word representations. We also describe a simple alternative to the hierarchical softmax called negative sampling. An inherent limitation of word representations is their indif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4546","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:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HzJYJ34lmgXOT81N813w28ZAAv8bX6+cXK+4vRcQ5sUTo3o70XHisf3f9QemGKfO9GO9JdrbgDSGbnLL1aXUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:05:54.506919Z"},"content_sha256":"63016ed93fa3022de31713586b56639538e248eba64737f69981cb348b600568","schema_version":"1.0","event_id":"sha256:63016ed93fa3022de31713586b56639538e248eba64737f69981cb348b600568"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2DEKMNW6BUHZJDEIB3OUD4UCC/bundle.json","state_url":"https://pith.science/pith/W2DEKMNW6BUHZJDEIB3OUD4UCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2DEKMNW6BUHZJDEIB3OUD4UCC/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-26T23:05:54Z","links":{"resolver":"https://pith.science/pith/W2DEKMNW6BUHZJDEIB3OUD4UCC","bundle":"https://pith.science/pith/W2DEKMNW6BUHZJDEIB3OUD4UCC/bundle.json","state":"https://pith.science/pith/W2DEKMNW6BUHZJDEIB3OUD4UCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2DEKMNW6BUHZJDEIB3OUD4UCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:W2DEKMNW6BUHZJDEIB3OUD4UCC","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":"08bef1944f845244c5069673effb546b4fd2cdf9c9f2233ab295a02596f27585","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-10-16T23:28:53Z","title_canon_sha256":"ab41f5bb6a50af5ed6b2de5b71ceb23ce1502d482c786756f2cd0a7a8f4e24e4"},"schema_version":"1.0","source":{"id":"1310.4546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4546","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4546v1","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4546","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"W2DEKMNW6BUH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W2DEKMNW6BUHZJDE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W2DEKMNW","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:63016ed93fa3022de31713586b56639538e248eba64737f69981cb348b600568","target":"graph","created_at":"2026-05-18T03:10:13Z","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":"The recently introduced continuous Skip-gram model is an efficient method for learning high-quality distributed vector representations that capture a large number of precise syntactic and semantic word relationships. In this paper we present several extensions that improve both the quality of the vectors and the training speed. By subsampling of the frequent words we obtain significant speedup and also learn more regular word representations. We also describe a simple alternative to the hierarchical softmax called negative sampling. An inherent limitation of word representations is their indif","authors_text":"Greg Corrado, Ilya Sutskever, Jeffrey Dean, Kai Chen, Tomas Mikolov","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-10-16T23:28:53Z","title":"Distributed Representations of Words and Phrases and their Compositionality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4546","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:1cb1f4032faec81da84e13d5db14eaaf9bb134c781ac490e724358ead1f1b8c0","target":"record","created_at":"2026-05-18T03:10:13Z","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":"08bef1944f845244c5069673effb546b4fd2cdf9c9f2233ab295a02596f27585","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2013-10-16T23:28:53Z","title_canon_sha256":"ab41f5bb6a50af5ed6b2de5b71ceb23ce1502d482c786756f2cd0a7a8f4e24e4"},"schema_version":"1.0","source":{"id":"1310.4546","kind":"arxiv","version":1}},"canonical_sha256":"b6864531b6f0687ca4644076ea0f9410b933bf42001086c8ce168e008b927d63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6864531b6f0687ca4644076ea0f9410b933bf42001086c8ce168e008b927d63","first_computed_at":"2026-05-18T03:10:13.811642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:13.811642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/JdcAIPvgC4pt/nU4O/kol2/CVNTUY1B/G5U/JkqYtWj4F27MyMlKbik/EeoMlmTxN7FK4KfZqC2cYyR+x6gCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:13.812231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cb1f4032faec81da84e13d5db14eaaf9bb134c781ac490e724358ead1f1b8c0","sha256:63016ed93fa3022de31713586b56639538e248eba64737f69981cb348b600568"],"state_sha256":"e1b1a6deeb6cd06a571e96c2bd3453e779b0f9bae8ebf5c171d24585cd60e1b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xU4AkC0fB6jnvjiJCrVqwkM/R9K6MS5v/s/0Y+KtlubdF912uEIBD+OEML+Jb3P/kurzENYMPh2Y/lOTk5DkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:05:54.510207Z","bundle_sha256":"21238876ba59ca0f6fd126a34346c0ceae0767178ee87bcd900da92824e2b9e4"}}