{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WOA3RG2GE5WWTW5LQDBRFOXXZC","short_pith_number":"pith:WOA3RG2G","canonical_record":{"source":{"id":"1812.10401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-12-12T15:38:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"69d520e285eec74781326be137040bd624e10018a09e36518d134231b34d96bc","abstract_canon_sha256":"cef77c0bfe265d7e195ac90cc02e78a09ca47394b62776c2a04ccf7f06f78043"},"schema_version":"1.0"},"canonical_sha256":"b381b89b46276d69dbab80c312baf7c89135a51a1e3399cbd20274bce3a702f9","source":{"kind":"arxiv","id":"1812.10401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10401","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10401v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10401","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"WOA3RG2GE5WW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOA3RG2GE5WWTW5L","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOA3RG2G","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WOA3RG2GE5WWTW5LQDBRFOXXZC","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-12-12T15:38:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"69d520e285eec74781326be137040bd624e10018a09e36518d134231b34d96bc","abstract_canon_sha256":"cef77c0bfe265d7e195ac90cc02e78a09ca47394b62776c2a04ccf7f06f78043"},"schema_version":"1.0"},"canonical_sha256":"b381b89b46276d69dbab80c312baf7c89135a51a1e3399cbd20274bce3a702f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:24.175113Z","signature_b64":"ZER0Mzmqy3K7oBWojrTH1rVG7DQIQdL6JE21h0NyM3VLR0Mh7zxtr/VNW3wLvUqir0dsYbmlUBev20w8NLCGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b381b89b46276d69dbab80c312baf7c89135a51a1e3399cbd20274bce3a702f9","last_reissued_at":"2026-05-17T23:57:24.174414Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:24.174414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10401","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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhcCnCo/LECH83iNH49krAa1NRDptrI94Yto7gzpXnXozhVsIT43qgpchUPxAVLzp29XoYHn1BTjj012sL5HDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:31:00.695670Z"},"content_sha256":"a3842f18323d85ee1c2f6ae2e2735c5101b354a362cca6a5454e202d89ac84f3","schema_version":"1.0","event_id":"sha256:a3842f18323d85ee1c2f6ae2e2735c5101b354a362cca6a5454e202d89ac84f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WOA3RG2GE5WWTW5LQDBRFOXXZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Word Embedding based on Low-Rank Doubly Stochastic Matrix Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Denis Sedov, Zhirong Yang","submitted_at":"2018-12-12T15:38:46Z","abstract_excerpt":"Word embedding, which encodes words into vectors, is an important starting point in natural language processing and commonly used in many text-based machine learning tasks. However, in most current word embedding approaches, the similarity in embedding space is not optimized in the learning. In this paper we propose a novel neighbor embedding method which directly learns an embedding simplex where the similarities between the mapped words are optimal in terms of minimal discrepancy to the input neighborhoods. Our method is built upon two-step random walks between words via topics and thus able"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10401","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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdGMuCM5bpuH6a7u4HxLS42mZAeYvyFspm0sy/fVkJ0tTRwILiX1mMOnlBa+tk9Pbt7wXV4YQU0tJxdo3r9XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:31:00.696336Z"},"content_sha256":"ebf715ea1229f6b4dd58c2fa7301a203eef9af88a35ae7abe37baf5f76b3cb2c","schema_version":"1.0","event_id":"sha256:ebf715ea1229f6b4dd58c2fa7301a203eef9af88a35ae7abe37baf5f76b3cb2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOA3RG2GE5WWTW5LQDBRFOXXZC/bundle.json","state_url":"https://pith.science/pith/WOA3RG2GE5WWTW5LQDBRFOXXZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOA3RG2GE5WWTW5LQDBRFOXXZC/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-28T16:31:00Z","links":{"resolver":"https://pith.science/pith/WOA3RG2GE5WWTW5LQDBRFOXXZC","bundle":"https://pith.science/pith/WOA3RG2GE5WWTW5LQDBRFOXXZC/bundle.json","state":"https://pith.science/pith/WOA3RG2GE5WWTW5LQDBRFOXXZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOA3RG2GE5WWTW5LQDBRFOXXZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WOA3RG2GE5WWTW5LQDBRFOXXZC","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":"cef77c0bfe265d7e195ac90cc02e78a09ca47394b62776c2a04ccf7f06f78043","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-12-12T15:38:46Z","title_canon_sha256":"69d520e285eec74781326be137040bd624e10018a09e36518d134231b34d96bc"},"schema_version":"1.0","source":{"id":"1812.10401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10401","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10401v1","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10401","created_at":"2026-05-17T23:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"WOA3RG2GE5WW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOA3RG2GE5WWTW5L","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOA3RG2G","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ebf715ea1229f6b4dd58c2fa7301a203eef9af88a35ae7abe37baf5f76b3cb2c","target":"graph","created_at":"2026-05-17T23:57:24Z","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 embedding, which encodes words into vectors, is an important starting point in natural language processing and commonly used in many text-based machine learning tasks. However, in most current word embedding approaches, the similarity in embedding space is not optimized in the learning. In this paper we propose a novel neighbor embedding method which directly learns an embedding simplex where the similarities between the mapped words are optimal in terms of minimal discrepancy to the input neighborhoods. Our method is built upon two-step random walks between words via topics and thus able","authors_text":"Denis Sedov, Zhirong Yang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-12-12T15:38:46Z","title":"Word Embedding based on Low-Rank Doubly Stochastic Matrix Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10401","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:a3842f18323d85ee1c2f6ae2e2735c5101b354a362cca6a5454e202d89ac84f3","target":"record","created_at":"2026-05-17T23:57:24Z","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":"cef77c0bfe265d7e195ac90cc02e78a09ca47394b62776c2a04ccf7f06f78043","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-12-12T15:38:46Z","title_canon_sha256":"69d520e285eec74781326be137040bd624e10018a09e36518d134231b34d96bc"},"schema_version":"1.0","source":{"id":"1812.10401","kind":"arxiv","version":1}},"canonical_sha256":"b381b89b46276d69dbab80c312baf7c89135a51a1e3399cbd20274bce3a702f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b381b89b46276d69dbab80c312baf7c89135a51a1e3399cbd20274bce3a702f9","first_computed_at":"2026-05-17T23:57:24.174414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:24.174414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZER0Mzmqy3K7oBWojrTH1rVG7DQIQdL6JE21h0NyM3VLR0Mh7zxtr/VNW3wLvUqir0dsYbmlUBev20w8NLCGAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:24.175113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3842f18323d85ee1c2f6ae2e2735c5101b354a362cca6a5454e202d89ac84f3","sha256:ebf715ea1229f6b4dd58c2fa7301a203eef9af88a35ae7abe37baf5f76b3cb2c"],"state_sha256":"90de606b3229fa1fa1786f9fd11e22f54bd7ed67e617dce24846a8cf35f9e029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuBHzTHEFBEOQj6C5ouMSxBFSceKBdv1LWZr38pqvT7RCsw25MBmBQQ9+qxTnhYGyfdTKWq4nswSqHLitKEsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:31:00.700067Z","bundle_sha256":"3defc150fae00551edb511f0e6b974bf9cfb4374473e88b4016ce48673e25202"}}