{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V2T3345KYY4N75VWXISICFZ25X","short_pith_number":"pith:V2T3345K","canonical_record":{"source":{"id":"1704.08059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-26T11:17:51Z","cross_cats_sorted":[],"title_canon_sha256":"6303934468317f1b7482b8fd22bb32013200d0847a0e7e26e0d3343667984cb5","abstract_canon_sha256":"4cda0cb304b555cffb96256d62607f758f44afe53e2be6e168228d3630034ec2"},"schema_version":"1.0"},"canonical_sha256":"aea7bdf3aac638dff6b6ba2481173aedca28ad6fe75fff8c91ae367d8c66b982","source":{"kind":"arxiv","id":"1704.08059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08059","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08059v1","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08059","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"V2T3345KYY4N","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V2T3345KYY4N75VW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V2T3345K","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V2T3345KYY4N75VWXISICFZ25X","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-26T11:17:51Z","cross_cats_sorted":[],"title_canon_sha256":"6303934468317f1b7482b8fd22bb32013200d0847a0e7e26e0d3343667984cb5","abstract_canon_sha256":"4cda0cb304b555cffb96256d62607f758f44afe53e2be6e168228d3630034ec2"},"schema_version":"1.0"},"canonical_sha256":"aea7bdf3aac638dff6b6ba2481173aedca28ad6fe75fff8c91ae367d8c66b982","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:31.206921Z","signature_b64":"fxrFDwyGZ42SSVGZmWWU47mXR/C5EDyvnkdK0Z2upH1UrElPZ1C1gsKEoobJ3E3BlZqtlkzFx08V5WkF1x8dCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aea7bdf3aac638dff6b6ba2481173aedca28ad6fe75fff8c91ae367d8c66b982","last_reissued_at":"2026-05-18T00:45:31.206419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:31.206419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08059","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-18T00:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xc+1xumiLTPsOFz1mwuz4YGIU0yiqG+BE0F0AoToTuCPd7YCioyMmE9+oCIR8UMrn0oNz5qKQ8/lThaHI2RGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:04:10.763086Z"},"content_sha256":"de79e521a17ef8730af0d9a5166200e1640a6703d0ec9297c18ebad9769b1c91","schema_version":"1.0","event_id":"sha256:de79e521a17ef8730af0d9a5166200e1640a6703d0ec9297c18ebad9769b1c91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V2T3345KYY4N75VWXISICFZ25X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Riemannian Optimization for Skip-Gram Negative Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander Fonarev, Gleb Gusev, Ivan Oseledets, Oleksii Hrinchuk, Pavel Serdyukov","submitted_at":"2017-04-26T11:17:51Z","abstract_excerpt":"Skip-Gram Negative Sampling (SGNS) word embedding model, well known by its implementation in \"word2vec\" software, is usually optimized by stochastic gradient descent. However, the optimization of SGNS objective can be viewed as a problem of searching for a good matrix with the low-rank constraint. The most standard way to solve this type of problems is to apply Riemannian optimization framework to optimize the SGNS objective over the manifold of required low-rank matrices. In this paper, we propose an algorithm that optimizes SGNS objective using Riemannian optimization and demonstrates its su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08059","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-18T00:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFCbNu1kiGIRndXqSfc4IrNP6UfszI3iZzD0T3eIZ2uA7Rh18oSP2mH9OcYTt3E9aUMKnWEwd3kn8HFFA5sSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:04:10.763438Z"},"content_sha256":"e5dcc08f56338b962684e129e3e18de195dba0fa07adb6e576b587954796495f","schema_version":"1.0","event_id":"sha256:e5dcc08f56338b962684e129e3e18de195dba0fa07adb6e576b587954796495f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2T3345KYY4N75VWXISICFZ25X/bundle.json","state_url":"https://pith.science/pith/V2T3345KYY4N75VWXISICFZ25X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2T3345KYY4N75VWXISICFZ25X/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-09T01:04:10Z","links":{"resolver":"https://pith.science/pith/V2T3345KYY4N75VWXISICFZ25X","bundle":"https://pith.science/pith/V2T3345KYY4N75VWXISICFZ25X/bundle.json","state":"https://pith.science/pith/V2T3345KYY4N75VWXISICFZ25X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2T3345KYY4N75VWXISICFZ25X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V2T3345KYY4N75VWXISICFZ25X","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":"4cda0cb304b555cffb96256d62607f758f44afe53e2be6e168228d3630034ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-26T11:17:51Z","title_canon_sha256":"6303934468317f1b7482b8fd22bb32013200d0847a0e7e26e0d3343667984cb5"},"schema_version":"1.0","source":{"id":"1704.08059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08059","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08059v1","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08059","created_at":"2026-05-18T00:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"V2T3345KYY4N","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V2T3345KYY4N75VW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V2T3345K","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:e5dcc08f56338b962684e129e3e18de195dba0fa07adb6e576b587954796495f","target":"graph","created_at":"2026-05-18T00:45:31Z","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":"Skip-Gram Negative Sampling (SGNS) word embedding model, well known by its implementation in \"word2vec\" software, is usually optimized by stochastic gradient descent. However, the optimization of SGNS objective can be viewed as a problem of searching for a good matrix with the low-rank constraint. The most standard way to solve this type of problems is to apply Riemannian optimization framework to optimize the SGNS objective over the manifold of required low-rank matrices. In this paper, we propose an algorithm that optimizes SGNS objective using Riemannian optimization and demonstrates its su","authors_text":"Alexander Fonarev, Gleb Gusev, Ivan Oseledets, Oleksii Hrinchuk, Pavel Serdyukov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-26T11:17:51Z","title":"Riemannian Optimization for Skip-Gram Negative Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08059","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:de79e521a17ef8730af0d9a5166200e1640a6703d0ec9297c18ebad9769b1c91","target":"record","created_at":"2026-05-18T00:45:31Z","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":"4cda0cb304b555cffb96256d62607f758f44afe53e2be6e168228d3630034ec2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-26T11:17:51Z","title_canon_sha256":"6303934468317f1b7482b8fd22bb32013200d0847a0e7e26e0d3343667984cb5"},"schema_version":"1.0","source":{"id":"1704.08059","kind":"arxiv","version":1}},"canonical_sha256":"aea7bdf3aac638dff6b6ba2481173aedca28ad6fe75fff8c91ae367d8c66b982","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aea7bdf3aac638dff6b6ba2481173aedca28ad6fe75fff8c91ae367d8c66b982","first_computed_at":"2026-05-18T00:45:31.206419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:31.206419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fxrFDwyGZ42SSVGZmWWU47mXR/C5EDyvnkdK0Z2upH1UrElPZ1C1gsKEoobJ3E3BlZqtlkzFx08V5WkF1x8dCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:31.206921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de79e521a17ef8730af0d9a5166200e1640a6703d0ec9297c18ebad9769b1c91","sha256:e5dcc08f56338b962684e129e3e18de195dba0fa07adb6e576b587954796495f"],"state_sha256":"1c029baddccc5415d253ecaa6bfb68a3de900cd6062f26478c243ceaa85209c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3m41PpYEiw63fTamYTQbpwDjsfqucW+UDKmi8UAHkOEOx8GxEo4vH4TplJmbXbQYIkzm3Z9N1SrKIgedM9k1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:04:10.765297Z","bundle_sha256":"d514ecce91e26f195d9a44bd69911cdc8669cad32fae0ee49d0464fdcd2af75a"}}